tla-ts 0.0.3-dev.fe239f8 → 0.0.4-dev.0be9567

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
@@ -12,24 +12,24 @@ const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenes
12
12
  `)}`,g=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,_=(e,t)=>p([{location:g(t),message:e}]);var v=class extends l{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},y=class extends l{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}};const b=`This was a Java StackOverflowError. It was probably the result
13
13
  of an incorrect recursive function definition that caused TLC to enter
14
14
  an infinite loop when trying to compute the function or its application
15
- to an element in its putative domain.`;var ee=class extends y{constructor(){super(b)}},x=class extends y{state;action;variables;constructor(e,t,n,r){super(e),this.state=t,this.action=n,this.variables=r}},S=class extends y{variable;constructor(e,t){super(e),this.variable=t}},C=class extends y{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},te=class extends y{state;constructor(e){super(`current state is not a legal state`),this.name=`TlaEvaluationError`,this.state=e}},ne=class extends l{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)})`}},re=class extends ne{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},ie=class extends l{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}},ae=class extends ie{unwound;constructor(e,t){super(e),this.name=`TlaJavaException`,this.unwound=t}};const oe=t=>r(t)??(t instanceof u?e.specParseError:t instanceof v?e.configParseError:t instanceof y?e.specEvaluationFailure:e.error);var se=class extends l{node;constructor(e,t){super(e),this.name=`PcalError`,this.node=t}},ce=class extends l{constructor(e){super(e),this.name=`PcalRuntimeError`}},w=class extends l{constructor(e){super(`You have discovered a bug in pcal.trans.\nSend the following information and the\ninput file to the current maintainer(s).\n\n -- ${e}.`),this.name=`PcalBugError`}};const T=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),E=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),D=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),le=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),ue=/* @__PURE__ */ new Map([[`∧`,`/\\`],[`∨`,`\\/`],[`¬`,`~`],[`⇒`,`=>`],[`⟹`,`=>`],[`≡`,`<=>`],[`⇔`,`<=>`],[`∈`,`\\in`],[`∉`,`\\notin`],[`⊆`,`\\subseteq`],[`⊂`,`\\subset`],[`⊇`,`\\supseteq`],[`⊃`,`\\supset`],[`∪`,`\\cup`],[`∩`,`\\cap`],[`×`,`\\X`],[`∀`,`\\A`],[`∃`,`\\E`],[`≠`,`#`],[`≤`,`<=`],[`≥`,`>=`],[`↦`,`|->`],[`→`,`->`],[`⟨`,`<<`],[`⟩`,`>>`],[`□`,`[]`],[`◇`,`<>`],[`≜`,`==`],[`′`,`'`],[`∘`,`\\o`],[`⋅`,`\\cdot`]]),de=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,fe=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),pe=e=>e.startsWith(`\\`)?parseInt(e.slice(2),fe.get(e[1].toLowerCase())):Number(e),me=/-{4,}[ \t]*MODULE\b/,he=e=>/[A-Za-z0-9_]/.test(e),ge=(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&&!E.has(n.slice(0,r.value));)r.value--;let i=E.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=ue.get(n);if(r)return{text:r,length:n.length};let i=le.find(n=>e.startsWith(n,t));return i?{text:D.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},O=e=>e!==void 0&&e>=`0`&&e<=`9`,_e=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},ve=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:_e(e,t+1,O);if(n===t+1||e[n]!==`>`)return 0;let r=_e(e,n+1,he),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return _e(e,i?r+1:r,e=>e===`.`)-t},ye=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,be=(e,t)=>t===` `?e+8-e%8:e+1,xe=e=>{let t=me.exec(e);if(!t)throw new u(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
16
- `),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=be(o.width,e[o.position]);return be(o.width,e[a.index])},c=(e,t,r,i)=>{let o=s();n.push({kind:e,text:t,spelling:i,line:a.line,column:o,endColumn:o+r-1}),a.index+=r},l=t=>{for(let n=0;n<t;n++)e[a.index]===`
15
+ to an element in its putative domain.`;var x=class extends y{constructor(){super(b)}},ee=class extends y{state;action;variables;constructor(e,t,n,r){super(e),this.state=t,this.action=n,this.variables=r}},te=class extends y{variable;constructor(e,t){super(e),this.variable=t}},S=class extends y{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},ne=class extends y{state;constructor(e){super(`current state is not a legal state`),this.name=`TlaEvaluationError`,this.state=e}},re=class extends l{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)})`}},ie=class extends re{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},C=class extends l{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}},ae=class extends C{unwound;constructor(e,t){super(e),this.name=`TlaJavaException`,this.unwound=t}};const oe=t=>r(t)??(t instanceof u?e.specParseError:t instanceof v?e.configParseError:t instanceof y?e.specEvaluationFailure:e.error);var se=class extends l{node;constructor(e,t){super(e),this.name=`PcalError`,this.node=t}},w=class extends l{constructor(e){super(e),this.name=`PcalRuntimeError`}},T=class extends l{constructor(e){super(`You have discovered a bug in pcal.trans.\nSend the following information and the\ninput file to the current maintainer(s).\n\n -- ${e}.`),this.name=`PcalBugError`}};const E=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),D=/* @__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`]]),ce=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),le=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),ue=/* @__PURE__ */ new Map([[`∃`,`\\E`],[`∀`,`\\A`],[`∷`,`::`],[`≜`,`==`],[`⟨`,`<<`],[`⟩_`,`>>_`],[`⟩`,`>>`],[`→`,`->`],[`←`,`<-`],[`↦`,`|->`],[`⁺`,`^+`],[`¬`,`~`],[`□`,`[]`],[`◇`,`<>`],[`∧`,`/\\`],[`∨`,`\\/`],[`∈`,`\\in`],[`≈`,`\\approx`],[`≔`,`:=`],[`≍`,`\\asymp`],[`◯`,`\\bigcirc`],[`⩴`,`::=`],[`●`,`\\bullet`],[`∩`,`\\cap`],[`⋅`,`\\cdot`],[`∘`,`\\o`],[`≅`,`\\cong`],[`∪`,`\\cup`],[`÷`,`\\div`],[`≐`,`\\doteq`],[`‥`,`..`],[`…`,`...`],[`≡`,`<=>`],[`‼`,`!!`],[`≥`,`>=`],[`≫`,`\\gg`],[`⇔`,`<=>`],[`⇒`,`=>`],[`⫤`,`=|`],[`↝`,`~>`],[`≤`,`<=`],[`≪`,`\\ll`],[`⊣`,`-|`],[`≠`,`#`],[`∉`,`\\notin`],[`⊙`,`\\odot`],[`⊖`,`\\ominus`],[`⊕`,`\\oplus`],[`⊘`,`\\oslash`],[`⊗`,`\\otimes`],[`⇸`,`-+->`],[`≺`,`\\prec`],[`⪯`,`\\preceq`],[`∝`,`\\propto`],[`⁇`,`??`],[`⊨`,`|=`],[`⊢`,`|-`],[`∼`,`\\sim`],[`≃`,`\\simeq`],[`⊓`,`\\sqcap`],[`⊔`,`\\sqcup`],[`⊏`,`\\sqsubset`],[`⊑`,`\\sqsubseteq`],[`⊐`,`\\sqsupset`],[`⊒`,`\\sqsupseteq`],[`⋆`,`\\star`],[`⊂`,`\\subset`],[`⊆`,`\\subseteq`],[`≻`,`\\succ`],[`⪰`,`\\succeq`],[`⊃`,`\\supset`],[`⊇`,`\\supseteq`],[`×`,`\\X`],[`⊎`,`\\uplus`],[`‖`,`||`],[`≀`,`\\wr`]]),de=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,fe=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),pe=e=>e.startsWith(`\\`)?parseInt(e.slice(2),fe.get(e[1].toLowerCase())):Number(e),me=/-{4,}[ \t]*MODULE\b/,he=e=>/[A-Za-z0-9_]/.test(e),O=(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&&!D.has(n.slice(0,r.value));)r.value--;let i=D.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=[e.slice(t,t+2),n].find(e=>ue.has(e));if(r!==void 0)return{text:ue.get(r)??``,length:r.length};let i=le.find(n=>e.startsWith(n,t));return i?{text:ce.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},ge=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),_e=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>ue.has(e)||ge.has(e));return n===void 0?void 0:{text:n,length:n.length}},ve=e=>e!==void 0&&e>=`0`&&e<=`9`,ye=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},be=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:ye(e,t+1,ve);if(n===t+1||e[n]!==`>`)return 0;let r=ye(e,n+1,he),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return ye(e,i?r+1:r,e=>e===`.`)-t},xe=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,Se=(e,t)=>t===` `?e+8-e%8:e+1,Ce=e=>{let t=me.exec(e);if(!t)throw new u(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
16
+ `),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=Se(o.width,e[o.position]);return Se(o.width,e[a.index])},c=(e,t,r,i)=>{let o=s();n.push({kind:e,text:t,spelling:i,line:a.line,column:o,endColumn:o+r-1}),a.index+=r},l=t=>{for(let n=0;n<t;n++)e[a.index]===`
17
17
  `&&(a.line++,a.lineStart=a.index+1),a.index++},d=t=>new u(`${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===`
18
18
  `||t===` `||t===` `||t===`\r`){l(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
19
- `,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 d(`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=_e(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`,`====`,_e(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||`
19
+ `,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 d(`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=ye(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`,`====`,ye(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||`
20
20
  \r`.includes(e[a.index]))throw d(`Unterminated string`);if(e[a.index]===`\\`){let t=e[a.index+1];if(t===void 0||!`ntrf\\"`.includes(t))throw d(`Invalid escape in string`);i.push({n:`
21
- `,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=de.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(he(t)){let t=e.slice(a.index,_e(e,a.index,he));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(a.index))?.[0]??t;c(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}let n=/^(_|\d+)/.exec(t)?.[0];if(n!==void 0&&!/[A-Za-z]/.test(t)){c(n===`_`?`Operator`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){c(`Keyword`,t.slice(0,3),3);continue}let i=r.get(t)??t;r.set(i,i),c(T.has(t)?`Keyword`:`Identifier`,i,t.length);continue}let o=ve(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let u=ge(e,a.index);if(u){let t=e.slice(a.index,a.index+u.length);c(`Operator`,u.text,u.length,t===u.text?void 0:t)}else throw d(`Unexpected character ${JSON.stringify(t)}`)}let f=s();return n.push({kind:`End`,text:``,line:a.line,column:f,endColumn:f}),n},Se=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],Ce=Se.map(e=>e[0]),we=new Map(Ce.map((e,t)=>[e,t]).reverse()),k=e=>{let t=we.get(e);if(t===void 0)throw new l(`Unknown SANY token kind ${e}`);return t},Te=new Map(Se.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),A=Math.max(...[...Te.keys()].map(e=>e.length)),Ee=Array.from({length:A},(e,t)=>A-t),De=/----+ *MODULE/y,Oe=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],ke=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),Ae=ke(String.raw`\.\/\\`),je=ke(String.raw`\.\\\/`),Me=String.raw`<(?:[0-9]+|\+|\*)>`,Ne=[[`_BM0`,[De]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,Ae],[`BOR`,je],[`IDENTIFIER`,Oe],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Me}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Me,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Me}(?:\*\.*|-\.*|\.+)`,`y`)]]],Pe=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[De]]],Fe=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[De]],[`BAND`,Ae],[`BOR`,je],[`IDENTIFIER`,Oe]],Ie=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Le=(e,t,n)=>e.map(([e,r])=>({kind:k(e),length:Math.max(...r.map(e=>Ie(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),Re=(e,t)=>{let n=Ee.find(n=>Te.has(e.slice(t,t+n))),r=Le(Ne,e,t);if(n===void 0)return r;let i={kind:Te.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},ze=e=>e+8-e%8,j=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
21
+ `,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=de.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(he(t)){let t=e.slice(a.index,ye(e,a.index,he));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(a.index))?.[0]??t;c(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}let n=/^(_|\d+)/.exec(t)?.[0];if(n!==void 0&&!/[A-Za-z]/.test(t)){c(n===`_`?`Operator`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){c(`Keyword`,t.slice(0,3),3);continue}let i=r.get(t)??t;r.set(i,i),c(E.has(t)?`Keyword`:`Identifier`,i,t.length);continue}if(`ℕℤℝ`.includes(t)){c(`Identifier`,r.get(t)??t,1),r.set(t,t);continue}let o=be(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let u=O(e,a.index);if(u){let t=e.slice(a.index,a.index+u.length);c(`Operator`,u.text,u.length,t===u.text?void 0:t)}else throw d(`Unexpected character ${JSON.stringify(t)}`)}let f=s();return n.push({kind:`End`,text:``,line:a.line,column:f,endColumn:f}),n},we=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],k=we.map(e=>e[0]),Te=new Map(k.map((e,t)=>[e,t]).reverse()),A=e=>{let t=Te.get(e);if(t===void 0)throw new l(`Unknown SANY token kind ${e}`);return t},Ee=new Map(we.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),De=Math.max(...[...Ee.keys()].map(e=>e.length)),Oe=Array.from({length:De},(e,t)=>De-t),ke=/----+ *MODULE/y,Ae=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],je=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),Me=je(String.raw`\.\/\\`),Ne=je(String.raw`\.\\\/`),Pe=String.raw`<(?:[0-9]+|\+|\*)>`,Fe=[[`_BM0`,[ke]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,Me],[`BOR`,Ne],[`IDENTIFIER`,Ae],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Pe}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Pe,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Pe}(?:\*\.*|-\.*|\.+)`,`y`)]]],Ie=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[ke]]],Le=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[ke]],[`BAND`,Me],[`BOR`,Ne],[`IDENTIFIER`,Ae]],j=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Re=(e,t,n)=>e.map(([e,r])=>({kind:A(e),length:Math.max(...r.map(e=>j(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),ze=(e,t)=>{let n=Oe.find(n=>Ee.has(e.slice(t,t+n))),r=Re(Fe,e,t);if(n===void 0)return r;let i={kind:Ee.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},Be=e=>e+8-e%8,Ve=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
22
22
  `?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
23
- `?r.isAfterLf=!0:i===` `&&(r.column=ze(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},Be=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Ve=new Set([...Te.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),He=(e,t)=>{let n=0;for(;Ve.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,Ie(Be,e,t)))},Ue=e=>{let t=j(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(k(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?Ke(o,s,e[a],i):t.lines[n]===o?e[a]===`
24
- `||e[a]===`\r`?Ke(o+1,0,void 0,i):Ke(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=Le(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,Ce[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),Ce[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(Pe);if(n.mode===`PRAGMA`)return s(Fe);for(;n.offset<e.length;){let t=n.offset;if(`
25
- \r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=Re(e,t);if(i.length===0){let n=He(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},We=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
26
- `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Ge=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>We.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Ke=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Ge(n)}" (${n.charCodeAt(0)}), `}after : "${Ge(r)}"`,qe=e=>{let t=Ue(e);for(let e=t();typeof e!=`string`&&e.kind!==k(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?ze(e):e+1,e.beginColumn);return Ke(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Je=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],Ye=/* @__PURE__ */ new Set([...Je,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),Xe=[`TYPE`,`TYPE_CONSTRAINT`],Ze=/* @__PURE__ */ new Set([...Je,...Xe]),Qe=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],$e=e=>{let t=[],n={index:0,line:1,lineStart:0},r=(r,i)=>{t.push({kind:`Error`,text:Ke(n.line,r-n.lineStart+1,e[r],i),line:n.line})},i=e=>{t.push({kind:`Error`,text:Ke(n.line+1,0,void 0,e),line:n.line})},a=e=>{let t=e.split(`
23
+ `?r.isAfterLf=!0:i===` `&&(r.column=Be(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},He=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Ue=new Set([...Ee.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),We=(e,t)=>{let n=0;for(;Ue.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,j(He,e,t)))},Ge=e=>{let t=Ve(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(A(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?Je(o,s,e[a],i):t.lines[n]===o?e[a]===`
24
+ `||e[a]===`\r`?Je(o+1,0,void 0,i):Je(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=Re(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,k[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),k[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(Ie);if(n.mode===`PRAGMA`)return s(Le);for(;n.offset<e.length;){let t=n.offset;if(`
25
+ \r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=ze(e,t);if(i.length===0){let n=We(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},Ke=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
26
+ `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),qe=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Ke.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Je=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${qe(n)}" (${n.charCodeAt(0)}), `}after : "${qe(r)}"`,Ye=e=>{let t=Ge(e);for(let e=t();typeof e!=`string`&&e.kind!==A(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?Be(e):e+1,e.beginColumn);return Je(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Xe=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],Ze=/* @__PURE__ */ new Set([...Xe,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),Qe=[`TYPE`,`TYPE_CONSTRAINT`],$e=/* @__PURE__ */ new Set([...Xe,...Qe]),et=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],tt=e=>{let t=[],n={index:0,line:1,lineStart:0},r=(r,i)=>{t.push({kind:`Error`,text:Je(n.line,r-n.lineStart+1,e[r],i),line:n.line})},i=e=>{t.push({kind:`Error`,text:Je(n.line+1,0,void 0,e),line:n.line})},a=e=>{let t=e.split(`
27
27
  `);t.length>1&&(n.line+=t.length-1,n.lineStart=n.index+e.length-t[t.length-1].length),n.index+=e.length};for(;n.index<e.length;){let o=e.slice(n.index),s=/^\s+/.exec(o)?.[0];if(s){a(s);continue}if(o.startsWith(`\\*`)){let e=o.indexOf(`
28
- `);a(e===-1?o:o.slice(0,e));continue}if(o.startsWith(`(*`)){let e=o.indexOf(`*)`);if(e===-1)return a(o),i(``),t;a(o.slice(0,e+2));continue}let c=n.line,l=/^\d+(?![A-Za-z_])/.exec(o)?.[0];if(l){t.push({kind:`Number`,text:l,line:c}),a(l);continue}let u=/^[A-Za-z0-9_]+/.exec(o)?.[0];if(u){t.push({kind:`Word`,text:u,line:c}),a(u);continue}if(o.startsWith(`"`)){let s=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(o),l=s?.[0]??`"`;if(s?.[2]!==`"`)return a(l),n.index===e.length?i(`${l}\n`):r(n.index,l),t;t.push({kind:`String`,text:s[1],line:c}),a(l);continue}let d=Qe.find(e=>o.startsWith(e));if(d){t.push({kind:`Symbol`,text:d,line:c}),a(d);continue}let f=ge(e,n.index);if(!f)return r(n.index,``),t;t.push({kind:`Word`,text:f.text,line:c}),a(e.slice(n.index,n.index+f.length))}return t.push({kind:`End`,text:``,line:n.line}),t},et=(e,t)=>new v(`TLC found an error in the configuration file at line ${e}\n${t}`),tt=(e,t)=>et(e,`The keyword ${t} appeared twice.`),nt=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),rt=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),it=(e,t=`master`)=>{let n=t===`1.7.4`?Ze:Ye,r=$e(e),i={index:0},a={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},o={isSet:!1},s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i.index++,r.length-1)];if(e.kind===`Error`)throw new v(`TLC found an error in the configuration file:\n${e.text}`);return e},l=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={token:c()};if(t.token.text!==`}`)for(;e.push(l(t.token)),t.token=c(),t.token.text===`,`;)t.token=c();if(t.token.text!==`}`)throw et(t.token.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 et(e.line,`It was expecting a value, but did not find it.`)},u=e=>{let t=c();if(t.kind===`End`)throw et(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw et(n.line,`It was expecting ], but did not find it.`);return t.text},d=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let r={token:c(),name:t.text};for(;r.token.text===`!`;)r.name=`${r.name}!${c().text}`,r.token=c();let i=r.name;if(r.token.text===`<-`){if(r.token=c(),r.token.text===`[`){let e=u(`<-`),t=c();if(t.kind===`End`)throw et(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:i,target:t.text,module:e});continue}if(r.token.kind===`End`)throw et(r.token.line,`Expected an identifier after <-.`);a.substitutions.push({name:i,target:r.token.text});continue}let o=[],s=r.token.text===`(`;if(s){for(;o.push(l(c())),r.token=c(),r.token.text===`,`;);if(r.token.text!==`)`)throw et(e,``);r.token=c()}if(r.token.text!==`=`)throw et(r.token.line,`It was expecting = or <-, but did not find it.`);r.token=c();let d=r.token.text===`[`?u(`=`):void 0,f=l(d===void 0?r.token:c());a.constants.push({name:i,value:f,...s&&{args:o},...d!==void 0&&{module:d}})}},f=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},p={token:c()};for(;p.token.kind!==`End`;){let e=p.token.text,t=p.token.line,r=n.has(e)?nt.get(e):void 0,i=n.has(e)?rt.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw et(t,`The keyword ${e} was not followed by an identifier.`);return n};if(r!==void 0){let n=l();if(a[r]!==void 0)throw tt(t,e);a[r]=n.text,p.token=c()}else if(i!==void 0)p.token=f(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)p.token=d(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw et(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o.isSet)throw tt(t,e);o.isSet=!0,a.checkDeadlock=n.text===`TRUE`,p.token=c()}else{if(!n.has(e)||!Xe.includes(e))throw et(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw tt(t,e);s.add(e),p.token=c()}}return a},M={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:` `}},at=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},ot=e=>e!==void 0&&/^\p{Nd}$/u.test(e),st=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),ct=e=>{let t=t=>{let n=_e(e,t,at);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=_e(e,t,ot);if(e.startsWith(`..`,n)&&ot(e[n+2]))return{kind:`Constant`,first:t,last:_e(e,n+2,ot)-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=ot(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:_e(e,t+1,ot)-1,children:[]};if(st(n))return{kind:`Constant`,first:t,last:_e(e,t,st)-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)},N=e=>{let t=e.length===0?void 0:ct(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=M[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},P=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,lt=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`,ut=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:P(e)?`set`:`function`,dt=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new C(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ft={isUsed:!1},pt=(e,t)=>(ft.isUsed=!0,e.writtenKeys=t,e),mt=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[yr(e.domain,t)]]),ht=(e,t,n)=>pt(Zt(e,t),n),gt=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(gt);e.writtenKeys=void 0,e.range.forEach(gt)}},_t=e=>e.every(e=>typeof e==`string`),vt=(e,t)=>e.length>0&&t.length>0&&_t(e)!==_t(t),yt=(e,t)=>{ft.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return vt(n,r)?yn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=It(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=It(i[e],a[e]);if(t!==0)return t}return 0},bt=(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=It(n[e],r[e]);if(t!==0)return t}return 0},xt=e=>I(e)?e.type:void 0,St=(e,t,n)=>{let r=xt(e),i=xt(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 y(`Attempted to ${a} the differently-typed model values ${z(e)} and ${z(t)}`)}throw r===void 0?new y(`Attempted to ${a} the typed model value ${z(t)} and the non-model value\n${z(e)}`):new y(`Attempted to ${a}${n?``:` the`} typed model value ${z(e)} and non-model value\n${z(t)}`)},Ct={ranks:Object.create(null),size:0},wt=e=>{Ct.ranks=Object.create(null),Ct.size=0,Lt.clear();for(let t of e)Dt(t)},Tt={is174:!1},Et=e=>{Tt.is174=e===`1.7.4`},Dt=e=>(Ct.ranks[e]===void 0&&(Ct.ranks[e]=Ct.size++),e),Ot=()=>Ct.size,kt=e=>Ct.ranks[Dt(e)],At=(e,t)=>{if(e===t)return 0;let n=Ct.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},jt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Mt=(e,t)=>(jt(e)||jt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Nt=(e,t,n)=>{if(!jt(e))throw new y(`Attempted to ${n} the set ${z(L(e)?R(e):e,!0)} with the value:\n${z(t,!0)}`);if(!jt(t))throw new y(`Attempted to compare overridden value ${z(e,!0)} with non-overridden value:\n${z(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 y(`Attempted to compare ${z(e,!0)} with the value\n${z(t,!0)}`)},Pt={kind:`InfiniteSet`,name:`Any`},Ft=e=>{throw new y(`Attempted to compare ANY with the value\n${z(e)}`)},It=(e,t)=>{if(e===t)return ft.isUsed&&gt(e),e===Pt?Ft(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return yt(e,t);if(n===`Set`&&r===`Set`)return bt(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&&St(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return St(e,t,!1),n===`ModelValue`?-1:1;if(e===Pt||t===Pt)return Ft(e===Pt?t:e);if(P(e)&&P(t)&&Mt(e,t))return Nt(e,t,`compare`);let i=P(e);if(i!==P(t))throw new y(`Attempted to compare ${ut(e)} ${z(e)} with ${ut(t)} ${z(t)}`);return i?bt(R(e),R(t)):yt(Dr(e),Dr(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return At(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(St(e,t,!1),I(e))return-1;if(I(t))return 1;throw new y(`Attempted to compare ${ut(e)} ${z(e)} with ${ut(t)} ${z(t)}`)},Lt=/* @__PURE__ */ new Map,Rt=e=>{let t=Lt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:kt(e)};return Lt.set(e,n),n},zt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),Bt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0}),Vt={isPresent:!1},Ht=(e,t)=>(t===`lambda`&&(Vt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Ut=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Wt=e=>Ht(e,`lambda`),Gt=/* @__PURE__ */ new WeakSet,Kt=/* @__PURE__ */ new WeakSet,qt={isPresent:!1},Jt=e=>(qt.isPresent=!0,e),Yt=e=>{qt.isPresent&&typeof e==`object`&&Kt.add(e)},Xt=e=>{!Vt.isPresent&&!qt.isPresent||typeof e!=`object`||Gt.has(e)||(Gt.add(e),e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Xt),e.range.forEach(Xt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Xt):P(e)&&L(e)&&(Yt(e),R(e).elements.forEach(Xt)))},Zt=(e,t)=>Ht(Bt(e,t),`record`),Qt=(e,t)=>{if(Yt(e),e===t)return ft.isUsed&&gt(e),e!==Pt||Ft(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&St(e,t,!0),It(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 yt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return bt(e,t)===0;if(I(e)||I(t))return St(e,t,!0),I(e)&&I(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Qt(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=pr(e.domain),r=pr(t.domain);if(n||r)return n===r;let i=pr(e.range),a=pr(t.range);return i||a?i===a:Qt(e.domain,t.domain)&&Qt(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(pr(e))return pr(t);if(pr(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]&&Qt(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return pr(e)?pr(t):!pr(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Qt(e,t.factors[n]));let n=P(e)&&P(t)&&!(L(e)&&L(t));if(n&&Mt(e,t))return Nt(e,t,`check equality of`)===0;if(n){if(!jt(e)){let n=R(e);if(!jt(t))return bt(n,R(t))===0}return ri(e)===ri(t)}return It(e,t)===0},$t=e=>{let t=(e,t)=>e===t||e.length===t.length&&e.every((e,r)=>n(e,t[r])),n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):ri(n)===ri(r);return n},en=$t(!1),tn=$t(!0),nn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},rn=e=>{if(!F(e))return;let t=Dr(e);return{domain:t.domain,range:t.range,low:nn(t.domain)}},an=e=>{if(!F(e))return;let t=Dr(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},on=(e,t)=>{if(xt(e)!==void 0)throw new y(`Attempted to compare the typed model value ${z(e)} and the non-model value\n${z(t)}`);return 1},sn=(e,t)=>{if(xt(e)!==void 0)throw new y(`Attempted to check equality of the typed model value ${z(e)} and the non-model value\n${z(t)}`);return!1},cn=(e,t)=>{let n=xt(e);if(n===void 0)return I(t)?e.rank-t.rank:-1;if(!I(t))throw new y(`Attempted to compare the typed model value ${z(e)} and non-model value\n${z(t)}`);let r=xt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to compare the differently-typed model values ${z(e)} and ${z(t)}`);return e.rank-t.rank},ln=(e,t)=>{let n=xt(e);if(n===void 0)return I(t)&&e.name===t.name;if(!I(t))throw new y(`Attempted to check equality of typed model value ${z(e)} and non-model value\n${z(t)}`);let r=xt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to check equality of the differently-typed model values ${z(e)} and ${z(t)}`);return e.name===t.name},un={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`}},dn=(e,t,n)=>{let r=un[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${z(e)} with ${r.other}:\n${z(t)}`},fn=(e,t,n)=>{let r=rn(n);if(!r){if(I(n))return on(n,t);throw new y(`Attempted to compare the function ${z(t)} with the value:\n${z(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>pn(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 pn(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 y(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${z(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},pn=(e,t)=>{for(let n=0;n<e.length;n++){let r=yn(e[n],t[n]);if(r!==0)return r}return 0},mn=(e,t)=>{let n=Dr(e);if(e.kind===`Function`&&br(n)!==void 0){let r=F(t)?br(t):void 0;return r?n.range.length-r.length||pn(n.range,r):fn({...n,low:1},e,t)}if(Ut(e)===`record`){let r=an(t);if(!r){if(I(t))return on(t,e);throw new y(`Attempted to compare record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length-r.domain.length||pn(n.domain,r.domain)||pn(n.range,r.range)}return fn({...n,low:nn(n.domain)},e,t)},hn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),gn=(e,t)=>jt(e)||jt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),_n=(e,t)=>{let n=hn(t)?t:R(t);return{elements:R(e).elements,otherElements:R(n).elements}},vn=(e,t)=>{if(gn(e,t))return It(e,t);if(!hn(e))return vn(R(e),t);if(!P(t)){if(I(t))return on(t,e);throw new y(`Attempted to compare the set ${z(e)} with the value:\n${z(t)}`)}let n=_n(e,t);return n.elements.length-n.otherElements.length||pn(n.elements,n.otherElements)},yn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return It(e,t);if(I(t))return on(t,e);throw new y(dn(e,t,!1))}return e.kind===`ModelValue`?cn(e,t):F(e)?mn(e,t):vn(e,t)},bn=(e,t)=>e.every((e,n)=>wn(e,t[n])),xn=(e,t,n)=>{let r=rn(n);if(!r){if(I(n))return sn(n,t);throw new y(`Attempted to check equality of the function ${z(t)} with the value:\n${z(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)&&bn(e.range,r.range);let i=e.low??r.low;return i===void 0?bn(e.domain,r.domain)&&bn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new y(`Attempted to compare an integer with non-integer:\n${z(e)}.`);return e===i+t})&&bn(e.range,r.range)},Sn=(e,t)=>{let n=Dr(e);if(e.kind===`Function`&&br(n)!==void 0){let r=F(t)?br(t):void 0;return r?n.range.length===r.length&&bn(n.range,r):xn({...n,low:1},e,t)}if(Ut(e)===`record`){let r=an(t);if(!r){if(I(t))return sn(t,e);throw new y(`Attempted to check equality of record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length===r.domain.length&&bn(n.domain,r.domain)&&bn(n.range,r.range)}return xn({...n,low:nn(n.domain)},e,t)},Cn=(e,t)=>{if(gn(e,t))return Qt(e,t);if(!hn(e))return Cn(R(e),t);if(!P(t)){if(I(t))return sn(t,e);throw new y(`Attempted to check equality of the set ${z(e)} with the value:\n${z(t)}`)}let n=_n(e,t);return n.elements.length===n.otherElements.length&&bn(n.elements,n.otherElements)},wn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(I(t))return sn(t,e);throw new y(dn(e,t,!0))}return e.kind===`ModelValue`?ln(e,t):F(e)?Sn(e,t):Cn(e,t)},Tn=e=>{let t=[];for(let n of e){let e=Dn(n,t);e.isFound||t.splice(e.index,0,n)}return t},En=(e,t)=>{let n=Sr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Dn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=En(e,()=>yn(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},On=(e,t)=>t.some(t=>En(t,()=>wn(t,e))),kn=/* @__PURE__ */ new WeakSet,An=e=>{typeof e==`object`&&(e.kind===`Set`&&(kn.add(e),e.elements.forEach(An)),e.kind===`Function`&&(e.domain.forEach(An),e.range.forEach(An)))},jn=(e,t)=>Cr(()=>Qt(e,t),()=>wn(e,t)),Mn=e=>{for(let t=1;t<e.length;t++)if(It(e[t-1],e[t])>=0)return!1;return!0},Nn=e=>{for(let t=1;t<e.length;t++)Yt(e[t]);if(e.length<2||Mn(e))return zt(e);let t=[...e].sort(It),n=[t[0]];for(let e=1;e<t.length;e++)It(n[n.length-1],t[e])!==0&&n.push(t[e]);return zt(n)},Pn=e=>Cr(()=>Nn(e),()=>({kind:`MixedSet`,elements:e})),Fn=zt([]),In=(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&&It(r[a],t)<0;)a++;a<r.length&&It(r[a],t)===0||i.push(t)}return i.length===n.length?e:zt(i)},Ln=(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&&It(r[a],t)<0;)a++;a<r.length&&It(r[a],t)===0&&i.push(t)}return i.length===n.length?e:zt(i)},Rn=(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=It(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=zt(i);if(e.hash!==0&&e.hash!==Ur){let t=e.hash,n=0;for(;n<a.length;n++){let e=Jr(a[n]);if(e===Ur)break;t=t+Vr(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Qr(a[e])|0;c.fingerprint=t}return c},zn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>It(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&It(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Bt(n,r)},Bn=e=>{let t=zn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:pt(t,e.map(e=>e[0]))},Vn=[],Hn=[],Un=/* @__PURE__ */ new WeakMap,Wn=e=>{let t=Vn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Vn[e]=n,n},Gn=e=>{if(gr(e),e.low===1&&e.high>=1)return Wn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Kn=e=>e.length>0&&(e===Vn[e.length]||Un.has(e)),qn=e=>{let t=R(e).elements;return Kn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Jn=e=>{let t=Hn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Hn[e]=n,n},Yn=e=>Ht(Bt(Wn(e.length),e),`tuple`),Xn=e=>Ht(zn(e),`record`),Zn=e=>P(e)&&!jt(e),Qn=(e,t=!1)=>`UNION(${z(e.base,t)})`,$n=(e,t=e=>R(e).elements)=>{if(!Zn(e.base))throw new y(`Attempted to enumerate the nonenumerable set:\n${Qn(e)}`);return t(e.base)},er=(e,t,n)=>{if(Zn(e))return e;throw new y(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${z(e)}\nwhen enumerating:\n${Qn(n)}`)},L=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 L(e.base);case`FunctionSet`:return L(e.domain)&&L(e.range)||tr(e.domain)===!0||tr(e)===!0;case`RecordSet`:return e.sets.every(L)||tr(e)===!0;case`ProductSet`:return e.factors.every(L)||tr(e)===!0;case`Union`:return L(e.base)&&lr(e.base).every(L);case`SetOperation`:return e.operator===`\\cup`?L(e.left)&&L(e.right):e.operator===`\\cap`?L(e.left)||L(e.right):L(e.left);default:return!1}},tr=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=tr(e.domain);return t===void 0?void 0:!t&&tr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=tr(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return L(e)?R(e).elements.length===0:void 0;default:return}},nr=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},rr=(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},ir=e=>{if(typeof e!=`object`||e.kind!==`Subset`||jt(e.base))return;let t=R(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=[]:rr(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return zt(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)})},ar=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(zt(r.map(t=>e[t])));while(rr(r,e.length))}return t},or=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(jt(a))throw new y(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},sr=(e,t=e=>R(e).elements)=>{if(typeof e!=`object`)throw new y(`Expected a set but found ${z(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Tn(e.elements);case`Interval`:{let t=Gn(e);return t!==Vn[t.length]&&Un.set(t,e),t}case`Subset`:{if(gr(e.base)===0)return ar([]);if(!P(e.base))throw new y(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${N(z(e.base))}`);let t=R(e.base).elements;if(t.length>30)throw new y(hr(e));return ar(t)}case`FunctionSet`:{if(!Tt.is174&&pr(e))return[];if(jt(e.domain))throw new y(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${z(e.domain)}\ncannot be enumerated.`);let n=qn(e.domain);if((n.length>0||Tt.is174)&&jt(e.range))throw new y(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${z(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return nr(n.map(()=>r)).map(e=>Bt(n,e))}case`RecordSet`:{if(!Tt.is174&&pr(e))return[];let n=or(e.sets,t,(t,n)=>`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${z(t)}`);return nr(n).map(t=>Xn(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Tt.is174&&pr(e))return[];let n=or(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${z(e)}`);return nr(n).map(Yn)}case`FilteredSet`:if(!P(e.base)||jt(e.base))throw new y(`Attempted to enumerate { x \\in S : p(x) } when S:\n${z(e.base)}\nis not enumerable`);return R(e.base).elements.filter(e.test);case`Union`:{let t=$n(e).flatMap((t,n)=>R(er(t,n,e)).elements);return R(Pn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Zn(e.left)||!Zn(e.right)))throw new y(`Attempted to enumerate S \\cup T when S:\n${z(e.left)}\nand T:\n${z(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Zn(e.left)&&!Zn(e.right))throw new y(`Attempted to enumerate S \\cap T when neither S:\n${z(e.left)}\nnor T:\n${z(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Zn(e.left))throw new y(`Attempted to enumerate S \\ T when S:\n${z(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Rn(R(e.left),R(e.right)).elements;let t=e.operator===`\\`||Zn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return R(n).elements.filter(t=>wr(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to enumerate the non-enumerable set ${z(e)}`);default:throw new y(`Expected a set but found ${z(e)}`)}},cr=/* @__PURE__ */ new WeakMap,R=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return zt(sr(e));let t=typeof e==`object`?cr.get(e):void 0;if(t)return t;let n=Sr.sets;n?.push(e);let r=sr(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?zt(r):Nn(r);return typeof e==`object`&&cr.set(e,i),i},lr=e=>{if(typeof e!=`object`||Kt.has(e))return R(e).elements;let t=Sr.sets;t?.push(e);let n=fr(e);return t?.pop(),n},ur=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,dr=e=>typeof e!=`object`||Kt.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?dr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||dr(e.left)||dr(e.right):ur(e)?.some(dr)??!1,fr=e=>{if(e.kind===`Union`)return $n(e,lr).flatMap((t,n)=>lr(er(t,n,e)));if(e.kind===`FilteredSet`&&!jt(e.base))return lr(e.base).filter(e.test);if(ur(e)?.some(dr))return sr(e,lr);if(e.kind!==`SetOperation`)return R(e).elements;if(e.operator===`\\cup`)return!Zn(e.left)||!Zn(e.right)?R(e).elements:[...lr(e.left),...lr(e.right)];let t=e.operator===`\\`||Zn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Zn(n)?lr(n).filter(t=>wr(t,r)===(e.operator===`\\cap`)):R(e).elements},pr=e=>{if(typeof e!=`object`||!P(e))throw new y(`Shouldn't call isEmpty() on value ${z(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 y(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(pr);case`RecordSet`:return e.sets.some(pr);case`FunctionSet`:return!pr(e.domain)&&pr(e.range);case`Union`:return $n(e).every((t,n)=>pr(er(t,n,e)));default:return R(e).elements.length===0}},mr=(e,t,n)=>e.reduce((e,r)=>{let i=e*gr(r,t);if(i>2147483647)throw new y(n());return i},1),hr=e=>`Overflow when computing the number of elements in:\n${z(e)}`,gr=(e,t)=>{if(typeof e!=`object`)throw new y(`Attempted to compute the number of elements in the ${typeof e==`number`?`integer`:typeof e==`string`?`string`:`boolean`} ${z(e)}.`);switch(e.kind){case`ModelValue`:throw new y(`Attempted to compute the number of elements in the model value ${z(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return gr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new y(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to compute the number of elements in the overridden value ${z(e)}.`);case`Subset`:{let n=gr(e.base,t);if(n>=31)throw new y(hr(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(pr(e.domain))return 1;if(pr(e.range))return 0;if(gr(e.range,t)===1)return 1}let n=gr(e.domain,t),r=gr(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new y(hr(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&pr(e)?0:mr(e.sets,t,()=>hr(e));case`ProductSet`:return t!==`1.7.4`&&pr(e)?0:mr(e.factors,t,()=>`Overflow when computing the number of elements in ${z(e)}`);default:return Yt(e),R(e).elements.length}},_r=e=>`Attempted to check if the set ${z(e)}is finite.`,vr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new y(`Attempted to check if the ${ut(e)} ${z(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new y(`Attempted to check if the function:\n${z(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return vr(e.base)&&pr(e.base);case`Subset`:return vr(e.base);case`FunctionSet`:{let t=vr(e.domain);if(t&&pr(e.domain))return!0;let n=vr(e.range);return n&&pr(e.range)?!0:n&&(t||gr(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(!vr(e))n.isAllFinite=!1;else if(pr(e))return!0;return n.isAllFinite}case`Union`:if(!Zn(e.base))throw new y(`Attempted to check if the nonenumerable set:\n${Qn(e)}\nis a finite set.`);return R(e.base).elements.every(vr);case`SetOperation`:if(e.operator===`\\cup`)return vr(e.left)&&vr(e.right);if(e.operator===`\\cap`){if(!vr(e.left)&&!vr(e.right))throw new y(_r(e));return!0}if(vr(e.left))return!0;if(!vr(e.right))throw new y(_r(e));return!1;case`FilteredSet`:if(!vr(e.base))throw new y(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${z(e.base)}\nis finite.`);return!0}},yr=(e,t,n=It)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},br=e=>{if(typeof e!=`object`||!F(e))return;let t=Dr(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},xr=(e,t)=>{let n=`Attempted to check if the value:\n${z(e)}\nis an element of the`;if(!F(t))return`${n} ${ut(t)} ${z(t)}`;let r=Ut(t);return r===`record`?`Attempted to check if element:\n${z(e)}\nis in the record:\n${z(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${z(t)}`},Sr={sets:void 0},Cr=(e,t)=>{let n=Sr.sets,r=Sr.callStack,i=n?.length??0,a=r&&{...r,length:r.expressions.length};try{return e()}catch(e){if(!(e instanceof y))throw e;return n&&(n.length=i),r&&a&&(r.expressions.length=a.length,r.isFrozen=a.isFrozen,r.fingerprint=a.fingerprint),t(e)}},wr=(e,t)=>{let n=Sr.sets;if(n===void 0)return Tr(e,t);n.push(t);let r=Tr(e,t);return n.pop(),r},Tr=(e,t)=>{if(!P(t))throw new y(xr(e,t));switch(t.kind){case`Set`:return Yt(e),Cr(()=>yr(t.elements,e)!==-1,()=>kn.has(t)?Dn(e,t.elements).isFound:On(e,t.elements));case`MixedSet`:return On(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 y(`Attempted to check if the value:\n${z(e)}\nis in the integer interval ${z(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 y(`Attempted to check if the value:\n${z(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!P(e)||jt(e))throw new y(`Attempted to check if the non-enumerable value\n${N(z(e))}\nis element of\n${N(z(t))}`);return R(e).elements.every(e=>wr(e,t.base));case`FunctionSet`:{if(!F(e)){if(I(e))return!1;throw new y(`Attempted to check if \n${z(e)}\nwhich is not a TLC function value, is in the set of functions:\n${N(z(t))}`)}let n=Dr(e),r=nn(n.domain);return(r===void 0?jn(t.domain,zt(n.domain)):jn({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>wr(e,t.range))}case`RecordSet`:{let n=F(e)?Dr(e):void 0;if(!n||!_t(n.domain)){if(I(e))return!1;throw new y(`Attempted to check if non-record\n${z(e)}\nis in the set of records:\n${z(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=yr(n.domain,e);return i!==-1&&wr(n.range[i],t.sets[r])})}case`ProductSet`:{let n=F(e)?br(e):void 0;if(n===void 0){if(F(e)&&Dr(e).domain.every(e=>typeof e==`number`)||I(e))return!1;throw new y(`Attempted to check if non-tuple\n${z(e)}\nis in the set of tuples:\n${z(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>wr(e,t.factors[n]))}case`FilteredSet`:return wr(e,t.base)&&t.test(e);case`Union`:if(!Zn(t.base))throw new y(`Attempted to check if:\n ${z(e)}\nis an element of the non-enumerable set:\n ${Qn(t)}`);return R(t.base).elements.some(t=>wr(e,t));case`SetOperation`:return t.operator===`\\cup`?wr(e,t.left)||wr(e,t.right):wr(e,t.left)&&wr(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=br(e);if(n===void 0){if(I(e))return!1;throw new y(`Attempted to check if the value:\n${N(z(e))}\nis an element of ${N(z(t))}.`)}return n.every(e=>wr(e,t.base))}default:throw new y(xr(e,t))}},Er=(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?wr(e,n):e.range.every((e,r)=>Er(e,t.range[r],n.range)),Dr=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){L(e.domain)||gr(e.domain);let t=qn(e.domain);return Ht(Bt(t,t.map(t=>e.apply(t))),Ut(e))}throw new y(`Expected a function but found ${z(e)}`)},Or=(e,t,n)=>{let r=N(z(e)),i=N(z(t)),a=n===`1.7.4`;switch(Ut(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},kr=(e,t)=>{if(!Tt.is174)return Or(e,t);let n=N(z(t));return Ut(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Ar=(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 yr(e,t)},jr=e=>new y(`Attempted to apply function with integer domain to the non-integer argument ${N(z(e))}`),Mr=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Ut(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new y(n(e,t));if(a===void 0&&!Tt.is174&&Kn(r))throw jr(t)}return Cr(()=>Ar(r,t),e=>{throw Tt.is174||r.length<32?r.forEach(e=>wn(e,t)):yr(r,t,yn),e})},Nr=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!wr(t,e.domain))throw new y(Ut(e)===`lambda`?Or(e,t):`Attempted to apply a function to ${z(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new y(`Attempted to apply ${z(e)}, which is not a function`);let r=n??Or,i=Mr(e,t,r);if(i===-1)throw new y(r(e,t));return e.range[i]},Pr=e=>Kn(e)?Un.get(e)??Jn(e.length):void 0,Fr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=Dr(e).domain;return Pr(t)??zt(t)},Ir=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!L(e.domain))){if(!wr(t,e.domain))return e;let r=n(e.apply(t));return Ht({kind:`LazyFunction`,domain:e.domain,apply:n=>jn(t,n)?r:e.apply(n),source:e.source},Ut(e))}if(!F(e))throw new y(`Attempted to apply EXCEPT construct to the value ${N(z(e))}.`);let i=Dr(e),a=Mr(i,t,kr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Ht(Bt(i.domain,o),Ut(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Ur){let e=Jr(c);if(e!==Ur){let t=Jr(i.domain[a]);l.hash=s===c?i.hash:i.hash-Hr(t,Jr(s))+Hr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-$r(e,s)+$r(e,c)|0}return l},Lr=/* @__PURE__ */ new WeakMap,Rr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},zr=(e,t)=>Math.imul(e^t,16777619),Br=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Rr(t)},Vr=e=>Rr(e+2654435769|0),Hr=(e,t)=>Rr(Math.imul(e,668265261)+t|0),Ur=795548749,Wr=e=>{if(e.kind===`ModelValue`)return Rr(zr(Br(e.name),109));if(P(e)){if(!L(e))return Ur;let t=R(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Jr(t[e]);if(r===Ur)return Ur;n=n+Vr(r)|0}return n}if(e.kind===`LazyFunction`&&!L(e.domain))return Ur;let t=Dr(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=Jr(t.domain[e]),i=Jr(t.range[e]);if(r===Ur||i===Ur)return Ur;n=n+Hr(r,i)|0}return n},Gr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new y(`TLC has found a state in which the value of a variable contains ${z(e)}`);if(P(e)){R(e).elements.forEach(Gr);return}let t=Dr(e);t.domain.forEach(Gr),t.range.forEach(Gr)},Kr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Jr(e)===Ur&&Gr(e);return}catch(e){if(!(e instanceof y))throw e;return e}},qr=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Jr=e=>{if(typeof e==`number`)return Rr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Br(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Wr(e)),e.hash;let t=Lr.get(e);if(t!==void 0)return t;let n=Wr(e);return Lr.set(e,n),n},Yr=/* @__PURE__ */ new WeakMap,Xr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Zr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Xr(t)},Qr=e=>Xr(ti(e)+2135587861|0),$r=(e,t)=>Xr(Math.imul(ti(e),374761393)+ti(t)|0),ei=e=>{if(e.kind===`ModelValue`)return Xr(Zr(e.name)^60);if(P(e)){if(!L(e))return Zr(ri(e));let t=R(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Qr(t[e])|0;return n}let t=Dr(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+$r(t.domain[e],t.range[e])|0;return n},ti=e=>{if(typeof e==`number`)return Xr(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return Zr(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=ei(e)),e.fingerprint;let t=Yr.get(e);if(t!==void 0)return t;let n=ei(e);return Yr.set(e,n),n},ni=/* @__PURE__ */ new WeakMap,ri=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=ni.get(e);if(t!==void 0)return t;let n=ii(e);return ni.set(e,n),n},ii=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ri(e.base)}>`;if(e.kind===`FilteredSet`&&!L(e))throw new y(`Attempted to compare the non-enumerable set ${z(e)} with another value`);if(P(e))return L(e)?`{${R(e).elements.map(ri).join(`,`)}}`:`<${e.kind} ${z(e)}>`;let t=Dr(e);return`(${t.domain.map((e,n)=>`${ri(e)}:${ri(t.range[n])}`).join(`,`)})`},ai=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,oi=e=>e.reduce((e,t)=>e===0?0:e*gr(t),1),si=e=>{if(e.kind===`Subset`)return gr(e.base)<=6?R(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return R(e);if(e.kind===`FunctionSet`&&L(e.domain)&&gr(e.domain)===0)return zt([Bt([],[])]);let t=e.kind===`FunctionSet`?gr(e.range)**gr(e.domain):oi(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Fn:t<=1999?R(e):void 0},ci=(e,t)=>{if(t)return si(e);if(L(e))try{return si(e)}catch(e){if(e instanceof y)return;throw e}},li=(e,t)=>{let n=e=>z(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return Qn(e,t)}},ui=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),di=e=>{if(L(e.domain))try{return Dr(e)}catch(e){if(e instanceof y)return;throw e}},z=(e,t=!1,n=!1)=>{let r=e=>z(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return ai(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(R(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=ci(e,t);return n?r(n):li(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?di(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${z(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Tt.is174&&Ut(e)!==`tuple`)return`<< >>`;let a=r=>z(r,t,n&&Ut(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Ut(e)===`record`||i.domain.every(e=>typeof e==`string`&&ui(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):mt(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},fi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${N(z(n))}\n`).join(``)},pi=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},mi=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Jr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||tn(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||tn(i[e],n))return i[e]}return n.kind===`Set`?pi(n.elements,t):(pi(n.domain,t),pi(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}},hi=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},B=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,gi=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),_i=(e,t)=>gi.has(e)?new y(t):new C(t),vi=e=>typeof e==`object`&&e.kind===`Operator`,V=(e,t,n)=>{let r=e[t];if(r===void 0||vi(r))throw _i(n,`${n} expects a value as argument ${t+1}`);return r},yi=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`number`)throw _i(n,`${n} expects an integer but received ${z(r)}`);return r},bi=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`boolean`)throw _i(n,`${n} expects a boolean but received ${z(r)}`);return r},xi=(e,t,n)=>{let r=V(e,t,n);if(!P(r))throw _i(n,`${n} expects a set but received ${z(r)}`);return r},Si=(e,t,n)=>{let r=xi(e,t,n);if(!L(r))throw _i(n,`${n} cannot enumerate the non-enumerable set ${z(r)}`);return r},Ci=(e,t,n)=>R(Si(e,t,n)),wi=(e,t,n)=>Ci(e,t,n).elements,Ti=(e,t,n)=>{let r=V(e,t,n),i=br(r);if(!i)throw _i(n,`${n} expects a sequence but received ${z(r)}`);return i},Ei=(e,t,n)=>{let r=V(e,t,n);if(!F(r))throw _i(n,`${n} expects a function but received ${z(r)}`);return Dr(r)},Di=(e,t,n)=>{let r=e[t];if(r===void 0||!vi(r))throw _i(n,`${n} expects an operator as argument ${t+1}`);return r},Oi=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),H=(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}),ki=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Ai=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ji=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(V(n,0,e),V(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Mi=e=>e>2147483647||e<-2147483648,Ni=e=>new C(`Overflow when computing ${e}`),Pi={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},Fi={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Ii={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`},Li={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ri=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Fi[e.operator];if(e.kind!==`Function`)return Pi[e.kind];let t=Ut(e);return t===void 0?`FcnRcdValue`:Li[t]},zi=e=>Ii[Ri(e)],Bi=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Vi=(e,t)=>{let n=n=>(...r)=>{let i=Sr.sets?.length??0;try{return n(...r)}catch(n){throw n instanceof y&&(e.isLazy===!0||!(n instanceof C))?(Sr.sets&&(Sr.sets.length=i),Bi(t,n.message)):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Hi=(e,t)=>{if(typeof e!=`number`)throw Bi(t,`Cannot cast tlc2.value.impl.${Ri(e)} to tlc2.value.impl.IntValue`);return e},Ui=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Wi=(e,t,n,r)=>{let i=Ui(e,n,`IntValue`,2);return ji(t,(e,n)=>{let a=Hi(e,i),o=Hi(n,i),s=r(a,o);if(Mi(s))throw Ni(`${a}${t}${o}`);return s})},Gi=(e,t,n)=>{if(typeof e!=`number`)throw new C(`The ${t} argument of ${n} should be an integer, but instead it is:\n${z(e)}`);return e},Ki=(e,t,n=e)=>ji(e,(e,r)=>t(Gi(e,`first`,n),Gi(r,`second`,n))),qi=(e,t,n)=>({...Ai(e,t,n),isLazy:!0}),Ji=(e,t,n)=>{let r=Di(e,t,n);return()=>r.call([])},Yi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Xi=()=>({bool:ul,condition:(e,t)=>{if(typeof e!=`boolean`)throw Xc(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Zc(t,n,e);return e},apply:Nr,expectFunction:sl,tuple:Yn,set:Pn,record:Zt,writtenRecord:ht,equal:Qt,enumerate:xl,unassigned:(e,t)=>{throw dd(e,t)},primeOutsideAction:e=>{throw pd(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:cl,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>al(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Zi={value:void 0},Qi=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),$i=e=>`local${e.counter++}`,ea=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),hi(e).forEach(e=>ea(e,t)),t),ta=(e,t,n)=>{let r=Qi(e,Ru(t,e.environment)),i=ea(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Qi(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},na=(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(()=>$i(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${aa(e,t.set,s)}, ${Qi(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=$i(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${aa(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=$i(e),a=$i(e),o=$i(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},ra=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${aa(e,r[0],n)}, "the left side of =>") ? bool(${aa(e,r[1],n)}, "the right side of =>") : true)`;if(B(t))return ta(e,t,n);let i=ql(t.operator,e.environment);if(i?.kind!==`Builtin`)return ta(e,t,n);if(i.name===`DOMAIN`)return`${Qi(e,el(t))}(${aa(e,r[0],n)})`;if(i.name===`TLCEval`)return ta(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Qi(e,tl(t,i))}(${aa(e,r[0],n)}, ${aa(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Gu(r[0],a))return`${Qi(e,i.evaluateUnary)}(${aa(e,r[0],n)})`;let o=r.length===2&&Gu(r[0],a)&&Gu(r[1],a);return i.evaluateBinary&&o?`${Qi(e,i.evaluateBinary)}(${aa(e,r[0],n)}, ${aa(e,r[1],n)})`:ta(e,t,n)},ia=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(B(e))return!1;let r=ru(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ia(e.expression,t,n);case`FieldAccess`:return ia(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ia(e,t,n));default:return!1}},aa=(e,t,n)=>{let r=(t,r=n)=>aa(e,t,r);if(ku(t)&&wu(t,e.environment))return ta(e,t,n);switch(t.kind){case`Number`:return du(t.value)?String(t.value):ta(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(B(t))return ta(e,t,n);let i=ru(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Qi(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Qi(e,i.value):ta(e,t,n)}case`Apply`:return ra(e,t,n);case`And`:case`Or`:{let n=Qi(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Qi(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{ad(t.function);let i=`expectFunction(${ia(t.function,n,e.environment)?r(t.function):ta(e,t.function,{...n,context:`keepLazyContext(${n.context})`})}, ${Qi(e,t)})`,a=$c(e.environment.runtime.version),o=a?`, ${Qi(e,a)}`:``;return t.args.length===1?`apply(${i}, ${r(t.args[0])}${o})`:`apply(${i}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${o})`}case`FieldAccess`:return`${Qi(e,Qc(t))}(${r(t.record)})`;case`Record`:{let i=ld(t.fields);if(ud(i))return ta(e,t,n);let a=Qi(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}, ${Qi(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=Qi(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`)?na(e,t,n):ta(e,t,n);default:return ta(e,t,n)}},oa=(e,t)=>{if(!Yi.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=aa(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}; };`;Zi.value??=Xi();let o=Zi.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},sa={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},ca={none:0,error:1,warning:3,state:4},la={0:``,1:`Error: `,3:`Warning: `,4:`State `},ua=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===ca.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
30
- (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${la[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},da=`The configuration file did not specify the initial state predicate.
28
+ `);a(e===-1?o:o.slice(0,e));continue}if(o.startsWith(`(*`)){let e=o.indexOf(`*)`);if(e===-1)return a(o),i(``),t;a(o.slice(0,e+2));continue}let c=n.line,l=/^\d+(?![A-Za-z_])/.exec(o)?.[0];if(l){t.push({kind:`Number`,text:l,line:c}),a(l);continue}let u=/^[A-Za-z0-9_]+/.exec(o)?.[0];if(u){t.push({kind:`Word`,text:u,line:c}),a(u);continue}if(o.startsWith(`"`)){let s=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(o),l=s?.[0]??`"`;if(s?.[2]!==`"`)return a(l),n.index===e.length?i(`${l}\n`):r(n.index,l),t;t.push({kind:`String`,text:s[1],line:c}),a(l);continue}let d=et.find(e=>o.startsWith(e));if(d){t.push({kind:`Symbol`,text:d,line:c}),a(d);continue}let f=_e(e,n.index)??O(e,n.index);if(!f)return r(n.index,``),t;t.push({kind:`Word`,text:f.text,line:c}),a(e.slice(n.index,n.index+f.length))}return t.push({kind:`End`,text:``,line:n.line}),t},nt=(e,t)=>new v(`TLC found an error in the configuration file at line ${e}\n${t}`),rt=(e,t)=>nt(e,`The keyword ${t} appeared twice.`),M=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),it=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),at=(e,t=`master`)=>{let n=t===`1.7.4`?$e:Ze,r=tt(e),i={index:0},a={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},o={isSet:!1},s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i.index++,r.length-1)];if(e.kind===`Error`)throw new v(`TLC found an error in the configuration file:\n${e.text}`);return e},l=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={token:c()};if(t.token.text!==`}`)for(;e.push(l(t.token)),t.token=c(),t.token.text===`,`;)t.token=c();if(t.token.text!==`}`)throw nt(t.token.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 nt(e.line,`It was expecting a value, but did not find it.`)},u=e=>{let t=c();if(t.kind===`End`)throw nt(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw nt(n.line,`It was expecting ], but did not find it.`);return t.text},d=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let r={token:c(),name:t.text};for(;r.token.text===`!`;)r.name=`${r.name}!${c().text}`,r.token=c();let i=r.name;if(r.token.text===`<-`){if(r.token=c(),r.token.text===`[`){let e=u(`<-`),t=c();if(t.kind===`End`)throw nt(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:i,target:t.text,module:e});continue}if(r.token.kind===`End`)throw nt(r.token.line,`Expected an identifier after <-.`);a.substitutions.push({name:i,target:r.token.text});continue}let o=[],s=r.token.text===`(`;if(s){for(;o.push(l(c())),r.token=c(),r.token.text===`,`;);if(r.token.text!==`)`)throw nt(e,``);r.token=c()}if(r.token.text!==`=`)throw nt(r.token.line,`It was expecting = or <-, but did not find it.`);r.token=c();let d=r.token.text===`[`?u(`=`):void 0,f=l(d===void 0?r.token:c());a.constants.push({name:i,value:f,...s&&{args:o},...d!==void 0&&{module:d}})}},f=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},p={token:c()};for(;p.token.kind!==`End`;){let e=p.token.text,t=p.token.line,r=n.has(e)?M.get(e):void 0,i=n.has(e)?it.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw nt(t,`The keyword ${e} was not followed by an identifier.`);return n};if(r!==void 0){let n=l();if(a[r]!==void 0)throw rt(t,e);a[r]=n.text,p.token=c()}else if(i!==void 0)p.token=f(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)p.token=d(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw nt(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o.isSet)throw rt(t,e);o.isSet=!0,a.checkDeadlock=n.text===`TRUE`,p.token=c()}else{if(!n.has(e)||!Qe.includes(e))throw nt(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw rt(t,e);s.add(e),p.token=c()}}return a},ot={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:` `}},st=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},ct=e=>e!==void 0&&/^\p{Nd}$/u.test(e),lt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),ut=e=>{let t=t=>{let n=ye(e,t,st);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=ye(e,t,ct);if(e.startsWith(`..`,n)&&ct(e[n+2]))return{kind:`Constant`,first:t,last:ye(e,n+2,ct)-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=ct(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:ye(e,t+1,ct)-1,children:[]};if(lt(n))return{kind:`Constant`,first:t,last:ye(e,t,lt)-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)},dt=e=>{let t=e.length===0?void 0:ut(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=ot[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=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,ft=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),P=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),F=e=>typeof e==`object`&&e.kind===`ModelValue`,pt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:N(e)?`set`:`function`,mt=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new S(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ht={isUsed:!1},gt=(e,t)=>(ht.isUsed=!0,e.writtenKeys=t,e),_t=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Sr(e.domain,t)]]),vt=(e,t,n)=>gt(tn(e,t),n),yt=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(yt);e.writtenKeys=void 0,e.range.forEach(yt)}},bt=e=>e.every(e=>typeof e==`string`),xt=(e,t)=>e.length>0&&t.length>0&&bt(e)!==bt(t),St=(e,t)=>{ht.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return xt(n,r)?Cn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=zt(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=zt(i[e],a[e]);if(t!==0)return t}return 0},Ct=(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=zt(n[e],r[e]);if(t!==0)return t}return 0},wt=e=>F(e)?e.type:void 0,Tt=(e,t,n)=>{let r=wt(e),i=wt(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(F(e)&&F(t)){if(r===void 0||i===void 0||r===i)return;throw new y(`Attempted to ${a} the differently-typed model values ${z(e)} and ${z(t)}`)}throw r===void 0?new y(`Attempted to ${a} the typed model value ${z(t)} and the non-model value\n${z(e)}`):new y(`Attempted to ${a}${n?``:` the`} typed model value ${z(e)} and non-model value\n${z(t)}`)},Et={ranks:Object.create(null),size:0},Dt=e=>{Et.ranks=Object.create(null),Et.size=0,Bt.clear();for(let t of e)At(t)},Ot={is174:!1},kt=e=>{Ot.is174=e===`1.7.4`},At=e=>(Et.ranks[e]===void 0&&(Et.ranks[e]=Et.size++),e),jt=()=>Et.size,Mt=e=>Et.ranks[At(e)],Nt=(e,t)=>{if(e===t)return 0;let n=Et.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},Pt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Ft=(e,t)=>(Pt(e)||Pt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),It=(e,t,n)=>{if(!Pt(e))throw new y(`Attempted to ${n} the set ${z(I(e)?L(e):e,!0)} with the value:\n${z(t,!0)}`);if(!Pt(t))throw new y(`Attempted to compare overridden value ${z(e,!0)} with non-overridden value:\n${z(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 y(`Attempted to compare ${z(e,!0)} with the value\n${z(t,!0)}`)},Lt={kind:`InfiniteSet`,name:`Any`},Rt=e=>{throw new y(`Attempted to compare ANY with the value\n${z(e)}`)},zt=(e,t)=>{if(e===t)return ht.isUsed&&yt(e),e===Lt?Rt(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return St(e,t);if(n===`Set`&&r===`Set`)return Ct(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&&Tt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Tt(e,t,!1),n===`ModelValue`?-1:1;if(e===Lt||t===Lt)return Rt(e===Lt?t:e);if(N(e)&&N(t)&&Ft(e,t))return It(e,t,`compare`);let i=N(e);if(i!==N(t))throw new y(`Attempted to compare ${pt(e)} ${z(e)} with ${pt(t)} ${z(t)}`);return i?Ct(L(e),L(t)):St(Mr(e),Mr(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Nt(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Tt(e,t,!1),F(e))return-1;if(F(t))return 1;throw new y(`Attempted to compare ${pt(e)} ${z(e)} with ${pt(t)} ${z(t)}`)},Bt=/* @__PURE__ */ new Map,Vt=e=>{let t=Bt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Mt(e)};return Bt.set(e,n),n},Ht=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),Ut=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),Wt={isPresent:!1},Gt=(e,t)=>(t===`lambda`&&(Wt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Kt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,qt=e=>Gt(e,`lambda`),Jt=/* @__PURE__ */ new WeakSet,Yt=/* @__PURE__ */ new WeakSet,Xt={isPresent:!1},Zt=e=>(Xt.isPresent=!0,e),Qt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),$t=e=>{Xt.isPresent&&typeof e==`object`&&Qt.has(e.kind)&&Yt.add(e)},en=e=>{if((Wt.isPresent||Xt.isPresent)&&typeof e==`object`){if(e.kind===`Function`||e.kind===`Set`){if(e.isFingerprinted)return;e.isFingerprinted=!0}else{if(Jt.has(e))return;Jt.add(e)}e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(en),e.range.forEach(en)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(en):N(e)&&I(e)&&($t(e),L(e).elements.forEach(en))}},tn=(e,t)=>Gt(Ut(e,t),`record`),nn=(e,t)=>{if($t(e),e===t)return ht.isUsed&&yt(e),e!==Lt||Rt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Tt(e,t,!0),zt(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 St(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Ct(e,t)===0;if(F(e)||F(t))return Tt(e,t,!0),F(e)&&F(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return nn(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=R(e.domain),r=R(t.domain);if(n||r)return n===r;let i=R(e.range),a=R(t.range);return i||a?i===a:nn(e.domain,t.domain)&&nn(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(R(e))return R(t);if(R(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]&&nn(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return R(e)?R(t):!R(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>nn(e,t.factors[n]));let n=N(e)&&N(t)&&!(I(e)&&I(t));if(n&&Ft(e,t))return It(e,t,`check equality of`)===0;if(n){if(!Pt(e)){let n=L(e);if(!Pt(t))return Ct(n,L(t))===0}return li(e)===li(t)}return zt(e,t)===0},rn=e=>{let t=(e,t)=>e===t||e.length===t.length&&e.every((e,r)=>n(e,t[r])),n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):li(n)===li(r);return n},an=rn(!1),on=rn(!0),sn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},cn=e=>{if(!P(e))return;let t=Mr(e);return{domain:t.domain,range:t.range,low:sn(t.domain)}},ln=e=>{if(!P(e))return;let t=Mr(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},un=(e,t)=>{if(wt(e)!==void 0)throw new y(`Attempted to compare the typed model value ${z(e)} and the non-model value\n${z(t)}`);return 1},dn=(e,t)=>{if(wt(e)!==void 0)throw new y(`Attempted to check equality of the typed model value ${z(e)} and the non-model value\n${z(t)}`);return!1},fn=(e,t)=>{let n=wt(e);if(n===void 0)return F(t)?e.rank-t.rank:-1;if(!F(t))throw new y(`Attempted to compare the typed model value ${z(e)} and non-model value\n${z(t)}`);let r=wt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to compare the differently-typed model values ${z(e)} and ${z(t)}`);return e.rank-t.rank},pn=(e,t)=>{let n=wt(e);if(n===void 0)return F(t)&&e.name===t.name;if(!F(t))throw new y(`Attempted to check equality of typed model value ${z(e)} and non-model value\n${z(t)}`);let r=wt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to check equality of the differently-typed model values ${z(e)} and ${z(t)}`);return e.name===t.name},mn={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`}},hn=(e,t,n)=>{let r=mn[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${z(e)} with ${r.other}:\n${z(t)}`},gn=(e,t,n)=>{let r=cn(n);if(!r){if(F(n))return un(n,t);throw new y(`Attempted to compare the function ${z(t)} with the value:\n${z(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>_n(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 _n(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 y(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${z(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},_n=(e,t)=>{for(let n=0;n<e.length;n++){let r=Cn(e[n],t[n]);if(r!==0)return r}return 0},vn=(e,t)=>{let n=Mr(e);if(e.kind===`Function`&&Cr(n)!==void 0){let r=P(t)?Cr(t):void 0;return r?n.range.length-r.length||_n(n.range,r):gn({...n,low:1},e,t)}if(Kt(e)===`record`){let r=ln(t);if(!r){if(F(t))return un(t,e);throw new y(`Attempted to compare record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length-r.domain.length||_n(n.domain,r.domain)||_n(n.range,r.range)}return gn({...n,low:sn(n.domain)},e,t)},yn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),bn=(e,t)=>Pt(e)||Pt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),xn=(e,t)=>{let n=yn(t)?t:L(t);return{elements:L(e).elements,otherElements:L(n).elements}},Sn=(e,t)=>{if(bn(e,t))return zt(e,t);if(!yn(e))return Sn(L(e),t);if(!N(t)){if(F(t))return un(t,e);throw new y(`Attempted to compare the set ${z(e)} with the value:\n${z(t)}`)}let n=xn(e,t);return n.elements.length-n.otherElements.length||_n(n.elements,n.otherElements)},Cn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return zt(e,t);if(F(t))return un(t,e);throw new y(hn(e,t,!1))}return e.kind===`ModelValue`?fn(e,t):P(e)?vn(e,t):Sn(e,t)},wn=(e,t)=>e.every((e,n)=>On(e,t[n])),Tn=(e,t,n)=>{let r=cn(n);if(!r){if(F(n))return dn(n,t);throw new y(`Attempted to check equality of the function ${z(t)} with the value:\n${z(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)&&wn(e.range,r.range);let i=e.low??r.low;return i===void 0?wn(e.domain,r.domain)&&wn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new y(`Attempted to compare an integer with non-integer:\n${z(e)}.`);return e===i+t})&&wn(e.range,r.range)},En=(e,t)=>{let n=Mr(e);if(e.kind===`Function`&&Cr(n)!==void 0){let r=P(t)?Cr(t):void 0;return r?n.range.length===r.length&&wn(n.range,r):Tn({...n,low:1},e,t)}if(Kt(e)===`record`){let r=ln(t);if(!r){if(F(t))return dn(t,e);throw new y(`Attempted to check equality of record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length===r.domain.length&&wn(n.domain,r.domain)&&wn(n.range,r.range)}return Tn({...n,low:sn(n.domain)},e,t)},Dn=(e,t)=>{if(bn(e,t))return nn(e,t);if(!yn(e))return Dn(L(e),t);if(!N(t)){if(F(t))return dn(t,e);throw new y(`Attempted to check equality of the set ${z(e)} with the value:\n${z(t)}`)}let n=xn(e,t);return n.elements.length===n.otherElements.length&&wn(n.elements,n.otherElements)},On=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(F(t))return dn(t,e);throw new y(hn(e,t,!0))}return e.kind===`ModelValue`?pn(e,t):P(e)?En(e,t):Dn(e,t)},kn=e=>{let t=[];for(let n of e){let e=jn(n,t);e.isFound||t.splice(e.index,0,n)}return t},An=(e,t)=>{let n=Tr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},jn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=An(e,()=>Cn(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},Mn=(e,t)=>t.some(t=>An(t,()=>On(t,e))),Nn=/* @__PURE__ */ new WeakSet,Pn=e=>{typeof e==`object`&&(e.kind===`Set`&&(Nn.add(e),e.elements.forEach(Pn)),e.kind===`Function`&&(e.domain.forEach(Pn),e.range.forEach(Pn)))},Fn=(e,t)=>Er(nn,On,e,t),In=e=>{for(let t=1;t<e.length;t++)if(zt(e[t-1],e[t])>=0)return!1;return!0},Ln=e=>{for(let t=1;t<e.length;t++)$t(e[t]);if(e.length<2||In(e))return Ht(e);let t=[...e].sort(zt),n=[t[0]];for(let e=1;e<t.length;e++)zt(n[n.length-1],t[e])!==0&&n.push(t[e]);return Ht(n)},Rn=e=>Er(Ln,e=>({kind:`MixedSet`,elements:e}),e,void 0),zn=Ht([]),Bn=(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&&zt(r[a],t)<0;)a++;a<r.length&&zt(r[a],t)===0||i.push(t)}return i.length===n.length?e:Ht(i)},Vn=(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&&zt(r[a],t)<0;)a++;a<r.length&&zt(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Ht(i)},Hn=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=zt(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=Ht(i);if(e.hash!==0&&e.hash!==Yr){let t=e.hash,n=0;for(;n<a.length;n++){let e=ei(a[n]);if(e===Yr)break;t=t+qr(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+ii(a[e])|0;c.fingerprint=t}return c},Un=e=>{let t=e.length<2?e:[...e].sort((e,t)=>zt(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&zt(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Ut(n,r)},Wn=e=>{let t=Un(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:gt(t,e.map(e=>e[0]))},Gn=[],Kn=[],qn=/* @__PURE__ */ new WeakMap,Jn=e=>{let t=Gn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Gn[e]=n,n},Yn=e=>{if(yr(e),e.low===1&&e.high>=1)return Jn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Xn=e=>e.length>0&&(e===Gn[e.length]||qn.has(e)),Zn=e=>{let t=L(e).elements;return Xn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Qn=e=>{let t=Kn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Kn[e]=n,n},$n=e=>Gt(Ut(Jn(e.length),e),`tuple`),er=e=>Gt(Un(e),`record`),tr=e=>N(e)&&!Pt(e),nr=(e,t=!1)=>`UNION(${z(e.base,t)})`,rr=(e,t=e=>L(e).elements)=>{if(!tr(e.base))throw new y(`Attempted to enumerate the nonenumerable set:\n${nr(e)}`);return t(e.base)},ir=(e,t,n)=>{if(tr(e))return e;throw new y(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${z(e)}\nwhen enumerating:\n${nr(n)}`)},I=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 I(e.base);case`FunctionSet`:return I(e.domain)&&I(e.range)||ar(e.domain)===!0||ar(e)===!0;case`RecordSet`:return e.sets.every(I)||ar(e)===!0;case`ProductSet`:return e.factors.every(I)||ar(e)===!0;case`Union`:return I(e.base)&&pr(e.base).every(I);case`SetOperation`:return e.operator===`\\cup`?I(e.left)&&I(e.right):e.operator===`\\cap`?I(e.left)||I(e.right):I(e.left);default:return!1}},ar=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=ar(e.domain);return t===void 0?void 0:!t&&ar(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=ar(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return I(e)?L(e).elements.length===0:void 0;default:return}},or=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},sr=(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},cr=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Pt(e.base))return;let t=L(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=[]:sr(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Ht(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},lr=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Ht(r.map(t=>e[t])));while(sr(r,e.length))}return t},ur=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Pt(a))throw new y(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},dr=(e,t=e=>L(e).elements)=>{if(typeof e!=`object`)throw new y(`Expected a set but found ${z(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return kn(e.elements);case`Interval`:{let t=Yn(e);return t!==Gn[t.length]&&qn.set(t,e),t}case`Subset`:{if(yr(e.base)===0)return lr([]);if(!N(e.base))throw new y(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${dt(z(e.base))}`);let t=L(e.base).elements;if(t.length>30)throw new y(vr(e));return lr(t)}case`FunctionSet`:{if(!Ot.is174&&R(e))return[];if(Pt(e.domain))throw new y(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${z(e.domain)}\ncannot be enumerated.`);let n=Zn(e.domain);if((n.length>0||Ot.is174)&&Pt(e.range))throw new y(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${z(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return or(n.map(()=>r)).map(e=>Ut(n,e))}case`RecordSet`:{if(!Ot.is174&&R(e))return[];let n=ur(e.sets,t,(t,n)=>`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${z(t)}`);return or(n).map(t=>er(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Ot.is174&&R(e))return[];let n=ur(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${z(e)}`);return or(n).map($n)}case`FilteredSet`:if(!N(e.base)||Pt(e.base))throw new y(`Attempted to enumerate { x \\in S : p(x) } when S:\n${z(e.base)}\nis not enumerable`);return L(e.base).elements.filter(e.test);case`Union`:{let t=rr(e).flatMap((t,n)=>L(ir(t,n,e)).elements);return L(Rn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!tr(e.left)||!tr(e.right)))throw new y(`Attempted to enumerate S \\cup T when S:\n${z(e.left)}\nand T:\n${z(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!tr(e.left)&&!tr(e.right))throw new y(`Attempted to enumerate S \\cap T when neither S:\n${z(e.left)}\nnor T:\n${z(e.right)}\nis enumerable`);if(e.operator===`\\`&&!tr(e.left))throw new y(`Attempted to enumerate S \\ T when S:\n${z(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Hn(L(e.left),L(e.right)).elements;let t=e.operator===`\\`||tr(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return L(n).elements.filter(t=>Dr(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to enumerate the non-enumerable set ${z(e)}`);default:throw new y(`Expected a set but found ${z(e)}`)}},fr=/* @__PURE__ */ new WeakMap,L=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Ht(dr(e));let t=typeof e==`object`?fr.get(e):void 0;if(t)return t;let n=Tr.sets;n?.push(e);let r=dr(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?Ht(r):Ln(r);return typeof e==`object`&&fr.set(e,i),i},pr=e=>{if(typeof e!=`object`||Yt.has(e))return L(e).elements;let t=Tr.sets;t?.push(e);let n=gr(e);return t?.pop(),n},mr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,hr=e=>typeof e!=`object`||Yt.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?hr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||hr(e.left)||hr(e.right):mr(e)?.some(hr)??!1,gr=e=>{if(e.kind===`Union`)return rr(e,pr).flatMap((t,n)=>pr(ir(t,n,e)));if(e.kind===`FilteredSet`&&!Pt(e.base))return pr(e.base).filter(e.test);if(mr(e)?.some(hr))return dr(e,pr);if(e.kind!==`SetOperation`)return L(e).elements;if(e.operator===`\\cup`)return!tr(e.left)||!tr(e.right)?L(e).elements:[...pr(e.left),...pr(e.right)];let t=e.operator===`\\`||tr(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return tr(n)?pr(n).filter(t=>Dr(t,r)===(e.operator===`\\cap`)):L(e).elements},R=e=>{if(typeof e!=`object`||!N(e))throw new y(`Shouldn't call isEmpty() on value ${z(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 y(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(R);case`RecordSet`:return e.sets.some(R);case`FunctionSet`:return!R(e.domain)&&R(e.range);case`Union`:return rr(e).every((t,n)=>R(ir(t,n,e)));default:return L(e).elements.length===0}},_r=(e,t,n)=>e.reduce((e,r)=>{let i=e*yr(r,t);if(i>2147483647)throw new y(n());return i},1),vr=e=>`Overflow when computing the number of elements in:\n${z(e)}`,yr=(e,t)=>{if(typeof e!=`object`)throw new y(`Attempted to compute the number of elements in the ${typeof e==`number`?`integer`:typeof e==`string`?`string`:`boolean`} ${z(e)}.`);switch(e.kind){case`ModelValue`:throw new y(`Attempted to compute the number of elements in the model value ${z(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return yr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new y(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to compute the number of elements in the overridden value ${z(e)}.`);case`Subset`:{let n=yr(e.base,t);if(n>=31)throw new y(vr(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(R(e.domain))return 1;if(R(e.range))return 0;if(yr(e.range,t)===1)return 1}let n=yr(e.domain,t),r=yr(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new y(vr(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&R(e)?0:_r(e.sets,t,()=>vr(e));case`ProductSet`:return t!==`1.7.4`&&R(e)?0:_r(e.factors,t,()=>`Overflow when computing the number of elements in ${z(e)}`);default:return $t(e),L(e).elements.length}},br=e=>`Attempted to check if the set ${z(e)}is finite.`,xr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new y(`Attempted to check if the ${pt(e)} ${z(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new y(`Attempted to check if the function:\n${z(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return xr(e.base)&&R(e.base);case`Subset`:return xr(e.base);case`FunctionSet`:{let t=xr(e.domain);if(t&&R(e.domain))return!0;let n=xr(e.range);return n&&R(e.range)?!0:n&&(t||yr(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(!xr(e))n.isAllFinite=!1;else if(R(e))return!0;return n.isAllFinite}case`Union`:if(!tr(e.base))throw new y(`Attempted to check if the nonenumerable set:\n${nr(e)}\nis a finite set.`);return L(e.base).elements.every(xr);case`SetOperation`:if(e.operator===`\\cup`)return xr(e.left)&&xr(e.right);if(e.operator===`\\cap`){if(!xr(e.left)&&!xr(e.right))throw new y(br(e));return!0}if(xr(e.left))return!0;if(!xr(e.right))throw new y(br(e));return!1;case`FilteredSet`:if(!xr(e.base))throw new y(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${z(e.base)}\nis finite.`);return!0}},Sr=(e,t,n=zt)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},Cr=e=>{if(typeof e!=`object`||!P(e))return;let t=Mr(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},wr=(e,t)=>{let n=`Attempted to check if the value:\n${z(e)}\nis an element of the`;if(!P(t))return`${n} ${pt(t)} ${z(t)}`;let r=Kt(t);return r===`record`?`Attempted to check if element:\n${z(e)}\nis in the record:\n${z(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${z(t)}`},Tr={sets:void 0},Er=(e,t,n,r)=>{let i=Tr.sets,a=Tr.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof y))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Dr=(e,t)=>{let n=Tr.sets;if(n===void 0)return Ar(e,t);n.push(t);let r=Ar(e,t);return n.pop(),r},Or=(e,t)=>Sr(t.elements,e)!==-1,kr=(e,t)=>Nn.has(t)?jn(e,t.elements).isFound:Mn(e,t.elements),Ar=(e,t)=>{if(!N(t))throw new y(wr(e,t));switch(t.kind){case`Set`:return $t(e),Er(Or,kr,e,t);case`MixedSet`:return Mn(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!F(e))throw new y(`Attempted to check if the value:\n${z(e)}\nis in the integer interval ${z(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(F(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new y(`Attempted to check if the value:\n${z(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!N(e)||Pt(e))throw new y(`Attempted to check if the non-enumerable value\n${dt(z(e))}\nis element of\n${dt(z(t))}`);return L(e).elements.every(e=>Dr(e,t.base));case`FunctionSet`:{if(!P(e)){if(F(e))return!1;throw new y(`Attempted to check if \n${z(e)}\nwhich is not a TLC function value, is in the set of functions:\n${dt(z(t))}`)}let n=Mr(e),r=sn(n.domain);return(r===void 0?Fn(t.domain,Ht(n.domain)):Fn({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Dr(e,t.range))}case`RecordSet`:{let n=P(e)?Mr(e):void 0;if(!n||!bt(n.domain)){if(F(e))return!1;throw new y(`Attempted to check if non-record\n${z(e)}\nis in the set of records:\n${z(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Sr(n.domain,e);return i!==-1&&Dr(n.range[i],t.sets[r])})}case`ProductSet`:{let n=P(e)?Cr(e):void 0;if(n===void 0){if(P(e)&&Mr(e).domain.every(e=>typeof e==`number`)||F(e))return!1;throw new y(`Attempted to check if non-tuple\n${z(e)}\nis in the set of tuples:\n${z(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>Dr(e,t.factors[n]))}case`FilteredSet`:return Dr(e,t.base)&&t.test(e);case`Union`:if(!tr(t.base))throw new y(`Attempted to check if:\n ${z(e)}\nis an element of the non-enumerable set:\n ${nr(t)}`);return L(t.base).elements.some(t=>Dr(e,t));case`SetOperation`:return t.operator===`\\cup`?Dr(e,t.left)||Dr(e,t.right):Dr(e,t.left)&&Dr(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Cr(e);if(n===void 0){if(F(e))return!1;throw new y(`Attempted to check if the value:\n${dt(z(e))}\nis an element of ${dt(z(t))}.`)}return n.every(e=>Dr(e,t.base))}default:throw new y(wr(e,t))}},jr=(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?Dr(e,n):e.range.every((e,r)=>jr(e,t.range[r],n.range)),Mr=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){I(e.domain)||yr(e.domain);let t=Zn(e.domain);return Gt(Ut(t,t.map(t=>e.apply(t))),Kt(e))}throw new y(`Expected a function but found ${z(e)}`)},Nr=(e,t,n)=>{let r=dt(z(e)),i=dt(z(t)),a=n===`1.7.4`;switch(Kt(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},Pr=(e,t)=>{if(!Ot.is174)return Nr(e,t);let n=dt(z(t));return Kt(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Fr=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},Ir=e=>new y(`Attempted to apply function with integer domain to the non-integer argument ${dt(z(e))}`),Lr=(e,t,n)=>{throw Ot.is174||e.length<32?e.forEach(e=>On(e,t)):Sr(e,t,Cn),n},Rr=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Kt(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new y(n(e,t));if(a===void 0&&!Ot.is174&&Xn(r))throw Ir(t)}let i=Fr(r,t);return i===-1?Er(Sr,Lr,r,t):i},zr=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!Dr(t,e.domain))throw new y(Kt(e)===`lambda`?Nr(e,t):`Attempted to apply a function to ${z(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new y(`Attempted to apply ${z(e)}, which is not a function`);let r=n??Nr,i=Rr(e,t,r);if(i===-1)throw new y(r(e,t));return e.range[i]},Br=e=>Xn(e)?qn.get(e)??Qn(e.length):void 0,Vr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=Mr(e).domain;return Br(t)??Ht(t)},Hr=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!I(e.domain))){if(!Dr(t,e.domain))return e;let r=n(e.apply(t));return Gt({kind:`LazyFunction`,domain:e.domain,apply:n=>Fn(t,n)?r:e.apply(n),source:e.source},Kt(e))}if(!P(e))throw new y(`Attempted to apply EXCEPT construct to the value ${dt(z(e))}.`);let i=Mr(e),a=Rr(i,t,Pr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Gt(Ut(i.domain,o),Kt(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Yr){let e=ei(c);if(e!==Yr){let t=ei(i.domain[a]);l.hash=s===c?i.hash:i.hash-Jr(t,ei(s))+Jr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-ai(e,s)+ai(e,c)|0}return l},Ur=/* @__PURE__ */ new WeakMap,Wr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Gr=(e,t)=>Math.imul(e^t,16777619),Kr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Wr(t)},qr=e=>Wr(e+2654435769|0),Jr=(e,t)=>Wr(Math.imul(e,668265261)+t|0),Yr=795548749,Xr=e=>{if(e.kind===`ModelValue`)return Wr(Gr(Kr(e.name),109));if(N(e)){if(!I(e))return Yr;let t=L(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=ei(t[e]);if(r===Yr)return Yr;n=n+qr(r)|0}return n}if(e.kind===`LazyFunction`&&!I(e.domain))return Yr;let t=Mr(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=ei(t.domain[e]),i=ei(t.range[e]);if(r===Yr||i===Yr)return Yr;n=n+Jr(r,i)|0}return n},Zr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new y(`TLC has found a state in which the value of a variable contains ${z(e)}`);if(N(e)){L(e).elements.forEach(Zr);return}let t=Mr(e);t.domain.forEach(Zr),t.range.forEach(Zr)},Qr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{ei(e)===Yr&&Zr(e);return}catch(e){if(!(e instanceof y))throw e;return e}},$r=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},ei=e=>{if(typeof e==`number`)return Wr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Kr(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Xr(e)),e.hash;let t=Ur.get(e);if(t!==void 0)return t;let n=Xr(e);return Ur.set(e,n),n},ti=/* @__PURE__ */ new WeakMap,ni=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},ri=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return ni(t)},ii=e=>ni(si(e)+2135587861|0),ai=(e,t)=>ni(Math.imul(si(e),374761393)+si(t)|0),oi=e=>{if(e.kind===`ModelValue`)return ni(ri(e.name)^60);if(N(e)){if(!I(e))return ri(li(e));let t=L(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ii(t[e])|0;return n}let t=Mr(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+ai(t.domain[e],t.range[e])|0;return n},si=e=>{if(typeof e==`number`)return ni(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return ri(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=oi(e)),e.fingerprint;let t=ti.get(e);if(t!==void 0)return t;let n=oi(e);return ti.set(e,n),n},ci=/* @__PURE__ */ new WeakMap,li=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=ci.get(e);if(t!==void 0)return t;let n=ui(e);return ci.set(e,n),n},ui=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${li(e.base)}>`;if(e.kind===`FilteredSet`&&!I(e))throw new y(`Attempted to compare the non-enumerable set ${z(e)} with another value`);if(N(e))return I(e)?`{${L(e).elements.map(li).join(`,`)}}`:`<${e.kind} ${z(e)}>`;let t=Mr(e);return`(${t.domain.map((e,n)=>`${li(e)}:${li(t.range[n])}`).join(`,`)})`},di=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,fi=e=>e.reduce((e,t)=>e===0?0:e*yr(t),1),pi=e=>{if(e.kind===`Subset`)return yr(e.base)<=6?L(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return L(e);if(e.kind===`FunctionSet`&&I(e.domain)&&yr(e.domain)===0)return Ht([Ut([],[])]);let t=e.kind===`FunctionSet`?yr(e.range)**yr(e.domain):fi(e.kind===`RecordSet`?e.sets:e.factors);return t===0?zn:t<=1999?L(e):void 0},mi=(e,t)=>{if(t)return pi(e);if(I(e))try{return pi(e)}catch(e){if(e instanceof y)return;throw e}},hi=(e,t)=>{let n=e=>z(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return nr(e,t)}},gi=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),_i=e=>{if(I(e.domain))try{return Mr(e)}catch(e){if(e instanceof y)return;throw e}},z=(e,t=!1,n=!1)=>{let r=e=>z(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return di(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(L(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=mi(e,t);return n?r(n):hi(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?_i(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${z(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Ot.is174&&Kt(e)!==`tuple`)return`<< >>`;let a=r=>z(r,t,n&&Kt(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Kt(e)===`record`||i.domain.every(e=>typeof e==`string`&&gi(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):_t(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},vi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${dt(z(n))}\n`).join(``)},yi=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},bi=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=ei(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||on(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||on(i[e],n))return i[e]}return n.kind===`Set`?yi(n.elements,t):(yi(n.domain,t),yi(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}},xi=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},B=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Si=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),Ci=(e,t)=>Si.has(e)?new y(t):new S(t),wi=e=>typeof e==`object`&&e.kind===`Operator`,V=(e,t,n)=>{let r=e[t];if(r===void 0||wi(r))throw Ci(n,`${n} expects a value as argument ${t+1}`);return r},Ti=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`number`)throw Ci(n,`${n} expects an integer but received ${z(r)}`);return r},Ei=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`boolean`)throw Ci(n,`${n} expects a boolean but received ${z(r)}`);return r},Di=(e,t,n)=>{let r=V(e,t,n);if(!N(r))throw Ci(n,`${n} expects a set but received ${z(r)}`);return r},Oi=(e,t,n)=>{let r=Di(e,t,n);if(!I(r))throw Ci(n,`${n} cannot enumerate the non-enumerable set ${z(r)}`);return r},ki=(e,t,n)=>L(Oi(e,t,n)),Ai=(e,t,n)=>ki(e,t,n).elements,ji=(e,t,n)=>{let r=V(e,t,n),i=Cr(r);if(!i)throw Ci(n,`${n} expects a sequence but received ${z(r)}`);return i},Mi=(e,t,n)=>{let r=V(e,t,n);if(!P(r))throw Ci(n,`${n} expects a function but received ${z(r)}`);return Mr(r)},Ni=(e,t,n)=>{let r=e[t];if(r===void 0||!wi(r))throw Ci(n,`${n} expects an operator as argument ${t+1}`);return r},Pi=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),H=(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}),Fi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Ii=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Li=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(V(n,0,e),V(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Ri=e=>e>2147483647||e<-2147483648,zi=e=>new S(`Overflow when computing ${e}`),Bi={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`},Vi={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Hi={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},Ui={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Wi=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Vi[e.operator];if(e.kind!==`Function`)return Bi[e.kind];let t=Kt(e);return t===void 0?`FcnRcdValue`:Ui[t]},Gi=e=>Hi[Wi(e)],Ki=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),qi=(e,t)=>{let n=n=>(...r)=>{let i=Tr.sets?.length??0;try{return n(...r)}catch(n){throw n instanceof y&&(e.isLazy===!0||!(n instanceof S))?(Tr.sets&&(Tr.sets.length=i),Ki(t,n.message)):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Ji=(e,t)=>{if(typeof e!=`number`)throw Ki(t,`Cannot cast tlc2.value.impl.${Wi(e)} to tlc2.value.impl.IntValue`);return e},Yi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Xi=(e,t,n,r)=>{let i=Yi(e,n,`IntValue`,2);return Li(t,(e,n)=>{let a=Ji(e,i),o=Ji(n,i),s=r(a,o);if(Ri(s))throw zi(`${a}${t}${o}`);return s})},Zi=(e,t,n)=>{if(typeof e!=`number`)throw new S(`The ${t} argument of ${n} should be an integer, but instead it is:\n${z(e)}`);return e},Qi=(e,t,n=e)=>Li(e,(e,r)=>t(Zi(e,`first`,n),Zi(r,`second`,n))),$i=(e,t,n)=>({...Ii(e,t,n),isLazy:!0}),ea=(e,t,n)=>{let r=Ni(e,t,n);return()=>r.call([])},ta=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),na=()=>({bool:bl,condition:(e,t)=>{if(typeof e!=`boolean`)throw ol(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw sl(t,n,e);return e},apply:zr,expectFunction:_l,tuple:$n,set:Rn,record:tn,writtenRecord:vt,equal:nn,enumerate:jl,unassigned:(e,t)=>{throw jd(e,t)},primeOutsideAction:e=>{throw Nd(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:vl,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>hl(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),ra={value:void 0},ia=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),aa=e=>`local${e.counter++}`,oa=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),xi(e).forEach(e=>oa(e,t)),t),sa=(e,t,n)=>{let r=ia(e,Ju(t,e.environment)),i=oa(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=ia(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},ca=(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(()=>aa(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${fa(e,t.set,s)}, ${ia(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=aa(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${fa(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=aa(e),a=aa(e),o=aa(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; let applied; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},la=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${fa(e,r[0],n)}, "the left side of =>") ? bool(${fa(e,r[1],n)}, "the right side of =>") : true)`;if(B(t))return sa(e,t,n);let i=ru(t.operator,e.environment);if(i?.kind!==`Builtin`)return sa(e,t,n);if(i.name===`DOMAIN`)return`${ia(e,ul(t))}(${fa(e,r[0],n)})`;if(i.name===`TLCEval`)return sa(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${ia(e,dl(t,i))}(${fa(e,r[0],n)}, ${fa(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&td(r[0],a))return`${ia(e,i.evaluateUnary)}(${fa(e,r[0],n)})`;let o=r.length===2&&td(r[0],a)&&td(r[1],a);return i.evaluateBinary&&o?`${ia(e,i.evaluateBinary)}(${fa(e,r[0],n)}, ${fa(e,r[1],n)})`:sa(e,t,n)},ua=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(B(e))return!1;let r=pu(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ua(e.expression,t,n);case`FieldAccess`:return ua(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ua(e,t,n));default:return!1}},da=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return da(e.record);case`FunctionApplication`:return[e.function,...e.args].every(da);default:return!1}},fa=(e,t,n)=>{let r=(t,r=n)=>fa(e,t,r);if(zu(t)&&Pu(t,e.environment))return sa(e,t,n);switch(t.kind){case`Number`:return xu(t.value)?String(t.value):sa(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(B(t))return sa(e,t,n);let i=pu(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=ia(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?ia(e,i.value):sa(e,t,n)}case`Apply`:return la(e,t,n);case`And`:case`Or`:{let n=ia(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${ia(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Td(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${ua(t.function,n,e.environment)?r(t.function):da(t.function)?r(t.function,i):sa(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${ia(e,t)}))`,o=ll(e.environment.runtime.version),s=o?`, ${ia(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${ia(e,cl(t))}(${r(t.record)})`;case`Record`:{let i=kd(t.fields);if(Ad(i))return sa(e,t,n);let a=ia(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}, ${ia(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=ia(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`)?ca(e,t,n):sa(e,t,n);default:return sa(e,t,n)}},pa=(e,t)=>{if(!ta.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=fa(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; let applied; return ${r}; };`;ra.value??=na();let o=ra.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ma={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},ha={none:0,error:1,warning:3,state:4},ga={0:``,1:`Error: `,3:`Warning: `,4:`State `},_a=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===ha.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
30
+ (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${ga[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},va=`The configuration file did not specify the initial state predicate.
31
31
  Can also be caused by trying to run TLC on a specification from
32
- a module imported with a parameterized INSTANCE statement.`,fa=[[1005,b,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
32
+ a module imported with a parameterized INSTANCE statement.`,ya=[[1005,b,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
33
33
  %1%`,!0],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
34
34
  %1%,
35
35
  but it produced the following error:
@@ -52,7 +52,7 @@ element is not a bag:
52
52
  %5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
53
53
  on the right-hand side of a <- after already appearing on the
54
54
  left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
55
- is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,da,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
55
+ is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,va,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
56
56
  %1%`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
57
57
  %1%`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
58
58
  but instead found %3%.
@@ -70,14 +70,14 @@ The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configurat
70
70
  Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
71
71
  It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
72
72
  %1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
73
- `,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]],pa={value:void 0},ma=()=>pa.value??=fa.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),ha=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,ga=e=>ha.test(e)?void 0:ma().find(t=>t.pattern.test(e))?.message,_a=e=>e instanceof C||ga(e.message)?.isEvalException===!0,va=/* @__PURE__ */ new Map([[1e3,`
73
+ `,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]],ba={value:void 0},xa=()=>ba.value??=ya.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),Sa=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,Ca=e=>Sa.test(e)?void 0:xa().find(t=>t.pattern.test(e))?.message,wa=e=>e instanceof S||Ca(e.message)?.isEvalException===!0,Ta=/* @__PURE__ */ new Map([[1e3,`
74
74
  : `],[2105,`failed.
75
75
  `],[2154,`but it produced the following error:
76
76
  `],[2213,`:
77
- `],[2281,` - specifically: `]]),ya=(e,t,n)=>{let r=n?va.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${ba(t.slice(a),n)}`},ba=(e,t)=>{let n=t?ga(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${ca.none} @!@!@\n${ya(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},xa=e=>String(e).padStart(2,`0`),Sa=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${xa(r%24)}h`:e>36e5?`${xa(r%24)}h ${xa(n)}min`:e>6e4?`${xa(n)}min ${xa(t)}s`:`${xa(t)}s`},Ca=e=>`${e.getFullYear()}-${xa(e.getMonth()+1)}-${xa(e.getDate())} ${xa(e.getHours())}:${xa(e.getMinutes())}:${xa(e.getSeconds())}`,wa={kind:`Local`},Ta=/* @__PURE__ */ new WeakSet,Ea=/* @__PURE__ */ new WeakMap,Da=/* @__PURE__ */ new WeakMap,Oa=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ka=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),Aa=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,ja=e=>e.kind===`Operator`?e.params.length:0,Ma=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Na=e=>e.name.includes(`!`),Pa=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Fa=(e,t,n)=>{let r=t.bindings.get(e);return r&&Aa(r.position,t.location)&&(!n||Aa(r.position,n.start))?r:void 0},Ia=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),La=(e,t,n,r)=>{if(t===void 0)return!0;if(Ia(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=g(i),o=t.range&&g(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},Ra=(e,t,n,r)=>La(t,Pa(e,t)??Fa(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,za=(e,t,n)=>{La(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ba=(e,t,n,r)=>t.reduce((e,t,i)=>Ra(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Va=(e,t,n)=>t.reduce((e,t)=>Ra(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ha=e=>e.kind===`Name`?[e.name]:e.names,Ua=e=>e.flatMap(e=>Ha(e.pattern)),Wa=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Aa(n.location,t.location))?n:void 0},Ga=(e,t)=>{let n=Wa(e,t);return n?{key:t.getKey(n),arity:ja(n),params:Ma(n),kind:`Definition`}:t.imported.get(e)},Ka=(e,t,n)=>Pa(t,e)??Ga(e,n),qa=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Ja=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return Aa(e.location,e.args[0].location)?`prefix`:`postfix`}},Ya=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),Xa=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Za=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Qa=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},$a=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Qa(e.name,[],void 0):Qa(e.operator,e.args,e.argumentCounts),eo=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),to=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Ua(e.bounds),body:e.body,sets:eo(e.bounds)};case`SetMap`:return{names:Ua(e.bounds),body:e.expression,sets:eo(e.bounds)};case`SetFilter`:return{names:Ha(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ha(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}},no=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}},ro=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,io=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),ao=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?ao(e.body,t):hi(e).reduce((e,n)=>e??ao(n,t),void 0)},oo=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??oo(i,t,n||io(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&ao(e.set,t):ao(e,t)},so=e=>e.kind===`Label`?so(e.body):e,co=e=>typeof e==`number`?`argument selector ${e}`:e,lo=`within the scope of a declaration
78
- from outside that declaration's scope.`,uo=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:g(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&so(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:oo(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?ao(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&io(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${lo}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=co(n.operand);if(l.isSufficesOpen){if(Za(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=so(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Ka(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=to(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:no(e);if(!c)return;let f=Za(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=Za(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(io(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${lo}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},fo=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:g(e.location.range),message:n}),!0)},po=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=g(r),a=e.params.filter((r,i)=>{let a=Pa(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:g(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},mo=(e,t,n,r)=>{if(!ro(e))return!1;let i=$a(e),a=i[0],o=i.length>1&&a.kind===`Name`?Pa(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&uo(e,i,o,t,n,r),o!==void 0},ho=(e,t,n,r)=>{let i=e.location;if(Co(e,n,r))return;let a=Da.get(e);if(a!==void 0)return a;if(Oa(t)||mo(e,n,r,!1)||Xa(t))return e.kind===`Apply`?e.args.length:0;let o=Pa(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=wa),o)return o.arity;let s=Ga(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Da.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(Pa(n,c)!==void 0||Ga(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=g(qa(i,e.kind===`Apply`&&l===`-.`?`-`:l));if(!Ya(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=Ja(e);d&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},go=(e,t,n)=>(e.forEach(e=>U(e.set,t,n)),e.reduce((e,t)=>Ba(e,Ha(t.pattern),t.pattern.ranges,n),t)),_o=(e,t)=>e.kind===`Identifier`&&e.name===t&&B(e)||hi(e).some(e=>_o(e,t)),vo=(e,t)=>{e.kind===`FunctionConstruction`&&_o(e.body,t)&&(e.isRecursive=!0),hi(e).forEach(e=>vo(e,t))},yo=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Ua(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:g(o),message:e})},c=e.kind===`Function`?go(e.bounds,t,i):Va(t,e.params,i),l=Pa(c,a)??Fa(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(U(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),vo(e.body,a),e.isSelfReferential=_o(e.body,a)):U(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:La(a,Pa(t,a)??Fa(a,i,o),{kind:`Definition`,arity:ja(e),range:o},i)},bo=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Pa(e,t.name)?.isPending)return e;let n={name:t.name,arity:ja(t),params:Ma(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>Io(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Oa(t.name)?e:s(e,e=>!Aa(t.location,e.location)),o={name:t.name,arity:ja(t),kind:`Definition`,range:t.location.range,parent:a};if(Na(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Oa(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return yo(t,a,u,i)?{...o,params:Ma(t)}:a},a),()=>!0)},xo=(e,t,n)=>{let r=e.operator,i=Ka(r,t,n),a=ho(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:g(e.argumentsRange??qa(e.location,r)),message:`The operator ${r} requires ${a} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>So(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:g(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=ho(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else U(i,t,n);return!0}if(i.kind===`Lambda`){U(i,t,n);let o=i.params.length===c;return!o&&Ta.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??qa(e.location,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return U(i,t,n),!0;if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=Ka(u,t,n)?.params??[],f=ho(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(qa(i.location,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},So=(e,t,n)=>{e.kind===`Identifier`?ho(e,e.name,t,n):U(e,t,n)},Co=(e,t,n)=>{let r=Ea.get(e);return r?(r.args.forEach(e=>So(e,t,n)),n.errors.push(r.error),!0):!1},U=(e,t,n)=>{if(Ta.has(e)&&!n.isGenerated){U(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>U(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=e.name,i=ho(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:g(qa(e.location,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:ho(e,e.operator,t,n);return;case`Apply`:xo(e,t,n);return;case`Lambda`:U(e.body,Ba(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:U(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&&U(e.other,t,n);return;case`Let`:U(e.body,bo(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:U(e.body,go(e.bounds,t,n),i(Ua(e.bounds)));return;case`UnboundedQuantifier`:U(e.body,Ba(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&U(e.set,t,n),U(e.body,Ba(t,Ha(e.pattern),e.pattern.ranges,n),i(Ha(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:U(e.predicate,go([e.bound],t,n),i(Ha(e.bound.pattern)));return;case`SetMap`:U(e.expression,go(e.bounds,t,n),i(Ua(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:g(r.location.range??qa(r.location,r.name)),message:`Non-unique fields in constructor.`}),U(r.value,t,n)});return;case`Except`:U(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),U(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:U(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(fo(e,n))return;U(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),po(e,t,n);return;case`Subexpression`:if(Co(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>So(e,t,n)),mo(e,t,n,!1)}},wo=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||mo(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;n.facts.has(r)||U(e,t,n)}),To=(e,t,n)=>(e.set&&U(e.set,t,n),Ra(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Eo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:To(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Eo(t,e.scope,e.unit,!0):U(t,e.scope,e.unit),e),{scope:t,unit:n});return U(e.conclusion,i.scope,i.unit),i.scope},Do=(e,t,n)=>e.kind===`AssumeProve`?Eo(e,t,n):(U(e,t,n),t),Oo=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&wo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Ao(t,e,r),t)},ko=(e,t,n)=>{let r=Io(e,t,n);return e.name===void 0?r:Ra(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Ao=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set};switch(r.kind){case`Assert`:{let a=Do(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Oo(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Oo(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return wo(r.facts,t,n),t;case`Instance`:return ko(r,t,i);case`Define`:return r.definitions.reduce((e,t)=>t.kind===`Instance`?ko(t,e,i):bo([t],e,n),t);case`Have`:case`Case`:return U(r.expression,t,i),Oo(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>U(e,t,i)),t;case`Take`:return Ba(go(r.bounds,t,i),r.names,r.nameRanges,i);case`Pick`:{let a=Ba(go(r.bounds,t,i),r.names,r.nameRanges,i);return U(r.body,a,{...i,labelParams:[...i.labelParams,...Ua(r.bounds),...r.names]}),Oo(e.proof,t,n),a}default:return Oo(e.proof,t,n),t}},jo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Do(e.statement,void 0,t);e.name!==void 0&&za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Oo(e.proof,n,t),r&&(r.isInProof=!1)},Mo={line:0,column:0},No=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Po=(e,t)=>{let n=new Map([...ka,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},Fo=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){U(n,a,i);return}let r=ho(n,n.name,a,i);if(r!==void 0&&r!==t.arity)throw new u(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},s=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:g(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;o(r,a);let c=a.location.range;s.has(n)?c&&i.errors.push({location:g(c),message:`Multiple substitutions for symbol '${n}' in substitution.`}):s.set(n,a)});let c=t.filter(e=>!s.has(e.name)),l=e=>!Pa(a,e.name)&&!Ga(e.name,i);return c.filter(e=>!l(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};o(t,n),s.set(t.name,n)}),c.filter(l).forEach(t=>{let r=e.location.range,a=t.location.range;r&&a&&i.errors.push({location:g(r),message:`Substitution missing for symbol ${t.name} declared at ${g(a)} \nand instantiated in module ${n}.`})}),s},Io=(e,t,n)=>{let r=n.getInstance(e);return Fo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ra(e,t,r,n),t)},Lo=(e,t,n,r)=>{let i=Po(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Fo(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:Mo}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Ro=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>Aa(e.location,t.location)?-1:+!!Aa(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof u)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},zo=(e,t)=>{let n=Po(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...ka,...t.bound].map(([e,t])=>[e,{...t,position:Mo}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>za(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return Ro([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=La(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);No(e,t)?U(t.body,void 0,i):yo(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:ja(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);Va(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>za(t,e,i)),e.name!==void 0&&za(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);U(e.expression,void 0,r),e.name!==void 0&&za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>jo(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>wo(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:g(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Bo=/* @__PURE__ */ new WeakSet,Vo=/* @__PURE__ */ new WeakSet,Ho=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Jo(e,(e,r)=>Ho(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&B(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&B(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Uo=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Wo=/* @__PURE__ */ new WeakMap,Go=e=>Wo.get(e)??e.name,Ko=(e,t)=>(Go(t)!==e.name&&Wo.set(e,Go(t)),e),qo=(e,t)=>Ko(e.kind===`Function`?{...e,bounds:Uo(e.bounds,e=>t(e,[])),body:t(e.body,Ua(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Jo=(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=>qo(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Uo(e.bounds,n),body:t(e.body,Ua(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,Ha(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,Ha(e.bound.pattern))};case`SetMap`:return{...e,bounds:Uo(e.bounds,n),expression:t(e.expression,Ua(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Yo=`LAMBDA`,Xo=(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 Jo(e,(e,n)=>(r.push(...Xo(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Zo=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}},Qo=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),$o=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},es=(e,t)=>e.map(e=>({pattern:$o(e.pattern,t),set:e.set})),ts=(e,t)=>e.kind===`Function`?{...e,bounds:es(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},ns=(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=>Ko({...ts(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:es(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:$o(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:$o(e.bound.pattern,n),set:e.bound.set}};default:return e}},rs=e=>`${e}@ENABLED`,is=(e,t)=>e.modes.get(t)??e,as=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!B(e)&&t.instantiation.variables.has(e.name),os=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>os(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(as(e,t,n))return[e.name];let r=B(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?os(r.body,t,/* @__PURE__ */ new Map):void 0},ss=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return as(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:rs(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:fs(e.expression,is(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[fs(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:fs(e.subscript,is(t,`Primed`),n),location:r},fs(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=os(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:rs(r),location:e.location},location:e.location},fs({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},cs=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),ls=(e,t)=>e.map(e=>cs(e.name,t)),us=(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:[...ls(t,r),...i.map(e=>cs(e,r))],location:r},location:r}},ds=(e,t)=>e.instantiation.isParameterized(t)?ms(e,t):void 0,fs=(e,t,n)=>{let r=e=>fs(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!B(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:fs(e.expression,is(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:fs(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},is(t,`Enabled`),n)};let s=ss(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Bo.add(n),n;let r=ds(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&&ja(o)>0?us(r,a,ja(o),e.location):{kind:`Apply`,operator:r,args:ls(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||Vo.has(e),c=e=>(s&&Vo.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:Yo,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:Yo,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new u(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=ds(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...ls(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=ds(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?us(n,a,ja(r),e.location):{...e,operator:n}}let c=Zo(t),l=Jo(e,(e,i)=>i.length===0?r(e):fs(e,t,Qo(n,i,c)));return ns(l,n,c)},ps=(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:cs(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ms=(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=Zo(e),o=ts(qo(i,(t,n)=>fs(t,e,Qo(/* @__PURE__ */ new Map,n,a))),a);return ps(o,r.params,i.location)}):t},hs=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Xo(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=>ds(i,e)??e,getQualifiedKey:t=>{let n=ds(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>ps(r,e.params,r.location)):t}}},gs=e=>e.kind===`Let`&&e.instances!==void 0||hi(e).some(gs),_s=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Jo(e,e=>_s(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Aa(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},vs=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ys=(e,t)=>e.definitions.some(e=>gs(e.body))||e.assumptions.some(e=>gs(e.expression))||e.theorems.some(e=>{let t=vs(e);return t!==void 0&&gs(t)})?{...e,definitions:e.definitions.map(e=>qo(e,e=>_s(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:_s(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=vs(e);return n===void 0?e:{...e,statement:_s(n,t,[])}})}:e,bs=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=Sr.sets,a=i??[],o=a.length;Sr.sets=a;try{return n()}catch(e){throw Fu(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,Sr.sets=i}},xs=(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},Ss=e=>!e.includes(void 0),Cs=e=>e.variables.map(()=>void 0),ws=(e,t,n)=>{let r=[...e];return r[t]=n,r},Ts=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Es=e=>e.kind===`Identifier`?e.name:void 0,Ds=(e,t,n)=>{if(t.kind===`Label`)return Ds(e,t.body,n);let r=Es(t);if(r===void 0)return;let i=il(n,r);if(i?.kind===`Thunk`)return Ds(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=ql(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Ds(e,o.body,o.scope):void 0},Os=(e,t,n)=>{if(t.kind===`Prime`)return Ds(e,t.expression,n);if(t.kind===`Label`)return Os(e,t.body,n);let r=Es(t);if(r===void 0)return;let i=il(n,r);if(i?.kind===`Thunk`)return Os(e,i.expression,i.scope);if(i)return;let a=ql(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Os(e,a.body,a.scope):void 0},ks=e=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean expression.`);return e},As=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),js=(e,t,n)=>{t===void 0?Ss(n)&&e.onState(n):Ss(n)&&As(e)?Ns(e,t,n):t.kind===`Predicate`?Ps(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?Us(e,t.expression,t.rest,t.scope,n):Ms(e,t,n)&&js(e,t.rest,n)},Ms=(e,t,n)=>{let r=e.environment,i=W(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return W(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?fd(t,r.runtime.version):t}})();return!Qt(i,a)},Ns=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){Us(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Ms(e,r,n):!ks(W(r.expression,xs(e,r.scope,n))))return}e.onState(n)},Ps=(e,t,n,r,i)=>bs(e,t,()=>{switch(t.kind){case`Let`:Ps(e,t.body,n,lu(t.definitions,xs(e,r,i)),i);return;case`Label`:Ps(e,t.body,n,r,i);return;default:if(Vs.has(t.kind))throw new y(`The state relation is not a boolean expression.`);bs(e,t,()=>Hs(e,t,n,r,i))}}),Fs=(e,t,n,r)=>{ks(t)&&js(e,n,r)},Is=(e,t,n,r,i)=>{let a=xs(e,r,i);if(t.kind===`Identifier`){let o=il(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Ps(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Ps(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:ql(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&hl(s,e.environment))){Ps(e,c.body,n,c.scope,i);return}Fs(e,W(t,a),n,i);return}let o=Yl(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Ps(e,o.body,n,su(o,t.args,a),i):Fs(e,W(t,a),n,i)},Ls=(e,t,n,r,i)=>{let a=n[r];a===void 0?js(e,t,ws(n,r,i)):Qt(a,i)&&js(e,t,n)},Rs=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),zs=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?Ds(e,a,r):Os(e,a,r),c=xs(e,r,i);if(s===void 0){W(t,c)===!0&&js(e,n,i);return}let l=W(o,c),u=i[s];if(t.operator===`=`){Ls(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)W(t,c)===!0&&js(e,n,i);else{if(!Zn(d))throw new y(`The right side of \\IN is not enumerable.`);for(let t of lr(d))js(e,n,ws(i,s,t))}},Bs=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Vs=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Hs=(e,t,n,r,i)=>{let a=xs(e,r,i);switch(t.kind){case`Identifier`:Is(e,t,n,r,i);return;case`Apply`:if(Bs.has(t.operator)&&t.args.length===2){zs(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(ks(W(t.args[0],a))){Ps(e,t.args[1],n,r,i);return}js(e,n,i);return}Is(e,t,n,r,i);return;case`And`:{let a=t.operands;if(t.isBulleted||a.length===2){let t=a.slice(1).reduceRight((e,t)=>Rs(`Predicate`,t,r,e),n);Ps(e,a[0],t,r,i);return}let o=a[a.length-1];Ps(e,Ts(t,a.length-1),Rs(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>Ps(e,t,n,r,i));return}Ps(e,Ts(t,a.length-1),n,r,i),Ps(e,a[a.length-1],n,r,i);return}case`Exists`:El(t.bounds,a,r=>(Ps(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(El(t.bounds,a,e=>(r.push(e),!1)),r.length===0){js(e,n,i);return}let o=r.slice(1).reduce((e,n)=>Rs(`Predicate`,t.body,n,e),n);Ps(e,t.body,o,r[0],i);return}case`If`:Ps(e,ks(W(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>ks(W(e.condition,a)))?.body??t.other;if(o===void 0)throw new y(`TLC encountered a CASE with no conditions true.`);Ps(e,o,n,r,i);return}case`FunctionApplication`:{let r=jl(W(t.function,e.isInit?a:cl(a)));if(r){Ps(e,r.body,n,Ml(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){Us(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){Ps(e,t.action,n,r,i),Us(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){Ps(e,t.action,Rs(`Changed`,t.subscript,r,n),r,i);return}}Fs(e,W(t,a),n,i)},Us=(e,t,n,r,i)=>bs(e,t,()=>{let a=Ds(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Ls(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){js(e,n,i);return}let s=o.reduceRight((e,t)=>Rs(`Unchanged`,t,r,e),n);Us(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=il(r,t.name);if(a?.kind===`Thunk`){Us(e,a.expression,n,a.scope,i);return}let o=a?void 0:ql(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){Us(e,o.body,n,o.scope,i);return}}let o=e.environment,s=W(t,{environment:o,scope:r,state:e.current,next:void 0}),c=W(t,{environment:o,scope:r,state:i,next:void 0});Qt(s,c)&&js(e,n,i)}),Ws=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},Gs=/* @__PURE__ */ Error(`The replay found a successor`),Ks=(e,t,n,r)=>{let i=Ws(r,!1,n,()=>{throw Gs},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Rs(`Changed`,e.subscript,t,void 0);Ps(i,e.action,n,t,Cs(r))}else Ps(i,e,void 0,t,Cs(r));return!1}catch(e){if(e!==Gs)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},qs=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Ws(t,!0,void 0,n),o=i.reduceRight((e,t)=>Rs(`Predicate`,t.expression,t.scope,e),void 0);Ps(a,r.expression,o,r.scope,Cs(t))},Js=(e,t,n,r)=>{e.some(e=>Vs.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Ws(n,!1,t,e=>i.push(e));Ps(a,e.expression,void 0,e.scope,Cs(n)),i.forEach(t=>r(t,e))})},Ys=/* @__PURE__ */ new WeakMap,Xs=/* @__PURE__ */ new WeakMap,Zs=(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},Qs=(e,t,n)=>{let r=e.slice();return r[t]=n,r},$s=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,ec=(t,r)=>{let i=new y(r);return t.isInit?i:n(i,e.error)},tc=(e,t,n,r)=>{let i=Yc(n);return r&&Vs.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${$s(e)}, TLC expected a boolean expression,\nbut instead found ${z(t)}.\n${i}`},nc=(e,t,n)=>{let r=zi(t),i=Jc(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${$s(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
79
- `:``}${i}`},rc=(e,t,n,r=!0)=>{let i=W(t,n);if(typeof i==`boolean`)return i;throw ec(e,tc(e,i,t,r))},ic=e=>e===`=`||e===`\\in`||e===`\\subseteq`,ac=(e,t,n)=>{let r=n?Ys:Xs,i=r.get(e);if(i)return i;let a=Mc(e,t,n);return r.set(e,a),a},oc=(e,t)=>{if(t.constants.has(e))return;let n=dl(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},sc=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return sc(e.expression,t,!1,r);if(e.kind!==`Identifier`||B(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=oc(e.name,t);if(a&&!r.has(a))return r.add(a),sc(a.body,t,n,r)},cc=(e,t,n)=>sc(e,t,!n),lc=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return lc(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=lu(e.definitions,Zs(r,t,n));return lc(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=il(t,e.name);if(a?.kind===`Thunk`)return lc(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=oc(e.name,r.environment);if(s)return lc(s.body,void 0,n,r,i)},uc=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||B(e))||!t&&e.kind===`Prime`,dc=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>dc(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=oc(e.name,t);if(i)return n.add(e.name),dc(i.body,t,n)},fc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),pc=(e,t,n)=>fc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||ic(e.operator)&&(uc(e.args[0],n)||cc(e.args[0],t,n)!==void 0)||B(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,mc=/* @__PURE__ */ new Set,hc=(e,t)=>{if(B(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Jo(e,(e,i)=>{let a=r.isReadOnly?hc(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},gc=(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||B(e)?void 0:dl(r,t);return i&&!n.has(i)&&(n.add(i),gc(i.body,t,n))?!0:hi(e).some(e=>gc(e,t,n))},_c=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=cc(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=dc(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return pc(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:ac(e,t,n)}},vc=(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(vd(e,t)===void 0||gc(e,t,/* @__PURE__ */ new Set))return!0;let n=hc(e,mc);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)}},yc=(e,t,n)=>{let r=e.map(e=>_c(e,t,n)),i=(e,t,n,a,o,s)=>{let c=a,l,u=As(t);for(let a=e;a<r.length;a++){if(a>0&&u&&Ic(c)){l??=Zs(t,n,c);for(let e=a;e<r.length;e++)if(!rc(t,r[e].expression,l,!1))return;s(c,o);return}let e=r[a];if(e.kind===`Guard`){if(l??=Zs(t,n,c),!rc(t,e.expression,l))return;continue}if(e.kind===`Assign`){l??=Zs(t,n,c);let r=W(e.value,l),i=c[e.index];if(i===void 0)c=Qs(c,e.index,r),l=void 0;else if(!Qt(i,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=c[t];if(e===void 0)c=Qs(c,t,n[t]),l=void 0;else if(!Qt(e,n[t]))return}continue}let d=a+1;e.runner(t,n,c,o,!0,(e,r)=>i(d,t,n,e,r,s));return}s(c,o)};return(e,t,n,r,a,o)=>i(0,e,t,n,r,o)},bc=e=>(t,n,r,i,a,o)=>{rc(t,e,Zs(t,n,r))&&o(r,i)},xc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Zs(r,i,a);if(a[l]!==void 0){rc(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Zn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${$s(r)}, the right side of \\IN is not enumerable.`;throw ec(r,`${t}\n${Jc(e)}`)}let p=lr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Qs(a,l,p[e]),o)}},Sc=/* @__PURE__ */ new WeakMap,Cc=e=>{let t=Sc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Cc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Sc.set(e,n),n},wc=(e,t)=>{let n=e.args[0],r=bc(e),i=(e,r,i)=>lc(n,r,i,e,!t)??-1,a=xc(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],Zs(t,n,o));l(Qs(o,u,d),s)}},Tc=(e,t,n)=>{let r=Jc(e);return(i,a,o,s,c,l)=>{let u=Zs(i,a,o),d=W(e.function,n?u:cl(u)),f=jl(d);if(f!==void 0){ac(f.body,t,n)(i,Ml(f,e,u),o,s,c,l);return}if(!F(d))throw ec(i,`In computing ${$s(i)}, a non-function (${zi(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw ec(i,`In computing ${$s(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Ec=(e,t)=>{if(dc(e,t))return yc([Cc(e)],t,!1);if(e.kind===`Tuple`)return ac(Cc(e),t,!1);let n=Cc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?il(i,e.name):void 0;l?.kind===`Thunk`?ac(Cc(l.expression),t,!1)(r,l.scope,a,o,s,c):rc(r,n,Zs(r,i,a))&&c(a,o)}},Dc=(e,t,n)=>{let r=e.operator,i=bc(e),a=B(e)?void 0:ql(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Ju(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=ac(a.body,t,n),o.body(e,i(Zs(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Zs(a,o,s),f=Yl(e,d);f?.kind===`Closure`?ac(f.body,t,n)(a,su(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Oc=(e,t,n)=>{let r=bc(e),i=B(e)?void 0:oc(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=il(s,e.name);f?.kind===`Thunk`?ac(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=ac(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},kc=(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!==`=`||B(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`||!B(a))return;let o=sc(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=>kc(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`||B(e))return;let r=ql(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=kc(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`&&B(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Ac=(e,t,n)=>{let r=il(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},jc=(e,t,n)=>{let r=e.map(e=>ac(e,t,n)),i=n?[]:e.map(e=>kc(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&&Ac(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)}},Mc=(e,t,n)=>{let r=e=>ac(e,t,n);switch(e.kind){case`And`:return yc(e.operands,t,n);case`Or`:return jc(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(n,r,o,s,c,l)=>{let u=yl(W(a.set,Zs(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,al(r,e,u[t]),o,s,c,l)}}let o=n?void 0:vc(e,t);if(o){let r=yc(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=Zs(n,i,a),d=e.bounds.map(e=>yl(W(e.set,u),e.set,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=al(t,o.names[e],r);if(e===d.length-1){let e=Zs(n,i,a);if(!o.guards.every(t=>rc(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{El(e.bounds,Zs(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&vd(e,t)!==void 0&&!gc(e.body,t,/* @__PURE__ */ new Set)?hc(e,mc):void 0;return(t,n,r,o,s,c)=>{let l=[];El(e.bounds,Zs(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>il(n,e)?.kind===`Value`)){u.every(n=>rc(t,e.body,Zs(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Ic(r)?u.slice(n).every(n=>rc(t,e.body,Zs(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=W(e.condition,Zs(r,i,a));if(typeof l!=`boolean`)throw ec(r,nc(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=Zs(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw ec(r,`In computing ${$s(r)}, a non-boolean expression${r.isEnabled?``:` `}(${zi(t)}) was used as a guard condition of a CASE.\n${Yc(e.source)}`)})?.body??n;if(!u)throw ec(r,`In computing ${$s(r)}, TLC encountered a CASE with no conditions true.\n${Jc(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=bu(e.definitions,t);return(t,r,a,o,s,c)=>n(t,lu(e.definitions,Zs(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new y(`UNCHANGED appears in an initial predicate at ${Kc(e)}`)}:Ec(e.expression,t);case`AngleAction`:{let n=r(e.action),i=Cc(e.subscript),a=(e,n,r)=>{try{return rc(e,i,Zs(e,n,r))}catch(n){throw e.isEnabled?fd(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,Cc(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Oc(e,t,n);case`FunctionApplication`:return Tc(e,t,n);case`Apply`:{let i=e.args;if(ic(e.operator)){let r=cc(i[0],t,n);if(r!==void 0)return e.operator===`=`?yc([e],t,n):xc(e,()=>r);if(uc(i[0],n))return wc(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=W(i[0],Zs(t,n,r));(typeof c==`boolean`?c:ul(c,`the left side of => at ${Kc(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Dc(e,t,n)}default:return bc(e)}},Nc=/* @__PURE__ */ new WeakMap,Pc=e=>{let t=Nc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Nc.set(e,n),n},Fc=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Ic=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Lc=(e,t)=>{let n=t.state;if(!n||!Ic(n))throw new y(`ENABLED needs a complete state at ${Kc(e)}`);let r=t.environment;if(r.callStack)return Ks(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return ac(e,r,!1)(i,t.scope,Pc(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Rc=(t,r,i,a)=>{let o={environment:r,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};ac(t,r,!0)(o,a,Pc(r),void 0,!1,t=>{if(!o.isStopped){if(!Ic(t))throw n(new te([...t]),e.error);o.isStopped=i(t)}})},zc=(e,t,n)=>{let r=[];return Rc(e,t,e=>(r.push(e),!1),n),r},Bc=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return ac(e,n,!1)(a,i,Pc(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Ic(e)){let r=Fc(e,n);throw new x(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Vc=(e,t,n,r)=>{let i=[];return Bc(e,t,n,e=>(i.push(e),!1),r),i},Hc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Uc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Wc=e=>Uc.has(e.kind)||e.kind===`Apply`&&Hc.has(e.operator),Gc=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&lt(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Kc=e=>`line ${e.location.line}, column ${e.location.column}`,qc=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,Jc=e=>{let t=e.location.range;return t?qc(t):Kc(e)},Yc=e=>e.kind===`Number`?e.text??String(e.value):Jc(e),Xc=(e,t)=>new y(`A non-boolean expression (${zi(t)}) was used as the condition of an IF.\n${Jc(e)}`),Zc=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new y(`A non-boolean expression (${zi(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Yc(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new y(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${zi(n)}.\n${Jc({...e,location:{...e.location,range:{...r,end:i}}})}`)},Qc=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${z(n)}\n${Jc(e)}`,r=e=>`Attempted to apply function:\n${N(z(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!F(i))throw new y(`Attempted to select field "${t}" from a non-record value ${N(z(i))}\n${Jc(e)}`);let a=Ut(i);if(a===`tuple`)throw jr(t);return Nr(i,t,a===`record`?n:r)}},$c=e=>e===`1.7.4`?(t,n)=>Or(t,n,e):void 0,el=e=>t=>{if(!F(t))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${zi(t)})\n${Jc(e)}`);return Fr(t)},tl=(e,t)=>(n,r)=>{if(!P(n)||jt(n))throw new y(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Jc(e)}`);return t.evaluate([n,r])},nl=t=>n(new y(`TLC can't handle real numbers: ${t.text} at ${Kc(t)}`),e.configParseError),rl=t=>n(new y(`TLC can't handle a number this big: ${t.text??t.value} at ${Kc(t)}`),e.error),il=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},al=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),ol=(e,t,n)=>{if(t.kind===`Name`)return al(e,t.name,n);let r=br(n);if(!r||r.length!==t.names.length)throw new y(`Cannot bind <<${t.names.join(`, `)}>> to ${z(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>al(e,t,r[n]),e)},sl=(e,t)=>{if(F(e))return e;throw new y(`A non-function (${zi(e)}) was applied as a function.\n${Jc(t)}`)},cl=e=>e.isKeepLazy?e:{...e,isKeepLazy:!0},ll=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),ul=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Expected ${t} to be a boolean but found ${z(e)}`);return e},dl=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),fl=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),pl=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),ml=(e,t)=>{if(fl.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&pl.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=dl(n,t);if(e&&!t.constants.has(n)&&!hl(e,t))return!0}return hi(e).some(e=>ml(e,t))},hl=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!ml(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>ml(e.set,t)));return t.constantLevels.set(e,r),r},gl=(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.`},_l=(e,t,n)=>{if(!P(e)||jt(e)){let r=z(e),i=n===`1.7.4`?void 0:gl(e,r);throw new y(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Yc(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Yc(t)}\n${i}`)}},vl=(e,t,n)=>(_l(e,t,n),typeof e==`object`&&e.kind===`Interval`?Gn(e):ir(e)??R(e).elements),yl=(e,t,n)=>n===`1.7.4`?(_l(e,t,n),ir(e)??lr(e)):vl(e,t,n),bl=e=>{if(typeof e==`object`&&e.kind===`Interval`)return gr(e),e},xl=(e,t,n)=>bl(e)??yl(e,t,n),Sl=(e,t,n)=>bl(e)??vl(e,t,n),Cl=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},wl=(e,t)=>e.map(e=>xl(W(e.set,t),e.set,t.environment.runtime.version)),Tl=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Cl(t[n],t=>i(n-1,ol(a,e[n].pattern,t)));return i(e.length-1,n)},El=(e,t,n)=>Tl(e,wl(e,t),t.scope,n),Dl=(e,t)=>{let n=e.map(e=>W(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Ol=(e,t,n)=>{if(e.length===1)return ol(t,e[0].pattern,n);let r=br(n)??[];return e.reduce((e,t,n)=>ol(e,t.pattern,r[n]),t)},kl=/* @__PURE__ */ new WeakMap,Al=e=>(kl.set(e.value,e),e.value),jl=e=>typeof e==`object`&&e.kind===`LazyFunction`?kl.get(e):void 0,Ml=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:Yn(i),o=(e,n,i)=>`In applying the function\n${N(z(r))},\nthe ${e} is:\n${N(z(n))}${i}.\n${Jc(t.function)}`,s=e.bounds;if(s.length===1){if(!wr(a,r.domain))throw new y(o(`first argument`,a,`which is not in its domain`));return Ol(s,e.scope,a)}let c=br(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new y(`Attempted to apply a function to an argument not in its domain.\n${Jc(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!wr(n,l[t]))throw new y(o(r,n,`${e.pattern.kind===`Name`?``:`
80
- `}which is not in its domain`));if(e.pattern.kind===`Tuple`&&br(n)?.length!==e.pattern.names.length)throw new y(o(r,n,`which does not match its formal parameter`))}),Ol(s,e.scope,Yn(c.slice(0,s.length)))},Nl=/* @__PURE__ */ new WeakMap,Pl=(e,t)=>{let n=Nl.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:qc(r)};return Nl.set(t,i),i},Fl=(e,t,n)=>{let r=Pl(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}},Il=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Jr(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(en(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},Ll=/* @__PURE__ */ new WeakMap,Rl=e=>{let t=Ll.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return Ll.set(e,n),n},zl=(e,t)=>{let n=Dl(e.bounds,t),r=Il(n,(n,r)=>W(e.body,ll(t,Ol(e.bounds,al(void 0,e.name,r),n))),Fl(e.bounds,e.body,n));return Al({value:r,bounds:e.bounds,body:e.body,scope:al(void 0,e.name,r)}),e.bounds.length===1?Wt(r):r},Bl=(e,t)=>{if(typeof t!=`object`||Ut(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!lt(t.domain))return t;try{let e=Dr(t);return Bt(e.domain,e.range)}catch(e){if(e instanceof y)return t;throw e}},Vl=(e,t)=>e.kind===`Function`?e.isSelfReferential?zl(e,t):W(Rl(e),t):W(e.body,t),Hl=(e,t)=>{let n=hl(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 y(`Operator ${e.name} requires ${e.params.length} arguments`);let i=ll(t,void 0);if(!n)return Vl(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>Bl(e,Vl(e,i)));return t.environment.definitionValues.set(e,a),a},Ul=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(!(t.constants.has(n)||t.substitutions.has(n))&&hl(e,t))try{An(Hl(e,{environment:t,scope:void 0,state:void 0,next:void 0}))}catch(e){if(!(e instanceof y)&&!c(e))throw e}}),Wl=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=W(e.expression,ll(t,e.scope));return n&&(e.cache=r),r},Gl=/* @__PURE__ */ new WeakMap,Kl=e=>{let t=Gl.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Gl.set(e,n),n},ql=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return ql(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Kl(r):t.builtins.get(e)},Jl=/* @__PURE__ */ new WeakMap,Yl=(e,t)=>{if(B(e))return Xl(e.operator,t);let n=Jl.get(e),r=n===void 0?ql(e.operator,t.environment)??null:n;return n===void 0&&Jl.set(e,r),r??Xl(e.operator,t)},Xl=(e,t)=>{let n=il(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return ql(e,t.environment)},Zl=e=>e.kind===`Closure`?e.params.length:e.arity,Ql=(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:Xl(n,t);if(!r)throw new y(`Expected an operator argument at ${Kc(e)}`);return r},$l=(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)=>al(e,n.name,t[r]),e.scope);return W(e.body,ll(n,r))},eu=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Zl(e),call:n=>$l(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},tu=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Xl(e.name,t);return n!==void 0&&Zl(n)>0},nu=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),ru=(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 ru(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([])}},iu=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&du(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=B(e)?void 0:ru(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=il(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:nu(e,t)}}return t=>nu(e,t)},au=/* @__PURE__ */ new WeakMap,ou=(e,t)=>{let n=au.get(e);if(n)return n;let r=iu(e,t);return au.set(e,r),r},su=(e,t,n)=>{if(t.length!==e.params.length)throw new y(`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:Ql(t[i],n)}:ou(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},cu=(e,t,n)=>e.kind===`Closure`?W(e.body,ll(n,su(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Ku(t,n),n):e.evaluate(t.map(e=>tu(e,n)?eu(Ql(e,n),n):W(e,n)),n),lu=(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),uu=(e,t,n)=>{let r=il(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Wl(r,n);if(r?.kind===`Operator`){if(Zl(r.operator)===0)return $l(r.operator,[],n);throw new y(`Operator ${e} is used without arguments`)}let i=ru(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw dd(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Hl(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new y(`Unknown identifier ${e} at ${Kc(t)}`)},du=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,fu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),pu=(e,t)=>fu.has(e)||t.builtins.get(e)?.isStateLevel===!0,mu={builtins:fu,definitions:/* @__PURE__ */ new WeakMap},hu={builtins:new Set([...fu].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},gu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&hl(e,t),_u=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!B(e)){let e=dl(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!gu(e,t)&&vu(e,t,n))return!0}return hi(e).some(e=>_u(e,t,n))},vu=(e,t,n=mu)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=_u(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>_u(e.set,t,n));return n.definitions.set(e,i),i},yu={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},bu=(e,t)=>new Set(e.filter(e=>vu(e,t)||vu(e,t,yu))),xu=e=>[...e.definitions.values()].some(t=>vu(t,e)),Su=e=>[...e.definitions.values()].some(t=>vu(t,e,hu)),Cu=/* @__PURE__ */ new WeakMap,wu=(e,t)=>{let n=Cu.get(e);if(n!==void 0)return n;let r=Ou(e,t,Eu);return Cu.set(e,r),r},Tu=/* @__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`]),Eu=/* @__PURE__ */ new Set,Du=(e,t,n)=>n.size===0?wu(e,t):Ou(e,t,n),Ou=(e,t,n)=>{if(!Tu.has(e.kind))return!1;if(e.kind===`Identifier`&&B(e))return n.has(e.name);if(B(e))return!1;if(e.kind===`Identifier`){let n=ru(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&gu(n.definition,t)}if(e.kind===`Apply`){if(pu(e.operator,t)||yu.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=ql(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=dl(e.operator,t);if(!n||!hl(n,t)||vu(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`&&Du(e,t,n))}let r={value:!0};return Jo(e,(e,i)=>(r.value&&=Du(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},ku=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Au=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}},ju=(e,t)=>{if(e.kind===`Identifier`&&B(e))return!t.has(e.name);if(B(e))return!0;let n={value:!1};return Jo(e,(e,r)=>(n.value||=ju(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Mu=(e,t)=>Bo.has(e)&&ku(e)&&vd(e,t)!==void 0&&!ju(e,Eu),Nu=/* @__PURE__ */ new WeakMap,Pu=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Sr.sets,o=Sr.callStack,s=a??[],c=s.length;Sr.sets=s,Sr.callStack=r;try{let a=t(i),o=typeof a==`object`&&a.kind===`FilteredSet`?Nu.get(a):void 0,s=o?o(n):a;return r.values.set(e,s),typeof s==`object`&&s.kind!==`FilteredSet`&&Wc(e)&&r.sources.set(s,e),s}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Gc(e,r.values),a=i&&!hi(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!F(a)?void 0:a;throw Fu(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Sr.sets=a,Sr.callStack=o}},Fu=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof y){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},Iu=(e,t,n)=>{if(!(n instanceof y))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},Lu=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Ru=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=hd(e,t),i=t.callStack,a=i?Pu(e,r,t,i):ku(e)&&wu(e,t)?Au(r):Mu(e,t)?Uu(r):r;return t.evaluators.set(e,a),a},zu=/* @__PURE__ */ new WeakMap,Bu=(e,t)=>{if(t.callStack)return Ru(e,t);let n=zu.get(e);if(n)return n;let r=(ku(e)&&wu(e,t)?void 0:oa(e,t))??Ru(e,t);return zu.set(e,r),r},W=(e,t)=>Bu(e,t.environment)(t),Vu=(e,t)=>{let n=e.name,r=B(e)?void 0:ru(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw dd(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&&hl(e,t))return t=>Hl(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Bu(e.body,t),n.body(ll(r,void 0)));return Hu(e,t)?Uu(r):r}return t=>Hl(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Hl(e,t);return hl(e,t)||!Hu(e,t)?n:Uu(n)}return t=>uu(n,e,t)},Hu=(e,t)=>vd(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>vd(e.set,t)!==void 0)),Uu=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}},Wu=(e,t)=>{let n=ql(e,t);return n!==void 0&&Zl(n)>0},Gu=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!B(e)&&Wu(e.name,t)),Ku=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),qu=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Ku(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Gu(t[0],n)){let e=Ru(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Gu(t[0],n)&&Gu(t[1],n);if(i&&a){let e=Ru(t[0],n),r=Ru(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>tu(e,n)?eu(Ql(e,n),n):W(e,n)),n)},Ju=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new y(`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:ou(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:Ql(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Yu=/* @__PURE__ */ new WeakMap,Xu=e=>{let t=Yu.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return Yu.set(e,n),n},Zu=(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},Qu=(e,t)=>e.every((e,n)=>en(e,t[n])),$u=(e,t)=>{let n=dl(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&hl(n,t)&&!vu(n,t)},ed=(e,t,n,r)=>{let i=Ju(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Bu(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r)return e=>o(i(e),e);let s=Xu(e);return e=>{let n=i(e),r=Zu(n,t.length);if(!r||e.isKeepLazy)return o(n,e);let a=r.length;for(let e of r)a=zr(a,Jr(e));let c=s.calls.get(a),l=c?.find(e=>Qu(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}},td=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Ru(n[0],t),r=Ru(n[1],t);return t=>!ul(e(t),`the left side of =>`)||ul(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new y(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=B(e)?void 0:ql(e.operator,t);if(r?.kind===`Closure`){let i=!t.callStack&&$u(e,t);return ed(r,n,t,i)}if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Ru(n[0],t),i=el(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Ru(n[0],t);return Vo.has(e)||ml(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=Ru(n[0],t),a=Ru(n[1],t),o=tl(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?qu(r,n,t):e.operator===`\\cdot`&&n.length===2?()=>{throw new y(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)}:r=>{let i=Xl(e.operator,r);if(i)return cu(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new y(`${e.operator} is a function; apply it with brackets`):new y(`Unknown operator ${e.operator} at ${Kc(e)}`)}},nd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Ru(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Ru(a.set,t);return s=>Cl(xl(o(s),a.set,t.runtime.version),t=>ul(i(ll(s,al(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>Ru(e.set,t));return s=>{let c=a.map((e,n)=>xl(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?ul(i(ll(s,a)),r)!==n:Cl(c[t],n=>l(t-1,al(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>El(o,e,t=>ul(i(ll(e,t)),r)!==n)?!n:n},rd=(e,t)=>{if(e.kind===`Tuple`)return Yn(e.names.map(e=>{let n=il(t,e);return n?.kind===`Value`&&n.value}));let n=il(t,e.name);return n?.kind===`Value`?n.value:void 0},id=/* @__PURE__ */ new WeakSet,ad=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&id.add(e)},od=(e,t)=>{let n=id.has(e),r=Ru(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Ru(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=qn(e),o=Bt(i,i.map(e=>r(ll(t,al(t.scope,n,e)))));return lt(e)?o:Wt(o)}let n=[],s=i.map(e=>Sl(W(e.set,t),e.set,t.environment.runtime.version));return Tl(i,s,t.scope,e=>{let o=i.length===1?rd(a.pattern,e)??!1:Yn(i.map(t=>rd(t.pattern,e)??!1));return n.push([o,r(ll(t,e))]),!1}),zn(n)},l=(t,n)=>{let a=Al({value:Il(t,e=>r(ll(n,Ol(i,n.scope,e))),Fl(i,e.body,t)),bounds:i,body:e.body,scope:n.scope});return i.length===1?Wt(a):a},u=t.callStack;return t=>{let r=o?s(t):Dl(i,t);if(e.isRecursive||n||t.isKeepLazy||!L(r))return l(r,t);if(!lt(r)){if(u)return l(r,t);try{return c(r,t)}catch(e){if(!(e instanceof y))throw e;return l(r,t)}}if(!u)return c(r,t);try{return c(r,t)}catch(t){throw Iu(u,e,t),t}}},sd=(e,t)=>{let n=id.has(e);n&&ad(e.function);let r=Ru(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=>Ru(e,t))}),value:Ru(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Yn(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(ll(i,al(i.scope,`@`,e))):Ir(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(sa.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Jc(e.function)}`)}return n}},cd=(e,t)=>{if(e.kind===`SetFilter`){let n=Ru(e.predicate,t),r=Ru(e.bound.set,t),i=e.bound.pattern,a=e.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:qc(a)},s=(e,t)=>n=>ul(e(ll(t,ol(t.scope,i,n))),`a set filter predicate`),c=(t,n,r)=>{let i={kind:`FilteredSet`,base:t,test:s(r,n),source:o};return Nu.set(i,r=>c(t,{...n,environment:r},Ru(e.predicate,r))),i};return e=>{let t=r(e);return lt(t)?zt(R(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=Ru(e.expression,t);return t=>{let r=[];return El(e.bounds,t,e=>(r.push(n(ll(t,e))),!1)),Pn(r)}}let n=e.set;if(!n)return()=>{throw new y(`TLC cannot evaluate an unbounded CHOOSE at ${Kc(e)}`)};let r=Ru(e.body,t),i=Ru(n,t);return t=>{let a=i(t);if(!P(a)||jt(a))throw new y(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${Jc(e)}`);let o={value:void 0},s=Sl(a,n,t.environment.runtime.version);if(Cl(s,n=>{let i=ol(t.scope,e.pattern,n);return ul(r(ll(t,i)),`the body of CHOOSE`)?(o.value=rd(e.pattern,i),!0):!1}),o.value===void 0)throw new y(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Jc(e)}`);return o.value}},ld=e=>[...e].sort((e,t)=>It(e.name,t.name)),ud=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),dd=(e,t)=>new S(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${Jc(t)}`,e),fd=(e,t)=>e instanceof S&&t!==`1.7.4`?new y(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,pd=e=>new y(`A primed expression appears outside an action at ${Kc(e)}`),md=(e,t)=>{let n=ld(e),r=ud(n),i=n.map(e=>Ru(e.value,t));if(r)return e=>Xn(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=>ht(a,i.map(t=>t(e)),o):e=>Zt(a,i.map(t=>t(e)))},hd=(e,t)=>{let n=e=>Ru(e,t);switch(e.kind){case`Number`:{let t=e.value;return du(t)?()=>t:()=>{throw rl(e)}}case`Decimal`:return()=>{throw nl(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Vu(e,t);case`Apply`:return td(e,t);case`Bracket`:return()=>{throw new y(`A bracket without a function or subscript is not an expression at ${Kc(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new y(`An operator cannot be used as a value at ${Kc(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 Zc(e,r,i);if(!i)return!1}return!0}}case`Or`:{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 Zc(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw pd(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>Qt(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 Xc(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new y(`A non-boolean expression (${zi(t)}) was used as a condition of a CASE. ${Yc(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new y(`Attempted to evaluate a CASE with no conditions true.\n${Jc(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(ll(n,lu(e.definitions,n)))}case`Forall`:case`Exists`:return nd(e,t);case`UnboundedQuantifier`:return()=>{throw new y(`TLC cannot evaluate an unbounded quantifier at ${Kc(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return cd(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Pn(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Yn(t.map(t=>t(e)))}case`FunctionConstruction`:return od(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 md(e.fields,t);case`RecordSet`:{let t=ld(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 sd(e,t);case`ExceptAt`:return t=>{let n=il(t.scope,`@`);if(n?.kind!==`Value`)throw new y(`@ appears outside an EXCEPT at ${Kc(e)}`);return n.value};case`FunctionApplication`:{ad(e.function);let r=n(e.function),i=t=>sl(r(cl(t)),e),a=e.args.map(n),o=$c(t.runtime.version);if(a.length===1){let e=a[0];return t=>Nr(i(t),e(t),o)}return e=>Nr(i(e),Yn(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Qc(e);return e=>r(t(e))}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?ul(t(e),`an action`)||r(e):ul(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Lc(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new y(`The subexpression reference at ${Kc(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new y(`TLC cannot evaluate a temporal formula in a state at ${Kc(e)}`)}}},gd=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),_d=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},vd=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(gd.has(e.kind))return!1;let a=_d(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&&pu(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 hi(e).every(i)};return i(e)?[...n]:void 0},yd=`-------------------------------- MODULE Reals -------------------------------
77
+ `],[2281,` - specifically: `]]),Ea=(e,t,n)=>{let r=n?Ta.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${Da(t.slice(a),n)}`},Da=(e,t)=>{let n=t?Ca(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${ha.none} @!@!@\n${Ea(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Oa=e=>String(e).padStart(2,`0`),ka=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${Oa(r%24)}h`:e>36e5?`${Oa(r%24)}h ${Oa(n)}min`:e>6e4?`${Oa(n)}min ${Oa(t)}s`:`${Oa(t)}s`},Aa=e=>`${e.getFullYear()}-${Oa(e.getMonth()+1)}-${Oa(e.getDate())} ${Oa(e.getHours())}:${Oa(e.getMinutes())}:${Oa(e.getSeconds())}`,ja={kind:`Local`},Ma=/* @__PURE__ */ new WeakSet,Na=/* @__PURE__ */ new WeakMap,Pa=/* @__PURE__ */ new WeakMap,Fa=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Ia=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),La=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Ra=e=>e.kind===`Operator`?e.params.length:0,za=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ba=e=>e.name.includes(`!`),Va=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Ha=(e,t,n)=>{let r=t.bindings.get(e);return r&&La(r.position,t.location)&&(!n||La(r.position,n.start))?r:void 0},Ua=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),Wa=(e,t,n,r)=>{if(t===void 0)return!0;if(Ua(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=g(i),o=t.range&&g(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},Ga=(e,t,n,r)=>Wa(t,Va(e,t)??Ha(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Ka=(e,t,n)=>{Wa(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},qa=(e,t,n,r)=>t.reduce((e,t,i)=>Ga(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Ja=(e,t,n)=>t.reduce((e,t)=>Ga(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ya=e=>e.kind===`Name`?[e.name]:e.names,Xa=e=>e.flatMap(e=>Ya(e.pattern)),Za=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||La(n.location,t.location))?n:void 0},Qa=(e,t)=>{let n=Za(e,t);return n?{key:t.getKey(n),arity:Ra(n),params:za(n),kind:`Definition`}:t.imported.get(e)},$a=(e,t,n)=>Va(t,e)??Qa(e,n),eo=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),to=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:eo(e.location,e.spelling??t)},no=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return La(e.location,e.args[0].location)?`prefix`:`postfix`}},ro=e=>!/^[\p{L}\d_]/u.test(e),io=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),ao=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,oo=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},so=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?oo(e.name,[],void 0):oo(e.operator,e.args,e.argumentCounts),co=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),lo=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Xa(e.bounds),body:e.body,sets:co(e.bounds)};case`SetMap`:return{names:Xa(e.bounds),body:e.expression,sets:co(e.bounds)};case`SetFilter`:return{names:Ya(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ya(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}},uo=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}},fo=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,po=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),mo=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?mo(e.body,t):xi(e).reduce((e,n)=>e??mo(n,t),void 0)},ho=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??ho(i,t,n||po(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&mo(e.set,t):mo(e,t)},go=e=>e.kind===`Label`?go(e.body):e,_o=e=>typeof e==`number`?`argument selector ${e}`:e,vo=`within the scope of a declaration
78
+ from outside that declaration's scope.`,yo=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:g(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&go(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:ho(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?mo(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&po(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${vo}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=_o(n.operand);if(l.isSufficesOpen){if(ao(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=go(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?$a(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=lo(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:uo(e);if(!c)return;let f=ao(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=ao(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(po(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${vo}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},bo=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:g(e.location.range),message:n}),!0)},xo=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=g(r),a=e.params.filter((r,i)=>{let a=Va(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:g(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},So=(e,t,n,r)=>{if(!fo(e))return!1;let i=so(e),a=i[0],o=i.length>1&&a.kind===`Name`?Va(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&yo(e,i,o,t,n,r),o!==void 0},Co=(e,t,n,r)=>{let i=e.location;if(No(e,n,r))return;let a=Pa.get(e);if(a!==void 0)return a;if(Fa(t))return e.kind===`Apply`?e.args.length:0;let o=Va(n,t);if(o?.isNonFact){r.errors.push({location:g(to(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(So(e,n,r,!1)||io(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=ja),o)return o.arity;let s=Qa(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Pa.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(Va(n,c)!==void 0||Qa(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=g(e.kind===`Apply`&&l===`-.`?eo(i,`-`):to(e,t));if(!ro(t)||io(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=no(e);d&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},wo=(e,t,n)=>(e.forEach(e=>U(e.set,t,n)),e.reduce((e,t)=>qa(e,Ya(t.pattern),t.pattern.ranges,n),t)),To=(e,t)=>e.kind===`Identifier`&&e.name===t&&B(e)||xi(e).some(e=>To(e,t)),Eo=(e,t)=>{e.kind===`FunctionConstruction`&&To(e.body,t)&&(e.isRecursive=!0),xi(e).forEach(e=>Eo(e,t))},Do=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Xa(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:g(o),message:e})},c=e.kind===`Function`?wo(e.bounds,t,i):Ja(t,e.params,i),l=Va(c,a)??Ha(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(U(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Eo(e.body,a),e.isSelfReferential=To(e.body,a)):U(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:Wa(a,Va(t,a)??Ha(a,i,o),{kind:`Definition`,arity:Ra(e),range:o},i)},Oo=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Va(e,t.name)?.isPending)return e;let n={name:t.name,arity:Ra(t),params:za(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>zo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Fa(t.name)?e:s(e,e=>!La(t.location,e.location)),o={name:t.name,arity:Ra(t),kind:`Definition`,range:t.location.range,parent:a};if(Ba(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Fa(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Do(t,a,u,i)?{...o,params:za(t)}:a},a),()=>!0)},ko=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Va(t,r)??Ha(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Ao=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=ko(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:g(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},jo=(e,t,n)=>{if(Ao(e,t,n))return;let r=e.operator,i=$a(r,t,n),a=Co(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:g(e.argumentsRange??to(e,r)),message:`The operator ${r} requires ${a-(ko(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Mo(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:g(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=Co(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else U(i,t,n);return!0}if(i.kind===`Lambda`){U(i,t,n);let o=i.params.length===c;return!o&&Ma.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??to(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return U(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=$a(u,t,n)?.params??[],f=Co(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(to(i,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},Mo=(e,t,n)=>{e.kind===`Identifier`?Co(e,e.name,t,n):U(e,t,n)},No=(e,t,n)=>{let r=Na.get(e);return r?(r.args.forEach(e=>Mo(e,t,n)),n.errors.push(r.error),!0):!1},U=(e,t,n)=>{if(Ma.has(e)&&!n.isGenerated){U(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>U(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Ao(e,t,n))return;let r=e.name,i=Co(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:g(to(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Co(e,e.operator,t,n);return;case`Apply`:jo(e,t,n);return;case`Lambda`:U(e.body,qa(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:U(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&&U(e.other,t,n);return;case`Let`:U(e.body,Oo(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:U(e.body,wo(e.bounds,t,n),i(Xa(e.bounds)));return;case`UnboundedQuantifier`:U(e.body,qa(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&U(e.set,t,n),U(e.body,qa(t,Ya(e.pattern),e.pattern.ranges,n),i(Ya(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:U(e.predicate,wo([e.bound],t,n),i(Ya(e.bound.pattern)));return;case`SetMap`:U(e.expression,wo(e.bounds,t,n),i(Xa(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:g(r.location.range??eo(r.location,r.name)),message:`Non-unique fields in constructor.`}),U(r.value,t,n)});return;case`Except`:U(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),U(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:U(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(bo(e,n))return;U(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),xo(e,t,n);return;case`Subexpression`:if(No(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Mo(e,t,n)),So(e,t,n,!1)}},Po=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Ao(e,t,n)||So(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&Va(t,r)?.isNonFact?n.errors.push({location:g(to(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||U(e,t,n)}),Fo=(e,t,n)=>(e.set&&U(e.set,t,n),Ga(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Io=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Fo(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Io(t,e.scope,e.unit,!0):U(t,e.scope,e.unit),e),{scope:t,unit:n});return U(e.conclusion,i.scope,i.unit),i.scope},Lo=(e,t,n)=>e.kind===`AssumeProve`?Io(e,t,n):(U(e,t,n),t),Ro=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Po(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Bo(t,e,r),t)},zo=(e,t,n)=>{let r=Ko(e,t,n);return e.name===void 0?r:Ga(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Bo=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=Lo(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Ro(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Ro(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return Po(r.facts,t,n),o(t);case`Instance`:return o(zo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?zo(t,e,i):Oo([t],e,n),t));case`Have`:case`Case`:return U(r.expression,t,i),Ro(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>U(e,t,i)),a(t);case`Take`:return a(qa(wo(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=qa(wo(r.bounds,t,i),r.names,r.nameRanges,i);return U(r.body,o,{...i,labelParams:[...i.labelParams,...Xa(r.bounds),...r.names]}),Ro(e.proof,a(t),n),a(o)}default:return Ro(e.proof,a(t),n),a(t)}},Vo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Lo(e.statement,void 0,t);e.name!==void 0&&Ka(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Ro(e.proof,n,t),r&&(r.isInProof=!1)},Ho={line:0,column:0},Uo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Wo=(e,t)=>{let n=new Map([...Ia,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},Go=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){U(n,a,i);return}let r=Co(n,n.name,a,i);if(r!==void 0&&r!==t.arity)throw new u(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},s=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:g(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;o(r,a);let c=a.location.range;s.has(n)?c&&i.errors.push({location:g(c),message:`Multiple substitutions for symbol '${n}' in substitution.`}):s.set(n,a)});let c=t.filter(e=>!s.has(e.name)),l=e=>!Va(a,e.name)&&!Qa(e.name,i);return c.filter(e=>!l(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};o(t,n),s.set(t.name,n)}),c.filter(l).forEach(t=>{let r=e.location.range,a=t.location.range;r&&a&&i.errors.push({location:g(r),message:`Substitution missing for symbol ${t.name} declared at ${g(a)} \nand instantiated in module ${n}.`})}),s},Ko=(e,t,n)=>{let r=n.getInstance(e);return Go(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ga(e,t,r,n),t)},qo=(e,t,n,r)=>{let i=Wo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Go(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:Ho}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Jo=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>La(e.location,t.location)?-1:+!!La(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof u)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},Yo=(e,t)=>{let n=Wo(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...Ia,...t.bound].map(([e,t])=>[e,{...t,position:Ho}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>Ka(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return Jo([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=Wa(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);Uo(e,t)?U(t.body,void 0,i):Do(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:Ra(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);Ja(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>Ka(t,e,i)),e.name!==void 0&&Ka(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);U(e.expression,void 0,r),e.name!==void 0&&Ka(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>Vo(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Po(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:g(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Xo=/* @__PURE__ */ new WeakSet,Zo=/* @__PURE__ */ new WeakSet,Qo=(e,t,n=/* @__PURE__ */ new Set)=>{let r=is(e,(e,r)=>Qo(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&B(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&B(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},$o=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),es=/* @__PURE__ */ new WeakMap,ts=e=>es.get(e)??e.name,ns=(e,t)=>(ts(t)!==e.name&&es.set(e,ts(t)),e),rs=(e,t)=>ns(e.kind===`Function`?{...e,bounds:$o(e.bounds,e=>t(e,[])),body:t(e.body,Xa(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),is=(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=>rs(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:$o(e.bounds,n),body:t(e.body,Xa(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,Ya(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,Ya(e.bound.pattern))};case`SetMap`:return{...e,bounds:$o(e.bounds,n),expression:t(e.expression,Xa(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},as=`LAMBDA`,os=(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 is(e,(e,n)=>(r.push(...os(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},ss=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}},cs=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),ls=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},us=(e,t)=>e.map(e=>({pattern:ls(e.pattern,t),set:e.set})),ds=(e,t)=>e.kind===`Function`?{...e,bounds:us(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},fs=(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=>ns({...ds(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:us(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:ls(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:ls(e.bound.pattern,n),set:e.bound.set}};default:return e}},ps=e=>`${e}@ENABLED`,ms=(e,t)=>e.modes.get(t)??e,hs=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!B(e)&&t.instantiation.variables.has(e.name),gs=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>gs(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(hs(e,t,n))return[e.name];let r=B(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?gs(r.body,t,/* @__PURE__ */ new Map):void 0},_s=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return hs(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:ps(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Ss(e.expression,ms(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Ss(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Ss(e.subscript,ms(t,`Primed`),n),location:r},Ss(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=gs(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:ps(r),location:e.location},location:e.location},Ss({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},vs=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),ys=(e,t)=>e.map(e=>vs(e.name,t)),bs=(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:[...ys(t,r),...i.map(e=>vs(e,r))],location:r},location:r}},xs=(e,t)=>e.instantiation.isParameterized(t)?ws(e,t):void 0,Ss=(e,t,n)=>{let r=e=>Ss(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!B(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Ss(e.expression,ms(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Ss(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},ms(t,`Enabled`),n)};let s=_s(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Xo.add(n),n;let r=xs(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&&Ra(o)>0?bs(r,a,Ra(o),e.location):{kind:`Apply`,operator:r,args:ys(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||Zo.has(e),c=e=>(s&&Zo.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:as,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:as,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new u(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=xs(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...ys(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=xs(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?bs(n,a,Ra(r),e.location):{...e,operator:n}}let c=ss(t),l=is(e,(e,i)=>i.length===0?r(e):Ss(e,t,cs(n,i,c)));return fs(l,n,c)},Cs=(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:vs(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ws=(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=ss(e),o=ds(rs(i,(t,n)=>Ss(t,e,cs(/* @__PURE__ */ new Map,n,a))),a);return Cs(o,r.params,i.location)}):t},Ts=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>os(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=>xs(i,e)??e,getQualifiedKey:t=>{let n=xs(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Cs(r,e.params,r.location)):t}}},Es=e=>e.kind===`Let`&&e.instances!==void 0||xi(e).some(Es),Ds=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=is(e,e=>Ds(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>La(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},Os=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ks=(e,t)=>e.definitions.some(e=>Es(e.body))||e.assumptions.some(e=>Es(e.expression))||e.theorems.some(e=>{let t=Os(e);return t!==void 0&&Es(t)})?{...e,definitions:e.definitions.map(e=>rs(e,e=>Ds(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ds(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Os(e);return n===void 0?e:{...e,statement:Ds(n,t,[])}})}:e,As=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=Tr.sets,a=i??[],o=a.length;Tr.sets=a;try{return n()}catch(e){throw Gu(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,Tr.sets=i}},js=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Ms=e=>!e.includes(void 0),Ns=e=>e.variables.map(()=>void 0),Ps=(e,t,n)=>{let r=[...e];return r[t]=n,r},Fs=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Is=e=>e.kind===`Identifier`?e.name:void 0,Ls=(e,t,n)=>{if(t.kind===`Label`)return Ls(e,t.body,n);let r=Is(t);if(r===void 0)return;let i=ml(n,r);if(i?.kind===`Thunk`)return Ls(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=ru(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Ls(e,o.body,o.scope):void 0},Rs=(e,t,n)=>{if(t.kind===`Prime`)return Ls(e,t.expression,n);if(t.kind===`Label`)return Rs(e,t.body,n);let r=Is(t);if(r===void 0)return;let i=ml(n,r);if(i?.kind===`Thunk`)return Rs(e,i.expression,i.scope);if(i)return;let a=ru(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Rs(e,a.body,a.scope):void 0},zs=e=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean expression.`);return e},Bs=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Vs=(e,t,n)=>{t===void 0?Ms(n)&&e.onState(n):Ms(n)&&Bs(e)?Us(e,t,n):t.kind===`Predicate`?Ws(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?$s(e,t.expression,t.rest,t.scope,n):Hs(e,t,n)&&Vs(e,t.rest,n)},Hs=(e,t,n)=>{let r=e.environment,i=W(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return W(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Md(t,r.runtime.version):t}})();return!nn(i,a)},Us=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){$s(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Hs(e,r,n):!zs(W(r.expression,js(e,r.scope,n))))return}e.onState(n)},Ws=(e,t,n,r,i)=>As(e,t,()=>{switch(t.kind){case`Let`:Ws(e,t.body,n,yu(t.definitions,js(e,r,i)),i);return;case`Label`:Ws(e,t.body,n,r,i);return;default:if(Zs.has(t.kind))throw new y(`The state relation is not a boolean expression.`);As(e,t,()=>Qs(e,t,n,r,i))}}),Gs=(e,t,n,r)=>{zs(t)&&Vs(e,n,r)},Ks=(e,t,n,r,i)=>{let a=js(e,r,i);if(t.kind===`Identifier`){let o=ml(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Ws(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Ws(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:ru(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&Tl(s,e.environment))){Ws(e,c.body,n,c.scope,i);return}Gs(e,W(t,a),n,i);return}let o=au(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Ws(e,o.body,n,_u(o,t.args,a),i):Gs(e,W(t,a),n,i)},qs=(e,t,n,r,i)=>{let a=n[r];a===void 0?Vs(e,t,Ps(n,r,i)):nn(a,i)&&Vs(e,t,n)},Js=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Ys=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?Ls(e,a,r):Rs(e,a,r),c=js(e,r,i);if(s===void 0){W(t,c)===!0&&Vs(e,n,i);return}let l=W(o,c),u=i[s];if(t.operator===`=`){qs(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)W(t,c)===!0&&Vs(e,n,i);else{if(!tr(d))throw new y(`The right side of \\IN is not enumerable.`);for(let t of pr(d))Vs(e,n,Ps(i,s,t))}},Xs=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Zs=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Qs=(e,t,n,r,i)=>{let a=js(e,r,i);switch(t.kind){case`Identifier`:Ks(e,t,n,r,i);return;case`Apply`:if(Xs.has(t.operator)&&t.args.length===2){Ys(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(zs(W(t.args[0],a))){Ws(e,t.args[1],n,r,i);return}Vs(e,n,i);return}Ks(e,t,n,r,i);return;case`And`:{let a=t.operands;if(t.isBulleted||a.length===2){let t=a.slice(1).reduceRight((e,t)=>Js(`Predicate`,t,r,e),n);Ws(e,a[0],t,r,i);return}let o=a[a.length-1];Ws(e,Fs(t,a.length-1),Js(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>Ws(e,t,n,r,i));return}Ws(e,Fs(t,a.length-1),n,r,i),Ws(e,a[a.length-1],n,r,i);return}case`Exists`:Il(t.bounds,a,r=>(Ws(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(Il(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Vs(e,n,i);return}let o=r.slice(1).reduce((e,n)=>Js(`Predicate`,t.body,n,e),n);Ws(e,t.body,o,r[0],i);return}case`If`:Ws(e,zs(W(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>zs(W(e.condition,a)))?.body??t.other;if(o===void 0)throw new y(`TLC encountered a CASE with no conditions true.`);Ws(e,o,n,r,i);return}case`FunctionApplication`:{let r=Vl(W(t.function,e.isInit?a:vl(a)));if(r){Ws(e,r.body,n,Hl(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){$s(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){Ws(e,t.action,n,r,i),$s(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){Ws(e,t.action,Js(`Changed`,t.subscript,r,n),r,i);return}}Gs(e,W(t,a),n,i)},$s=(e,t,n,r,i)=>As(e,t,()=>{let a=Ls(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&qs(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Vs(e,n,i);return}let s=o.reduceRight((e,t)=>Js(`Unchanged`,t,r,e),n);$s(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=ml(r,t.name);if(a?.kind===`Thunk`){$s(e,a.expression,n,a.scope,i);return}let o=a?void 0:ru(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){$s(e,o.body,n,o.scope,i);return}}let o=e.environment,s=W(t,{environment:o,scope:r,state:e.current,next:void 0}),c=W(t,{environment:o,scope:r,state:i,next:void 0});nn(s,c)&&Vs(e,n,i)}),ec=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},tc=/* @__PURE__ */ Error(`The replay found a successor`),nc=(e,t,n,r)=>{let i=ec(r,!1,n,()=>{throw tc},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Js(`Changed`,e.subscript,t,void 0);Ws(i,e.action,n,t,Ns(r))}else Ws(i,e,void 0,t,Ns(r));return!1}catch(e){if(e!==tc)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},rc=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=ec(t,!0,void 0,n),o=i.reduceRight((e,t)=>Js(`Predicate`,t.expression,t.scope,e),void 0);Ws(a,r.expression,o,r.scope,Ns(t))},ic=(e,t,n,r)=>{e.some(e=>Zs.has(e.expression.kind))||e.forEach(e=>{let i=[],a=ec(n,!1,t,e=>i.push(e));Ws(a,e.expression,void 0,e.scope,Ns(n)),i.forEach(t=>r(t,e))})},ac=/* @__PURE__ */ new WeakMap,oc=/* @__PURE__ */ new WeakMap,sc=(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},cc=(e,t,n)=>{let r=e.slice();return r[t]=n,r},lc=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,uc=(t,r)=>{let i=new y(r);return t.isInit?i:n(i,e.error)},dc=(e,t,n,r)=>{let i=al(n);return r&&Zs.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${lc(e)}, TLC expected a boolean expression,\nbut instead found ${z(t)}.\n${i}`},fc=(e,t,n)=>{let r=Gi(t),i=il(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${lc(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
79
+ `:``}${i}`},pc=(e,t,n,r=!0)=>{let i=W(t,n);if(typeof i==`boolean`)return i;throw uc(e,dc(e,i,t,r))},mc=e=>e===`=`||e===`\\in`||e===`\\subseteq`,hc=(e,t,n)=>{let r=n?ac:oc,i=r.get(e);if(i)return i;let a=Hc(e,t,n);return r.set(e,a),a},gc=(e,t)=>{if(t.constants.has(e))return;let n=xl(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},_c=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return _c(e.expression,t,!1,r);if(e.kind!==`Identifier`||B(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=gc(e.name,t);if(a&&!r.has(a))return r.add(a),_c(a.body,t,n,r)},vc=(e,t,n)=>_c(e,t,!n),yc=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return yc(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=yu(e.definitions,sc(r,t,n));return yc(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ml(t,e.name);if(a?.kind===`Thunk`)return yc(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=gc(e.name,r.environment);if(s)return yc(s.body,void 0,n,r,i)},bc=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||B(e))||!t&&e.kind===`Prime`,xc=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>xc(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=gc(e.name,t);if(i)return n.add(e.name),xc(i.body,t,n)},Sc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Cc=(e,t,n)=>Sc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||mc(e.operator)&&(bc(e.args[0],n)||vc(e.args[0],t,n)!==void 0)||B(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,wc=/* @__PURE__ */ new Set,Tc=(e,t)=>{if(B(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return is(e,(e,i)=>{let a=r.isReadOnly?Tc(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Ec=(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||B(e)?void 0:xl(r,t);return i&&!n.has(i)&&(n.add(i),Ec(i.body,t,n))?!0:xi(e).some(e=>Ec(e,t,n))},Dc=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=vc(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=xc(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return Cc(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:hc(e,t,n)}},Oc=(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(Rd(e,t)===void 0||Ec(e,t,/* @__PURE__ */ new Set))return!0;let n=Tc(e,wc);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)}},kc=(e,t,n)=>{let r=e.map(e=>Dc(e,t,n)),i=(e,t,n,a,o,s)=>{let c=a,l,u=Bs(t);for(let a=e;a<r.length;a++){if(a>0&&u&&Kc(c)){l??=sc(t,n,c);for(let e=a;e<r.length;e++)if(!pc(t,r[e].expression,l,!1))return;s(c,o);return}let e=r[a];if(e.kind===`Guard`){if(l??=sc(t,n,c),!pc(t,e.expression,l))return;continue}if(e.kind===`Assign`){l??=sc(t,n,c);let r=W(e.value,l),i=c[e.index];if(i===void 0)c=cc(c,e.index,r),l=void 0;else if(!nn(i,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=c[t];if(e===void 0)c=cc(c,t,n[t]),l=void 0;else if(!nn(e,n[t]))return}continue}let d=a+1;e.runner(t,n,c,o,!0,(e,r)=>i(d,t,n,e,r,s));return}s(c,o)};return(e,t,n,r,a,o)=>i(0,e,t,n,r,o)},Ac=e=>(t,n,r,i,a,o)=>{pc(t,e,sc(t,n,r))&&o(r,i)},jc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=sc(r,i,a);if(a[l]!==void 0){pc(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!tr(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${lc(r)}, the right side of \\IN is not enumerable.`;throw uc(r,`${t}\n${il(e)}`)}let p=pr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(cc(a,l,p[e]),o)}},Mc=/* @__PURE__ */ new WeakMap,Nc=e=>{let t=Mc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Nc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Mc.set(e,n),n},Pc=(e,t)=>{let n=e.args[0],r=Ac(e),i=(e,r,i)=>yc(n,r,i,e,!t)??-1,a=jc(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],sc(t,n,o));l(cc(o,u,d),s)}},Fc=(e,t,n)=>{let r=il(e);return(i,a,o,s,c,l)=>{let u=sc(i,a,o),d=W(e.function,n?u:vl(u)),f=Vl(d);if(f!==void 0){hc(f.body,t,n)(i,Hl(f,e,u),o,s,c,l);return}if(!P(d))throw uc(i,`In computing ${lc(i)}, a non-function (${Gi(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw uc(i,`In computing ${lc(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Ic=(e,t)=>{if(xc(e,t))return kc([Nc(e)],t,!1);if(e.kind===`Tuple`)return hc(Nc(e),t,!1);let n=Nc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ml(i,e.name):void 0;l?.kind===`Thunk`?hc(Nc(l.expression),t,!1)(r,l.scope,a,o,s,c):pc(r,n,sc(r,i,a))&&c(a,o)}},Lc=(e,t,n)=>{let r=e.operator,i=Ac(e),a=B(e)?void 0:ru(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=id(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=hc(a.body,t,n),o.body(e,i(sc(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=sc(a,o,s),f=au(e,d);f?.kind===`Closure`?hc(f.body,t,n)(a,_u(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Rc=(e,t,n)=>{let r=Ac(e),i=B(e)?void 0:gc(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ml(s,e.name);f?.kind===`Thunk`?hc(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=hc(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},zc=(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!==`=`||B(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`||!B(a))return;let o=_c(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=>zc(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`||B(e))return;let r=ru(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=zc(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`&&B(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Bc=(e,t,n)=>{let r=ml(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},Vc=(e,t,n)=>{let r=e.map(e=>hc(e,t,n)),i=n?[]:e.map(e=>zc(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&&Bc(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)}},Hc=(e,t,n)=>{let r=e=>hc(e,t,n);switch(e.kind){case`And`:return kc(e.operands,t,n);case`Or`:return Vc(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(n,r,o,s,c,l)=>{let u=kl(W(a.set,sc(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,hl(r,e,u[t]),o,s,c,l)}}let o=n?void 0:Oc(e,t);if(o){let r=kc(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=sc(n,i,a),d=e.bounds.map(e=>kl(W(e.set,u),e.set,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=hl(t,o.names[e],r);if(e===d.length-1){let e=sc(n,i,a);if(!o.guards.every(t=>pc(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Il(e.bounds,sc(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Rd(e,t)!==void 0&&!Ec(e.body,t,/* @__PURE__ */ new Set)?Tc(e,wc):void 0;return(t,n,r,o,s,c)=>{let l=[];Il(e.bounds,sc(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ml(n,e)?.kind===`Value`)){u.every(n=>pc(t,e.body,sc(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Kc(r)?u.slice(n).every(n=>pc(t,e.body,sc(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=W(e.condition,sc(r,i,a));if(typeof l!=`boolean`)throw uc(r,fc(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=sc(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw uc(r,`In computing ${lc(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Gi(t)}) was used as a guard condition of a CASE.\n${al(e.source)}`)})?.body??n;if(!u)throw uc(r,`In computing ${lc(r)}, TLC encountered a CASE with no conditions true.\n${il(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Au(e.definitions,t);return(t,r,a,o,s,c)=>n(t,yu(e.definitions,sc(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new y(`UNCHANGED appears in an initial predicate at ${nl(e)}`)}:Ic(e.expression,t);case`AngleAction`:{let n=r(e.action),i=Nc(e.subscript),a=(e,n,r)=>{try{return pc(e,i,sc(e,n,r))}catch(n){throw e.isEnabled?Md(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,Nc(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Rc(e,t,n);case`FunctionApplication`:return Fc(e,t,n);case`Apply`:{let i=e.args;if(mc(e.operator)){let r=vc(i[0],t,n);if(r!==void 0)return e.operator===`=`?kc([e],t,n):jc(e,()=>r);if(bc(i[0],n))return Pc(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=W(i[0],sc(t,n,r));(typeof c==`boolean`?c:bl(c,`the left side of => at ${nl(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Lc(e,t,n)}default:return Ac(e)}},Uc=/* @__PURE__ */ new WeakMap,Wc=e=>{let t=Uc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Uc.set(e,n),n},Gc=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Kc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},qc=(e,t)=>{let n=t.state;if(!n||!Kc(n))throw new y(`ENABLED needs a complete state at ${nl(e)}`);let r=t.environment;if(r.callStack)return nc(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return hc(e,r,!1)(i,t.scope,Wc(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Jc=(t,r,i,a)=>{let o={environment:r,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};hc(t,r,!0)(o,a,Wc(r),void 0,!1,t=>{if(!o.isStopped){if(!Kc(t))throw n(new ne([...t]),e.error);o.isStopped=i(t)}})},Yc=(e,t,n)=>{let r=[];return Jc(e,t,e=>(r.push(e),!1),n),r},Xc=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return hc(e,n,!1)(a,i,Wc(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Kc(e)){let r=Gc(e,n);throw new ee(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Zc=(e,t,n,r)=>{let i=[];return Xc(e,t,n,e=>(i.push(e),!1),r),i},Qc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),$c=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),el=e=>$c.has(e.kind)||e.kind===`Apply`&&Qc.has(e.operator),tl=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&ft(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},nl=e=>`line ${e.location.line}, column ${e.location.column}`,rl=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,il=e=>{let t=e.location.range;return t?rl(t):nl(e)},al=e=>e.kind===`Number`?e.text??String(e.value):il(e),ol=(e,t)=>new y(`A non-boolean expression (${Gi(t)}) was used as the condition of an IF.\n${il(e)}`),sl=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new y(`A non-boolean expression (${Gi(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${al(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new y(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Gi(n)}.\n${il({...e,location:{...e.location,range:{...r,end:i}}})}`)},cl=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${z(n)}\n${il(e)}`,r=e=>`Attempted to apply function:\n${dt(z(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!P(i))throw new y(`Attempted to select field "${t}" from a non-record value ${dt(z(i))}\n${il(e)}`);let a=Kt(i);if(a===`tuple`)throw Ir(t);return zr(i,t,a===`record`?n:r)}},ll=e=>e===`1.7.4`?(t,n)=>Nr(t,n,e):void 0,ul=e=>t=>{if(!P(t))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${Gi(t)})\n${il(e)}`);return Vr(t)},dl=(e,t)=>(n,r)=>{if(!N(n)||Pt(n))throw new y(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${il(e)}`);return t.evaluate([n,r])},fl=t=>n(new y(`TLC can't handle real numbers: ${t.text} at ${nl(t)}`),e.configParseError),pl=t=>n(new y(`TLC can't handle a number this big: ${t.text??t.value} at ${nl(t)}`),e.error),ml=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},hl=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),gl=(e,t,n)=>{if(t.kind===`Name`)return hl(e,t.name,n);let r=Cr(n);if(!r||r.length!==t.names.length)throw new y(`Cannot bind <<${t.names.join(`, `)}>> to ${z(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>hl(e,t,r[n]),e)},_l=(e,t)=>{if(P(e))return e;throw new y(`A non-function (${Gi(e)}) was applied as a function.\n${il(t)}`)},vl=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},yl=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),bl=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Expected ${t} to be a boolean but found ${z(e)}`);return e},xl=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Sl=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Cl=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),wl=(e,t)=>{if(Sl.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&Cl.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=xl(n,t);if(e&&!t.constants.has(n)&&!Tl(e,t))return!0}return xi(e).some(e=>wl(e,t))},Tl=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!wl(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>wl(e.set,t)));return t.constantLevels.set(e,r),r},El=(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.`},Dl=(e,t,n)=>{if(!N(e)||Pt(e)){let r=z(e),i=n===`1.7.4`?void 0:El(e,r);throw new y(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${al(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${al(t)}\n${i}`)}},Ol=(e,t,n)=>(Dl(e,t,n),typeof e==`object`&&e.kind===`Interval`?Yn(e):cr(e)??L(e).elements),kl=(e,t,n)=>n===`1.7.4`?(Dl(e,t,n),cr(e)??pr(e)):Ol(e,t,n),Al=e=>{if(typeof e==`object`&&e.kind===`Interval`)return yr(e),e},jl=(e,t,n)=>Al(e)??kl(e,t,n),Ml=(e,t,n)=>Al(e)??Ol(e,t,n),Nl=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},Pl=(e,t)=>e.map(e=>jl(W(e.set,t),e.set,t.environment.runtime.version)),Fl=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Nl(t[n],t=>i(n-1,gl(a,e[n].pattern,t)));return i(e.length-1,n)},Il=(e,t,n)=>Fl(e,Pl(e,t),t.scope,n),Ll=(e,t)=>{let n=e.map(e=>W(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Rl=(e,t,n)=>{if(e.length===1)return gl(t,e[0].pattern,n);let r=Cr(n)??[];return e.reduce((e,t,n)=>gl(e,t.pattern,r[n]),t)},zl=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Bl=e=>Object.assign(e.value,{lambda:e}),Vl=e=>zl(e)?e.lambda:void 0,Hl=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:$n(i),o=(e,n,i)=>`In applying the function\n${dt(z(r))},\nthe ${e} is:\n${dt(z(n))}${i}.\n${il(t.function)}`,s=e.bounds;if(s.length===1){if(!Dr(a,r.domain))throw new y(o(`first argument`,a,`which is not in its domain`));return Rl(s,e.scope,a)}let c=Cr(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new y(`Attempted to apply a function to an argument not in its domain.\n${il(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!Dr(n,l[t]))throw new y(o(r,n,`${e.pattern.kind===`Name`?``:`
80
+ `}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Cr(n)?.length!==e.pattern.names.length)throw new y(o(r,n,`which does not match its formal parameter`))}),Rl(s,e.scope,$n(c.slice(0,s.length)))},Ul=/* @__PURE__ */ new WeakMap,Wl=(e,t)=>{let n=Ul.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:rl(r)};return Ul.set(t,i),i},Gl=(e,t,n)=>{let r=Wl(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}},Kl=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=ei(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(an(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},ql=/* @__PURE__ */ new WeakMap,Jl=e=>{let t=ql.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return ql.set(e,n),n},Yl=(e,t)=>{let n=Ll(e.bounds,t),r=Kl(n,(n,r)=>W(e.body,yl(t,Rl(e.bounds,hl(void 0,e.name,r),n))),Gl(e.bounds,e.body,n));return Bl({value:r,bounds:e.bounds,body:e.body,scope:hl(void 0,e.name,r)}),e.bounds.length===1?qt(r):r},Xl=(e,t)=>{if(typeof t!=`object`||Kt(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!ft(t.domain))return t;try{let e=Mr(t);return Ut(e.domain,e.range)}catch(e){if(e instanceof y)return t;throw e}},Zl=(e,t)=>e.kind===`Function`?e.isSelfReferential?Yl(e,t):W(Jl(e),t):W(e.body,t),Ql=(e,t)=>{let n=Tl(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 y(`Operator ${e.name} requires ${e.params.length} arguments`);let i=yl(t,void 0);if(!n)return Zl(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>Xl(e,Zl(e,i)));return t.environment.definitionValues.set(e,a),a},$l=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(!(t.constants.has(n)||t.substitutions.has(n))&&Tl(e,t))try{Pn(Ql(e,{environment:t,scope:void 0,state:void 0,next:void 0}))}catch(e){if(!(e instanceof y)&&!c(e))throw e}}),eu=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=W(e.expression,yl(t,e.scope));return n&&(e.cache=r),r},tu=/* @__PURE__ */ new WeakMap,nu=e=>{let t=tu.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return tu.set(e,n),n},ru=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return ru(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?nu(r):t.builtins.get(e)},iu=/* @__PURE__ */ new WeakMap,au=(e,t)=>{if(B(e))return ou(e.operator,t);let n=iu.get(e),r=n===void 0?ru(e.operator,t.environment)??null:n;return n===void 0&&iu.set(e,r),r??ou(e.operator,t)},ou=(e,t)=>{let n=ml(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return ru(e,t.environment)},su=e=>e.kind===`Closure`?e.params.length:e.arity,cu=(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:ou(n,t);if(!r)throw new y(`Expected an operator argument at ${nl(e)}`);return r},lu=(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)=>hl(e,n.name,t[r]),e.scope);return W(e.body,yl(n,r))},uu=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:su(e),call:n=>lu(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},du=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=ou(e.name,t);return n!==void 0&&su(n)>0},fu=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),pu=(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 pu(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([])}},mu=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&xu(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=B(e)?void 0:pu(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ml(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:fu(e,t)}}return t=>fu(e,t)},hu=/* @__PURE__ */ new WeakMap,gu=(e,t)=>{let n=hu.get(e);if(n)return n;let r=mu(e,t);return hu.set(e,r),r},_u=(e,t,n)=>{if(t.length!==e.params.length)throw new y(`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:cu(t[i],n)}:gu(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},vu=(e,t,n)=>e.kind===`Closure`?W(e.body,yl(n,_u(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(nd(t,n),n):e.evaluate(t.map(e=>du(e,n)?uu(cu(e,n),n):W(e,n)),n),yu=(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),bu=(e,t,n)=>{let r=ml(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return eu(r,n);if(r?.kind===`Operator`){if(su(r.operator)===0)return lu(r.operator,[],n);throw new y(`Operator ${e} is used without arguments`)}let i=pu(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw jd(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Ql(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new y(`Unknown identifier ${e} at ${nl(t)}`)},xu=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Su=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Cu=(e,t)=>Su.has(e)||t.builtins.get(e)?.isStateLevel===!0,wu={builtins:Su,definitions:/* @__PURE__ */ new WeakMap},Tu={builtins:new Set([...Su].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},Eu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&Tl(e,t),Du=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!B(e)){let e=xl(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!Eu(e,t)&&Ou(e,t,n))return!0}return xi(e).some(e=>Du(e,t,n))},Ou=(e,t,n=wu)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Du(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Du(e.set,t,n));return n.definitions.set(e,i),i},ku={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},Au=(e,t)=>new Set(e.filter(e=>Ou(e,t)||Ou(e,t,ku))),ju=e=>[...e.definitions.values()].some(t=>Ou(t,e)),Mu=e=>[...e.definitions.values()].some(t=>Ou(t,e,Tu)),Nu=/* @__PURE__ */ new WeakMap,Pu=(e,t)=>{let n=Nu.get(e);if(n!==void 0)return n;let r=Ru(e,t,Iu);return Nu.set(e,r),r},Fu=/* @__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`]),Iu=/* @__PURE__ */ new Set,Lu=(e,t,n)=>n.size===0?Pu(e,t):Ru(e,t,n),Ru=(e,t,n)=>{if(!Fu.has(e.kind))return!1;if(e.kind===`Identifier`&&B(e))return n.has(e.name);if(B(e))return!1;if(e.kind===`Identifier`){let n=pu(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&Eu(n.definition,t)}if(e.kind===`Apply`){if(Cu(e.operator,t)||ku.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=ru(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=xl(e.operator,t);if(!n||!Tl(n,t)||Ou(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`&&Lu(e,t,n))}let r={value:!0};return is(e,(e,i)=>(r.value&&=Lu(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},zu=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Bu=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}},Vu=(e,t)=>{if(e.kind===`Identifier`&&B(e))return!t.has(e.name);if(B(e))return!0;let n={value:!1};return is(e,(e,r)=>(n.value||=Vu(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Hu=(e,t)=>Xo.has(e)&&zu(e)&&Rd(e,t)!==void 0&&!Vu(e,Iu),Uu=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,Wu=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Tr.sets,o=Tr.callStack,s=a??[],c=s.length;Tr.sets=s,Tr.callStack=r;try{let a=t(i),o=Uu(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&el(e)&&r.sources.set(o,e),o}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=tl(e,r.values),a=i&&!xi(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!P(a)?void 0:a;throw Gu(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Tr.sets=a,Tr.callStack=o}},Gu=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof y){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},Ku=(e,t,n)=>{if(!(n instanceof y))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},qu=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Ju=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Fd(e,t),i=t.callStack,a=i?Wu(e,r,t,i):zu(e)&&Pu(e,t)?Bu(r):Hu(e,t)?$u(r):r;return t.evaluators.set(e,a),a},Yu=/* @__PURE__ */ new WeakMap,Xu=(e,t)=>{if(t.callStack)return Ju(e,t);let n=Yu.get(e);if(n)return n;let r=(zu(e)&&Pu(e,t)?void 0:pa(e,t))??Ju(e,t);return Yu.set(e,r),r},W=(e,t)=>Xu(e,t.environment)(t),Zu=(e,t)=>{let n=e.name,r=B(e)?void 0:pu(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw jd(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&&Tl(e,t))return t=>Ql(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Xu(e.body,t),n.body(yl(r,void 0)));return Qu(e,t)?$u(r):r}return t=>Ql(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Ql(e,t);return Tl(e,t)||!Qu(e,t)?n:$u(n)}return t=>bu(n,e,t)},Qu=(e,t)=>Rd(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Rd(e.set,t)!==void 0)),$u=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}},ed=(e,t)=>{let n=ru(e,t);return n!==void 0&&su(n)>0},td=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!B(e)&&ed(e.name,t)),nd=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),rd=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(nd(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&td(t[0],n)){let e=Ju(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&td(t[0],n)&&td(t[1],n);if(i&&a){let e=Ju(t[0],n),r=Ju(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>du(e,n)?uu(cu(e,n),n):W(e,n)),n)},id=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new y(`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:gu(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:cu(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},ad=()=>({calls:/* @__PURE__ */ new Map,size:0,state:void 0}),od=/* @__PURE__ */ new WeakMap,sd=e=>{let t=od.get(e);if(t)return t;let n={constant:ad(),state:ad()};return od.set(e,n),n},cd=e=>e.kind===`ExceptAt`||xi(e).some(cd),ld=/* @__PURE__ */ new WeakMap,ud=(e,t)=>{let n=ld.get(e);if(n!==void 0)return n;let r=Rd(e,t)!==void 0&&Tc(e,Iu),i=r&&[...new Set(cd(e)?[...r,`@`]:r)];return ld.set(e,i??!1),i??!1},dd=e=>typeof e!=`object`||e.kind===`ModelValue`||e.kind===`Set`||e.kind===`Function`||e.kind===`Interval`,fd={sources:[],sourceCount:0,args:[],argCount:0,hash:0,isStateKeyed:!1},pd=e=>typeof e==`object`&&e.kind===`ModelValue`?e.rank:ei(e),md=e=>dd(e)?(fd.sources[fd.sourceCount++]=void 0,fd.args[fd.argCount++]=e,fd.hash=Gr(fd.hash,pd(e)),!0):!1,hd=(e,t,n)=>{if(!t)return!1;fd.sources[fd.sourceCount++]=e,fd.isStateKeyed=!0;for(let e=0;e<t.length;e++){let r=ml(n,t[e]);if(r?.kind!==`Value`||!dd(r.value))return!1;fd.args[fd.argCount++]=r.value,fd.hash=Gr(fd.hash,pd(r.value))}return!0},gd=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&xu(e.value))return()=>md(e.value);if(e.kind===`Identifier`){let n=B(e)?void 0:pu(e.name,t);if(n?.kind===`Value`)return()=>md(n.value);if(n===void 0)return n=>{let r=ml(n.scope,e.name);return r?.kind===`Value`?md(r.value):r?.kind!==`Thunk`||r.state!==n.state?!1:hd(r.expression,ud(r.expression,t),r.scope)}}let n=ud(e,t);return t=>hd(e,n,t.scope)},_d=e=>{if(e.args.length!==fd.argCount||e.sources.length!==fd.sourceCount)return!1;for(let t=0;t<fd.sourceCount;t++)if(e.sources[t]!==fd.sources[t])return!1;for(let t=0;t<fd.argCount;t++)if(!an(e.args[t],fd.args[t]))return!1;return!0},vd=e=>{if(e!==void 0){for(let t=0;t<e.length;t++)if(_d(e[t]))return e[t]}},yd=(e,t)=>{let n=xl(e.operator,t);if(n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&!Ou(n,t))return Tl(n,t)?`constant`:Qu(n,t)?`state`:void 0},bd=(e,t,n,r)=>{let i=id(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Xu(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r||t.length!==e.params.length)return e=>o(i(e),e);let s=sd(e),c=t.map(e=>gd(e,n)),l={hits:0,misses:0};return e=>{if(e.isKeepLazy)return o(i(e),e);fd.sourceCount=0,fd.argCount=0,fd.hash=t.length,fd.isStateKeyed=!1;for(let t=0;t<c.length;t++)if(!c[t](e))return o(i(e),e);let n=r===`state`||fd.isStateKeyed;if(n&&l.misses>1024&&l.hits<l.misses)return o(i(e),e);let a=n?s.state:s.constant;n&&a.state!==e.state&&(a.state=e.state,a.calls.clear(),a.size=0);let u=fd.hash&1073741823,d=a.calls.get(u),f=vd(d);if(f)return n&&l.hits++,f.value;n&&l.misses++;let p=fd.sources.slice(0,fd.sourceCount),m=fd.args.slice(0,fd.argCount),h=o(i(e),e);if(a.size<65536){a.size++;let e={sources:p,args:m,value:h};d?d.push(e):a.calls.set(u,[e])}return h}},xd=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Ju(n[0],t),r=Ju(n[1],t);return t=>!bl(e(t),`the left side of =>`)||bl(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new y(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=B(e)?void 0:ru(e.operator,t);if(r?.kind===`Closure`){let i=t.callStack?void 0:yd(e,t);return bd(r,n,t,i)}if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Ju(n[0],t),i=ul(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Ju(n[0],t);return Zo.has(e)||wl(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=Ju(n[0],t),a=Ju(n[1],t),o=dl(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?rd(r,n,t):e.operator===`\\cdot`&&n.length===2?()=>{throw new y(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)}:r=>{let i=ou(e.operator,r);if(i)return vu(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new y(`${e.operator} is a function; apply it with brackets`):new y(`Unknown operator ${e.operator} at ${nl(e)}`)}},Sd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Ju(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Ju(a.set,t);return s=>Nl(jl(o(s),a.set,t.runtime.version),t=>bl(i(yl(s,hl(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>Ju(e.set,t));return s=>{let c=a.map((e,n)=>jl(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?bl(i(yl(s,a)),r)!==n:Nl(c[t],n=>l(t-1,hl(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Il(o,e,t=>bl(i(yl(e,t)),r)!==n)?!n:n},Cd=(e,t)=>{if(e.kind===`Tuple`)return $n(e.names.map(e=>{let n=ml(t,e);return n?.kind===`Value`&&n.value}));let n=ml(t,e.name);return n?.kind===`Value`?n.value:void 0},wd=/* @__PURE__ */ new WeakSet,Td=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&wd.add(e)},Ed=(e,t)=>{let n=wd.has(e),r=Ju(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Ju(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=Zn(e),o=Ut(i,i.map(e=>r(yl(t,hl(t.scope,n,e)))));return ft(e)?o:qt(o)}let n=[],s=i.map(e=>Ml(W(e.set,t),e.set,t.environment.runtime.version));return Fl(i,s,t.scope,e=>{let o=i.length===1?Cd(a.pattern,e)??!1:$n(i.map(t=>Cd(t.pattern,e)??!1));return n.push([o,r(yl(t,e))]),!1}),Un(n)},l=(t,n)=>{let a=Bl({value:Kl(t,e=>r(yl(n,Rl(i,n.scope,e))),Gl(i,e.body,t)),bounds:i,body:e.body,scope:n.scope});return i.length===1?qt(a):a},u=t.callStack;return t=>{let r=o?s(t):Ll(i,t);if(e.isRecursive||n||t.isKeepLazy||!I(r))return l(r,t);if(!ft(r)){if(u)return l(r,t);try{return c(r,t)}catch(e){if(!(e instanceof y))throw e;return l(r,t)}}if(!u)return c(r,t);try{return c(r,t)}catch(t){throw Ku(u,e,t),t}}},Dd=(e,t)=>{let n=wd.has(e);n&&Td(e.function);let r=Ju(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=>Ju(e,t))}),value:Ju(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):$n(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(yl(i,hl(i.scope,`@`,e))):Hr(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(ma.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${il(e.function)}`)}return n}},Od=(e,t)=>{if(e.kind===`SetFilter`){let n=Ju(e.predicate,t),r=Ju(e.bound.set,t),i=e.bound.pattern,a=e.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:rl(a)},s=(e,t)=>n=>bl(e(yl(t,gl(t.scope,i,n))),`a set filter predicate`),c=(t,n,r)=>({kind:`FilteredSet`,base:t,test:s(r,n),source:o,rebind:r=>c(t,{...n,environment:r},Ju(e.predicate,r))});return e=>{let t=r(e);return ft(t)?Ht(L(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=Ju(e.expression,t);return t=>{let r=[];return Il(e.bounds,t,e=>(r.push(n(yl(t,e))),!1)),Rn(r)}}let n=e.set;if(!n)return()=>{throw new y(`TLC cannot evaluate an unbounded CHOOSE at ${nl(e)}`)};let r=Ju(e.body,t),i=Ju(n,t);return t=>{let a=i(t);if(!N(a)||Pt(a))throw new y(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${il(e)}`);let o={value:void 0},s=Ml(a,n,t.environment.runtime.version);if(Nl(s,n=>{let i=gl(t.scope,e.pattern,n);return bl(r(yl(t,i)),`the body of CHOOSE`)?(o.value=Cd(e.pattern,i),!0):!1}),o.value===void 0)throw new y(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${il(e)}`);return o.value}},kd=e=>[...e].sort((e,t)=>zt(e.name,t.name)),Ad=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),jd=(e,t)=>new te(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${il(t)}`,e),Md=(e,t)=>e instanceof te&&t!==`1.7.4`?new y(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,Nd=e=>new y(`A primed expression appears outside an action at ${nl(e)}`),Pd=(e,t)=>{let n=kd(e),r=Ad(n),i=n.map(e=>Ju(e.value,t));if(r)return e=>er(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=>vt(a,i.map(t=>t(e)),o):e=>tn(a,i.map(t=>t(e)))},Fd=(e,t)=>{let n=e=>Ju(e,t);switch(e.kind){case`Number`:{let t=e.value;return xu(t)?()=>t:()=>{throw pl(e)}}case`Decimal`:return()=>{throw fl(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Zu(e,t);case`Apply`:return xd(e,t);case`Bracket`:return()=>{throw new y(`A bracket without a function or subscript is not an expression at ${nl(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new y(`An operator cannot be used as a value at ${nl(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 sl(e,r,i);if(!i)return!1}return!0}}case`Or`:{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 sl(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw Nd(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>nn(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 ol(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new y(`A non-boolean expression (${Gi(t)}) was used as a condition of a CASE. ${al(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new y(`Attempted to evaluate a CASE with no conditions true.\n${il(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(yl(n,yu(e.definitions,n)))}case`Forall`:case`Exists`:return Sd(e,t);case`UnboundedQuantifier`:return()=>{throw new y(`TLC cannot evaluate an unbounded quantifier at ${nl(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Od(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Rn(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>$n(t.map(t=>t(e)))}case`FunctionConstruction`:return Ed(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 Pd(e.fields,t);case`RecordSet`:{let t=kd(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 Dd(e,t);case`ExceptAt`:return t=>{let n=ml(t.scope,`@`);if(n?.kind!==`Value`)throw new y(`@ appears outside an EXCEPT at ${nl(e)}`);return n.value};case`FunctionApplication`:{Td(e.function);let r=n(e.function),i=t=>_l(r(vl(t)),e),a=e.args.map(n),o=ll(t.runtime.version);if(a.length===1){let e=a[0];return t=>zr(i(t),e(t),o)}return e=>zr(i(e),$n(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=cl(e);return e=>r(t(e))}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?bl(t(e),`an action`)||r(e):bl(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>qc(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new y(`The subexpression reference at ${nl(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new y(`TLC cannot evaluate a temporal formula in a state at ${nl(e)}`)}}},Id=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Ld=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Rd=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Id.has(e.kind))return!1;let a=Ld(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&&Cu(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 xi(e).every(i)};return i(e)?[...n]:void 0},zd=`-------------------------------- MODULE Reals -------------------------------
81
81
  (***************************************************************************)
82
82
  (* This module provides dummy definitions of the operators that are *)
83
83
  (* defined by the real Reals module. It is expected that any tool that *)
@@ -94,7 +94,7 @@ EXTENDS Integers
94
94
  Real == "Reals"
95
95
  a / b == CHOOSE m \\in Real : m * b = a
96
96
  Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
97
- =============================================================================`,bd=`----------------------------- MODULE RealTime -------------------------------
97
+ =============================================================================`,Bd=`----------------------------- MODULE RealTime -------------------------------
98
98
  (***************************************************************************)
99
99
  (* This standard module is described in Chapter 9 of the book "Specifying *)
100
100
  (* Systems". The type of specification described there cannot be handled *)
@@ -120,7 +120,7 @@ RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
120
120
  IN /\\ now \\in Real
121
121
  /\\ [][NowNext]_now
122
122
  /\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
123
- =============================================================================`,xd=`----------------------------- MODULE Toolbox --------------------------------
123
+ =============================================================================`,Vd=`----------------------------- MODULE Toolbox --------------------------------
124
124
  (***************************************************************************)
125
125
  (* *)
126
126
  (***************************************************************************)
@@ -146,7 +146,7 @@ _TEPosition ==
146
146
  THEN _TETraceLength
147
147
  ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
148
148
 
149
- =============================================================================`,Sd=/* @__PURE__ */ new Map([[`Reals`,yd],[`RealTime`,bd],[`Toolbox`,xd]]),Cd=`tlc2/value/impl/`,wd=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)}},Td=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Ed=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Dd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Td.get(e[3])}${`[]`.repeat(e[1].length)}`),Od=(e,t)=>e[e[t].first].text,kd=(e,t)=>Od(e,t).replaceAll(`/`,`.`),Ad=e=>{let t=wd(e);if(t.readUint32()!==3405691582)throw new u(`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();let a=kd(n,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 o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=Dd(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:wd(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>kd(n,d.readUint16())):[],p=Ed.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Dd(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},jd=(e,t)=>{let n=e[t],r=e[n.second];return{className:Od(e,n.first),name:e[r.first].text}},Md=(e,t,n,r)=>{let i=()=>new ie(`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=jd(t,l());if(n.className!==`${Cd}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=jd(t,l()),a=s();if(n.className!==`${Cd}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:Od(t,l()),value:void 0}),e+=3;else if(n===183){let n=jd(t,l()),a=s(),o=s();if(!(n.className===`${Cd}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()},Nd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Ad(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:Md(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},Pd=/* @__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(`,`),Fd=[[`\\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`,`≀`],[`^+`,`⁺`]],Id=/* @__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(`,`),Ld=/* @__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(`.`),Rd=/* @__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(`.`),zd=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
149
+ =============================================================================`,Hd=/* @__PURE__ */ new Map([[`Reals`,zd],[`RealTime`,Bd],[`Toolbox`,Vd]]),Ud=`tlc2/value/impl/`,Wd=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)}},Gd=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Kd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],qd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Gd.get(e[3])}${`[]`.repeat(e[1].length)}`),Jd=(e,t)=>e[e[t].first].text,Yd=(e,t)=>Jd(e,t).replaceAll(`/`,`.`),Xd=e=>{let t=Wd(e);if(t.readUint32()!==3405691582)throw new u(`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();let a=Yd(n,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 o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=qd(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:Wd(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>Yd(n,d.readUint16())):[],p=Kd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=qd(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},Zd=(e,t)=>{let n=e[t],r=e[n.second];return{className:Jd(e,n.first),name:e[r.first].text}},Qd=(e,t,n,r)=>{let i=()=>new C(`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=Zd(t,l());if(n.className!==`${Ud}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=Zd(t,l()),a=s();if(n.className!==`${Ud}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:Jd(t,l()),value:void 0}),e+=3;else if(n===183){let n=Zd(t,l()),a=s(),o=s();if(!(n.className===`${Ud}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()},$d=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Xd(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:Qd(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},ef=/* @__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(`,`),tf=[[`\\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`,`≀`],[`^+`,`⁺`]],nf=/* @__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(`,`),rf=/* @__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(`.`),af=/* @__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(`.`),of=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),sf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
150
150
  Nat == { }
151
151
  a+b == {a, b}
152
152
  a-b == CHOOSE n : b + n = a
@@ -462,18 +462,1323 @@ _CheckName(name) ==
462
462
  => (PrintT(counts) /\\ FALSE)
463
463
  _PrintCounts == PrintT(_Counts)
464
464
  =============================================================================
465
- `]]),Bd=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),Vd=k(`EOF`),Hd=k(`IDENTIFIER`),Ud=k(`DEFBREAK`),Wd=(e,t)=>Array.from({length:k(t)-k(e)+1},(t,n)=>k(e)+n),Gd=new Set(Wd(`op_57`,`op_119`)),Kd=new Set(Wd(`op_1`,`op_119`)),qd=new Set(Wd(`op_57`,`op_70`)),Jd=/* @__PURE__ */ new Set([...Wd(`ACTION`,`EXCEPT`),k(`EXTENDS`),...Wd(`IF`,`SF`),k(`STATE`),...Wd(`THEN`,`WITH`),k(`US`),...Wd(`op_112`,`op_116`)]),Yd=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),Xd=new Map([...Yd(`postfix`,160,160,!0,`[`),...Yd(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Yd(`prefix`,120,120,!1,`-.`),...Yd(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Yd(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Yd(`prefix`,40,40,!0,`\\lnot`),...Yd(`nfix`,100,130,!0,`\\times`),...Yd(`infix`,140,140,!1,`^`,`^^`),...Yd(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Yd(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Yd(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Yd(`infix`,100,110,!0,`|`,`||`,`%%`),...Yd(`infix`,100,110,!1,`%`),...Yd(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Yd(`infix`,90,140,!1,`\\wr`),...Yd(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Yd(`infix`,90,130,!1,`!!`),...Yd(`infix`,90,90,!1,`...`,`..`),...Yd(`infix`,80,80,!0,`\\intersect`,`\\union`),...Yd(`infix`,80,80,!1,`\\`),...Yd(`infix`,70,70,!1,`<:`,`:>`),...Yd(`infix`,60,60,!0,`@@`),...Yd(`infix`,50,140,!0,`\\cdot`),...Yd(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Yd(`infix`,30,30,!0,`\\land`,`\\lor`),...Yd(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Yd(`infix`,10,10,!1,`=>`)]),Zd=new Map([...Xd,...Fd.flatMap(e=>e.slice(1).map(t=>[t,Xd.get(e[0])]))]),Qd=Zd.get(`[`),$d={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},ef=e=>({type:`tokens`,kinds:new Set(e)}),tf=e=>typeof e==`string`?e.startsWith(`<`)?ef([k(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(tf)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),nf=e=>(...t)=>({type:e,body:G(...t)}),q=nf(`zeroOrMore`),rf=nf(`oneOrMore`),J=nf(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),af=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),of=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=af(e,n);return n},sf=(...e)=>{let t=e.map(k);return e=>t.includes(of(e,1).kind)},cf=(e,t=of(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},lf=e=>{let t=of(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},uf=e=>sf(`CASESEP`)(e)&&cf(e),df=e=>{let t=of(e,1);Jd.has(t.kind)&&(t.kind=Hd)},ff=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,pf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),mf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},hf=e=>e.operatorStacks[e.operatorStacks.length-1],gf=(e,t)=>e.low>t.high,_f=(e,t)=>e.high<t.low,vf=e=>e.fix===`prefix`?e:Zd.get(`${e.name}.`),yf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Qd?pf(`FcnAppl`,[n,...r.node.heirs]):pf(`PostfixExpr`,[n,r.node]),operator:void 0})},bf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:pf(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:pf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},xf=e=>{let t=hf(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return yf(t,n),xf(e);if(i.operator!==void 0){let t=vf(r.operator);return t!==void 0&&gf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${ff(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${ff(e,a.node.first,a.node.last)} and expression at location ${ff(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return _f(a.operator,r.operator)?void 0:gf(a.operator,r.operator)?(bf(t,a.operator),xf(e)):`Precedence conflict between ops ${a.operator.name} in block ${ff(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=vf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(_f(s,r.operator))return;if(!gf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${ff(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return bf(t,s),xf(e);let c=ff(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===$d?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Sf=e=>Y(t=>{let n=hf(t),r=mf(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:xf(t)}),Cf=Sf(()=>!1),wf=Sf(()=>!0),Tf=Y(e=>{e.lastOperator=Zd.get(e.token.image)}),Ef=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},Df=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Ef(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Of=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!cf(e,n.first.beginColumn))return n;let t=Of(e,n);if(t!==void 0)return t}},kf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(k),n=(e,...t)=>t.some(t=>e.kind===k(t)),r=e=>e!==void 0&&Gd.has(e.kind),i=e.token,a=af(e,i);i.next=void 0;let o=af(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===Hd&&(e=e.next)}else if(e.kind===Hd){let t=e.next;!r(t)||qd.has(t.kind)||Kd.has(t.kind)&&t.next?.kind!==Hd||(e=t.next?.kind===k(`SUBSTITUTE`)?i:Kd.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Ud&&(e.next={kind:Ud,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=af(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Af=e=>{let t=of(e,1);if(t.kind===k(`LAB`)){let n=1;for(;n!==0;)if(t=af(e,t),t.kind===k(`LAB`)&&n++,t.kind===k(`RAB`)&&n--,t.kind===Vd)return!1;return af(e,t).kind===k(`IN`)}if(t.kind!==Hd)return!1;for(t=af(e,t);t.kind===k(`COMMA`);){if(t=af(e,t),t.kind!==Hd)return!1;t=af(e,t)}return t.kind===k(`IN`)},jf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Mf=e=>e.proofLevels.at(-1)??-1,Nf=e=>{let t=of(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:sf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Mf(e)>=0&&jf(t)>Mf(e):sf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Pf=(e,t)=>{let n=jf(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},Ff=e=>Y(t=>Pf(t,t.token)?void 0:`${ff(t,t.token)}: ${e}`),If=ef([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(k)),Lf=ef([...If.kinds,k(`op_76`)]),Rf=ef(Kd),zf=ef(qd),Bf=ef([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(k)),Vf=()=>q(Z({expansion:[K(If,`<op_77>`)],semantic:cf}),K(`PrefixOp`,`InfixOp`),wf),Hf=()=>K(G(Z({expansion:[`OpenStart`],semantic:cf}),`OpenExpression`,Cf),G(Z({semantic:cf}),`ExtendableExpr`)),Uf=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),Wf=()=>K(G(Z({semantic:e=>sf(`ASSUME`,`BOXASSUME`)(e)||of(e,2).kind===k(`COLONCOLON`)&&[k(`ASSUME`),k(`BOXASSUME`)].includes(of(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Gf=()=>[`JuncItem`,q(Z({semantic:lf}),`JuncItem`)],Kf=e=>Y(t=>{t.expecting=e,df(t)}),qf=e=>Y(t=>{t.isTerminalProof=e}),Jf=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{kf(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),Yf={CompilationUnit:Q(void 0,[Y(kf),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),Kf(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,Kf(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,Kf(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(kf)),G(Z({semantic:e=>sf(`USE`)(e)&&of(e,2).kind!==k(`ONLY`)||sf(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(Jf(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Jf(`Expression`,Z({expansion:[`<IDENTIFIER>`,zf]}),`PostfixLHS`,`Expression`),Jf(`Expression`,Z({expansion:[`<IDENTIFIER>`,Rf]}),`InfixLHS`,`Expression`),Jf(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),Jf(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[Lf,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,Rf,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,zf]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,Kf(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[If,Tf]),NonExpPrefixOp:Q(void 0,[Lf,Tf]),InfixOp:Q(`Infix Op`,[Rf,Tf]),PostfixOp:Q(void 0,[zf,Tf]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{kf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),Wf(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),Wf(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=mf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${ff(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(kf),K(G(Z({amount:3}),Z({semantic:sf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:Nf}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>sf(`BY`)(e)||of(e,2).kind===k(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>of(e,2).kind!==k(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,qf(!0),J(`<ONLY>`)),G(`<USE>`,qf(!1),J(`<ONLY>`)),G(`<HIDE>`,qf(!1))),X("an expression, `MODULE' or `DEF'"),J(Uf(),q(`<COMMA>`,X(`MODULE or expression`),Uf(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Uf(),q(`<COMMA>`,X(`MODULE or expression`),Uf(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),Bf,Ff(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:Nf}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),Bf,Ff(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:sf(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:sf(`INSTANCE`)}),`Instantiation`),G(Z({semantic:sf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:Nf}),Y(e=>{let t=mf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${ff(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),rf(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:sf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(Lf,Rf,zf),ef([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(k))],semantic:cf}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${ff(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:cf}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:Af}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),rf(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=mf(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),rf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:Af}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>of(e,2).kind===k(`MAPTO`)&&Jd.has(of(e,1).kind)}),Y(e=>{of(e,1).kind=Hd}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=pf(`FcnAppl`,t.heirs),e.lastOperator=Qd})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,rf(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(df),`Identifier`),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===k(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>uf(e)&&of(e,2).kind!==k(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:uf}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[rf(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=of(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...Gf()),G(Z({expansion:[`<AND>`]}),...Gf())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Of(t,e.heirs[1]);return n&&`Item at ${ff(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${ff(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),Vf(),Hf()],(e,t)=>{let n=hf(t);n.push({node:e.heirs[0],operator:$d});let r=xf(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Cf,q(K(G(Z({expansion:[`PostfixOp`],semantic:cf}),`PostfixOp`,wf),G(Z({expansion:[`<DOT>`],semantic:cf}),`<DOT>`,Y(df),Z({semantic:cf}),`Identifier`,Y(e=>{let t=hf(e);t[t.length-1].operator!==void 0&&yf(t,t.length),t[t.length-1]={node:pf(`RecordComponent`,[t[t.length-1].node,mf(e,2),mf(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:cf}),X(`function argument`),`SBracketCases`,Sf(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:cf}),`InfixOp`,wf,Vf(),Hf()),G(Z({expansion:[`<COLONCOLON>`],semantic:cf}),`<COLONCOLON>`,Y(e=>{let t=hf(e);if(!Df(t[t.length-1].node))return`\`::' at ${ff(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=hf(e),n=mf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!_f(r,e.lastOperator)){let t=mf(e,3);return`Removing label at ${ff(e,t.first,t.last)} would change expression parsing.`}t.push({node:pf(`Label`,[mf(e,3),mf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:cf}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:cf}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>Mf(e)<0&&e.proofLevels.length<=1?`${ff(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${ff(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Ef(e.heirs)===void 0?e.heirs.length===1?pf(`GeneralId`,e.heirs):void 0:pf(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>of(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>of(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${ff(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Xf=/* @__PURE__ */ new Map,Zf=e=>{let t=Xf.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Zf(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,Zf(Yf[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return Xf.set(e,n),n},Qf=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},$f=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=af(e,e.scanPosition)),e.scanPosition=af(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},ep=(e,t)=>{if(t.type===`tokens`)return $f(e,t.kinds);if(t.type===`call`)return ep(e,Yf[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Qf(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=ep(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||Qf(e,t.semantic)?ep(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=ep(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=ep(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},tp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=ep(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},np=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||Zf(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Zf(a).hasSemanticStart?Zf(a).first.has(of(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):tp(e,i,a)&&(o===void 0||o(e))}),rp=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,ep(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=af(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Vd){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=af(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ge(e.token.image)}" `},ip=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??rp(e)}\n\nResidual stack trace follows:\n${r}`,!1},ap=(e,t)=>{let n=af(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,ip(e))},op=(e,t)=>{let n=Yf[t];n.message!==void 0&&(e.messages.push({name:n.message,token:of(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!sp(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return ip(e,i);let a=r.node??(r.heirs.length===0?void 0:pf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},sp=(e,t)=>{if(t.type===`tokens`)return ap(e,t.kinds);if(t.type===`call`)return op(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||ip(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||ip(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||sp(e,t));if(t.type===`choice`){let n=np(e,t.alternatives);return n===-1?ip(e):sp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!sp(e,t.body))return!1;if(t.type===`optional`)return np(e,[t.body])===-1||sp(e,t.body);for(;np(e,[t.body])===0;)if(!sp(e,t.body))return!1;return!0},cp=e=>{let t=Ue(e),n={kind:Vd,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=sp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},lp={low:15,high:15},up={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),dp=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),fp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),pp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),mp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),hp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),gp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),_p=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...fp]),vp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?dp.has(e.operator):fp.has(e.operator)),yp=e=>dp.has(e)||fp.has(e)||e===`-.`,bp=(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}}},xp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Sp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Cp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),wp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Tp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Ep=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Dp=/* @__PURE__ */ new Set([``,`*`,`-`]),Op=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),kp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Ap=/* @__PURE__ */ new Set([`NEW`,...kp.keys()]),jp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Mp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Np=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Pp=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
466
- `)}\n`},Fp=(e,t)=>{let n=t===`tlapm`,r=n?xe(e):xe(e).map(ye),i={index:0,offsideColumns:[]},a={},o=[],s=/* @__PURE__ */ new Set,c=[],l={index:-1},d=[],f=e=>o[o.length-1].has(e),m=e=>({line:e.line,column:n&&e.kind===`String`?e.endColumn:e.column,range:void 0}),h=[],_=[],v=[],y=(e,t=i.index-1)=>{let n=e===t?v[e]:void 0;if(n)return n;let a=r[t];h[e]??=m(r[e]),_[t]??={line:a.line,column:a.endColumn};let o={module:d[0].name,start:h[e],end:_[t]};return e===t&&(v[e]=o),o},b=(e,t)=>(e.location.range=y(t),e),ee=(e=0)=>r[Math.min(i.index+e,r.length-1)],x=(e=0)=>{let t=ee(e),n=i.offsideColumns[i.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},S=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),C={index:0},te=e=>{let t=r.slice(C.index,i.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ne=e=>n&&(e.kind===`Keyword`||Np.has(e.text)),re=e=>{let t=r.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)?`====`:Ep.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}`,ae=(e,t=ee(),n)=>{let i=r[r.length-1],a=t.line===i.line&&t.column===i.column;return new u(`${e} at line ${t.line}, column ${t.column}`,void 0,oe(e,t,a,n))},oe=(e,t,i,a)=>{if(n&&i){let e=r[r.length-1];return{reason:`Unexpected EOF`,...te(re(e)),isEnd:i}}return n&&a?{reason:`Unexpected ${ie(a)}`,...re(a),isEnd:i}:{reason:e,line:t.line,column:t.column,isEnd:i}},se=(e,t=ee())=>ae(e,t,t),ce=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ne(e),w=(e,t=0)=>{let n=x(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=x();if(e.kind===`End`)throw ae(`Unexpected end of expression`);return i.index++,e},E=e=>w(e)?(i.index++,!0):!1,D=e=>{if(!w(e))throw se(`Expected ${JSON.stringify(e)} but found ${S(x())}`);return T()},le=()=>{let e=x();if(e.kind!==`Identifier`)throw se(`Expected an identifier but found ${S(e)}`);if(ne(e))throw se(`Unexpected keyword ${e.text}`);return i.index++,e.text},ue=()=>{let e=i.index;return{name:le(),range:y(e)}},de=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),fe=()=>{let e=x();return e.kind!==`String`&&(mp.has(e.text)||dp.has(e.text)||fp.has(e.text)||e.text===`'`)?(i.index++,e.text):le()},me={isUsed:!1},he=()=>x().kind===`Identifier`||!ce(x())?le():(me.isUsed=!0,T().text),ge=e=>{if(!n)return e();i.offsideColumns.push(-1);let t=e();return i.offsideColumns.pop(),t},O=(e,t=`,`)=>{let n=[e()];for(;E(t);)n.push(e());return n},_e=()=>{if(w(`<<`)){let e={value:1};for(;x(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;x(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},ve=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;x(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return x(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},be=()=>{if(!E(`<<`)){let e=ue();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=de(O(ue));return D(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Se=()=>O(()=>{let e=O(be);D(`\\in`);let t=j();return e.map(e=>({pattern:e,set:t}))}).flat(),Ce=()=>{let e=x();if(e.kind===`Identifier`){let t=i.index,n=[T().text];for(;w(`!`)&&x(1).kind===`Identifier`;)T(),n.push(le());return b({kind:`Identifier`,name:n.join(`!`),location:m(e)},t)}if(w(`<<`)||w(`(`))return Le();throw se(`Expected a subscript but found ${S(e)}`)},we=e=>{let t=x(1),n=x(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(`==`,fp.has(n.text)?3:4))},k=e=>{let t=x(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&Sp.has(t.text)||we(e)},Te=()=>{let e=x(),t=e.kind===`Operator`&&(dp.has(e.text)||pp.has(e.text))&&k(e);if(n&&e.kind!==`String`&&(pp.has(e.text)||_p.has(e.text)&&e.text!==`'`&&!fp.has(e.text)||gp.has(e.text)&&x(-1).text===`(`&&x(-1).line===e.line&&x(-1).endColumn+1===e.column&&x(1).text===`)`&&x(1).line===e.line&&x(1).column===e.endColumn+1)&&k(e))throw ae(`incomplete expression`,e);if(t)return i.index++,b({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:m(e)},i.index-1);if(e.kind!==`String`&&_p.has(e.text)&&k(e)){i.index++;let t=m(e);if(fp.has(e.text))return b({kind:`OperatorReference`,operator:e.text,location:t},i.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return b({kind:`Lambda`,params:[n.name],body:bp(e.text,n,t),operator:e.text,location:m(e)},i.index-1)}if(w(`LAMBDA`)){let t=i.index;T();let n=de(O(ue));D(`:`);let r=j();return b({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:m(e)},t)}let r=j();return r.kind===`Identifier`&&A.delete(r),r},A=/* @__PURE__ */ new Map,Ee={range:void 0},De=()=>ge(()=>{let e=i.index;D(`(`);let t=O(Te);return D(`)`),Ee.range=y(e),t}),Oe=()=>{let e=T();i.offsideColumns.push(e.column);let t=[j()];for(;ee().text===e.text&&ee().column===e.column;)i.index++,t.push(j());return i.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:m(e)}},ke=e=>ge(()=>{let t=m(e),r=x().kind===`Identifier`,a=w(`|->`,1)&&(r||ce(x()));if(a||r&&w(`:`,1)){let e=a?`Record`:`RecordSet`,n=e=>{let t=i.index,n=m(x()),r=e();return n.range=y(t),D(a?`|->`:`:`),{name:r,value:j(),location:n}},o=[n(()=>r?le():T().text),...E(`,`)?O(()=>n(le)):[]];return D(`]`),{kind:e,fields:o,location:t}}if(_e()){let e=Se();D(`|->`);let n=j();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let o=j();if(E(`->`)){let e=j();return D(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(E(`EXCEPT`)){let e=O(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!ce(x()))throw se(`Expected a field name but found ${S(x())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:O(()=>j())}),D(`]`);return D(`=`),{path:e,value:j()}});return D(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!n&&!w(`]_`)){let e=[o];for(;E(`,`);)e.push(j());return D(`]`),{kind:`Bracket`,args:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:o,subscript:Ce(),location:t}}),Ae=()=>{let e=i.index,t=b(ze(),e),n=m(T());return b({kind:`Apply`,operator:`\\in`,args:[t,j()],location:n},e)},je=e=>ge(()=>{let t=m(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(_e()&&(x(1).text===`\\in`||w(`<<`))){let e=i.index,n=be();D(`\\in`);let r=j();if(E(`:`)){let e=j();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}i.index=e}let n=x().kind===`Identifier`&&w(`\\in`,1)?Ae():j();if(E(`:`)){let e=Se();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;E(`,`);)r.push(j());return D(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Me=e=>{let t=m(e),n=ge(()=>w(`>>`)||w(`>>_`)?[]:O(()=>j()));if(E(`>>_`)){if(n.length!==1)throw ae(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:Ce(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},Ne=e=>{let t=m(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&_e()){let e=Se();return D(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=de(O(ue));return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Pe=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:j(),location:m(e)};let n=j();D(`->`),t.push({condition:n,body:j()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:m(e)}},Fe=()=>{let e=x(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||xp.has(e.text)||e.kind===`Operator`&&(dp.has(e.text)||fp.has(e.text)||pp.has(e.text)))},Ie=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:pe(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return i.index--,{kind:`Bound`,args:De()}}return{kind:`Name`,name:e.text,args:w(`(`)?De():[]}},Le=e=>{let r=i.index,s=r===l.index,c=T(),u=m(c);if(n&&c.kind===`Keyword`&&c.text===`LAMBDA`){let e=O(le);return D(`:`),{kind:`Lambda`,params:e,body:j(),location:u}}if(c.kind===`Number`){if(n&&/^\\[BOH]/.test(c.text))throw ae(`incomplete expression`,c);return{kind:`Number`,value:pe(c.text),text:c.text,location:u}}if(c.kind===`Decimal`)return{kind:`Decimal`,text:c.text,location:u};if(c.kind===`String`)return{kind:`String`,value:c.text,location:u};let f=c.kind===`Step`&&nt(c);if(f&&$e()<0&&Qe.length<=1)throw ae(`Step number used outside proof`,c);if(f&&c.text[1]===`+`)throw ae(`<+> step number used in an expression`,c);if(c.kind===`Identifier`||f){let o=f?rt(c)??c.text:c.text;if(ve()){let t=de(E(`(`)?O(ue):[]);t.names.length>0&&D(`)`),D(`::`);let r=j();if(!n&&e!==void 0&&a.last!==void 0&&vp(r)&&e.high>=a.last.low)throw ae(`Removing the label would change expression parsing`,c);return{kind:`Label`,name:o,params:t.names,paramRanges:t.ranges,body:r,location:u}}let l=w(`(`);if(o===`@`&&!l&&!Fe())return{kind:`ExceptAt`,location:u};let p=l?De():[],m=[l?Ee.range:void 0];if(!Fe())return l?{kind:`Apply`,operator:o,args:p,argumentsRange:Ee.range,location:u}:{kind:`Identifier`,name:o,location:u};let h=d.flatMap(e=>e.instances).find(e=>e.name===o),_=h!==void 0&&t===`tlc`&&!s&&h.params.length!==p.length;if(_&&p.length>0)throw ae(`The operator ${o} requires ${h.params.length} arguments`,c);let v=[{kind:`Name`,name:o,args:p}],b=[y(r,r)];for(;Fe();)T(),b.push(y(i.index,i.index)),Ee.range=void 0,v.push(Ie()),m.push(Ee.range);let ee=v.flatMap(e=>e.kind===`Name`?[e.name]:[]),x=ee.join(`!`),S=v.flatMap(e=>`args`in e?e.args:[]),C=v.map(e=>`args`in e?e.args.length:0),te=m.findLast(e=>e!==void 0),ne=ee.length<v.length?{kind:`Subexpression`,selectors:v,selectorRanges:b,argumentRanges:m,location:u}:S.length===0?{kind:`Identifier`,name:x,selectorRanges:b,location:u}:C.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:x,args:S,argumentCounts:C,argumentsRange:te,selectorRanges:b,argumentRanges:m,location:u}:{kind:`Apply`,operator:x,args:S,argumentsRange:te,selectorRanges:b,argumentRanges:m,location:u};return _&&A.set(ne,{location:g(y(r)),message:`The operator ${o} requires ${h.params.length} arguments.`}),ne}if(c.kind===`Operator`&&yp(c.text)&&w(`(`))return{kind:`Apply`,operator:c.text,args:De(),location:u};if(c.kind===`Operator`&&yp(c.text)&&!n)return{kind:`Identifier`,name:c.text,location:u};switch(c.text){case`(`:{let e=ge(()=>j());return D(`)`),e}case`[`:return ke(c);case`{`:return je(c);case`<<`:return Me(c);case`@`:return{kind:`ExceptAt`,location:u};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Ne(c);case`IF`:{let e=j();D(`THEN`);let t=j();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:u}}case`CASE`:return Pe(c);case`LET`:{let e=[],t=[];for(o.push(/* @__PURE__ */ new Set);!E(`IN`);){if(n&&w(`RECURSIVE`))throw ae(`Unexpected keyword RECURSIVE`,te(ee()));if(E(`RECURSIVE`)){Ye();continue}let r=He(!1);r.kind===`Instance`?t.push(r):e.push(r)}o.pop();let r=j();return t.length===0?{kind:`Let`,definitions:e,body:r,location:u}:{kind:`Let`,definitions:e,instances:t,body:r,location:u}}case`CHOOSE`:{let e=be(),t=E(`\\in`)?j():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:u}}case`WF_`:case`SF_`:{let e=Ce(),t=ge(()=>{D(`(`);let e=j();return D(`)`),e});return{kind:c.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:u}}}throw se(`Unexpected ${S(c)}`,c)},Re=(e,t,r)=>{a.last=a.preceding={low:t,high:r};let i=j(r+1),o=x(),s=o.text===`'`||fp.has(o.text)?lp.high:dp.get(o.text)?.high;if(!n&&o.kind===`Operator`&&s!==void 0&&s>=t)throw ae(`Precedence conflict between ${e.text} and ${o.text}`,o);return i},ze=()=>{let e=a.preceding;a.preceding=void 0;let t=x(),r=m(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return Oe();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[Re(t,4,4)],location:r};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[Re(t,12,12)],location:r};case`[]`:return T(),{kind:`Always`,expression:Re(t,4,15),location:r};case`<>`:return T(),{kind:`Eventually`,expression:Re(t,4,15),location:r};case`ENABLED`:return T(),{kind:`Enabled`,expression:Re(t,4,15),location:r};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:Re(t,4,15),location:r};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:t.text,args:[n?j(9):Re(t,10,13)],location:r}}return Le(e)},j=(e=0)=>{let t=i.index,n=ze(),r={left:n.location.range?n:b(n,t),previous:void 0};for(;;){let n=x();if(n.kind!==`Operator`)break;let i=m(n);if(n.text===`'`&&e<=15){T(),a.last=lp,r.left=b({kind:`Prime`,expression:r.left,location:i},t);continue}if(fp.has(n.text)&&e<=15){T(),a.last=lp,r.left=b({kind:`Apply`,operator:n.text,args:[r.left],location:i},t);continue}if(n.text===`[`){T();let e=ge(()=>O(()=>j()));ge(()=>D(`]`)),a.last=up,r.left=b({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&ce(x(1))){T();let e=T().text;r.left=b({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let o=dp.get(n.text);if(!o||o.low<e)break;let s=r.previous;if(s){let e=!(s.low>o.high||s.high<o.low),t=s.text===n.text&&o.isAssociative;if(e&&!t&&(s.text!==`\\X`||n.text!==`\\X`))throw ae(`Precedence conflict between ${s.text} and ${n.text}`,n)}if(T(),o.low>12&&w(`-`))throw ae(`Precedence conflict between ${n.text} and -`,x());a.last=a.preceding=o;let c=j(o.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[y(t).end];r.left=l.kind===e&&s?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&s?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=b(r.left,t),r.previous={...o,text:n.text}}return r.left},Be=()=>{if(!E(`(`))return[];let e=Je();return D(`)`),e},Ve=()=>{let e=m(x()),t=j(),n=r[i.index-1],a={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:a}}},He=e=>{let t=i.index;return b(We(e),t)},Ue=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),We=e=>{let t=x(),n=m(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...Ve(),isLocal:e,isRecursive:f(t),location:n});if(t.kind===`Identifier`&&x(1).kind===`Operator`&&dp.has(x(1).text)&&x(2).kind===`Identifier`&&w(`==`,3)){let e=ue(),t=T().text,n=ue();return D(`==`),r(t,[Ue(e),Ue(n)])}let a=t.kind!==`String`&&mp.has(t.text),o=t.kind===`Identifier`&&fp.has(x(1).text)&&w(`==`,2);if(a||o){let e=a?t.text:x(1).text;a&&T();let n=ue();return o&&T(),D(`==`),r(e,[Ue(n)])}let s=le();if(E(`[`)){let t=ge(()=>Se());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:j(),isLocal:e,isRecursive:f(s),location:n}}let c=i.index,l=Be();return D(`==`),w(`INSTANCE`)?{...Ge(s,l,e,n),definitionRange:y(c)}:r(s,l)},Ge=(e,t,n,r)=>{let a=i.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:he(),substitutions:E(`WITH`)?O(()=>{let e=i.index,t=fe(),n=y(e);return D(`<-`),{name:t,nameRange:n,expression:Te()}}):[],isLocal:n,location:r,instanceRange:y(a)}},Ke=()=>{let e=i.index;return b(qe(),e)},qe=()=>{let e=m(x());if(w(`_`)&&x(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(x().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=le();if(!E(`(`))return{name:t,arity:0,location:e};let n=O(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},Je=()=>O(Ke),Ye=()=>{let e=Je();return e.forEach(e=>o[o.length-1].add(e.name)),e},Xe=e=>{let t={value:0,offset:e};do{let e=x(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&jp.has(e.text)&&t.value++,e.kind===`Operator`&&Mp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ze=()=>{let e=x(),t=x(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,Xe(1)):t.kind===`Operator`&&fp.has(t.text)?w(`==`,2):t.kind===`Operator`&&dp.has(t.text)?x(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):e.kind!==`String`&&mp.has(e.text)&&t.kind===`Identifier`&&w(`==`,2)},Qe=[],$e=()=>Qe[Qe.length-1]??-1,et=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),tt=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)},nt=e=>!e.text.endsWith(`.`)&&!Dp.has(tt(e)),rt=e=>{let t=tt(e);if(Dp.has(t))return;let n=et(e);if(n>=0)return`<${n}>${t}`;let r=$e(),i=Qe[Qe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},it=e=>{if(e.kind===`Keyword`)return wp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Qe.length===0;if(e.text[1]===`+`||Qe.length===0)return!0;let t=$e();return t>=0&&et(e)>t},M=e=>{let t=et(e),n=Qe.length-1,r=Qe[n-1]??-1,i=Qe[n]<0;return i&&(Qe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Qe[n]===t},at=e=>!s.has(e)&&d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),ot=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Np.has(e.name)&&!at(e.name):!1,st=()=>{let e=x();return e.kind===`Step`?nt(e):e.kind===`Keyword`?Op.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ze()},ct=()=>{let e=i.index;l.index=e;let t=x();return t.kind===`Operator`&&!hp.has(t.text)&&yp(t.text)?(i.index++,b({kind:`OperatorReference`,operator:t.text,location:m(t)},e)):E(`MODULE`)?b({kind:`ModuleFact`,name:le(),location:m(t)},e):j()},N=e=>c[c.length-1]?.add(e),P=e=>{c.push(/* @__PURE__ */ new Set);let t=e();return c.pop(),t},lt=e=>c.some(t=>t.has(e))||d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),F=()=>{let e=i.index,t=x(),n=O(()=>{let e=x();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw se(`Expected a definition name but found ${S(e)}`,e);return i.index++,e.text},`!`),r=m(t);return b(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},I=()=>{if(n)return O(F);let e=O(ct),r=t===`tlc`?e.find(e=>e.kind===`Identifier`&&lt(e.name)):void 0;if(r)throw ae(`DEF clause entry should describe a defined operator`,r.location);return e},ut=()=>({facts:st()?O(ct):[],defs:E(`DEF`)||E(`DEFS`)?I():[]}),dt=()=>{let e=i.index,n=T(),r=n.text===`USE`&&E(`ONLY`),a=y(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...ut(),keyword:a,location:m(n)},s=o.kind===`Hide`&&t===`tlc`?o.facts.filter(e=>!ot(e)):[];if(s.length>0)throw p(s.map(t=>({location:g(t.location.range??y(e)),message:`The only expression allowed as a fact in a HIDE is
467
- the name of a theorem, assumption, or step.`})));return b(o,e)},ft=()=>{let e=i.index,t=m(x()),n=E(`NEW`),r=x().kind===`Keyword`?kp.get(x().text):void 0;if(!n&&r===void 0)throw se(`Expected a declaration but found ${S(x())}`);if(r!==void 0&&T(),r===`Variable`){let n=ue();return N(n.name),b({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let a=Ke();N(a.name);let o=(r??`Constant`)===`Constant`&&w(`\\in`);if(o&&a.arity>0)throw ae(`declared symbol with arguments before \\in`);return o&&T(),b({kind:`NewSymbol`,name:a.name,arity:a.arity,level:r??`Constant`,set:o?j():void 0,nameRange:a.location.range,location:t},e)},pt=()=>{let e=i.index,t=m(D(`ASSUME`)),n=O(()=>w(`ASSUME`)?P(pt):x().kind===`Keyword`&&Ap.has(x().text)?ft():j());return D(`PROVE`),b({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)},mt=e=>{let t={value:0};for(;x(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return x(t.value).kind===`Identifier`&&w(e,t.value+1)},ht=(e,t)=>{e.forEach(N),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(N))},gt=()=>{let e=x();if(w(`USE`)||w(`HIDE`))return dt();if(w(`INSTANCE`)){let t=i.index;return b(Ge(void 0,[],!1,m(e)),t)}if(w(`DEFINE`)||Ze()){let t=i.index;E(`DEFINE`);let n=[He(!1)];for(;Ze();)n.push(He(!1));let r={kind:`Define`,definitions:n,location:m(e)};return b(r,t)}if(E(`HAVE`))return{kind:`Have`,expression:j()};if(E(`TAKE`)){let e=_e(),t=de(e?[]:O(ue)),n=e?Se():[];return ht(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:O(()=>j())};if(E(`PICK`)){let e=mt(`:`),t=de(e?O(ue):[]),n=e?[]:Se();return ht(t.names,n),D(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return E(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?pt():j()}},_t=e=>{let t=x();if(t.kind!==`Step`)throw se(`Expected a step number but found ${S(t)}`,t);if(!M(t))throw ae(`${e?`QED step`:`step`}'s number has bad level`,t);if(et(t)<0&&rt(t)!==void 0)throw ae(`<*> and <+> cannot be used for a named step`,t);return i.index++,{name:rt(t),token:t.text,location:m(t)}},vt=()=>{let e=i.index,t=_t(w(`QED`,1)),n=i.index,r=/* @__PURE__ */ new Set;c.push(r);let a=E(`QED`)?{kind:`Qed`}:gt(),o=y(e),s=y(n),l=it(x());if(l&&!Tp.has(a.kind))throw ae(`Proof of a step that does not take a proof`);let u=l?bt():void 0;return c.pop(),(a.kind!==`Assert`||a.isSuffices)&&r.forEach(N),b({...t,body:a,head:o,statement:s,proof:u},e)},yt=()=>{let e=m(x());if(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=y(i.index-1);return{kind:`By`,isOnly:E(`ONLY`),...ut(),keyword:t,location:e}}let t=x(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=y(i.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`PROOF`);let n=[vt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(vt());return{kind:`Steps`,level:$e(),steps:n,location:e}},bt=()=>{let e=i.index;Qe.push(-1);let t=P(yt);return Qe.pop(),b(t,e)},xt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},St=e=>{let t=i.index,n=T(),r=x().kind===`Identifier`&&w(`==`,1)?le():void 0;r!==void 0&&(s.add(r),T());let a=P(()=>({statement:w(`ASSUME`)?pt():j(),proof:it(x())?bt():void 0})),o=a.statement,c=b({name:r,statement:o,proof:a.proof,location:m(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&o.kind!==`AssumeProve`&&xt(e,b({kind:`Operator`,name:r,params:[],body:o,isLocal:!1,isRecursive:!1,location:m(n)},t))},Ct=()=>{let e=i.index;return b(wt(),e)},wt=()=>{let e=T(),t=m(e),n=e.text===`AXIOM`;if(x().kind===`Identifier`&&w(`==`,1)){let e=le();return s.add(e),T(),{name:e,expression:j(),isAxiom:n,location:t}}return{name:void 0,expression:j(),isAxiom:n,location:t}},Tt=()=>{let e=m(D(`----`));D(`MODULE`);let t=he();D(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),o.push(/* @__PURE__ */ new Set),E(`EXTENDS`)&&O(()=>{let e=i.index;n.extends.push(he()),n.extendsRanges.push(y(e))});;){let t=i.index;C.index=t;let r=x();if(r.kind===`ModuleEnd`){if(e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},A.size>0)throw p([...A.values()]);return d.pop(),o.pop(),n}if(r.kind===`Separator`){if(w(`MODULE`,1)){let e=Tt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=m(T()),r=Je();n.constants.push(...r),e.range=y(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=m(T()),r=O(()=>{let e=i.index,t=m(x());return b({name:le(),arity:0,location:t},e)});n.variables.push(...r),e.range=y(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Ct();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&xt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(w(`USE`)&&w(`ONLY`,1))throw se(`Expected a module unit but found ${S(r)}`);let e=dt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:Ye()});continue;case`INSTANCE`:Et(n,b(Ge(void 0,[],!1,m(r)),t));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){Et(n,b(Ge(void 0,[],!0,m(r)),t));continue}Et(n,b(We(!0),t));continue}r.kind===`Keyword`&&Cp.has(r.text)?St(n):Et(n,He(!1))}}},Et=(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}))},Dt=Tt(),Ot=me.isUsed?cp(e):void 0;if(Ot!==void 0)throw new u(Ot);return Dt},Ip=e=>Fp(e,`tlc`),Lp=e=>Fp(e,`tlapm`),Rp=e=>Fp(e,`sany`),zp=25214903917n,Bp=(1n<<48n)-1n,Vp=2147483647,Hp=e=>{let t={value:(BigInt.asUintN(64,e)^zp)&Bp},n=e=>(t.value=t.value*zp+11n&Bp,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^zp)&Bp},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<=Vp)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Up=10454148508367108822n,Wp=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Up);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Gp=Int32Array.from(Wp,e=>Number(BigInt.asIntN(32,e>>32n))),Kp=Int32Array.from(Wp,e=>Number(BigInt.asIntN(32,e))),qp=Number(BigInt.asIntN(32,Up>>32n)),Jp=Number(BigInt.asIntN(32,Up));let Yp=qp,Xp=Jp;const Zp=e=>{let t=(e^Xp)&255;Xp=(Xp>>>8|Yp<<24)^Kp[t],Yp=Yp>>>8^Gp[t]},Qp=e=>{for(let t=0;t<32;t+=8)Zp(e>>>t)},$p=e=>{if(typeof e==`boolean`)Zp(0),Zp(e?116:102);else if(typeof e==`number`)Zp(1),Qp(e);else if(typeof e==`string`){Zp(3),Qp(e.length);for(let t=0;t<e.length;t++)Zp(e.charCodeAt(t))}else if(I(e))Zp(21),Qp(kt(e.name)+1);else if(F(e)){let t=Dr(e);Zp(9),Qp(t.domain.length);for(let e=0;e<t.domain.length;e++)$p(t.domain[e]),$p(t.range[e])}else{let t=R(e).elements;Zp(5),Qp(t.length);for(let e of t)$p(e)}},em=e=>{let t={high:Yp,low:Xp};Yp=qp,Xp=Jp;for(let t of e)$p(t);let n=BigInt(Yp>>>0)<<32n|BigInt(Xp>>>0);return Yp=t.high,Xp=t.low,n},tm=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=Dr(e);return t.domain.reduce((e,n,r)=>e+tm(n)+tm(t.range[r]),5)}return R(e).elements.reduce((e,t)=>e+tm(t),5)},nm=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Yp=n<32?0:1<<n-32,Xp=n<32?1<<n:0;for(let t=0;t<e;t++)Zp(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]^Yp,t[n+1]=t[a+1]^Xp}}return t},rm=(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=tm(e);return Yp=0,Xp=0,$p(e),r.set(e,i.length),i.push(n,Yp,Xp),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=nm(e);return n.set(e,r),r};return(n,r)=>{let s={high:Yp,low:Xp},c={high:qp,low:Jp};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}Yp=s.high,Xp=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},im=[],am=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},om=()=>{for(let e=1277011;im.length<1341;e++)am(e)&&im.push(e);return im},sm=e=>{let t=om(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},cm=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},lm=e=>{for(let t=Math.max(e,9);;t++){let e=cm(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)}}},um=(e,t,n)=>{if(t<=0)return[];let r=lm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(sm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},dm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Vp),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},fm=(1n<<63n)-1n-24n,pm=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(fm*BigInt(n)+i)%t;return r<0n?r+t:r})},mm=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,hm=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=qn(e.domain),n=R(e.range).elements;return{lists:t.map(()=>n),create:e=>Bt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>R(e).elements),create:t=>Xn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>R(e).elements),create:Yn}}},gm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,_m=(e,t,n,r)=>{if(pr(t))return[];let i=r===`1.7.4`?dm:um;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=gm(t,r)?void 0:hm(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Vp)?pm(e,t,n):i(e,Number(t),n)).map(e=>a.create(mm(a.lists,e)))}let o=R(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},vm=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new y(`RandomElement of the empty set`);return n},ym=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...qn(e.domain)];return Bt(n,n.map(()=>ym(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Xn(e.names.map((n,r)=>[n,ym(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Yn(e.factors.map(e=>ym(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 y(`RandomElement of the empty set`);return e.low+r}return vm(R(e).elements,t)},bm=(e,t=0n)=>{let n=Hp(t),r={random:Hp(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Xn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:em,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:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},xm=e=>zn([...e.possibleCounts].map(([e,t])=>[e,t])),Sm=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,xm(e)]]),Cm=(e,t,n)=>new C(`Applying ${e} to the following value,\nwhich is not ${t}:\n${z(n)}`),wm=(e,t,n,r)=>new C(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${z(r)}`),Tm=e=>F(e)?Dr(e):void 0,Em=(e,t,n)=>{let r=V(e,t,n),i=Tm(r);if(!i)throw Cm(n,`a function with a finite domain`,r);return i},Dm=(e,t,n)=>{let r=V(e,t,n),i=Tm(r);if(!i)throw wm(t===0?`first`:`second`,n,`bag`,r);return i},Om=(e,t)=>{if(!P(e)||!L(e))throw t();return R(e).elements},km=e=>e.range.every(e=>typeof e==`number`&&e>0),Am=(e,t)=>{let n=e.domain.findIndex(e=>Qt(e,t));return n===-1?void 0:e.range[n]},jm=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Mm=jm(`BagDiff`,`tlc2.value.impl.Value`,2),Nm=jm(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Pm=jm(`BagUnion`,`tlc2.value.impl.Value`,1),Fm=jm(`BagOfAll`,`tlc2.value.impl.Value`,2),Im=jm(`BagCup`,`tlc2.value.impl.Value`,2),Lm=jm(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Rm=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Ri(e)}`;throw Bi(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')`)},zm=(e,t,n)=>{let r=Rm(e,n)+Rm(t,n);if(Mi(r))throw Ni(`${e}+${t}`);return r},Bm=(e,t,n,r)=>{let i=Am(n,e.domain[t]),a=Rm(e.range[t],r);return i===void 0?a:a-Rm(i,r)|0},Vm=(e,t)=>zn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Qt(e[0],r));a?a[1]=zm(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Hm=Bt([],[]),Um=e=>[Oi(`EmptyBag`,Hm),H(`IsABag`,1,e=>{let t=Tm(V(e,0,`IsABag`));return t!==void 0&&km(t)}),H(`BagCardinality`,1,e=>{let t=V(e,0,`BagCardinality`);return Em(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Cm(`BagCardinality`,`a bag`,t);return zm(e,n,Lm)},0)}),H(`BagIn`,2,e=>{let t=V(e,1,`BagIn`),n=Am(Em(e,1,`BagIn`),V(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw wm(`second`,`BagIn`,`bag`,t);return n>0}),H(`CopiesIn`,2,e=>{let t=V(e,1,`CopiesIn`),n=Am(Em(e,1,`CopiesIn`),V(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw wm(`second`,`CopiesIn`,`bag`,t);return n}),H(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Dm(e,t,`(+)`);if(!km(n))throw wm(t===0?`first`:`second`,`(+)`,`bag`,V(e,t,`(+)`));return n});return Vm(t,Im)}),H(`\\ominus`,2,e=>{let t=Dm(e,0,`(-)`),n=Dm(e,1,`(-)`);return zn(t.domain.flatMap((e,r)=>{let i=Bm(t,r,n,Mm);return i>0?[[e,i]]:[]}))}),H(`BagUnion`,1,e=>{let t=V(e,0,`BagUnion`),n=Om(t,()=>Cm(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??Hm;let r=n.map(e=>{let n=Tm(e);if(!n)throw new C(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${z(t)}`);return n});return Vm(r,Pm)}),H(`\\sqsubseteq`,2,e=>{let t=Em(e,0,`\\sqsubseteq`),n=Em(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Bm(t,r,n,Nm)<=0)}),ki(`BagOfAll`,2,e=>{let t=Di(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new C(`The first argument of BagOfAll should be an operator, but instead it is:\n${z(t.literalBody)}`);let n=V(e,1,`BagOfAll`),r=Tm(n);if(!r)throw wm(`second`,`BagOfAll`,`function with a finite domain`,n);return Vm(r.domain.map((e,n)=>Bt([t.call([e])],[r.range[n]])),Fm)}),H(`SubBag`,1,t=>{let n=V(t,0,`SubBag`);if(!F(n))throw new y(`DOMAIN expects a function but received ${z(n)}`);let r=Dr(n),i=Nn(r.range).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new y(`Attempted to apply a function to ${z(r)}, which is not in its domain`);return Nn(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Bt(e.map(e=>e[0]),e.map(e=>e[1]))))}),H(`BagToSet`,1,e=>Fr(Em(e,0,`BagToSet`))),H(`SetToBag`,1,e=>{let t=V(e,0,`SetToBag`),n=Om(t,()=>Cm(`BagToSet`,`a function with a finite domain`,t));return Bt([...n],n.map(()=>1))})],Wm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Gm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Km=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,qm=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Jm=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Ym=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Xm=e=>{if(!F(e))return!1;let t=Dr(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Zm=(e,t)=>Bi(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Ri(t)}`),Qm=(e,t)=>Bi(e,`Cannot cast tlc2.value.impl.${Ri(t)} to tlc2.value.impl.StringValue`),$m=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),eh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Zm(t,e);return`[${R(e).elements.map(e=>nh(e,t)).join(`,`)}]`},th=(e,t)=>{let n=Dr(e),r=br(n);return r?`[${r.map(e=>nh(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${$m(typeof e==`string`?e:z(e))}:${nh(n.range[r],t)}`).join(`,`)}}`},nh=(e,t)=>typeof e==`string`?$m(e):typeof e==`object`?e.kind===`ModelValue`?$m(e.name):P(e)?eh(e,t):th(e,t):String(e),rh=e=>{if(P(e))return eh(e,Wm);if(!F(e)||Xm(e))throw Zm(Wm,e);return th(e,Wm)},ih=e=>{if(!F(e))throw Zm(Gm,e);return th(e,Gm)},ah=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))},oh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Dt(e);if(Array.isArray(e))return Yn(e.map(e=>oh(e,t)));if(typeof e==`object`&&e)return Xn(Object.entries(e).map(([e,n])=>[Dt(e),oh(n,t)]));throw Bi(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},sh=(e,t)=>{if(e.trim()===``)return oh(null,t);try{return oh(JSON.parse(e,(e,t,n)=>typeof t==`number`?ah(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Bi(t,e.message):e}},ch=(e,t)=>{if(typeof e!=`string`)throw Qm(t,e);return e},lh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Bi(n,`${t} (No such file or directory)`);return r},uh=e=>[Ai(`ToJson`,1,e=>Dt(nh(V(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Ai(`ToJsonArray`,1,e=>Dt(rh(V(e,0,`ToJsonArray`)))),Ai(`ToJsonObject`,1,e=>Dt(ih(V(e,0,`ToJsonObject`)))),Ai(`JsonSerialize`,2,t=>{let n=ch(V(t,0,`JsonSerialize`),Km),r=V(t,1,`JsonSerialize`);if(!br(r)&&!Xm(r))throw new C(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${z(r)}`);return e.writeFile?.(n,nh(r,Km)),!0}),Ai(`ndJsonSerialize`,2,t=>{let n=ch(V(t,0,`ndJsonSerialize`),qm),r=V(t,1,`ndJsonSerialize`),i=br(r);if(!i)throw new C(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${z(r)}`);return e.writeFile?.(n,i.map(e=>`${nh(e,qm)}\n`).join(``)),!0}),Ai(`JsonDeserialize`,1,t=>{let n=ch(V(t,0,`JsonDeserialize`),Jm);return sh(lh(e,n,Jm),Jm)}),Ai(`ndJsonDeserialize`,1,t=>{let n=ch(V(t,0,`ndJsonDeserialize`),Ym);return Yn(lh(e,n,Ym).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>sh(e,Ym)))})],dh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,fh=1e6,ph=(e,t,n,r)=>new C(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),mh=(e,t,n)=>{if(typeof e!=`number`||e<0)throw ph(t,n,`nonnegative integer`,z(e));return e},hh=(e,t,n,r)=>{if(!P(e)||!L(e))throw ph(t,n,r,z(e));return R(e).elements},gh=(e,t,n,r)=>Nn(Array.from({length:t},()=>Nn(e.filter(()=>r.nextDouble()<n)))),_h=(e,t)=>{let n=`RandomSetOfSubsets`,r=mh(V(e,0,n),`first`,n),i=mh(V(e,1,n),`second`,n),a=hh(V(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw ph(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw ph(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return gh(a,r,a.length===0?0:i/a.length,t.getRandom())},vh=e=>[Ai(`RandomSubset`,2,t=>{let n=V(t,0,`RandomSubset`);if(typeof n!=`number`)throw ph(`first`,`RandomSubset`,`nonnegative integer`,z(n));if(n<0)throw Bi(dh,String(n));let r=V(t,1,`RandomSubset`);if(!P(r)||!pr(r)&&!L(r))throw ph(`second`,`RandomSubset`,`a finite set`,z(r));let i=gm(r,e.version);if(i&&i.reduce((e,t)=>e*R(t).elements.length,1)>fh)throw Bi(dh,`Attempted to construct a set with too many elements (>${fh}).`);return Nn(_m(n,r,e.getRandom(),e.version))}),Ai(`RandomSetOfSubsets`,3,t=>_h(t,e)),Ai(`TestRandomSetOfSubsets`,3,t=>Yn(Array.from({length:5},()=>R(_h(t,e)).elements.length)))],yh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,bh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${yh})`,xh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${yh}) throws java.io.IOException`,Sh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${yh})`,Ch=()=>Xn([[`action`,Nn([])],[`state`,Nn([])]]),wh=()=>Xn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Th=e=>Xn([[`name`,e??`UnnamedAction`],[`location`,wh()]]),Eh=(e,t,n)=>{let r=e.map((e,t)=>Yn([t+1,Xn(Object.entries(e))])),i=r.slice(1).map((e,n)=>Yn([r[n],t[n],e])),a=n?[Yn([r[r.length-1],n.action,r[n.start]])]:[];return Xn([[`action`,Nn([...i,...a])],[`state`,Nn(r)]])},Dh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Sm(e).get(t)},Oh=(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),z(r));else throw new C(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${z(n)}`)},kh=e=>e.every(e=>e!==void 0),Ah=(e,t)=>Xn(t.variables.map((t,n)=>[t,e[n]])),jh=(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&&!B(e)){if(t.variableIndex.has(r))return!0;let e=dl(r,t);if(e&&!n.has(e)&&(n.add(e),jh(e.body,t,n)))return!0}return hi(e).some(e=>jh(e,t,n))},Mh=(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[H(`AssertEq`,2,t=>{let n=V(t,0,`AssertEq`),r=V(t,1,`AssertEq`),i=Qt(n,r);return i||(e(z(`Assertion failed`,!0)),e(z(n,!0)),e(z(r,!0))),i}),qi(`AssertError`,2,e=>{let n=Di(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Bi(bh,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=Ji(e,0,`AssertError`)();try{Ji(e,1,`AssertError`)()}catch(e){if(e instanceof y)return ba(e.message,t.isTool)===r;throw e}return!1}),Ai(`TLCGetOrDefault`,2,e=>{let n=V(e,0,`TLCGetOrDefault`);return Dh(t,n)??V(e,1,`TLCGetOrDefault`)}),{...ki(`TLCGetAndSet`,4,n=>{let r=V(n,0,`TLCGetAndSet`),i=Dh(t,r)??V(n,3,`TLCGetAndSet`),a=Di(n,1,`TLCGetAndSet`);return Oh(t,e,r,a.call([i,V(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Ai(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!kh(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Bi(xh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Yn(t.getBehavior(r).map(e=>Ah(e,n.environment)))}),Ai(`CounterExample`,0,()=>t.counterExample??Ch()),H(`ToTrace`,1,e=>{let t=V(e,0,`ToTrace`);if(!F(t)||!Qt(Fr(t),Nn([`action`,`state`])))throw new y(`The argument of ToTrace should be a CounterExample, but instead it is:\n${z(t)}`);let n=R(Nr(t,`state`)).elements.map(e=>br(e)??[]);return Yn(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),H(`TLCModelValue`,1,e=>{let t=V(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new C(`The argument of ModelValue should be a string, but instead it is:\n${z(t)}`);return Rt(t)}),qi(`TLCDefer`,1,()=>!0),H(`TLCNoOp`,1,e=>V(e,0,`TLCNoOp`)),qi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!kh(r))throw Bi(Sh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||ul(Ji(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new ie(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),qi(`TLCCache`,2,(e,t)=>{let r=Di(e,0,`TLCCache`),a=ri(Ji(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=jh(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}),H(`TLCFP`,1,e=>Number(BigInt.asIntN(32,em([V(e,0,`TLCFP`)])))),Ai(`TLCEvalDefinition`,1,(e,t)=>{let n=V(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?dl(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new C(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${z(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new C(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return W({kind:`Identifier`,name:n,location:r.location},t)})]},Nh=(e,t)=>[Ai(`_Track`,2,e=>{let n=String(V(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,V(e,0,`_Track`)===!0?r+1:r),!0}),Ai(`_Counts`,0,()=>xm(t)),Ai(`_CheckName`,1,n=>{let r=String(V(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(z(xm(t),!0)),!1)}),Ai(`_PrintCounts`,0,()=>(e(z(xm(t),!0)),!0))],Ph=e=>String(e).padStart(2,`0`),Fh=e=>`${e.getUTCFullYear()}.${Ph(e.getUTCMonth()+1)}.${Ph(e.getUTCDate())}.${Ph(e.getUTCHours())}${Ph(e.getUTCMinutes())}${Ph(e.getUTCSeconds())}`,Ih=e=>zn([...e].map(([e,t])=>[e,Yn([t])])),Lh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Rh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),zh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Bh=(e,t,n)=>{if(e.version===`1.7.4`?!Rh.has(t)||!e.isStarted&&zh.has(t):!e.isStarted&&Lh.has(t))throw new C(`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 Xn([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Xn([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Xn([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Dt(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Dt(Fh(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Th(void 0);case`all`:return Ih(e.registers);case`all:named`:return Ih(Sm(e))}if(t.startsWith(`s:`)){let n=Sm(e).get(t);if(n===void 0)throw new C(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Dt(e.properties.get(t.slice(2))??t);throw new C(`TLCGet(${t}) was undefined.`)},Vh=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new C(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new C(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${z(t)}`);return Bh(e,t,n?.state)},Hh=e=>e.length===0?[[]]:e.flatMap((t,n)=>Hh([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Uh=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&R(e).elements.forEach(Uh),e.kind===`Function`&&e.range.forEach(Uh))},Wh=(t,n)=>[H(`Print`,2,e=>(t(`${N(z(V(e,0,`Print`),!0,!0))} ${N(z(V(e,1,`Print`),!0,!0))}`),V(e,1,`Print`))),H(`PrintT`,1,e=>(t(N(z(V(e,0,`PrintT`),!0,!0))),!0)),H(`Assert`,2,t=>{if(V(t,0,`Assert`)!==!0)throw new C(`The first argument of Assert evaluated to FALSE; the second argument was:\n${N(z(V(t,1,`Assert`)))}`,e.assertViolation);return!0}),H(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),H(`:>`,2,e=>zn([[V(e,0,`:>`),V(e,1,`:>`)]])),H(`@@`,2,e=>{let t=Ei(e,0,`@@`),n=Ei(e,1,`@@`);return Bn([...mt(t),...mt(n)])}),H(`ToString`,1,e=>Dt(z(V(e,0,`ToString`),!0))),H(`TLCEval`,1,e=>{let t=V(e,0,`TLCEval`);return Uh(t),t}),H(`Permutations`,1,e=>{let t=wi(e,0,`Permutations`);return Nn(Hh(t).map(e=>zn(t.map((t,n)=>[t,e[n]]))))}),ki(`SortSeq`,2,e=>{let t=Di(e,1,`SortSeq`);return Yn(Ti(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),n.version===`1.7.4`?Vi({...Ai(`TLCGet`,1,(e,t)=>Vh(n,V(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Vi(qi(`TLCGet`,1,(e,t)=>Vh(n,Ji(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Ai(`TLCSet`,2,e=>{let r=V(e,0,`TLCSet`);return Oh(n,t,r,V(e,1,`TLCSet`)),!0}),Oi(`Any`,Pt),H(`RandomElement`,1,e=>ym(Si(e,0,`RandomElement`),n.getRandom()))],Gh=(e,t)=>e.every(e=>wr(e,t)),Kh=Nn([!1,!0]),qh=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Rn(qh(e,t,r),qh(e,r,n))},Jh=[`\\cup`,`\\cap`,`\\`],Yh=e=>typeof e==`object`&&e.kind===`MixedSet`,Xh=e=>e.kind===`Interval`?R(e).elements:e.elements,Zh=(e,t,n)=>{let r=Xh(t);if(e!==`\\cup`){let t=e===`\\cap`;return Pn(r.filter(e=>wr(e,n)===t))}if(r.length===0)return n;if(!lt(n))return Jt({kind:`SetOperation`,operator:e,left:t,right:n});let i=R(n).elements.filter(e=>!wr(e,t));return Pn([...r,...i])},Qh=[Oi(`TRUE`,!0),Oi(`FALSE`,!1),Oi(`BOOLEAN`,Kh),Oi(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ji(`=`,jn),ji(`#`,(e,t)=>!jn(e,t)),H(`~`,1,e=>!bi(e,0,`~`)),H(`<=>`,2,e=>bi(e,0,`<=>`)===bi(e,1,`<=>`)),H(`/\\`,2,e=>bi(e,0,`/\\`)&&bi(e,1,`/\\`)),H(`\\/`,2,e=>bi(e,0,`\\/`)||bi(e,1,`\\/`)),H(`=>`,2,e=>!bi(e,0,`=>`)||bi(e,1,`=>`)),H(`\\in`,2,e=>wr(V(e,0,`\\in`),V(e,1,`\\in`))),H(`\\notin`,2,e=>!wr(V(e,0,`\\notin`),V(e,1,`\\notin`))),H(`\\subseteq`,2,e=>{let t=xi(e,0,`\\subseteq`),n=V(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&L(t.base)?Gh(R(t.base).elements,n.base):Gh(R(t).elements,n)}),...Jh.map(e=>H(e,2,t=>{let n=V(t,0,e),r=V(t,1,e);if(lt(n)&&lt(r)&&!Yh(n)&&!Yh(r)){if(e===`\\cup`&&pr(n))return r;let t=e===`\\cup`?Rn:e===`\\cap`?Ln:In;return Cr(()=>t(R(n),R(r)),()=>Zh(e,n,r))}return lt(n)?Zh(e,n,r):e!==`\\`&&lt(r)?Zh(e,r,n):Jt({kind:`SetOperation`,operator:e,left:n,right:r})})),H(`SUBSET`,1,e=>({kind:`Subset`,base:V(e,0,`SUBSET`)})),H(`UNION`,1,e=>{let t=xi(e,0,`UNION`),n=hn(t)?t.elements.filter(hn):[];if(!hn(t)||n.length!==t.elements.length)return Jt({kind:`Union`,base:t});if(Yh(t)||n.some(Yh)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{wr(t,e)||e.elements.push(t)})),Pn(e.elements)}return n.length===0?Fn:qh(n.map(R),0,n.length)}),H(`DOMAIN`,1,e=>{let t=V(e,0,`DOMAIN`);if(!F(t))throw new y(`DOMAIN expects a function but received ${z(t)}`);return Fr(t)})],$h=Ui(`Integers`,`Neg`,`IntValue`,1),eg=e=>{let t=Ui(e,`DotDot`,`IntervalValue`,2);return[Wi(e,`+`,`Plus`,(e,t)=>e+t),Wi(e,`-`,`Minus`,(e,t)=>e-t),Wi(e,`*`,`Times`,(e,t)=>e*t),Wi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new C(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new C(`0^0 is undefined.`);return e**t}),Wi(e,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new C(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/n)|0;return e<0&&Math.imul(e,n)!==t?e-1:e}let r=Math.floor(t/n);if(Mi(r))throw Ni(`${t} \\div ${n}`);return r}),Wi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new C(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),H(`..`,2,e=>({kind:`Interval`,low:Hi(V(e,0,`..`),t),high:Hi(V(e,1,`..`),t)}))]},tg=eg(`Naturals`),ng=eg(`Integers`),rg=e=>{let t=tg.indexOf(e);return t===-1?void 0:ng[t]},ig=[Oi(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...tg,Ki(`<`,(e,t)=>e<t),Ki(`>`,(e,t)=>e>t),Ki(`<=`,(e,t)=>e<=t),Ki(`>=`,(e,t)=>e>=t,`>`)],ag=[Oi(`Int`,{kind:`InfiniteSet`,name:`Int`}),...ng,Ki(`>=`,(e,t)=>e>=t),H(`-.`,1,e=>{let t=Hi(V(e,0,`-`),$h);if(Mi(-t))throw Ni(`-${t}`);return-t})],og=(e,t,n)=>{let r=V(e,t,n),i=br(r);if(!i)throw new C(`${n}\n${z(r)}`);return i},sg=(e,t,n)=>{let r=V(e,t,n);return typeof r==`string`?r:og(e,t,n)},cg=(e,t,n)=>typeof e==`string`?Dt(e.slice(t,n)):Yn(e.slice(t,n)),lg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,ug=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,dg=(e,t)=>{let n=Bd.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Vi(e,t):e}):t},fg=e=>dg(`Sequences`,[H(`Seq`,1,e=>({kind:`SequenceSet`,base:V(e,0,`Seq`)})),H(`Len`,1,e=>sg(e,0,lg(``,`Len`)).length),H(`\\o`,2,e=>{let t=sg(e,0,ug(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=og(e,1,ug(`t \\o s`,`sequence`));return Yn([...t,...n])}let n=V(e,1,`\\o`);if(typeof n!=`string`)throw new C(`${ug(`t \\o s`,`string`)}\n${z(n)}`);return Dt(t+n)}),H(`Append`,2,t=>Yn([...og(t,0,ug(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),V(t,1,`Append`)])),H(`Head`,1,e=>{let t=og(e,0,lg(``,`Head`));if(t.length===0)throw new C(`Attempted to apply Head to the empty sequence.`);return t[0]}),H(`Tail`,1,e=>{let t=sg(e,0,lg(``,`Tail`));if(t.length===0)throw new C(`Attempted to apply Tail to the empty sequence.`);return cg(t,1)}),H(`SubSeq`,3,e=>{let t=sg(e,0,lg(`first `,`SubSeq`)),n=yi(e,1,`SubSeq`),r=yi(e,2,`SubSeq`);if(n>r)return cg(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new C(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${z(V(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return cg(t,n-1,r)}),ki(`SelectSeq`,2,e=>{let t=Di(e,1,`SelectSeq`);return Yn(og(e,0,lg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new C(`The second argument of SelectSeq should be a operator, but instead it is:\n${z(n)}`);return n}))})]),pg=e=>dg(`FiniteSets`,[H(`IsFiniteSet`,1,e=>{let t=V(e,0,`IsFiniteSet`);if(P(t))return vr(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new y(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${z(t)}\nis a finite set.`:`Attempted to check if the ${ut(t)} ${z(t)} is a finite set.`)}),H(`Cardinality`,1,t=>{let n=V(t,0,`Cardinality`);if(!P(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new C(`Attempted to compute cardinality of the value\n${z(n)}`);return gr(n,e)})]),mg=/* @__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`]]]),hg=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:ig};case`Integers`:return{extends:[`Naturals`],operators:ag};case`Sequences`:return{extends:[],operators:fg(n.version)};case`FiniteSets`:return{extends:[],operators:pg(n.version)};case`TLC`:return{extends:[],operators:dg(`TLC`,Wh(t,n))};case`Randomization`:return{extends:[],operators:vh(n)};case`_Possible`:return{extends:[],operators:Nh(t,n)};case`Json`:return{extends:[],operators:uh(r)};case`Bags`:return{extends:[],operators:Um(i)};case`TLCExt`:return{extends:[],operators:Mh(t,n)};default:return}},gg=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}])),_g={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},vg=(e,t)=>{let n=_g[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},yg=`$subexpression`,bg=(e,t)=>new u(`${e} at line ${t.line}, column ${t.column}`),xg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return xg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of hi(e)){let e=xg(r,t,n);if(e)return e}},Sg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Cg=(e,t)=>{let n=e.location,r=Sg(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 bg(`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 bg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:yg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:yg,args:e.args,location:n,resolution:wa},location:n}},wg=(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:wa})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:wa}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:wa};return Cg({...t,params:[...t.params,...r]},a)},Tg=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw bg(r,i);Ea.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:g(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw bg(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>Go(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw bg(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=ja(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw bg(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&xg(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw bg(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||Za(t.operand,1)!==0)throw bg(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=to(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[Za(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw bg(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=Za(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw bg(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw bg(`Unexpected subexpression selector`,i);let s=r?r.sets:no(n),c=s?.[Za(t.operand,s.length)];if(!c)throw bg(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return wg(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw bg(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return wg(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw bg(`Subexpression selection failed`,i);return Cg(a,o.current)},Eg=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return Qa(e,t,n)},Dg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||hi(e).some(Dg),Og=(e,t,n,r=!1)=>{if(!Dg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Jo(e,e=>Og(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>kg(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>Og(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Jo(e,e=>Og(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Eg(a.name,[],void 0,t):a.kind===`Apply`?Eg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Tg(o,t,a,r);return c!==a&&Ta.add(c),c},kg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Og(e.expression,t,n,!0)}))}),Ag=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},jg=(e,t)=>kg(e,Ag(t.definitions),()=>!1),Mg=(e,t)=>{let n=Ag([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>Og(e,n,i),o=e=>i(e)||!n(e),s=e=>Og(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return kg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?kg(e,n,o):qo(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>Dg(e.body))||e.assumptions.some(e=>Dg(e.expression))?{...p,definitions:e.definitions.map(e=>qo(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Ng=(e,t)=>`${e}${t}`,Pg=(e,t,n)=>`${e}${t}${n}`,Fg=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Ig=(e,t,n)=>`${e},${t},${n}`,Lg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Rg=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),zg=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Bg=(e,t,n,r)=>({...Lg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Vg=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Hg=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Ug=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,{...Bg(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Wg=Bg(`$Set`,0,[2],[1]),Gg=Bg(`$Junction`,0,[3],[1]),Kg=Bg(`$Choose`,0,[2],[1]),qg=Bg(`$Function`,0,[3],[1]),Jg=Bg(`$FcnApply`,0,[2,2],[1,1]),Yg=Bg(`$RcdSelect`,0,[2,0],[1,1]),Xg=Bg(`'`,2,[1],[0]),Zg=Bg(`ENABLED`,1,[2],[0]),Qg=Bg(`[]`,3,[3],[0]),$g=Bg(`$SquareAct`,2,[2,1],[0,0]),e_=Bg(`$WF`,3,[1,2],[0,0]),t_=Bg(`$TemporalExists`,3,[3],[0]),n_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),r_=e=>e.map(e=>({name:e,arity:0})),i_=(e,t)=>t.location.range?_(`${e}.`,t.location.range):new u(`${e} at line ${t.location.line}, column ${t.location.column}`),a_=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),o_=e=>e.kind!==`Let`&&e.kind!==`Label`,s_=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=v(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Ug.get(t)??gg.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Lg(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(Pg(e,n,t))}),t.data.constraints.forEach((e,t)=>Rg(r.constraints,t,e)),zg(r.argConstraints,Ng(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>zg(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>Vg(e,n))throw new u(`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 u(`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(Ig(t,n,r)),s=Lg(Math.max(e.level,...t.filter((t,n)=>Hg(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)=>{Hg(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)=>Rg(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Rg(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Rg(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Rg(s.constraints,t,Vg(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=>Rg(s.constraints,e,Vg(r,a)))}))}),e.argParams.forEach(e=>{let t=Fg(e),n=a(t.operator)?.operator;n&&Rg(s.constraints,t.param,Vg(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>zg(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>zg(s.argConstraints,Ng(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&zg(s.argConstraints,Ng(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Fg(e),n=a(t.operator);n&&zg(s.argConstraints,Ng(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Fg(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Fg(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(Pg(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(Pg(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(Pg(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,r_(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=Lg();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=n_(n,r_(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 i_(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw i_(`Action used where only temporal formula or state predicate allowed`,e);a_.has(e.operator)&&l(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&o_(n)&&n.kind!==r)throw i_(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=v(e,n);t.constraints.forEach((e,t)=>Rg(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>zg(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 u)||t.sany?t:i_(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Lg();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(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(Gg,n)}case`Prime`:case`Unchanged`:return s(Xg,[e.expression],t);case`Enabled`:return s(Zg,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(Qg,[n])}case`If`:return s(Gg,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Gg,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=s(Gg,[e.body],t,e.bounds.map(e=>e.set),Ua(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw i_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?t_:Gg,[e.body],t,[],e.names);case`Choose`:return s(Kg,[e.body],t,e.set?[e.set]:[],Ha(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(Wg,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(Wg,[e.predicate],t,[e.bound.set],Ha(e.bound.pattern));case`SetMap`:return s(Wg,[e.expression],t,e.bounds.map(e=>e.set),Ua(e.bounds));case`FunctionConstruction`:return s(qg,[e.body],t,e.bounds.map(e=>e.set),Ua(e.bounds));case`Record`:return s(qg,e.fields.map(e=>e.value),t);case`RecordSet`:return s(Wg,e.fields.map(e=>e.value),t);case`Except`:return s(Wg,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Jg,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(Wg,e.args,t)}]);case`Bracket`:return Lg();case`FieldAccess`:return i(Yg,[a(e.record,t),{data:Lg()}]);case`BoxAction`:case`AngleAction`:return s($g,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(e_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Lg()}},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 hi(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,n_(t,r_(e.names))),i;default:return Jo(e,(e,n)=>(a(e,r,n_(t,r_(n))),e)),i}},_=(e,t,n,r)=>{let i=n_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Lg(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(Ng(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(Pg(e.name,n,t.name))).map(e=>Ig(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(Fg(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Fg(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,{...Lg(),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}},c_=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?c_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Lg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Rg(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>zg(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},l_=(e,t,n,r)=>{let i=s_(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?c_(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:g(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=Ro([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?c_(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw p(n)}})),...n],r);if(l.length>0)throw p(l,!1,void 0,r)},u_=(e,t)=>e.maxLevels[t]??3,d_=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=s_({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Rg(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Rg(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>zg(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Fg(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&Rg(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(c_(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=g(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(Ng(e.name,i));a!==void 0&&u_(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=Fg(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=u_(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw p([...r.values()])}},f_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],p_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),m_=new Map(Fd.flatMap(e=>e.map(t=>[t,e[0]]))),h_=e=>m_.get(e)??e,g_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},__=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(g_(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()}},v_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),y_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:h_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:h_(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}},b_=(e,t)=>{let n=[];for(let r=t;;){let t=y_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},x_=e=>({line:e.line,column:e.column}),S_=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=b_(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},C_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,w_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},T_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&C_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&C_(e[n+1],e[n+2])?n+=C_(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=>w_[e])}"`:r.text)}return t},E_=e=>e[2]?.text,D_=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},O_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>O_(e.modules,t)).find(Boolean),k_=(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:zd.get(i)??t?.(i)??Pp(e,i),s=o===void 0?[]:xe(o),c=D_(s),l=c.get(E_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Ip(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>O_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},A_=(e,t)=>{let n=k_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=b_(t,e+1);r.push({location:x_(t[e]),apply:e=>i.forEach(t=>e.put(v_(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:x_(u),apply:t=>t.put(v_(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`&&b_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),p_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(x_(u)),r.push({location:x_(u),apply:e=>e.put(v_(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(v_(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=h_(e.name);r.push({location:e.location,apply:n=>n.put(v_(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(v_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(v_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Aa(e.location,t.location)?-1:+!!Aa(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=__();i.set(e??``,s),Pd.toReversed().forEach(e=>s.put(v_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},j_=(e,t,n)=>A_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),M_=(e,t)=>{let n=A_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},N_=(e,t)=>j_(e,t,`variable`),P_=(e,t,n)=>{let r=k_(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)}),Id.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=S_(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}`),h=(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}},g=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?h(n,r,t):[n,i]};return t},_=g(e=>e.extends),v=g(e=>e.instances),y=/* @__PURE__ */ new Set([void 0]),b=/* @__PURE__ */ new Map;T_(s(void 0)).forEach((e,t)=>{t===3&&Rd.forEach(a),a(e)});let ee=u(void 0);for(;;){let e=_(ee,/* @__PURE__ */ new Set)??v(ee,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;if(f.add(`${t.key}>${n}`),b.set(t.unit,[...b.get(t.unit)??[],n]),!y.has(n)){if(y.add(n),r(n).tokens.length===0){let e=t.unit??E_(r(void 0).tokens);throw m(n,e)}T_(s(n)).forEach(a)}}f_.forEach(a);let x=/* @__PURE__ */ new Set,S=e=>{if(x.has(e))return;x.add(e);let t=b.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(S),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return S(void 0),Ld.forEach(a),[...i]},F_=t=>{switch(t.kind){case`Number`:try{return dt(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Rt(t.name);case`Set`:return Nn(t.elements.map(F_))}},I_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],L_=(e,t)=>{try{return Ip(e)}catch(n){if(!(n instanceof u))throw n;let r=cp(e);throw r===void 0?n:p([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},R_=e=>new u(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),z_=(e,t)=>e.location.range&&t.location.range&&{location:g(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${g(t.location.range)}.`},B_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,V_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:B_(e),H_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:wa},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),U_=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>z(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 y(`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`)&&Qt(t,r)})});if(t)return t[1];throw new y(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:z(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},W_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||hi(e).some(e=>W_(e,t)),G_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(rs(e),n.get(e)??n.size)),n},K_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),q_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw nl(e);if(e.kind===`Number`&&!du(e.value))throw rl(e);q_(e.kind===`Let`?[...hi(e),...K_(e.instances??[])]:hi(e))}),J_=(e,t)=>{let n=Ip(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Set,s=new Map(Qh.map(e=>[e.name,e])),c=/* @__PURE__ */ new Map,l=bm(e.checkDeadlock,t.seed);l.isWarningEnabled=t.isWarningEnabled??!0,l.isTool=t.isTool??!1,l.version=t.version??`master`;let d=/* @__PURE__ */ new Map,f=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,b=[],ee=/* @__PURE__ */ new Map,x=[],S=[],C=(e,t)=>x.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),te={value:0},ne=e=>`${e}#${te.value++}`,re=[],ie=[],ae=d_(e=>{let t=_.get(e)??ue(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>r.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=/* @__PURE__ */ new Map,w=e=>{let n=c.get(e);if(n)return n;let r=hg(e,t.print,l,t.files,s);if(!r)return;mg.get(e)?.forEach(w);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>w(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{s.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:gg.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:vg(e,t.name)??i.get(t.name)?.range})}),c.set(e,i),i},T=e=>{let t=w(e),n=mg.get(e)??[];return t&&C(e,n),t&&n.includes(`Integers`)&&w(`Integers`),t},E=e=>(q_([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...K_(e.instances)]),e.modules.forEach(E),e);E(n);let D=(e,n)=>{let r=t.loadModule?.(e)??Sd.get(e)??Pp(t.source,e);if(r===void 0)throw m(e,n);let i=L_(r,e);if(i.name!==e)throw p([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return E(i)},le=e=>{let t=S.indexOf(e.name);if(t!==-1)throw new u(`Circular dependency among .tla files; dependency cycle is: ${[...S.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];S.push(e.name),x.push(n);let o=be(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:ie,levelChecks:a});if(x.pop(),S.pop(),i.length>0)throw p(i,!1,void 0,ie);let s=r.find(e=>n.has(e.name)),c=s&&d.get(s.name),l=c&&z_(s,c.module);if(l)throw p([l],!1,void 0,ie);if(s)throw R_(s);return a.forEach(e=>e()),{linked:o,closure:n}},ue=(e,t)=>{let n=d.get(e);if(n)return C(e,ee.get(e)??[]),n;let r=le(D(e,t));return d.set(e,r.linked),ee.set(e,r.closure),C(e,r.closure),r.linked},de=(e,t,n,s,c)=>{let l=c?void 0:T(e.module);if(l)return fe(e,l);let u=c??ue(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=I_(u),f=`#${te.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Lo(jg(e,t),d,t,n);re.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=hs({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Ho(t,p)])),variables:new Set(u.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,c,l)=>{let u=ne(`${c}@${t.name}`),f=l(u);return r.set(u,f),d.length>0&&o.add(f),e.name!==void 0&&se.set(u,`${e.name}!${se.get(n)??c}`),i.set(u,!s),a.set(u,{source:n,prefix:e.params.length}),u},createName:ne});return pe(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&ce.set(r,n),r})},fe=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),pe=(e,t,n,r)=>{let a=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!a.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:i.get(n.key)===!0?e.location.range:n.range}];let a=`${e.name}!${t}`;return[a,{key:r(n.key,a),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},me=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:wa})),he=(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:me(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ge=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=ge(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:me(r,n),location:n}}},_e=(e,t,n,a)=>{let o=e.location,s=a?void 0:T(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=ge(n.arity);return he(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??ue(e.module,n),l=`#${te.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=I_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};re.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=>W_(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=[],_=hs({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:me(e.params,o),location:o,resolution:wa}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:wa}])),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}:H_(a,i)),i},createName:ne}),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=ge(n.arity),a=[...e.params,...i];return he(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ve=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),ye=/* @__PURE__ */ new Map,be=(e,a)=>{let o=Nd(e,t.loadClass?.(e.name),e===n);ye.set(e.name,o.overrides);let s=o.module,c=re.length,l=new Map([...Qh.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...a.symbols]),u=/* @__PURE__ */ new Map,d={location:Mo,errors:[],warnings:[]},p=[d],m=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);V_(n.kind)===V_(e.kind)?d.warnings.push({location:r,message:`Warning: the ${B_(n.kind)} of '${t}' conflicts with \nits ${B_(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${B_(e.kind)} of '${t}' conflicts with \nits ${B_(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,ee=[],x=[...s.constants],S=s.variables.map(e=>e.name),C=s.variables.map(e=>e.location);s.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:T(e);if(n){m(n);return}let r=t??ue(e,s.name);x.push(...r.constants.filter(e=>x.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{S.includes(e)||(S.push(e),C.push(r.variableLocations[t]))}),m(r.exported),r.facts.forEach(e=>v.add(e)),r.modules.forEach((e,t)=>y.set(t,e)),ee.push(r)});let te=new Map(l),ne=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ne.forEach(e=>h.set(e.name,oe(e)));let se=e=>({key:E(e),arity:ja(e),params:Ma(e),kind:No(s,e)?`Theorem`:`Definition`,range:e.location.range}),w=x.length===0&&S.length===0,E=e=>s===n?e.name:`${e.name}@${a.id}`,D=/* @__PURE__ */ new Map,le=()=>new Map([...a.modules,...y]),me=e=>{let t=s.instances.find(t=>t.module===e.name);return t!==void 0&&Aa(e.location,t.location)},he=e=>{let t=s.modules.find(t=>t.name===e.module);return t?me(t)?y.get(t.name):void 0:le().get(e.module)},ge=e=>({imported:l,getInstance:e=>{let t=he(e),n=t?void 0:T(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:s.name};let r=t??ue(e.module,s.name),i=I_(r);return{declarations:i,symbols:pe(e,r.exported,i,e=>e),instancer:s.name}},bound:te,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:E,instanced:D,facts:v,reports:p,warnings:a.warnings}),O=e=>new Map([...l,...ne.filter(t=>Aa(t.location,e)).map(e=>[e.name,oe(e)]),...s.definitions.filter(t=>Aa(t.location,e)).map(e=>[e.name,se(e)])]),xe=e=>{let t=le(),n=t.get(e.name),r=n&&z_(e,n.module);if(n&&!r)throw R_(e);a.nested.push(e);let i={location:e.location,errors:[],warnings:[]};p.push(i);let o=be(e,{id:`${a.id}/${e.name}`,symbols:O(e.location),modules:t,nested:a.nested,errors:i.errors,warnings:i.warnings,levelChecks:a.levelChecks});r&&i.errors.push(r),n||y.set(e.name,o),f.has(e.name)||f.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=de(e,s,ge(s),w,le().get(e.module));D.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>xe(e)}))].sort((e,t)=>Aa(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=Mg(ys(s,(e,t)=>_e(e,t,s.name,he(e))),ve(l));a.errors.push(...zo(Se,ge(Se))),Se.definitions.forEach(e=>{let t=E(e);r.set(t,e),i.set(t,!w);let n=se(e),a=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||a!==void 0&&!Aa(a,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ce={module:Se,constants:x,variables:S,variableLocations:C,visible:l,exported:h,modules:y,extended:ee,facts:/* @__PURE__ */ new Set([...v,...[...Se.theorems,...Se.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,Ce);let we=re.splice(c).map(e=>({location:e.location,check:()=>ae(e)}));return a.levelChecks.push(()=>l_(Se,{constants:new Set(x.map(e=>e.name)),variables:new Set(S),getDefinition:e=>r.get(l.get(e)?.key??e),getQualifiedName:e=>ce.get(l.get(e)?.key??e)},we,ie)),b.push(Ce),Ce},xe=le(n).linked;ie.length>0&&!t.isSanyReported&&t.print(h(ie));let Se=e=>xe.visible.get(e)?.key??e;xe.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(xe,/* @__PURE__ */ new Set);let k=xe.constants.map(e=>e.name),Te=xe.variables,A=e=>e.module===void 0?[e.name,Se(e.name)]:e.module===n.name||k.includes(e.name)?[]:[(d.get(e.module)??f.get(e.module))?.visible.get(e.name)?.key??e.name],Ee=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:xe.constants.find(t=>t.name===e)?.arity??0},De=/* @__PURE__ */ new Map,Oe=/* @__PURE__ */ new Set,ke=(e,t)=>{s.set(e,t),r.delete(e),De.delete(e),Oe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=F_(e.value);An(t),A(e).forEach(e=>{let n=Ee(e);n===0?De.set(e,t):ke(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ae=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ae.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new v(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(F_),F_(e.value)]),Ae.set(t,n)}),Ae.forEach(e=>A(e).forEach(t=>ke(t,U_(e.name,Ee(t)||e.rows[0][0].length,e.rows))));let je=new Map(e.substitutions.flatMap(e=>A(e).map(t=>[t,Se(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!k.includes(n)&&!xe.visible.has(n))throw new v(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new v(`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=Se(i),o=r.get(a);if(!(o!==void 0||s.has(a)||De.has(a)||k.includes(i)||Te.includes(i)))throw new v(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(o?.kind===`Operator`&&o.params.length!==(xe.constants.find(e=>e.name===n)?.arity??xe.visible.get(n)?.arity))throw new v(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let Me=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(A)),Ne=(e,t)=>{if(Me.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&Ne(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=Ne(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=he(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),xe.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let Pe=k.filter(e=>!De.has(e)&&!je.has(e)&&!Oe.has(e));if(Pe.length>0&&!t.isUnconfigured)throw new v(`The constant parameter ${j_(t.source,t.loadModule,`constant`).find(e=>Pe.includes(e))??Pe[0]} is not assigned a value by the configuration file.`);t.isTraceRecorded&&s.forEach((e,t)=>{let n=rg(e);n&&s.set(t,n)});let Fe={runtime:l,definitions:r,builtins:s,constants:De,substitutions:je,instanceNames:se,variables:Te,variableIndex:G_(Te,b.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:o,evaluators:/* @__PURE__ */ new WeakMap},Ie=s_({constants:new Set(De.keys()),variables:/* @__PURE__ */ new Set([...Te,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>s.has(e))]),getDefinition:e=>dl(e,Fe)}),Le=e=>{try{W(e,{environment:Fe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};je.forEach((e,t)=>{let n=r.get(e),i=k.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ie.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Le(n.body):void 0;if(i)throw new v(`The configuration file substitutes constant ${t} with non-constant ${e}${_a(i)?``:` - specifically: ${i.message}`}`)}),l.version!==`1.7.4`&&(l.isStarted=!0);let Re=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),ze=M_(t.source,t.loadModule);return{environment:Fe,assumptions:Ce,variableLocations:xe.variableLocations,instanceActions:oe,startupDefinitions:b.filter(e=>!Re.has(e.module.name)||I_(e).length===0).flatMap(e=>ze(e===xe?void 0:e.module.name).flatMap(t=>{let n=r.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:xe.constants,rootSymbols:xe.visible,javaOverrides:b.flatMap(e=>ye.get(e.module.name)??[])}},Y_={kind:`Boolean`,value:!0},X_={kind:`Boolean`,value:!1},Z_=e=>e?Y_:X_,Q_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,$_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,ev=(e,t)=>({kind:e,body:t}),tv=(e,t,n)=>({kind:e,operands:[t,n]}),nv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?nv(e,t.operands).operands:[t])}),rv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return rv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,rv(t)),0)}},iv=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 iv(e.body);case`And`:case`Or`:return e.operands.some(iv)}},av=/* @__PURE__ */ new WeakMap,ov={count:0},sv=e=>{let t=av.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`#${ov.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(sv).join(`,`)})`;default:return`${e.kind}(${sv(e.body)})`}})();return av.set(e,n),n},cv=(e,t)=>e===t||sv(e)===sv(t),lv=(e,t)=>{let n=sv(t);return e.some(e=>e===t||sv(e)===n)},uv=e=>e===`And`?`Or`:`And`,dv=(e,t)=>{switch(e.kind){case`Boolean`:return t?Z_(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?ev(`Not`,e):e;case`Not`:return dv(e.body,!t);case`And`:case`Or`:return nv(t?uv(e.kind):e.kind,e.operands.map(e=>dv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return ev(n,dv(e.body,t))}}},fv=e=>{switch(e.kind){case`Boolean`:return Z_(!e.value);case`Not`:return e.body;case`And`:case`Or`:return nv(uv(e.kind),e.operands.map(fv));case`Always`:return ev(`Eventually`,fv(e.body));case`Eventually`:return ev(`Always`,fv(e.body));default:return ev(`Not`,e)}},pv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=pv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Z_(t)}return n.length===0?Z_(!t):n.length===1?n[0]:nv(e.kind,n)}case`Not`:{let t=pv(e.body);return t.kind===`Boolean`?Z_(!t.value):ev(`Not`,t)}case`Always`:case`Eventually`:{let t=pv(e.body);return ev(e.kind,t.kind===e.kind?t.body:t)}default:return e}},mv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,hv=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=hv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new y(`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=>nv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=hv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=mv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:nv(`Or`,t);n.push(ev(`Always`,ev(`Eventually`,e)))}return nv(`Or`,n)}case`Not`:return Q_(e.body)?e:hv(fv(e.body));default:return e}},gv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?gv(e.operands[0]):nv(e.kind,e.operands.map(gv));case`Not`:return e.body.kind===`Not`?gv(e.body.body):ev(`Not`,gv(e.body));case`Always`:case`Eventually`:case`Next`:return ev(e.kind,gv(e.body));default:return e}},_v=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return _v(e.operands[0]);let t=Math.floor(e.operands.length/2);return tv(e.kind,_v(nv(e.kind,e.operands.slice(0,t))),_v(nv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return ev(e.kind,_v(e.body));default:return e}},vv=(e,t)=>{e.kind===`Eventually`&&!lv(t,e)&&t.push(e),`body`in e&&vv(e.body,t),`operands`in e&&e.operands.forEach(e=>vv(e,t))},yv=e=>{let t=e.filter($_),n=e.flatMap(e=>e.kind===`Not`&&$_(e.body)?[e.body]:[]);return!t.some(e=>lv(n,e))},bv=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,ev(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new y(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},xv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:ev(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Sv=(e,t,n)=>e.flatMap(e=>{let r=xv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Cv=e=>[...new Set(e.map(sv))].sort().join(`|`),wv=(e,t)=>{let n=new Set(t.map(Cv));return[...e.filter(e=>!n.has(Cv(e))),...t]},Tv=e=>{let t=bv(e),n=Sv(t,`Always`,`And`),r=Sv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=xv(t,`Eventually`,`Or`);if(n&&!(lv(e,n.first)||lv(e,n.second)))return wv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(lv(e,t.first)||lv(e,t.second))&&!lv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!yv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=xv(t[e],`Always`,`And`);n&&(lv(t,n.first)||t.push(n.first),lv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)lv(t,e.first)&&lv(t,e.second)&&!lv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!yv(t)?[]:i(t)};return a(e)},Ev=e=>({particle:e,successors:[],statePredicates:e.filter(e=>rv(e)<=1)}),Dv=e=>{let t=Tv([e]).map(Ev),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Cv(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 Tv(n)){let n=Cv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Ev(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Ov=(e,t)=>!lv(e,t)||lv(e,t.body),kv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&rv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=mv(e);if(n){let e=rv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(iv(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Av=(e,t)=>{let n=e.findIndex(e=>cv(e,t));return n===-1?(e.push(t),e.length-1):n},jv=e=>{let t=hv(pv(dv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=gv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])kv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:nv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:cv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&_v(e.formula),n=[];t&&vv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Av(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Av(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Av(i,e))}));return{tableau:t&&Dv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Mv=()=>n(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.livenessEvaluationFailure),Nv=()=>n(new ee,e.error),Pv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Fv=/* @__PURE__ */ new WeakMap,Iv=/* @__PURE__ */ new WeakSet,Lv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Rv=(e,t)=>new y(`TLC cannot handle the temporal formula ${Jc(e)}${t===void 0?``:`:\n${t}`}`),zv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=il(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return zv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?zv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=dl(e,n);if(t)return Bv(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?r.isStateLevel&&!r.isLevelConstant?1:0:void 0},o=(e,t)=>r.has(e)?0:B(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Jo(e,(e,a)=>(i.value=Math.max(i.value,zv(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 Pv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Bv=(e,t)=>{let n=Fv.get(e);if(n!==void 0)return n;Fv.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(zv(e.body,void 0,t),...r.map(e=>zv(e.set,void 0,t)));return Fv.set(e,i),i},Vv=(t,r)=>{try{return wl(t,r)}catch(t){if(!(t instanceof y))throw t;if(!_a(t))return;throw n(new y(`${o(`tlc2.tool.EvalException`)}${t.message}`),e.error)}},Hv=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>Hv(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,Jc(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,Uv(e,t,n));if(e.kind===`Identifier`){let r=B(e)?il(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:dl(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Bv(a,n)>0){if(i.has(a))throw Nv();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=Lv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||zv(e,t,n)===3)){let t=Yl(e,c),r=B(e)?void 0:dl(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,su(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>zv(e.set,t,n)===0),u=l?Vv(e.bounds,c):void 0;if(l&&u){let n=[];if(Tl(e.bounds,u,t,t=>(n.push(...s(e.body,t,Jc(e.body))),!1)),n.length===0)throw Mv();return n}return[{expression:e,scope:t,name:o}]},Uv=(e,t,n)=>{let r=lu(e.definitions,Lv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Iv.add(e.binding);return r},Wv=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),Gv=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?zv(e,t,n):i;if(a===0){let r=W(e,Lv(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${Yc(e)}`);return Z_(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},a={depth:0},o=(e,t,n,r)=>{if(a.depth>=100)throw Nv();a.depth++;let o=f(e,t);a.depth--;let s=rv(o);return s>2?o:i(n,r,s)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=Lv(n,t),s=B(e)||dl(i,n)===void 0?il(t,i):void 0;if(s?.kind===`Thunk`&&Iv.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:B(e)?Xl(i,a):ql(i,n);if(l?.kind!==`Closure`)throw Rv(e);let u=e.kind===`Apply`?e.args:[],d=!B(e)&&dl(i,n)?.isRecursive===!0;return c(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(l.body,su(l,u,a),e,t)),d)},c=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof ee||n&&!r;throw!(t instanceof y)||i?t:Rv(e)}},l=(e,t)=>{let r=zv(e,t,n);if(!e.bounds.every(e=>zv(e.set,t,n)===0)){if(r<=2)return i(e,t,r);throw Rv(e)}let a=[],o=e.kind===`Forall`;try{El(e.bounds,Lv(n,t),t=>(a.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof y)||n instanceof ee)throw n;if(r<=2)return i(e,t,r);throw Rv(e,o&&!_a(n)?n.message:void 0)}return a.length===0?Z_(o):u(e,t,nv(o?`And`:`Or`,a))},u=(e,t,n)=>{let r=rv(n);return r>2?n:i(e,t,r)},d=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!B(e)||e.operator===`=>`),f=(e,t)=>{let a=zv(e,t,n);if(a<=2&&!d(e))return i(e,t,a);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,Uv(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?ev(`Always`,tv(`Or`,ev(`Not`,f(n[0],t)),ev(`Eventually`,f(n[1],t)))):e.operator===`~`&&!B(e)?u(e,t,ev(`Not`,f(n[0],t))):e.operator===`=>`?u(e,t,tv(`Or`,ev(`Not`,f(n[0],t)),f(n[1],t))):s(e,t)}case`And`:case`Or`:return u(e,t,nv(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(!r&&zv(e.condition,t,n)===0){let r=W(e.condition,Lv(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return u(e,t,tv(`Or`,tv(`And`,i,f(e.consequent,t)),tv(`And`,ev(`Not`,i),f(e.alternative,t))))}case`Always`:case`Eventually`:return ev(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=Wv(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=ev(`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`?ev(`Always`,ev(`Eventually`,tv(`Or`,i,a))):tv(`Or`,ev(`Eventually`,ev(`Always`,i)),ev(`Always`,ev(`Eventually`,a)))}default:throw Rv(e)}};return f(e,t)},Kv=(e,t,n,r,i)=>{let a=e=>Kv(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`?ul(W(e.expression,a),`a temporal property predicate`):Lc(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&&ul(W(e.unchanged,a),`a subscript`)?!1:ul(W(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 Kv(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new y(`TLC cannot evaluate a temporal formula in a single step`)}},qv=(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)=>qv(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 Kv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Jv=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return Jv(e.body);case`And`:case`Or`:return e.operands.some(Jv);default:return!1}},Yv=e=>e.promises.some(e=>Jv(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),Xv=(e,t)=>e.every((e,n)=>en(e,t[n])),Zv=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Qv=e=>({data:e(1024),length:0,create:e}),$v=(e,t,n)=>{let r=t+n.length;if(r>e.data.length){let t=e.create(Math.max(2*e.data.length,r));t.set(e.data),e.data=t}e.data.set(n,t),e.length=Math.max(e.length,r)},ey=e=>new Int32Array(e).fill(-1),ty=(e,t)=>(e.edgeStarts[t]??-1)!==-1,ny=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},ry=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,iy=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),ay=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},oy=2**53-1,sy=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>Gv(e.expression,e.scope,n)),a=e.map(e=>ev(`Not`,Gv(e.expression,e.scope,n))),o=a.length===1?a[0]:nv(`Or`,a),s=i.length===0?o:nv(`And`,[...i,o]),c=jv(s);if(c.length===0)throw Mv();let l=/* @__PURE__ */ new Map,u=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=sv(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:Qv(e=>new Int32Array(e)),edgeActions:Qv(e=>new Uint8Array(e)),stateResults:Qv(e=>new Uint8Array(e)),initial:[],firstNodes:Qv(ey),lastNodes:Qv(ey),nextSiblings:[],isDone:[],errorNode:void 0})),d={multiplier:1},f=!Su(n),p={environment:n},m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>Kv(e,t,void 0,p.environment,f?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),b=(e,t,n,r)=>g(t,()=>{let t=e.solution.actionChecks;if(!f)return Uint8Array.from(t,e=>+!!Kv(e,n,r,p.environment,/* @__PURE__ */ new Map));let i=h(n),a=m.actions.get(n)??/* @__PURE__ */ new Map;m.actions.set(n,a);let o=a.get(r)??new Int8Array(l.size).fill(-1);return a.set(r,o),Uint8Array.from(e.actionIds,(e,a)=>(o[e]===-1&&(o[e]=+!!Kv(t[a],n,r,p.environment,i)),o[e]))}),ee=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),x=(e,t)=>{if(n.runtime.version===`1.7.4`)return!1;let r=e.nodes[t];return r.particle.length===0&&r.successors.length===1&&r.successors[0]===t},S=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),C=(e,t,n)=>e.solution.tableau?ay(e,t).find(t=>e.nodeTableaux[t]===n):t,te=(e,t,n)=>{let r=iy(e,t,n),i=e.lastNodes.data[t]??-1;return i===-1?$v(e.firstNodes,t,[r]):e.nextSiblings[i]=r,$v(e.lastNodes,t,[r]),r},ne=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;$v(e.edgeTargets,a,n),r.forEach((t,n)=>$v(e.edgeActions,(a+n)*o,t)),$v(e.stateResults,e.nodeStates[t]*i.length,i),e.edgeStarts[t]=a,e.edgeCounts[t]=n.length},re=(e,t,n)=>{let i={slots:Array.from({length:16*d.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t)&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&&Xv(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*d.multiplier&&d.multiplier++,i.slots.filter(e=>e!==void 0)},ie=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=[],u=s.successors.length>0?b(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!ee(t,r,i,n))continue;if(x(t,r)&&e.errorNode===void 0&&S(e)){e.errorNode=a;return}let o=C(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??te(e,i,r);l.push(s),c.push(u),o===void 0&&ie(e,t,n,i,s)}for(let a of r.getSuccessors(i,n)){let r=b(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!ee(t,n,i,a.state)||a.index===-1)continue;let s=C(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??te(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&ie(e,t,a.state,a.index,u)}}l.length>0&&ne(e,a,l,c,o)},ae=(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 ay(e,a)){let a=[],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=C(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??te(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&ie(e,t,n.state,n.index,d)}}),ne(e,s,a,c,i)}if(e.errorNode!==void 0)return Zv(se(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)iy(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{ty(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),ne(e,i,a,o,r)},se=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)ty(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 ny(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}ty(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new y(`Couldn't re-create liveness trace (path) starting at: ${t}`)},ce=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>ty(e,t)),c=[],l=t=>{let n=ny(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&Ov(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=oy;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=oy,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>ry(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>ny(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=Zv(se(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+m.length+h.length},_={node:r},v=e=>o.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]&&ry(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},o=g.count;if(ny(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!v(r)||!a(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_.node,c,e)&&(m[t]=!0,g.count--)})}return g.count<o?(b(r),d.clear(),!0):(v(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){b(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=ny(e,t).find(e=>v(e)&&!d.has(e))??-1}b(n.unvisited),d.add(n.unvisited)}}let ee=p(r,_.node,s,a);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];ee[ee.length-1]!==n&&ee.push(n)}let x=c[c.length-1];return ee[ee.length-1]===x&&ee.pop(),{prefix:c.slice(0,-1),cycle:[x,...ee.reverse()],isCycleConstrained:Yv(n)}},p=(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 ny(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 y(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r.link,n.push(t,l,-42),c.push(l);let u={value:r.link++};ny(e,l).forEach((t,r)=>{ty(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u.value=Math.min(u.value,o[t]):o[t]===-1&&s.push(t))}),n.push(u.value)}}};return{branches:u.length,addInitialState:(e,t,r)=>{p.environment=r??n,m.states.clear(),m.actions.clear();try{for(let n of u){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(C(n,e,i)??te(n,e,i))}}finally{p.environment=n}},addState:(e,t,r,i)=>{p.environment=i??n,m.states.clear(),m.actions.clear();try{let n=re(e,t,r);for(let r of u){let i=n.map(n=>b(r,e,t,n.state)),a=v(r,e,t),o=r.solution.tableau,s=o?ae(r,o,n,i,a,e):oe(r,n,i,a,e);if(s)return s}return}finally{p.environment=n}},findViolation:()=>{for(let e of u)for(let t of e.solution.models){let n=ce(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!qv(a[i].body,t,r,0,n)).map(e=>e.name))]}},cy=`UnnamedAction`,ly={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},uy=e=>{let t=e.range??ly;return Xn([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},dy=e=>{let t=[[`name`,e.name],[`location`,uy(e.location)]];return e.parameters.length===0?Xn(t):Xn([...t,[`context`,Xn(e.parameters)],[`parameters`,Yn(e.parameters.map(e=>e[0]))]])},fy=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),py=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),my=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,hy=e=>e.kind===`Apply`?e.args:[],gy=(e,t,n)=>{let r=my(e);if(r===void 0)return;if(B(e)){let e=il(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=ql(r,n);return i?.kind===`Closure`?i:void 0},_y=(e,t)=>{try{return W(e,py(t,void 0)),!0}catch(e){if(e instanceof l)return!1;throw e}},vy=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&hl(e,t)&&_y(e.body,t),yy=(e,t)=>{let n=dl(e.name,t);return n?.body===e.body&&vy(n,t)},by=(e,t)=>{if(e.kind!==`Identifier`||!B(e))return;let n=il(t,e.name);return n?.kind===`Thunk`?n:void 0},xy=(e,t)=>(e?.params??[]).flatMap(e=>{let n=il(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Sy=(e,t)=>{try{return e()}catch(e){if(e instanceof l)return t();throw e}},Cy=(e,t,n,r,i)=>{let a=hy(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=>zv(e,n,i)!==0)?o():Sy(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,py(i,n))]),expression:t,scope:n}],o)},wy=(e,t,n,r,i)=>{let a=()=>({name:n?.name??cy,location:e.location,parameters:xy(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return wy(e.body,lu(e.definitions,py(r,t)),n,r,i);case`Label`:return wy(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>wy(e,t,n,r,i));case`Exists`:return Sy(()=>{let o=[];return El(e.bounds,py(r,t),t=>(o.push(...wy(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=B(e)?void 0:i.get(my(e)??``),s=gy(e,t,r);if(o)return Cy(o,e,t,s,r);if(!s)return[a()];let c=hy(e),l=B(e)?s.name:r.instanceNames.get(my(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return yy(s,r)||c.some(e=>zv(e,t,r)!==0)?u():Sy(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,py(r,t))},parent:e}),s.scope);return wy(s.body,e,{...s,name:l},r,i)},u)},Ty=(e,t,n,r,i)=>{let a=(e,t)=>Ty(e,t,n,r,i);if(e.kind===`Let`){a(e.body,lu(e.definitions,py(n,t)));return}let o=by(e,t);if(o){a(o.expression,o.scope);return}let s=gy(e,t,n);if(s&&yy(s,n))return;if(s&&s.params.length===0){if(zv(s.body,s.scope,n)===1){r.inits.push(fy(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,su(s,e.args,py(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(fy(cy,e));return}let c=zv(e,t,n);c<=1?r.inits.push(fy(cy,e)):c===3&&r.temporals.push(fy(cy,e))},Ey=(e,t,n,r,i)=>{let a=(t,n)=>Ey(e,t,n,r,i);if(t.kind===`Let`){a(t.body,lu(t.definitions,py(r,n)));return}let o=by(t,n);if(o){a(o.expression,o.scope);return}let s=gy(t,n,r);if(s&&yy(s,r))return;if(s&&s.params.length===hy(t).length){a(s.body,t.kind===`Apply`?su(s,t.args,py(r,n)):s.scope);return}if(t.kind===`Forall`&&Sy(()=>(El(t.bounds,py(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(fy(e,a)):zv(a,n,r)<2?i.invariants.push(fy(e,a)):i.impliedTemporals.push(fy(e,t));return}let c=zv(t,n,r);c<=1?i.impliedInits.push(fy(e,t)):c===3&&i.impliedTemporals.push(fy(e,t))},Dy=(e,t)=>{let n=dl(e,t);return n?.kind===`Operator`&&!vy(n,t)?n:void 0},Oy=e=>Xn([[`name`,e.name],[`location`,uy(e.location)]]),ky=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Dy(e.specification,t);a&&(Ty(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...wy(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:ql(e.init,t);o?.kind===`Closure`&&r.inits.push(fy(e.init??``,o.body));let s=e.next===void 0?void 0:ql(e.next,t);return s?.kind===`Closure`&&r.actions.push(...wy(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Dy(e,t);n&&r.invariants.push(fy(e,n.body))}),e.properties.forEach(e=>{let n=Dy(e,t);n&&Ey(e,n.body,void 0,t,r)}),r},Ay=(e,t,n)=>ky(e,t,n).inits,jy=(e,t,n)=>ky(e,t,n).actions,My=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>z(e[1])).join(`,`)})`,Ny=(e,t)=>`${e.name===cy?`Action`:e.name}${t===`1.7.4`?``:My(e)} ${g(e.location.range??ly)}`,Py=e=>`${e.name}${My(e)}`,Fy=(e,t,n,r)=>{let i=ky(e,t,r),a=e=>Nn(e.map(dy)),o=e=>Nn(e.flatMap(e=>{let n=Dy(e,t);return n?[Oy(n)]:[]}));return Xn([[`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`,Nn(t.variables.map((e,t)=>Xn([[`name`,e],[`location`,uy(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},Iy=`paired12`,Ly=(e,t=16)=>e<=t*.75?t:Ly(e,t*2),Ry=(e,t)=>{let n=Ly(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)},zy=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),By=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Vy=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Hy=e=>Vy(e).replaceAll(`
468
- `,`\\n`),Uy=(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)},writeStuttering:r,close:()=>t?.(e.path,n.join(``))}},Wy=(e,t,n)=>{let r=n===`1.7.4`,i=[`strict digraph DiskGraph {
465
+ `]]),cf=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),lf=A(`EOF`),uf=A(`IDENTIFIER`),df=A(`DEFBREAK`),ff=(e,t)=>Array.from({length:A(t)-A(e)+1},(t,n)=>A(e)+n),pf=new Set(ff(`op_57`,`op_119`)),mf=new Set(ff(`op_1`,`op_119`)),hf=new Set(ff(`op_57`,`op_70`)),gf=/* @__PURE__ */ new Set([...ff(`ACTION`,`EXCEPT`),A(`EXTENDS`),...ff(`IF`,`SF`),A(`STATE`),...ff(`THEN`,`WITH`),A(`US`),...ff(`op_112`,`op_116`)]),_f=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),vf=new Map([..._f(`postfix`,160,160,!0,`[`),..._f(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),..._f(`prefix`,120,120,!1,`-.`),..._f(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),..._f(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),..._f(`prefix`,40,40,!0,`\\lnot`),..._f(`nfix`,100,130,!0,`\\times`),..._f(`infix`,140,140,!1,`^`,`^^`),..._f(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),..._f(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),..._f(`infix`,110,110,!0,`-`,`--`,`\\ominus`),..._f(`infix`,100,110,!0,`|`,`||`,`%%`),..._f(`infix`,100,110,!1,`%`),..._f(`infix`,100,100,!0,`+`,`++`,`\\oplus`),..._f(`infix`,90,140,!1,`\\wr`),..._f(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),..._f(`infix`,90,130,!1,`!!`),..._f(`infix`,90,90,!1,`...`,`..`),..._f(`infix`,80,80,!0,`\\intersect`,`\\union`),..._f(`infix`,80,80,!1,`\\`),..._f(`infix`,70,70,!1,`<:`,`:>`),..._f(`infix`,60,60,!0,`@@`),..._f(`infix`,50,140,!0,`\\cdot`),..._f(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),..._f(`infix`,30,30,!0,`\\land`,`\\lor`),..._f(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),..._f(`infix`,10,10,!1,`=>`)]),yf=new Map([...vf,...tf.flatMap(e=>e.slice(1).map(t=>[t,vf.get(e[0])]))]),bf=yf.get(`[`),xf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Sf=e=>({type:`tokens`,kinds:new Set(e)}),Cf=e=>typeof e==`string`?e.startsWith(`<`)?Sf([A(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(Cf)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),wf=e=>(...t)=>({type:e,body:G(...t)}),q=wf(`zeroOrMore`),Tf=wf(`oneOrMore`),J=wf(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),Ef=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Df=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Ef(e,n);return n},Of=(...e)=>{let t=e.map(A);return e=>t.includes(Df(e,1).kind)},kf=(e,t=Df(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Af=e=>{let t=Df(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},jf=e=>Of(`CASESEP`)(e)&&kf(e),Mf=e=>{let t=Df(e,1);gf.has(t.kind)&&(t.kind=uf)},Nf=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,Pf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Ff=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},If=e=>e.operatorStacks[e.operatorStacks.length-1],Lf=(e,t)=>e.low>t.high,Rf=(e,t)=>e.high<t.low,zf=e=>e.fix===`prefix`?e:yf.get(`${e.name}.`),Bf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===bf?Pf(`FcnAppl`,[n,...r.node.heirs]):Pf(`PostfixExpr`,[n,r.node]),operator:void 0})},Vf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Pf(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:Pf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Hf=e=>{let t=If(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return Bf(t,n),Hf(e);if(i.operator!==void 0){let t=zf(r.operator);return t!==void 0&&Lf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Nf(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Nf(e,a.node.first,a.node.last)} and expression at location ${Nf(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Rf(a.operator,r.operator)?void 0:Lf(a.operator,r.operator)?(Vf(t,a.operator),Hf(e)):`Precedence conflict between ops ${a.operator.name} in block ${Nf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=zf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Rf(s,r.operator))return;if(!Lf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Nf(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Vf(t,s),Hf(e);let c=Nf(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===xf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Uf=e=>Y(t=>{let n=If(t),r=Ff(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:Hf(t)}),Wf=Uf(()=>!1),Gf=Uf(()=>!0),Kf=Y(e=>{e.lastOperator=yf.get(e.token.image)}),qf=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},Jf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?qf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Yf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!kf(e,n.first.beginColumn))return n;let t=Yf(e,n);if(t!==void 0)return t}},Xf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(A),n=(e,...t)=>t.some(t=>e.kind===A(t)),r=e=>e!==void 0&&pf.has(e.kind),i=e.token,a=Ef(e,i);i.next=void 0;let o=Ef(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===uf&&(e=e.next)}else if(e.kind===uf){let t=e.next;!r(t)||hf.has(t.kind)||mf.has(t.kind)&&t.next?.kind!==uf||(e=t.next?.kind===A(`SUBSTITUTE`)?i:mf.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==df&&(e.next={kind:df,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Ef(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Zf=e=>{let t=Df(e,1);if(t.kind===A(`LAB`)){let n=1;for(;n!==0;)if(t=Ef(e,t),t.kind===A(`LAB`)&&n++,t.kind===A(`RAB`)&&n--,t.kind===lf)return!1;return Ef(e,t).kind===A(`IN`)}if(t.kind!==uf)return!1;for(t=Ef(e,t);t.kind===A(`COMMA`);){if(t=Ef(e,t),t.kind!==uf)return!1;t=Ef(e,t)}return t.kind===A(`IN`)},Qf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),$f=e=>e.proofLevels.at(-1)??-1,ep=e=>{let t=Df(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Of(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||$f(e)>=0&&Qf(t)>$f(e):Of(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},tp=(e,t)=>{let n=Qf(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},np=e=>Y(t=>tp(t,t.token)?void 0:`${Nf(t,t.token)}: ${e}`),rp=Sf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(A)),ip=Sf([...rp.kinds,A(`op_76`)]),ap=Sf(mf),op=Sf(hf),sp=Sf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(A)),cp=()=>q(Z({expansion:[K(rp,`<op_77>`)],semantic:kf}),K(`PrefixOp`,`InfixOp`),Gf),lp=()=>K(G(Z({expansion:[`OpenStart`],semantic:kf}),`OpenExpression`,Wf),G(Z({semantic:kf}),`ExtendableExpr`)),up=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),dp=()=>K(G(Z({semantic:e=>Of(`ASSUME`,`BOXASSUME`)(e)||Df(e,2).kind===A(`COLONCOLON`)&&[A(`ASSUME`),A(`BOXASSUME`)].includes(Df(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),fp=()=>[`JuncItem`,q(Z({semantic:Af}),`JuncItem`)],pp=e=>Y(t=>{t.expecting=e,Mf(t)}),mp=e=>Y(t=>{t.isTerminalProof=e}),hp=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{Xf(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),gp={CompilationUnit:Q(void 0,[Y(Xf),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),pp(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,pp(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,pp(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(Xf)),G(Z({semantic:e=>Of(`USE`)(e)&&Df(e,2).kind!==A(`ONLY`)||Of(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(hp(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),hp(`Expression`,Z({expansion:[`<IDENTIFIER>`,op]}),`PostfixLHS`,`Expression`),hp(`Expression`,Z({expansion:[`<IDENTIFIER>`,ap]}),`InfixLHS`,`Expression`),hp(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),hp(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[ip,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,ap,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,op]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,pp(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[rp,Kf]),NonExpPrefixOp:Q(void 0,[ip,Kf]),InfixOp:Q(`Infix Op`,[ap,Kf]),PostfixOp:Q(void 0,[op,Kf]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{Xf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),dp(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),dp(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=Ff(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Nf(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(Xf),K(G(Z({amount:3}),Z({semantic:Of(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:ep}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>Of(`BY`)(e)||Df(e,2).kind===A(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>Df(e,2).kind!==A(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,mp(!0),J(`<ONLY>`)),G(`<USE>`,mp(!1),J(`<ONLY>`)),G(`<HIDE>`,mp(!1))),X("an expression, `MODULE' or `DEF'"),J(up(),q(`<COMMA>`,X(`MODULE or expression`),up(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),up(),q(`<COMMA>`,X(`MODULE or expression`),up(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),sp,np(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:ep}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),sp,np(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:Of(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:Of(`INSTANCE`)}),`Instantiation`),G(Z({semantic:Of(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:ep}),Y(e=>{let t=Ff(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Nf(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),Tf(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:Of(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(ip,ap,op),Sf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(A))],semantic:kf}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Nf(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:kf}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:Zf}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),Tf(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=Ff(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),Tf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:Zf}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>Df(e,2).kind===A(`MAPTO`)&&gf.has(Df(e,1).kind)}),Y(e=>{Df(e,1).kind=uf}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=Pf(`FcnAppl`,t.heirs),e.lastOperator=bf})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,Tf(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(Mf),`Identifier`),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===A(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>jf(e)&&Df(e,2).kind!==A(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:jf}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[Tf(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=Df(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...fp()),G(Z({expansion:[`<AND>`]}),...fp())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Yf(t,e.heirs[1]);return n&&`Item at ${Nf(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Nf(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),cp(),lp()],(e,t)=>{let n=If(t);n.push({node:e.heirs[0],operator:xf});let r=Hf(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Wf,q(K(G(Z({expansion:[`PostfixOp`],semantic:kf}),`PostfixOp`,Gf),G(Z({expansion:[`<DOT>`],semantic:kf}),`<DOT>`,Y(Mf),Z({semantic:kf}),`Identifier`,Y(e=>{let t=If(e);t[t.length-1].operator!==void 0&&Bf(t,t.length),t[t.length-1]={node:Pf(`RecordComponent`,[t[t.length-1].node,Ff(e,2),Ff(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:kf}),X(`function argument`),`SBracketCases`,Uf(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:kf}),`InfixOp`,Gf,cp(),lp()),G(Z({expansion:[`<COLONCOLON>`],semantic:kf}),`<COLONCOLON>`,Y(e=>{let t=If(e);if(!Jf(t[t.length-1].node))return`\`::' at ${Nf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=If(e),n=Ff(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Rf(r,e.lastOperator)){let t=Ff(e,3);return`Removing label at ${Nf(e,t.first,t.last)} would change expression parsing.`}t.push({node:Pf(`Label`,[Ff(e,3),Ff(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:kf}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:kf}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>$f(e)<0&&e.proofLevels.length<=1?`${Nf(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Nf(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:qf(e.heirs)===void 0?e.heirs.length===1?Pf(`GeneralId`,e.heirs):void 0:Pf(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>Df(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>Df(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Nf(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},_p=/* @__PURE__ */ new Map,vp=e=>{let t=_p.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=vp(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,vp(gp[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return _p.set(e,n),n},yp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},bp=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Ef(e,e.scanPosition)),e.scanPosition=Ef(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},xp=(e,t)=>{if(t.type===`tokens`)return bp(e,t.kinds);if(t.type===`call`)return xp(e,gp[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||yp(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=xp(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||yp(e,t.semantic)?xp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=xp(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=xp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Sp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=xp(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},Cp=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||vp(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!vp(a).hasSemanticStart?vp(a).first.has(Df(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Sp(e,i,a)&&(o===void 0||o(e))}),wp=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,xp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Ef(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===lf){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Ef(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${qe(e.token.image)}" `},Tp=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??wp(e)}\n\nResidual stack trace follows:\n${r}`,!1},Ep=(e,t)=>{let n=Ef(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,Tp(e))},Dp=(e,t)=>{let n=gp[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Df(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Op(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return Tp(e,i);let a=r.node??(r.heirs.length===0?void 0:Pf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Op=(e,t)=>{if(t.type===`tokens`)return Ep(e,t.kinds);if(t.type===`call`)return Dp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Tp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Tp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Op(e,t));if(t.type===`choice`){let n=Cp(e,t.alternatives);return n===-1?Tp(e):Op(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Op(e,t.body))return!1;if(t.type===`optional`)return Cp(e,[t.body])===-1||Op(e,t.body);for(;Cp(e,[t.body])===0;)if(!Op(e,t.body))return!1;return!0},kp=e=>{let t=Ge(e),n={kind:lf,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Op(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},Ap={low:15,high:15},jp={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),Mp=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),Np=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Pp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Fp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Ip=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Lp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Rp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...Np]),zp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Mp.has(e.operator):Np.has(e.operator)),Bp=e=>Mp.has(e)||Np.has(e)||e===`-.`,Vp=(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}}},Hp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Up=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Wp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Gp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Kp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),qp=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Jp=/* @__PURE__ */ new Set([``,`*`,`-`]),Yp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Xp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Zp=/* @__PURE__ */ new Set([`NEW`,...Xp.keys()]),Qp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),$p=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),em=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),tm=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
466
+ `)}\n`},nm=(e,t)=>{let n=t===`tlapm`,r=n?Ce(e):Ce(e).map(xe),i={index:0,offsideColumns:[]},a={},o=[],s=/* @__PURE__ */ new Set,c=[],l=[],d=e=>o[o.length-1].has(e),f=e=>({line:e.line,column:n&&e.kind===`String`?e.endColumn:e.column,range:void 0}),m=[],h=[],_=[],v=(e,t=i.index-1)=>{let n=e===t?_[e]:void 0;if(n)return n;let a=r[t];m[e]??=f(r[e]),h[t]??={line:a.line,column:a.endColumn};let o={module:l[0].name,start:m[e],end:h[t]};return e===t&&(_[e]=o),o},y=(e,t)=>(e.location.range=v(t),e),b=(e=0)=>r[Math.min(i.index+e,r.length-1)],x=(e=0)=>{let t=b(e),n=i.offsideColumns[i.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ee=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),te={index:0},S=e=>{let t=r.slice(te.index,i.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ne=e=>n&&(e.kind===`Keyword`||em.has(e.text)),re=e=>{let t=r.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)?`====`:qp.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}`,C=(e,t=b(),n)=>{let i=r[r.length-1],a=t.line===i.line&&t.column===i.column;return new u(`${e} at line ${t.line}, column ${t.column}`,void 0,ae(e,t,a,n))},ae=(e,t,i,a)=>{if(n&&i){let e=r[r.length-1];return{reason:`Unexpected EOF`,...S(re(e)),isEnd:i}}return n&&a?{reason:`Unexpected ${ie(a)}`,...re(a),isEnd:i}:{reason:e,line:t.line,column:t.column,isEnd:i}},oe=(e,t=b())=>C(e,t,t),se=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ne(e),w=(e,t=0)=>{let n=x(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=x();if(e.kind===`End`)throw C(`Unexpected end of expression`);return i.index++,e},E=e=>w(e)?(i.index++,!0):!1,D=e=>{if(!w(e))throw oe(`Expected ${JSON.stringify(e)} but found ${ee(x())}`);return T()},ce=()=>{let e=x();if(e.kind!==`Identifier`)throw oe(`Expected an identifier but found ${ee(e)}`);if(ne(e))throw oe(`Unexpected keyword ${e.text}`);return i.index++,e.text},le=()=>{let e=i.index;return{name:ce(),range:v(e)}},ue=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),de=()=>{let e=x();return e.kind!==`String`&&(Fp.has(e.text)||Mp.has(e.text)||Np.has(e.text)||e.text===`'`)?(i.index++,e.text):ce()},fe={isUsed:!1},me=()=>x().kind===`Identifier`||!se(x())?ce():(fe.isUsed=!0,T().text),he=e=>{if(!n)return e();i.offsideColumns.push(-1);let t=e();return i.offsideColumns.pop(),t},O=(e,t=`,`)=>{let n=[e()];for(;E(t);)n.push(e());return n},ge=()=>{if(w(`<<`)){let e={value:1};for(;x(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;x(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},_e=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;x(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return x(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},ve=()=>{if(!E(`<<`)){let e=le();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ue(O(le));return D(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},ye=()=>O(()=>{let e=O(ve);D(`\\in`);let t=j();return e.map(e=>({pattern:e,set:t}))}).flat(),be=()=>{let e=x();if(e.kind===`Identifier`){let t=i.index,n=[T().text];for(;w(`!`)&&x(1).kind===`Identifier`;)T(),n.push(ce());return y({kind:`Identifier`,name:n.join(`!`),location:f(e)},t)}if(w(`<<`)||w(`(`))return Fe();throw oe(`Expected a subscript but found ${ee(e)}`)},Se=e=>{let t=x(1),n=x(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(`==`,Np.has(n.text)?3:4))},we=e=>{let t=x(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&Up.has(t.text)||Se(e)},k=()=>{let e=x(),t=e.kind===`Operator`&&(Mp.has(e.text)||Pp.has(e.text))&&we(e);if(n&&e.kind!==`String`&&(Pp.has(e.text)||Rp.has(e.text)&&e.text!==`'`&&!Np.has(e.text)||Lp.has(e.text)&&x(-1).text===`(`&&x(-1).line===e.line&&x(-1).endColumn+1===e.column&&x(1).text===`)`&&x(1).line===e.line&&x(1).column===e.endColumn+1)&&we(e))throw C(`incomplete expression`,e);if(t)return i.index++,y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:f(e)},i.index-1);if(e.kind!==`String`&&Rp.has(e.text)&&we(e)){i.index++;let t=f(e);if(Np.has(e.text))return y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},i.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return y({kind:`Lambda`,params:[n.name],body:Vp(e.text,n,t),operator:e.text,location:f(e)},i.index-1)}if(w(`LAMBDA`)){let t=i.index;T();let n=ue(O(le));D(`:`);let r=j();return y({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:f(e)},t)}return j()},Te={range:void 0},A=()=>he(()=>{let e=i.index;D(`(`);let t=O(k);return D(`)`),Te.range=v(e),t}),Ee=()=>{let e=T();i.offsideColumns.push(e.column);let t=[j()];for(;b().text===e.text&&b().column===e.column;)i.index++,t.push(j());return i.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:f(e)}},De=e=>he(()=>{let t=f(e),r=x().kind===`Identifier`,a=w(`|->`,1)&&(r||se(x()));if(a||r&&w(`:`,1)){let e=a?`Record`:`RecordSet`,n=e=>{let t=i.index,n=f(x()),r=e();return n.range=v(t),D(a?`|->`:`:`),{name:r,value:j(),location:n}},o=[n(()=>r?ce():T().text),...E(`,`)?O(()=>n(ce)):[]];return D(`]`),{kind:e,fields:o,location:t}}if(ge()){let e=ye();D(`|->`);let n=j();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let o=j();if(E(`->`)){let e=j();return D(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(E(`EXCEPT`)){let e=O(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!se(x()))throw oe(`Expected a field name but found ${ee(x())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:O(()=>j())}),D(`]`);return D(`=`),{path:e,value:j()}});return D(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!n&&!w(`]_`)){let e=[o];for(;E(`,`);)e.push(j());return D(`]`),{kind:`Bracket`,args:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:o,subscript:be(),location:t}}),Oe=()=>{let e=i.index,t=y(Le(),e),n=f(T());return y({kind:`Apply`,operator:`\\in`,args:[t,j()],location:n},e)},ke=e=>he(()=>{let t=f(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ge()&&(x(1).text===`\\in`||w(`<<`))){let e=i.index,n=ve();D(`\\in`);let r=j();if(E(`:`)){let e=j();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}i.index=e}let n=x().kind===`Identifier`&&w(`\\in`,1)?Oe():j();if(E(`:`)){let e=ye();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;E(`,`);)r.push(j());return D(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ae=e=>{let t=f(e),n=he(()=>w(`>>`)||w(`>>_`)?[]:O(()=>j()));if(E(`>>_`)){if(n.length!==1)throw C(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:be(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},je=e=>{let t=f(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ge()){let e=ye();return D(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=ue(O(le));return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Me=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:j(),location:f(e)};let n=j();D(`->`),t.push({condition:n,body:j()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:f(e)}},Ne=()=>{let e=x(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Hp.has(e.text)||e.kind===`Operator`&&(Mp.has(e.text)||Np.has(e.text)||Pp.has(e.text)))},Pe=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:pe(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return i.index--,{kind:`Bound`,args:A()}}return{kind:`Name`,name:e.text,args:w(`(`)?A():[]}},Fe=e=>{let t=i.index,r=T(),s=f(r);if(n&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=O(ce);return D(`:`),{kind:`Lambda`,params:e,body:j(),location:s}}if(r.kind===`Number`){if(n&&/^\\[BOH]/.test(r.text))throw C(`incomplete expression`,r);return{kind:`Number`,value:pe(r.text),text:r.text,location:s}}if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:s};if(r.kind===`String`)return{kind:`String`,value:r.text,location:s};let c=r.kind===`Step`&&et(r);if(c&&Ze()<0&&Xe.length<=1)throw C(`Step number used outside proof`,r);if(c&&r.text[1]===`+`)throw C(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||c){let o=c?tt(r)??r.text:r.text;if(_e()){let t=ue(E(`(`)?O(le):[]);t.names.length>0&&D(`)`),D(`::`);let i=j();if(!n&&e!==void 0&&a.last!==void 0&&zp(i)&&e.high>=a.last.low)throw C(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:o,params:t.names,paramRanges:t.ranges,body:i,location:s}}let l=w(`(`);if(o===`@`&&!l&&!Ne())return{kind:`ExceptAt`,location:s};let u=l?A():[],d=[l?Te.range:void 0];if(!Ne())return l?{kind:`Apply`,operator:o,args:u,argumentsRange:Te.range,location:s}:{kind:`Identifier`,name:o,location:s};let f=[{kind:`Name`,name:o,args:u}],p=[v(t,t)];for(;Ne();)T(),p.push(v(i.index,i.index)),Te.range=void 0,f.push(Pe()),d.push(Te.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),y=d.at(-1)??v(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:s}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:s}:_.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:h,args:g,argumentCounts:_,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:s}:{kind:`Apply`,operator:h,args:g,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:s}}if(r.kind===`Operator`&&Bp(r.text)&&w(`(`))return{kind:`Apply`,operator:r.text,spelling:r.spelling,args:A(),location:s};if(r.kind===`Operator`&&Bp(r.text)&&!n)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:s};switch(r.text){case`(`:{let e=he(()=>j());return D(`)`),e}case`[`:return De(r);case`{`:return ke(r);case`<<`:return Ae(r);case`@`:return{kind:`ExceptAt`,location:s};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return je(r);case`IF`:{let e=j();D(`THEN`);let t=j();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:s}}case`CASE`:return Me(r);case`LET`:{let e=[],t=[];for(o.push(/* @__PURE__ */ new Set);!E(`IN`);){if(n&&w(`RECURSIVE`))throw C(`Unexpected keyword RECURSIVE`,S(b()));if(E(`RECURSIVE`)){qe();continue}let r=Be(!1);r.kind===`Instance`?t.push(r):e.push(r)}o.pop();let r=j();return t.length===0?{kind:`Let`,definitions:e,body:r,location:s}:{kind:`Let`,definitions:e,instances:t,body:r,location:s}}case`CHOOSE`:{let e=ve(),t=E(`\\in`)?j():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:s}}case`WF_`:case`SF_`:{let e=be(),t=he(()=>{D(`(`);let e=j();return D(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:s}}}throw oe(`Unexpected ${ee(r)}`,r)},Ie=(e,t,r)=>{a.last=a.preceding={low:t,high:r};let i=j(r+1),o=x(),s=o.text===`'`||Np.has(o.text)?Ap.high:Mp.get(o.text)?.high;if(!n&&o.kind===`Operator`&&s!==void 0&&s>=t)throw C(`Precedence conflict between ${e.text} and ${o.text}`,o);return i},Le=()=>{let e=a.preceding;a.preceding=void 0;let t=x(),r=f(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return Ee();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[Ie(t,4,4)],location:r};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[Ie(t,12,12)],location:r};case`[]`:return T(),{kind:`Always`,expression:Ie(t,4,15),location:r};case`<>`:return T(),{kind:`Eventually`,expression:Ie(t,4,15),location:r};case`ENABLED`:return T(),{kind:`Enabled`,expression:Ie(t,4,15),location:r};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:Ie(t,4,15),location:r};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:t.text,args:[n?j(9):Ie(t,10,13)],location:r}}return Fe(e)},j=(e=0)=>{let t=i.index,n=Le(),r={left:n.location.range?n:y(n,t),previous:void 0};for(;;){let n=x();if(n.kind!==`Operator`)break;let i=f(n);if(n.text===`'`&&e<=15){T(),a.last=Ap,r.left=y({kind:`Prime`,expression:r.left,location:i},t);continue}if(Np.has(n.text)&&e<=15){T(),a.last=Ap,r.left=y({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){T();let e=he(()=>O(()=>j()));he(()=>D(`]`)),a.last=jp,r.left=y({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&se(x(1))){T();let e=T().text;r.left=y({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let o=Mp.get(n.text);if(!o||o.low<e)break;let s=r.previous;if(s){let e=!(s.low>o.high||s.high<o.low),t=s.text===n.text&&o.isAssociative;if(e&&!t&&(s.text!==`\\X`||n.text!==`\\X`))throw C(`Precedence conflict between ${s.text} and ${n.text}`,n)}if(T(),o.low>12&&w(`-`))throw C(`Precedence conflict between ${n.text} and -`,x());a.last=a.preceding=o;let c=j(o.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[v(t).end];r.left=l.kind===e&&s?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&s?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=y(r.left,t),r.previous={...o,text:n.text}}return r.left},Re=()=>{if(!E(`(`))return[];let e=Ke();return D(`)`),e},ze=()=>{let e=f(x()),t=j(),n=r[i.index-1],a={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:l[0].name,start:e,end:a}}},Be=e=>{let t=i.index;return y(He(e),t)},Ve=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),He=e=>{let t=x(),n=f(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...ze(),isLocal:e,isRecursive:d(t),location:n});if(t.kind===`Identifier`&&x(1).kind===`Operator`&&Mp.has(x(1).text)&&x(2).kind===`Identifier`&&w(`==`,3)){let e=le(),t=T().text,n=le();return D(`==`),r(t,[Ve(e),Ve(n)])}let a=t.kind!==`String`&&Fp.has(t.text),o=t.kind===`Identifier`&&Np.has(x(1).text)&&w(`==`,2);if(a||o){let e=a?t.text:x(1).text;a&&T();let n=le();return o&&T(),D(`==`),r(e,[Ve(n)])}let s=ce();if(E(`[`)){let t=he(()=>ye());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:j(),isLocal:e,isRecursive:d(s),location:n}}let c=i.index,l=Re();return D(`==`),w(`INSTANCE`)?{...Ue(s,l,e,n),definitionRange:v(c)}:r(s,l)},Ue=(e,t,n,r)=>{let a=i.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:me(),substitutions:E(`WITH`)?O(()=>{let e=i.index,t=de(),n=v(e);return D(`<-`),{name:t,nameRange:n,expression:k()}}):[],isLocal:n,location:r,instanceRange:v(a)}},We=()=>{let e=i.index;return y(Ge(),e)},Ge=()=>{let e=f(x());if(w(`_`)&&x(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(x().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=ce();if(!E(`(`))return{name:t,arity:0,location:e};let n=O(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},Ke=()=>O(We),qe=()=>{let e=Ke();return e.forEach(e=>o[o.length-1].add(e.name)),e},Je=e=>{let t={value:0,offset:e};do{let e=x(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Qp.has(e.text)&&t.value++,e.kind===`Operator`&&$p.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ye=()=>{let e=x(),t=x(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,Je(1)):t.kind===`Operator`&&Np.has(t.text)?w(`==`,2):t.kind===`Operator`&&Mp.has(t.text)?x(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):e.kind!==`String`&&Fp.has(e.text)&&t.kind===`Identifier`&&w(`==`,2)},Xe=[],Ze=()=>Xe[Xe.length-1]??-1,Qe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),$e=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},et=e=>!e.text.endsWith(`.`)&&!Jp.has($e(e)),tt=e=>{let t=$e(e);if(Jp.has(t))return;let n=Qe(e);if(n>=0)return`<${n}>${t}`;let r=Ze(),i=Xe[Xe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},nt=e=>{if(e.kind===`Keyword`)return Gp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Xe.length===0;if(e.text[1]===`+`||Xe.length===0)return!0;let t=Ze();return t>=0&&Qe(e)>t},rt=e=>{let t=Qe(e),n=Xe.length-1,r=Xe[n-1]??-1,i=Xe[n]<0;return i&&(Xe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Xe[n]===t},M=e=>!s.has(e)&&l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),it=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!em.has(e.name)&&!M(e.name):!1,at=()=>{let e=x();return e.kind===`Step`?et(e):e.kind===`Keyword`?Yp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ye()},ot=()=>{let e=i.index,t=x();return t.kind===`Operator`&&!Ip.has(t.text)&&Bp(t.text)?(i.index++,y({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:f(t)},e)):E(`MODULE`)?y({kind:`ModuleFact`,name:ce(),location:f(t)},e):j()},st=e=>c[c.length-1]?.add(e),ct=e=>{c.push(/* @__PURE__ */ new Set);let t=e();return c.pop(),t},lt=e=>c.some(t=>t.has(e))||l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ut=()=>{let e=i.index,t=x(),n=O(()=>{let e=x();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw oe(`Expected a definition name but found ${ee(e)}`,e);return i.index++,e.text},`!`),r=f(t);return y(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},dt=()=>{if(n)return O(ut);let e=O(ot),r=t===`tlc`?e.find(e=>e.kind===`Identifier`&&lt(e.name)):void 0;if(r)throw C(`DEF clause entry should describe a defined operator`,r.location);return e},N=()=>({facts:at()?O(ot):[],defs:E(`DEF`)||E(`DEFS`)?dt():[]}),ft=()=>{let e=i.index,n=T(),r=n.text===`USE`&&E(`ONLY`),a=v(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...N(),keyword:a,location:f(n)},s=o.kind===`Hide`&&t===`tlc`?o.facts.filter(e=>!it(e)):[];if(s.length>0)throw p(s.map(t=>({location:g(t.location.range??v(e)),message:`The only expression allowed as a fact in a HIDE is
467
+ the name of a theorem, assumption, or step.`})));return y(o,e)},P=()=>{let e=i.index,t=f(x()),n=E(`NEW`),r=x().kind===`Keyword`?Xp.get(x().text):void 0;if(!n&&r===void 0)throw oe(`Expected a declaration but found ${ee(x())}`);if(r!==void 0&&T(),r===`Variable`){let n=le();return st(n.name),y({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let a=We();st(a.name);let o=(r??`Constant`)===`Constant`&&w(`\\in`);if(o&&a.arity>0)throw C(`declared symbol with arguments before \\in`);return o&&T(),y({kind:`NewSymbol`,name:a.name,arity:a.arity,level:r??`Constant`,set:o?j():void 0,nameRange:a.location.range,location:t},e)},F=()=>{let e=i.index,t=f(D(`ASSUME`)),n=O(()=>w(`ASSUME`)?ct(F):x().kind===`Keyword`&&Zp.has(x().text)?P():j());return D(`PROVE`),y({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)},pt=e=>{let t={value:0};for(;x(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return x(t.value).kind===`Identifier`&&w(e,t.value+1)},mt=(e,t)=>{e.forEach(st),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(st))},ht=()=>{let e=x();if(w(`USE`)||w(`HIDE`))return ft();if(w(`INSTANCE`)){let t=i.index;return y(Ue(void 0,[],!1,f(e)),t)}if(w(`DEFINE`)||Ye()){let t=i.index;E(`DEFINE`);let n=[Be(!1)];for(;Ye();)n.push(Be(!1));let r={kind:`Define`,definitions:n,location:f(e)};return y(r,t)}if(E(`HAVE`))return{kind:`Have`,expression:j()};if(E(`TAKE`)){let e=ge(),t=ue(e?[]:O(le)),n=e?ye():[];return mt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:O(()=>j())};if(E(`PICK`)){let e=pt(`:`),t=ue(e?O(le):[]),n=e?[]:ye();return mt(t.names,n),D(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return E(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?F():j()}},gt=e=>{let t=x();if(t.kind!==`Step`)throw oe(`Expected a step number but found ${ee(t)}`,t);if(!rt(t))throw C(`${e?`QED step`:`step`}'s number has bad level`,t);if(Qe(t)<0&&tt(t)!==void 0)throw C(`<*> and <+> cannot be used for a named step`,t);return i.index++,{name:tt(t),token:t.text,location:f(t)}},_t=()=>{let e=i.index,t=gt(w(`QED`,1)),n=i.index,r=/* @__PURE__ */ new Set;c.push(r);let a=E(`QED`)?{kind:`Qed`}:ht(),o=v(e),s=v(n),l=nt(x());if(l&&!Kp.has(a.kind))throw C(`Proof of a step that does not take a proof`);let u=l?yt():void 0;return c.pop(),(a.kind!==`Assert`||a.isSuffices)&&r.forEach(st),y({...t,body:a,head:o,statement:s,proof:u},e)},vt=()=>{let e=f(x());if(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=v(i.index-1);return{kind:`By`,isOnly:E(`ONLY`),...N(),keyword:t,location:e}}let t=x(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=v(i.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`PROOF`);let n=[_t()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(_t());return{kind:`Steps`,level:Ze(),steps:n,location:e}},yt=()=>{let e=i.index;Xe.push(-1);let t=ct(vt);return Xe.pop(),y(t,e)},bt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},xt=e=>{let t=i.index,n=T(),r=x().kind===`Identifier`&&w(`==`,1)?ce():void 0;r!==void 0&&(s.add(r),T());let a=ct(()=>({statement:w(`ASSUME`)?F():j(),proof:nt(x())?yt():void 0})),o=a.statement,c=y({name:r,statement:o,proof:a.proof,location:f(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&o.kind!==`AssumeProve`&&bt(e,y({kind:`Operator`,name:r,params:[],body:o,isLocal:!1,isRecursive:!1,location:f(n)},t))},St=()=>{let e=i.index;return y(Ct(),e)},Ct=()=>{let e=T(),t=f(e),n=e.text===`AXIOM`;if(x().kind===`Identifier`&&w(`==`,1)){let e=ce();return s.add(e),T(),{name:e,expression:j(),isAxiom:n,location:t}}return{name:void 0,expression:j(),isAxiom:n,location:t}},wt=()=>{let e=f(D(`----`));D(`MODULE`);let t=me();D(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(l.push(n),o.push(/* @__PURE__ */ new Set),E(`EXTENDS`)&&O(()=>{let e=i.index;n.extends.push(me()),n.extendsRanges.push(v(e))});;){let t=i.index;te.index=t;let r=x();if(r.kind===`ModuleEnd`)return e.range={module:l[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},l.pop(),o.pop(),n;if(r.kind===`Separator`){if(w(`MODULE`,1)){let e=wt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=f(T()),r=Ke();n.constants.push(...r),e.range=v(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=f(T()),r=O(()=>{let e=i.index,t=f(x());return y({name:ce(),arity:0,location:t},e)});n.variables.push(...r),e.range=v(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=St();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&bt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(w(`USE`)&&w(`ONLY`,1))throw oe(`Expected a module unit but found ${ee(r)}`);let e=ft();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:qe()});continue;case`INSTANCE`:Tt(n,y(Ue(void 0,[],!1,f(r)),t));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){Tt(n,y(Ue(void 0,[],!0,f(r)),t));continue}Tt(n,y(He(!0),t));continue}r.kind===`Keyword`&&Wp.has(r.text)?xt(n):Tt(n,Be(!1))}}},Tt=(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}))},Et=wt(),Dt=fe.isUsed?kp(e):void 0;if(Dt!==void 0)throw new u(Dt);return Et},rm=e=>nm(e,`tlc`),im=e=>nm(e,`tlapm`),am=e=>nm(e,`sany`),om=25214903917n,sm=(1n<<48n)-1n,cm=2147483647,lm=e=>{let t={value:(BigInt.asUintN(64,e)^om)&sm},n=e=>(t.value=t.value*om+11n&sm,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^om)&sm},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=cm)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},um=10454148508367108822n,dm=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:um);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),fm=Int32Array.from(dm,e=>Number(BigInt.asIntN(32,e>>32n))),pm=Int32Array.from(dm,e=>Number(BigInt.asIntN(32,e))),mm=Number(BigInt.asIntN(32,um>>32n)),hm=Number(BigInt.asIntN(32,um));let gm=mm,_m=hm;const vm=e=>{let t=(e^_m)&255;_m=(_m>>>8|gm<<24)^pm[t],gm=gm>>>8^fm[t]},ym=e=>{for(let t=0;t<32;t+=8)vm(e>>>t)},bm=e=>{if(typeof e==`boolean`)vm(0),vm(e?116:102);else if(typeof e==`number`)vm(1),ym(e);else if(typeof e==`string`){vm(3),ym(e.length);for(let t=0;t<e.length;t++)vm(e.charCodeAt(t))}else if(F(e))vm(21),ym(Mt(e.name)+1);else if(P(e)){let t=Mr(e);vm(9),ym(t.domain.length);for(let e=0;e<t.domain.length;e++)bm(t.domain[e]),bm(t.range[e])}else{let t=L(e).elements;vm(5),ym(t.length);for(let e of t)bm(e)}},xm=e=>{let t={high:gm,low:_m};gm=mm,_m=hm;for(let t of e)bm(t);let n=BigInt(gm>>>0)<<32n|BigInt(_m>>>0);return gm=t.high,_m=t.low,n},Sm=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||F(e))return 5;if(typeof e==`string`)return 5+e.length;if(P(e)){let t=Mr(e);return t.domain.reduce((e,n,r)=>e+Sm(n)+Sm(t.range[r]),5)}return L(e).elements.reduce((e,t)=>e+Sm(t),5)},Cm=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){gm=n<32?0:1<<n-32,_m=n<32?1<<n:0;for(let t=0;t<e;t++)vm(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]^gm,t[n+1]=t[a+1]^_m}}return t},wm=(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=Sm(e);return gm=0,_m=0,bm(e),r.set(e,i.length),i.push(n,gm,_m),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=Cm(e);return n.set(e,r),r};return(n,r)=>{let s={high:gm,low:_m},c={high:mm,low:hm};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}gm=s.high,_m=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},Tm=[],Em=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Dm=()=>{for(let e=1277011;Tm.length<1341;e++)Em(e)&&Tm.push(e);return Tm},Om=e=>{let t=Dm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},km=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},Am=e=>{for(let t=Math.max(e,9);;t++){let e=km(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)}}},jm=(e,t,n)=>{if(t<=0)return[];let r=Am(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Om(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Mm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:cm),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Nm=(1n<<63n)-1n-24n,Pm=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Nm*BigInt(n)+i)%t;return r<0n?r+t:r})},Fm=(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,Im=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Zn(e.domain),n=L(e.range).elements;return{lists:t.map(()=>n),create:e=>Ut(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>L(e).elements),create:t=>er(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>L(e).elements),create:$n}}},Lm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Rm=(e,t,n,r)=>{if(R(t))return[];let i=r===`1.7.4`?Mm:jm;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=Lm(t,r)?void 0:Im(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(cm)?Pm(e,t,n):i(e,Number(t),n)).map(e=>a.create(Fm(a.lists,e)))}let o=L(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},zm=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new y(`RandomElement of the empty set`);return n},Bm=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Zn(e.domain)];return Ut(n,n.map(()=>Bm(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return er(e.names.map((n,r)=>[n,Bm(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return $n(e.factors.map(e=>Bm(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 y(`RandomElement of the empty set`);return e.low+r}return zm(L(e).elements,t)},Vm=(e,t=0n)=>{let n=lm(t),r={random:lm(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>er([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:xm,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:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},Hm=e=>Un([...e.possibleCounts].map(([e,t])=>[e,t])),Um=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Hm(e)]]),Wm=`----------------------------- MODULE Bags --------------------------------
468
+ (**************************************************************************)
469
+ (* A bag, also called a multiset, is a set that can contain multiple *)
470
+ (* copies of the same element. A bag can have infinitely many elements, *)
471
+ (* but only finitely many copies of any single element. *)
472
+ (* *)
473
+ (* We represent a bag in the usual way as a function whose range is a *)
474
+ (* subset of the positive integers. An element e belongs to bag B iff e *)
475
+ (* is in the domain of B, in which case bag B contains B[e] copies of e. *)
476
+ (**************************************************************************)
477
+ (**************************************************************************)
478
+ (* All these definitions other than SubBag are overridden by TLC in the *)
479
+ (* Java class tlc2.module.Bags. Each operator is overridden by the Java *)
480
+ (* method with the same name, except that the mapping for TLA+ infix *)
481
+ (* operators is defined in the static block at the beginning of the Java *)
482
+ (* class. *)
483
+ (**************************************************************************)
484
+ LOCAL INSTANCE Naturals
485
+
486
+ IsABag(B) ==
487
+ (************************************************************************)
488
+ (* True iff B is a bag. *)
489
+ (************************************************************************)
490
+ B \\in [DOMAIN B -> {n \\in Nat : n > 0}]
491
+
492
+ BagToSet(B) == DOMAIN B
493
+ (************************************************************************)
494
+ (* The set of elements at least one copy of which is in B. *)
495
+ (************************************************************************)
496
+
497
+ SetToBag(S) == [e \\in S |-> 1]
498
+ (************************************************************************)
499
+ (* The bag that contains one copy of every element of the set S. *)
500
+ (************************************************************************)
501
+
502
+ BagIn(e,B) == e \\in BagToSet(B)
503
+ (************************************************************************)
504
+ (* The \\in operator for bags. *)
505
+ (************************************************************************)
506
+
507
+ EmptyBag == SetToBag({})
508
+
509
+ B1 (+) B2 ==
510
+ (************************************************************************)
511
+ (* The union of bags B1 and B2. *)
512
+ (************************************************************************)
513
+ [e \\in (DOMAIN B1) \\cup (DOMAIN B2) |->
514
+ (IF e \\in DOMAIN B1 THEN B1[e] ELSE 0)
515
+ + (IF e \\in DOMAIN B2 THEN B2[e] ELSE 0) ]
516
+
517
+ B1 (-) B2 ==
518
+ (************************************************************************)
519
+ (* The bag B1 with the elements of B2 removed--that is, with one copy *)
520
+ (* of an element removed from B1 for each copy of the same element in *)
521
+ (* B2. If B2 has at least as many copies of e as B1, then B1 (-) B2 *)
522
+ (* has no copies of e. *)
523
+ (************************************************************************)
524
+ LET B == [e \\in DOMAIN B1 |-> IF e \\in DOMAIN B2 THEN B1[e] - B2[e]
525
+ ELSE B1[e]]
526
+ IN [e \\in {d \\in DOMAIN B : B[d] > 0} |-> B[e]]
527
+
528
+ LOCAL Sum(f) ==
529
+ (******************************************************************)
530
+ (* The sum of f[x] for all x in DOMAIN f. The definition assumes *)
531
+ (* that f is a Nat-valued function and that f[x] equals 0 for all *)
532
+ (* but a finite number of elements x in DOMAIN f. *)
533
+ (******************************************************************)
534
+ LET DSum[S \\in SUBSET DOMAIN f] ==
535
+ LET elt == CHOOSE e \\in S : TRUE
536
+ IN IF S = {} THEN 0
537
+ ELSE f[elt] + DSum[S \\ {elt}]
538
+ IN DSum[DOMAIN f]
539
+
540
+ BagUnion(S) ==
541
+ (************************************************************************)
542
+ (* The bag union of all elements of the set S of bags. *)
543
+ (************************************************************************)
544
+ [e \\in UNION {BagToSet(B) : B \\in S} |->
545
+ Sum( [B \\in S |-> IF BagIn(e, B) THEN B[e] ELSE 0] ) ]
546
+
547
+ B1 \\sqsubseteq B2 ==
548
+ (************************************************************************)
549
+ (* The subset operator for bags. B1 \\sqsubseteq B2 iff, for all e, bag *)
550
+ (* B2 has at least as many copies of e as bag B1 does. *)
551
+ (************************************************************************)
552
+ /\\ (DOMAIN B1) \\subseteq (DOMAIN B2)
553
+ /\\ \\A e \\in DOMAIN B1 : B1[e] \\leq B2[e]
554
+
555
+ SubBag(B) ==
556
+ (************************************************************************)
557
+ (* The set of all subbags of bag B. *)
558
+ (* *)
559
+ (* The following definition is not the one described in the TLA+ book, *)
560
+ (* but rather one that TLC can evaluate. *)
561
+ (************************************************************************)
562
+
563
+ LET RemoveFromDom(x, f) == [y \\in (DOMAIN f) \\ {x} |-> f[y]]
564
+ Combine(x, BagSet) ==
565
+ BagSet \\cup
566
+ {[y \\in (DOMAIN f) \\cup {x} |-> IF y = x THEN i ELSE f[y]] :
567
+ f \\in BagSet, i \\in 1..B[x]}
568
+ Biggest == LET Range == {B[x] : x \\in DOMAIN B}
569
+ IN IF Range = {} THEN 0
570
+ ELSE CHOOSE r \\in Range :
571
+ \\A s \\in Range : r \\geq s
572
+ RSB[BB \\in UNION {[S -> 1..Biggest] : S \\in SUBSET DOMAIN B}] ==
573
+ IF BB = << >> THEN {<< >>}
574
+ ELSE LET x == CHOOSE x \\in DOMAIN BB : TRUE
575
+ IN Combine(x, RSB[RemoveFromDom(x, BB)])
576
+ IN RSB[B]
577
+
578
+ (******************* Here is the definition from the TLA+ book. ********
579
+ LET AllBagsOfSubset ==
580
+ (******************************************************************)
581
+ (* The set of all bags SB such that BagToSet(SB) \\subseteq *)
582
+ (* BagToSet(B). *)
583
+ (******************************************************************)
584
+ UNION {[SB -> {n \\in Nat : n > 0}] : SB \\in SUBSET BagToSet(B)}
585
+ IN {SB \\in AllBagsOfSubset : \\A e \\in DOMAIN SB : SB[e] \\leq B[e]}
586
+ ***************************************************************************)
587
+
588
+ BagOfAll(F(_), B) ==
589
+ (************************************************************************)
590
+ (* The bag analog of the set {F(x) : x \\in B} for a set B. It's the bag *)
591
+ (* that contains, for each element e of B, one copy of F(e) for every *)
592
+ (* copy of e in B. This defines a bag iff, for any value v, the set of *)
593
+ (* e in B such that F(e) = v is finite. *)
594
+ (************************************************************************)
595
+ [e \\in {F(d) : d \\in BagToSet(B)} |->
596
+ Sum( [d \\in BagToSet(B) |-> IF F(d) = e THEN B[d] ELSE 0] ) ]
597
+
598
+ BagCardinality(B) ==
599
+ (************************************************************************)
600
+ (* If B is a finite bag (one such that BagToSet(B) is a finite set), *)
601
+ (* then this is its cardinality (the total number of copies of elements *)
602
+ (* in B). Its value is unspecified if B is infinite. *)
603
+ (************************************************************************)
604
+ Sum(B)
605
+
606
+ CopiesIn(e, B) ==
607
+ (************************************************************************)
608
+ (* If B is a bag, then CopiesIn(e, B) is the number of copies of e in *)
609
+ (* B. If ~BagIn(e, B), then CopiesIn(e, B) = 0. *)
610
+ (************************************************************************)
611
+ IF BagIn(e, B) THEN B[e] ELSE 0
612
+ =============================================================================
613
+
614
+ (* Last modified on Fri 26 Jan 2007 at 8:45:03 PST by lamport *)
615
+
616
+ 6 Apr 99 : Modified version for standard module set
617
+ 7 Dec 98 : Corrected error found by Stephan Merz.
618
+ 6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
619
+ 5 Dec 98 : Initial version.
620
+ `,Gm=/* @__PURE__ */ new Map([[`Bags`,Wm],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
621
+ (***************************************************************************)
622
+ (* The two definitions in this standard module are overridden by TLC in *)
623
+ (* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
624
+ (* the Java method with the same name. *)
625
+ (***************************************************************************)
626
+ LOCAL INSTANCE Naturals
627
+ LOCAL INSTANCE Sequences
628
+ (*************************************************************************)
629
+ (* Imports the definitions from Naturals and Sequences, but doesn't *)
630
+ (* export them. *)
631
+ (*************************************************************************)
632
+
633
+ IsFiniteSet(S) ==
634
+ (*************************************************************************)
635
+ (* A set S is finite iff there is a finite sequence containing all its *)
636
+ (* elements. *)
637
+ (*************************************************************************)
638
+ \\E seq \\in Seq(S) : \\A s \\in S : \\E n \\in 1..Len(seq) : seq[n] = s
639
+
640
+ Cardinality(S) ==
641
+ (*************************************************************************)
642
+ (* Cardinality is defined only for finite sets. *)
643
+ (*************************************************************************)
644
+ LET CS[T \\in SUBSET S] == IF T = {} THEN 0
645
+ ELSE 1 + CS[T \\ {CHOOSE x : x \\in T}]
646
+ IN CS[S]
647
+ =============================================================================
648
+ `],[`Integers`,`-------------------------------- MODULE Integers ----------------------------
649
+ (***************************************************************************)
650
+ (* This module provides dummy definitions of the operators that are *)
651
+ (* defined by the real Integers module. It is expected that any tool will *)
652
+ (* provide its own implementations of these operators. See the book *)
653
+ (* "Specifying Systems" for the real Integers module. *)
654
+ (***************************************************************************)
655
+ (***************************************************************************)
656
+ (* The two definitions here and the definitions imported from the Naturals *)
657
+ (* module are overridden by TLC in the Java class tlc2.module.Integers. *)
658
+ (* Each operator is overridden by the Java method with the same name, *)
659
+ (* except that the mappings for the prefix - operator and the TLA+ infix *)
660
+ (* operators are defined in the static block at the beginning of the Java *)
661
+ (* class. *)
662
+ (***************************************************************************)
663
+ EXTENDS Naturals
664
+
665
+ Int == { }
666
+ (***************************************************************************)
667
+ (* This defines the prefix - operator. *)
668
+ (***************************************************************************)
669
+ -. a == 0 - a
670
+ =============================================================================
671
+ `],[`Json`,`-------------------------------- MODULE Json --------------------------------
672
+
673
+ LOCAL INSTANCE Sequences
674
+ LOCAL INSTANCE FiniteSets
675
+ LOCAL INSTANCE TLC
676
+ (*************************************************************************)
677
+ (* Imports the definitions from the modules, but doesn't export them. *)
678
+ (*************************************************************************)
679
+
680
+ -----------------------------------------------------------------------------
681
+
682
+ LOCAL IsSequence(F, D) == TRUE \\/ FALSE
683
+
684
+ LOCAL ToJsonKeyValue(F, d) ==
685
+ ToString(ToString(d)) \\o ":" \\o ToString(F[d])
686
+
687
+ RECURSIVE ToJsonObjectString(_,_)
688
+ LOCAL ToJsonObjectString(F, D) == \\* LOCAL just a hint for humans.
689
+ LET d == CHOOSE d \\in D: TRUE
690
+ IN IF D = DOMAIN F
691
+ THEN "{" \\o ToJsonKeyValue(F, d) \\o IF D \\ {d} = {}
692
+ THEN "}"
693
+ ELSE ToJsonObjectString(F, D \\ {d})
694
+ ELSE ", " \\o ToJsonKeyValue(F, d) \\o IF D \\ {d} = {}
695
+ THEN "}"
696
+ ELSE ToJsonObjectString(F, D \\ {d})
697
+
698
+ RECURSIVE ToJsonArrayString(_,_)
699
+ LOCAL ToJsonArrayString(F, D) == \\* LOCAL just a hint for humans.
700
+ LET d == CHOOSE d \\in D: TRUE
701
+ IN IF D = DOMAIN F
702
+ THEN "[" \\o ToString(F[d]) \\o IF D \\ {d} = {}
703
+ THEN "]"
704
+ ELSE ToJsonArrayString(F, D \\ {d})
705
+ ELSE ", " \\o ToString(F[d]) \\o IF D \\ {d} = {}
706
+ THEN "]"
707
+ ELSE ToJsonArrayString(F, D \\ {d})
708
+
709
+ RECURSIVE ToJsonString(_,_)
710
+ LOCAL ToJsonString(F, D) == \\* LOCAL just a hint for humans.
711
+ IF IsFiniteSet(F) \\/ IsSequence(F, D) THEN
712
+ ToJsonArrayString(F, D)
713
+ ELSE
714
+ ToJsonObjectString(F, D)
715
+
716
+ ToJson(value) ==
717
+ (*************************************************************************)
718
+ (* Converts the given value to a JSON string. Records are converted to *)
719
+ (* JSON objects, tuples to JSON arrays, and scalar values as their JSON *)
720
+ (* representation. *)
721
+ (*************************************************************************)
722
+ IF DOMAIN value = {} THEN
723
+ "{}"
724
+ ELSE
725
+ ToJsonString(value, DOMAIN value)
726
+
727
+ ToJsonArray(value) ==
728
+ (*************************************************************************)
729
+ (* Converts the given tuple value to a JSON array. *)
730
+ (*************************************************************************)
731
+ IF DOMAIN value = {} THEN
732
+ "[]"
733
+ ELSE
734
+ ToJsonArrayString(value, DOMAIN value)
735
+
736
+ ToJsonObject(value) ==
737
+ (*************************************************************************)
738
+ (* Converts the given tuple value to a JSON object. *)
739
+ (*************************************************************************)
740
+ IF DOMAIN value = {} THEN
741
+ "{}"
742
+ ELSE
743
+ ToJsonObjectString(value, DOMAIN value)
744
+
745
+ JsonSerialize(absoluteFilename, value) ==
746
+ (*************************************************************************)
747
+ (* Serializes a tuple of values to the given file as (plain) JSON. *)
748
+ (* Records will be serialized as a JSON objects, and tuples as arrays. *)
749
+ (*************************************************************************)
750
+ TRUE
751
+
752
+ JsonDeserialize(absoluteFilename) ==
753
+ (*************************************************************************)
754
+ (* Deserializes JSON values from the given file. JSON objects will be *)
755
+ (* deserialized to records, and arrays will be deserialized to tuples. *)
756
+ (*************************************************************************)
757
+ CHOOSE val : TRUE
758
+
759
+ ndJsonSerialize(absoluteFilename, value) ==
760
+ (*************************************************************************)
761
+ (* Serializes a tuple of values to the given file as newline delimited *)
762
+ (* JSON. Records will be serialized as a JSON objects, and tuples as *)
763
+ (* arrays. *)
764
+ (*************************************************************************)
765
+ TRUE
766
+
767
+ ndJsonDeserialize(absoluteFilename) ==
768
+ (*************************************************************************)
769
+ (* Deserializes JSON values from the given file. JSON values must be *)
770
+ (* separated by newlines. JSON objects will be deserialized to records, *)
771
+ (* and arrays will be deserialized to tuples. *)
772
+ (*************************************************************************)
773
+ CHOOSE val : TRUE
774
+
775
+ =============================================================================
776
+ `],[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
777
+ (***************************************************************************)
778
+ (* This module provides dummy definitions of the operators that are *)
779
+ (* defined by the real Naturals module. It is expected that any tool will *)
780
+ (* provide its own implementations of these operators. See the book *)
781
+ (* "Specifying Systems" for the real Naturals module. *)
782
+ (***************************************************************************)
783
+ (***************************************************************************)
784
+ (* These definitions are all overridden by TLC in the Java class *)
785
+ (* tlc2.module.Naturals. Each operator is overridden by the Java method *)
786
+ (* with the same name, except that the mapping for TLA+ infix operators *)
787
+ (* is defined in the static block at the beginning of the Java class. *)
788
+ (***************************************************************************)
789
+ Nat == { }
790
+ a+b == {a, b}
791
+
792
+ a-b == CHOOSE n : b + n = a
793
+ a*b == TRUE
794
+ a^b == {a, b}
795
+ a<b == a = b
796
+ a>b == a = b
797
+ a \\leq b == a = b
798
+ a \\geq b == a = b
799
+ (***************************************************************************)
800
+ (* a .. b is defined to equal {i \\in Int : (a \\leq i) /\\ (i \\leq b)} *)
801
+ (* where Int is the set of all integers. *)
802
+ (* *)
803
+ (* a % b and a \\div b are defined so that for any integers a and b *)
804
+ (* with b > 0 , the following formula is true: *)
805
+ (* *)
806
+ (* a = b * (a \\div b) + (a % b) *)
807
+ (***************************************************************************)
808
+ a % b == {a, b}
809
+ a \\div b == {a, b}
810
+ a .. b == {a, b}
811
+ =============================================================================
812
+ `],[`Randomization`,`-------------------------- MODULE Randomization------------------------------
813
+ (***************************************************************************)
814
+ (* This module defines operators for choosing pseudo-random subsets of a *)
815
+ (* set. It is useful for inductive invariance checking, where the *)
816
+ (* operators appear only in the initial predicate. However, it may have *)
817
+ (* other uses. *)
818
+ (* *)
819
+ (* In breadth-first search model checking, the pseudo-random choices made *)
820
+ (* when computing possible steps satisfying the next-state relation are *)
821
+ (* determined by the first state of the step. Thus, the choices made for *)
822
+ (* a particular state will be the same in successive runs of TLC. This is *)
823
+ (* done to permit TLC to generate an error trace if an error is found. *)
824
+ (* This applies only when TLC is run in breadth-first search mode. In *)
825
+ (* particular, the choices made in simulation mode are independent of the *)
826
+ (* state for which they are made. *)
827
+ (***************************************************************************)
828
+
829
+ (***************************************************************************)
830
+ (* Except for TestRandomSetOfSubsets, all these definitions are overridden *)
831
+ (* by TLC in the Java class tlc2.module.Randomization. Each operator is *)
832
+ (* overridden by the Java method with the same name. *)
833
+ (***************************************************************************)
834
+ LOCAL INSTANCE Naturals
835
+ LOCAL INSTANCE FiniteSets
836
+
837
+ (***************************************************************************)
838
+ (* RandomSubset(k, S) equals a randomly chosen subset of S containing k *)
839
+ (* elements, where 0 < k < Cardinality(S). *)
840
+ (***************************************************************************)
841
+ RandomSubset(k, S) == CHOOSE T \\in SUBSET S : Cardinality(T) = k
842
+
843
+ (***************************************************************************)
844
+ (* RandomSetOfSubsets(k, n, S) equals a pseudo-randomly chosen set of *)
845
+ (* subsets of S -- that is, a randomly chosen subset of SUBSET S . Thus, *)
846
+ (* each element T of this set is a subset of S. Each such T is chosen so *)
847
+ (* that each element of S has a probability n / Cardinality(S) of being in *)
848
+ (* T. Thus, the average number of elements in each chosen subset T is n. *)
849
+ (* The set RandomSetOfSubsets(k, n, S) is obtained by making k such *)
850
+ (* choices of T . Because this can produce duplicate choices, the number *)
851
+ (* of elements T in this set may be less than k. The average number of *)
852
+ (* elements in RandomSetOfSubsets(k, n, S) seems to be difficult to *)
853
+ (* compute in general. However, there is very little variation in the *)
854
+ (* actual number of elements in the chosen set for fixed values of k, n, *)
855
+ (* and Cardinality(S). You can therefore use the operator *)
856
+ (* TestRandomSetOfSubsets defined below to find out approximately how *)
857
+ (* close to k the cardinality of the chosen set of subsets is. *)
858
+ (***************************************************************************)
859
+ RandomSetOfSubsets(k, n, S) == CHOOSE T \\in SUBSET SUBSET S :
860
+ Cardinality(T) \\leq k
861
+
862
+ (***************************************************************************)
863
+ (* The value of TestRandomSetOfSubsets(k, n, S) is a sequence of five *)
864
+ (* values that are the cardinality of the set of subsets produced by five *)
865
+ (* executions of RandomSetOfSubsets(k, n, S). For constant values of k, *)
866
+ (* n, and S, you can enter TestRandomSetOfSubsets(k, n, S) in the Evaluate *)
867
+ (* Constant Expression section of a TLC model in the TLA+ Toolbox. *)
868
+ (* Running TLC will then tell you the approximate number of elements in *)
869
+ (* the set of subsets produced by RandomSetOfSubsets for these parameters. *)
870
+ (* You can then choose k to obtain a set of the desired size. *)
871
+ (***************************************************************************)
872
+ TestRandomSetOfSubsets(k, n, S) ==
873
+ [i \\in 1..5 |-> Cardinality(RandomSetOfSubsets(k, n, S))]
874
+
875
+ =============================================================================
876
+ `],[`RealTime`,`${Bd}\n`],[`Reals`,`${zd}\n`],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
877
+ (***************************************************************************)
878
+ (* Defines operators on finite sequences, where a sequence of length n is *)
879
+ (* represented as a function whose domain is the set 1..n (the set *)
880
+ (* {1, 2, ... , n}). This is also how TLA+ defines an n-tuple, so *)
881
+ (* tuples are sequences. *)
882
+ (***************************************************************************)
883
+ (***************************************************************************)
884
+ (* These definitions are all overridden by TLC in the Java class *)
885
+ (* tlc2.module.Sequences. Each operator is overridden by the Java method *)
886
+ (* with the same name, except that the mapping for TLA+ infix operators *)
887
+ (* is defined in the static block at the beginning of the Java class. *)
888
+ (***************************************************************************)
889
+
890
+ LOCAL INSTANCE Naturals
891
+ (*************************************************************************)
892
+ (* Imports the definitions from Naturals, but doesn't export them. *)
893
+ (*************************************************************************)
894
+
895
+ Seq(S) == UNION {[1..n -> S] : n \\in Nat}
896
+ (*************************************************************************)
897
+ (* The set of all sequences of elements in S. *)
898
+ (*************************************************************************)
899
+
900
+ Len(s) == CHOOSE n \\in Nat : DOMAIN s = 1..n
901
+ (*************************************************************************)
902
+ (* The length of sequence s. *)
903
+ (*************************************************************************)
904
+
905
+ s \\o t == [i \\in 1..(Len(s) + Len(t)) |-> IF i \\leq Len(s) THEN s[i]
906
+ ELSE t[i-Len(s)]]
907
+ (*************************************************************************)
908
+ (* The sequence obtained by concatenating sequences s and t. *)
909
+ (*************************************************************************)
910
+
911
+ Append(s, e) == s \\o <<e>>
912
+ (**************************************************************************)
913
+ (* The sequence obtained by appending element e to the end of sequence s. *)
914
+ (**************************************************************************)
915
+
916
+ Head(s) == s[1]
917
+ Tail(s) == CASE s # << >> -> [i \\in 1..(Len(s)-1) |-> s[i+1]]
918
+ (*************************************************************************)
919
+ (* The usual head (first) and tail (rest) operators. (Definition of Tail *)
920
+ (* changed on 4 Jun 2013 because original defined Tail(<< >>) = << >> . *)
921
+ (*************************************************************************)
922
+
923
+ SubSeq(s, m, n) == [i \\in 1..(1+n-m) |-> s[i+m-1]]
924
+ (*************************************************************************)
925
+ (* The sequence <<s[m], s[m+1], ... , s[n]>>. *)
926
+ (*************************************************************************)
927
+
928
+ SelectSeq(s, Test(_)) ==
929
+ (*************************************************************************)
930
+ (* The subsequence of s consisting of all elements s[i] such that *)
931
+ (* Test(s[i]) is true. *)
932
+ (*************************************************************************)
933
+ LET F[i \\in 0..Len(s)] ==
934
+ (*******************************************************************)
935
+ (* F[i] equals SelectSeq(SubSeq(s, 1, i), Test) . *)
936
+ (*******************************************************************)
937
+ IF i = 0 THEN << >>
938
+ ELSE IF Test(s[i]) THEN Append(F[i-1], s[i])
939
+ ELSE F[i-1]
940
+ IN F[Len(s)]
941
+ =============================================================================
942
+ `],[`TLC`,`------------------------------- MODULE TLC ----------------------------------
943
+ (***************************************************************************)
944
+ (* This is a standard module for use with the TLC model checker. *)
945
+ (* Operators not explained by comments here are explained in the book *)
946
+ (* "Specifying Systems". *)
947
+ (* *)
948
+ (* The definitions of all the operators in this module are overridden by *)
949
+ (* TLC with methods defined in the Java class tlc2.module.TLC. Each *)
950
+ (* definition is overridden with the method of the same name, except that *)
951
+ (* the mapping from infix operators to Java methods is specified in the *)
952
+ (* static block at the beginning of the Java class. *)
953
+ (***************************************************************************)
954
+ LOCAL INSTANCE Naturals
955
+ LOCAL INSTANCE Sequences
956
+ LOCAL INSTANCE FiniteSets
957
+ -----------------------------------------------------------------------------
958
+ Print(out, val) == val
959
+ PrintT(out) == TRUE
960
+ (************************************************************************)
961
+ (* This expression equals TRUE, but evaluating it causes TLC to print *)
962
+ (* the value of out. *)
963
+ (************************************************************************)
964
+
965
+ Assert(val, out) == IF val = TRUE THEN TRUE
966
+ ELSE CHOOSE v : TRUE
967
+ JavaTime == CHOOSE n : n \\in Nat
968
+
969
+ (***************************************************************************)
970
+ (* TLC can read and set a special list of values while evaluating *)
971
+ (* expressions using the operators TLCSet and TLCGet. When TLC evaluates *)
972
+ (* TLCSet(i,v), for any positive integer i and arbitrary value v, it *)
973
+ (* obtains the value TRUE and sets element number i of the list to v. *)
974
+ (* When TLC evaluates TLCGet(i), the value it obtains is the current value *)
975
+ (* of the element number i of this list. *)
976
+ (* *)
977
+ (* One use of this feature is to check TLC's progress during long *)
978
+ (* computations. For example, suppose TLC is evaluating a formula *)
979
+ (* \\A x \\in S : P where S is a large set, so it evaluates P many times. *)
980
+ (* You can use TLCGet, TLCSet, and Print to print something after every *)
981
+ (* 1000 times TLC evaluates P. *)
982
+ (* *)
983
+ (* As explained in the description of the TLCEval operator below, you may *)
984
+ (* also want to use this feature to count how many times TLC is evaluating *)
985
+ (* an expression e. To use value number i as the counter, just replace e *)
986
+ (* by *)
987
+ (* *)
988
+ (* IF TLCSet(i, TLCGet(i)+1) THEN e ELSE 42 *)
989
+ (* *)
990
+ (* (The ELSE expression is never evaluated.) *)
991
+ (* *)
992
+ (* TLCGet accepts some pre-defined string values to query TLC state. The *)
993
+ (* values are as follows: *)
994
+ (* *)
995
+ (* - TLCGet("distinct") evaluates to the total number of distinct states *)
996
+ (* found by TLC so far, globally. *)
997
+ (* - TLCGet("queue") evaluates to the number of states currently in the *)
998
+ (* queue to be checked. *)
999
+ (* - TLCGet("duration") evaluates to the number of seconds elapsed since *)
1000
+ (* model checking began. *)
1001
+ (* - TLCGet("diameter") evaluates to the length of the longest behavior *)
1002
+ (* found by TLC so far, globally (equals one in the initial predicate).*)
1003
+ (* - TLCGet("level") is the length of the current behavior (equals zero *)
1004
+ (* in the evaluation of the initial predicate). *)
1005
+ (* *)
1006
+ (* For reasons of efficiency, TLCGet and TLCSet behave somewhat strangely *)
1007
+ (* when TLC is run with multiple worker threads. Each worker thread *)
1008
+ (* maintains its own individual copy of the list of values on which it *)
1009
+ (* evaluates TLCGet and TLCSet. The worker threads are activated only *)
1010
+ (* after the computation and invariance checking of the initial states. *)
1011
+ (* Before then, evaluating TLCSet(i,v) sets the element i of the list *)
1012
+ (* maintained by all threads. Thus, the lists of all the worker threads *)
1013
+ (* can be initialized by putting the appropriate TLCSet expression in an *)
1014
+ (* ASSUME expression or in the initial predicate. *)
1015
+ (***************************************************************************)
1016
+ TLCGet(i) == CHOOSE n : TRUE
1017
+ TLCSet(i, v) == TRUE
1018
+ -----------------------------------------------------------------------------
1019
+ d :> e == [x \\in {d} |-> e]
1020
+ f @@ g == [x \\in (DOMAIN f) \\cup (DOMAIN g) |->
1021
+ IF x \\in DOMAIN f THEN f[x] ELSE g[x]]
1022
+ Permutations(S) ==
1023
+ {f \\in [S -> S] : \\A w \\in S : \\E v \\in S : f[v]=w}
1024
+ -----------------------------------------------------------------------------
1025
+ (***************************************************************************)
1026
+ (* In the following definition, we use Op as the formal parameter rather *)
1027
+ (* than \\prec because TLC Version 1 can't handle infix formal parameters. *)
1028
+ (***************************************************************************)
1029
+ SortSeq(s, Op(_, _)) ==
1030
+ LET Perm == CHOOSE p \\in Permutations(1 .. Len(s)) :
1031
+ \\A i, j \\in 1..Len(s) :
1032
+ (i < j) => Op(s[p[i]], s[p[j]]) \\/ (s[p[i]] = s[p[j]])
1033
+ IN [i \\in 1..Len(s) |-> s[Perm[i]]]
1034
+
1035
+ (***************************************************************************)
1036
+ (* TLC evaluates RandomElement(S) to be a pseudo-randomly chosen element *)
1037
+ (* of the set S, where each element of S is chosen with equal probability. *)
1038
+ (* This feature was added to enable the computation of statistical *)
1039
+ (* properties of a specification's executions by running TLC in simulation *)
1040
+ (* mode. We don't know if anyone has ever done this. *)
1041
+ (* *)
1042
+ (* In breadth-first search model checking, the pseudo-random choices made *)
1043
+ (* when computing possible steps satisfying the next-state relation are *)
1044
+ (* determined by the first state of the step. Thus, the choices made for *)
1045
+ (* a particular state will be the same in successive runs of TLC. This is *)
1046
+ (* done to permit TLC to generate an error trace if an error is found. *)
1047
+ (* This applies only when TLC is run in breadth-first search mode. The *)
1048
+ (* random choices made in simulation mode are independent of the state for *)
1049
+ (* which they are made. *)
1050
+ (***************************************************************************)
1051
+ RandomElement(s) == CHOOSE x \\in s : TRUE
1052
+
1053
+ (***************************************************************************)
1054
+ (* The constant value Any has the special property that, for any value v, *)
1055
+ (* TLC evaluates the expression v \\in Any to equal TRUE. The special *)
1056
+ (* value Any was introduced because TLA+ originally allowed only functions *)
1057
+ (* to be defined recursively, and it was sometimes convenient to define a *)
1058
+ (* function with domain Any. It is retained for backwards compatibility. *)
1059
+ (***************************************************************************)
1060
+ Any == CHOOSE x : TRUE
1061
+
1062
+ ToString(v) == (CHOOSE x \\in [a : v, b : STRING] : TRUE).b
1063
+ (************************************************************************)
1064
+ (* This equals a string that is the TLA+ representation of the value *)
1065
+ (* that TLC obtains by evaluating v. *)
1066
+ (************************************************************************)
1067
+
1068
+ (***************************************************************************)
1069
+ (* TLC often uses lazy evaluation. For example, it may not enumerate the *)
1070
+ (* elements of a set of the form {x \\in T : P(x)} unless it has to; and it *)
1071
+ (* doesn't have to if it only needs to check if an element e is in that *)
1072
+ (* set. (TLC can do that by evaluating x \\in T and P(e).) TLC uses *)
1073
+ (* heuristics to determine when it should completely evaluate an *)
1074
+ (* expression. Those heuristics work well most of the time. However, *)
1075
+ (* sometimes lazy evaluation can result in the expression ultimately being *)
1076
+ (* evaluated multiple times instead of just once. This can especially be *)
1077
+ (* a problem when evaluating a recursively defined operator. You can get *)
1078
+ (* TLC to fully evaluate an expression exp and not use lazy evaluation by *)
1079
+ (* replacing exp with TLCEval(exp). *)
1080
+ (* *)
1081
+ (* If TLC is taking a long time to evaluate something, you can check if *)
1082
+ (* lazy evaluation is the source of the problem by using the TLCSet and *)
1083
+ (* TLCGet operators to count how many times expressions are being *)
1084
+ (* evaluated. *)
1085
+ (***************************************************************************)
1086
+ TLCEval(v) == v
1087
+
1088
+ =============================================================================`],[`TLCExt`,`------------------------------- MODULE TLCExt -------------------------------
1089
+
1090
+ LOCAL INSTANCE TLC
1091
+ LOCAL INSTANCE Integers
1092
+ (*************************************************************************)
1093
+ (* Imports the definitions from the modules, but doesn't export them. *)
1094
+ (*************************************************************************)
1095
+
1096
+ -----------------------------------------------------------------------------
1097
+
1098
+ \\* AssertEq(a, b) is logically equivalent to the expression 'a = b'. If a and b are not equal,
1099
+ \\* however, AssertEq(a, b) will print out the values of 'a' and 'b'. If the two values are equal,
1100
+ \\* nothing will be printed.
1101
+ AssertEq(a, b) ==
1102
+ IF a # b THEN
1103
+ /\\ PrintT("Assertion failed")
1104
+ /\\ PrintT(a)
1105
+ /\\ PrintT(b)
1106
+ /\\ a = b
1107
+ ELSE a = b
1108
+
1109
+
1110
+ AssertError(err, exp) ==
1111
+ LET FailsEval(e) == CHOOSE b \\in BOOLEAN : TRUE \\* Expression failed to evaluate.
1112
+ TLCError == CHOOSE s \\in STRING : TRUE \\* TLC error string.
1113
+ IN IF FailsEval(exp) THEN Assert(err = TLCError, TLCError) ELSE TRUE
1114
+
1115
+ -----------------------------------------------------------------------------
1116
+
1117
+ TLCGetOrDefault(key, defaultVal) ==
1118
+ CHOOSE n : TRUE
1119
+
1120
+ TLCGetAndSet(key, Op(_,_), val, defaultVal) ==
1121
+ LET oldVal == TLCGetOrDefault(key, defaultVal)
1122
+ IN CHOOSE v \\in {oldVal} : TLCSet(key, Op(oldVal, val))
1123
+
1124
+ -----------------------------------------------------------------------------
1125
+
1126
+ (* HERE BE DRAGONS! The operators below are experimental! You will probably not need them! *)
1127
+
1128
+ Trace ==
1129
+ (******************************************************************************)
1130
+ (* The sequence of states (represented as a record whose DOMAIN is the set of *)
1131
+ (* a spec's variables) from an initial state to the current state. In other *)
1132
+ (* words, a prefix - of a behavior - ending with the current state. A way to *)
1133
+ (* think about this operator is to see it as an implicit history variable *)
1134
+ (* that does not have to be explicitly specified at the level of the spec. *)
1135
+ (* *)
1136
+ (* Note that op is incompatible with TLC!RandomElement and Randomization (see *)
1137
+ (* tlc2.tool.TLCTrace.getTrace(LongVec)) and will cause TLC to crash. This *)
1138
+ (* technical limitation could be removed though. *)
1139
+ (* *)
1140
+ (* Beware that Trace is prohibitively expensive when evaluated as part of *)
1141
+ (* the next-state relation, invariants, properties, or any constraint in *)
1142
+ (* model-checking mode. Consider using a real history variable instead. *)
1143
+ (******************************************************************************)
1144
+ TRUE \\* TODO
1145
+
1146
+ -----------------------------------------------------------------------------
1147
+
1148
+ CounterExample ==
1149
+ (****************************************************************************)
1150
+ (* In the scope of POSTCONDITION, the operator CounterExample is equivalent *)
1151
+ (* to a (directed) graph represented as [state: States, action: Actions] *)
1152
+ (* with *)
1153
+ (* States \\subseteq [ Variables -> Values ] *)
1154
+ (* and *)
1155
+ (* Actions \\subseteq *)
1156
+ (* (CounterExample.state \\X Action \\X CounterExample.state). *)
1157
+ (* If TLC found no violations, then CounterExample.states equals {} and *)
1158
+ (* CounterExample.actions equals {}. If only initial state violates a *)
1159
+ (* (safety) property, CounterExample.state is a set of those states, and *)
1160
+ (* CounterExample.actions = {}. *)
1161
+ (****************************************************************************)
1162
+ TRUE
1163
+
1164
+ ToTrace(CE) ==
1165
+ (*
1166
+ This definition is implemented by the TLCExt#toTrace Java module override. It
1167
+ is commented because FiniteSetsExt is part of the CommunityModules, but not
1168
+ tla2tools.
1169
+
1170
+ LET F == INSTANCE FiniteSetsExt
1171
+ IN F!FoldSet(LAMBDA a, acc: acc @@ [n \\in {a[1]} |-> a[2]], [n \\in {} |-> n], CounterExample.state)
1172
+
1173
+ *)
1174
+ TRUE
1175
+
1176
+ -----------------------------------------------------------------------------
1177
+
1178
+ TLCModelValue(str) ==
1179
+ (******************************************************************************)
1180
+ (* A model value is an unspecified value that TLC considers to be unequal to *)
1181
+ (* any value that you can express in TLA+. *)
1182
+ (* *)
1183
+ (* In most cases, TLC model values can and should be declared via the TLC *)
1184
+ (* config file. However, for large sets of model values, it can become *)
1185
+ (* tedious to enumerate them explicitly. Large sets of model values usually *)
1186
+ (* appear when simulating TLA+ specs with TLC. The following example defines *)
1187
+ (* a set of 32 model values: *)
1188
+ (* *)
1189
+ (* SetOfModelValues == {TLCModelValue("T_MV" \\o ToString(i)) : i \\in 1..32} *)
1190
+ (* *)
1191
+ (* As a matter of fact, the example defines a set of "typed" model values: *)
1192
+ (* TLC considers a typed model value to be unequal to any other model value *)
1193
+ (* of the same type. However, it produces an error when evaluating an *)
1194
+ (* expression requires it to determine if a typed model value is equal to any *)
1195
+ (* value other than a model value of the same type or an ordinary model *)
1196
+ (* value. *)
1197
+ (* *)
1198
+ (* A model-value type consists of a single letter, so there are 52 different *)
1199
+ (* types because a and A are different types. (TLC actually accepts *)
1200
+ (* digits and underscore as types; don't use them.) A model value has type *)
1201
+ (* T if and only if its name begins with the two characters T_ . *)
1202
+ (* *)
1203
+ (* TLCModelValue may only appear in constant definitions! Expect bogus *)
1204
+ (* behavior if TLCModelValue appears in the behavior spec, constraints, *)
1205
+ (* invariants, or properties. *)
1206
+ (******************************************************************************)
1207
+ CHOOSE v: ToString(v) = str
1208
+
1209
+ TLCDefer(expression) ==
1210
+ (******************************************************************************)
1211
+ (* Defer evaluation of expression to some later time or never. *)
1212
+ (* *)
1213
+ (* For TLC's simulation mode, later is defined as the point of time when *)
1214
+ (* simulation has chosen a successor state to extend the prefix of the *)
1215
+ (* current behavior. *)
1216
+ (* *)
1217
+ (* A use case is TLCDefer(TLCSet(42, someVal)), which sets someVal only *)
1218
+ (* for the states of the behavior and not the set of all successor states *)
1219
+ (* of all states in the behavior. *)
1220
+ (******************************************************************************)
1221
+ TRUE
1222
+
1223
+ -----------------------------------------------------------------------------
1224
+
1225
+ TLCNoOp(val) ==
1226
+ (******************************************************************************)
1227
+ (* No-operation operator (does nothing). Only useful to debug TLC's *)
1228
+ (* evaluator that is written in Java: Insert TLCNoOp into the expression *)
1229
+ (* whose evaluation you wish to debug and set a breakpoint in this *)
1230
+ (* operator's Java module override TLCExt#tlcNoOp in TLCExt.java. *)
1231
+ (******************************************************************************)
1232
+ val
1233
+
1234
+
1235
+ PickSuccessor(exp) ==
1236
+ (******************************************************************************)
1237
+ (* When set as an action constraint in the configuration file, interactively *)
1238
+ (* pick successor states during state exploration, iff the expression exp *)
1239
+ (* evaluates to FALSE. To always pick successor states manually, use *)
1240
+ (* PickSuccessor(FALSE). To pick successor states when the current prefix of *)
1241
+ (* behaviors exceeds 22 states, use PickSuccessor(TLCGet("level") < 23). *)
1242
+ (* Evaluates to TRUE when evaluated in the context of a constant- or *)
1243
+ (* state-level formula. Also evaluates to TRUE if PickSuccessor appears as *)
1244
+ (* part of the next-state relation and the successor state has not been *)
1245
+ (* fully determined yet. *)
1246
+ (******************************************************************************)
1247
+ IF (exp)
1248
+ THEN TRUE
1249
+ ELSE CHOOSE bool \\in BOOLEAN : TRUE
1250
+
1251
+ -----------------------------------------------------------------------------
1252
+
1253
+ TLCCache(expression, closure) ==
1254
+ (******************************************************************************)
1255
+ (* Equals the value that an earlier evaluation of the expression evaluated to *)
1256
+ (* iff the closure of the earlier evaluation and this evaluation are equal. *)
1257
+ (* *)
1258
+ (* Works in constant and state-level contexts. *)
1259
+ (******************************************************************************)
1260
+ expression
1261
+
1262
+ TLCFP(var) ==
1263
+ (******************************************************************************)
1264
+ (* Equals the value that TLC gives to the given input when the value is *)
1265
+ (* being fingerprinted. *)
1266
+ (* Implementation note: Equals the lower 32 bits until TLC supports longs *)
1267
+ (******************************************************************************)
1268
+ CHOOSE i \\in Int: TRUE
1269
+
1270
+ -----------------------------------------------------------------------------
1271
+
1272
+ TLCEvalDefinition(definitionName) ==
1273
+ (******************************************************************************)
1274
+ (* Equals the value of the definition with the given name. *)
1275
+ (* Throws an error if the definition cannot be found. *)
1276
+ (******************************************************************************)
1277
+ TRUE \\* TODO
1278
+
1279
+ ============================================================================
1280
+ `],[`Toolbox`,`${Vd}\n`],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
1281
+ LOCAL INSTANCE TLC
1282
+ LOCAL INSTANCE TLCExt
1283
+ LOCAL INSTANCE GraphViz
1284
+ LOCAL INSTANCE IOUtils
1285
+ LOCAL INSTANCE Sequences
1286
+ LOCAL INSTANCE Functions
1287
+
1288
+ CONSTANT _DotTraceFile
1289
+
1290
+ _DotTrace ==
1291
+ IF CounterExample.state = {} \\/ ("console" \\in DOMAIN CounterExample /\\ CounterExample["console"] = FALSE) THEN TRUE ELSE
1292
+ /\\ LET N == CounterExample.state
1293
+ E == { <<e[1], e[3], e[2]>> : e \\in CounterExample.action }
1294
+ G == [node |-> N, edge |-> E] IN
1295
+ Serialize(DotDiGraph(G, LAMBDA v: FoldFunctionOnSet(
1296
+ LAMBDA x, y: ToString(x) \\o "\\n" \\o y, "", v[2], DOMAIN v[2]),
1297
+ LAMBDA e: e[3].name),
1298
+ _DotTraceFile,
1299
+ [
1300
+ format |-> "TXT",
1301
+ charset |-> "UTF-8",
1302
+ openOptions |-> <<"WRITE", "CREATE", "TRUNCATE_EXISTING">>
1303
+ ]
1304
+ ).exitValue = 0
1305
+ /\\ PrintT("CounterExample written: " \\o _DotTraceFile)
1306
+
1307
+ =============================================================================
1308
+ `],[`_JsonTrace`,`------------------------------- MODULE _JsonTrace -------------------------------
1309
+ LOCAL INSTANCE TLC
1310
+ LOCAL INSTANCE TLCExt
1311
+ LOCAL INSTANCE Json
1312
+ LOCAL INSTANCE Sequences
1313
+ LOCAL INSTANCE Naturals
1314
+
1315
+ CONSTANT _JsonTraceFile
1316
+
1317
+ _JsonTrace ==
1318
+ IF CounterExample.state = {} \\/ ("console" \\in DOMAIN CounterExample /\\ CounterExample["console"] = FALSE) THEN TRUE ELSE
1319
+ /\\ LET trace == ToTrace(CounterExample)
1320
+ vars == UNION { DOMAIN trace[i] : i \\in DOMAIN trace }
1321
+ IN JsonSerialize(_JsonTraceFile, [counterexample |-> CounterExample, vars |-> vars])
1322
+ /\\ PrintT("CounterExample written: " \\o _JsonTraceFile)
1323
+
1324
+ ----------------------------------------------------------------------------
1325
+ \\* Deserialize a trace created by _JsonTrace above.
1326
+
1327
+ CONSTANT _JsonTraceInputFile \\* Used by -loadTrace json
1328
+
1329
+ \\* This operator has a Java module override (tlc2.module._JsonTrace#tlcState).
1330
+ LOCAL _TLCState(level) ==
1331
+ Trace[level]
1332
+
1333
+ LOCAL _JsonTraceDump == JsonDeserialize(_JsonTraceInputFile)
1334
+
1335
+ \\* A liveness counterexample's action graph contains a closing edge that
1336
+ \\* completes the lasso. In a forward path s1->s2->...->sn every edge
1337
+ \\* satisfies target[1] > source[1]; the closing edge is the unique edge
1338
+ \\* where target[1] <= source[1] (back-to-state: <, stuttering: =).
1339
+ LOCAL _JsonTraceLassoTarget ==
1340
+ LET actions == _JsonTraceDump["counterexample"]["action"]
1341
+ IN IF \\E i \\in DOMAIN actions : actions[i][3][1] <= actions[i][1][1]
1342
+ THEN LET i == CHOOSE i \\in DOMAIN actions :
1343
+ actions[i][3][1] <= actions[i][1][1]
1344
+ IN actions[i][3][1]
1345
+ ELSE 0
1346
+
1347
+ LOCAL _JsonTraceConstraint ==
1348
+ LET level == TLCGet("level")
1349
+ \\* DOMAIN trace is meaningful only because we serialize TLA+ sets as JSON arrays. JSON has
1350
+ \\* no set type---only the world's favorite least-common-denominator of strings, numbers,
1351
+ \\* and nested lists---so on the wire every set is an ordered sequence. If that encoding
1352
+ \\* ever changed (or JSON miraculously grew a real set type), indexing states by DOMAIN
1353
+ \\* would stop matching what we dump.
1354
+ \\* Rebuilding vars likewise assumes the array order matches TLC's normalized set order from
1355
+ \\* when the trace was written; the format does not pin down a stronger invariant.
1356
+ trace == _JsonTraceDump["counterexample"]["state"]
1357
+ \\* JSON deserializes sets as tuples, so convert back to a set
1358
+ vars == {_JsonTraceDump["vars"][i] : i \\in DOMAIN _JsonTraceDump["vars"]}
1359
+ \\* For liveness properties, TLC trace dumps stop at the state *before* the
1360
+ \\* lasso is closed. When replaying such a trace, TLC may request a state with
1361
+ \\* level = Len(trace) + 1,
1362
+ \\* which does not exist in the dump. In that case, the constraint
1363
+ \\* is intentionally vacuously satisfied.
1364
+ \\* Since the names of the spec's variables are not known, Trace[level] is
1365
+ \\* used as a generic reference to the variables of the current state.
1366
+ IN level \\in DOMAIN trace =>
1367
+ \\* When loading a trace with a subset of variables, only check the variables
1368
+ \\* that exist in both the trace and the current state. This allows trace
1369
+ \\* replay with specs that have different variable sets than the original spec
1370
+ \\* that produced the trace. Another scenario is when the spec uses ALIAS
1371
+ \\* to rename, add, or remove variables.
1372
+ \\A v \\in vars \\cap (DOMAIN _TLCState(level)):
1373
+ _TLCState(level)[v] = trace[level][2][v]
1374
+
1375
+ \\* VIEW for trace replay. Includes TLCGet("level") to prevent premature
1376
+ \\* state collapsing within the trace. For liveness traces, the level
1377
+ \\* beyond the trace is mapped to the lasso target so the cycle can close.
1378
+ LOCAL _JsonTraceView ==
1379
+ LET level == TLCGet("level")
1380
+ traceLen == Len(_JsonTraceDump["counterexample"]["state"])
1381
+ lassoTarget == _JsonTraceLassoTarget
1382
+ IN IF level <= traceLen
1383
+ THEN << level, _TLCState(level) >>
1384
+ ELSE << lassoTarget, _TLCState(level) >>
1385
+
1386
+ =============================================================================
1387
+ `],[`_Possible`,`------------------------------ MODULE _Possible ------------------------------
1388
+ LOCAL INSTANCE TLC
1389
+ LOCAL INSTANCE TLCExt
1390
+ LOCAL INSTANCE Naturals
1391
+ LOCAL INSTANCE Sequences
1392
+
1393
+ LOCAL _Update(Op(_,_), val) ==
1394
+ TLCSet("s:_possible", Op(TLCGetOrDefault("s:_possible", <<>>), val))
1395
+
1396
+ _Track(expr, name) ==
1397
+ _Update(LAMBDA old, b:
1398
+ IF b
1399
+ THEN
1400
+ IF name \\in DOMAIN old
1401
+ THEN [old EXCEPT ![name] = @ + 1]
1402
+ ELSE old @@ (name :> 1)
1403
+ ELSE old @@ (name :> 0), expr)
1404
+
1405
+ LOCAL _Merge(a, b) ==
1406
+ [name \\in (DOMAIN a) \\cup (DOMAIN b) |->
1407
+ (IF name \\in DOMAIN a THEN a[name] ELSE 0) +
1408
+ (IF name \\in DOMAIN b THEN b[name] ELSE 0)]
1409
+
1410
+ _Counts == \\* Java override for efficiency
1411
+ LET workers == TLCGet("all:named")["s:_possible"]
1412
+ n == Len(workers)
1413
+ Fold[i \\in 0..n] ==
1414
+ IF i = 0 THEN <<>>
1415
+ ELSE _Merge(Fold[i-1], workers[i])
1416
+ IN Fold[n]
1417
+
1418
+ _CheckName(name) ==
1419
+ LET counts == _Counts
1420
+ IN (name \\notin DOMAIN counts \\/ counts[name] = 0)
1421
+ => (PrintT(counts) /\\ FALSE)
1422
+
1423
+ _PrintCounts == PrintT(_Counts)
1424
+
1425
+ =============================================================================
1426
+ `],[`_TLAPlusCounterExample`,`----------------------- MODULE _TLAPlusCounterExample ------------------------
1427
+ LOCAL INSTANCE IOUtils
1428
+ LOCAL INSTANCE TLC
1429
+ LOCAL INSTANCE TLCExt
1430
+ LOCAL INSTANCE Sequences
1431
+ LOCAL INSTANCE SequencesExt
1432
+
1433
+ CONSTANT _TLAPlusCounterExampleFile
1434
+
1435
+ LOCAL _TLAPlusCounterExampleModule ==
1436
+ LET ModuleName == ReplaceFirstSubSeq("", ".tla", _TLAPlusCounterExampleFile) IN
1437
+ "---- MODULE " \\o ModuleName \\o " ----\\n" \\o
1438
+ "LOCAL INSTANCE TLC\\n\\n" \\o
1439
+ "CounterExample == \\n\\t" \\o
1440
+ ToString(CounterExample) \\o
1441
+ "\\n\\n===="
1442
+
1443
+ _TLAPlusCounterExample ==
1444
+ IF CounterExample.state = {} \\/ ("console" \\in DOMAIN CounterExample /\\ CounterExample["console"] = FALSE) THEN TRUE ELSE
1445
+ /\\ Serialize(_TLAPlusCounterExampleModule,
1446
+ _TLAPlusCounterExampleFile,
1447
+ [
1448
+ format |-> "TXT",
1449
+ charset |-> "UTF-8",
1450
+ openOptions |-> <<"WRITE", "CREATE", "TRUNCATE_EXISTING">>
1451
+ ]
1452
+ ).exitValue = 0
1453
+ /\\ PrintT("CounterExample written: " \\o _TLAPlusCounterExampleFile)
1454
+
1455
+ =============================================================================
1456
+ `],[`_TLCActionTrace`,`------- MODULE _TLCActionTrace ------
1457
+ LOCAL INSTANCE IOUtils
1458
+ LOCAL INSTANCE TLC
1459
+ LOCAL INSTANCE TLCExt
1460
+ LOCAL INSTANCE Sequences
1461
+ LOCAL INSTANCE SequencesExt
1462
+ LOCAL INSTANCE FiniteSets
1463
+ LOCAL INSTANCE FiniteSetsExt
1464
+
1465
+ LOCAL _extends ==
1466
+ LET M == FoldSet(LAMBDA a, acc: acc \\cup {a[2].location.module}, {}, CounterExample.action)
1467
+ IN FoldSet(LAMBDA module, acc: acc \\o (IF acc = "" THEN "EXTENDS " ELSE ", ") \\o module, "", M)
1468
+
1469
+ LOCAL _next ==
1470
+ LET Params(r) == FoldLeft(LAMBDA acc, p: acc \\o (IF acc = "" THEN "" ELSE ", ") \\o ToString(r.context[p]),
1471
+ "", r.parameters)
1472
+ Signature(r) == IF "parameters" \\in DOMAIN r THEN r.name \\o "(" \\o Params(r) \\o ")" ELSE r.name
1473
+ ToDisjunct(i, r) == "\\\\/ " \\o ToString(i) \\o " = _idx /\\\\ " \\o Signature(r) \\o "\\n"
1474
+ IN FoldSet(LAMBDA a, acc: acc \\o ToDisjunct(a[1][1], a[2]), "", CounterExample.action)
1475
+
1476
+ CONSTANT _TLCTraceFile
1477
+
1478
+ LOCAL _TLCTraceModule ==
1479
+ LET ModuleName == ReplaceFirstSubSeq("", ".tla", _TLCTraceFile)
1480
+ L == ToString(Cardinality(CounterExample.action)) IN
1481
+ "---- MODULE " \\o ModuleName \\o " ----\\n" \\o
1482
+ \\*TODO callsignature symbols may not be defined in the same modules where the actions are defined.
1483
+ \\*TODO E.g., model values are typically defined in the MC file.
1484
+ _extends \\o "\\n\\n" \\o
1485
+ "_length == " \\o L \\o "\\n\\n" \\o
1486
+ "_next(_idx) ==\\n" \\o _next \\o "\\n" \\o
1487
+ "_actionConstraint ==\\n" \\o
1488
+ "_next(LET T == INSTANCE TLC IN T!TLCGet(\\"level\\"))\\n" \\o
1489
+ "\\n===="
1490
+
1491
+ _TLCTrace ==
1492
+ IF CounterExample.action = {} \\/ ("console" \\in DOMAIN CounterExample /\\ CounterExample["console"] = FALSE) THEN TRUE ELSE
1493
+ /\\ Serialize(_TLCTraceModule,
1494
+ _TLCTraceFile,
1495
+ [
1496
+ format |-> "TXT",
1497
+ charset |-> "UTF-8",
1498
+ openOptions |-> <<"WRITE", "CREATE", "TRUNCATE_EXISTING">>
1499
+ ]
1500
+ ).exitValue = 0
1501
+ /\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
1502
+
1503
+ ======`],[`_TLCTESpec`,`----------------------- MODULE _TLCTESpec ------------------------
1504
+ LOCAL INSTANCE IOUtils
1505
+ LOCAL INSTANCE TLC
1506
+ LOCAL INSTANCE TLCExt
1507
+ LOCAL INSTANCE Sequences
1508
+ LOCAL INSTANCE SequencesExt
1509
+ LOCAL INSTANCE FiniteSets
1510
+ LOCAL INSTANCE FiniteSetsExt
1511
+
1512
+ LOCAL _extends ==
1513
+ LET M == FoldSet(LAMBDA a, acc: acc \\cup {a[2].location.module}, {}, CounterExample.action)
1514
+ IN FoldSet(LAMBDA module, acc: acc \\o (IF acc = "" THEN "EXTENDS " ELSE ", ") \\o module, "", M)
1515
+
1516
+ LOCAL _Vars ==
1517
+ UNION { DOMAIN pair[2] : pair \\in CounterExample.state }
1518
+
1519
+ LOCAL _ToConjunt(v, prime, idx) ==
1520
+ "/\\\\ " \\o v \\o prime \\o " = Trace[" \\o idx \\o "]." \\o v \\o "\\n"
1521
+
1522
+ CONSTANT _TLCTraceFile
1523
+
1524
+ LOCAL _conjunct(prime, idx) ==
1525
+ FoldSet(LAMBDA v, acc: acc \\o _ToConjunt(v, prime, idx), "", _Vars)
1526
+
1527
+ LOCAL _subVars ==
1528
+ FoldSet(LAMBDA v, acc: acc \\o (IF acc = "" THEN "" ELSE ", ") \\o v, "", _Vars)
1529
+
1530
+ LOCAL _TLCTraceModule ==
1531
+ LET ModuleName == ReplaceFirstSubSeq("", ".tla", _TLCTraceFile) IN
1532
+ "---- MODULE " \\o ModuleName \\o " ----\\n" \\o
1533
+ \\*TODO E.g., model values are typically defined in the MC file.
1534
+ _extends \\o "\\n\\n" \\o
1535
+ "LOCAL INSTANCE TLC\\n\\n" \\o
1536
+ "Trace == \\n\\t" \\o
1537
+ ToString(ToTrace(CounterExample)) \\o
1538
+ "\\n\\n" \\o
1539
+ "_init ==\\n" \\o _conjunct("", "1") \\o
1540
+ "\\n" \\o
1541
+ "_next ==\\n\\\\E i,j \\\\in DOMAIN Trace:\\n/\\\\ i = TLCGet(\\"level\\")\\n/\\\\ j = i + 1\\n" \\o
1542
+ _conjunct("", "i") \\o _conjunct("'", "j") \\o
1543
+ "\\n(* Allow infinite stuttering to prevent deadlock on termination. *)" \\o
1544
+ "\\n_terminating ==\\n\\tUNCHANGED <<" \\o _subVars \\o ">>" \\o
1545
+ "\\n\\n_spec == \\n\\t_init /\\\\ [][_next \\\\/ _terminating]_<<" \\o _subVars \\o ">>\\n" \\o
1546
+ "\\n===="
1547
+ \\* TODO: Append in-file config here.
1548
+
1549
+ _TLCTrace ==
1550
+ IF CounterExample.state = {} \\/ ("console" \\in DOMAIN CounterExample /\\ CounterExample["console"] = FALSE) THEN TRUE ELSE
1551
+ /\\ Serialize(_TLCTraceModule,
1552
+ _TLCTraceFile,
1553
+ [
1554
+ format |-> "TXT",
1555
+ charset |-> "UTF-8",
1556
+ openOptions |-> <<"WRITE", "CREATE", "TRUNCATE_EXISTING">>
1557
+ ]
1558
+ ).exitValue = 0
1559
+ /\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
1560
+
1561
+ =============================================================================
1562
+ `],[`_TLCTrace`,`---------------------------- MODULE _TLCTrace ----------------------------
1563
+ LOCAL INSTANCE TLC
1564
+ LOCAL INSTANCE TLCExt
1565
+ LOCAL INSTANCE Sequences
1566
+ LOCAL INSTANCE Naturals
1567
+
1568
+ \\* This operator has a Java module override (tlc2.module._TLCTrace#ioDeserialize).
1569
+ LOCAL _TLCTraceDeserialize(absoluteFilename) ==
1570
+ TRUE
1571
+
1572
+ \\* This operator has a Java module override (tlc2.module._TLCTrace#ioSerialize).
1573
+ LOCAL _TLCTraceSerialize(val, absoluteFilename) ==
1574
+ TRUE
1575
+
1576
+ ----------------------------------------------------------------------------
1577
+ \\* Serialize a trace to a file.
1578
+
1579
+ CONSTANT _TLCTraceFile
1580
+
1581
+ LOCAL _TLCTrace0(verbose) ==
1582
+ IF CounterExample.state = {} \\/ ("console" \\in DOMAIN CounterExample /\\ CounterExample["console"] = FALSE) THEN TRUE ELSE
1583
+ /\\ LET trace == ToTrace(CounterExample)
1584
+ vars == UNION { DOMAIN trace[i] : i \\in DOMAIN trace }
1585
+ IN _TLCTraceSerialize([counterexample |-> CounterExample, vars |-> vars], _TLCTraceFile)
1586
+ /\\ IF verbose THEN PrintT("CounterExample written: " \\o _TLCTraceFile) ELSE TRUE
1587
+
1588
+ LOCAL _TLCTraceSilent ==
1589
+ _TLCTrace0(FALSE)
1590
+
1591
+ _TLCTrace ==
1592
+ _TLCTrace0(TRUE)
1593
+
1594
+ ----------------------------------------------------------------------------
1595
+ \\* Deserialize a trace created by _TLCTrace above.
1596
+
1597
+ CONSTANT _TLCTraceInputFile \\* Used by -loadTrace tlc
1598
+
1599
+ LOCAL _TLCTraceFileDeserialized ==
1600
+ _TLCTraceDeserialize(_TLCTraceInputFile)
1601
+
1602
+ \\* This operator has a Java module override (tlc2.module._TLCTrace#tlcState).
1603
+ LOCAL _TLCState(level) ==
1604
+ Trace[level]
1605
+
1606
+ \\* A liveness counterexample's action graph contains a closing edge that
1607
+ \\* completes the lasso. In a forward path s1->s2->...->sn every edge
1608
+ \\* satisfies target[1] > source[1]; the closing edge is the unique edge
1609
+ \\* where target[1] <= source[1] (back-to-state: <, stuttering: =).
1610
+ LOCAL _TLCTraceLassoTarget ==
1611
+ LET actions == _TLCTraceFileDeserialized["counterexample"]["action"]
1612
+ IN IF \\E e \\in actions : e[3][1] <= e[1][1]
1613
+ THEN (CHOOSE e \\in actions : e[3][1] <= e[1][1])[3][1]
1614
+ ELSE 0
1615
+
1616
+ LOCAL _TLCTraceConstraint ==
1617
+ LET level == TLCGet("level")
1618
+ dump == _TLCTraceFileDeserialized
1619
+ trace == dump["counterexample"]["state"]
1620
+ vars == dump["vars"]
1621
+ \\* The trace (CounterExample.state) is a set of <<level, state>> pairs,
1622
+ \\* not a function/sequence.
1623
+ \\* For liveness properties, TLC trace dumps stop at the state *before* the
1624
+ \\* lasso is closed. When replaying such a trace, TLC may request a state with
1625
+ \\* a level that does not exist in the dump. In that case, no pair matches and
1626
+ \\* the implication is vacuously satisfied.
1627
+ IN \\A pair \\in trace:
1628
+ pair[1] = level =>
1629
+ \\* When loading a trace with a subset of variables, only check the
1630
+ \\* variables that exist in both the trace and the current state.
1631
+ \\* This allows trace replay with specs that have different variable
1632
+ \\* sets than the original spec that produced the trace. Another
1633
+ \\* scenario is when the spec uses ALIAS to rename, add, or remove
1634
+ \\* variables.
1635
+ \\A v \\in vars \\cap DOMAIN _TLCState(level):
1636
+ _TLCState(level)[v] = pair[2][v]
1637
+
1638
+ \\* VIEW for trace replay. Includes TLCGet("level") to prevent premature
1639
+ \\* state collapsing within the trace. For liveness traces, the level
1640
+ \\* beyond the trace is mapped to the lasso target so the cycle can close.
1641
+ LOCAL _TLCTraceView ==
1642
+ LET level == TLCGet("level")
1643
+ trace == _TLCTraceFileDeserialized["counterexample"]["state"]
1644
+ lassoTarget == _TLCTraceLassoTarget
1645
+ IN IF \\E pair \\in trace : pair[1] = level
1646
+ THEN << level, _TLCState(level) >>
1647
+ ELSE << lassoTarget, _TLCState(level) >>
1648
+
1649
+ =============================================================================
1650
+ `],[`_TLCTracePlain`,`----------------------- MODULE _TLCTracePlain ------------------------
1651
+ LOCAL INSTANCE IOUtils
1652
+ LOCAL INSTANCE TLC
1653
+ LOCAL INSTANCE TLCExt
1654
+ LOCAL INSTANCE Sequences
1655
+ LOCAL INSTANCE SequencesExt
1656
+
1657
+ CONSTANT _TLCTraceFile
1658
+
1659
+ LOCAL _TLCTraceModule ==
1660
+ LET ModuleName == ReplaceFirstSubSeq("", ".tla", _TLCTraceFile) IN
1661
+ "---- MODULE " \\o ModuleName \\o " ----\\n" \\o
1662
+ "LOCAL INSTANCE TLC\\n\\n" \\o
1663
+ "Trace == \\n\\t" \\o
1664
+ ToString(ToTrace(CounterExample)) \\o
1665
+ "\\n\\n===="
1666
+
1667
+ _TLCTrace ==
1668
+ IF CounterExample.state = {} \\/ ("console" \\in DOMAIN CounterExample /\\ CounterExample["console"] = FALSE) THEN TRUE ELSE
1669
+ /\\ Serialize(_TLCTraceModule,
1670
+ _TLCTraceFile,
1671
+ [
1672
+ format |-> "TXT",
1673
+ charset |-> "UTF-8",
1674
+ openOptions |-> <<"WRITE", "CREATE", "TRUNCATE_EXISTING">>
1675
+ ]
1676
+ ).exitValue = 0
1677
+ /\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
1678
+
1679
+ =============================================================================
1680
+ `]]),Km=new Map([...[...Gm].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,Wm.replace(`
1681
+ LOCAL INSTANCE Naturals
1682
+ `,`
1683
+ EXTENDS TLC
1684
+ LOCAL INSTANCE Naturals
1685
+ `)],[`Randomization`,`-------------------------- MODULE Randomization------------------------------
1686
+ (***************************************************************************)
1687
+ (* This module defines operators for choosing pseudo-random subsets of a *)
1688
+ (* set. It is useful for inductive invariance checking, where the *)
1689
+ (* operators appear only in the initial predicate. However, it may have *)
1690
+ (* other uses. *)
1691
+ (* *)
1692
+ (* In breadth-first search model checking, the pseudo-random choices made *)
1693
+ (* when computing possible steps satisfying the next-state relation are *)
1694
+ (* determined by the first state of the step. Thus, the choices made for *)
1695
+ (* a particular state will be the same in successive runs of TLC. This is *)
1696
+ (* done to permit TLC to generate an error trace if an error is found. *)
1697
+ (* This applies only when TLC is run in breadth-first search mode. In *)
1698
+ (* particular, the choices made in simulation mode are independent of the *)
1699
+ (* state for which they are made. *)
1700
+ (***************************************************************************)
1701
+
1702
+ (***************************************************************************)
1703
+ (* Except for TestRandomSetOfSubsets, all these definitions are overridden *)
1704
+ (* by TLC in the Java class tlc2.module.Randomization. Each operator is *)
1705
+ (* overridden by the Java method with the same name. *)
1706
+ (***************************************************************************)
1707
+ LOCAL INSTANCE Naturals
1708
+ LOCAL INSTANCE FiniteSets
1709
+
1710
+ (***************************************************************************)
1711
+ (* RandomSubset(k, S) equals a randomly chosen subset of S containing k *)
1712
+ (* elements, where 0 < k < Cardinality(S). *)
1713
+ (***************************************************************************)
1714
+ RandomSubset(k, S) == CHOOSE T \\in SUBSET S : Cardinality(T) = T
1715
+
1716
+ (***************************************************************************)
1717
+ (* RandomSetOfSubsets(k, n, S) equals a pseudo-randomly chosen set of *)
1718
+ (* subsets of S -- that is, a randomly chosen subset of SUBSET S . Thus, *)
1719
+ (* each element T of this set is a subset of S. Each such T is chosen so *)
1720
+ (* that each element of S has a probability n / Cardinality(S) of being in *)
1721
+ (* T. Thus, the average number of elements in each chosen subset T is n. *)
1722
+ (* The set RandomSetOfSubsets(k, n, S) is obtained by making k such *)
1723
+ (* choices of T . Because this can produce duplicate choices, the number *)
1724
+ (* of elements T in this set may be less than k. The average number of *)
1725
+ (* elements in RandomSetOfSubsets(k, n, S) seems to be difficult to *)
1726
+ (* compute in general. However, there is very little variation in the *)
1727
+ (* actual number of elements in the chosen set for fixed values of k, n, *)
1728
+ (* and Cardinality(S). You can therefore use the operator *)
1729
+ (* TestRandomSetOfSubsets defined below to find out approximately how *)
1730
+ (* close to k the cardinality of the chosen set of subsets is. *)
1731
+ (***************************************************************************)
1732
+ RandomSetOfSubsets(k, n, S) == CHOOSE T \\in SUBSET SUBSET S :
1733
+ Cardinality(T) \\leq k
1734
+
1735
+ (***************************************************************************)
1736
+ (* The value of TestRandomSetOfSubsets(k, n, S) is a sequence of five *)
1737
+ (* values that are the cardinality of the set of subsets produced by five *)
1738
+ (* executions of RandomSetOfSubsets(k, n, S). For constant values of k, *)
1739
+ (* n, and S, you can enter TestRandomSetOfSubsets(k, n, S) in the Evaluate *)
1740
+ (* Constant Expression section of a TLC model in the TLA+ Toolbox. *)
1741
+ (* Running TLC will then tell you the approximate number of elements in *)
1742
+ (* the set of subsets produced by RandomSetOfSubsets for these parameters. *)
1743
+ (* You can then choose k to obtain a set of the desired size. *)
1744
+ (***************************************************************************)
1745
+ TestRandomSetOfSubsets(k, n, S) ==
1746
+ [i \\in 1..5 |-> Cardinality(RandomSetOfSubsets(k, n, S))]
1747
+
1748
+ =============================================================================
1749
+ `],[`Toolbox`,`----------------------------- MODULE Toolbox --------------------------------
1750
+ (***************************************************************************)
1751
+ (* *)
1752
+ (***************************************************************************)
1753
+ LOCAL INSTANCE Naturals \\* a + b
1754
+ LOCAL INSTANCE FiniteSets \\* Cardinality
1755
+ LOCAL INSTANCE TLC \\* TLCGet
1756
+
1757
+ -----------------------------------------------------------------------------
1758
+
1759
+ (* Trace Exploration *)
1760
+
1761
+ _TETrace ==
1762
+ CHOOSE f \\in [ (Nat \\ {0}) -> STRING ] : TRUE
1763
+
1764
+ LOCAL _TETraceLength == Cardinality(DOMAIN _TETrace)
1765
+
1766
+ _TEPosition ==
1767
+ IF TLCGet("level") >= _TETraceLength
1768
+ THEN _TETraceLength
1769
+ ELSE TLCGet("level") + 1
1770
+
1771
+ =============================================================================
1772
+ `]]),qm=(e=`master`)=>e===`1.7.4`?Km:Gm,Jm=(e,t,n)=>new S(`Applying ${e} to the following value,\nwhich is not ${t}:\n${z(n)}`),Ym=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${z(r)}`),Xm=e=>P(e)?Mr(e):void 0,Zm=(e,t,n)=>{let r=V(e,t,n),i=Xm(r);if(!i)throw Jm(n,`a function with a finite domain`,r);return i},Qm=(e,t,n)=>{let r=V(e,t,n),i=Xm(r);if(!i)throw Ym(t===0?`first`:`second`,n,`bag`,r);return i},$m=(e,t)=>{if(!N(e)||!I(e))throw t();return L(e).elements},eh=e=>e.range.every(e=>typeof e==`number`&&e>0),th=(e,t)=>{let n=e.domain.findIndex(e=>nn(e,t));return n===-1?void 0:e.range[n]},nh=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,rh=nh(`BagDiff`,`tlc2.value.impl.Value`,2),ih=nh(`SqSubseteq`,`tlc2.value.IBoolValue`,2),ah=nh(`BagUnion`,`tlc2.value.impl.Value`,1),oh=nh(`BagOfAll`,`tlc2.value.impl.Value`,2),sh=nh(`BagCup`,`tlc2.value.impl.Value`,2),ch=nh(`BagCardinality`,`tlc2.value.impl.IntValue`,1),lh=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Wi(e)}`;throw Ki(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')`)},uh=(e,t,n)=>{let r=lh(e,n)+lh(t,n);if(Ri(r))throw zi(`${e}+${t}`);return r},dh=(e,t,n,r)=>{let i=th(n,e.domain[t]),a=lh(e.range[t],r);return i===void 0?a:a-lh(i,r)|0},fh=(e,t)=>Un(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>nn(e[0],r));a?a[1]=uh(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),ph=Ut([],[]),mh=e=>[Pi(`EmptyBag`,ph),H(`IsABag`,1,e=>{let t=Xm(V(e,0,`IsABag`));return t!==void 0&&eh(t)}),H(`BagCardinality`,1,e=>{let t=V(e,0,`BagCardinality`);return Zm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Jm(`BagCardinality`,`a bag`,t);return uh(e,n,ch)},0)}),H(`BagIn`,2,e=>{let t=V(e,1,`BagIn`),n=th(Zm(e,1,`BagIn`),V(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Ym(`second`,`BagIn`,`bag`,t);return n>0}),H(`CopiesIn`,2,e=>{let t=V(e,1,`CopiesIn`),n=th(Zm(e,1,`CopiesIn`),V(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Ym(`second`,`CopiesIn`,`bag`,t);return n}),H(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Qm(e,t,`(+)`);if(!eh(n))throw Ym(t===0?`first`:`second`,`(+)`,`bag`,V(e,t,`(+)`));return n});return fh(t,sh)}),H(`\\ominus`,2,e=>{let t=Qm(e,0,`(-)`),n=Qm(e,1,`(-)`);return Un(t.domain.flatMap((e,r)=>{let i=dh(t,r,n,rh);return i>0?[[e,i]]:[]}))}),H(`BagUnion`,1,e=>{let t=V(e,0,`BagUnion`),n=$m(t,()=>Jm(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??ph;let r=n.map(e=>{let n=Xm(e);if(!n)throw new S(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${z(t)}`);return n});return fh(r,ah)}),H(`\\sqsubseteq`,2,e=>{let t=Zm(e,0,`\\sqsubseteq`),n=Zm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>dh(t,r,n,ih)<=0)}),Fi(`BagOfAll`,2,e=>{let t=Ni(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new S(`The first argument of BagOfAll should be an operator, but instead it is:\n${z(t.literalBody)}`);let n=V(e,1,`BagOfAll`),r=Xm(n);if(!r)throw Ym(`second`,`BagOfAll`,`function with a finite domain`,n);return fh(r.domain.map((e,n)=>Ut([t.call([e])],[r.range[n]])),oh)}),H(`SubBag`,1,t=>{let n=V(t,0,`SubBag`);if(!P(n))throw new y(`DOMAIN expects a function but received ${z(n)}`);let r=Mr(n),i=Ln(r.range).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new y(`Attempted to apply a function to ${z(r)}, which is not in its domain`);return Ln(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Ut(e.map(e=>e[0]),e.map(e=>e[1]))))}),H(`BagToSet`,1,e=>Vr(Zm(e,0,`BagToSet`))),H(`SetToBag`,1,e=>{let t=V(e,0,`SetToBag`),n=$m(t,()=>Jm(`BagToSet`,`a function with a finite domain`,t));return Ut([...n],n.map(()=>1))})],hh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,gh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,_h=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,vh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,yh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,bh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,xh=e=>{if(!P(e))return!1;let t=Mr(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Sh=(e,t)=>Ki(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Wi(t)}`),Ch=(e,t)=>Ki(e,`Cannot cast tlc2.value.impl.${Wi(t)} to tlc2.value.impl.StringValue`),wh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Th=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Sh(t,e);return`[${L(e).elements.map(e=>Dh(e,t)).join(`,`)}]`},Eh=(e,t)=>{let n=Mr(e),r=Cr(n);return r?`[${r.map(e=>Dh(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${wh(typeof e==`string`?e:z(e))}:${Dh(n.range[r],t)}`).join(`,`)}}`},Dh=(e,t)=>typeof e==`string`?wh(e):typeof e==`object`?e.kind===`ModelValue`?wh(e.name):N(e)?Th(e,t):Eh(e,t):String(e),Oh=e=>{if(N(e))return Th(e,hh);if(!P(e)||xh(e))throw Sh(hh,e);return Eh(e,hh)},kh=e=>{if(!P(e))throw Sh(gh,e);return Eh(e,gh)},Ah=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))},jh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return At(e);if(Array.isArray(e))return $n(e.map(e=>jh(e,t)));if(typeof e==`object`&&e)return er(Object.entries(e).map(([e,n])=>[At(e),jh(n,t)]));throw Ki(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Mh=(e,t)=>{if(e.trim()===``)return jh(null,t);try{return jh(JSON.parse(e,(e,t,n)=>typeof t==`number`?Ah(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Ki(t,e.message):e}},Nh=(e,t)=>{if(typeof e!=`string`)throw Ch(t,e);return e},Ph=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Ki(n,`${t} (No such file or directory)`);return r},Fh=e=>[Ii(`ToJson`,1,e=>At(Dh(V(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Ii(`ToJsonArray`,1,e=>At(Oh(V(e,0,`ToJsonArray`)))),Ii(`ToJsonObject`,1,e=>At(kh(V(e,0,`ToJsonObject`)))),Ii(`JsonSerialize`,2,t=>{let n=Nh(V(t,0,`JsonSerialize`),_h),r=V(t,1,`JsonSerialize`);if(!Cr(r)&&!xh(r))throw new S(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${z(r)}`);return e.writeFile?.(n,Dh(r,_h)),!0}),Ii(`ndJsonSerialize`,2,t=>{let n=Nh(V(t,0,`ndJsonSerialize`),vh),r=V(t,1,`ndJsonSerialize`),i=Cr(r);if(!i)throw new S(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${z(r)}`);return e.writeFile?.(n,i.map(e=>`${Dh(e,vh)}\n`).join(``)),!0}),Ii(`JsonDeserialize`,1,t=>{let n=Nh(V(t,0,`JsonDeserialize`),yh);return Mh(Ph(e,n,yh),yh)}),Ii(`ndJsonDeserialize`,1,t=>{let n=Nh(V(t,0,`ndJsonDeserialize`),bh);return $n(Ph(e,n,bh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Mh(e,bh)))})],Ih=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,Lh=1e6,Rh=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),zh=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Rh(t,n,`nonnegative integer`,z(e));return e},Bh=(e,t,n,r)=>{if(!N(e)||!I(e))throw Rh(t,n,r,z(e));return L(e).elements},Vh=(e,t,n,r)=>Ln(Array.from({length:t},()=>Ln(e.filter(()=>r.nextDouble()<n)))),Hh=(e,t)=>{let n=`RandomSetOfSubsets`,r=zh(V(e,0,n),`first`,n),i=zh(V(e,1,n),`second`,n),a=Bh(V(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw Rh(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw Rh(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Vh(a,r,a.length===0?0:i/a.length,t.getRandom())},Uh=e=>[Ii(`RandomSubset`,2,t=>{let n=V(t,0,`RandomSubset`);if(typeof n!=`number`)throw Rh(`first`,`RandomSubset`,`nonnegative integer`,z(n));if(n<0)throw Ki(Ih,String(n));let r=V(t,1,`RandomSubset`);if(!N(r)||!R(r)&&!I(r))throw Rh(`second`,`RandomSubset`,`a finite set`,z(r));let i=Lm(r,e.version);if(i&&i.reduce((e,t)=>e*L(t).elements.length,1)>Lh)throw Ki(Ih,`Attempted to construct a set with too many elements (>${Lh}).`);return Ln(Rm(n,r,e.getRandom(),e.version))}),Ii(`RandomSetOfSubsets`,3,t=>Hh(t,e)),Ii(`TestRandomSetOfSubsets`,3,t=>$n(Array.from({length:5},()=>L(Hh(t,e)).elements.length)))],Wh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Gh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Wh})`,Kh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Wh}) throws java.io.IOException`,qh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Wh})`,Jh=()=>er([[`action`,Ln([])],[`state`,Ln([])]]),Yh=()=>er([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Xh=e=>er([[`name`,e??`UnnamedAction`],[`location`,Yh()]]),Zh=(e,t,n)=>{let r=e.map((e,t)=>$n([t+1,er(Object.entries(e))])),i=r.slice(1).map((e,n)=>$n([r[n],t[n],e])),a=n?[$n([r[r.length-1],n.action,r[n.start]])]:[];return er([[`action`,Ln([...i,...a])],[`state`,Ln(r)]])},Qh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Um(e).get(t)},$h=(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),z(r));else throw new S(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${z(n)}`)},eg=e=>e.every(e=>e!==void 0),tg=(e,t)=>er(t.variables.map((t,n)=>[t,e[n]])),ng=(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&&!B(e)){if(t.variableIndex.has(r))return!0;let e=xl(r,t);if(e&&!n.has(e)&&(n.add(e),ng(e.body,t,n)))return!0}return xi(e).some(e=>ng(e,t,n))},rg=(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[H(`AssertEq`,2,t=>{let n=V(t,0,`AssertEq`),r=V(t,1,`AssertEq`),i=nn(n,r);return i||(e(z(`Assertion failed`,!0)),e(z(n,!0)),e(z(r,!0))),i}),$i(`AssertError`,2,e=>{let n=Ni(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Ki(Gh,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=ea(e,0,`AssertError`)();try{ea(e,1,`AssertError`)()}catch(e){if(e instanceof y)return Da(e.message,t.isTool)===r;throw e}return!1}),Ii(`TLCGetOrDefault`,2,e=>{let n=V(e,0,`TLCGetOrDefault`);return Qh(t,n)??V(e,1,`TLCGetOrDefault`)}),{...Fi(`TLCGetAndSet`,4,n=>{let r=V(n,0,`TLCGetAndSet`),i=Qh(t,r)??V(n,3,`TLCGetAndSet`),a=Ni(n,1,`TLCGetAndSet`);return $h(t,e,r,a.call([i,V(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Ii(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!eg(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Ki(Kh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return $n(t.getBehavior(r).map(e=>tg(e,n.environment)))}),Ii(`CounterExample`,0,()=>t.counterExample??Jh()),H(`ToTrace`,1,e=>{let t=V(e,0,`ToTrace`);if(!P(t)||!nn(Vr(t),Ln([`action`,`state`])))throw new y(`The argument of ToTrace should be a CounterExample, but instead it is:\n${z(t)}`);let n=L(zr(t,`state`)).elements.map(e=>Cr(e)??[]);return $n(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),H(`TLCModelValue`,1,e=>{let t=V(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new S(`The argument of ModelValue should be a string, but instead it is:\n${z(t)}`);return Vt(t)}),$i(`TLCDefer`,1,()=>!0),H(`TLCNoOp`,1,e=>V(e,0,`TLCNoOp`)),$i(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!eg(r))throw Ki(qh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||bl(ea(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new C(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),$i(`TLCCache`,2,(e,t)=>{let r=Ni(e,0,`TLCCache`),a=li(ea(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=ng(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}),H(`TLCFP`,1,e=>Number(BigInt.asIntN(32,xm([V(e,0,`TLCFP`)])))),Ii(`TLCEvalDefinition`,1,(e,t)=>{let n=V(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?xl(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new S(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${z(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new S(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return W({kind:`Identifier`,name:n,location:r.location},t)})]},ig=(e,t)=>[Ii(`_Track`,2,e=>{let n=String(V(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,V(e,0,`_Track`)===!0?r+1:r),!0}),Ii(`_Counts`,0,()=>Hm(t)),Ii(`_CheckName`,1,n=>{let r=String(V(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(z(Hm(t),!0)),!1)}),Ii(`_PrintCounts`,0,()=>(e(z(Hm(t),!0)),!0))],ag=e=>String(e).padStart(2,`0`),og=e=>`${e.getUTCFullYear()}.${ag(e.getUTCMonth()+1)}.${ag(e.getUTCDate())}.${ag(e.getUTCHours())}${ag(e.getUTCMinutes())}${ag(e.getUTCSeconds())}`,sg=e=>Un([...e].map(([e,t])=>[e,$n([t])])),cg=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),lg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),ug=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),dg=(e,t,n)=>{if(e.version===`1.7.4`?!lg.has(t)||!e.isStarted&&ug.has(t):!e.isStarted&&cg.has(t))throw new S(`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 er([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return er([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return er([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,At(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,At(og(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Xh(void 0);case`all`:return sg(e.registers);case`all:named`:return sg(Um(e))}if(t.startsWith(`s:`)){let n=Um(e).get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return At(e.properties.get(t.slice(2))??t);throw new S(`TLCGet(${t}) was undefined.`)},fg=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new S(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${z(t)}`);return dg(e,t,n?.state)},pg=e=>e.length===0?[[]]:e.flatMap((t,n)=>pg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),mg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&L(e).elements.forEach(mg),e.kind===`Function`&&e.range.forEach(mg))},hg=(t,n)=>[H(`Print`,2,e=>(t(`${dt(z(V(e,0,`Print`),!0,!0))} ${dt(z(V(e,1,`Print`),!0,!0))}`),V(e,1,`Print`))),H(`PrintT`,1,e=>(t(dt(z(V(e,0,`PrintT`),!0,!0))),!0)),H(`Assert`,2,t=>{if(V(t,0,`Assert`)!==!0)throw new S(`The first argument of Assert evaluated to FALSE; the second argument was:\n${dt(z(V(t,1,`Assert`)))}`,e.assertViolation);return!0}),H(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),H(`:>`,2,e=>Un([[V(e,0,`:>`),V(e,1,`:>`)]])),H(`@@`,2,e=>{let t=Mi(e,0,`@@`),n=Mi(e,1,`@@`);return Wn([..._t(t),..._t(n)])}),H(`ToString`,1,e=>At(z(V(e,0,`ToString`),!0))),H(`TLCEval`,1,e=>{let t=V(e,0,`TLCEval`);return mg(t),t}),H(`Permutations`,1,e=>{let t=Ai(e,0,`Permutations`);return Ln(pg(t).map(e=>Un(t.map((t,n)=>[t,e[n]]))))}),Fi(`SortSeq`,2,e=>{let t=Ni(e,1,`SortSeq`);return $n(ji(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),n.version===`1.7.4`?qi({...Ii(`TLCGet`,1,(e,t)=>fg(n,V(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):qi($i(`TLCGet`,1,(e,t)=>fg(n,ea(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Ii(`TLCSet`,2,e=>{let r=V(e,0,`TLCSet`);return $h(n,t,r,V(e,1,`TLCSet`)),!0}),Pi(`Any`,Lt),H(`RandomElement`,1,e=>Bm(Oi(e,0,`RandomElement`),n.getRandom()))],gg=(e,t)=>e.every(e=>Dr(e,t)),_g=Ln([!1,!0]),vg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Hn(vg(e,t,r),vg(e,r,n))},yg=[`\\cup`,`\\cap`,`\\`],bg=e=>typeof e==`object`&&e.kind===`MixedSet`,xg=e=>e.kind===`Interval`?L(e).elements:e.elements,Sg=(e,t,n)=>{let r=xg(t);if(e!==`\\cup`){let t=e===`\\cap`;return Rn(r.filter(e=>Dr(e,n)===t))}if(r.length===0)return n;if(!ft(n))return Zt({kind:`SetOperation`,operator:e,left:t,right:n});let i=L(n).elements.filter(e=>!Dr(e,t));return Rn([...r,...i])},Cg=[Pi(`TRUE`,!0),Pi(`FALSE`,!1),Pi(`BOOLEAN`,_g),Pi(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Li(`=`,Fn),Li(`#`,(e,t)=>!Fn(e,t)),H(`~`,1,e=>!Ei(e,0,`~`)),H(`<=>`,2,e=>Ei(e,0,`<=>`)===Ei(e,1,`<=>`)),H(`/\\`,2,e=>Ei(e,0,`/\\`)&&Ei(e,1,`/\\`)),H(`\\/`,2,e=>Ei(e,0,`\\/`)||Ei(e,1,`\\/`)),H(`=>`,2,e=>!Ei(e,0,`=>`)||Ei(e,1,`=>`)),H(`\\in`,2,e=>Dr(V(e,0,`\\in`),V(e,1,`\\in`))),H(`\\notin`,2,e=>!Dr(V(e,0,`\\notin`),V(e,1,`\\notin`))),H(`\\subseteq`,2,e=>{let t=Di(e,0,`\\subseteq`),n=V(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&I(t.base)?gg(L(t.base).elements,n.base):gg(L(t).elements,n)}),...yg.map(e=>H(e,2,t=>{let n=V(t,0,e),r=V(t,1,e);if(ft(n)&&ft(r)&&!bg(n)&&!bg(r)){if(e===`\\cup`&&R(n))return r;let t=e===`\\cup`?Hn:e===`\\cap`?Vn:Bn;return Er((e,n)=>t(L(e),L(n)),(t,n)=>Sg(e,t,n),n,r)}return ft(n)?Sg(e,n,r):e!==`\\`&&ft(r)?Sg(e,r,n):Zt({kind:`SetOperation`,operator:e,left:n,right:r})})),H(`SUBSET`,1,e=>({kind:`Subset`,base:V(e,0,`SUBSET`)})),H(`UNION`,1,e=>{let t=Di(e,0,`UNION`),n=yn(t)?t.elements.filter(yn):[];if(!yn(t)||n.length!==t.elements.length)return Zt({kind:`Union`,base:t});if(bg(t)||n.some(bg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Dr(t,e)||e.elements.push(t)})),Rn(e.elements)}return n.length===0?zn:vg(n.map(L),0,n.length)}),H(`DOMAIN`,1,e=>{let t=V(e,0,`DOMAIN`);if(!P(t))throw new y(`DOMAIN expects a function but received ${z(t)}`);return Vr(t)})],wg=Yi(`Integers`,`Neg`,`IntValue`,1),Tg=e=>{let t=Yi(e,`DotDot`,`IntervalValue`,2);return[Xi(e,`+`,`Plus`,(e,t)=>e+t),Xi(e,`-`,`Minus`,(e,t)=>e-t),Xi(e,`*`,`Times`,(e,t)=>e*t),Xi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new S(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new S(`0^0 is undefined.`);return e**t}),Xi(e,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new S(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/n)|0;return e<0&&Math.imul(e,n)!==t?e-1:e}let r=Math.floor(t/n);if(Ri(r))throw zi(`${t} \\div ${n}`);return r}),Xi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new S(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),H(`..`,2,e=>({kind:`Interval`,low:Ji(V(e,0,`..`),t),high:Ji(V(e,1,`..`),t)}))]},Eg=Tg(`Naturals`),Dg=Tg(`Integers`),Og=e=>{let t=Eg.indexOf(e);return t===-1?void 0:Dg[t]},kg=[Pi(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Eg,Qi(`<`,(e,t)=>e<t),Qi(`>`,(e,t)=>e>t),Qi(`<=`,(e,t)=>e<=t),Qi(`>=`,(e,t)=>e>=t,`>`)],Ag=[Pi(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Dg,Qi(`>=`,(e,t)=>e>=t),H(`-.`,1,e=>{let t=Ji(V(e,0,`-`),wg);if(Ri(-t))throw zi(`-${t}`);return-t})],jg=(e,t,n)=>{let r=V(e,t,n),i=Cr(r);if(!i)throw new S(`${n}\n${z(r)}`);return i},Mg=(e,t,n)=>{let r=V(e,t,n);return typeof r==`string`?r:jg(e,t,n)},Ng=(e,t,n)=>typeof e==`string`?At(e.slice(t,n)):$n(e.slice(t,n)),Pg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Fg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Ig=(e,t)=>{let n=cf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?qi(e,t):e}):t},Lg=e=>Ig(`Sequences`,[H(`Seq`,1,e=>({kind:`SequenceSet`,base:V(e,0,`Seq`)})),H(`Len`,1,e=>Mg(e,0,Pg(``,`Len`)).length),H(`\\o`,2,e=>{let t=Mg(e,0,Fg(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=jg(e,1,Fg(`t \\o s`,`sequence`));return $n([...t,...n])}let n=V(e,1,`\\o`);if(typeof n!=`string`)throw new S(`${Fg(`t \\o s`,`string`)}\n${z(n)}`);return At(t+n)}),H(`Append`,2,t=>$n([...jg(t,0,Fg(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),V(t,1,`Append`)])),H(`Head`,1,e=>{let t=jg(e,0,Pg(``,`Head`));if(t.length===0)throw new S(`Attempted to apply Head to the empty sequence.`);return t[0]}),H(`Tail`,1,e=>{let t=Mg(e,0,Pg(``,`Tail`));if(t.length===0)throw new S(`Attempted to apply Tail to the empty sequence.`);return Ng(t,1)}),H(`SubSeq`,3,e=>{let t=Mg(e,0,Pg(`first `,`SubSeq`)),n=Ti(e,1,`SubSeq`),r=Ti(e,2,`SubSeq`);if(n>r)return Ng(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new S(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${z(V(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Ng(t,n-1,r)}),Fi(`SelectSeq`,2,e=>{let t=Ni(e,1,`SelectSeq`);return $n(jg(e,0,Pg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new S(`The second argument of SelectSeq should be a operator, but instead it is:\n${z(n)}`);return n}))})]),Rg=e=>Ig(`FiniteSets`,[H(`IsFiniteSet`,1,e=>{let t=V(e,0,`IsFiniteSet`);if(N(t))return xr(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new y(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${z(t)}\nis a finite set.`:`Attempted to check if the ${pt(t)} ${z(t)} is a finite set.`)}),H(`Cardinality`,1,t=>{let n=V(t,0,`Cardinality`);if(!N(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new S(`Attempted to compute cardinality of the value\n${z(n)}`);return yr(n,e)})]),zg=/* @__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`]]]),Bg=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:kg};case`Integers`:return{extends:[`Naturals`],operators:Ag};case`Sequences`:return{extends:[],operators:Lg(n.version)};case`FiniteSets`:return{extends:[],operators:Rg(n.version)};case`TLC`:return{extends:[],operators:Ig(`TLC`,hg(t,n))};case`Randomization`:return{extends:[],operators:Uh(n)};case`_Possible`:return{extends:[],operators:ig(t,n)};case`Json`:return{extends:[],operators:Fh(r)};case`Bags`:return{extends:[],operators:mh(i)};case`TLCExt`:return{extends:[],operators:rg(t,n)};default:return}},Vg=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}])),Hg={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},Ug=(e,t)=>{let n=Hg[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Wg=`$subexpression`,Gg=(e,t)=>new u(`${e} at line ${t.line}, column ${t.column}`),Kg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Kg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of xi(e)){let e=Kg(r,t,n);if(e)return e}},qg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Jg=(e,t)=>{let n=e.location,r=qg(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 Gg(`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 Gg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Wg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Wg,args:e.args,location:n,resolution:ja},location:n}},Yg=(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:ja})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ja}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ja};return Jg({...t,params:[...t.params,...r]},a)},Xg=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw Gg(r,i);Na.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:g(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw Gg(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>ts(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw Gg(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=Ra(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw Gg(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&Kg(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw Gg(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||ao(t.operand,1)!==0)throw Gg(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=lo(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[ao(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw Gg(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=ao(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw Gg(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw Gg(`Unexpected subexpression selector`,i);let s=r?r.sets:uo(n),c=s?.[ao(t.operand,s.length)];if(!c)throw Gg(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return Yg(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw Gg(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return Yg(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw Gg(`Subexpression selection failed`,i);return Jg(a,o.current)},Zg=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return oo(e,t,n)},Qg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||xi(e).some(Qg),$g=(e,t,n,r=!1)=>{if(!Qg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=is(e,e=>$g(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>e_(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>$g(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:is(e,e=>$g(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Zg(a.name,[],void 0,t):a.kind===`Apply`?Zg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Xg(o,t,a,r);return c!==a&&Ma.add(c),c},e_=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:$g(e.expression,t,n,!0)}))}),t_=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},n_=(e,t)=>e_(e,t_(t.definitions),()=>!1),r_=(e,t)=>{let n=t_([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>$g(e,n,i),o=e=>i(e)||!n(e),s=e=>$g(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return e_(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?e_(e,n,o):rs(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>Qg(e.body))||e.assumptions.some(e=>Qg(e.expression))?{...p,definitions:e.definitions.map(e=>rs(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},i_=(e,t)=>`${e}${t}`,a_=(e,t,n)=>`${e}${t}${n}`,o_=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},s_=(e,t,n)=>`${e},${t},${n}`,c_=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),l_=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),u_=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),d_=(e,t,n,r)=>({...c_(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),f_=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,p_=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,m_=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,{...d_(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),h_=d_(`$Set`,0,[2],[1]),g_=d_(`$Junction`,0,[3],[1]),__=d_(`$Choose`,0,[2],[1]),v_=d_(`$Function`,0,[3],[1]),y_=d_(`$FcnApply`,0,[2,2],[1,1]),b_=d_(`$RcdSelect`,0,[2,0],[1,1]),x_=d_(`'`,2,[1],[0]),S_=d_(`ENABLED`,1,[2],[0]),C_=d_(`[]`,3,[3],[0]),w_=d_(`$SquareAct`,2,[2,1],[0,0]),T_=d_(`$WF`,3,[1,2],[0,0]),E_=d_(`$TemporalExists`,3,[3],[0]),D_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),O_=e=>e.map(e=>({name:e,arity:0})),k_=(e,t)=>t.location.range?_(`${e}.`,t.location.range):new u(`${e} at line ${t.location.line}, column ${t.location.column}`),A_=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),j_=e=>e.kind!==`Let`&&e.kind!==`Label`,M_=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=v(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=m_.get(t)??Vg.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=c_(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(a_(e,n,t))}),t.data.constraints.forEach((e,t)=>l_(r.constraints,t,e)),u_(r.argConstraints,i_(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>u_(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>f_(e,n))throw new u(`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 u(`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(s_(t,n,r)),s=c_(Math.max(e.level,...t.filter((t,n)=>p_(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)=>{p_(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)=>l_(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||l_(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>l_(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||l_(s.constraints,t,f_(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=>l_(s.constraints,e,f_(r,a)))}))}),e.argParams.forEach(e=>{let t=o_(e),n=a(t.operator)?.operator;n&&l_(s.constraints,t.param,f_(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>u_(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>u_(s.argConstraints,i_(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&u_(s.argConstraints,i_(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=o_(e),n=a(t.operator);n&&u_(s.argConstraints,i_(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(o_(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=o_(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(a_(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(a_(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(a_(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,O_(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=c_();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=D_(n,O_(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 k_(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw k_(`Action used where only temporal formula or state predicate allowed`,e);A_.has(e.operator)&&l(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&j_(n)&&n.kind!==r)throw k_(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=v(e,n);t.constraints.forEach((e,t)=>l_(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>u_(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 u)||t.sany?t:k_(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return c_();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(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(g_,n)}case`Prime`:case`Unchanged`:return s(x_,[e.expression],t);case`Enabled`:return s(S_,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(C_,[n])}case`If`:return s(g_,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(g_,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=s(g_,[e.body],t,e.bounds.map(e=>e.set),Xa(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw k_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?E_:g_,[e.body],t,[],e.names);case`Choose`:return s(__,[e.body],t,e.set?[e.set]:[],Ya(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(h_,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(h_,[e.predicate],t,[e.bound.set],Ya(e.bound.pattern));case`SetMap`:return s(h_,[e.expression],t,e.bounds.map(e=>e.set),Xa(e.bounds));case`FunctionConstruction`:return s(v_,[e.body],t,e.bounds.map(e=>e.set),Xa(e.bounds));case`Record`:return s(v_,e.fields.map(e=>e.value),t);case`RecordSet`:return s(h_,e.fields.map(e=>e.value),t);case`Except`:return s(h_,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(y_,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(h_,e.args,t)}]);case`Bracket`:return c_();case`FieldAccess`:return i(b_,[a(e.record,t),{data:c_()}]);case`BoxAction`:case`AngleAction`:return s(w_,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(T_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return c_()}},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 xi(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,D_(t,O_(e.names))),i;default:return is(e,(e,n)=>(a(e,r,D_(t,O_(n))),e)),i}},_=(e,t,n,r)=>{let i=D_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...c_(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(i_(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(a_(e.name,n,t.name))).map(e=>s_(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(o_(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=o_(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,{...c_(),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}},N_=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?N_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=c_(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>l_(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>u_(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},P_=(e,t,n,r)=>{let i=M_(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?N_(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:g(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=Jo([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?N_(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw p(n)}})),...n],r);if(l.length>0)throw p(l,!1,void 0,r)},F_=(e,t)=>e.maxLevels[t]??3,I_=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=M_({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>l_(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>l_(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>u_(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=o_(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&l_(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(N_(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=g(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(i_(e.name,i));a!==void 0&&F_(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=o_(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=F_(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw p([...r.values()])}},L_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],R_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),z_=new Map(tf.flatMap(e=>e.map(t=>[t,e[0]]))),B_=e=>z_.get(e)??e,V_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},H_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(V_(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()}},U_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),W_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:B_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:B_(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}},G_=(e,t)=>{let n=[];for(let r=t;;){let t=W_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},K_=e=>({line:e.line,column:e.column}),q_=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=G_(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},J_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,Y_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},X_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&J_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&J_(e[n+1],e[n+2])?n+=J_(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=>Y_[e])}"`:r.text)}return t},Z_=e=>e[2]?.text,Q_=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},$_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>$_(e.modules,t)).find(Boolean),ev=(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:(of.has(i)?t?.(i):void 0)??sf.get(i)??t?.(i)??tm(e,i),s=o===void 0?[]:Ce(o),c=Q_(s),l=c.get(Z_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=rm(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>$_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},tv=(e,t)=>{let n=ev(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=G_(t,e+1);r.push({location:K_(t[e]),apply:e=>i.forEach(t=>e.put(U_(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:K_(u),apply:t=>t.put(U_(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`&&G_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),R_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(K_(u)),r.push({location:K_(u),apply:e=>e.put(U_(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(U_(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=B_(e.name);r.push({location:e.location,apply:n=>n.put(U_(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(U_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(U_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>La(e.location,t.location)?-1:+!!La(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=H_();i.set(e??``,s),ef.toReversed().forEach(e=>s.put(U_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},nv=(e,t,n)=>tv(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),rv=(e,t)=>{let n=tv(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},iv=(e,t)=>nv(e,t,`variable`),av=(e,t,n)=>{let r=ev(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)}),nf.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=q_(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}`),h=(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}},g=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?h(n,r,t):[n,i]};return t},_=g(e=>e.extends),v=g(e=>e.instances),y=/* @__PURE__ */ new Set([void 0]),b=/* @__PURE__ */ new Map;X_(s(void 0)).forEach((e,t)=>{t===3&&af.forEach(a),a(e)});let x=u(void 0);for(;;){let e=_(x,/* @__PURE__ */ new Set)??v(x,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;if(f.add(`${t.key}>${n}`),b.set(t.unit,[...b.get(t.unit)??[],n]),!y.has(n)){if(y.add(n),r(n).tokens.length===0){let e=t.unit??Z_(r(void 0).tokens);throw m(n,e)}X_(s(n)).forEach(a)}}L_.forEach(a);let ee=/* @__PURE__ */ new Set,te=e=>{if(ee.has(e))return;ee.add(e);let t=b.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(te),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return te(void 0),rf.forEach(a),[...i]},ov=t=>{switch(t.kind){case`Number`:try{return mt(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Vt(t.name);case`Set`:return Ln(t.elements.map(ov))}},sv=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],cv=(e,t)=>{try{return rm(e)}catch(n){if(!(n instanceof u))throw n;let r=kp(e);throw r===void 0?n:p([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},lv=e=>new u(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),uv=(e,t)=>e.location.range&&t.location.range&&{location:g(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${g(t.location.range)}.`},dv=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,fv=e=>e===`Theorem`?`ThmOrAssumpDefNode`:dv(e),pv=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:ja},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),mv=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>z(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 y(`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`)&&nn(t,r)})});if(t)return t[1];throw new y(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:z(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},hv=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||xi(e).some(e=>hv(e,t)),gv=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ps(e),n.get(e)??n.size)),n},_v=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),vv=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw fl(e);if(e.kind===`Number`&&!xu(e.value))throw pl(e);vv(e.kind===`Let`?[...xi(e),..._v(e.instances??[])]:xi(e))}),yv=(e,t)=>{let n=rm(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Set,s=new Map(Cg.map(e=>[e.name,e])),c=/* @__PURE__ */ new Map,l=Vm(e.checkDeadlock,t.seed);l.isWarningEnabled=t.isWarningEnabled??!0,l.isTool=t.isTool??!1,l.version=t.version??`master`;let d=/* @__PURE__ */ new Map,f=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,b=[],x=/* @__PURE__ */ new Map,ee=[],te=[],S=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne={value:0},re=e=>`${e}#${ne.value++}`,ie=[],C=[],ae=I_(e=>{let t=_.get(e)??ue(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>r.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,w=/* @__PURE__ */ new Map,T=e=>{let n=c.get(e);if(n)return n;let r=Bg(e,t.print,l,t.files,s);if(!r)return;zg.get(e)?.forEach(T);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>T(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{s.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Vg.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Ug(e,t.name)??i.get(t.name)?.range})}),c.set(e,i),i},E=e=>{if(of.has(e)&&t.loadModule?.(e)!==void 0)return;let n=T(e),r=zg.get(e)??[];return n&&S(e,r),n&&r.includes(`Integers`)&&T(`Integers`),n},D=e=>(vv([...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]),..._v(e.instances)]),e.modules.forEach(D),e);D(n);let ce=(e,n)=>{let r=t.loadModule?.(e)??Hd.get(e)??tm(t.source,e);if(r===void 0)throw m(e,n);let i=cv(r,e);if(i.name!==e)throw p([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return D(i)},le=e=>{let t=te.indexOf(e.name);if(t!==-1)throw new u(`Circular dependency among .tla files; dependency cycle is: ${[...te.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];te.push(e.name),ee.push(n);let o=be(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:C,levelChecks:a});if(ee.pop(),te.pop(),i.length>0)throw p(i,!1,void 0,C);let s=r.find(e=>n.has(e.name)),c=s&&d.get(s.name),l=c&&uv(s,c.module);if(l)throw p([l],!1,void 0,C);if(s)throw lv(s);return a.forEach(e=>e()),{linked:o,closure:n}},ue=(e,n)=>{let i=d.get(e);if(i)return S(e,x.get(e)??[]),i;let a=le(ce(e,n));return(qm(l.version).has(e)?Bg(e,t.print,l,t.files,s):void 0)?.operators.forEach(e=>{let t=a.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(s.set(t.key,e),r.delete(t.key))}),d.set(e,a.linked),x.set(e,a.closure),S(e,a.closure),a.linked},de=(e,t,n,s,c)=>{let l=c?void 0:E(e.module);if(l)return fe(e,l);let u=c??ue(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=sv(u),f=`#${ne.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=qo(n_(e,t),d,t,n);ie.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=Ts({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Qo(t,p)])),variables:new Set(u.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,c,l)=>{let u=re(`${c}@${t.name}`),f=l(u);return r.set(u,f),d.length>0&&o.add(f),e.name!==void 0&&se.set(u,`${e.name}!${se.get(n)??c}`),i.set(u,!s),a.set(u,{source:n,prefix:e.params.length}),u},createName:re});return pe(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&w.set(r,n),r})},fe=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),pe=(e,t,n,r)=>{let a=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!a.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:i.get(n.key)===!0?e.location.range:n.range}];let a=`${e.name}!${t}`;return[a,{key:r(n.key,a),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},me=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:ja})),he=(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:me(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),O=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ge=(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=O(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:me(r,n),location:n}}},_e=(e,t,n,a)=>{let o=e.location,s=a?void 0:E(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=O(n.arity);return he(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??ue(e.module,n),l=`#${ne.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=sv(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};ie.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=>hv(f(e),p),h=d.map(t=>{let n=ge(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=[],_=Ts({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:me(e.params,o),location:o,resolution:ja}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:ja}])),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}:pv(a,i)),i},createName:re}),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=O(n.arity),a=[...e.params,...i];return he(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ve=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),ye=/* @__PURE__ */ new Map,be=(e,a)=>{let o=$d(e,t.loadClass?.(e.name),e===n);ye.set(e.name,o.overrides);let s=o.module,c=ie.length,l=new Map([...Cg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...a.symbols]),u=/* @__PURE__ */ new Map,d={location:Ho,errors:[],warnings:[]},p=[d],m=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);fv(n.kind)===fv(e.kind)?d.warnings.push({location:r,message:`Warning: the ${dv(n.kind)} of '${t}' conflicts with \nits ${dv(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${dv(e.kind)} of '${t}' conflicts with \nits ${dv(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,x=[],ee=[...s.constants],te=s.variables.map(e=>e.name),S=s.variables.map(e=>e.location);s.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:E(e);if(n){m(n);return}let r=t??ue(e,s.name);ee.push(...r.constants.filter(e=>ee.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{te.includes(e)||(te.push(e),S.push(r.variableLocations[t]))}),m(r.exported),r.facts.forEach(e=>v.add(e)),r.modules.forEach((e,t)=>y.set(t,e)),x.push(r)});let ne=new Map(l),re=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});re.forEach(e=>h.set(e.name,oe(e)));let se=e=>({key:D(e),arity:Ra(e),params:za(e),kind:Uo(s,e)?`Theorem`:`Definition`,range:e.location.range}),T=ee.length===0&&te.length===0,D=e=>s===n?e.name:`${e.name}@${a.id}`,ce=/* @__PURE__ */ new Map,le=()=>new Map([...a.modules,...y]),me=e=>{let t=s.instances.find(t=>t.module===e.name);return t!==void 0&&La(e.location,t.location)},he=e=>{let t=s.modules.find(t=>t.name===e.module);return t?me(t)?y.get(t.name):void 0:le().get(e.module)},O=e=>({imported:l,getInstance:e=>{let t=he(e),n=t?void 0:E(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:s.name};let r=t??ue(e.module,s.name),i=sv(r);return{declarations:i,symbols:pe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:D,instanced:ce,facts:v,reports:p,warnings:a.warnings}),ge=e=>[...re.filter(t=>La(t.location,e)).map(e=>[e.name,oe(e)]),...s.definitions.filter(t=>La(t.location,e)).map(e=>[e.name,se(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),xe=e=>{let t=le(),n=t.get(e.name),r=n&&uv(e,n.module);if(n&&!r)throw lv(e);a.nested.push(e);let i={location:e.location,errors:[],warnings:[]};p.push(i);let o=be(e,{id:`${a.id}/${e.name}`,symbols:ge(e.location),modules:t,nested:a.nested,errors:i.errors,warnings:i.warnings,levelChecks:a.levelChecks});r&&i.errors.push(r),n||y.set(e.name,o),f.has(e.name)||f.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=de(e,s,O(s),T,le().get(e.module));ce.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>xe(e)}))].sort((e,t)=>La(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=r_(ks(s,(e,t)=>_e(e,t,s.name,he(e))),ve(l));a.errors.push(...Yo(Se,O(Se))),Se.definitions.forEach(e=>{let t=D(e);r.set(t,e),i.set(t,!T);let n=se(e),a=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||a!==void 0&&!La(a,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ce={module:Se,constants:ee,variables:te,variableLocations:S,visible:l,exported:h,modules:y,extended:x,facts:/* @__PURE__ */ new Set([...v,...[...Se.theorems,...Se.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,Ce);let we=ie.splice(c).map(e=>({location:e.location,check:()=>ae(e)}));return a.levelChecks.push(()=>P_(Se,{constants:new Set(ee.map(e=>e.name)),variables:new Set(te),getDefinition:e=>r.get(l.get(e)?.key??e),getQualifiedName:e=>w.get(l.get(e)?.key??e)},we,C)),b.push(Ce),Ce},xe=le(n).linked;C.length>0&&!t.isSanyReported&&t.print(h(C));let Se=e=>xe.visible.get(e)?.key??e;xe.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(xe,/* @__PURE__ */ new Set);let k=xe.constants.map(e=>e.name),Te=xe.variables,A=e=>e.module===void 0?[e.name,Se(e.name)]:e.module===n.name||k.includes(e.name)?[]:[(d.get(e.module)??f.get(e.module))?.visible.get(e.name)?.key??e.name],Ee=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:xe.constants.find(t=>t.name===e)?.arity??0},De=/* @__PURE__ */ new Map,Oe=/* @__PURE__ */ new Set,ke=(e,t)=>{s.set(e,t),r.delete(e),De.delete(e),Oe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=ov(e.value);Pn(t),A(e).forEach(e=>{let n=Ee(e);n===0?De.set(e,t):ke(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ae=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ae.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new v(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(ov),ov(e.value)]),Ae.set(t,n)}),Ae.forEach(e=>A(e).forEach(t=>ke(t,mv(e.name,Ee(t)||e.rows[0][0].length,e.rows))));let je=new Map(e.substitutions.flatMap(e=>A(e).map(t=>[t,Se(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!k.includes(n)&&!xe.visible.has(n))throw new v(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new v(`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=Se(i),o=r.get(a);if(!(o!==void 0||s.has(a)||De.has(a)||k.includes(i)||Te.includes(i)))throw new v(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(o?.kind===`Operator`&&o.params.length!==(xe.constants.find(e=>e.name===n)?.arity??xe.visible.get(n)?.arity))throw new v(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let Me=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(A)),Ne=(e,t)=>{if(Me.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&Ne(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=Ne(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=he(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),xe.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let Pe=k.filter(e=>!De.has(e)&&!je.has(e)&&!Oe.has(e));if(Pe.length>0&&!t.isUnconfigured)throw new v(`The constant parameter ${nv(t.source,t.loadModule,`constant`).find(e=>Pe.includes(e))??Pe[0]} is not assigned a value by the configuration file.`);t.isTraceRecorded&&s.forEach((e,t)=>{let n=Og(e);n&&s.set(t,n)});let Fe={runtime:l,definitions:r,builtins:s,constants:De,substitutions:je,instanceNames:se,variables:Te,variableIndex:gv(Te,b.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:o,evaluators:/* @__PURE__ */ new WeakMap},Ie=M_({constants:new Set(De.keys()),variables:/* @__PURE__ */ new Set([...Te,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>s.has(e))]),getDefinition:e=>xl(e,Fe)}),Le=e=>{try{W(e,{environment:Fe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};je.forEach((e,t)=>{let n=r.get(e),i=k.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ie.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Le(n.body):void 0;if(i)throw new v(`The configuration file substitutes constant ${t} with non-constant ${e}${wa(i)?``:` - specifically: ${i.message}`}`)}),l.version!==`1.7.4`&&(l.isStarted=!0);let j=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),Re=rv(t.source,t.loadModule);return{environment:Fe,assumptions:Ce,variableLocations:xe.variableLocations,instanceActions:oe,startupDefinitions:b.filter(e=>!j.has(e.module.name)||sv(e).length===0).flatMap(e=>Re(e===xe?void 0:e.module.name).flatMap(t=>{let n=r.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:xe.constants,rootSymbols:xe.visible,javaOverrides:b.flatMap(e=>ye.get(e.module.name)??[])}},bv={kind:`Boolean`,value:!0},xv={kind:`Boolean`,value:!1},Sv=e=>e?bv:xv,Cv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,wv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Tv=(e,t)=>({kind:e,body:t}),Ev=(e,t,n)=>({kind:e,operands:[t,n]}),Dv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Dv(e,t.operands).operands:[t])}),Ov=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Ov(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Ov(t)),0)}},kv=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 kv(e.body);case`And`:case`Or`:return e.operands.some(kv)}},Av=/* @__PURE__ */ new WeakMap,jv={count:0},Mv=e=>{let t=Av.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`#${jv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Mv).join(`,`)})`;default:return`${e.kind}(${Mv(e.body)})`}})();return Av.set(e,n),n},Nv=(e,t)=>e===t||Mv(e)===Mv(t),Pv=(e,t)=>{let n=Mv(t);return e.some(e=>e===t||Mv(e)===n)},Fv=e=>e===`And`?`Or`:`And`,Iv=(e,t)=>{switch(e.kind){case`Boolean`:return t?Sv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Tv(`Not`,e):e;case`Not`:return Iv(e.body,!t);case`And`:case`Or`:return Dv(t?Fv(e.kind):e.kind,e.operands.map(e=>Iv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Tv(n,Iv(e.body,t))}}},Lv=e=>{switch(e.kind){case`Boolean`:return Sv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Dv(Fv(e.kind),e.operands.map(Lv));case`Always`:return Tv(`Eventually`,Lv(e.body));case`Eventually`:return Tv(`Always`,Lv(e.body));default:return Tv(`Not`,e)}},Rv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Rv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Sv(t)}return n.length===0?Sv(!t):n.length===1?n[0]:Dv(e.kind,n)}case`Not`:{let t=Rv(e.body);return t.kind===`Boolean`?Sv(!t.value):Tv(`Not`,t)}case`Always`:case`Eventually`:{let t=Rv(e.body);return Tv(e.kind,t.kind===e.kind?t.body:t)}default:return e}},zv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Bv=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Bv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new y(`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=>Dv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Bv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=zv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:Dv(`Or`,t);n.push(Tv(`Always`,Tv(`Eventually`,e)))}return Dv(`Or`,n)}case`Not`:return Cv(e.body)?e:Bv(Lv(e.body));default:return e}},Vv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Vv(e.operands[0]):Dv(e.kind,e.operands.map(Vv));case`Not`:return e.body.kind===`Not`?Vv(e.body.body):Tv(`Not`,Vv(e.body));case`Always`:case`Eventually`:case`Next`:return Tv(e.kind,Vv(e.body));default:return e}},Hv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Hv(e.operands[0]);let t=Math.floor(e.operands.length/2);return Ev(e.kind,Hv(Dv(e.kind,e.operands.slice(0,t))),Hv(Dv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Tv(e.kind,Hv(e.body));default:return e}},Uv=(e,t)=>{e.kind===`Eventually`&&!Pv(t,e)&&t.push(e),`body`in e&&Uv(e.body,t),`operands`in e&&e.operands.forEach(e=>Uv(e,t))},Wv=e=>{let t=e.filter(wv),n=e.flatMap(e=>e.kind===`Not`&&wv(e.body)?[e.body]:[]);return!t.some(e=>Pv(n,e))},Gv=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,Tv(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new y(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Kv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Tv(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},qv=(e,t,n)=>e.flatMap(e=>{let r=Kv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Jv=e=>[...new Set(e.map(Mv))].sort().join(`|`),Yv=(e,t)=>{let n=new Set(t.map(Jv));return[...e.filter(e=>!n.has(Jv(e))),...t]},Xv=e=>{let t=Gv(e),n=qv(t,`Always`,`And`),r=qv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Kv(t,`Eventually`,`Or`);if(n&&!(Pv(e,n.first)||Pv(e,n.second)))return Yv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Pv(e,t.first)||Pv(e,t.second))&&!Pv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Wv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Kv(t[e],`Always`,`And`);n&&(Pv(t,n.first)||t.push(n.first),Pv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)Pv(t,e.first)&&Pv(t,e.second)&&!Pv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Wv(t)?[]:i(t)};return a(e)},Zv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Ov(e)<=1)}),Qv=e=>{let t=Xv([e]).map(Zv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Jv(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 Xv(n)){let n=Jv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Zv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},$v=(e,t)=>!Pv(e,t)||Pv(e,t.body),ey=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&Ov(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=zv(e);if(n){let e=Ov(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(kv(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},ty=(e,t)=>{let n=e.findIndex(e=>Nv(e,t));return n===-1?(e.push(t),e.length-1):n},ny=e=>{let t=Bv(Rv(Iv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Vv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])ey(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Dv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Nv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Hv(e.formula),n=[];t&&Uv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>ty(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>ty(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>ty(i,e))}));return{tableau:t&&Qv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},ry=()=>n(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.livenessEvaluationFailure),iy=()=>n(new x,e.error),ay=/* @__PURE__ */ new Set([`~>`,`-+->`]),oy=/* @__PURE__ */ new WeakMap,sy=/* @__PURE__ */ new WeakSet,cy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),ly=(e,t)=>new y(`TLC cannot handle the temporal formula ${il(e)}${t===void 0?``:`:\n${t}`}`),uy=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ml(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return uy(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?uy(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=xl(e,n);if(t)return dy(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?r.isStateLevel&&!r.isLevelConstant?1:0:void 0},o=(e,t)=>r.has(e)?0:B(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return is(e,(e,a)=>(i.value=Math.max(i.value,uy(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 ay.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},dy=(e,t)=>{let n=oy.get(e);if(n!==void 0)return n;oy.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(uy(e.body,void 0,t),...r.map(e=>uy(e.set,void 0,t)));return oy.set(e,i),i},fy=(t,r)=>{try{return Pl(t,r)}catch(t){if(!(t instanceof y))throw t;if(!wa(t))return;throw n(new y(`${o(`tlc2.tool.EvalException`)}${t.message}`),e.error)}},py=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>py(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,il(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,my(e,t,n));if(e.kind===`Identifier`){let r=B(e)?ml(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:xl(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&dy(a,n)>0){if(i.has(a))throw iy();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=cy(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||uy(e,t,n)===3)){let t=au(e,c),r=B(e)?void 0:xl(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,_u(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>uy(e.set,t,n)===0),u=l?fy(e.bounds,c):void 0;if(l&&u){let n=[];if(Fl(e.bounds,u,t,t=>(n.push(...s(e.body,t,il(e.body))),!1)),n.length===0)throw ry();return n}return[{expression:e,scope:t,name:o}]},my=(e,t,n)=>{let r=yu(e.definitions,cy(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&sy.add(e.binding);return r},hy=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),gy=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?uy(e,t,n):i;if(a===0){let r=W(e,cy(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${al(e)}`);return Sv(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},a={depth:0},o=(e,t,n,r)=>{if(a.depth>=100)throw iy();a.depth++;let o=f(e,t);a.depth--;let s=Ov(o);return s>2?o:i(n,r,s)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=cy(n,t),s=B(e)||xl(i,n)===void 0?ml(t,i):void 0;if(s?.kind===`Thunk`&&sy.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:B(e)?ou(i,a):ru(i,n);if(l?.kind!==`Closure`)throw ly(e);let u=e.kind===`Apply`?e.args:[],d=!B(e)&&xl(i,n)?.isRecursive===!0;return c(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(l.body,_u(l,u,a),e,t)),d)},c=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof x||n&&!r;throw!(t instanceof y)||i?t:ly(e)}},l=(e,t)=>{let r=uy(e,t,n);if(!e.bounds.every(e=>uy(e.set,t,n)===0)){if(r<=2)return i(e,t,r);throw ly(e)}let a=[],o=e.kind===`Forall`;try{Il(e.bounds,cy(n,t),t=>(a.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof y)||n instanceof x)throw n;if(r<=2)return i(e,t,r);throw ly(e,o&&!wa(n)?n.message:void 0)}return a.length===0?Sv(o):u(e,t,Dv(o?`And`:`Or`,a))},u=(e,t,n)=>{let r=Ov(n);return r>2?n:i(e,t,r)},d=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!B(e)||e.operator===`=>`),f=(e,t)=>{let a=uy(e,t,n);if(a<=2&&!d(e))return i(e,t,a);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,my(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Tv(`Always`,Ev(`Or`,Tv(`Not`,f(n[0],t)),Tv(`Eventually`,f(n[1],t)))):e.operator===`~`&&!B(e)?u(e,t,Tv(`Not`,f(n[0],t))):e.operator===`=>`?u(e,t,Ev(`Or`,Tv(`Not`,f(n[0],t)),f(n[1],t))):s(e,t)}case`And`:case`Or`:return u(e,t,Dv(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(!r&&uy(e.condition,t,n)===0){let r=W(e.condition,cy(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return u(e,t,Ev(`Or`,Ev(`And`,i,f(e.consequent,t)),Ev(`And`,Tv(`Not`,i),f(e.alternative,t))))}case`Always`:case`Eventually`:return Tv(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=hy(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Tv(`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`?Tv(`Always`,Tv(`Eventually`,Ev(`Or`,i,a))):Ev(`Or`,Tv(`Eventually`,Tv(`Always`,i)),Tv(`Always`,Tv(`Eventually`,a)))}default:throw ly(e)}};return f(e,t)},_y=(e,t,n,r,i)=>{let a=e=>_y(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`?bl(W(e.expression,a),`a temporal property predicate`):qc(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&&bl(W(e.unchanged,a),`a subscript`)?!1:bl(W(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 _y(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new y(`TLC cannot evaluate a temporal formula in a single step`)}},vy=(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)=>vy(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 _y(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},yy=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return yy(e.body);case`And`:case`Or`:return e.operands.some(yy);default:return!1}},by=e=>e.promises.some(e=>yy(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),xy=(e,t)=>e.every((e,n)=>an(e,t[n])),Sy=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Cy=e=>({data:e(1024),length:0,create:e}),wy=(e,t,n)=>{let r=t+n.length;if(r>e.data.length){let t=e.create(Math.max(2*e.data.length,r));t.set(e.data),e.data=t}e.data.set(n,t),e.length=Math.max(e.length,r)},Ty=(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}},Ey=e=>new Int32Array(e).fill(-1),Dy=(e,t)=>(e.edgeStarts[t]??-1)!==-1,Oy=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},ky=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,Ay=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),jy=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},My=2**53-1,Ny=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>gy(e.expression,e.scope,n)),a=e.map(e=>Tv(`Not`,gy(e.expression,e.scope,n))),o=a.length===1?a[0]:Dv(`Or`,a),s=i.length===0?o:Dv(`And`,[...i,o]),c=ny(s);if(c.length===0)throw ry();let l=/* @__PURE__ */ new Map,u=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=Mv(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:Cy(e=>new Int32Array(e)),edgeActions:Cy(e=>new Uint8Array(e)),stateResults:Cy(e=>new Uint8Array(e)),initial:[],firstNodes:Cy(Ey),lastNodes:Cy(Ey),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),d={multiplier:1},f=!Mu(n),p={environment:n},m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>_y(e,t,void 0,p.environment,f?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),b=(e,t,n,r)=>g(t,()=>{let t=e.solution.actionChecks;if(!f)return Uint8Array.from(t,e=>+!!_y(e,n,r,p.environment,/* @__PURE__ */ new Map));let i=h(n),a=m.actions.get(n)??/* @__PURE__ */ new Map;m.actions.set(n,a);let o=a.get(r)??new Int8Array(l.size).fill(-1);return a.set(r,o),Uint8Array.from(e.actionIds,(e,a)=>(o[e]===-1&&(o[e]=+!!_y(t[a],n,r,p.environment,i)),o[e]))}),x=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),ee=(e,t)=>{if(n.runtime.version===`1.7.4`)return!1;let r=e.nodes[t];return r.particle.length===0&&r.successors.length===1&&r.successors[0]===t},te=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=Ty(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ne=(e,t,n)=>{let r=Ay(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),Ty(i,e[t]-1,e[t+1]))}i.slots.set([t+1,n,r],Ty(i,t,n));let a=e.lastNodes.data[t]??-1;return a===-1?wy(e.firstNodes,t,[r]):e.nextSiblings[a]=r,wy(e.lastNodes,t,[r]),r},re=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;wy(e.edgeTargets,a,n),r.forEach((t,n)=>wy(e.edgeActions,(a+n)*o,t)),wy(e.stateResults,e.nodeStates[t]*i.length,i),e.edgeStarts[t]=a,e.edgeCounts[t]=n.length},ie=(e,t,n)=>{let i={slots:Array.from({length:16*d.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t)&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&&xy(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*d.multiplier&&d.multiplier++,i.slots.filter(e=>e!==void 0)},C=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=[],u=s.successors.length>0?b(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!x(t,r,i,n))continue;if(ee(t,r)&&e.errorNode===void 0&&te(e)){e.errorNode=a;return}let o=S(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&C(e,t,n,i,s)}for(let a of r.getSuccessors(i,n)){let r=b(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!x(t,n,i,a.state)||a.index===-1)continue;let s=S(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&C(e,t,a.state,a.index,u)}}l.length>0&&re(e,a,l,c,o)},ae=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>x(t,r,a,e.state)));e.isDone[a]=!0;for(let s of jy(e,a)){let a=[],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??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&C(e,t,n.state,n.index,d)}}),re(e,s,a,c,i)}if(e.errorNode!==void 0)return Sy(se(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Ay(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{Dy(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),re(e,i,a,o,r)},se=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Dy(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 Oy(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}Dy(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new y(`Couldn't re-create liveness trace (path) starting at: ${t}`)},w=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>Dy(e,t)),c=[],l=t=>{let n=Oy(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&$v(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=My;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=My,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>ky(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>Oy(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=Sy(se(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+m.length+h.length},_={node:r},v=e=>o.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]&&ky(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},o=g.count;if(Oy(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!v(r)||!a(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_.node,c,e)&&(m[t]=!0,g.count--)})}return g.count<o?(b(r),d.clear(),!0):(v(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){b(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=Oy(e,t).find(e=>v(e)&&!d.has(e))??-1}b(n.unvisited),d.add(n.unvisited)}}let x=p(r,_.node,s,a);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()],isCycleConstrained:by(n)}},p=(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 Oy(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 y(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r.link,n.push(t,l,-42),c.push(l);let u={value:r.link++};Oy(e,l).forEach((t,r)=>{Dy(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u.value=Math.min(u.value,o[t]):o[t]===-1&&s.push(t))}),n.push(u.value)}}};return{branches:u.length,addInitialState:(e,t,r)=>{p.environment=r??n,m.states.clear(),m.actions.clear();try{for(let n of u){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)x(r,i,void 0,t)&&n.initial.push(S(n,e,i)??ne(n,e,i))}}finally{p.environment=n}},addState:(e,t,r,i)=>{p.environment=i??n,m.states.clear(),m.actions.clear();try{let n=ie(e,t,r);for(let r of u){let i=n.map(n=>b(r,e,t,n.state)),a=v(r,e,t),o=r.solution.tableau,s=o?ae(r,o,n,i,a,e):oe(r,n,i,a,e);if(s)return s}return}finally{p.environment=n}},findViolation:()=>{for(let e of u)for(let t of e.solution.models){let n=w(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!vy(a[i].body,t,r,0,n)).map(e=>e.name))]}},Py=`UnnamedAction`,Fy={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Iy=e=>{let t=e.range??Fy;return er([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Ly=e=>{let t=[[`name`,e.name],[`location`,Iy(e.location)]];return e.parameters.length===0?er(t):er([...t,[`context`,er(e.parameters)],[`parameters`,$n(e.parameters.map(e=>e[0]))]])},Ry=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),zy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),By=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Vy=e=>e.kind===`Apply`?e.args:[],Hy=(e,t,n)=>{let r=By(e);if(r===void 0)return;if(B(e)){let e=ml(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=ru(r,n);return i?.kind===`Closure`?i:void 0},Uy=(e,t)=>{try{return W(e,zy(t,void 0)),!0}catch(e){if(e instanceof l)return!1;throw e}},Wy=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Tl(e,t)&&Uy(e.body,t),Gy=(e,t)=>{let n=xl(e.name,t);return n?.body===e.body&&Wy(n,t)},Ky=(e,t)=>{if(e.kind!==`Identifier`||!B(e))return;let n=ml(t,e.name);return n?.kind===`Thunk`?n:void 0},qy=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ml(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Jy=(e,t)=>{try{return e()}catch(e){if(e instanceof l)return t();throw e}},Yy=(e,t,n,r,i)=>{let a=Vy(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=>uy(e,n,i)!==0)?o():Jy(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,zy(i,n))]),expression:t,scope:n}],o)},Xy=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Py,location:e.location,parameters:qy(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Xy(e.body,yu(e.definitions,zy(r,t)),n,r,i);case`Label`:return Xy(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Xy(e,t,n,r,i));case`Exists`:return Jy(()=>{let o=[];return Il(e.bounds,zy(r,t),t=>(o.push(...Xy(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=B(e)?void 0:i.get(By(e)??``),s=Hy(e,t,r);if(o)return Yy(o,e,t,s,r);if(!s)return[a()];let c=Vy(e),l=B(e)?s.name:r.instanceNames.get(By(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return Gy(s,r)||c.some(e=>uy(e,t,r)!==0)?u():Jy(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,zy(r,t))},parent:e}),s.scope);return Xy(s.body,e,{...s,name:l},r,i)},u)},Zy=(e,t,n,r,i)=>{let a=(e,t)=>Zy(e,t,n,r,i);if(e.kind===`Let`){a(e.body,yu(e.definitions,zy(n,t)));return}let o=Ky(e,t);if(o){a(o.expression,o.scope);return}let s=Hy(e,t,n);if(s&&Gy(s,n))return;if(s&&s.params.length===0){if(uy(s.body,s.scope,n)===1){r.inits.push(Ry(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,_u(s,e.args,zy(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(Ry(Py,e));return}let c=uy(e,t,n);c<=1?r.inits.push(Ry(Py,e)):c===3&&r.temporals.push(Ry(Py,e))},Qy=(e,t,n,r,i)=>{let a=(t,n)=>Qy(e,t,n,r,i);if(t.kind===`Let`){a(t.body,yu(t.definitions,zy(r,n)));return}let o=Ky(t,n);if(o){a(o.expression,o.scope);return}let s=Hy(t,n,r);if(s&&Gy(s,r))return;if(s&&s.params.length===Vy(t).length){a(s.body,t.kind===`Apply`?_u(s,t.args,zy(r,n)):s.scope);return}if(t.kind===`Forall`&&Jy(()=>(Il(t.bounds,zy(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(Ry(e,a)):uy(a,n,r)<2?i.invariants.push(Ry(e,a)):i.impliedTemporals.push(Ry(e,t));return}let c=uy(t,n,r);c<=1?i.impliedInits.push(Ry(e,t)):c===3&&i.impliedTemporals.push(Ry(e,t))},$y=(e,t)=>{let n=xl(e,t);return n?.kind===`Operator`&&!Wy(n,t)?n:void 0},eb=e=>er([[`name`,e.name],[`location`,Iy(e.location)]]),tb=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:$y(e.specification,t);a&&(Zy(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Xy(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:ru(e.init,t);o?.kind===`Closure`&&r.inits.push(Ry(e.init??``,o.body));let s=e.next===void 0?void 0:ru(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Xy(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=$y(e,t);n&&r.invariants.push(Ry(e,n.body))}),e.properties.forEach(e=>{let n=$y(e,t);n&&Qy(e,n.body,void 0,t,r)}),r},nb=(e,t,n)=>tb(e,t,n).inits,rb=(e,t,n)=>tb(e,t,n).actions,ib=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>z(e[1])).join(`,`)})`,ab=(e,t)=>`${e.name===Py?`Action`:e.name}${t===`1.7.4`?``:ib(e)} ${g(e.location.range??Fy)}`,ob=e=>`${e.name}${ib(e)}`,sb=(e,t,n,r)=>{let i=tb(e,t,r),a=e=>Ln(e.map(Ly)),o=e=>Ln(e.flatMap(e=>{let n=$y(e,t);return n?[eb(n)]:[]}));return er([[`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`,Ln(t.variables.map((e,t)=>er([[`name`,e],[`location`,Iy(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},cb=`paired12`,lb=(e,t=16)=>e<=t*.75?t:lb(e,t*2),ub=(e,t)=>{let n=lb(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)},db=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),fb=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),pb=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),mb=e=>pb(e).replaceAll(`
1773
+ `,`\\n`),hb=(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)},writeStuttering:r,close:()=>t?.(e.path,n.join(``))}},gb=(e,t,n)=>{let r=n===`1.7.4`,i=[`strict digraph DiskGraph {
469
1774
  `,r?``:`node [shape=box,style=rounded]
470
- `,e.colorize?`edge [colorscheme="${Iy}"]\n`:``,`nodesep=0.35;
1775
+ `,e.colorize?`edge [colorscheme="${cb}"]\n`:``,`nodesep=0.35;
471
1776
  `,`subgraph cluster_graph {
472
1777
  `,`color="white";
473
1778
  `],a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=e=>{let t=a.get(e.level)??/* @__PURE__ */ new Set;a.set(e.level,t.add(e.fingerprint))},c=e=>{if(!e)return 1;let t=o.get(e.name)??o.size+2;return o.set(e.name,t),t},l=()=>[`subgraph cluster_legend {graph[style=bold];label = "Next State Actions" style="solid"
474
- `,`node [ labeljust="l",colorscheme="${Iy}",style=filled,shape=record ]\n`,...Ry([...o.keys()],By).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${o.get(e)}]\n`),`}`].join(``),u=()=>[...Ry([...a],e=>e[0]).map(e=>`{rank = same; ${Ry([...e[1]],zy).map(e=>`${e};`).join(``)}}\n`),`}
475
- `,e.colorize&&o.size>1?l():``,`}`].join(``),d=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),i.join(``)+u())};return{writeInitialState:e=>{i.push(`${e.fingerprint} [label="${Hy(e.getLabel())}",style = filled]\n`),s(e),d()},writeSuccessor:(t,n,a,o)=>{let l=e.colorize?String(c(o)):`black`,u=e.actionLabels&&o?Vy(r?o.name:o.signature):``;if(i.push(`${t.fingerprint} -> ${n.fingerprint} [label="${u}",color="${l}",fontcolor="${l}"];\n`),!a){let e=r?``:`,tooltip="${Hy(n.getText())}"`;i.push(`${n.fingerprint} [label="${Hy(n.getLabel())}"${e}];\n`)}s(t),d()},writeStuttering:e=>{i.push(`${e.fingerprint} -> ${e.fingerprint} [style="dashed"];\n`),s(e),d()},close:()=>t?.(e.path,i.join(``)+u())}},Gy=(e,t,n)=>e.dot?Wy(e,t,n):Uy(e,t),Ky=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),qy=(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},Jy=t=>n(new y(`${s}${t}`),e.error),Yy=e=>{let t=Dr(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!I(e)||!I(i))throw Jy(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Xy=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(Xy);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},Zy=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,Qy=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new v(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw Jy(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!P(a)||!L(a))throw Jy(`The symmetry operator must specify a set of functions.`);let o=R(a).elements;if(!o.every(F))throw Jy(`The symmetry values must be function records.`);let s=o.map(Yy),c=r.body.kind===`Apply`?r.body.args:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=Xy(Zy(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(sa.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;s.forEach(e=>{e.size>0&&d.set(Ky(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=qy(n,e),r=Ky(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!Zy(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>I(e)&&m.has(e.name))})),d.size===0)return;let g=Math.max(256,Math.floor(4194304/d.size));return{permutations:[...d.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:g})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:g}},$y=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=nb(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(nb(e[r],t));return a}},eb=(e,t)=>{let n=[],r=[];for(let i of e){let e=nb(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(It);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(It(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},tb=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,nb=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=tb(e);if(n===0||n>64)return rb(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=rb(e,t),a=i!==e&&en(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},rb=(e,t)=>{let n=e.kind;if(n===`Set`){let n=eb(e.elements,t);return n?zt(n):e}if(n===`Function`||n===`LazyFunction`&&L(e.domain)){let n=Dr(e),r=$y(n.domain,t),i=$y(n.range,t)??n.range;if(r){let e=zn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Bt(n.domain,e.range):e}return i===n.range?n:Bt(n.domain,i)}if(n===`Interval`||!P(e)||!L(e))return e;let r=R(e),i=$y(r.elements,t);return i?Nn(i):r},ib=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},ab=(e,t,n)=>e.images[t]??=nb(e.images[0],n.permutations[t-1]),ob=(e,t,n,r)=>{let i=ib(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=It(ab(i,t,r),ab(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},sb=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?ob(i,t,n,r):0;if(o!==0)return o<0}return!1},cb=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>sb(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?ab(ib(e,t),r,t):e)},lb=(e,t)=>e*((t-e)/2**64),ub=e=>e.includes(`.`)?e:`${e}.0`,db=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return ub(String(e));let[n,r]=e.toExponential().split(`e`);return`${ub(n)}E${r.replace(`+`,``)}`},fb=e=>e!==void 0&&e>=`0`&&e<=`9`,pb=e=>{if(e===0)return`0.0`;let t=db(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;fb(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(;fb(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;fb(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(fb(t[n.next])&&Number(t[n.next])>=5&&(n.result=mb(n.result));fb(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},mb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${mb(r)}.`:n===`9`?`${mb(r)}0`:`${r}${Number(n)+1}`},hb=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}`)},gb=(e,t,n)=>{if(lb(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},_b=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}).`},vb=(e,t)=>({...e,traceOutput:[...e.traceOutput??[],...t]}),yb={line:0,column:0},bb=`Failed to recover the initial state from its fingerprint.`,xb=`Failed to recover the next state from its fingerprint.`,Sb=e=>({kind:`Identifier`,name:e,location:yb}),Cb=/* @__PURE__ */ new Set([`name`,`property`]),wb=(e,t,n)=>{let r=dl(t,n);if(!r)throw new v(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new v(Cb.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},Tb=(e,t,n)=>{if(hl(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return W(Sb(e),Jb(n,void 0,void 0))}catch(e){if(e instanceof y||c(e))return;throw e}},Eb=(e,t,n)=>{let r=wb(e,t,n);if(Tb(t,r,n)!==void 0)throw new v(`The ${e} ${t} cannot be a constant.`);return r},Db=(e,t,n)=>{let r=n.constants.has(t)?void 0:wb(e,t,n),i=r?Tb(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new v(`The ${e} of ${t} is equal to ${z(i)}`);return i===void 0?r:void 0},Ob=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},kb=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Ul(e.startupDefinitions,r),t.invariants.forEach(e=>{Db(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Ab=(t,r)=>{let i=s_({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>dl(e,r)});return t.flatMap(t=>{let a=Db(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
1779
+ `,`node [ labeljust="l",colorscheme="${cb}",style=filled,shape=record ]\n`,...ub([...o.keys()],fb).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${o.get(e)}]\n`),`}`].join(``),u=()=>[...ub([...a],e=>e[0]).map(e=>`{rank = same; ${ub([...e[1]],db).map(e=>`${e};`).join(``)}}\n`),`}
1780
+ `,e.colorize&&o.size>1?l():``,`}`].join(``),d=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),i.join(``)+u())};return{writeInitialState:e=>{i.push(`${e.fingerprint} [label="${mb(e.getLabel())}",style = filled]\n`),s(e),d()},writeSuccessor:(t,n,a,o)=>{let l=e.colorize?String(c(o)):`black`,u=e.actionLabels&&o?pb(r?o.name:o.signature):``;if(i.push(`${t.fingerprint} -> ${n.fingerprint} [label="${u}",color="${l}",fontcolor="${l}"];\n`),!a){let e=r?``:`,tooltip="${mb(n.getText())}"`;i.push(`${n.fingerprint} [label="${mb(n.getLabel())}"${e}];\n`)}s(t),d()},writeStuttering:e=>{i.push(`${e.fingerprint} -> ${e.fingerprint} [style="dashed"];\n`),s(e),d()},close:()=>t?.(e.path,i.join(``)+u())}},_b=(e,t,n)=>e.dot?gb(e,t,n):hb(e,t),vb=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),yb=(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},bb=t=>n(new y(`${s}${t}`),e.error),xb=e=>{let t=Mr(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!F(e)||!F(i))throw bb(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Sb=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(Sb);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},Cb=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,wb=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new v(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw bb(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!N(a)||!I(a))throw bb(`The symmetry operator must specify a set of functions.`);let o=L(a).elements;if(!o.every(P))throw bb(`The symmetry values must be function records.`);let s=o.map(xb),c=r.body.kind===`Apply`?r.body.args:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=Sb(Cb(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(ma.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;s.forEach(e=>{e.size>0&&d.set(vb(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=yb(n,e),r=vb(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!Cb(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>F(e)&&m.has(e.name))})),d.size===0)return;let g=Math.max(256,Math.floor(4194304/d.size));return{permutations:[...d.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:g})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:g}},Tb=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Ob(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(Ob(e[r],t));return a}},Eb=(e,t)=>{let n=[],r=[];for(let i of e){let e=Ob(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(zt);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(zt(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},Db=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,Ob=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Db(e);if(n===0||n>64)return kb(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=kb(e,t),a=i!==e&&an(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},kb=(e,t)=>{let n=e.kind;if(n===`Set`){let n=Eb(e.elements,t);return n?Ht(n):e}if(n===`Function`||n===`LazyFunction`&&I(e.domain)){let n=Mr(e),r=Tb(n.domain,t),i=Tb(n.range,t)??n.range;if(r){let e=Un(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Ut(n.domain,e.range):e}return i===n.range?n:Ut(n.domain,i)}if(n===`Interval`||!N(e)||!I(e))return e;let r=L(e),i=Tb(r.elements,t);return i?Ln(i):r},Ab=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},jb=(e,t,n)=>e.images[t]??=Ob(e.images[0],n.permutations[t-1]),Mb=(e,t,n,r)=>{let i=Ab(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=zt(jb(i,t,r),jb(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},Nb=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?Mb(i,t,n,r):0;if(o!==0)return o<0}return!1},Pb=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>Nb(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?jb(Ab(e,t),r,t):e)},Fb=(e,t)=>e*((t-e)/2**64),Ib=e=>e.includes(`.`)?e:`${e}.0`,Lb=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Ib(String(e));let[n,r]=e.toExponential().split(`e`);return`${Ib(n)}E${r.replace(`+`,``)}`},Rb=e=>e!==void 0&&e>=`0`&&e<=`9`,zb=e=>{if(e===0)return`0.0`;let t=Lb(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Rb(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(;Rb(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Rb(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Rb(t[n.next])&&Number(t[n.next])>=5&&(n.result=Bb(n.result));Rb(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Bb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Bb(r)}.`:n===`9`?`${Bb(r)}0`:`${r}${Number(n)+1}`},Vb=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}`)},Hb=(e,t,n)=>{if(Fb(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},Ub=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}).`},Wb=(e,t)=>({...e,traceOutput:[...e.traceOutput??[],...t]}),Gb={line:0,column:0},Kb=`Failed to recover the initial state from its fingerprint.`,qb=`Failed to recover the next state from its fingerprint.`,Jb=e=>({kind:`Identifier`,name:e,location:Gb}),Yb=/* @__PURE__ */ new Set([`name`,`property`]),Xb=(e,t,n)=>{let r=xl(t,n);if(!r)throw new v(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new v(Yb.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},Zb=(e,t,n)=>{if(Tl(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return W(Jb(e),bx(n,void 0,void 0))}catch(e){if(e instanceof y||c(e))return;throw e}},Qb=(e,t,n)=>{let r=Xb(e,t,n);if(Zb(t,r,n)!==void 0)throw new v(`The ${e} ${t} cannot be a constant.`);return r},$b=(e,t,n)=>{let r=n.constants.has(t)?void 0:Xb(e,t,n),i=r?Zb(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new v(`The ${e} of ${t} is equal to ${z(i)}`);return i===void 0?r:void 0},ex=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},tx=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),$l(e.startupDefinitions,r),t.invariants.forEach(e=>{$b(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},nx=(t,r)=>{let i=M_({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>xl(e,r)});return t.flatMap(t=>{let a=$b(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
476
1781
  Note that a bug can cause TLC to incorrectly report this error.
477
1782
  If you believe your TLA+ or PlusCal specification to be correct,
478
- please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new v(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Sb(t),scope:void 0}]})},jb=(e,t)=>{if(!F(e))return;let n=Dr(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])))},Mb=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Mb(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=dl(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Mb(n.body,t)}return[e]},Nb=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||zv(r,e.scope,t)>0)return!1;let i=W(r,Jb(t,void 0,void 0,e.scope));if(i===!1)throw new v(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new v(`The operator ${r.name}, which equals ${z(i)},\ncannot be used as a ${n}`);return!0},Pb=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return Eb(t,e,r),Sb(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let i=[],a=[],o=[],s=wb(`name`,t.specification,r),c=Tb(t.specification,s,r);if(c!==void 0)throw new v(`The value of ${t.specification} is equal to ${z(c)}`);if(Hv(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Nb(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new v(`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`&&zv(c.expression,s.scope,r)<2)throw n(new y(`TLC cannot handle the temporal formula ${Jc(c.expression)}`),e.error);let l=zv(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new v(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new v(`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:yb},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},Fb=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=Db(`property`,e,t);if(!i)return;zv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Hv(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(Nb(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&zv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!B(e)?dl(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=zv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new v(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},Ib=(e,t,n)=>t.flatMap(t=>Db(e,t,n)?[{name:t,expression:Sb(t),scope:void 0}]:[]),Lb=(e,t)=>{let n=dl(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Rb=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);Eb(`possible`,n,t);let i=Sb(n);if(zv(i,void 0,t)===3)throw new v(`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}}),zb=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||B(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Bb=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=dl(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},Vb=(e,t)=>e.flatMap(e=>Mb(e.expression,t).map(n=>{let r=e.scope===void 0?vd(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:zb(n,r,t),predicate:Bb(e.expression,t)}})),Hb=(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},Ub=/[\u0100-\uffff]/,Wb=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Gb=e=>e.kind===`String`?Ub.test(e.value):e.kind===`Set`&&e.elements.some(Gb),Kb=e=>e.kind===`String`&&Ub.test(e.value)||e.kind===`Apply`&&Wb.has(e.operator)||hi(e).some(Kb),qb=(e,t)=>e.constants.some(e=>Gb(e.value)||(e.args??[]).some(Gb))||[...t.definitions.values()].some(e=>Kb(e.body)||e.kind===`Function`&&e.bounds.some(e=>Kb(e.set))),Jb=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),Yb=(e,t,n)=>ul(W(e,t),n),Xb=(e,t,n=Zb)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},Zb=(e,t)=>{let n=e.kind===`Identifier`?dl(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?qc(i):Yc(r)}`},Qb=(e,t)=>Xb(e.expression,t,(n,r)=>(Xb(e.predicate,t),Zb(n,r))),$b=()=>{},ex=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=Yb(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),tx=(e,t,n)=>{try{return Yb(e,Jb(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},nx=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=tx(n.expression,t,`an assumption`);if(e)return{name:Jc(n.expression),trace:[],message:e.message}}},rx=(t,r,i,a)=>{let o=Ab(t.invariants,r),c=Pb(t,r),l=Fb(t,r,a),u=Vb([...o,...l.invariants],r),d=[...new Map(u.map(e=>[e.predicate,e])).values()],f=u.length>0||l.actionProperties.length>0||l.liveness.length>0;if(c.init===void 0&&(f||l.initialPredicates.length>0||r.variables.length>0))throw new v(r.runtime.version===`1.7.4`?da:`The configuration file did not specify the initial state predicate.`);if(c.next===void 0&&f)throw new v(`The configuration file did not specify the next state predicate.`);let p=Vb(Ib(`constraint`,t.constraints,r),r),m=Ib(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&wb(`rlreward`,t.rlReward,r),t.periodic!==void 0&&wb(`periodic`,t.periodic,r);let h=Rb(t.possible,r);if(r.variables.length===0)return;let g=t.symmetry===void 0?void 0:Qy(t.symmetry,r,t.substitutions);t.view!==void 0&&wb(`view function`,t.view,r);let _=t.view===void 0?void 0:{name:t.view,expression:Sb(t.view),scope:void 0},b=l.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:yb};return{...e,unchanged:t}}),ee=e=>zv(e.expression,void 0,r)>=2,x=h.filter(e=>!ee(e)),S=h.filter(ee),C=r.runtime,te={indices:void 0},ne=()=>{if(te.indices)return te.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return te.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),te.indices},re=(e,t)=>W(e,Jb(r,t,void 0)),ie=e=>{let t=ne(),n=g===void 0?e:cb(e,g,t);return em(_===void 0?t.map(e=>n[e]):[re(_.expression,n)])},ae=qb(t,r);C.getFingerprint=ie;let oe=()=>{let e=h.find(e=>!C.possibleCounts.get(e.name));if(!e)return;let t=Lb(e.name,r),n=t?` at ${qc(t)}`:``;return{name:e.name,code:sa.possibleUnwitnessed,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:N(z(xm(C),!0))}};return{properties:l,spec:c,isSymmetric:g!==void 0,isConstrained:p.length>0||m.length>0,getTlcOrder:ne,getStoredFingerprints:(e,t)=>{if(_!==void 0||ae)return BigInt64Array.from(e,ie);let n=new BigInt64Array(t.length),r=rm(ne(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ae)return[String(ie(e))];let t=g===void 0?e:cb(e,g,ne());return _===void 0?t:[re(_.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(Hb(a,t,i))return!1;try{let e=Jb(r,t,void 0,a.scope),n=a.membership;return i&&n?!Er(t[n.variable],i[n.variable],W(n.set,e)):!Qb(a,e)}catch(t){throw i?ux(n(t,e.safetyEvaluationFailure),sa.invariantEvaluationFailed,`Evaluating invariant ${a.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Xb(n,Jb(t,e,void 0,r));p.every(e=>r(e.predicate,e.scope))&&n();let i=d.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=l.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(p.every(e=>Xb(e.predicate,Jb(n,t,void 0,e.scope)))&&m.every(r=>Xb(r.expression,Jb(n,e,t,r.scope))))||r())||d.every(e=>Xb(e.predicate,Jb(n,t,void 0,e.scope))))&&b.every(r=>Xb(r.box,Jb(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>p.every(n=>Hb(n,e,t)||Qb(n,Jb(r,e,void 0))),findFailedInitialPredicate:e=>l.initialPredicates.find(t=>!Xb(t.expression,Jb(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>b.find(n=>{try{return!Xb(n.action,Jb(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Jc(n.box)}`)&&!Yb(n.unchanged,Jb(r,e,t,n.scope),`a subscript`)}catch(e){throw ux(ix(e),sa.actionPropertyEvaluationFailed,`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>m.every(n=>Xb(n.expression,Jb(r,e,t),e=>`${s}${Zb(e,r)}`)),trackStatePossible:x.length===0?$b:e=>ex(x,C,Jb(r,e,void 0)),trackActionPossible:S.length===0?$b:(e,t)=>ex(S,C,Jb(r,e,t)),findUnwitnessedPossible:oe,findPostconditionViolation:(i=!1)=>{let a=t.postconditions.find(e=>{let t=dl(e,r);return t!==void 0&&r.definitionValues.has(t)});if(a!==void 0){if(i)return;throw n(new y(`${s}The post condition ${a} cannot be a constant.`),e.error)}let o=oe();if(o)return o;for(let e of t.postconditions){let t=tx(Sb(e),r,`a postcondition`);if(!t)continue;let n=Lb(e,r),i=n?` at ${qc(n)}`:``;return t.message===void 0?{name:e,code:sa.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:sa.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},ix=e=>e instanceof C?n(e,e.exitCode):e,ax=/* @__PURE__ */ Error(`The replay stopped`),ox=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),sx=t=>{let n=ga(t.message);return n&&!n.isEvalException&&ox.has(n.code)?e.configParseError:oe(t)},cx=t=>{let n=t.cause;return n instanceof y?cx(n):t instanceof C?t.exitCode:e.specEvaluationFailure},lx=/* @__PURE__ */ new WeakMap,ux=(e,t,r)=>{if(!(e instanceof y))return e;let i=n(new y(`${r}\n${e.message}`,e),oe(e));return lx.set(i,{code:t,headline:r,inner:e}),i},dx=s.slice(0,s.indexOf(`
479
- `)),fx=`${s}tlc2.tool.EvalException: `,px=`${s}util.Assert$TLCRuntimeException: `,mx=o(`tlc2.tool.EvalException`),hx=e=>_a(e)?fx:px,gx=e=>{try{return e()}catch(e){throw e instanceof y?_a(e)?new y(`${mx}${e.message}`):ga(e.message)?e:new y(`${s}${e.message}`):e}},_x=[fx,px,s,mx],vx=(e,t)=>{let n=lx.get(e);if(n)return`${n.headline}\n${vx(n.inner,t)}`;let r=e.message,i=_x.find(e=>r.startsWith(e))??``;return`${i}${ba(r.slice(i.length),t)}`},yx=(e,t)=>{let n=lx.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:vx(e,!0)};if(t&&_a(e))return{code:ga(r)?.code??sa.general,message:r,toolMessage:r};let i=t&&!r.startsWith(dx)?s:``;return{code:sa.general,message:`${i}${r}`,toolMessage:`${i}${vx(e,!0)}`}},bx=e=>{let t=e.dump&&Gy(e.dump,e.writeFile,e.version);try{return Sx(e,t)}catch(e){throw c(e)?xx():e}finally{t?.close()}},xx=()=>n(new ee,e.error),Sx=(t,i)=>{let o=typeof t.config==`string`?it(t.config,t.version):t.config,l=t.onPrint??console.log,u={lines:void 0},d=e=>{u.lines?u.lines.push(e):l(e)},f=e=>{let t=u.lines,n=[];u.lines=n;try{return{result:e(),lines:n}}finally{u.lines=t}};wt(P_(t.source,o,t.loadModule)),Et(t.version);let p=J_(o,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:d,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed,isTool:t.isTool,isTraceRecorded:t.isTraceRecorded,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version});kb(p,o,t.onProgress);let m=p.environment,h=m.runtime,g=h.version===`1.7.4`;h.pause=t.onPause??(()=>{}),h.getSpecification=()=>Fy(o,m,p.variableLocations,p.instanceActions);let _={depth:0,initialStates:void 0},b=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:h.generatedStates,distinctStates:h.distinctStates,queuedStates:h.queueSize,depth:h.generatedStates===0?0:Math.max(_.depth,1),initialStates:_.initialStates,outDegrees:void 0,fingerprintDistance:void 0}),S=Array.from({length:32},()=>0),ne={newStates:0},re=()=>Math.min(ne.newStates,31),ie=()=>S.map((e,t)=>t===re()?e+1:e),ae=()=>g?[...S]:ie(),se=(e,t,n)=>g?[]:e.getViolatedProperties(t,n),ce=(e,t=[...S])=>({...e,violationOutDegrees:t}),w=()=>({...b(`success`),outDegrees:[...S],fingerprintDistance:gb(h.distinctStates,h.generatedStates,()=>T?T.getStoredFingerprints(A,Ee):BigInt64Array.from(A,h.getFingerprint))}),T=rx(o,m,()=>N_(t.source,t.loadModule),t.onProgress),E=()=>nx(p.assumptions,m);if(!T){h.isStarted=!0;let e=E();return e?b(`assumption-violation`,e):(_.initialStates={generated:0,distinct:0},t.onProgress?.({kind:`initial-states-started`}),t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates}),w())}let D=o.postconditions.length>0||o.possible.length>0,le=/* @__PURE__ */ new WeakMap,ue=e=>le.get(e)?.state??e.state,de=e=>{let t=le.get(e)?.action;return t?dy(t):Th(e.action)},fe=(e,t)=>{D&&(h.counterExample=Eh(e.map(ue),e.slice(1).map(de),t));let n=T.findUnwitnessedPossible(),r=n?{result:void 0,lines:[]}:f(()=>T.findPostconditionViolation(!0));return{unwitnessed:n,postcondition:r.result,lines:r.lines}},pe=(e,t,n)=>{let r=t.loopStart,i=fe(t.trace,r===void 0||!n?void 0:{start:r,action:n()}),a=[...t.traceOutput??[],...i.lines];return b(e,{...t,...a.length>0&&{traceOutput:a},...i.unwitnessed&&{unwitnessed:i.unwitnessed},...i.postcondition&&{postcondition:i.postcondition}})},me=T.spec,he=T.getFingerprintState,ge={value:void 0},O=()=>ge.value??=jy(o,m,p.instanceActions),_e=e=>{let t=Lu(m),n=t.callStack;try{e(t);return}catch(e){return c(e)?{callStack:[],fingerprint:void 0}:!(e instanceof y)||!n?void 0:{callStack:n.expressions,fingerprint:n.fingerprint}}},ve=(e,t)=>{if(typeof e!=`object`)return[];let n=t.get(e),r=qr(e).find(e=>Kr(e)!==void 0);return[...n?[n]:[],...r===void 0?[]:ve(r,t)]},ye=(e,t)=>{for(let n of he(e)){let e=Kr(n);if(!e)continue;let r=t?ve(n,t.sources):[];throw t&&r.length>0&&(t.expressions.length=0,t.isFrozen=!0,t.fingerprint={sources:r,reason:e.message}),e}e.forEach(Xt)},be=()=>{let e=tt.fingerprint?[tt.fingerprint]:[];return(t,n)=>{ye(t,n);let r=he(t);return Qe(Je(r),r)!==-1||e.some(e=>Xe(e,r))?!1:(e.push(r),h.distinctStates++,!0)}},xe=()=>{let e={count:0},t=[],n=be();return _e(r=>{if(qs(Ay(o,m,p.instanceActions),r,i=>{if(Ob(e.count,e=>u.lines?.push(e)),e.count++,h.generatedStates=e.count,!(t.length>0))try{let e=T.checkReplayedInitialState(i,r,()=>{n(i,r.callStack)&&(h.queueSize++,k?.addInitialState(A.length,i,r))});if(e){let t=Ie([{action:void 0,state:i}],[]).trace[0].state;throw u.lines?.push({kind:`initial-state-violation`,...e,state:t}),ax}}catch(e){if(!(e instanceof y)||!r.callStack?.fingerprint)throw e;t.push(e)}}),t.length>0)throw t[0]})},Se=e=>_e(t=>{let n=A[e],r=i&&ot(n,ke[e]),a=be();Js(O(),n,t,(o,s)=>{if(!T.checkReplayedSuccessor(n,o,t,()=>{let n=a(o,t.callStack);return r&&i?.writeSuccessor(r,ot(o,ke[e]+1),!n,F?{name:s.name,signature:Py(s)}:void 0),n}))throw ax})}),Ce=o.view!==void 0||o.symmetry!==void 0,we=[];T.properties.liveness.length>0&&t.onProgress?.({kind:`liveness-initializing`,isSymmetric:T.isSymmetric,isConstrained:T.isConstrained});let k=a(()=>gx(()=>sy(T.properties.liveness,me.temporals,m,{getFingerprint:({index:e,state:t})=>we[e]??=Number(BigInt.asIntN(32,h.getFingerprint(t))),getSuccessors:(e,t)=>{let n=[];if(me.next===void 0)return n;let r=M.livenessSource;return M.livenessSource=e,Bc(me.next,t,m,e=>{if(je(e.state),!(T.satisfiesConstraints(e.state,t)&&T.satisfiesActionConstraints(t,e.state)))return!1;let r=he(e.state),i=Qe(Je(r),r);return n.push({index:i,state:e.state}),!1},me.scope),M.livenessSource=r,n}})));h.isStarted=!0;let Te=T.isSymmetric||k!==void 0,A=[],Ee=[],De=[],Oe=[],ke=[],Ae={slots:new Int32Array(1<<17),size:0,shift:16},je=mi(),Me=e=>Object.fromEntries(T.getTlcOrder().map(t=>[m.variables[t],e[t]])),Ne=(e,t,n,r)=>(h.getLevel=()=>n+1,h.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Pe(e,t[n].state,(t[n+1]??t[r??n]).state)),Pe=(e,n,r)=>{try{let t=Eb(`alias`,e,m).body,i=W(Sb(e),Jb(m,n,r)),a=t.kind===`Record`?t.fields.map(e=>e.name):[];return jb(i,a)??Me(n)}catch(e){if(!(e instanceof v||e instanceof y))throw e;return{...Me(n),_ALIASEvalError:ba(e.message,t.isTool??!1)}}},Fe=(e,t,n,r)=>{let i=O(),a={...M};Object.assign(M,{index:e,isExpanding:!0,candidate:void 0});let o=r?e=>e:he,s=o(n),c=i.find(e=>Vc(e.expression,t,m,e.scope).some(e=>Xe(o(e.state),s)));return Object.assign(M,a),c},Ie=(e,n,r={})=>{let i=o.alias,a=r.known??1,s=e.length>1?f(Le).lines:[],c=e.map((t,r)=>r===0||t.action===`Stuttering`?{result:void 0,lines:[]}:f(()=>Fe(n[r-1],e[r-1].state,t.state,a===2&&r===e.length-1))),l=c.map(e=>e.lines),u=r.loopStart,d=g&&u!==void 0?u+1:e.length-a,p=d>0?[s,...l.slice(1,d)].flat():[];return{trace:e.map((n,r)=>{let a=c[r].result,o={action:n.action,label:a&&Ny(a,t.version),state:i===void 0?Me(n.state):Ne(i,e,r,u),output:r===0?p:r<d?[]:l[r]};return(i!==void 0||a)&&le.set(o,{state:Me(n.state),action:a}),o}),traceOutput:a>0&&!g?[s,...l].flat():[]}},Le=()=>me.init===void 0?[]:zc(me.init,m,me.scope),Re=(e,t)=>f(()=>{for(let n of O()){let r=Vc(n.expression,e,m,n.scope).find(t);if(r)return{...r,action:r.action??n.name}}}).result,ze=(e,t)=>Xe(he(e),Ee[t]),j=(e,t)=>Re(e,e=>ze(e.state,t)),Be=(e,t)=>{let n=f(()=>Ce||xu(m)?Le().find(t=>ze(t,e[0])):A[e[0]]).result;if(!n)throw new y(bb);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=j(i,e[n]);if(!a)throw new y(t);r.push(a)}return r},Ve=(e,t)=>{let n=[];for(let t=e;t!==-1;t=De[t])n.unshift(t);let r=Ce&&n.length>1?Be(n,bb):n.map(e=>({state:A[e],action:Oe[e]}));if(!t)return Ie(r,n);let i=Ce?Re(A[e],e=>Xe(e.state,t.state))?.action:t.action;return Ie([...r,{state:t.state,action:i}],n,{known:2})},He=e=>De[e]===-1?{trace:[{action:void 0,label:void 0,state:Me(A[e])}],traceOutput:g?[]:f(Le).lines}:Ve(e),Ue=(e,t)=>({trace:Ve(e,t).trace}),We=(t,n)=>n.isInitial&&!n.callStack&&!n.fingerprint&&g?e.success:n.callStack?n.isCallStackFirst?oe(t):n.isLiveCallStack?r(t)??(t instanceof C?t.exitCode:e.error):n.isInitial||n.fingerprint?e.specEvaluationFailure:cx(t):n.isInitial?sx(t):oe(t),Ge=(e,t,n={})=>{let r=c(e)?new ee:e;if(!(r instanceof y))throw r;let i=t.trace.length>0&&!n.traceFailure?fe(t.trace,void 0):void 0,a=i?.unwitnessed??i?.postcondition,o=[...t.traceOutput??[],...i?.lines??[]];return{...b(`error`,void 0,{...yx(r,n.isNextState??!1),...t,...o.length>0&&{traceOutput:o},...a&&{postcondition:a},initialState:n.initialState&&!(r instanceof C)?Me(n.initialState):void 0,exitCode:We(r,n),callStack:n.callStack,...n.isCallStackFirst&&{isCallStackFirst:!0},...n.fingerprint&&{fingerprint:n.fingerprint},...n.traceFailure&&{traceFailure:n.traceFailure}}),outDegrees:n.outDegrees}},Ke=(n,r)=>{h.generatedStates++;let i=O(),a=i.length===1?i[0]:i.find(e=>e.name===r.action),o=r.variables,s=i.length===1?`the next-state action`:`action ${r.action} of the next-state relation`,c=g?`assigned`:`defined`,l=`Successor state is not completely specified by ${s}. The following variable${o.length>1?`s are`:` is`} not ${c}: ${o.join(`, `)}.\n`,u=Rt(`null`),d=r.state.map(e=>e??u),f=Ge(r,He(n));return ce({...f,failure:f.failure&&{...f.failure,code:sa.incompleteSuccessor,message:l,toolMessage:l,exitCode:e.specEvaluationFailure,trace:[...f.failure.trace,{action:r.action,label:a&&Ny(a,t.version),state:Me(d)}]}})},qe=(e,t)=>{let n=Be(e,xb),r=n[n.length-1].state;if(Ce&&t!==void 0&&t!==e.length-1&&j(r,e[t])===void 0)throw new y(xb);return n},Je=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=zr(t,Jr(e[n]));return t&1073741823},Ye=e=>{for(let t of e){let e=Kr(t);if(e)throw e}},Xe=(e,t)=>{for(let n=0;n<t.length;n++)if(!en(e[n],t[n]))return!1;return!0},Ze=e=>Math.imul(e,2654435761)>>>Ae.shift<<1,Qe=(e,t)=>{let n=Ae.slots.length-1;for(let r=Ze(e);;r=r+2&n){let n=Ae.slots[r+1];if(n===0)return-1;if(Ae.slots[r]===e&&Xe(Ee[n-1],t))return n-1}},$e=(e,t)=>{let n=Ae.slots.length-1,r=Ze(e);for(;Ae.slots[r+1]!==0;)r=r+2&n;Ae.slots[r]=e,Ae.slots[r+1]=t},et=(e,t)=>{if(Ae.size++,Ae.size*4>Ae.slots.length){let e=Ae.slots;Ae.slots=new Int32Array(e.length*2),Ae.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&$e(e[t],e[t+1])}$e(e,t+1)},tt={fingerprint:void 0},nt=e=>{h.distinctStates=A.length+1,_.depth=Math.max(_.depth,e),h.diameter=Math.max(h.diameter,e)},rt=(e,t,n,r)=>{let i=n===-1?1:ke[n]+1;A.push(e),Ee.push(t),De.push(n),Oe.push(r),ke.push(i)},M={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},at=e=>e===-1?[]:[...at(De[e]),A[e]];h.isSeen=e=>{let t=he(e);return Qe(Je(t),t)!==-1},h.getBehavior=e=>{let t=e===M.candidate?-1:A.indexOf(e);return t===-1?[...at(M.index),e]:at(t)},h.getCurrentState=()=>M.index===-1?void 0:A[M.index],h.setLivenessSource=e=>{M.livenessSource=e??-1},h.getLevel=e=>{let t=M.livenessSource;if(g){let e=t===-1?M.isExpanding?M.index:-1:t;return e===-1?0:ke[e]}return t===-1?e===M.candidate?M.candidateLevel:M.index===-1?0:e===A[M.index]?ke[M.index]:M.isExpanding?ke[M.index]+1:0:e===A[t]?ke[t]:ke[t]+1};let ot=(e,t)=>({fingerprint:BigInt.asIntN(64,h.getFingerprint(e)),level:t,getLabel:()=>fi(o.alias===void 0?Me(e):Pe(o.alias,e,void 0)),getText:()=>fi(Me(e))}),st=e=>{je(e),h.generatedStates++,h.initialStates++,M.candidate=e,M.candidateLevel=1;let t=he(e),n=Je(t),r=T.satisfiesConstraints(e);if(r&&(T.trackStatePossible(e),Ye(t),e.forEach(Xt)),r&&Qe(n,t)!==-1)return;tt.fingerprint=r?t:void 0,r&&(nt(1),h.queueSize++,k?.addInitialState(A.length,e),i?.writeInitialState(ot(e,1)));let a=T.findViolatedInvariant(e);if(a)return pe(`invariant-violation`,{name:a.name,...Ie([{action:void 0,state:e}],[])});let o=T.findFailedInitialPredicate(e);if(o)return pe(`liveness-violation`,{name:o.name,...Ie([{action:void 0,state:e}],[])});r&&(et(n,A.length),rt(e,t,-1,void 0))},ct=(e,t,n,r,a)=>{let o=A[e];h.generatedStates++,M.candidate=t.state,M.candidateLevel=ke[e]+1,Te&&je(t.state);let s=he(t.state),l=Je(s),u=Qe(l,s),d=T.satisfiesConstraints(t.state,o);d&&T.trackStatePossible(t.state);let p=d&&T.satisfiesActionConstraints(o,t.state);p&&(T.trackActionPossible(o,t.state),Ye(s),t.state.forEach(Xt));let m=p?u:-1;if(r&&p&&i?.writeSuccessor(r,ot(t.state,ke[e]+1),m!==-1,a&&{name:a.name,signature:Py(a)}),m!==-1&&k){let e=A[m],r=e.every((e,n)=>e===t.state[n]);n.push({index:m,state:r?e:t.state})}let g=p&&m===-1;if(g&&k&&n.push({index:A.length,state:t.state}),tt.fingerprint=g?s:void 0,g&&(nt(ke[e]+1),ne.newStates++),m===-1)try{let n=T.findViolatedInvariant(t.state,o);if(n)return ce(pe(`invariant-violation`,{name:n.name,...Ve(e,t)}))}catch(n){if(c(n))throw n;let r=f(()=>Se(e));return Ge(n,vb(Ue(e,t),r.lines),r.result??{outDegrees:ae()})}let _=T.findViolatedActionProperty(o,t.state);if(_)return ce(pe(`liveness-violation`,{name:_.name,...Ve(e,t)}));g&&(Te||je(t.state),et(l,A.length),rt(t.state,s,e,t.action),h.queueSize++)},N={result:void 0};k&&t.onProgress?.({kind:`liveness-prepared`,branches:k.branches});let P=E();if(P)return b(`assumption-violation`,P);if(t.onProgress?.({kind:`initial-states-started`}),me.init!==void 0)try{Rc(me.init,m,e=>{Ob(h.initialStates,t.onProgress);try{N.result=st(e)}catch(t){let n=f(xe);N.result=Ge(t,{trace:[],traceOutput:n.lines},{initialState:e,...n.result,isInitial:!0})}return N.result!==void 0},me.scope)}catch(e){if(e instanceof te){let t=Ge(e,{trace:[]},{initialState:e.state.map(e=>e??Rt(`null`))});return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}let t=f(xe);return Ge(e,{trace:[],traceOutput:t.lines},{...t.result,isInitial:!0})}if(N.result)return N.result;_.initialStates={generated:h.initialStates,distinct:h.distinctStates},t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates});let lt=me.next;if(lt===void 0){if(A.length>0)throw new y(`No next state actions defined to generate successor states from.`);return w()}let F=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),I=(e,t)=>{if(!F)return Bc(lt,e,m,e=>t(e,void 0),me.scope);let n={isStopped:!1};return O().reduce((r,i)=>n.isStopped?r:r+Bc(i.expression,e,m,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},ut=(e,t)=>{if(!k||g)return;let n=_e(n=>k.addState(e,A[e],t,n));return n?.callStack.length&&!n.fingerprint?n.callStack:void 0},dt=(e,t)=>{try{k?.addState(e,A[e],t);return}catch(n){if(!(n instanceof y))throw n;return ut(e,t)}},ft=(e,t)=>{let n=f(()=>dt(e,t));if(n.result)return{result:{callStack:n.result,fingerprint:void 0,isLiveCallStack:!0},lines:n.lines};let r=f(()=>Se(e));return{result:r.result,lines:[...n.lines,...r.lines]}},pt=e=>Ge(xx(),He(e)),mt=(e,t,n)=>{if(c(e))return pt(t);let r=ft(t,n);return Ge(ix(e),vb(He(t),r.lines),{isNextState:!0,...r.result})},ht=(t,r)=>{let a=A[t],l=i&&ot(a,ke[t]),u=I(a,(e,n)=>{try{N.result=ct(t,e,r,l,n)}catch(n){if(c(n))return N.result=pt(t),!0;let i=g?f(()=>Se(t)):ft(t,r);if(g&&n instanceof y&&!lx.has(n))return N.result=Ge(new y(`${hx(n)}${n.message}`,n),vb({trace:[]},i.lines),{isNextState:!0,...i.result}),!0;let a=he(e.state).some(e=>Kr(e)!==void 0)&&n instanceof y?yx(_a(n)?new y(`${mx}${n.message}`):n,!0):void 0;N.result=Ge(n,vb(a?He(t):Ue(t,e),i.lines),{isNextState:!0,...i.result,traceFailure:a})}return N.result!==void 0});M.isExpanding=!1;let d=N.result;if(d?.violation&&!g){let e=f(()=>dt(t,r));return{...d,violation:vb(d.violation,e.lines),...e.result&&{liveCallStack:e.result}}}if(d)return d;let p=()=>{k&&l&&g&&i?.writeStuttering(l);let e=k?.addState(t,a,r);if(!k||!e)return;let n=qe(e),o=se(k,n.map(e=>e.state),n.length-1);return pe(`property-violation`,{name:o[0],properties:o,...Ie(n,e,{known:0})})};if(u===0&&o.checkDeadlock){let e=pe(`deadlock`,{name:`deadlock`,...He(t)}),n=f(()=>{try{return{additional:p()?.violation}}catch(e){if(!(e instanceof y))throw e;return{isFailed:!0,callStack:ut(t,r)}}}),i=e.violation?{...e,violation:vb(e.violation,n.lines)}:e,a=ce(i,n.result.isFailed?ae():ie());return n.result.additional?{...a,additionalViolation:n.result.additional}:n.result.callStack?{...a,liveCallStack:n.result.callStack}:a}try{return p()}catch(i){if(g&&i instanceof y){let t=new y(`${_a(i)?mx:s}${i.message}`);return Ge(n(t,e.error),{trace:[]},{outDegrees:ae()})}let o=_e(e=>k?.addState(t,a,r,e));return Ge(i,He(t),{outDegrees:ae(),callStack:o?.callStack.length?o.callStack:void 0,isNextState:!0,isCallStackFirst:!0})}},gt=()=>{let e=o.specification,t=`(compare Chapter 8, page 87ff of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`;if(e===void 0)return{code:sa.noSpecificationButProperty,text:`The stuttering counterexample above may be caused by the absence of a behavior specification (SPECIFICATION). Only INIT and NEXT have been provided, so TLC permits infinite stuttering. To rule out such counterexamples, use SPECIFICATION Spec, with Spec asserting a suitable fairness constraint ${t}`};let n=dl(e,m)?.location.range;if(!(me.temporals.length>0||!n))return{code:sa.noFairnessButProperty,text:`The stuttering counterexample above may be caused by the absence of a fairness constraint in the behavior specification ${e} defined at ${qc(n)}. To rule out such counterexamples, conjoin a suitable fairness constraint to ${e} ${t}`}},_t=(e,n)=>{let r=[...n.prefix,...n.cycle],i=n.prefix.length,a=qe(r,i),o=Ie(a,r,{loopStart:i,known:0}).trace,s=se(e,a.map(e=>e.state),i),c=r[i],l=r[r.length-1],u=a[a.length-1].state,d=c===l?{result:void 0,lines:[]}:f(()=>Fe(l,u,A[c],!1)),p=c===l&&n.isCycleConstrained;return pe(`liveness-violation`,{name:s[0],properties:s,trace:o,traceOutput:d.lines,loopStart:i,loopLabel:d.result&&Ny(d.result,t.version),warning:p?gt():void 0},()=>c===l?de(o[o.length-1]):d.result?dy(d.result):Th(j(u,c)?.action))},vt=k!==void 0&&t.livenessCheck!==`final`,yt=performance.now(),bt={at:yt+3e3,size:1,time:0},xt=e=>{let n=performance.now();if(!((e-bt.size)/bt.size>.1)||bt.time>(n-yt)*.2||(bt.size=e,!k))return;t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!1,states:e,statistics:b(`success`)});let r=k.findViolation();return r||t.onProgress?.({kind:`liveness-finished`}),bt.time+=performance.now()-n,r};for(let e=0;e<A.length&&!h.isStopped;e++){M.index=e,M.candidate=void 0,h.queueSize=A.length-e-1,M.isExpanding=!0;let n=[];try{N.result=ht(e,n)}catch(t){N.result=t instanceof x?Ke(e,t):mt(t,e,n)}if(N.result)return N.result;if(S[re()]++,ne.newStates=0,(vt||t.onProgress)&&performance.now()>=bt.at){bt.at=performance.now()+6e4;let n=vt?xt(e+1):void 0;if(k&&n)return _t(k,n);t.onProgress?.({kind:`progress`,statistics:b(`success`)})}}M.index=-1,M.candidate=void 0,k&&t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!0,states:h.distinctStates,statistics:b(`success`)});let St=k?.findViolation();if(k&&St)return _t(k,St);k&&t.onProgress?.({kind:`liveness-finished`});try{let e=T.findPostconditionViolation();if(e)return b(`postcondition-violation`,{name:e.name,message:e.message,counts:e.counts,trace:[],postcondition:e})}catch(e){return Ge(e,{trace:[]})}return w()},Cx=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},wx=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Jr(e[t]),16777619),r=Math.imul(r^ti(e[t]),1540483477);t[0]=Cx(n)||1,t[1]=Cx(r)},Tx=()=>{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)}}},Ex=(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}},Dx=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Ox=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Ex(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},kx=e=>Atomics.load(e.used,0)*2>=e.slots.length,Ax=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Ex(t,n);return{slots:t,used:e.used}},jx=[void 0,`lambda`,`tuple`,`record`],Mx=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=Pr(e.domain);return t?(r(7),r(jx.indexOf(Ut(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(jx.indexOf(Ut(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},Nx=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 Rt(t.strings[n[r.index++]]);if(e===5)return zt(i(n[r.index++]));let a=jx[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=qn({kind:`Interval`,low:e,high:e+t-1});return Ht(Bt(o,i(t)),a)}let o=n[r.index++],s=i(o);return Ht(Bt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return ze}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return bd}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return ba}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Pp}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return cp}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Lp}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return Vc}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return mi}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return Sa}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return sa}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return Ot}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return fi}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return ca}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return Jc}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return xu}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return Fd}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return zc}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return qe}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return ua}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return N_}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Rp}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return ga}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Ca}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return hi}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return Et}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return wt}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return it}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return lb}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return o}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Ax}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return v}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return j_}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return wx}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return ae}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return nx}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return d}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return ye}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return Ob}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return u}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return gb}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return oe}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return hb}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return s}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Dx}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return ce}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return xd}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return yd}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return bx}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return pb}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Mx}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return w}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return Ox}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return l}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return kb}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return ie}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return z}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return Tx}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return kx}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return y}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return Nx}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return xe}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return rx}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return _b}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Ip}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return P_}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return J_}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return n}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return ya}});
1783
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new v(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Jb(t),scope:void 0}]})},rx=(e,t)=>{if(!P(e))return;let n=Mr(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])))},ix=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>ix(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=xl(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return ix(n.body,t)}return[e]},ax=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||uy(r,e.scope,t)>0)return!1;let i=W(r,bx(t,void 0,void 0,e.scope));if(i===!1)throw new v(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new v(`The operator ${r.name}, which equals ${z(i)},\ncannot be used as a ${n}`);return!0},ox=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return Qb(t,e,r),Jb(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let i=[],a=[],o=[],s=Xb(`name`,t.specification,r),c=Zb(t.specification,s,r);if(c!==void 0)throw new v(`The value of ${t.specification} is equal to ${z(c)}`);if(py(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(ax(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new v(`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`&&uy(c.expression,s.scope,r)<2)throw n(new y(`TLC cannot handle the temporal formula ${il(c.expression)}`),e.error);let l=uy(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new v(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new v(`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:Gb},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},sx=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=$b(`property`,e,t);if(!i)return;uy(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;py(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(ax(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&uy(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!B(e)?xl(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=uy(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new v(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},cx=(e,t,n)=>t.flatMap(t=>$b(e,t,n)?[{name:t,expression:Jb(t),scope:void 0}]:[]),lx=(e,t)=>{let n=xl(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},ux=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);Qb(`possible`,n,t);let i=Jb(n);if(uy(i,void 0,t)===3)throw new v(`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}}),dx=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||B(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},fx=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=xl(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},px=(e,t)=>e.flatMap(e=>ix(e.expression,t).map(n=>{let r=e.scope===void 0?Rd(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:dx(n,r,t),predicate:fx(e.expression,t)}})),mx=(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},hx=/[\u0100-\uffff]/,gx=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),_x=e=>e.kind===`String`?hx.test(e.value):e.kind===`Set`&&e.elements.some(_x),vx=e=>e.kind===`String`&&hx.test(e.value)||e.kind===`Apply`&&gx.has(e.operator)||xi(e).some(vx),yx=(e,t)=>e.constants.some(e=>_x(e.value)||(e.args??[]).some(_x))||[...t.definitions.values()].some(e=>vx(e.body)||e.kind===`Function`&&e.bounds.some(e=>vx(e.set))),bx=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),xx=(e,t,n)=>bl(W(e,t),n),Sx=(e,t,n=Cx)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},Cx=(e,t)=>{let n=e.kind===`Identifier`?xl(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?rl(i):al(r)}`},wx=(e,t)=>Sx(e.expression,t,(n,r)=>(Sx(e.predicate,t),Cx(n,r))),Tx=()=>{},Ex=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=xx(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Dx=(e,t,n)=>{try{return xx(e,bx(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},Ox=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Dx(n.expression,t,`an assumption`);if(e)return{name:il(n.expression),trace:[],message:e.message}}},kx=(t,r,i,a)=>{let o=nx(t.invariants,r),c=ox(t,r),l=sx(t,r,a),u=px([...o,...l.invariants],r),d=[...new Map(u.map(e=>[e.predicate,e])).values()],f=u.length>0||l.actionProperties.length>0||l.liveness.length>0;if(c.init===void 0&&(f||l.initialPredicates.length>0||r.variables.length>0))throw new v(r.runtime.version===`1.7.4`?va:`The configuration file did not specify the initial state predicate.`);if(c.next===void 0&&f)throw new v(`The configuration file did not specify the next state predicate.`);let p=px(cx(`constraint`,t.constraints,r),r),m=cx(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Xb(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Xb(`periodic`,t.periodic,r);let h=ux(t.possible,r);if(r.variables.length===0)return;let g=t.symmetry===void 0?void 0:wb(t.symmetry,r,t.substitutions);t.view!==void 0&&Xb(`view function`,t.view,r);let _=t.view===void 0?void 0:{name:t.view,expression:Jb(t.view),scope:void 0},b=l.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Gb};return{...e,unchanged:t}}),x=e=>uy(e.expression,void 0,r)>=2,ee=h.filter(e=>!x(e)),te=h.filter(x),S=r.runtime,ne={indices:void 0},re=()=>{if(ne.indices)return ne.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return ne.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ne.indices},ie=(e,t)=>W(e,bx(r,t,void 0)),C=e=>{let t=re(),n=g===void 0?e:Pb(e,g,t);return xm(_===void 0?t.map(e=>n[e]):[ie(_.expression,n)])},ae=yx(t,r);S.getFingerprint=C;let oe=()=>{let e=h.find(e=>!S.possibleCounts.get(e.name));if(!e)return;let t=lx(e.name,r),n=t?` at ${rl(t)}`:``;return{name:e.name,code:ma.possibleUnwitnessed,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:dt(z(Hm(S),!0))}};return{properties:l,spec:c,isSymmetric:g!==void 0,isConstrained:p.length>0||m.length>0,getTlcOrder:re,getStoredFingerprints:(e,t)=>{if(_!==void 0||ae)return BigInt64Array.from(e,C);let n=new BigInt64Array(t.length),r=wm(re(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ae)return[String(C(e))];let t=g===void 0?e:Pb(e,g,re());return _===void 0?t:[ie(_.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(mx(a,t,i))return!1;try{let e=bx(r,t,void 0,a.scope),n=a.membership;return i&&n?!jr(t[n.variable],i[n.variable],W(n.set,e)):!wx(a,e)}catch(t){throw i?Ix(n(t,e.safetyEvaluationFailure),ma.invariantEvaluationFailed,`Evaluating invariant ${a.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Sx(n,bx(t,e,void 0,r));p.every(e=>r(e.predicate,e.scope))&&n();let i=d.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=l.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(p.every(e=>Sx(e.predicate,bx(n,t,void 0,e.scope)))&&m.every(r=>Sx(r.expression,bx(n,e,t,r.scope))))||r())||d.every(e=>Sx(e.predicate,bx(n,t,void 0,e.scope))))&&b.every(r=>Sx(r.box,bx(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>p.every(n=>mx(n,e,t)||wx(n,bx(r,e,void 0))),findFailedInitialPredicate:e=>l.initialPredicates.find(t=>!Sx(t.expression,bx(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>b.find(n=>{try{return!Sx(n.action,bx(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${il(n.box)}`)&&!xx(n.unchanged,bx(r,e,t,n.scope),`a subscript`)}catch(e){throw Ix(Ax(e),ma.actionPropertyEvaluationFailed,`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>m.every(n=>Sx(n.expression,bx(r,e,t),e=>`${s}${Cx(e,r)}`)),trackStatePossible:ee.length===0?Tx:e=>Ex(ee,S,bx(r,e,void 0)),trackActionPossible:te.length===0?Tx:(e,t)=>Ex(te,S,bx(r,e,t)),findUnwitnessedPossible:oe,findPostconditionViolation:(i=!1)=>{let a=t.postconditions.find(e=>{let t=xl(e,r);return t!==void 0&&r.definitionValues.has(t)});if(a!==void 0){if(i)return;throw n(new y(`${s}The post condition ${a} cannot be a constant.`),e.error)}let o=oe();if(o)return o;for(let e of t.postconditions){let t=Dx(Jb(e),r,`a postcondition`);if(!t)continue;let n=lx(e,r),i=n?` at ${rl(n)}`:``;return t.message===void 0?{name:e,code:ma.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:ma.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},Ax=e=>e instanceof S?n(e,e.exitCode):e,jx=/* @__PURE__ */ Error(`The replay stopped`),Mx=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),Nx=t=>{let n=Ca(t.message);return n&&!n.isEvalException&&Mx.has(n.code)?e.configParseError:oe(t)},Px=t=>{let n=t.cause;return n instanceof y?Px(n):t instanceof S?t.exitCode:e.specEvaluationFailure},Fx=/* @__PURE__ */ new WeakMap,Ix=(e,t,r)=>{if(!(e instanceof y))return e;let i=n(new y(`${r}\n${e.message}`,e),oe(e));return Fx.set(i,{code:t,headline:r,inner:e}),i},Lx=s.slice(0,s.indexOf(`
1784
+ `)),Rx=`${s}tlc2.tool.EvalException: `,zx=`${s}util.Assert$TLCRuntimeException: `,Bx=o(`tlc2.tool.EvalException`),Vx=e=>wa(e)?Rx:zx,Hx=e=>{try{return e()}catch(e){throw e instanceof y?wa(e)?new y(`${Bx}${e.message}`):Ca(e.message)?e:new y(`${s}${e.message}`):e}},Ux=[Rx,zx,s,Bx],Wx=(e,t)=>{let n=Fx.get(e);if(n)return`${n.headline}\n${Wx(n.inner,t)}`;let r=e.message,i=Ux.find(e=>r.startsWith(e))??``;return`${i}${Da(r.slice(i.length),t)}`},Gx=(e,t)=>{let n=Fx.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Wx(e,!0)};if(t&&wa(e))return{code:Ca(r)?.code??ma.general,message:r,toolMessage:r};let i=t&&!r.startsWith(Lx)?s:``;return{code:ma.general,message:`${i}${r}`,toolMessage:`${i}${Wx(e,!0)}`}},Kx=e=>{let t=e.dump&&_b(e.dump,e.writeFile,e.version);try{return Jx(e,t)}catch(e){throw c(e)?qx():e}finally{t?.close()}},qx=()=>n(new x,e.error),Jx=(t,i)=>{let o=typeof t.config==`string`?at(t.config,t.version):t.config,l=t.onPrint??console.log,u={lines:void 0},d=e=>{u.lines?u.lines.push(e):l(e)},f=e=>{let t=u.lines,n=[];u.lines=n;try{return{result:e(),lines:n}}finally{u.lines=t}};Dt(av(t.source,o,t.loadModule)),kt(t.version);let p=yv(o,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:d,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed,isTool:t.isTool,isTraceRecorded:t.isTraceRecorded,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version});tx(p,o,t.onProgress);let m=p.environment,h=m.runtime,g=h.version===`1.7.4`;h.pause=t.onPause??(()=>{}),h.getSpecification=()=>sb(o,m,p.variableLocations,p.instanceActions);let _={depth:0,initialStates:void 0},b=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:h.generatedStates,distinctStates:h.distinctStates,queuedStates:h.queueSize,depth:h.generatedStates===0?0:Math.max(_.depth,1),initialStates:_.initialStates,outDegrees:void 0,fingerprintDistance:void 0}),te=Array.from({length:32},()=>0),re={newStates:0},ie=()=>Math.min(re.newStates,31),C=()=>te.map((e,t)=>t===ie()?e+1:e),ae=()=>g?[...te]:C(),se=(e,t,n)=>g?[]:e.getViolatedProperties(t,n),w=(e,t=[...te])=>({...e,violationOutDegrees:t}),T=()=>({...b(`success`),outDegrees:[...te],fingerprintDistance:Hb(h.distinctStates,h.generatedStates,()=>E?E.getStoredFingerprints(A,Ee):BigInt64Array.from(A,h.getFingerprint))}),E=kx(o,m,()=>iv(t.source,t.loadModule),t.onProgress),D=()=>Ox(p.assumptions,m);if(!E){h.isStarted=!0;let e=D();return e?b(`assumption-violation`,e):(_.initialStates={generated:0,distinct:0},t.onProgress?.({kind:`initial-states-started`}),t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates}),T())}let ce=o.postconditions.length>0||o.possible.length>0,le=/* @__PURE__ */ new WeakMap,ue=e=>le.get(e)?.state??e.state,de=e=>{let t=le.get(e)?.action;return t?Ly(t):Xh(e.action)},fe=(e,t)=>{ce&&(h.counterExample=Zh(e.map(ue),e.slice(1).map(de),t));let n=E.findUnwitnessedPossible(),r=n?{result:void 0,lines:[]}:f(()=>E.findPostconditionViolation(!0));return{unwitnessed:n,postcondition:r.result,lines:r.lines}},pe=(e,t,n)=>{let r=t.loopStart,i=fe(t.trace,r===void 0||!n?void 0:{start:r,action:n()}),a=[...t.traceOutput??[],...i.lines];return b(e,{...t,...a.length>0&&{traceOutput:a},...i.unwitnessed&&{unwitnessed:i.unwitnessed},...i.postcondition&&{postcondition:i.postcondition}})},me=E.spec,he=E.getFingerprintState,O={value:void 0},ge=()=>O.value??=rb(o,m,p.instanceActions),_e=e=>{let t=qu(m),n=t.callStack;try{e(t);return}catch(e){return c(e)?{callStack:[],fingerprint:void 0}:!(e instanceof y)||!n?void 0:{callStack:n.expressions,fingerprint:n.fingerprint}}},ve=(e,t)=>{if(typeof e!=`object`)return[];let n=t.get(e),r=$r(e).find(e=>Qr(e)!==void 0);return[...n?[n]:[],...r===void 0?[]:ve(r,t)]},ye=(e,t)=>{for(let n of he(e)){let e=Qr(n);if(!e)continue;let r=t?ve(n,t.sources):[];throw t&&r.length>0&&(t.expressions.length=0,t.isFrozen=!0,t.fingerprint={sources:r,reason:e.message}),e}e.forEach(en)},be=()=>{let e=tt.fingerprint?[tt.fingerprint]:[];return(t,n)=>{ye(t,n);let r=he(t);return Qe(Je(r),r)!==-1||e.some(e=>Xe(e,r))?!1:(e.push(r),h.distinctStates++,!0)}},xe=()=>{let e={count:0},t=[],n=be();return _e(r=>{if(rc(nb(o,m,p.instanceActions),r,i=>{if(ex(e.count,e=>u.lines?.push(e)),e.count++,h.generatedStates=e.count,!(t.length>0))try{let e=E.checkReplayedInitialState(i,r,()=>{n(i,r.callStack)&&(h.queueSize++,k?.addInitialState(A.length,i,r))});if(e){let t=Ie([{action:void 0,state:i}],[]).trace[0].state;throw u.lines?.push({kind:`initial-state-violation`,...e,state:t}),jx}}catch(e){if(!(e instanceof y)||!r.callStack?.fingerprint)throw e;t.push(e)}}),t.length>0)throw t[0]})},Se=e=>_e(t=>{let n=A[e],r=i&&ot(n,ke[e]),a=be();ic(ge(),n,t,(o,s)=>{if(!E.checkReplayedSuccessor(n,o,t,()=>{let n=a(o,t.callStack);return r&&i?.writeSuccessor(r,ot(o,ke[e]+1),!n,N?{name:s.name,signature:ob(s)}:void 0),n}))throw jx})}),Ce=o.view!==void 0||o.symmetry!==void 0,we=[];E.properties.liveness.length>0&&t.onProgress?.({kind:`liveness-initializing`,isSymmetric:E.isSymmetric,isConstrained:E.isConstrained});let k=a(()=>Hx(()=>Ny(E.properties.liveness,me.temporals,m,{getFingerprint:({index:e,state:t})=>we[e]??=Number(BigInt.asIntN(32,h.getFingerprint(t))),getSuccessors:(e,t)=>{let n=[];if(me.next===void 0)return n;let r=M.livenessSource;return M.livenessSource=e,Xc(me.next,t,m,e=>{if(je(e.state),!(E.satisfiesConstraints(e.state,t)&&E.satisfiesActionConstraints(t,e.state)))return!1;let r=he(e.state),i=Qe(Je(r),r);return n.push({index:i,state:e.state}),!1},me.scope),M.livenessSource=r,n}})));h.isStarted=!0;let Te=E.isSymmetric||k!==void 0,A=[],Ee=[],De=[],Oe=[],ke=[],Ae={slots:new Int32Array(1<<17),size:0,shift:16},je=bi(),Me=e=>Object.fromEntries(E.getTlcOrder().map(t=>[m.variables[t],e[t]])),Ne=(e,t,n,r)=>(h.getLevel=()=>n+1,h.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Pe(e,t[n].state,(t[n+1]??t[r??n]).state)),Pe=(e,n,r)=>{try{let t=Qb(`alias`,e,m).body,i=W(Jb(e),bx(m,n,r)),a=t.kind===`Record`?t.fields.map(e=>e.name):[];return rx(i,a)??Me(n)}catch(e){if(!(e instanceof v||e instanceof y))throw e;return{...Me(n),_ALIASEvalError:Da(e.message,t.isTool??!1)}}},Fe=(e,t,n,r)=>{let i=ge(),a={...M};Object.assign(M,{index:e,isExpanding:!0,candidate:void 0});let o=r?e=>e:he,s=o(n),c=i.find(e=>Zc(e.expression,t,m,e.scope).some(e=>Xe(o(e.state),s)));return Object.assign(M,a),c},Ie=(e,n,r={})=>{let i=o.alias,a=r.known??1,s=e.length>1?f(Le).lines:[],c=e.map((t,r)=>r===0||t.action===`Stuttering`?{result:void 0,lines:[]}:f(()=>Fe(n[r-1],e[r-1].state,t.state,a===2&&r===e.length-1))),l=c.map(e=>e.lines),u=r.loopStart,d=g&&u!==void 0?u+1:e.length-a,p=d>0?[s,...l.slice(1,d)].flat():[];return{trace:e.map((n,r)=>{let a=c[r].result,o={action:n.action,label:a&&ab(a,t.version),state:i===void 0?Me(n.state):Ne(i,e,r,u),output:r===0?p:r<d?[]:l[r]};return(i!==void 0||a)&&le.set(o,{state:Me(n.state),action:a}),o}),traceOutput:a>0&&!g?[s,...l].flat():[]}},Le=()=>me.init===void 0?[]:Yc(me.init,m,me.scope),j=(e,t)=>f(()=>{for(let n of ge()){let r=Zc(n.expression,e,m,n.scope).find(t);if(r)return{...r,action:r.action??n.name}}}).result,Re=(e,t)=>Xe(he(e),Ee[t]),ze=(e,t)=>j(e,e=>Re(e.state,t)),Be=(e,t)=>{let n=f(()=>Ce||ju(m)?Le().find(t=>Re(t,e[0])):A[e[0]]).result;if(!n)throw new y(Kb);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=ze(i,e[n]);if(!a)throw new y(t);r.push(a)}return r},Ve=(e,t)=>{let n=[];for(let t=e;t!==-1;t=De[t])n.unshift(t);let r=Ce&&n.length>1?Be(n,Kb):n.map(e=>({state:A[e],action:Oe[e]}));if(!t)return Ie(r,n);let i=Ce?j(A[e],e=>Xe(e.state,t.state))?.action:t.action;return Ie([...r,{state:t.state,action:i}],n,{known:2})},He=e=>De[e]===-1?{trace:[{action:void 0,label:void 0,state:Me(A[e])}],traceOutput:g?[]:f(Le).lines}:Ve(e),Ue=(e,t)=>({trace:Ve(e,t).trace}),We=(t,n)=>n.isInitial&&!n.callStack&&!n.fingerprint&&g?e.success:n.callStack?n.isCallStackFirst?oe(t):n.isLiveCallStack?r(t)??(t instanceof S?t.exitCode:e.error):n.isInitial||n.fingerprint?e.specEvaluationFailure:Px(t):n.isInitial?Nx(t):oe(t),Ge=(e,t,n={})=>{let r=c(e)?new x:e;if(!(r instanceof y))throw r;let i=t.trace.length>0&&!n.traceFailure?fe(t.trace,void 0):void 0,a=i?.unwitnessed??i?.postcondition,o=[...t.traceOutput??[],...i?.lines??[]];return{...b(`error`,void 0,{...Gx(r,n.isNextState??!1),...t,...o.length>0&&{traceOutput:o},...a&&{postcondition:a},initialState:n.initialState&&!(r instanceof S)?Me(n.initialState):void 0,exitCode:We(r,n),callStack:n.callStack,...n.isCallStackFirst&&{isCallStackFirst:!0},...n.fingerprint&&{fingerprint:n.fingerprint},...n.traceFailure&&{traceFailure:n.traceFailure}}),outDegrees:n.outDegrees}},Ke=(n,r)=>{h.generatedStates++;let i=ge(),a=i.length===1?i[0]:i.find(e=>e.name===r.action),o=r.variables,s=i.length===1?`the next-state action`:`action ${r.action} of the next-state relation`,c=g?`assigned`:`defined`,l=`Successor state is not completely specified by ${s}. The following variable${o.length>1?`s are`:` is`} not ${c}: ${o.join(`, `)}.\n`,u=Vt(`null`),d=r.state.map(e=>e??u),f=Ge(r,He(n));return w({...f,failure:f.failure&&{...f.failure,code:ma.incompleteSuccessor,message:l,toolMessage:l,exitCode:e.specEvaluationFailure,trace:[...f.failure.trace,{action:r.action,label:a&&ab(a,t.version),state:Me(d)}]}})},qe=(e,t)=>{let n=Be(e,qb),r=n[n.length-1].state;if(Ce&&t!==void 0&&t!==e.length-1&&ze(r,e[t])===void 0)throw new y(qb);return n},Je=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Gr(t,ei(e[n]));return t&1073741823},Ye=e=>{for(let t of e){let e=Qr(t);if(e)throw e}},Xe=(e,t)=>{for(let n=0;n<t.length;n++)if(!an(e[n],t[n]))return!1;return!0},Ze=e=>Math.imul(e,2654435761)>>>Ae.shift<<1,Qe=(e,t)=>{let n=Ae.slots.length-1;for(let r=Ze(e);;r=r+2&n){let n=Ae.slots[r+1];if(n===0)return-1;if(Ae.slots[r]===e&&Xe(Ee[n-1],t))return n-1}},$e=(e,t)=>{let n=Ae.slots.length-1,r=Ze(e);for(;Ae.slots[r+1]!==0;)r=r+2&n;Ae.slots[r]=e,Ae.slots[r+1]=t},et=(e,t)=>{if(Ae.size++,Ae.size*4>Ae.slots.length){let e=Ae.slots;Ae.slots=new Int32Array(e.length*2),Ae.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&$e(e[t],e[t+1])}$e(e,t+1)},tt={fingerprint:void 0},nt=e=>{h.distinctStates=A.length+1,_.depth=Math.max(_.depth,e),h.diameter=Math.max(h.diameter,e)},rt=(e,t,n,r)=>{let i=n===-1?1:ke[n]+1;A.push(e),Ee.push(t),De.push(n),Oe.push(r),ke.push(i)},M={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},it=e=>e===-1?[]:[...it(De[e]),A[e]];h.isSeen=e=>{let t=he(e);return Qe(Je(t),t)!==-1},h.getBehavior=e=>{let t=e===M.candidate?-1:A.indexOf(e);return t===-1?[...it(M.index),e]:it(t)},h.getCurrentState=()=>M.index===-1?void 0:A[M.index],h.setLivenessSource=e=>{M.livenessSource=e??-1},h.getLevel=e=>{let t=M.livenessSource;if(g){let e=t===-1?M.isExpanding?M.index:-1:t;return e===-1?0:ke[e]}return t===-1?e===M.candidate?M.candidateLevel:M.index===-1?0:e===A[M.index]?ke[M.index]:M.isExpanding?ke[M.index]+1:0:e===A[t]?ke[t]:ke[t]+1};let ot=(e,t)=>({fingerprint:BigInt.asIntN(64,h.getFingerprint(e)),level:t,getLabel:()=>vi(o.alias===void 0?Me(e):Pe(o.alias,e,void 0)),getText:()=>vi(Me(e))}),st=e=>{je(e),h.generatedStates++,h.initialStates++,M.candidate=e,M.candidateLevel=1;let t=he(e),n=Je(t),r=E.satisfiesConstraints(e);if(r&&(E.trackStatePossible(e),Ye(t),e.forEach(en)),r&&Qe(n,t)!==-1)return;tt.fingerprint=r?t:void 0,r&&(nt(1),h.queueSize++,k?.addInitialState(A.length,e),i?.writeInitialState(ot(e,1)));let a=E.findViolatedInvariant(e);if(a)return pe(`invariant-violation`,{name:a.name,...Ie([{action:void 0,state:e}],[])});let o=E.findFailedInitialPredicate(e);if(o)return pe(`liveness-violation`,{name:o.name,...Ie([{action:void 0,state:e}],[])});r&&(et(n,A.length),rt(e,t,-1,void 0))},ct=(e,t,n,r,a)=>{let o=A[e];h.generatedStates++,M.candidate=t.state,M.candidateLevel=ke[e]+1,Te&&je(t.state);let s=he(t.state),l=Je(s),u=Qe(l,s),d=E.satisfiesConstraints(t.state,o);d&&E.trackStatePossible(t.state);let p=d&&E.satisfiesActionConstraints(o,t.state);p&&(E.trackActionPossible(o,t.state),Ye(s),t.state.forEach(en));let m=p?u:-1;if(r&&p&&i?.writeSuccessor(r,ot(t.state,ke[e]+1),m!==-1,a&&{name:a.name,signature:ob(a)}),m!==-1&&k){let e=A[m],r=e.every((e,n)=>e===t.state[n]);n.push({index:m,state:r?e:t.state})}let g=p&&m===-1;if(g&&k&&n.push({index:A.length,state:t.state}),tt.fingerprint=g?s:void 0,g&&(nt(ke[e]+1),re.newStates++),m===-1)try{let n=E.findViolatedInvariant(t.state,o);if(n)return w(pe(`invariant-violation`,{name:n.name,...Ve(e,t)}))}catch(n){if(c(n))throw n;let r=f(()=>Se(e));return Ge(n,Wb(Ue(e,t),r.lines),r.result??{outDegrees:ae()})}let _=E.findViolatedActionProperty(o,t.state);if(_)return w(pe(`liveness-violation`,{name:_.name,...Ve(e,t)}));g&&(Te||je(t.state),et(l,A.length),rt(t.state,s,e,t.action),h.queueSize++)},lt={result:void 0};k&&t.onProgress?.({kind:`liveness-prepared`,branches:k.branches});let ut=D();if(ut)return b(`assumption-violation`,ut);if(t.onProgress?.({kind:`initial-states-started`}),me.init!==void 0)try{Jc(me.init,m,e=>{ex(h.initialStates,t.onProgress);try{lt.result=st(e)}catch(t){let n=f(xe);lt.result=Ge(t,{trace:[],traceOutput:n.lines},{initialState:e,...n.result,isInitial:!0})}return lt.result!==void 0},me.scope)}catch(e){if(e instanceof ne){let t=Ge(e,{trace:[]},{initialState:e.state.map(e=>e??Vt(`null`))});return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}let t=f(xe);return Ge(e,{trace:[],traceOutput:t.lines},{...t.result,isInitial:!0})}if(lt.result)return lt.result;_.initialStates={generated:h.initialStates,distinct:h.distinctStates},t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates});let dt=me.next;if(dt===void 0){if(A.length>0)throw new y(`No next state actions defined to generate successor states from.`);return T()}let N=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),ft=(e,t)=>{if(!N)return Xc(dt,e,m,e=>t(e,void 0),me.scope);let n={isStopped:!1};return ge().reduce((r,i)=>n.isStopped?r:r+Xc(i.expression,e,m,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},P=(e,t)=>{if(!k||g)return;let n=_e(n=>k.addState(e,A[e],t,n));return n?.callStack.length&&!n.fingerprint?n.callStack:void 0},F=(e,t)=>{try{k?.addState(e,A[e],t);return}catch(n){if(!(n instanceof y))throw n;return P(e,t)}},pt=(e,t)=>{let n=f(()=>F(e,t));if(n.result)return{result:{callStack:n.result,fingerprint:void 0,isLiveCallStack:!0},lines:n.lines};let r=f(()=>Se(e));return{result:r.result,lines:[...n.lines,...r.lines]}},mt=e=>Ge(qx(),He(e)),ht=(e,t,n)=>{if(c(e))return mt(t);let r=pt(t,n);return Ge(Ax(e),Wb(He(t),r.lines),{isNextState:!0,...r.result})},gt=(t,r)=>{let a=A[t],l=i&&ot(a,ke[t]),u=ft(a,(e,n)=>{try{lt.result=ct(t,e,r,l,n)}catch(n){if(c(n))return lt.result=mt(t),!0;let i=g?f(()=>Se(t)):pt(t,r);if(g&&n instanceof y&&!Fx.has(n))return lt.result=Ge(new y(`${Vx(n)}${n.message}`,n),Wb({trace:[]},i.lines),{isNextState:!0,...i.result}),!0;let a=he(e.state).some(e=>Qr(e)!==void 0)&&n instanceof y?Gx(wa(n)?new y(`${Bx}${n.message}`):n,!0):void 0;lt.result=Ge(n,Wb(a?He(t):Ue(t,e),i.lines),{isNextState:!0,...i.result,traceFailure:a})}return lt.result!==void 0});M.isExpanding=!1;let d=lt.result;if(d?.violation&&!g){let e=f(()=>F(t,r));return{...d,violation:Wb(d.violation,e.lines),...e.result&&{liveCallStack:e.result}}}if(d)return d;let p=()=>{k&&l&&g&&i?.writeStuttering(l);let e=k?.addState(t,a,r);if(!k||!e)return;let n=qe(e),o=se(k,n.map(e=>e.state),n.length-1);return pe(`property-violation`,{name:o[0],properties:o,...Ie(n,e,{known:0})})};if(u===0&&o.checkDeadlock){let e=pe(`deadlock`,{name:`deadlock`,...He(t)}),n=f(()=>{try{return{additional:p()?.violation}}catch(e){if(!(e instanceof y))throw e;return{isFailed:!0,callStack:P(t,r)}}}),i=e.violation?{...e,violation:Wb(e.violation,n.lines)}:e,a=w(i,n.result.isFailed?ae():C());return n.result.additional?{...a,additionalViolation:n.result.additional}:n.result.callStack?{...a,liveCallStack:n.result.callStack}:a}try{return p()}catch(i){if(g&&i instanceof y){let t=new y(`${wa(i)?Bx:s}${i.message}`);return Ge(n(t,e.error),{trace:[]},{outDegrees:ae()})}let o=_e(e=>k?.addState(t,a,r,e));return Ge(i,He(t),{outDegrees:ae(),callStack:o?.callStack.length?o.callStack:void 0,isNextState:!0,isCallStackFirst:!0})}},_t=()=>{let e=o.specification,t=`(compare Chapter 8, page 87ff of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`;if(e===void 0)return{code:ma.noSpecificationButProperty,text:`The stuttering counterexample above may be caused by the absence of a behavior specification (SPECIFICATION). Only INIT and NEXT have been provided, so TLC permits infinite stuttering. To rule out such counterexamples, use SPECIFICATION Spec, with Spec asserting a suitable fairness constraint ${t}`};let n=xl(e,m)?.location.range;if(!(me.temporals.length>0||!n))return{code:ma.noFairnessButProperty,text:`The stuttering counterexample above may be caused by the absence of a fairness constraint in the behavior specification ${e} defined at ${rl(n)}. To rule out such counterexamples, conjoin a suitable fairness constraint to ${e} ${t}`}},vt=(e,n)=>{let r=[...n.prefix,...n.cycle],i=n.prefix.length,a=qe(r,i),o=Ie(a,r,{loopStart:i,known:0}).trace,s=se(e,a.map(e=>e.state),i),c=r[i],l=r[r.length-1],u=a[a.length-1].state,d=c===l?{result:void 0,lines:[]}:f(()=>Fe(l,u,A[c],!1)),p=c===l&&n.isCycleConstrained;return pe(`liveness-violation`,{name:s[0],properties:s,trace:o,traceOutput:d.lines,loopStart:i,loopLabel:d.result&&ab(d.result,t.version),warning:p?_t():void 0},()=>c===l?de(o[o.length-1]):d.result?Ly(d.result):Xh(ze(u,c)?.action))},yt=k!==void 0&&t.livenessCheck!==`final`,bt=performance.now(),xt={at:bt+3e3,size:1,time:0},St=e=>{let n=performance.now();if(!((e-xt.size)/xt.size>.1)||xt.time>(n-bt)*.2||(xt.size=e,!k))return;t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!1,states:e,statistics:b(`success`)});let r=k.findViolation();return r||t.onProgress?.({kind:`liveness-finished`}),xt.time+=performance.now()-n,r};for(let e=0;e<A.length&&!h.isStopped;e++){M.index=e,M.candidate=void 0,h.queueSize=A.length-e-1,M.isExpanding=!0;let n=[];try{lt.result=gt(e,n)}catch(t){lt.result=t instanceof ee?Ke(e,t):ht(t,e,n)}if(lt.result)return lt.result;if(te[ie()]++,re.newStates=0,(yt||t.onProgress)&&performance.now()>=xt.at){xt.at=performance.now()+6e4;let n=yt?St(e+1):void 0;if(k&&n)return vt(k,n);t.onProgress?.({kind:`progress`,statistics:b(`success`)})}}M.index=-1,M.candidate=void 0,k&&t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!0,states:h.distinctStates,statistics:b(`success`)});let Ct=k?.findViolation();if(k&&Ct)return vt(k,Ct);k&&t.onProgress?.({kind:`liveness-finished`});try{let e=E.findPostconditionViolation();if(e)return b(`postcondition-violation`,{name:e.name,message:e.message,counts:e.counts,trace:[],postcondition:e})}catch(e){return Ge(e,{trace:[]})}return T()},Yx=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Xx=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^ei(e[t]),16777619),r=Math.imul(r^si(e[t]),1540483477);t[0]=Yx(n)||1,t[1]=Yx(r)},Zx=()=>{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)}}},Qx=(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}},$x=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),eS=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Qx(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},tS=e=>Atomics.load(e.used,0)*2>=e.slots.length,nS=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Qx(t,n);return{slots:t,used:e.used}},rS=[void 0,`lambda`,`tuple`,`record`],iS=()=>{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=Br(e.domain);return t?(r(7),r(rS.indexOf(Kt(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(rS.indexOf(Kt(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},aS=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 Vt(t.strings[n[r.index++]]);if(e===5)return Ht(i(n[r.index++]));let a=rS[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=Zn({kind:`Interval`,low:e,high:e+t-1});return Gt(Ut(o,i(t)),a)}let o=n[r.index++],s=i(o);return Gt(Ut(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return Be}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return kp}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Da}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Km}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return rm}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return tm}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return Zc}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return bi}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return ka}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return ma}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return jt}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return vi}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return ha}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return il}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return ju}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return am}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Yc}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return Ye}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return _a}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return iv}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return qm}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return Ca}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Aa}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return xi}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return kt}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return Dt}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return at}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return Fb}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return o}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return nS}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return v}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return nv}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Xx}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return ae}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return Ox}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return d}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return xe}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return ex}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return u}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Hb}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return oe}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return Vb}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return s}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return $x}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return w}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return tf}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return im}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return Kx}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return zb}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return ie}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return iS}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return T}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return eS}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return l}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return tx}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return C}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return z}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return Zx}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return tS}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return y}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return aS}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return Ce}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return kx}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return Ub}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Gm}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return av}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return yv}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return n}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return Ea}});