tla-ts 0.0.3-dev.e5b05b9 → 0.0.3-dev.e8bef80
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/cli.cjs +1 -1
- package/dist/cli.js +1 -1
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +150 -48
- package/dist/index.d.ts +150 -48
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +2 -2
- package/dist/parallel.cjs +1 -1
- package/dist/parallel.js +2 -2
- package/dist/run-cli.cjs +1351 -22
- package/dist/run-cli.js +1352 -23
- package/dist/transfer.cjs +83 -43
- package/dist/transfer.js +83 -43
- package/package.json +5 -1
- package/src/ast.ts +28 -4
- package/src/bags.ts +4 -7
- package/src/builtins.ts +29 -17
- package/src/bundled-modules.ts +3 -3
- package/src/canonical.ts +4 -3
- package/src/check.ts +1317 -428
- package/src/cli.ts +8 -1
- package/src/codegen.ts +68 -21
- package/src/config.ts +226 -207
- package/src/environment.ts +221 -75
- package/src/errors.ts +130 -15
- package/src/evaluate.ts +713 -259
- package/src/exit-codes.ts +6 -24
- package/src/fingerprints.ts +1 -2
- package/src/index.ts +1 -0
- package/src/instances.ts +3 -1
- package/src/java-overrides.ts +104 -25
- package/src/levels.ts +6 -1
- package/src/lexer.ts +122 -29
- package/src/live-check.ts +204 -148
- package/src/liveness.ts +191 -122
- package/src/obligation-expression.ts +2 -2
- package/src/obligation-source.ts +2 -0
- package/src/parallel-worker.ts +6 -1
- package/src/parallel.ts +57 -6
- package/src/parser.ts +327 -147
- package/src/pcal-ast.ts +770 -0
- package/src/pcal-parse.ts +1523 -0
- package/src/pcal-tokenize.ts +516 -0
- package/src/pcal-translate.ts +1230 -0
- package/src/pcal-validate.ts +454 -0
- package/src/randomization.ts +24 -7
- package/src/resolve.ts +252 -87
- package/src/run-cli.ts +1162 -200
- package/src/runtime.ts +16 -0
- package/src/sany-builtins.ts +147 -0
- package/src/sany-generator.ts +3128 -0
- package/src/sany-levels.ts +1208 -0
- package/src/sany-lexer.ts +410 -480
- package/src/sany-linter.ts +122 -0
- package/src/sany-modules.ts +1398 -0
- package/src/sany-nodes.ts +463 -0
- package/src/sany-parse-error.ts +2033 -3015
- package/src/sany-report.ts +356 -0
- package/src/sany-selectors.ts +738 -0
- package/src/sany-source.ts +248 -0
- package/src/sany-xml.ts +1017 -0
- package/src/spec-description.ts +25 -5
- package/src/standard-modules.ts +172 -129
- package/src/state-graph.ts +29 -6
- package/src/subexpressions.ts +121 -26
- package/src/successors.ts +141 -173
- package/src/symmetry.ts +168 -50
- package/src/tableau.ts +3 -1
- package/src/tlc-ext.ts +13 -17
- package/src/tlc-messages.ts +329 -0
- package/src/tlc-module.ts +49 -21
- package/src/tlc-modules.ts +0 -4
- package/src/tlc-order.ts +55 -9
- package/src/tlc-random.ts +28 -3
- package/src/tlc-replay.ts +655 -0
- package/src/tlc-version.ts +18 -0
- package/src/transfer.ts +15 -3
- package/src/values.ts +664 -317
package/dist/transfer.cjs
CHANGED
|
@@ -6,31 +6,78 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenessViolation:13,assertViolation:14,specEvaluationFailure:75,safetyEvaluationFailure:76,livenessEvaluationFailure:77,specParseError:150,configParseError:151,error:255},t=/* @__PURE__ */ new WeakMap,n=(e,n)=>(e instanceof Error&&!t.has(e)&&t.set(e,n),e),r=e=>t.get(e),i
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
: `,u=`This was a Java StackOverflowError. It was probably the result
|
|
9
|
+
const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenessViolation:13,assertViolation:14,specEvaluationFailure:75,safetyEvaluationFailure:76,livenessEvaluationFailure:77,specParseError:150,configParseError:151,error:255},t=/* @__PURE__ */ new WeakMap,n=(e,n)=>(e instanceof Error&&!t.has(e)&&t.set(e,n),e),r=e=>t.get(e),i=t=>{try{return t()}catch(t){throw n(t,e.error)}},a=e=>{let t=i(e);return t&&{branches:t.branches,addInitialState:(e,n,r)=>i(()=>t.addInitialState(e,n,r)),addState:(e,n,r,a)=>i(()=>t.addState(e,n,r,a)),findViolation:()=>i(()=>t.findViolation()),getViolatedProperties:(e,n)=>i(()=>t.getViolatedProperties(e,n))}},o=e=>`TLC threw an unexpected exception.\nThis was probably caused by an error in the spec or model.\nSee the User Output or TLC Console for clues to what happened.\nThe exception was a ${e}\n: `,s=o(`java.lang.RuntimeException`),c=e=>e instanceof RangeError&&e.message===`Maximum call stack size exceeded`;var l=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},u=class extends l{failure;sany;constructor(e,t,n,r){super(e,t),this.name=`TlaSyntaxError`,this.failure=n,this.sany=r}},d=class extends u{location;parseError;constructor(e,t,n){super(e),this.location=t,this.parseError=n}},f=class extends d{constructor(e,t,n=!0){super(`Cannot find source file for module ${e} imported in module ${t}.`,n?t:void 0)}};const p=(e,t=!1,n,r=[])=>new u(e.map(e=>`${e.location}\n\n${e.message}`).join(`
|
|
10
|
+
|
|
11
|
+
`),void 0,void 0,{errors:e,warnings:r,isFatal:t,parseError:n}),m=(e,t)=>p([{location:`In module ${t}`,message:`Cannot find source file for module ${e} imported in module ${t}.`}],!0),h=e=>`*** Warnings: ${e.length}\n\n${e.map(e=>`${e.location}\n\n${e.message}\n\n\n`).join(`
|
|
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
|
|
14
13
|
of an incorrect recursive function definition that caused TLC to enter
|
|
15
14
|
an infinite loop when trying to compute the function or its application
|
|
16
|
-
to an element in its putative domain
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
`)}`;var g=class extends f{constructor(e){super(e),this.name=`TlaParseError`}};const _=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,v=(e,t)=>m([{location:_(t),message:e}]);var y=class extends f{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},b=class extends f{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}},x=class extends b{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},S=class extends b{variable;constructor(e,t){super(e),this.name=`TlaEvaluationError`,this.variable=t}},C=class extends b{state;action;missing;constructor(e,t,n){super(`Successor state is not completely specified by the next-state action. The following variable${n.length>1?`s are`:` is`} not defined: ${n.join(`, `)}.\n`),this.name=`TlaEvaluationError`,this.state=e,this.action=t,this.missing=n}},w=class extends b{state;constructor(e){super(`current state is not a legal state`),this.name=`TlaEvaluationError`,this.state=e}},T=class extends f{failure;exception;constructor(e,t={}){super(e),this.name=`TlaProofError`,this.failure=t.exception===void 0?t.failure??e:void 0,this.exception=t.exception??`Failure(${JSON.stringify(this.failure)})`}},ee=class extends T{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},te=class extends f{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}};const ne=t=>r(t)??(t instanceof p?e.specParseError:t instanceof y?e.configParseError:t instanceof b?e.specEvaluationFailure:e.error),E=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),re=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),D=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),O=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),k=/* @__PURE__ */ new Map([[`∧`,`/\\`],[`∨`,`\\/`],[`¬`,`~`],[`⇒`,`=>`],[`⟹`,`=>`],[`≡`,`<=>`],[`⇔`,`<=>`],[`∈`,`\\in`],[`∉`,`\\notin`],[`⊆`,`\\subseteq`],[`⊂`,`\\subset`],[`⊇`,`\\supseteq`],[`⊃`,`\\supset`],[`∪`,`\\cup`],[`∩`,`\\cap`],[`×`,`\\X`],[`∀`,`\\A`],[`∃`,`\\E`],[`≠`,`#`],[`≤`,`<=`],[`≥`,`>=`],[`↦`,`|->`],[`→`,`->`],[`⟨`,`<<`],[`⟩`,`>>`],[`□`,`[]`],[`◇`,`<>`],[`≜`,`==`],[`′`,`'`],[`∘`,`\\o`],[`⋅`,`\\cdot`]]),A=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,ie=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),j=e=>e.startsWith(`\\`)?parseInt(e.slice(2),ie.get(e[1].toLowerCase())):Number(e),ae=/-{4,}[ \t]*MODULE\b/,oe=e=>/[A-Za-z0-9_]/.test(e),se=(e,t)=>{let n=e[t];if(n===`\\`&&/[A-Za-z]/.test(e[t+1]??``)){let n=/^[A-Za-z]+/.exec(e.slice(t+1))?.[0]??``,r={value:n.length};for(;r.value>0&&!re.has(n.slice(0,r.value));)r.value--;let i=re.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=k.get(n);if(r)return{text:r,length:n.length};let i=O.find(n=>e.startsWith(n,t));return i?{text:D.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},ce=e=>e!==void 0&&e>=`0`&&e<=`9`,le=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},ue=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:le(e,t+1,ce);if(n===t+1||e[n]!==`>`)return 0;let r=le(e,n+1,oe),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return le(e,i?r+1:r,e=>e===`.`)-t},de=(e,t)=>t===` `?e+8-e%8:e+1,fe=e=>{let t=ae.exec(e);if(!t)throw new p(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
|
|
20
|
-
`),a={index:t.index,line:i.length,lineStart:t.index-i[i.length-1].length,moduleDepth:0},o={lineStart:-1,position:0,width:0},s=()=>{for((o.lineStart!==a.lineStart||o.position>a.index)&&(o.lineStart=a.lineStart,o.position=a.lineStart,o.width=0);o.position<a.index;o.position++)o.width=de(o.width,e[o.position]);return de(o.width,e[a.index])},c=(e,t,r)=>{let i=s();n.push({kind:e,text:t,line:a.line,column:i,endColumn:i+r-1}),a.index+=r},l=t=>{for(let n=0;n<t;n++)e[a.index]===`
|
|
21
|
-
`&&(a.line++,a.lineStart=a.index+1),a.index++},u=t=>new p(`${t} at line ${a.line}, column ${s()}`,void 0,{reason:t,line:a.line,column:s(),isEnd:a.index>=e.length});for(;a.index<e.length;){let t=e[a.index];if(t===`
|
|
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
|
+
`&&(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===`
|
|
22
18
|
`||t===` `||t===` `||t===`\r`){l(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
|
|
23
|
-
`,a.index);l((t===-1?e.length:t)-a.index);continue}if(e.startsWith(`(*`,a.index)){let t={value:0};do{if(a.index>=e.length)throw
|
|
24
|
-
|
|
25
|
-
`,t:` `,r:`\r`,f:`\f`}[t]??t),l(2)}else i.push(e[a.index]),l(1)}l(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
`);
|
|
29
|
-
|
|
30
|
-
`)
|
|
31
|
-
`,e.slice(0,t))}n.push({kind:`String`,text:t[1],line:r.line}),r.index+=t[0].length;continue}let l=M.find(t=>e.startsWith(t));if(l){n.push({kind:`Symbol`,text:l,line:r.line}),r.index+=l.length;continue}let u=se(t,r.index);if(!u)throw ye(r.line,r.index-r.lineStart+1,e[0]);n.push({kind:`Word`,text:u.text,line:r.line}),r.index+=u.length}return n.push({kind:`End`,text:``,line:r.line-1}),n},Se=e=>{let t=xe(e),n={index:0},r={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},i={isSet:!1},a=()=>t[Math.min(n.index++,t.length-1)],o=e=>e.kind===`Word`&&pe.has(e.text),s=e=>{if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t=a();if(t.text!==`}`)for(;e.push(s(t)),t=a(),t.text===`,`;)t=a();if(t.text!==`}`)throw be(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw be(e.line,`It was expecting a value, but did not find it.`)},c=e=>{let t=a();if(t.kind===`End`)throw be(t.line,`Expected an identifier after ${e}[.`);let n=a();if(n.text!==`]`)throw be(n.line,`It was expecting ], but did not find it.`);return t.text},l=e=>{for(;;){let t=a();if(t.kind===`End`||o(t))return t;let n={text:t.text},i=a();for(;i.text===`!`;)n.text=`${n.text}!${a().text}`,i=a();if(i.text===`<-`){if(i=a(),i.text===`[`){let e=c(`<-`),t=a();if(t.kind===`End`)throw be(t.line,`Expected an identifier after <-[mod].`);r.substitutions.push({name:n.text,target:t.text,module:e});continue}if(i.kind===`End`)throw be(i.line,`Expected an identifier after <-.`);r.substitutions.push({name:n.text,target:i.text});continue}let l=[];if(i.text===`(`){for(;l.push(s(a())),i=a(),i.text===`,`;);if(i.text!==`)`)throw be(e,``);i=a()}if(i.text!==`=`)throw be(i.line,`It was expecting = or <-, but did not find it.`);i=a();let u=i.text===`[`?c(`=`):void 0,d=s(u===void 0?i:a());r.constants.push({name:n.text,value:d,...l.length>0&&{args:l},...u&&{module:u}})}},u=a();for(;u.kind!==`End`;){let e=u.text,t=u.line;if(ge(e)){let n=a();if(n.kind===`End`)throw be(t,`The keyword ${e} was not followed by an identifier.`);let i=me[e];if(r[i]!==void 0)throw be(t,`The keyword ${e} appeared twice.`);r[i]=n.text,u=a()}else if(_e(e)){let t=r[he[e]];for(u=a();u.kind!==`End`&&!o(u);)t.push(u.text),u=a()}else if(e===`CONSTANT`||e===`CONSTANTS`)u=l(t);else if(e===`CHECK_DEADLOCK`){let e=a();if(e.kind===`End`)throw be(t,`The keyword CHECK_DEADLOCK was not followed by an identifier.`);if(e.text!==`TRUE`&&e.text!==`FALSE`)throw be(e.line,`It was expecting TRUE or FALSE, but did not find it.`);if(i.isSet)throw be(t,`The keyword CHECK_DEADLOCK appeared twice.`);i.isSet=!0,r.checkDeadlock=e.text===`TRUE`,u=a()}else throw be(t,`It was expecting a keyword, but did not find it.`)}if(r.specification!==void 0&&(r.init!==void 0||r.next!==void 0))throw new y(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);return r},Ce={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},we=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},Te=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ee=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),De=e=>{let t=t=>{let n=le(e,t,we);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=le(e,t,Te);if(e.startsWith(`..`,n)&&Te(e[n+2]))return{kind:`Constant`,first:t,last:le(e,n+2,Te)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=Te(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:le(e,t+1,Te)-1,children:[]};if(Ee(n))return{kind:`Constant`,first:t,last:le(e,t,Ee)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},Oe=e=>{let t=e.length===0?void 0:De(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=Ce[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},ke={current:void 0},N=/* @__PURE__ */ new WeakMap,Ae=e=>e instanceof b?N.get(e):void 0,je=(e,t)=>{let n=ke.current;if(!n||typeof e!=`object`)return t();try{return t()}catch(t){let r=n.get(e);throw r&&t instanceof b&&N.set(t,[r,...N.get(t)??[]]),t}},Me=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Ne=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),P=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),Pe=e=>typeof e==`object`&&e.kind===`ModelValue`,Fe=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:Me(e)?`set`:`function`,F=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new x(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},Ie={isUsed:!1},Le=(e,t)=>(Ie.isUsed=!0,e.writtenKeys=t,e),I=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[mn(e.domain,t)]]),L=(e,t,n)=>Le($e(e,t),n),R=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(R);e.writtenKeys=void 0,e.range.forEach(R)}},z=e=>e.every(e=>typeof e==`string`),B=(e,t)=>e.length>0&&t.length>0&&z(e)!==z(t),Re=(e,t)=>{Ie.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return B(n,r)?_t(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Ye(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=Ye(i[e],a[e]);if(t!==0)return t}return 0},V=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=Ye(n[e],r[e]);if(t!==0)return t}return 0},H=e=>Pe(e)?e.type:void 0,U=(e,t,n)=>{let r=H(e),i=H(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(Pe(e)&&Pe(t)){if(r===void 0||i===void 0||r===i)return;throw new b(`Attempted to ${a} the differently-typed model values ${Y(e)} and ${Y(t)}`)}throw r===void 0?new b(`Attempted to ${a} the typed model value ${Y(t)} and the non-model value\n${Y(e)}`):new b(`Attempted to ${a}${n?``:` the`} typed model value ${Y(e)} and non-model value\n${Y(t)}`)},W={ranks:Object.create(null),size:0},ze=e=>{W.ranks=Object.create(null),W.size=0,Xe.clear();for(let t of e)Be(t)},Be=e=>(W.ranks[e]===void 0&&(W.ranks[e]=W.size++),e),Ve=()=>W.size,He=e=>W.ranks[Be(e)],Ue=(e,t)=>{if(e===t)return 0;let n=W.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},We=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Ge=(e,t)=>(We(e)||We(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Ke=(e,t,n)=>{if(!We(e))throw new b(`Attempted to ${n} the set ${Y(Yt(e)?q(e):e,!0)} with the value:\n${Y(t,!0)}`);if(!We(t))throw new b(`Attempted to compare overridden value ${Y(e,!0)} with non-overridden value:\n${Y(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new b(`Attempted to compare ${Y(e,!0)} with the value\n${Y(t,!0)}`)},qe={kind:`InfiniteSet`,name:`Any`},Je=e=>{throw new b(`Attempted to compare ANY with the value\n${Y(e)}`)},Ye=(e,t)=>{if(e===t)return Ie.isUsed&&R(e),e===qe?Je(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Re(e,t);if(n===`Set`&&r===`Set`)return V(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&U(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return U(e,t,!1),n===`ModelValue`?-1:1;if(e===qe||t===qe)return Je(e===qe?t:e);if(Me(e)&&Me(t)&&Ge(e,t))return Ke(e,t,`compare`);let i=Me(e);if(i!==Me(t))throw new b(`Attempted to compare ${Fe(e)} ${Y(e)} with ${Fe(t)} ${Y(t)}`);return i?V(q(e),on(t)):Re(xn(e),xn(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Ue(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(U(e,t,!1),Pe(e))return-1;if(Pe(t))return 1;throw new b(`Attempted to compare ${Fe(e)} ${Y(e)} with ${Fe(t)} ${Y(t)}`)},Xe=/* @__PURE__ */ new Map,Ze=e=>{let t=Xe.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:He(e)};return Xe.set(e,n),n},Qe=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),$e=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0}),et=(e,t)=>{if(e===t)return Ie.isUsed&&R(e),e!==qe||Je(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&U(e,t,!0),Ye(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return Re(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return V(e,t)===0;if(Pe(e)||Pe(t))return U(e,t,!0),Pe(e)&&Pe(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return et(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=cn(e.domain),r=cn(t.domain);if(n||r)return n===r;let i=cn(e.range),a=cn(t.range);return i||a?i===a:et(e.domain,t.domain)&&et(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(cn(e))return cn(t);if(cn(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&et(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return cn(e)?cn(t):!cn(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>et(e,t.factors[n]));let n=Me(e)&&Me(t)&&!(Yt(e)&&Yt(t));if(n&&Ge(e,t))return Ke(e,t,`check equality of`)===0;if(n){if(!We(e)){let n=q(e);if(!We(t))return V(n,q(t))===0}return er(e)===er(t)}return Ye(e,t)===0},tt=(e,t)=>e===t||e.length===t.length&&e.every((e,n)=>nt(e,t[n])),nt=(e,t)=>e===t?!0:typeof e!=`object`||typeof t!=`object`?!1:e.kind===`Set`&&t.kind===`Set`?(e.hash===0||t.hash===0||e.hash===t.hash)&&tt(e.elements,t.elements):e.kind===`Function`&&t.kind===`Function`?(e.hash===0||t.hash===0||e.hash===t.hash)&&tt(e.domain,t.domain)&&tt(e.range,t.range):er(e)===er(t),rt=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},G=e=>{if(!P(e))return;let t=xn(e);return{domain:t.domain,range:t.range,low:rt(t.domain)}},K=e=>{if(!P(e))return;let t=xn(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},it=(e,t)=>{if(H(e)!==void 0)throw new b(`Attempted to compare the typed model value ${Y(e)} and the non-model value\n${Y(t)}`);return 1},at=(e,t)=>{if(H(e)!==void 0)throw new b(`Attempted to check equality of the typed model value ${Y(e)} and the non-model value\n${Y(t)}`);return!1},ot=(e,t)=>{let n=H(e);if(n===void 0)return Pe(t)?e.rank-t.rank:-1;if(!Pe(t))throw new b(`Attempted to compare the typed model value ${Y(e)} and non-model value\n${Y(t)}`);let r=H(t);if(r!==void 0&&r!==n)throw new b(`Attempted to compare the differently-typed model values ${Y(e)} and ${Y(t)}`);return e.rank-t.rank},st=(e,t)=>{let n=H(e);if(n===void 0)return Pe(t)&&e.name===t.name;if(!Pe(t))throw new b(`Attempted to check equality of typed model value ${Y(e)} and non-model value\n${Y(t)}`);let r=H(t);if(r!==void 0&&r!==n)throw new b(`Attempted to check equality of the differently-typed model values ${Y(e)} and ${Y(t)}`);return e.name===t.name},ct={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},lt=(e,t,n)=>{let r=ct[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${Y(e)} with ${r.other}:\n${Y(t)}`},ut=(e,t,n)=>{let r=G(n);if(!r){if(Pe(n))return it(n,t);throw new b(`Attempted to compare the function ${Y(t)} with the value:\n${Y(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>dt(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return dt(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new b(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${Y(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},dt=(e,t)=>{for(let n=0;n<e.length;n++){let r=_t(e[n],t[n]);if(r!==0)return r}return 0},ft=(e,t)=>{let n=xn(e);if(e.kind===`Function`&&hn(n)!==void 0){let r=P(t)?hn(t):void 0;return r?n.range.length-r.length||dt(n.range,r):ut({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=K(t);if(!r){if(Pe(t))return it(t,e);throw new b(`Attempted to compare record:\n${Y(e)}\nwith non-record\n${Y(t)}`)}return n.domain.length-r.domain.length||dt(n.domain,r.domain)||dt(n.range,r.range)}return ut({...n,low:rt(n.domain)},e,t)},pt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),mt=(e,t)=>We(e)||We(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),ht=(e,t)=>{let n=pt(t)?t:q(t);return{elements:q(e).elements,otherElements:q(n).elements}},gt=(e,t)=>{if(mt(e,t))return Ye(e,t);if(!pt(e))return gt(q(e),t);if(!Me(t)){if(Pe(t))return it(t,e);throw new b(`Attempted to compare the set ${Y(e)} with the value:\n${Y(t)}`)}let n=ht(e,t);return n.elements.length-n.otherElements.length||dt(n.elements,n.otherElements)},_t=(e,t)=>je(e,()=>{if(typeof e!=`object`){if(typeof t==typeof e)return Ye(e,t);if(Pe(t))return it(t,e);throw new b(lt(e,t,!1))}return e.kind===`ModelValue`?ot(e,t):P(e)?ft(e,t):gt(e,t)}),vt=(e,t)=>e.every((e,n)=>St(e,t[n])),yt=(e,t,n)=>{let r=G(n);if(!r){if(Pe(n))return at(n,t);throw new b(`Attempted to check equality of the function ${Y(t)} with the value:\n${Y(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&vt(e.range,r.range);let i=e.low??r.low;return i===void 0?vt(e.domain,r.domain)&&vt(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new b(`Attempted to compare an integer with non-integer:\n${Y(e)}.`);return e===i+t})&&vt(e.range,r.range)},bt=(e,t)=>{let n=xn(e);if(e.kind===`Function`&&hn(n)!==void 0){let r=P(t)?hn(t):void 0;return r?n.range.length===r.length&&vt(n.range,r):yt({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=K(t);if(!r){if(Pe(t))return at(t,e);throw new b(`Attempted to check equality of record:\n${Y(e)}\nwith non-record\n${Y(t)}`)}return n.domain.length===r.domain.length&&vt(n.domain,r.domain)&&vt(n.range,r.range)}return yt({...n,low:rt(n.domain)},e,t)},xt=(e,t)=>{if(mt(e,t))return et(e,t);if(!pt(e))return xt(q(e),t);if(!Me(t)){if(Pe(t))return at(t,e);throw new b(`Attempted to check equality of the set ${Y(e)} with the value:\n${Y(t)}`)}let n=ht(e,t);return n.elements.length===n.otherElements.length&&vt(n.elements,n.otherElements)},St=(e,t)=>je(e,()=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(Pe(t))return at(t,e);throw new b(lt(e,t,!0))}return e.kind===`ModelValue`?st(e,t):P(e)?bt(e,t):xt(e,t)}),Ct=e=>{let t=[];for(let n of e){let e={low:0,high:t.length,comparison:1};for(;e.low<e.high;){let r=e.low+(e.high-e.low>>1);if(e.comparison=_t(n,t[r]),e.comparison===0)break;e.comparison<0?e.high=r:e.low=r+1}e.comparison!==0&&t.splice(e.low,0,n)}return t},wt=(e,t)=>t.some(t=>St(t,e)),Tt=(e,t)=>{try{return et(e,t)}catch(n){if(!(n instanceof b))throw n;return St(e,t)}},Et=e=>{for(let t=1;t<e.length;t++)if(Ye(e[t],e[t-1])<=0)return!1;return!0},Dt=e=>{if(e.length<2||Et(e))return Qe(e);let t=[...e].sort(Ye),n=[t[0]];for(let e=1;e<t.length;e++)Ye(n[n.length-1],t[e])!==0&&n.push(t[e]);return Qe(n)},Ot=e=>{try{return Dt(e)}catch(t){if(!(t instanceof b))throw t;return{kind:`MixedSet`,elements:e}}},kt=Qe([]),At=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Ye(r[a],t)<0;)a++;a<r.length&&Ye(r[a],t)===0||i.push(t)}return i.length===n.length?e:Qe(i)},jt=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Ye(r[a],t)<0;)a++;a<r.length&&Ye(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Qe(i)},Mt=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=Ye(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=Qe(i);if(e.hash!==0){let t=e.hash;for(let e=0;e<a.length;e++)t=t+zn(a[e])|0;c.hash=t}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Yn(a[e])|0;c.fingerprint=t}return c},Nt=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Ye(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Ye(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return $e(n,r)},Pt=e=>{let t=Nt(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Le(t,e.map(e=>e[0]))},Ft=[],It=[],Lt=/* @__PURE__ */ new WeakMap,Rt=e=>{let t=Ft[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Ft[e]=n,n},zt=e=>{if(dn(e),e.low===1&&e.high>=1)return Rt(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Bt=e=>e.length>0&&(e===Ft[e.length]||Lt.has(e)),Vt=e=>{let t=q(e).elements;return Bt(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Ht=e=>{let t=It[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return It[e]=n,n},Ut=e=>$e(Rt(e.length),e),Wt=e=>Nt(e),Gt=e=>Me(e)&&!We(e),Kt=(e,t=!1)=>`UNION(${Y(e.base,t)})`,qt=(e,t=e=>q(e).elements)=>{if(!Gt(e.base))throw new b(`Attempted to enumerate the nonenumerable set:\n${Kt(e)}`);return t(e.base)},Jt=(e,t,n)=>{if(Gt(e))return e;throw new b(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${Y(e)}\nwhen enumerating:\n${Kt(n)}`)},Yt=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return Yt(e.base);case`FunctionSet`:return Yt(e.domain)&&Yt(e.range)||Xt(e.domain)===!0||Xt(e)===!0;case`RecordSet`:return e.sets.every(Yt)||Xt(e)===!0;case`ProductSet`:return e.factors.every(Yt)||Xt(e)===!0;case`Union`:return Yt(e.base)&&sn(e.base).every(Yt);case`SetOperation`:return e.operator===`\\cup`?Yt(e.left)&&Yt(e.right):e.operator===`\\cap`?Yt(e.left)||Yt(e.right):Yt(e.left);default:return!1}},Xt=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=Xt(e.domain);return t===void 0?void 0:!t&&Xt(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Xt(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return Yt(e)?q(e).elements.length===0:void 0;default:return}},Zt=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},Qt=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},$t=e=>{if(typeof e!=`object`||e.kind!==`Subset`||We(e.base))return;let t=q(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:Qt(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Qe(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},en=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Qe(r.map(t=>e[t])));while(Qt(r,e.length))}return t},tn=e=>{if(typeof e!=`object`)throw new b(`Expected a set but found ${Y(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Ct(e.elements);case`Interval`:{let t=zt(e);return t!==Ft[t.length]&&Lt.set(t,e),t}case`Subset`:{We(e.base)&&dn(e.base);let t=q(e.base).elements;if(t.length>30)throw new b(un(e));return en(t)}case`FunctionSet`:{if(cn(e))return[];if(We(e.domain))throw new b(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${Y(e.domain)}\ncannot be enumerated.`);let t=Vt(e.domain);if(t.length>0&&We(e.range))throw new b(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${Y(e.range)}\ncannot be enumerated.`);let n=t.length===0?[]:q(e.range).elements;return Zt(t.map(()=>n)).map(e=>$e(t,e))}case`RecordSet`:{if(cn(e))return[];let t=e.sets.map((t,n)=>{if(We(t))throw new b(`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${Y(t)}`);return q(t).elements});return Zt(t).map(t=>Wt(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(cn(e))return[];let t=e.factors.map((e,t)=>{if(We(e))throw new b(`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${Y(e)}`);return q(e).elements});return Zt(t).map(Ut)}case`FilteredSet`:if(We(e.base))throw new b(`Attempted to enumerate { x \\in S : p(x) } when S:\n${Y(e.base)}\nis not enumerable`);return q(e.base).elements.filter(e.test);case`Union`:{let t=qt(e).flatMap((t,n)=>q(Jt(t,n,e)).elements);return q(Ot(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Gt(e.left)||!Gt(e.right)))throw new b(`Attempted to enumerate S \\cup T when S:\n${Y(e.left)}\nand T:\n${Y(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Gt(e.left)&&!Gt(e.right))throw new b(`Attempted to enumerate S \\cap T when neither S:\n${Y(e.left)}\nnor T:\n${Y(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Gt(e.left))throw new b(`Attempted to enumerate S \\ T when S:\n${Y(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Mt(q(e.left),q(e.right)).elements;let t=e.operator===`\\`||Yt(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return q(n).elements.filter(t=>yn(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new b(`Attempted to enumerate the non-enumerable set ${Y(e)}`);default:throw new b(`Expected a set but found ${Y(e)}`)}},nn=/* @__PURE__ */ new WeakMap,rn=/* @__PURE__ */ new WeakMap,q=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Qe(tn(e));let t=typeof e==`object`?nn.get(e):void 0;if(t)return t;let n=(typeof e==`object`?rn.get(e):void 0)??(ke.current?je(e,()=>an(e)):an(e));return typeof e==`object`&&nn.set(e,n),n},an=e=>{let t=tn(e);return typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?Qe(t):Dt(t)},on=e=>{if(typeof e!=`object`||e.kind!==`Union`&&e.kind!==`SetOperation`&&e.kind!==`FilteredSet`||nn.has(e))return q(e);let t=rn.get(e);if(t)return t;let n=an(e);return rn.set(e,n),n},sn=e=>{if(typeof e!=`object`||nn.has(e))return q(e).elements;if(e.kind===`Union`)return qt(e,sn).flatMap((t,n)=>sn(Jt(t,n,e)));if(e.kind===`FilteredSet`&&!We(e.base))return sn(e.base).filter(e.test);if(e.kind!==`SetOperation`)return q(e).elements;if(e.operator===`\\cup`)return!Gt(e.left)||!Gt(e.right)?q(e).elements:[...sn(e.left),...sn(e.right)];let t=e.operator===`\\`||Yt(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Gt(n)?sn(n).filter(t=>yn(t,r)===(e.operator===`\\cap`)):q(e).elements},cn=e=>{if(typeof e!=`object`||!Me(e))throw new b(`Shouldn't call isEmpty() on value ${Y(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new b(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(cn);case`RecordSet`:return e.sets.some(cn);case`FunctionSet`:return!cn(e.domain)&&cn(e.range);case`Union`:return qt(e).every((t,n)=>cn(Jt(t,n,e)));default:return q(e).elements.length===0}},ln=(e,t)=>e.reduce((e,n)=>{let r=e*dn(n);if(r>2147483647)throw new b(t());return r},1),un=e=>`Overflow when computing the number of elements in:\n${Y(e)}`,dn=e=>{if(typeof e!=`object`)return q(e).elements.length;switch(e.kind){case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new b(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new b(`Attempted to compute the number of elements in the overridden value ${Y(e)}.`);case`Subset`:{let t=dn(e.base);if(t>=31)throw new b(un(e));return 2**t}case`FunctionSet`:{if(cn(e.domain))return 1;if(cn(e.range))return 0;let t=dn(e.range);if(t===1)return 1;let n=dn(e.domain),r={value:1};for(let i=0;i<n;i++)if(r.value*=t,r.value>2147483647)throw new b(un(e));return r.value}case`RecordSet`:return cn(e)?0:ln(e.sets,()=>un(e));case`ProductSet`:return cn(e)?0:ln(e.factors,()=>`Overflow when computing the number of elements in ${Y(e)}`);default:return q(e).elements.length}},fn=e=>`Attempted to check if the set ${Y(e)}is finite.`,pn=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new b(`Attempted to check if the ${Fe(e)} ${Y(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new b(`Attempted to check if the function:\n${Y(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return pn(e.base)&&cn(e.base);case`Subset`:return pn(e.base);case`FunctionSet`:{let t=pn(e.domain);if(t&&cn(e.domain))return!0;let n=pn(e.range);return n&&cn(e.range)?!0:n&&(t||dn(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!pn(e))n.isAllFinite=!1;else if(cn(e))return!0;return n.isAllFinite}case`Union`:if(!Gt(e.base))throw new b(`Attempted to check if the nonenumerable set:\n${Kt(e)}\nis a finite set.`);return q(e.base).elements.every(pn);case`SetOperation`:if(e.operator===`\\cup`)return pn(e.left)&&pn(e.right);if(e.operator===`\\cap`){if(!pn(e.left)&&!pn(e.right))throw new b(fn(e));return!0}if(pn(e.left))return!0;if(!pn(e.right))throw new b(fn(e));return!1;case`FilteredSet`:if(!pn(e.base))throw new b(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${Y(e.base)}\nis finite.`);return!0}},mn=(e,t)=>{let n={low:0,high:e.length-1};for(;n.low<=n.high;){let r=n.low+n.high>>1,i=Ye(e[r],t);if(i===0)return r;i<0?n.low=r+1:n.high=r-1}return-1},hn=e=>{if(typeof e!=`object`||!P(e))return;let t=xn(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},gn=(e,t)=>`Attempted to check if the value ${Y(e)} is an element of ${Y(t)}`,_n=(e,t)=>{let n=`Attempted to check if the value:\n${Y(e)}\nis an element of the`;if(!P(t))return`${n} ${Fe(t)} ${Y(t)}`;let r=t.kind===`Function`||Yt(t.domain)?xn(t).domain:[];return r.length>0&&r.every(e=>typeof e==`string`)?`Attempted to check if element:\n${Y(e)}\nis in the record:\n${Y(t)}`:r.every((e,t)=>e===t+1)?`Attempted to check set membership in a tuple value.`:`${n} function ${Y(t)}`},vn=(e,t)=>ke.current?je(t,()=>yn(e,t)):yn(e,t),yn=(e,t)=>{if(!Me(t))throw new b(_n(e,t));switch(t.kind){case`Set`:try{return mn(t.elements,e)!==-1}catch(n){if(!(n instanceof b))throw n;return je(t,()=>wt(e,t.elements))}case`MixedSet`:return je(t,()=>wt(e,t.elements));case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!Pe(e))throw new b(`Attempted to check if the value:\n${Y(e)}\nis in the integer interval ${Y(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(Pe(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new b(`Attempted to check if the value:\n${Y(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!Gt(e))throw new b(`Attempted to check if the non-enumerable value\n${Oe(Y(e))}\nis element of\n${Oe(Y(t))}`);return q(e).elements.every(e=>vn(e,t.base));case`FunctionSet`:{if(!P(e)){if(Pe(e))return!1;throw new b(`Attempted to check if \n${Y(e)}\nwhich is not a TLC function value, is in the set of functions:\n${Oe(Y(t))}`)}let n=xn(e),r=rt(n.domain);return(r===void 0?Tt(t.domain,Qe(n.domain)):Tt({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>vn(e,t.range))}case`RecordSet`:{let n=P(e)?xn(e):void 0;if(!n||!z(n.domain)){if(Pe(e))return!1;throw new b(`Attempted to check if non-record\n${Y(e)}\nis in the set of records:\n${Y(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=mn(n.domain,e);return i!==-1&&vn(n.range[i],t.sets[r])})}case`ProductSet`:{let n=P(e)?hn(e):void 0;if(n===void 0){if(P(e)&&xn(e).domain.every(e=>typeof e==`number`)||Pe(e))return!1;throw new b(`Attempted to check if non-tuple\n${Y(e)}\nis in the set of tuples:\n${Y(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>vn(e,t.factors[n]))}case`FilteredSet`:return vn(e,t.base)&&t.test(e);case`Union`:if(!Gt(t.base))throw new b(`Attempted to check if:\n ${Y(e)}\nis an element of the non-enumerable set:\n ${Kt(t)}`);return q(t.base).elements.some(t=>vn(e,t));case`SetOperation`:return t.operator===`\\cup`?vn(e,t.left)||vn(e,t.right):vn(e,t.left)&&vn(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=hn(e);if(n===void 0){if(Pe(e))return!1;throw new b(gn(e,t))}return n.every(e=>yn(e,t.base))}default:throw new b(_n(e,t))}},bn=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?yn(e,n):e.range.every((e,r)=>bn(e,t.range[r],n.range)),xn=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){Yt(e.domain)||dn(e.domain);let t=Vt(e.domain);return $e(t,t.map(t=>e.apply(t)))}throw new b(`Expected a function but found ${Y(e)}`)},Sn=/* @__PURE__ */ new WeakSet,Cn=e=>(Sn.add(e),e),wn=e=>{let t=e.domain;return t.length===0?Sn.has(e)?`FcnRcdValue`:`TupleValue`:t===Ft[t.length]?`TupleValue`:Lt.has(t)?`IntervalFcnRcdValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},J=(e,t)=>`Attempted to apply function:\n${Oe(Y(e))}\nto argument ${Oe(Y(t))}, which is not in the domain of the function.`,Tn=e=>`Attempted to apply function with integer domain to the non-integer argument ${Oe(Y(e))}`,En=(e,t)=>{if(Sn.has(e)||e.kind===`LazyFunction`)return`In applying the function\n${Oe(Y(e))},\nthe first argument is:\n${Oe(Y(t))}\nwhich is not in its domain.\n`;let n=wn(e);return n===`TupleValue`?typeof t==`number`?`Attempted to access index ${t} of tuple\n${Oe(Y(e))}\nwhich is out of bounds.`:`Attempted to access tuple at a non integral index: ${Oe(Y(t))}`:n===`RecordValue`?typeof t==`string`?`Attempted to access nonexistent field '${t}' of record\n${Oe(Y(e))}`:`Attempted to access record by a non-string argument: ${Oe(Y(t))}`:n===`IntervalFcnRcdValue`&&typeof t!=`number`?Tn(t):J(e,t)},Dn=(e,t)=>wn(e)===`FcnRcdValue`?J(e,t):Tn(t),On=e=>wn(e)===`RecordValue`,kn=(e,t)=>{let n=e[0];return typeof n==`number`?typeof t!=`number`&&(e===Ft[e.length]||Lt.has(e)):typeof n==`string`&&typeof t!=`string`},An=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}if(e.length<=8){for(let n=0;n<e.length;n++)if(e[n]===t)return n}return mn(e,t)},jn=(e,t,n,r)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!yn(t,e.domain))throw new b(Sn.has(e)?En(e,t):`Attempted to apply a function to ${Y(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new b(r?.(e)??`Attempted to apply ${Y(e)}, which is not a function`);let i=kn(e.domain,t)?-1:An(e.domain,t);if(i===-1)throw new b(n?.(e)??En(e,t));return e.range[i]},Mn=e=>Bt(e)?Lt.get(e)??Ht(e.length):void 0,Nn=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=xn(e).domain;return Mn(t)??Qe(t)},Pn=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!Yt(e.domain))){if(!yn(t,e.domain))return e;let r=n(e.apply(t));return{kind:`LazyFunction`,domain:e.domain,apply:n=>Tt(t,n)?r:e.apply(n),source:e.source}}let i=xn(e),a=An(i.domain,t);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=$e(i.domain,o);if(l.writtenKeys=i.writtenKeys,i.hash!==0){let e=i.domain[a];l.hash=s===c?i.hash:i.hash-Bn(e,s)+Bn(e,c)|0}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Xn(e,s)+Xn(e,c)|0}return l},Fn=/* @__PURE__ */ new WeakMap,In=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Ln=(e,t)=>Math.imul(e^t,16777619),Rn=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return In(t)},zn=e=>In(Un(e)+2654435769|0),Bn=(e,t)=>In(Math.imul(Un(e),668265261)+Un(t)|0),Vn={isHashed:!1},Hn=e=>{if(e.kind===`ModelValue`)return In(Ln(Rn(e.name),109));if(Me(e)){if(!Yt(e))return Vn.isHashed=!0,Rn(er(e));let t=q(e).elements,n=1940243425;for(let e=0;e<t.length;e++)n=n+zn(t[e])|0;return n}let t=xn(e),n=1725019383;for(let e=0;e<t.domain.length;e++)n=n+Bn(t.domain[e],t.range[e])|0;return n},Un=e=>{if(typeof e==`number`)return In(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Rn(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Hn(e)),e.hash;let t=Fn.get(e);if(t!==void 0)return t;let n=Hn(e);return Fn.set(e,n),n},Wn=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(We(e))throw new b(`TLC has found a state in which the value of a variable contains ${Y(e)}`);if(Me(e))return q(e).elements.forEach(Wn);let t=xn(e);t.domain.forEach(Wn),t.range.forEach(Wn)},Gn=e=>{Vn.isHashed&&e.forEach(Wn)},Kn=/* @__PURE__ */ new WeakMap,qn=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Jn=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return qn(t)},Yn=e=>qn(Qn(e)+2135587861|0),Xn=(e,t)=>qn(Math.imul(Qn(e),374761393)+Qn(t)|0),Zn=e=>{if(e.kind===`ModelValue`)return qn(Jn(e.name)^60);if(Me(e)){if(!Yt(e))return Vn.isHashed=!0,Jn(er(e));let t=q(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Yn(t[e])|0;return n}let t=xn(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Xn(t.domain[e],t.range[e])|0;return n},Qn=e=>{if(typeof e==`number`)return qn(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return Jn(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Zn(e)),e.fingerprint;let t=Kn.get(e);if(t!==void 0)return t;let n=Zn(e);return Kn.set(e,n),n},$n=/* @__PURE__ */ new WeakMap,er=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=$n.get(e);if(t!==void 0)return t;let n=tr(e);return $n.set(e,n),n},tr=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${er(e.base)}>`;if(e.kind===`FilteredSet`&&!Yt(e))throw new b(`Attempted to compare the non-enumerable set ${Y(e)} with another value`);if(Me(e))return Yt(e)?`{${q(e).elements.map(er).join(`,`)}}`:`<${e.kind} ${Y(e)}>`;let t=xn(e);return`(${t.domain.map((e,n)=>`${er(e)}:${er(t.range[n])}`).join(`,`)})`},nr=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,rr=e=>e.reduce((e,t)=>e===0?0:e*dn(t),1),ir=e=>{if(e.kind===`Subset`)return dn(e.base)<=6?q(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return q(e);if(e.kind===`FunctionSet`&&Yt(e.domain)&&dn(e.domain)===0)return Qe([$e([],[])]);let t=e.kind===`FunctionSet`?dn(e.range)**dn(e.domain):rr(e.kind===`RecordSet`?e.sets:e.factors);return t===0?kt:t<=1999?q(e):void 0},ar=(e,t)=>{if(t)return ir(e);if(Yt(e))try{return ir(e)}catch(e){if(e instanceof b)return;throw e}},or=(e,t)=>{let n=e=>Y(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return`{x \\in ${n(e.base)} : ...}`;case`Union`:return Kt(e,t)}},sr=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Y=(e,t=!1,n=!1)=>{let r=e=>Y(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return nr(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(q(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=ar(e,t);return n?r(n):or(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{if(e.kind===`LazyFunction`&&!Yt(e.domain)){let t=e.source;return t?`[${t.parameters.map(e=>`${e.name} \\in ${Y(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}let i=xn(e),a=r=>Y(r,t,n&&e.kind===`Function`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:i.domain.every(e=>typeof e==`string`&&sr(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):I(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},cr=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${Oe(Y(n))}\n`).join(``)},lr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},ur=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Un(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||nt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||nt(i[e],n))return i[e]}return n.kind===`Set`?lr(n.elements,t):(lr(n.domain,t),lr(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},dr=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},X=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,fr=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),pr=(e,t)=>fr.has(e)?new b(t):new x(t),mr=e=>typeof e==`object`&&e.kind===`Operator`,Z=(e,t,n)=>{let r=e[t];if(r===void 0||mr(r))throw pr(n,`${n} expects a value as argument ${t+1}`);return r},hr=(e,t,n)=>{let r=Z(e,t,n);if(typeof r!=`number`)throw pr(n,`${n} expects an integer but received ${Y(r)}`);return r},gr=(e,t,n)=>{let r=Z(e,t,n);if(typeof r!=`boolean`)throw pr(n,`${n} expects a boolean but received ${Y(r)}`);return r},_r=(e,t,n)=>{let r=Z(e,t,n);if(!Me(r))throw pr(n,`${n} expects a set but received ${Y(r)}`);return r},vr=(e,t,n)=>{let r=_r(e,t,n);if(!Yt(r))throw pr(n,`${n} cannot enumerate the non-enumerable set ${Y(r)}`);return r},yr=(e,t,n)=>q(vr(e,t,n)),br=(e,t,n)=>yr(e,t,n).elements,xr=(e,t,n)=>{let r=Z(e,t,n),i=hn(r);if(!i)throw pr(n,`${n} expects a sequence but received ${Y(r)}`);return i},Sr=(e,t,n)=>{let r=Z(e,t,n);if(!P(r))throw pr(n,`${n} expects a function but received ${Y(r)}`);return xn(r)},Cr=(e,t,n)=>{let r=e[t];if(r===void 0||!mr(r))throw pr(n,`${n} expects an operator as argument ${t+1}`);return r},wr=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),Q=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),Tr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Er=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Dr=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(Z(n,0,e),Z(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Or=e=>e>2147483647||e<-2147483648,kr=e=>new x(`Overflow when computing ${e}`),Ar={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},jr={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Mr={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},Nr=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return jr[e.operator];if(e.kind!==`Function`)return Ar[e.kind];let t=e.domain;return t.every((e,t)=>e===t+1)?`TupleValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},Pr=e=>Mr[Nr(e)],Fr=(e,t)=>new b(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Ir=(e,t)=>{let n=n=>(...r)=>{try{return n(...r)}catch(n){throw n instanceof b&&(e.isLazy===!0||!(n instanceof x))?Fr(t,n.message):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Lr=(e,t)=>{if(typeof e!=`number`)throw Fr(t,`Cannot cast tlc2.value.impl.${Nr(e)} to tlc2.value.impl.IntValue`);return e},Rr=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,zr=(e,t,n,r)=>{let i=Rr(e,n,`IntValue`,2);return Dr(t,(e,n)=>{let a=Lr(e,i),o=Lr(n,i),s=r(a,o);if(Or(s))throw kr(`${a}${t}${o}`);return s})},Br=(e,t,n)=>{if(typeof e!=`number`)throw new x(`The ${t} argument of ${n} should be an integer, but instead it is:\n${Y(e)}`);return e},Vr=(e,t)=>Dr(e,(n,r)=>t(Br(n,`first`,e),Br(r,`second`,e))),Hr=(e,t,n)=>({...Er(e,t,n),isLazy:!0}),Ur=(e,t,n)=>{let r=Cr(e,t,n);return()=>r.call([])},Wr=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Gr=()=>({bool:as,condition:(e,t)=>{if(typeof e!=`boolean`)throw Ko(t,e);return e},conjunct:(e,t,n)=>{if(typeof e!=`boolean`)throw qo(t,n,e);return e},apply:jn,tuple:Ut,set:Ot,record:$e,writtenRecord:L,equal:et,enumerate:us,unassigned:(e,t)=>{throw Wc(e,t)},primeOutsideAction:e=>{throw Gc(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0}),extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>ns(e,t,n[r]),e.scope),state:e.state,next:e.next})}),Kr={value:void 0},qr=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Jr=e=>`local${e.counter++}`,Yr=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),dr(e).forEach(e=>Yr(e,t)),t),Xr=(e,t,n)=>{let r=qr(e,mc(t,e.environment)),i=Yr(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=qr(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Zr=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>Jr(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${$r(e,t.set,s)}, ${qr(e,t.set)});`),u=t.bounds.map(t=>{let n=Jr(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${$r(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Jr(e);return`for (let ${i} = 0; ${i} < ${c[r]}.length; ${i}++) { const ${n} = ${c[r]}[${i}]; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},Qr=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${$r(e,r[0],n)}, "the left side of =>") ? bool(${$r(e,r[1],n)}, "the right side of =>") : true)`;if(X(t))return Xr(e,t,n);let i=ws(t.operator,e.environment);if(i?.kind!==`Builtin`)return Xr(e,t,n);if(i.name===`DOMAIN`)return`${qr(e,Zo(t))}(${$r(e,r[0],n)})`;if(i.name===`TLCEval`)return Xr(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${qr(e,Qo(t,i))}(${$r(e,r[0],n)}, ${$r(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Sc(r[0],a))return`${qr(e,i.evaluateUnary)}(${$r(e,r[0],n)})`;let o=r.length===2&&Sc(r[0],a)&&Sc(r[1],a);return i.evaluateBinary&&o?`${qr(e,i.evaluateBinary)}(${$r(e,r[0],n)}, ${$r(e,r[1],n)})`:Xr(e,t,n)},$r=(e,t,n)=>{let r=(t,r=n)=>$r(e,t,r);if(ac(t)&&ec(t,e.environment))return Xr(e,t,n);switch(t.kind){case`Number`:return Hs(t.value)?String(t.value):Xr(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(X(t))return Xr(e,t,n);let i=Ps(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=qr(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?qr(e,i.value):Xr(e,t,n)}case`Apply`:return Qr(e,t,n);case`And`:{let n=qr(e,t);return`(${t.operands.map((e,t)=>`conjunct(${r(e)}, ${n}, ${t})`).join(` && `)})`}case`Or`:return`(${t.operands.map(e=>`bool(${r(e)}, "a disjunct")`).join(` || `)})`;case`If`:return`(condition(${r(t.condition)}, ${qr(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Rc(t.function);let n=r(t.function),i=qr(e,Yo(t));return t.args.length===1?`apply(${n}, ${r(t.args[0])}, undefined, ${i})`:`apply(${n}, tuple([${t.args.map(e=>r(e)).join(`, `)}]), undefined, ${i})`}case`FieldAccess`:return`apply(${r(t.record)}, ${JSON.stringify(t.field)}, ${qr(e,Jo(t))}, ${qr(e,Xo(t))})`;case`Record`:{let i=Hc(t.fields);if(Uc(i))return Xr(e,t,n);let a=qr(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${qr(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=qr(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Zr(e,t,n):Xr(e,t,n);default:return Xr(e,t,n)}},ei=(e,t)=>{if(!Wr.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=$r(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
32
|
-
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;Kr.value??=Gr();let o=Kr.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ti={kind:`Local`},ni=/* @__PURE__ */ new WeakSet,ri=/* @__PURE__ */ new WeakMap,ii=/* @__PURE__ */ new WeakMap,ai=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},oi=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),si=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,ci=e=>e.kind===`Operator`?e.params.length:0,li=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],ui=e=>e.name.includes(`!`),di=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},fi=(e,t,n)=>{let r=t.bindings.get(e);return r&&si(r.position,t.location)&&(!n||si(r.position,n.start))?r:void 0},pi=(e,t)=>e!==void 0&&t!==void 0&&_(e)===_(t),mi=(e,t,n,r)=>{if(t===void 0)return!0;if(pi(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=_(i),o=t.range&&_(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},hi=(e,t,n,r)=>mi(t,di(e,t)??fi(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,gi=(e,t,n)=>{mi(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},_i=(e,t,n,r)=>t.reduce((e,t,i)=>hi(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),vi=(e,t,n)=>t.reduce((e,t)=>hi(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),yi=e=>e.kind===`Name`?[e.name]:e.names,bi=e=>e.flatMap(e=>yi(e.pattern)),xi=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||si(n.location,t.location))?n:void 0},Si=(e,t)=>{let n=xi(e,t);return n?{key:t.getKey(n),arity:ci(n),params:li(n),kind:`Definition`}:t.imported.get(e)},Ci=(e,t,n)=>di(t,e)??Si(e,n),wi=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Ti=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return si(e.location,e.args[0].location)?`prefix`:`postfix`}},Ei=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),Di=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Oi=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,ki=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},Ai=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?ki(e.name,[],void 0):ki(e.operator,e.args,e.argumentCounts),ji=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Mi=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:bi(e.bounds),body:e.body,sets:ji(e.bounds)};case`SetMap`:return{names:bi(e.bounds),body:e.expression,sets:ji(e.bounds)};case`SetFilter`:return{names:yi(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:yi(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},Ni=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Pi=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Fi=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Ii=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Ii(e.body,t):dr(e).reduce((e,n)=>e??Ii(n,t),void 0)},Li=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Li(i,t,n||Fi(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Ii(e.set,t):Ii(e,t)},Ri=e=>e.kind===`Label`?Ri(e.body):e,zi=e=>typeof e==`number`?`argument selector ${e}`:e,Bi=`within the scope of a declaration
|
|
33
|
-
from outside that declaration's scope.`,Vi=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:_(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&Ri(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:Li(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?Ii(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&Fi(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${Bi}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=zi(n.operand);if(l.isSufficesOpen){if(Oi(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=Ri(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Ci(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=Mi(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:Ni(e);if(!c)return;let f=Oi(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=Oi(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(Fi(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${Bi}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},Hi=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:_(e.location.range),message:n}),!0)},Ui=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=_(r),a=e.params.filter((r,i)=>{let a=di(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:_(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},Wi=(e,t,n,r)=>{if(!Pi(e))return!1;let i=Ai(e),a=i[0],o=i.length>1&&a.kind===`Name`?di(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Vi(e,i,o,t,n,r),o!==void 0},Gi=(e,t,n,r)=>{let i=e.location;if($i(e,n,r))return;let a=ii.get(e);if(a!==void 0)return a;if(ai(t)||Wi(e,n,r,!1)||Di(t))return e.kind===`Apply`?e.args.length:0;let o=di(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=ti),o)return o.arity;let s=Si(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,ii.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(di(n,c)!==void 0||Si(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=_(wi(i,t===`-.`?`-`:t));if(!Ei(t)){r.errors.push({location:l,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:l,message:`Could not find declaration or definition of symbol '${t}'.`});let u=Ti(e);u&&i.range&&r.errors.push({location:_(i.range),message:`Couldn't resolve ${u} operator symbol \`${t}'.`})},Ki=(e,t,n)=>(e.forEach(e=>ea(e.set,t,n)),e.reduce((e,t)=>_i(e,yi(t.pattern),t.pattern.ranges,n),t)),qi=(e,t)=>e.kind===`Identifier`&&e.name===t&&X(e)||dr(e).some(e=>qi(e,t)),Ji=(e,t)=>{e.kind===`FunctionConstruction`&&qi(e.body,t)&&(e.isRecursive=!0),dr(e).forEach(e=>Ji(e,t))},Yi=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?bi(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:_(o),message:e})},c=e.kind===`Function`?Ki(e.bounds,t,i):vi(t,e.params,i),l=di(c,a)??fi(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(ea(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Ji(e.body,a)):ea(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:mi(a,di(t,a)??fi(a,i,o),{kind:`Definition`,arity:ci(e),range:o},i)},Xi=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(di(e,t.name)?.isPending)return e;let n={name:t.name,arity:ci(t),params:li(t),kind:`Definition`,parent:e,isPending:!0};return r.add(n),n},t);return e.reduce((e,t)=>{let i={name:t.name,arity:ci(t),kind:`Definition`,range:t.location.range,parent:e};if(ui(t))return i;let a=n.isGenerated||t.isLocal||ai(t.name);return Yi(t,e,a?{...n,isGenerated:a}:n,r)?{...i,params:li(t)}:e},i)},Zi=(e,t,n)=>{let r=e.operator,i=Ci(r,t,n),a=Gi(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:_(e.argumentsRange??wi(e.location,r)),message:`The operator ${r} requires ${a} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Qi(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:_(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=Gi(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else ea(i,t,n);return!0}if(i.kind===`Lambda`){ea(i,t,n);let o=i.params.length===c;return!o&&ni.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&s(e.selectorRanges?.at(-1)??wi(e.location,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return ea(i,t,n),!0;if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=Ci(u,t,n)?.params??[],f=Gi(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(wi(i.location,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},Qi=(e,t,n)=>{e.kind===`Identifier`?Gi(e,e.name,t,n):ea(e,t,n)},$i=(e,t,n)=>{let r=ri.get(e);return r?(r.args.forEach(e=>Qi(e,t,n)),n.errors.push(r.error),!0):!1},ea=(e,t,n)=>{if(ni.has(e)&&!n.isGenerated){ea(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>ea(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=e.name,i=Gi(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:_(wi(e.location,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Gi(e,e.operator,t,n);return;case`Apply`:Zi(e,t,n);return;case`Lambda`:ea(e.body,_i(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:ea(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&ea(e.other,t,n);return;case`Let`:ea(e.body,Xi(e.definitions,t,n),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:ea(e.body,Ki(e.bounds,t,n),i(bi(e.bounds)));return;case`UnboundedQuantifier`:ea(e.body,_i(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&ea(e.set,t,n),ea(e.body,_i(t,yi(e.pattern),e.pattern.ranges,n),i(yi(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:ea(e.predicate,Ki([e.bound],t,n),i(yi(e.bound.pattern)));return;case`SetMap`:ea(e.expression,Ki(e.bounds,t,n),i(bi(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:_(r.location.range??wi(r.location,r.name)),message:`Non-unique fields in constructor.`}),ea(r.value,t,n)});return;case`Except`:ea(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),ea(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:ea(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(Hi(e,n))return;ea(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Ui(e,t,n);return;case`Subexpression`:if($i(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Qi(e,t,n)),Wi(e,t,n,!1)}},ta=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Wi(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;n.facts.has(r)||ea(e,t,n)}),na=(e,t,n)=>(e.set&&ea(e.set,t,n),hi(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),ra=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:na(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?ra(t,e.scope,e.unit,!0):ea(t,e.scope,e.unit),e),{scope:t,unit:n});return ea(e.conclusion,i.scope,i.unit),i.scope},ia=(e,t,n)=>e.kind===`AssumeProve`?ra(e,t,n):(ea(e,t,n),t),aa=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&ta(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>oa(t,e,r),t)},oa=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set};switch(r.kind){case`Assert`:{let a=ia(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return aa(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return aa(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return ta(r.facts,t,n),t;case`Define`:return Xi(r.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),t,n);case`Have`:case`Case`:return ea(r.expression,t,i),aa(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>ea(e,t,i)),t;case`Take`:return _i(Ki(r.bounds,t,i),r.names,r.nameRanges,i);case`Pick`:{let a=_i(Ki(r.bounds,t,i),r.names,r.nameRanges,i);return ea(r.body,a,{...i,labelParams:[...i.labelParams,...bi(r.bounds),...r.names]}),aa(e.proof,t,n),a}default:return aa(e.proof,t,n),t}},sa=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:ia(e.statement,void 0,t);e.name!==void 0&&gi(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),aa(e.proof,n,t),r&&(r.isInProof=!1)},ca={line:0,column:0},la=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),ua=(e,t)=>{let n=new Map([...oi,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},da=(e,t,n,r)=>{let i=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),void 0),a=ua(n,r.imported),o={location:e.location,errors:[],warnings:[]};r.reports.push(o);let s={imported:a,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...a].map(([e,t])=>[e,{...t,position:ca}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1},c=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){ea(n,i,s);return}let r=Gi(n,n.name,i,s);if(r!==void 0&&r!==t.arity)throw new p(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},l=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){o.errors.push({location:_(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let i=e.expression;c(r,i);let a=i.location.range;l.has(n)?a&&o.errors.push({location:_(a),message:`Multiple substitutions for symbol '${n}' in substitution.`}):l.set(n,i)});let u=t.filter(e=>!l.has(e.name)),d=e=>!di(i,e.name)&&!Si(e.name,s);return u.filter(e=>!d(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};c(t,n),l.set(t.name,n)}),u.filter(d).forEach(t=>{let r=e.location.range,i=t.location.range;r&&i&&o.errors.push({location:_(r),message:`Substitution missing for symbol ${t.name} declared at ${_(i)} \nand instantiated in module ${n.name}.`})}),l},fa=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>si(e.location,t.location)?-1:+!!si(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof p)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},pa=(e,t)=>{let n=ua(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...oi,...t.bound].map(([e,t])=>[e,{...t,position:ca}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>gi(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return fa([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=mi(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);la(e,t)?ea(t.body,void 0,i):Yi(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:ci(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);vi(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>gi(t,e,i)),e.name!==void 0&&gi(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);ea(e.expression,void 0,r),e.name!==void 0&&gi(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>sa(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>ta(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:_(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},ma=/* @__PURE__ */ new WeakSet,ha=/* @__PURE__ */ new WeakSet,ga=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Sa(e,(e,r)=>ga(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&X(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&X(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},_a=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),va=/* @__PURE__ */ new WeakMap,ya=e=>va.get(e)??e.name,ba=(e,t)=>(ya(t)!==e.name&&va.set(e,ya(t)),e),xa=(e,t)=>ba(e.kind===`Function`?{...e,bounds:_a(e.bounds,e=>t(e,[])),body:t(e.body,bi(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Sa=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>xa(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:_a(e.bounds,n),body:t(e.body,bi(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,yi(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,yi(e.bound.pattern))};case`SetMap`:return{...e,bounds:_a(e.bounds,n),expression:t(e.expression,bi(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Ca=`LAMBDA`,wa=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return Sa(e,(e,n)=>(r.push(...wa(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Ta=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Ea=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Da=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Oa=(e,t)=>e.map(e=>({pattern:Da(e.pattern,t),set:e.set})),ka=(e,t)=>e.kind===`Function`?{...e,bounds:Oa(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Aa=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>ba({...ka(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Oa(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Da(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Da(e.bound.pattern,n),set:e.bound.set}};default:return e}},ja=e=>`${e}@ENABLED`,Ma=(e,t)=>e.modes.get(t)??e,Na=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!X(e)&&t.instantiation.variables.has(e.name),Pa=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Pa(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Na(e,t,n))return[e.name];let r=X(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Pa(r.body,t,/* @__PURE__ */ new Map):void 0},Fa=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Na(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:ja(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Ba(e.expression,Ma(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Ba(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Ba(e.subscript,Ma(t,`Primed`),n),location:r},Ba(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Pa(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:ja(r),location:e.location},location:e.location},Ba({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Ia=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),La=(e,t)=>e.map(e=>Ia(e.name,t)),Ra=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...La(t,r),...i.map(e=>Ia(e,r))],location:r},location:r}},za=(e,t)=>e.instantiation.isParameterized(t)?Ha(e,t):void 0,Ba=(e,t,n)=>{let r=e=>Ba(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!X(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Ba(e.expression,Ma(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Ba(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Ma(t,`Enabled`),n)};let s=Fa(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return ma.add(n),n;let r=za(t,e.name);if(r===void 0)return e;if(a.length===0)return{...e,name:r};let o=i.getDefinition(e.name);return o&&ci(o)>0?Ra(r,a,ci(o),e.location):{kind:`Apply`,operator:r,args:La(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),s=i.substitutions.size>0||a.length>0||ha.has(e),c=e=>(s&&ha.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return c({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return c({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Ca,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:Ca,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new p(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=za(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...La(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=za(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?Ra(n,a,ci(r),e.location):{...e,operator:n}}let c=Ta(t),l=Sa(e,(e,i)=>i.length===0?r(e):Ba(e,t,Ea(n,i,c)));return Aa(l,n,c)},Va=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:Ia(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ha=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Ta(e),o=ka(xa(i,(t,n)=>Ba(t,e,Ea(/* @__PURE__ */ new Map,n,a))),a);return Va(o,r.params,i.location)}):t},Ua=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>wa(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>za(i,e)??e,getQualifiedKey:t=>{let n=za(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Va(r,e.params,r.location)):t}}},Wa=e=>e.kind===`Let`&&e.instances!==void 0||dr(e).some(Wa),Ga=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Sa(e,e=>Ga(e,t,r));return i.kind!==`Let`||!i.instances?i:{kind:`Let`,definitions:i.instances.reduce((e,n)=>{let i=e.findIndex(e=>si(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions),body:i.body,location:i.location}},Ka=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,qa=(e,t)=>e.definitions.some(e=>Wa(e.body))||e.assumptions.some(e=>Wa(e.expression))||e.theorems.some(e=>{let t=Ka(e);return t!==void 0&&Wa(t)})?{...e,definitions:e.definitions.map(e=>xa(e,e=>Ga(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ga(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Ka(e);return n===void 0?e:{...e,statement:Ga(n,t,[])}})}:e,Ja=/* @__PURE__ */ new WeakMap,Ya=/* @__PURE__ */ new WeakMap,Xa=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Za=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Qa=(e,t,n)=>{if(typeof t==`boolean`)return t;throw new b(`In computing ${n?`initial`:`next`} states, TLC expected a boolean expression,\nbut instead found ${Y(t)}.\n${Go(e)}`)},$a=(t,r,i=_c(t,r))=>{if(r.next!==void 0&&t.kind===`Number`)throw n(new b(`The next state relation is not a boolean expression.\n${t.text??t.value}`),e.error);return Qa(t,i,r.next===void 0)},eo=e=>e===`=`||e===`\\in`||e===`\\subseteq`,to=/* @__PURE__ */ new WeakMap,no=(e,t)=>{if(!e.trace)return t?Ja:Ya;let n=to.get(e)??[/* @__PURE__ */ new WeakMap,/* @__PURE__ */ new WeakMap];return to.set(e,n),n[+!t]},ro=(e,t,n)=>{let r=no(t,n),i=r.get(e);if(i)return i;let a=Po(e,t,n),o=t.trace,s=o?(t,n,r,i,s,c)=>{let l=o.length;o.push(e),a(t,n,r,i,s,c),o.length=l}:a;return r.set(e,s),s},io=(e,t)=>{if(t.constants.has(e))return;let n=os(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},ao=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return ao(e.expression,t,!1,r);if(e.kind!==`Identifier`||X(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=io(e.name,t);if(a&&!r.has(a))return r.add(a),ao(a.body,t,n,r)},oo=(e,t,n)=>ao(e,t,!n),so=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return so(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Bs(e.definitions,Xa(r,t,n));return so(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ts(t,e.name);if(a?.kind===`Thunk`)return so(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=io(e.name,r.environment);if(s)return so(s.body,void 0,n,r,i)},co=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||X(e))||!t&&e.kind===`Prime`,lo=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>lo(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=io(e.name,t);if(i)return n.add(e.name),lo(i.body,t,n)},uo=(e,t)=>{if(e.kind===`Tuple`)return[e,...e.elements.flatMap(e=>uo(e,t))];let n=e.kind===`Identifier`&&!t.variableIndex.has(e.name)?io(e.name,t):void 0;return n?[e,...uo(n.body,t)]:[e]},fo=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),po=(e,t,n)=>fo.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||eo(e.operator)&&(co(e.args[0],n)||oo(e.args[0],t,n)!==void 0)||X(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,mo=/* @__PURE__ */ new Set,ho=(e,t)=>{if(X(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Sa(e,(e,i)=>{let a=r.isReadOnly?ho(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},go=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||X(e)?void 0:os(r,t);return i&&!n.has(i)&&(n.add(i),go(i.body,t,n))?!0:dr(e).some(e=>go(e,t,n))},_o=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=oo(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=lo(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return po(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:ro(e,t,n)}},vo=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(Xc(e,t)===void 0||go(e,t,/* @__PURE__ */ new Set))return!0;let n=ho(e,mo);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},yo=(e,t,n)=>{let r=e.map(e=>_o(e,t,n)),i=r.map(()=>void 0),a=t.trace,o=(e,n,s,c,l,u)=>{let d=c,f;for(let c=e;c<r.length;c++){if(c>0&&n.isInit&&Ro(d)){f??=Xa(n,s,d);for(let e=c;e<r.length;e++)if(!bo(r[e].expression,f))return;u(d,l);return}let e=r[c];if(a&&(a.push(e.expression),e.expression.kind===`Unchanged`&&a.push(...uo(e.expression.expression,t))),e.kind===`Guard`){f??=Xa(n,s,d);let r=i[c]??=gc(e.expression,t);if(!$a(e.expression,f,r(f)))return;continue}if(e.kind===`Assign`){f??=Xa(n,s,d);let r=(i[c]??=gc(e.value,t))(f),a=d[e.index];if(a===void 0)d=Za(d,e.index,r),f=void 0;else if(!et(a,r))return;continue}if(e.kind===`Unchanged`){let t=n.current;if(!t)return;for(let n of e.indices){let e=d[n];if(e===void 0)d=Za(d,n,t[n]),f=void 0;else if(!et(e,t[n]))return}continue}let p=c+1;e.runner(n,s,d,l,!0,(e,t)=>o(p,n,s,e,t,u));return}u(d,l)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},bo=(e,t)=>Qa(e,_c(e,t),!0),xo=e=>(t,n,r,i,a,o)=>{$a(e,Xa(t,n,r))&&o(r,i)},So=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Xa(r,i,a);if(a[l]!==void 0){$a(e,u)&&c(a,o);return}let d=_c(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Yt(f))throw new b(`In computing ${r.isInit?`initial`:`next`} states, the right side of \\IN is not enumerable.\n${Go(e)}`);let p=sn(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Za(a,l,p[e]),o)}},Co=/* @__PURE__ */ new WeakMap,wo=e=>{let t=Co.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(wo),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Co.set(e,n),n},To=(e,t)=>{let n=e.args[0],r=xo(e),i=(e,r,i)=>so(n,r,i,e,!t)??-1,a=So(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=_c(e.args[1],Xa(t,n,o));l(Za(o,u,d),s)}},Eo=(e,t,n,r)=>{if(e.kind===`FunctionConstruction`)return{bounds:e.bounds,body:e.body,scope:t};if(e.kind!==`Identifier`)return;let i=ts(t,e.name);if(i?.kind===`Thunk`)return Eo(i.expression,i.scope,n,r);let a=i?void 0:os(e.name,r.environment);if(a?.kind!==`Function`)return;let o=_c(e,Xa(r,void 0,n));return{bounds:a.bounds,body:a.body,scope:ns(void 0,a.name,o)}},Do=(e,t,n)=>{let r=xo(e);return(i,a,o,s,c,l)=>{let u=Eo(e.function,a,o,i);if(!u){r(i,a,o,s,c,l);return}let d=Xa(i,a,o),f=e.args.map(e=>_c(e,d)),p=f.length===1?f[0]:Ut(f),m=fs(u.bounds,Xa(i,u.scope,o));if(!yn(p,m))throw new b(`Attempted to apply a function to ${Y(p)}, which is not in its domain at ${Wo(e)}`);ro(u.body,t,n)(i,ps(u.bounds,u.scope,p),o,s,c,l)}},Oo=(e,t)=>{if(lo(e,t))return yo([wo(e)],t,!1);if(e.kind===`Tuple`)return ro(wo(e),t,!1);let n=wo(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ts(i,e.name):void 0;l?.kind===`Thunk`?ro(wo(l.expression),t,!1)(r,l.scope,a,o,s,c):$a(n,Xa(r,i,a))&&c(a,o)}},ko=(e,t,n)=>{let r=e.operator,i=xo(e),a=X(e)?void 0:ws(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Dc(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=ro(a.body,t,n),o.body(e,i(Xa(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Xa(a,o,s),f=Es(e,d);f?.kind===`Closure`?ro(f.body,t,n)(a,Rs(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Ao=(e,t,n)=>{let r=xo(e),i=X(e)?void 0:io(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ts(s,e.name);f?.kind===`Thunk`?ro(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=ro(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},jo=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||X(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!X(a))return;let o=ao(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>jo(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||X(e))return;let r=ws(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=jo(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(i&&o?.kind===`Identifier`&&X(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Mo=(e,t,n)=>{let r=ts(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},No=(e,t,n)=>{let r=e.map(e=>ro(e,t,n)),i=n?[]:e.map(e=>jo(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&Mo(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},Po=(e,t,n)=>{let r=e=>ro(e,t,n);switch(e.kind){case`And`:return yo(e.operands,t,n);case`Or`:return No(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(t,n,r,o,s,c)=>{let l=us(_c(a.set,Xa(t,n,r)),a.set);for(let a=0;a<l.length&&!t.isStopped;a++)i(t,ns(n,e,l[a]),r,o,s,c)}}let o=n||t.trace?void 0:vo(e,t);if(o){let r=yo(o.rest,t,n);return(t,n,i,a,s,c)=>{let l=Xa(t,n,i),u=e.bounds.map(e=>us(_c(e.set,l),e.set));if(u.some(e=>e.length===0))return;let d=(e,n)=>{if(e<0)r(t,n,i,a,s,c);else for(let r of u[e]){if(t.isStopped)return;let a=ns(n,o.names[e],r);if(e===u.length-1){let e=Xa(t,a,i);if(!o.guards.every(t=>$a(t,e)))continue}d(e-1,a)}};d(u.length-1,n)}}return(t,n,r,a,o,s)=>{ds(e.bounds,Xa(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Xc(e,t)!==void 0&&!go(e.body,t,/* @__PURE__ */ new Set)?ho(e,mo):void 0;return(t,n,r,o,s,c)=>{let l=[];ds(e.bounds,Xa(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ts(n,e)?.kind===`Value`)){u.every(n=>$a(e.body,Xa(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Ro(r)?u.slice(n).every(n=>bo(e.body,Xa(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=_c(e.condition,Xa(r,i,a));(as(l,`an IF condition`)?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=Xa(r,i,a),u=t.find(e=>as(_c(e.condition,l),`a CASE guard`))?.body??n;if(!u)throw new b(`In computing ${r.isInit?`initial`:`next`} states, TLC encountered a CASE with no conditions true.\n${Go(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Xs(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Bs(e.definitions,Xa(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new b(`UNCHANGED appears in an initial predicate at ${Wo(e)}`)}:Oo(e.expression,t);case`AngleAction`:{let t=r(e.action),n=wo(e.subscript);return(e,r,i,a,o,s)=>t(e,r,i,a,o,(t,i)=>{try{$a(n,Xa(e,r,t))||s(t,i)}catch(t){throw!e.isEnabled||!(t instanceof S)?t:new b(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`)}})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,wo(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Ao(e,t,n);case`FunctionApplication`:return Do(e,t,n);case`Apply`:{let i=e.args;if(eo(e.operator)){let r=oo(i[0],t,n);if(r!==void 0)return e.operator===`=`?yo([e],t,n):So(e,()=>r);if(co(i[0],n))return To(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=_c(i[0],Xa(t,n,r));(typeof c==`boolean`?c:as(c,`the left side of => at ${Wo(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return ko(e,t,n)}default:return xo(e)}},Fo=/* @__PURE__ */ new WeakMap,Io=e=>{let t=Fo.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Fo.set(e,n),n},Lo=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Ro=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},zo=(e,t)=>{let n=t.state;if(!n||!Ro(n))throw new b(`ENABLED needs a complete state at ${Wo(e)}`);let r=t.environment,i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return ro(e,r,!1)(i,t.scope,Io(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Bo=(t,r,i,a)=>{let o={environment:r,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};ro(t,r,!0)(o,a,Io(r),void 0,!1,t=>{if(!o.isStopped){if(!Ro(t))throw n(new w(t),e.error);o.isStopped=i(t)}})},Vo=(e,t,n)=>{let r=[];return Bo(e,t,e=>(r.push(e),!1),n),r},Ho=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return ro(e,n,!1)(a,i,Io(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Ro(e))throw new C(e,t,Lo(e,n).sort());o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Uo=(e,t,n,r)=>{let i=[];return Ho(e,t,n,e=>(i.push(e),!1),r),i},Wo=e=>`line ${e.location.line}, column ${e.location.column}`,Go=e=>{let t=e.location.range;return t?_(t):Wo(e)},Ko=(e,t)=>new b(`A non-boolean expression (${Pr(t)}) was used as the condition of an IF.\n${Go(e)}`),qo=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r){let r=e.operands[t],i=r.kind===`Number`?String(r.value):Go(r);return new b(`A non-boolean expression (${Pr(n)}) was used as a formula in a conjunction.\n${i}`)}let i=e.operands[Math.max(t,1)].location.range?.end??r.end;return new b(`Attempted to evaluate an expression of form P /\\ Q when ${t===0?`P`:`Q`} was\n${Pr(n)}.\n${Go({...e,location:{...e.location,range:{...r,end:i}}})}`)},Jo=e=>t=>On(t)?`Attempted to select nonexistent field "${e.field}" from the record\n${Y(t)}\n${Go(e)}`:Dn(t,e.field),Yo=e=>t=>`A non-function (${Pr(t)}) was applied as a function.\n${Go(e)}`,Xo=e=>t=>`Attempted to select field "${e.field}" from a non-record value ${Y(t)}\n${Go(e)}`,Zo=e=>t=>{if(!P(t))throw new b(`Attempted to apply the operator DOMAIN to a non-function\n(${Pr(t)})\n${Go(e)}`);return Nn(t)},Qo=(e,t)=>(n,r)=>{if(!Me(n)||We(n))throw new b(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Go(e)}`);return t.evaluate([n,r])},$o=t=>n(new b(`TLC can't handle real numbers: ${t.text} at ${Wo(t)}`),e.configParseError),es=t=>n(new b(`TLC can't handle a number this big: ${t.text??t.value} at ${Wo(t)}`),e.error),ts=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},ns=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),rs=(e,t,n)=>{if(t.kind===`Name`)return ns(e,t.name,n);let r=hn(n);if(!r||r.length!==t.names.length)throw new b(`Cannot bind <<${t.names.join(`, `)}>> to ${Y(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>ns(e,t,r[n]),e)},is=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next}),as=(e,t)=>{if(typeof e!=`boolean`)throw new b(`Expected ${t} to be a boolean but found ${Y(e)}`);return e},os=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),ss=(e,t)=>{if(e.kind===`Prime`||e.kind===`Unchanged`||e.kind===`Enabled`)return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=os(n,t);if(e&&!t.constants.has(n)&&!cs(e,t))return!0}return dr(e).some(e=>ss(e,t))},cs=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!ss(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>ss(e.set,t)));return t.constantLevels.set(e,r),r},ls=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},us=(e,t)=>{if(!Me(e)||We(e)){let n=Y(e),r=ls(e,n);throw new b(r===void 0?`TLC encountered a non-enumerable quantifier bound\n${n}.\n${Go(t)}`:`TLC encountered the non-enumerable quantifier bound\n${n}\n${Go(t)}\n${r}`)}return typeof e==`object`&&e.kind===`Interval`?zt(e):$t(e)??q(e).elements},ds=(e,t,n)=>{let r=e.map(e=>us(_c(e.set,t),e.set)),i=(t,a)=>t<0?n(a):r[t].some(n=>i(t-1,rs(a,e[t].pattern,n)));return i(e.length-1,t.scope)},fs=(e,t)=>{let n=e.map(e=>_c(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},ps=(e,t,n)=>{if(e.length===1)return rs(t,e[0].pattern,n);let r=hn(n)??[];return e.reduce((e,t,n)=>rs(e,t.pattern,r[n]),t)},ms=/* @__PURE__ */ new WeakMap,hs=(e,t)=>{let n=ms.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:_(r)};return ms.set(t,i),i},gs=(e,t,n)=>{let r=hs(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},_s=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Un(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(nt(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},vs=(e,t)=>{let n=fs(e.bounds,t),r=_s(n,(n,r)=>_c(e.body,is(t,ps(e.bounds,ns(void 0,e.name,r),n))),gs(e.bounds,e.body,n));return e.bounds.length===1?Cn(r):r},ys=(e,t)=>e.kind===`Function`?vs(e,t):_c(e.body,t),bs=(e,t)=>{let n=cs(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new b(`Operator ${e.name} requires ${e.params.length} arguments`);let i=is(t,void 0);if(!n)return ys(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>ys(e,i));return t.environment.definitionValues.set(e,a),a},xs=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=_c(e.expression,is(t,e.scope));return n&&(e.cache=r),r},Ss=/* @__PURE__ */ new WeakMap,Cs=e=>{let t=Ss.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Ss.set(e,n),n},ws=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return ws(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Cs(r):t.builtins.get(e)},Ts=/* @__PURE__ */ new WeakMap,Es=(e,t)=>{if(X(e))return Ds(e.operator,t);let n=Ts.get(e),r=n===void 0?ws(e.operator,t.environment)??null:n;return n===void 0&&Ts.set(e,r),r??Ds(e.operator,t)},Ds=(e,t)=>{let n=ts(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return ws(e,t.environment)},Os=e=>e.kind===`Closure`?e.params.length:e.arity,ks=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:Ds(n,t);if(!r)throw new b(`Expected an operator argument at ${Wo(e)}`);return r},As=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>ns(e,n.name,t[r]),e.scope);return _c(e.body,is(n,r))},js=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Os(e),call:n=>As(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},Ms=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Ds(e.name,t);return n!==void 0&&Os(n)>0},Ns=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),Ps=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return Ps(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},Fs=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Hs(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=X(e)?void 0:Ps(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ts(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Ns(e,t)}}return t=>Ns(e,t)},Is=/* @__PURE__ */ new WeakMap,Ls=(e,t)=>{let n=Is.get(e);if(n)return n;let r=Fs(e,t);return Is.set(e,r),r},Rs=(e,t,n)=>{if(t.length!==e.params.length)throw new b(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`);let r=e.scope;for(let i=0;i<t.length;i++){let a=e.params[i],o=a.arity>0?{kind:`Operator`,operator:ks(t[i],n)}:Ls(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},zs=(e,t,n)=>e.kind===`Closure`?_c(e.body,is(n,Rs(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>_c(e,n))):e.isLazy?e.evaluate(Cc(t,n),n):e.evaluate(t.map(e=>Ms(e,n)?js(ks(e,n),n):_c(e,n)),n),Bs=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0},i):r.params.length>0||n?.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0},i)},t.scope),Vs=(e,t,n)=>{let r=ts(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return xs(r,n);if(r?.kind===`Operator`){if(Os(r.operator)===0)return As(r.operator,[],n);throw new b(`Operator ${e} is used without arguments`)}let i=Ps(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Wc(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return bs(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new b(`Unknown identifier ${e} at ${Wo(t)}`)},Hs=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Us=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Ws=(e,t)=>Us.has(e)||t.builtins.get(e)?.isStateLevel===!0,Gs={builtins:Us,definitions:/* @__PURE__ */ new WeakMap},Ks={builtins:new Set([...Us].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},qs=(e,t)=>e.kind===`Operator`&&e.params.length===0&&cs(e,t),Js=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!X(e)){let e=os(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!qs(e,t)&&Ys(e,t,n))return!0}return dr(e).some(e=>Js(e,t,n))},Ys=(e,t,n=Gs)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Js(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Js(e.set,t,n));return n.definitions.set(e,i),i},Xs=(e,t)=>new Set(e.filter(e=>Ys(e,t))),Zs=e=>[...e.definitions.values()].some(t=>Ys(t,e)),Qs=e=>[...e.definitions.values()].some(t=>Ys(t,e,Ks)),$s=/* @__PURE__ */ new WeakMap,ec=(e,t)=>{let n=$s.get(e);if(n!==void 0)return n;let r=ic(e,t,nc);return $s.set(e,r),r},tc=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),nc=/* @__PURE__ */ new Set,rc=(e,t,n)=>n.size===0?ec(e,t):ic(e,t,n),ic=(e,t,n)=>{if(!tc.has(e.kind))return!1;if(e.kind===`Identifier`&&X(e))return n.has(e.name);if(X(e))return!1;if(e.kind===`Identifier`){let n=Ps(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&qs(n.definition,t)}if(e.kind===`Apply`){if(Ws(e.operator,t)||e.operator===`~>`)return!1;let r=ws(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=os(e.operator,t);if(!n||!cs(n,t)||Ys(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&rc(e,t,n))}let r={value:!0};return Sa(e,(e,i)=>(r.value&&=rc(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},ac=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,oc=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},sc=(e,t)=>{if(e.kind===`Identifier`&&X(e))return!t.has(e.name);if(X(e))return!0;let n={value:!1};return Sa(e,(e,r)=>(n.value||=sc(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},cc=(e,t)=>ma.has(e)&&ac(e)&&Xc(e,t)!==void 0&&!sc(e,nc),lc=/* @__PURE__ */ new WeakMap,uc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetMap`,`SetFilter`,`Tuple`,`Record`,`RecordSet`,`FunctionSet`,`Product`]),dc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),fc=(e,t)=>uc.has(e.kind)||e.kind===`Apply`&&dc.has(e.operator)&&!X(e)&&ws(e.operator,t)?.kind===`Builtin`,pc=(e,t,n,r)=>{try{return e(t)}catch(e){throw n.length===r+1&&n.push(...Ae(e)??[]),e}},mc=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=qc(e,t),i=ac(e)&&ec(e,t)?oc(r):cc(e,t)?bc(r):r,a=t.trace,o=a!==void 0&&fc(e,t),s=a?n=>{let r=a.length;a.push(e);let s=pc(i,n,a,r);a.length=r,o&&typeof s==`object`&&s.kind!==`FilteredSet`&&ke.current?.set(s,e);let c=typeof s==`object`&&s.kind===`FilteredSet`?lc.get(s):void 0;return c?c(t):s}:i;return t.evaluators.set(e,s),s},hc=/* @__PURE__ */ new WeakMap,gc=(e,t)=>{if(t.trace)return mc(e,t);let n=hc.get(e);if(n)return n;let r=(ac(e)&&ec(e,t)?void 0:ei(e,t))??mc(e,t);return hc.set(e,r),r},_c=(e,t)=>gc(e,t.environment)(t),vc=(e,t)=>{let n=e.name,r=X(e)?void 0:Ps(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Wc(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&cs(e,t))return t=>bs(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=gc(e.body,t),n.body(is(r,void 0)));return yc(e,t)?bc(r):r}return t=>bs(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>bs(e,t);return cs(e,t)||!yc(e,t)?n:bc(n)}return t=>Vs(n,e,t)},yc=(e,t)=>Xc(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Xc(e.set,t)!==void 0)),bc=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},xc=(e,t)=>{let n=ws(e,t);return n!==void 0&&Os(n)>0},Sc=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!X(e)&&xc(e.name,t)),Cc=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>_c(e,t),expression:e})),wc=/* @__PURE__ */ new Set([`=`,`#`,`\\in`,`\\notin`,`\\cup`,`\\cap`,`\\`]),Tc=(e,t,n)=>e===`\\in`||e===`\\notin`||(e===`\\cup`||e===`\\cap`)&&!Ne(t)?n:t,Ec=(e,t,n)=>{if(n.trace&&wc.has(e.name)&&t.length===2){let r=mc(t[0],n),i=mc(t[1],n);return t=>{let n=r(t),a=i(t);return je(Tc(e.name,n,a),()=>e.evaluate([n,a],t))}}if(e.isLazy)return n=>e.evaluate(Cc(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Sc(t[0],n)){let e=mc(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Sc(t[0],n)&&Sc(t[1],n);if(i&&a){let e=mc(t[0],n),r=mc(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>Ms(e,n)?js(ks(e,n),n):_c(e,n)),n)},Dc=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new b(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Ls(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:ks(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Oc=/* @__PURE__ */ new WeakMap,kc=e=>{let t=Oc.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return Oc.set(e,n),n},Ac=(e,t)=>{let n=[];for(let r=e;n.length<t;r=r?.parent){if(r?.binding.kind!==`Value`)return;n.push(r.binding.value)}return n},jc=(e,t)=>e.every((e,n)=>nt(e,t[n])),Mc=(e,t)=>{let n=os(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&cs(n,t)&&!Ys(n,t)},Nc=(e,t,n,r)=>{let i=Dc(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=gc(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next}));if(!r)return e=>o(i(e),e);let s=kc(e);return e=>{let n=i(e),r=Ac(n,t.length);if(!r)return o(n,e);let a=r.length;for(let e of r)a=Ln(a,Un(e));let c=s.calls.get(a),l=c?.find(e=>jc(e.args,r));if(l)return l.value;let u=o(n,e);return s.size<65536&&(s.size++,c?c.push({args:r,value:u}):s.calls.set(a,[{args:r,value:u}])),u}},Pc=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=mc(n[0],t),r=mc(n[1],t);return t=>!as(e(t),`the left side of =>`)||as(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new b(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=X(e)?void 0:ws(e.operator,t);if(r?.kind===`Closure`)return Nc(r,n,t,Mc(e,t));if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=mc(n[0],t),i=Zo(e);return t.trace?e=>{let t=i(r(e));return typeof t==`object`&&t.kind===`Interval`?{...t}:t}:e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=mc(n[0],t);return ha.has(e)||ss(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=mc(n[0],t),a=mc(n[1],t),o=Qo(e,r);return t.trace?e=>{let t=i(e),n=a(e);return je(t,()=>o(t,n))}:e=>o(i(e),a(e))}return r?.kind===`Builtin`?Ec(r,n,t):r=>{let i=Ds(e.operator,r);if(i)return zs(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new b(`${e.operator} is a function; apply it with brackets`):e.operator===`\\cdot`?new b(`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`):new b(`Unknown operator ${e.operator} at ${Wo(e)}`)}},Fc=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=mc(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=mc(a.set,t);return t=>{let s=us(o(t),a.set);for(let a=0;a<s.length;a++){let o=as(i(is(t,ns(t.scope,e,s[a]))),r);if(o!==n)return o}return n}}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>mc(e.set,t));return t=>{let s=a.map((e,n)=>us(e(t),o[n].set)),c=(a,o)=>{if(a<0)return as(i(is(t,o)),r)!==n;let l=s[a];for(let t=0;t<l.length;t++)if(c(a-1,ns(o,e[a],l[t])))return!0;return!1};return c(o.length-1,t.scope)?!n:n}}return e=>ds(o,e,t=>as(i(is(e,t)),r)!==n)?!n:n},Ic=(e,t)=>{if(e.kind===`Tuple`)return Ut(e.names.map(e=>{let n=ts(t,e);return n?.kind===`Value`&&n.value}));let n=ts(t,e.name);return n?.kind===`Value`?n.value:void 0},Lc=/* @__PURE__ */ new WeakSet,Rc=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Lc.add(e)},zc=(e,t)=>{let n=Lc.has(e),r=mc(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=mc(a.set,t);return t=>{let c=o?s(t):fs(i,t),l=typeof c==`object`&&c.kind===`ProductSet`&&i.length>1?c.factors:[c];if(e.isRecursive||n||!l.every(Ne)){let n=_s(c,e=>r(is(t,ps(i,t.scope,e))),gs(i,e.body,c));return i.length===1?Cn(n):n}if(o&&a.pattern.kind===`Name`){let e=a.pattern.name,n=Vt(c);return Cn($e(n,n.map(n=>r(is(t,ns(t.scope,e,n))))))}let u=[];return ds(i,t,e=>{let n=i.length===1?Ic(a.pattern,e)??!1:Ut(i.map(t=>Ic(t.pattern,e)??!1));return u.push([n,r(is(t,e))]),!1}),Nt(u)}},Bc=(e,t)=>{let n=Lc.has(e);n&&Rc(e.function);let r=mc(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>mc(e,t))}),value:mc(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Ut(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(is(i,ns(i.scope,`@`,e))):Pn(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return e=>{let t=r(e);for(let n of i)t=o(t,n.path,0,e,n.value);return t}},Vc=(e,t)=>{if(e.kind===`SetFilter`){let n=mc(e.predicate,t),r=mc(e.bound.set,t),i=e.bound.pattern;return t=>{let a=r(t),o=e=>n=>as(e(is(t,rs(t.scope,i,n))),`a set filter predicate`),s=o(n);if(!Ne(a)){if(Me(a)){let t={kind:`FilteredSet`,base:a,test:s};return lc.set(t,n=>({...t,test:o(mc(e.predicate,n))})),t}throw new b(`TLC encountered a non-enumerable quantifier bound ${Y(a)} at ${Wo(e.bound.set)}`)}return Qe(q(a).elements.filter(s))}}if(e.kind===`SetMap`){let n=mc(e.expression,t);return t=>{let r=[];return ds(e.bounds,t,e=>(r.push(n(is(t,e))),!1)),Ot(r)}}let n=e.set;if(!n)return()=>{throw new b(`TLC cannot evaluate an unbounded CHOOSE at ${Wo(e)}`)};let r=mc(e.body,t),i={pattern:e.pattern,set:n};return t=>{let n={value:void 0};if(ds([i],t,i=>as(r(is(t,i)),`the body of CHOOSE`)?(n.value=Ic(e.pattern,i),!0):!1),n.value===void 0)throw new b(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Go(e)}`);return n.value}},Hc=e=>[...e].sort((e,t)=>Ye(e.name,t.name)),Uc=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Wc=(t,n)=>a(new S(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${Go(n)}`,t),e.configParseError),Gc=e=>new b(`A primed expression appears outside an action at ${Wo(e)}`),Kc=(e,t)=>{let n=Hc(e),r=Uc(n),i=n.map(e=>mc(e.value,t));if(r)return e=>Nt(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>L(a,i.map(t=>t(e)),o):e=>$e(a,i.map(t=>t(e)))},qc=(e,t)=>{let n=e=>mc(e,t);switch(e.kind){case`Number`:{let t=e.value;return Hs(t)?()=>t:()=>{throw es(e)}}case`Decimal`:return()=>{throw $o(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return vc(e,t);case`Apply`:return Pc(e,t);case`OperatorReference`:case`Lambda`:return()=>{throw new b(`An operator cannot be used as a value at ${Wo(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw qo(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return e=>{for(let n=0;n<t.length;n++)if(as(t[n](e),`a disjunct`))return!0;return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw Gc(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>et(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Ko(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t)if(as(e.condition(n),`a CASE guard`))return e.body(n);if(r)return r(n);throw new b(`Attempted to evaluate a CASE with no conditions true.\n${Go(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(is(n,Bs(e.definitions,n)))}case`Forall`:case`Exists`:return Fc(e,t);case`UnboundedQuantifier`:return()=>{throw new b(`TLC cannot evaluate an unbounded quantifier at ${Wo(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Vc(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Ot(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Ut(t.map(t=>t(e)))}case`FunctionConstruction`:return zc(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return Kc(e.fields,t);case`RecordSet`:{let t=Hc(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return Bc(e,t);case`ExceptAt`:return t=>{let n=ts(t.scope,`@`);if(n?.kind!==`Value`)throw new b(`@ appears outside an EXCEPT at ${Wo(e)}`);return n.value};case`FunctionApplication`:{Rc(e.function);let r=n(e.function),i=e.args.map(n),a=Yo(e);if(i.length===1&&t.trace){let e=i[0];return t=>{let n=r(t),i=e(t),o=()=>jn(n,i,void 0,a);return P(n)?je(n,o):o()}}if(i.length===1){let e=i[0];return t=>jn(r(t),e(t),void 0,a)}return e=>jn(r(e),Ut(i.map(t=>t(e))),void 0,a)}case`FieldAccess`:{let t=n(e.record),r=e.field,i=Jo(e),a=Xo(e);return e=>jn(t(e),r,i,a)}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?as(t(e),`an action`)||r(e):as(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>zo(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new b(`The subexpression reference at ${Wo(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new b(`TLC cannot evaluate a temporal formula in a state at ${Wo(e)}`)}}},Jc=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Yc=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Xc=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Jc.has(e.kind))return!1;let a=Yc(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&Ws(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return dr(e).every(i)};return i(e)?[...n]:void 0},Zc=/* @__PURE__ */ new Map([[`Reals`,`-------------------------------- MODULE Reals -------------------------------
|
|
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
|
+
\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,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
|
+
`?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
|
|
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
|
+
`);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=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[xr(e.domain,t)]]),vt=(e,t,n)=>gt(en(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)?Sn(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(kr(e),kr(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}),Ut=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0}),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=e=>{Xt.isPresent&&typeof e==`object`&&Yt.add(e)},$t=e=>{!Wt.isPresent&&!Xt.isPresent||typeof e!=`object`||Jt.has(e)||(Jt.add(e),e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach($t),e.range.forEach($t)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach($t):N(e)&&I(e)&&(Qt(e),L(e).elements.forEach($t)))},en=(e,t)=>Gt(Ut(e,t),`record`),tn=(e,t)=>{if(Qt(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 tn(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:tn(e.domain,t.domain)&&tn(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]&&tn(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)=>tn(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 ai(e)===ai(t)}return zt(e,t)===0},nn=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):ai(n)===ai(r);return n},rn=nn(!1),an=nn(!0),on=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},sn=e=>{if(!P(e))return;let t=kr(e);return{domain:t.domain,range:t.range,low:on(t.domain)}},cn=e=>{if(!P(e))return;let t=kr(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},ln=(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},un=(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},dn=(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},fn=(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},pn={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`}},mn=(e,t,n)=>{let r=pn[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)}`},hn=(e,t,n)=>{let r=sn(n);if(!r){if(F(n))return ln(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=()=>gn(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 gn(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()},gn=(e,t)=>{for(let n=0;n<e.length;n++){let r=Sn(e[n],t[n]);if(r!==0)return r}return 0},_n=(e,t)=>{let n=kr(e);if(e.kind===`Function`&&Sr(n)!==void 0){let r=P(t)?Sr(t):void 0;return r?n.range.length-r.length||gn(n.range,r):hn({...n,low:1},e,t)}if(Kt(e)===`record`){let r=cn(t);if(!r){if(F(t))return ln(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||gn(n.domain,r.domain)||gn(n.range,r.range)}return hn({...n,low:on(n.domain)},e,t)},vn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),yn=(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`),bn=(e,t)=>{let n=vn(t)?t:L(t);return{elements:L(e).elements,otherElements:L(n).elements}},xn=(e,t)=>{if(yn(e,t))return zt(e,t);if(!vn(e))return xn(L(e),t);if(!N(t)){if(F(t))return ln(t,e);throw new y(`Attempted to compare the set ${z(e)} with the value:\n${z(t)}`)}let n=bn(e,t);return n.elements.length-n.otherElements.length||gn(n.elements,n.otherElements)},Sn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return zt(e,t);if(F(t))return ln(t,e);throw new y(mn(e,t,!1))}return e.kind===`ModelValue`?dn(e,t):P(e)?_n(e,t):xn(e,t)},Cn=(e,t)=>e.every((e,n)=>Dn(e,t[n])),wn=(e,t,n)=>{let r=sn(n);if(!r){if(F(n))return un(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)&&Cn(e.range,r.range);let i=e.low??r.low;return i===void 0?Cn(e.domain,r.domain)&&Cn(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})&&Cn(e.range,r.range)},Tn=(e,t)=>{let n=kr(e);if(e.kind===`Function`&&Sr(n)!==void 0){let r=P(t)?Sr(t):void 0;return r?n.range.length===r.length&&Cn(n.range,r):wn({...n,low:1},e,t)}if(Kt(e)===`record`){let r=cn(t);if(!r){if(F(t))return un(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&&Cn(n.domain,r.domain)&&Cn(n.range,r.range)}return wn({...n,low:on(n.domain)},e,t)},En=(e,t)=>{if(yn(e,t))return tn(e,t);if(!vn(e))return En(L(e),t);if(!N(t)){if(F(t))return un(t,e);throw new y(`Attempted to check equality of the set ${z(e)} with the value:\n${z(t)}`)}let n=bn(e,t);return n.elements.length===n.otherElements.length&&Cn(n.elements,n.otherElements)},Dn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(F(t))return un(t,e);throw new y(mn(e,t,!0))}return e.kind===`ModelValue`?fn(e,t):P(e)?Tn(e,t):En(e,t)},On=e=>{let t=[];for(let n of e){let e=An(n,t);e.isFound||t.splice(e.index,0,n)}return t},kn=(e,t)=>{let n=wr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},An=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=kn(e,()=>Sn(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}},jn=(e,t)=>t.some(t=>kn(t,()=>Dn(t,e))),Mn=/* @__PURE__ */ new WeakSet,Nn=e=>{typeof e==`object`&&(e.kind===`Set`&&(Mn.add(e),e.elements.forEach(Nn)),e.kind===`Function`&&(e.domain.forEach(Nn),e.range.forEach(Nn)))},Pn=(e,t)=>Tr(()=>tn(e,t),()=>Dn(e,t)),Fn=e=>{for(let t=1;t<e.length;t++)if(zt(e[t-1],e[t])>=0)return!1;return!0},In=e=>{for(let t=1;t<e.length;t++)Qt(e[t]);if(e.length<2||Fn(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)},Ln=e=>Tr(()=>In(e),()=>({kind:`MixedSet`,elements:e})),Rn=Ht([]),zn=(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)},Bn=(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)},Vn=(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!==Gr){let t=e.hash,n=0;for(;n<a.length;n++){let e=Xr(a[n]);if(e===Gr)break;t=t+Ur(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+ei(a[e])|0;c.fingerprint=t}return c},Hn=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)},Un=e=>{let t=Hn(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]))},Wn=[],Gn=[],Kn=/* @__PURE__ */ new WeakMap,qn=e=>{let t=Wn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Wn[e]=n,n},Jn=e=>{if(vr(e),e.low===1&&e.high>=1)return qn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Yn=e=>e.length>0&&(e===Wn[e.length]||Kn.has(e)),Xn=e=>{let t=L(e).elements;return Yn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Zn=e=>{let t=Gn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Gn[e]=n,n},Qn=e=>Gt(Ut(qn(e.length),e),`tuple`),$n=e=>Gt(Hn(e),`record`),er=e=>N(e)&&!Pt(e),tr=(e,t=!1)=>`UNION(${z(e.base,t)})`,nr=(e,t=e=>L(e).elements)=>{if(!er(e.base))throw new y(`Attempted to enumerate the nonenumerable set:\n${tr(e)}`);return t(e.base)},rr=(e,t,n)=>{if(er(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${tr(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)||ir(e.domain)===!0||ir(e)===!0;case`RecordSet`:return e.sets.every(I)||ir(e)===!0;case`ProductSet`:return e.factors.every(I)||ir(e)===!0;case`Union`:return I(e.base)&&fr(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}},ir=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=ir(e.domain);return t===void 0?void 0:!t&&ir(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=ir(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}},ar=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},or=(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},sr=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=[]:or(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)})},cr=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(or(r,e.length))}return t},lr=(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},ur=(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 On(e.elements);case`Interval`:{let t=Jn(e);return t!==Wn[t.length]&&Kn.set(t,e),t}case`Subset`:{if(vr(e.base)===0)return cr([]);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(_r(e));return cr(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=Xn(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 ar(n.map(()=>r)).map(e=>Ut(n,e))}case`RecordSet`:{if(!Ot.is174&&R(e))return[];let n=lr(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 ar(n).map(t=>$n(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Ot.is174&&R(e))return[];let n=lr(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 ar(n).map(Qn)}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=nr(e).flatMap((t,n)=>L(rr(t,n,e)).elements);return L(Ln(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!er(e.left)||!er(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`&&!er(e.left)&&!er(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===`\\`&&!er(e.left))throw new y(`Attempted to enumerate S \\ T when S:\n${z(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Vn(L(e.left),L(e.right)).elements;let t=e.operator===`\\`||er(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return L(n).elements.filter(t=>Er(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)}`)}},dr=/* @__PURE__ */ new WeakMap,L=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Ht(ur(e));let t=typeof e==`object`?dr.get(e):void 0;if(t)return t;let n=wr.sets;n?.push(e);let r=ur(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):In(r);return typeof e==`object`&&dr.set(e,i),i},fr=e=>{if(typeof e!=`object`||Yt.has(e))return L(e).elements;let t=wr.sets;t?.push(e);let n=hr(e);return t?.pop(),n},pr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,mr=e=>typeof e!=`object`||Yt.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?mr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||mr(e.left)||mr(e.right):pr(e)?.some(mr)??!1,hr=e=>{if(e.kind===`Union`)return nr(e,fr).flatMap((t,n)=>fr(rr(t,n,e)));if(e.kind===`FilteredSet`&&!Pt(e.base))return fr(e.base).filter(e.test);if(pr(e)?.some(mr))return ur(e,fr);if(e.kind!==`SetOperation`)return L(e).elements;if(e.operator===`\\cup`)return!er(e.left)||!er(e.right)?L(e).elements:[...fr(e.left),...fr(e.right)];let t=e.operator===`\\`||er(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return er(n)?fr(n).filter(t=>Er(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 nr(e).every((t,n)=>R(rr(t,n,e)));default:return L(e).elements.length===0}},gr=(e,t,n)=>e.reduce((e,r)=>{let i=e*vr(r,t);if(i>2147483647)throw new y(n());return i},1),_r=e=>`Overflow when computing the number of elements in:\n${z(e)}`,vr=(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 vr(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=vr(e.base,t);if(n>=31)throw new y(_r(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(R(e.domain))return 1;if(R(e.range))return 0;if(vr(e.range,t)===1)return 1}let n=vr(e.domain,t),r=vr(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(_r(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&R(e)?0:gr(e.sets,t,()=>_r(e));case`ProductSet`:return t!==`1.7.4`&&R(e)?0:gr(e.factors,t,()=>`Overflow when computing the number of elements in ${z(e)}`);default:return Qt(e),L(e).elements.length}},yr=e=>`Attempted to check if the set ${z(e)}is finite.`,br=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 br(e.base)&&R(e.base);case`Subset`:return br(e.base);case`FunctionSet`:{let t=br(e.domain);if(t&&R(e.domain))return!0;let n=br(e.range);return n&&R(e.range)?!0:n&&(t||vr(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(!br(e))n.isAllFinite=!1;else if(R(e))return!0;return n.isAllFinite}case`Union`:if(!er(e.base))throw new y(`Attempted to check if the nonenumerable set:\n${tr(e)}\nis a finite set.`);return L(e.base).elements.every(br);case`SetOperation`:if(e.operator===`\\cup`)return br(e.left)&&br(e.right);if(e.operator===`\\cap`){if(!br(e.left)&&!br(e.right))throw new y(yr(e));return!0}if(br(e.left))return!0;if(!br(e.right))throw new y(yr(e));return!1;case`FilteredSet`:if(!br(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}},xr=(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},Sr=e=>{if(typeof e!=`object`||!P(e))return;let t=kr(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Cr=(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)}`},wr={sets:void 0},Tr=(e,t)=>{let n=wr.sets,r=wr.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)}},Er=(e,t)=>{let n=wr.sets;if(n===void 0)return Dr(e,t);n.push(t);let r=Dr(e,t);return n.pop(),r},Dr=(e,t)=>{if(!N(t))throw new y(Cr(e,t));switch(t.kind){case`Set`:return Qt(e),Tr(()=>xr(t.elements,e)!==-1,()=>Mn.has(t)?An(e,t.elements).isFound:jn(e,t.elements));case`MixedSet`:return jn(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=>Er(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=kr(e),r=on(n.domain);return(r===void 0?Pn(t.domain,Ht(n.domain)):Pn({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Er(e,t.range))}case`RecordSet`:{let n=P(e)?kr(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=xr(n.domain,e);return i!==-1&&Er(n.range[i],t.sets[r])})}case`ProductSet`:{let n=P(e)?Sr(e):void 0;if(n===void 0){if(P(e)&&kr(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)=>Er(e,t.factors[n]))}case`FilteredSet`:return Er(e,t.base)&&t.test(e);case`Union`:if(!er(t.base))throw new y(`Attempted to check if:\n ${z(e)}\nis an element of the non-enumerable set:\n ${tr(t)}`);return L(t.base).elements.some(t=>Er(e,t));case`SetOperation`:return t.operator===`\\cup`?Er(e,t.left)||Er(e,t.right):Er(e,t.left)&&Er(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Sr(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=>Er(e,t.base))}default:throw new y(Cr(e,t))}},Or=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?Er(e,n):e.range.every((e,r)=>Or(e,t.range[r],n.range)),kr=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){I(e.domain)||vr(e.domain);let t=Xn(e.domain);return Gt(Ut(t,t.map(t=>e.apply(t))),Kt(e))}throw new y(`Expected a function but found ${z(e)}`)},Ar=(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.`}},jr=(e,t)=>{if(!Ot.is174)return Ar(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}.`},Mr=(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 xr(e,t)},Nr=e=>new y(`Attempted to apply function with integer domain to the non-integer argument ${dt(z(e))}`),Pr=(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&&Yn(r))throw Nr(t)}return Tr(()=>Mr(r,t),e=>{throw Ot.is174||r.length<32?r.forEach(e=>Dn(e,t)):xr(r,t,Sn),e})},Fr=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!Er(t,e.domain))throw new y(Kt(e)===`lambda`?Ar(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??Ar,i=Pr(e,t,r);if(i===-1)throw new y(r(e,t));return e.range[i]},Ir=e=>Yn(e)?Kn.get(e)??Zn(e.length):void 0,Lr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=kr(e).domain;return Ir(t)??Ht(t)},Rr=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!I(e.domain))){if(!Er(t,e.domain))return e;let r=n(e.apply(t));return Gt({kind:`LazyFunction`,domain:e.domain,apply:n=>Pn(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=kr(e),a=Pr(i,t,jr);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!==Gr){let e=Xr(c);if(e!==Gr){let t=Xr(i.domain[a]);l.hash=s===c?i.hash:i.hash-Wr(t,Xr(s))+Wr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-ti(e,s)+ti(e,c)|0}return l},zr=/* @__PURE__ */ new WeakMap,Br=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Vr=(e,t)=>Math.imul(e^t,16777619),Hr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Br(t)},Ur=e=>Br(e+2654435769|0),Wr=(e,t)=>Br(Math.imul(e,668265261)+t|0),Gr=795548749,Kr=e=>{if(e.kind===`ModelValue`)return Br(Vr(Hr(e.name),109));if(N(e)){if(!I(e))return Gr;let t=L(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Xr(t[e]);if(r===Gr)return Gr;n=n+Ur(r)|0}return n}if(e.kind===`LazyFunction`&&!I(e.domain))return Gr;let t=kr(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=Xr(t.domain[e]),i=Xr(t.range[e]);if(r===Gr||i===Gr)return Gr;n=n+Wr(r,i)|0}return n},qr=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(qr);return}let t=kr(e);t.domain.forEach(qr),t.range.forEach(qr)},Jr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Xr(e)===Gr&&qr(e);return}catch(e){if(!(e instanceof y))throw e;return e}},Yr=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[]}},Xr=e=>{if(typeof e==`number`)return Br(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Hr(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Kr(e)),e.hash;let t=zr.get(e);if(t!==void 0)return t;let n=Kr(e);return zr.set(e,n),n},Zr=/* @__PURE__ */ new WeakMap,Qr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},$r=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Qr(t)},ei=e=>Qr(ri(e)+2135587861|0),ti=(e,t)=>Qr(Math.imul(ri(e),374761393)+ri(t)|0),ni=e=>{if(e.kind===`ModelValue`)return Qr($r(e.name)^60);if(N(e)){if(!I(e))return $r(ai(e));let t=L(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ei(t[e])|0;return n}let t=kr(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+ti(t.domain[e],t.range[e])|0;return n},ri=e=>{if(typeof e==`number`)return Qr(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return $r(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=ni(e)),e.fingerprint;let t=Zr.get(e);if(t!==void 0)return t;let n=ni(e);return Zr.set(e,n),n},ii=/* @__PURE__ */ new WeakMap,ai=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=ii.get(e);if(t!==void 0)return t;let n=oi(e);return ii.set(e,n),n},oi=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ai(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(ai).join(`,`)}}`:`<${e.kind} ${z(e)}>`;let t=kr(e);return`(${t.domain.map((e,n)=>`${ai(e)}:${ai(t.range[n])}`).join(`,`)})`},si=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,ci=e=>e.reduce((e,t)=>e===0?0:e*vr(t),1),li=e=>{if(e.kind===`Subset`)return vr(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)&&vr(e.domain)===0)return Ht([Ut([],[])]);let t=e.kind===`FunctionSet`?vr(e.range)**vr(e.domain):ci(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Rn:t<=1999?L(e):void 0},ui=(e,t)=>{if(t)return li(e);if(I(e))try{return li(e)}catch(e){if(e instanceof y)return;throw e}},di=(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 tr(e,t)}},fi=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),pi=e=>{if(I(e.domain))try{return kr(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 si(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=ui(e,t);return n?r(n):di(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?pi(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`&&fi(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(` @@ `)})`}}},mi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${dt(z(n))}\n`).join(``)},hi=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},gi=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Xr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||an(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||an(i[e],n))return i[e]}return n.kind===`Set`?hi(n.elements,t):(hi(n.domain,t),hi(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}},_i=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`,vi=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),yi=(e,t)=>vi.has(e)?new y(t):new S(t),bi=e=>typeof e==`object`&&e.kind===`Operator`,V=(e,t,n)=>{let r=e[t];if(r===void 0||bi(r))throw yi(n,`${n} expects a value as argument ${t+1}`);return r},xi=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`number`)throw yi(n,`${n} expects an integer but received ${z(r)}`);return r},Si=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`boolean`)throw yi(n,`${n} expects a boolean but received ${z(r)}`);return r},Ci=(e,t,n)=>{let r=V(e,t,n);if(!N(r))throw yi(n,`${n} expects a set but received ${z(r)}`);return r},wi=(e,t,n)=>{let r=Ci(e,t,n);if(!I(r))throw yi(n,`${n} cannot enumerate the non-enumerable set ${z(r)}`);return r},Ti=(e,t,n)=>L(wi(e,t,n)),Ei=(e,t,n)=>Ti(e,t,n).elements,Di=(e,t,n)=>{let r=V(e,t,n),i=Sr(r);if(!i)throw yi(n,`${n} expects a sequence but received ${z(r)}`);return i},Oi=(e,t,n)=>{let r=V(e,t,n);if(!P(r))throw yi(n,`${n} expects a function but received ${z(r)}`);return kr(r)},ki=(e,t,n)=>{let r=e[t];if(r===void 0||!bi(r))throw yi(n,`${n} expects an operator as argument ${t+1}`);return r},Ai=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),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}),ji=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Mi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Ni=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(V(n,0,e),V(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Pi=e=>e>2147483647||e<-2147483648,Fi=e=>new S(`Overflow when computing ${e}`),Ii={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`},Li={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Ri={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`},zi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Bi=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Li[e.operator];if(e.kind!==`Function`)return Ii[e.kind];let t=Kt(e);return t===void 0?`FcnRcdValue`:zi[t]},Vi=e=>Ri[Bi(e)],Hi=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Ui=(e,t)=>{let n=n=>(...r)=>{let i=wr.sets?.length??0;try{return n(...r)}catch(n){throw n instanceof y&&(e.isLazy===!0||!(n instanceof S))?(wr.sets&&(wr.sets.length=i),Hi(t,n.message)):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Wi=(e,t)=>{if(typeof e!=`number`)throw Hi(t,`Cannot cast tlc2.value.impl.${Bi(e)} to tlc2.value.impl.IntValue`);return e},Gi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Ki=(e,t,n,r)=>{let i=Gi(e,n,`IntValue`,2);return Ni(t,(e,n)=>{let a=Wi(e,i),o=Wi(n,i),s=r(a,o);if(Pi(s))throw Fi(`${a}${t}${o}`);return s})},qi=(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},Ji=(e,t,n=e)=>Ni(e,(e,r)=>t(qi(e,`first`,n),qi(r,`second`,n))),Yi=(e,t,n)=>({...Mi(e,t,n),isLazy:!0}),Xi=(e,t,n)=>{let r=ki(e,t,n);return()=>r.call([])},Zi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Qi=()=>({bool:hl,condition:(e,t)=>{if(typeof e!=`boolean`)throw tl(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw nl(t,n,e);return e},apply:Fr,expectFunction:fl,tuple:Qn,set:Ln,record:en,writtenRecord:vt,equal:tn,enumerate:El,unassigned:(e,t)=>{throw gd(e,t)},primeOutsideAction:e=>{throw vd(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:pl,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>ul(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),$i={value:void 0},ea=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),ta=e=>`local${e.counter++}`,na=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),_i(e).forEach(e=>na(e,t)),t),ra=(e,t,n)=>{let r=ea(e,Uu(t,e.environment)),i=na(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=ea(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},ia=(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(()=>ta(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${sa(e,t.set,s)}, ${ea(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=ta(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${sa(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=ta(e),a=ta(e),o=ta(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})`},aa=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${sa(e,r[0],n)}, "the left side of =>") ? bool(${sa(e,r[1],n)}, "the right side of =>") : true)`;if(B(t))return ra(e,t,n);let i=Ql(t.operator,e.environment);if(i?.kind!==`Builtin`)return ra(e,t,n);if(i.name===`DOMAIN`)return`${ea(e,al(t))}(${sa(e,r[0],n)})`;if(i.name===`TLCEval`)return ra(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${ea(e,ol(t,i))}(${sa(e,r[0],n)}, ${sa(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Xu(r[0],a))return`${ea(e,i.evaluateUnary)}(${sa(e,r[0],n)})`;let o=r.length===2&&Xu(r[0],a)&&Xu(r[1],a);return i.evaluateBinary&&o?`${ea(e,i.evaluateBinary)}(${sa(e,r[0],n)}, ${sa(e,r[1],n)})`:ra(e,t,n)},oa=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(B(e))return!1;let r=cu(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return oa(e.expression,t,n);case`FieldAccess`:return oa(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>oa(e,t,n));default:return!1}},sa=(e,t,n)=>{let r=(t,r=n)=>sa(e,t,r);if(Pu(t)&&ku(t,e.environment))return ra(e,t,n);switch(t.kind){case`Number`:return gu(t.value)?String(t.value):ra(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 ra(e,t,n);let i=cu(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=ea(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?ea(e,i.value):ra(e,t,n)}case`Apply`:return aa(e,t,n);case`And`:case`Or`:{let n=ea(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)}, ${ea(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{ud(t.function);let i=`expectFunction(${oa(t.function,n,e.environment)?r(t.function):ra(e,t.function,{...n,context:`keepLazyContext(${n.context})`})}, ${ea(e,t)})`,a=il(e.environment.runtime.version),o=a?`, ${ea(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`${ea(e,rl(t))}(${r(t.record)})`;case`Record`:{let i=md(t.fields);if(hd(i))return ra(e,t,n);let a=ea(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}, ${ea(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=ea(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`)?ia(e,t,n):ra(e,t,n);default:return ra(e,t,n)}},ca=(e,t)=>{if(!Zi.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=sa(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}; };`;$i.value??=Qi();let o=$i.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},la={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},ua={none:0,error:1,warning:3,state:4},da={0:``,1:`Error: `,3:`Warning: `,4:`State `},fa=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===ua.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} @!@!@`:`${da[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},pa=`The configuration file did not specify the initial state predicate.
|
|
31
|
+
Can also be caused by trying to run TLC on a specification from
|
|
32
|
+
a module imported with a parameterized INSTANCE statement.`,ma=[[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
|
+
%1%`,!0],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
34
|
+
%1%,
|
|
35
|
+
but it produced the following error:
|
|
36
|
+
%2%`,!1],[2148,`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable %1% occurring in the state formula v.
|
|
37
|
+
`,!1],[2155,`Attempted to compare %1% with the value
|
|
38
|
+
%2%`,!0],[2158,`Attempted to check if the value:
|
|
39
|
+
%1%
|
|
40
|
+
is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
|
|
41
|
+
the following value:
|
|
42
|
+
%1%`,!0],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
|
|
43
|
+
%4%`,!0],[2176,`Applying %1% to the following value,
|
|
44
|
+
which is not %2%:
|
|
45
|
+
%3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
|
|
46
|
+
element is not a bag:
|
|
47
|
+
%1%`,!0],[2178,`Overflow when computing %1%`,!1],[2179,`The second argument of \\div is 0.`,!0],[2180,`0^0 is undefined.`,!0],[2181,`Attempted to compute cardinality of the value
|
|
48
|
+
%1%`,!0],[2182,`Evaluating an expression of the form %1% when s is not a %2%:
|
|
49
|
+
%3%`,!0],[2183,`The %1% argument of %2% must be in the domain of its %3% argument:
|
|
50
|
+
%4%
|
|
51
|
+
, but instead it is
|
|
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
|
+
on the right-hand side of a <- after already appearing on the
|
|
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,pa,!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
|
+
%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
|
+
%1%`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
|
|
58
|
+
but instead found %3%.
|
|
59
|
+
%4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
|
|
60
|
+
but didn't find one.
|
|
61
|
+
%3%`,!1],[2260,`In computing ENABLED, TLC encountered a temporal formula (%1%).
|
|
62
|
+
%2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
|
|
63
|
+
%2%`,!1],[2265,`TLC can't handle a number this big.
|
|
64
|
+
%1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
|
|
65
|
+
%4%`,!0],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
|
|
66
|
+
%2%`,!1],[2281,`The configuration file substitutes constant %1% with non-constant %2%%3%`,!1],[2283,`The argument of %1% should be a %2%, but instead it is:
|
|
67
|
+
%3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
|
|
68
|
+
The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
|
|
69
|
+
The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configuration file at line %1%
|
|
70
|
+
Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
|
|
71
|
+
It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
|
|
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]],ha={value:void 0},ga=()=>ha.value??=ma.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),_a=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,va=e=>_a.test(e)?void 0:ga().find(t=>t.pattern.test(e))?.message,ya=e=>e instanceof S||va(e.message)?.isEvalException===!0,ba=/* @__PURE__ */ new Map([[1e3,`
|
|
74
|
+
: `],[2105,`failed.
|
|
75
|
+
`],[2154,`but it produced the following error:
|
|
76
|
+
`],[2213,`:
|
|
77
|
+
`],[2281,` - specifically: `]]),xa=(e,t,n)=>{let r=n?ba.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)}${Sa(t.slice(a),n)}`},Sa=(e,t)=>{let n=t?va(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${ua.none} @!@!@\n${xa(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Ca=e=>String(e).padStart(2,`0`),wa=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 ${Ca(r%24)}h`:e>36e5?`${Ca(r%24)}h ${Ca(n)}min`:e>6e4?`${Ca(n)}min ${Ca(t)}s`:`${Ca(t)}s`},Ta=e=>`${e.getFullYear()}-${Ca(e.getMonth()+1)}-${Ca(e.getDate())} ${Ca(e.getHours())}:${Ca(e.getMinutes())}:${Ca(e.getSeconds())}`,Ea={kind:`Local`},Da=/* @__PURE__ */ new WeakSet,Oa=/* @__PURE__ */ new WeakMap,ka=/* @__PURE__ */ new WeakMap,Aa=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ja=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),Ma=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Na=e=>e.kind===`Operator`?e.params.length:0,Pa=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Fa=e=>e.name.includes(`!`),Ia=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},La=(e,t,n)=>{let r=t.bindings.get(e);return r&&Ma(r.position,t.location)&&(!n||Ma(r.position,n.start))?r:void 0},Ra=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),za=(e,t,n,r)=>{if(t===void 0)return!0;if(Ra(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},Ba=(e,t,n,r)=>za(t,Ia(e,t)??La(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Va=(e,t,n)=>{za(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ha=(e,t,n,r)=>t.reduce((e,t,i)=>Ba(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Ua=(e,t,n)=>t.reduce((e,t)=>Ba(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Wa=e=>e.kind===`Name`?[e.name]:e.names,Ga=e=>e.flatMap(e=>Wa(e.pattern)),Ka=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Ma(n.location,t.location))?n:void 0},qa=(e,t)=>{let n=Ka(e,t);return n?{key:t.getKey(n),arity:Na(n),params:Pa(n),kind:`Definition`}:t.imported.get(e)},Ja=(e,t,n)=>Ia(t,e)??qa(e,n),Ya=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Xa=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Ya(e.location,e.spelling??t)},Za=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return Ma(e.location,e.args[0].location)?`prefix`:`postfix`}},Qa=e=>!/^[\p{L}\d_]/u.test(e),$a=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),eo=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,to=(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])}})},no=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?to(e.name,[],void 0):to(e.operator,e.args,e.argumentCounts),ro=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),io=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Ga(e.bounds),body:e.body,sets:ro(e.bounds)};case`SetMap`:return{names:Ga(e.bounds),body:e.expression,sets:ro(e.bounds)};case`SetFilter`:return{names:Wa(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Wa(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}},ao=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}},oo=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,so=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),co=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?co(e.body,t):_i(e).reduce((e,n)=>e??co(n,t),void 0)},lo=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??lo(i,t,n||so(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&co(e.set,t):co(e,t)},uo=e=>e.kind===`Label`?uo(e.body):e,fo=e=>typeof e==`number`?`argument selector ${e}`:e,po=`within the scope of a declaration
|
|
78
|
+
from outside that declaration's scope.`,mo=(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`&&uo(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:lo(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?co(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&so(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${po}`);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=fo(n.operand);if(l.isSufficesOpen){if(eo(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=uo(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Ja(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=io(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:ao(e);if(!c)return;let f=eo(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=eo(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(so(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${po}`);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.`))},ho=(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)},go=(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=Ia(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)},_o=(e,t,n,r)=>{if(!oo(e))return!1;let i=no(e),a=i[0],o=i.length>1&&a.kind===`Name`?Ia(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&mo(e,i,o,t,n,r),o!==void 0},vo=(e,t,n,r)=>{let i=e.location;if(Oo(e,n,r))return;let a=ka.get(e);if(a!==void 0)return a;if(Aa(t))return e.kind===`Apply`?e.args.length:0;let o=Ia(n,t);if(o?.isNonFact){r.errors.push({location:g(Xa(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(_o(e,n,r,!1)||$a(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=Ea),o)return o.arity;let s=qa(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,ka.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(Ia(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===`-.`?Ya(i,`-`):Xa(e,t));if(!Qa(t)||$a(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=Za(e);d&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},yo=(e,t,n)=>(e.forEach(e=>U(e.set,t,n)),e.reduce((e,t)=>Ha(e,Wa(t.pattern),t.pattern.ranges,n),t)),bo=(e,t)=>e.kind===`Identifier`&&e.name===t&&B(e)||_i(e).some(e=>bo(e,t)),xo=(e,t)=>{e.kind===`FunctionConstruction`&&bo(e.body,t)&&(e.isRecursive=!0),_i(e).forEach(e=>xo(e,t))},So=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Ga(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`?yo(e.bounds,t,i):Ua(t,e.params,i),l=Ia(c,a)??La(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),xo(e.body,a),e.isSelfReferential=bo(e.body,a)):U(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:za(a,Ia(t,a)??La(a,i,o),{kind:`Definition`,arity:Na(e),range:o},i)},Co=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Ia(e,t.name)?.isPending)return e;let n={name:t.name,arity:Na(t),params:Pa(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)=>Po(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Aa(t.name)?e:s(e,e=>!Ma(t.location,e.location)),o={name:t.name,arity:Na(t),kind:`Definition`,range:t.location.range,parent:a};if(Fa(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Aa(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return So(t,a,u,i)?{...o,params:Pa(t)}:a},a),()=>!0)},wo=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Ia(t,r)??La(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},To=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=wo(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},Eo=(e,t,n)=>{if(To(e,t,n))return;let r=e.operator,i=Ja(r,t,n),a=vo(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:g(e.argumentsRange??Xa(e,r)),message:`The operator ${r} requires ${a-(wo(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Do(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=vo(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&&Da.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)??Xa(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=Ja(u,t,n)?.params??[],f=vo(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(Xa(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.`)})},Do=(e,t,n)=>{e.kind===`Identifier`?vo(e,e.name,t,n):U(e,t,n)},Oo=(e,t,n)=>{let r=Oa.get(e);return r?(r.args.forEach(e=>Do(e,t,n)),n.errors.push(r.error),!0):!1},U=(e,t,n)=>{if(Da.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(To(e,t,n))return;let r=e.name,i=vo(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:g(Xa(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:vo(e,e.operator,t,n);return;case`Apply`:Eo(e,t,n);return;case`Lambda`:U(e.body,Ha(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,Co(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:U(e.body,yo(e.bounds,t,n),i(Ga(e.bounds)));return;case`UnboundedQuantifier`:U(e.body,Ha(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&U(e.set,t,n),U(e.body,Ha(t,Wa(e.pattern),e.pattern.ranges,n),i(Wa(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:U(e.predicate,yo([e.bound],t,n),i(Wa(e.bound.pattern)));return;case`SetMap`:U(e.expression,yo(e.bounds,t,n),i(Ga(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??Ya(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(ho(e,n))return;U(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),go(e,t,n);return;case`Subexpression`:if(Oo(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Do(e,t,n)),_o(e,t,n,!1)}},ko=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||To(e,t,n)||_o(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&Ia(t,r)?.isNonFact?n.errors.push({location:g(Xa(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||U(e,t,n)}),Ao=(e,t,n)=>(e.set&&U(e.set,t,n),Ba(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),jo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Ao(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?jo(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},Mo=(e,t,n)=>e.kind===`AssumeProve`?jo(e,t,n):(U(e,t,n),t),No=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&ko(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Fo(t,e,r),t)},Po=(e,t,n)=>{let r=Vo(e,t,n);return e.name===void 0?r:Ba(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Fo=(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=Mo(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return No(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return No(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 ko(r.facts,t,n),o(t);case`Instance`:return o(Po(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Po(t,e,i):Co([t],e,n),t));case`Have`:case`Case`:return U(r.expression,t,i),No(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>U(e,t,i)),a(t);case`Take`:return a(Ha(yo(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ha(yo(r.bounds,t,i),r.names,r.nameRanges,i);return U(r.body,o,{...i,labelParams:[...i.labelParams,...Ga(r.bounds),...r.names]}),No(e.proof,a(t),n),a(o)}default:return No(e.proof,a(t),n),a(t)}},Io=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Mo(e.statement,void 0,t);e.name!==void 0&&Va(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),No(e.proof,n,t),r&&(r.isInProof=!1)},Lo={line:0,column:0},Ro=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),zo=(e,t)=>{let n=new Map([...ja,...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},Bo=(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=vo(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=>!Ia(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},Vo=(e,t,n)=>{let r=n.getInstance(e);return Bo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ba(e,t,r,n),t)},Ho=(e,t,n,r)=>{let i=zo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Bo(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:Lo}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Uo=(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)=>Ma(e.location,t.location)?-1:+!!Ma(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},Wo=(e,t)=>{let n=zo(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([...ja,...t.bound].map(([e,t])=>[e,{...t,position:Lo}])),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)=>Va(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return Uo([...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=za(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);Ro(e,t)?U(t.body,void 0,i):So(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:Na(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);Ua(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>Va(t,e,i)),e.name!==void 0&&Va(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&&Va(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>Io(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>ko(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)},Go=/* @__PURE__ */ new WeakSet,Ko=/* @__PURE__ */ new WeakSet,qo=(e,t,n=/* @__PURE__ */ new Set)=>{let r=$o(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},Jo=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Yo=/* @__PURE__ */ new WeakMap,Xo=e=>Yo.get(e)??e.name,Zo=(e,t)=>(Xo(t)!==e.name&&Yo.set(e,Xo(t)),e),Qo=(e,t)=>Zo(e.kind===`Function`?{...e,bounds:Jo(e.bounds,e=>t(e,[])),body:t(e.body,Ga(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),$o=(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:Jo(e.bounds,n),body:t(e.body,Ga(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,Wa(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,Wa(e.bound.pattern))};case`SetMap`:return{...e,bounds:Jo(e.bounds,n),expression:t(e.expression,Ga(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)}}},es=`LAMBDA`,ts=(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 $o(e,(e,n)=>(r.push(...ts(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},ns=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}},rs=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),is=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},as=(e,t)=>e.map(e=>({pattern:is(e.pattern,t),set:e.set})),os=(e,t)=>e.kind===`Function`?{...e,bounds:as(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},ss=(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=>Zo({...os(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:as(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:is(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:is(e.bound.pattern,n),set:e.bound.set}};default:return e}},cs=e=>`${e}@ENABLED`,ls=(e,t)=>e.modes.get(t)??e,us=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!B(e)&&t.instantiation.variables.has(e.name),ds=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ds(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(us(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?ds(r.body,t,/* @__PURE__ */ new Map):void 0},fs=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return us(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:cs(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:_s(e.expression,ls(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[_s(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:_s(e.subscript,ls(t,`Primed`),n),location:r},_s(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=ds(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:cs(r),location:e.location},location:e.location},_s({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},ps=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),ms=(e,t)=>e.map(e=>ps(e.name,t)),hs=(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:[...ms(t,r),...i.map(e=>ps(e,r))],location:r},location:r}},gs=(e,t)=>e.instantiation.isParameterized(t)?ys(e,t):void 0,_s=(e,t,n)=>{let r=e=>_s(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:_s(e.expression,ls(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:_s(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},ls(t,`Enabled`),n)};let s=fs(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Go.add(n),n;let r=gs(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&&Na(o)>0?hs(r,a,Na(o),e.location):{kind:`Apply`,operator:r,args:ms(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||Ko.has(e),c=e=>(s&&Ko.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:es,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:es,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=gs(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...ms(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=gs(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?hs(n,a,Na(r),e.location):{...e,operator:n}}let c=ns(t),l=$o(e,(e,i)=>i.length===0?r(e):_s(e,t,rs(n,i,c)));return ss(l,n,c)},vs=(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:ps(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ys=(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=ns(e),o=os(Qo(i,(t,n)=>_s(t,e,rs(/* @__PURE__ */ new Map,n,a))),a);return vs(o,r.params,i.location)}):t},bs=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ts(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=>gs(i,e)??e,getQualifiedKey:t=>{let n=gs(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>vs(r,e.params,r.location)):t}}},xs=e=>e.kind===`Let`&&e.instances!==void 0||_i(e).some(xs),Ss=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=$o(e,e=>Ss(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Ma(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},Cs=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ws=(e,t)=>e.definitions.some(e=>xs(e.body))||e.assumptions.some(e=>xs(e.expression))||e.theorems.some(e=>{let t=Cs(e);return t!==void 0&&xs(t)})?{...e,definitions:e.definitions.map(e=>Qo(e,e=>Ss(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ss(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Cs(e);return n===void 0?e:{...e,statement:Ss(n,t,[])}})}:e,Ts=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=wr.sets,a=i??[],o=a.length;wr.sets=a;try{return n()}catch(e){throw Bu(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,wr.sets=i}},Es=(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},Ds=e=>!e.includes(void 0),Os=e=>e.variables.map(()=>void 0),ks=(e,t,n)=>{let r=[...e];return r[t]=n,r},As=(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}},js=e=>e.kind===`Identifier`?e.name:void 0,Ms=(e,t,n)=>{if(t.kind===`Label`)return Ms(e,t.body,n);let r=js(t);if(r===void 0)return;let i=ll(n,r);if(i?.kind===`Thunk`)return Ms(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?Ms(e,o.body,o.scope):void 0},Ns=(e,t,n)=>{if(t.kind===`Prime`)return Ms(e,t.expression,n);if(t.kind===`Label`)return Ns(e,t.body,n);let r=js(t);if(r===void 0)return;let i=ll(n,r);if(i?.kind===`Thunk`)return Ns(e,i.expression,i.scope);if(i)return;let a=Ql(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Ns(e,a.body,a.scope):void 0},Ps=e=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean expression.`);return e},Fs=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Is=(e,t,n)=>{t===void 0?Ds(n)&&e.onState(n):Ds(n)&&Fs(e)?Rs(e,t,n):t.kind===`Predicate`?zs(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?Js(e,t.expression,t.rest,t.scope,n):Ls(e,t,n)&&Is(e,t.rest,n)},Ls=(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?_d(t,r.runtime.version):t}})();return!tn(i,a)},Rs=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){Js(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Ls(e,r,n):!Ps(W(r.expression,Es(e,r.scope,n))))return}e.onState(n)},zs=(e,t,n,r,i)=>Ts(e,t,()=>{switch(t.kind){case`Let`:zs(e,t.body,n,mu(t.definitions,Es(e,r,i)),i);return;case`Label`:zs(e,t.body,n,r,i);return;default:if(Ks.has(t.kind))throw new y(`The state relation is not a boolean expression.`);Ts(e,t,()=>qs(e,t,n,r,i))}}),Bs=(e,t,n,r)=>{Ps(t)&&Is(e,n,r)},Vs=(e,t,n,r,i)=>{let a=Es(e,r,i);if(t.kind===`Identifier`){let o=ll(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){zs(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){zs(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:Ql(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&bl(s,e.environment))){zs(e,c.body,n,c.scope,i);return}Bs(e,W(t,a),n,i);return}let o=eu(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?zs(e,o.body,n,fu(o,t.args,a),i):Bs(e,W(t,a),n,i)},Hs=(e,t,n,r,i)=>{let a=n[r];a===void 0?Is(e,t,ks(n,r,i)):tn(a,i)&&Is(e,t,n)},Us=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Ws=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?Ms(e,a,r):Ns(e,a,r),c=Es(e,r,i);if(s===void 0){W(t,c)===!0&&Is(e,n,i);return}let l=W(o,c),u=i[s];if(t.operator===`=`){Hs(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)W(t,c)===!0&&Is(e,n,i);else{if(!er(d))throw new y(`The right side of \\IN is not enumerable.`);for(let t of fr(d))Is(e,n,ks(i,s,t))}},Gs=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Ks=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),qs=(e,t,n,r,i)=>{let a=Es(e,r,i);switch(t.kind){case`Identifier`:Vs(e,t,n,r,i);return;case`Apply`:if(Gs.has(t.operator)&&t.args.length===2){Ws(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(Ps(W(t.args[0],a))){zs(e,t.args[1],n,r,i);return}Is(e,n,i);return}Vs(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)=>Us(`Predicate`,t,r,e),n);zs(e,a[0],t,r,i);return}let o=a[a.length-1];zs(e,As(t,a.length-1),Us(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>zs(e,t,n,r,i));return}zs(e,As(t,a.length-1),n,r,i),zs(e,a[a.length-1],n,r,i);return}case`Exists`:jl(t.bounds,a,r=>(zs(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(jl(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Is(e,n,i);return}let o=r.slice(1).reduce((e,n)=>Us(`Predicate`,t.body,n,e),n);zs(e,t.body,o,r[0],i);return}case`If`:zs(e,Ps(W(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>Ps(W(e.condition,a)))?.body??t.other;if(o===void 0)throw new y(`TLC encountered a CASE with no conditions true.`);zs(e,o,n,r,i);return}case`FunctionApplication`:{let r=Il(W(t.function,e.isInit?a:pl(a)));if(r){zs(e,r.body,n,Ll(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){Js(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){zs(e,t.action,n,r,i),Js(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){zs(e,t.action,Us(`Changed`,t.subscript,r,n),r,i);return}}Bs(e,W(t,a),n,i)},Js=(e,t,n,r,i)=>Ts(e,t,()=>{let a=Ms(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Hs(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Is(e,n,i);return}let s=o.reduceRight((e,t)=>Us(`Unchanged`,t,r,e),n);Js(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=ll(r,t.name);if(a?.kind===`Thunk`){Js(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){Js(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});tn(s,c)&&Is(e,n,i)}),Ys=(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}},Xs=/* @__PURE__ */ Error(`The replay found a successor`),Zs=(e,t,n,r)=>{let i=Ys(r,!1,n,()=>{throw Xs},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Us(`Changed`,e.subscript,t,void 0);zs(i,e.action,n,t,Os(r))}else zs(i,e,void 0,t,Os(r));return!1}catch(e){if(e!==Xs)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=Ys(t,!0,void 0,n),o=i.reduceRight((e,t)=>Us(`Predicate`,t.expression,t.scope,e),void 0);zs(a,r.expression,o,r.scope,Os(t))},$s=(e,t,n,r)=>{e.some(e=>Ks.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Ys(n,!1,t,e=>i.push(e));zs(a,e.expression,void 0,e.scope,Os(n)),i.forEach(t=>r(t,e))})},ec=/* @__PURE__ */ new WeakMap,tc=/* @__PURE__ */ new WeakMap,nc=(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},rc=(e,t,n)=>{let r=e.slice();return r[t]=n,r},ic=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,ac=(t,r)=>{let i=new y(r);return t.isInit?i:n(i,e.error)},oc=(e,t,n,r)=>{let i=el(n);return r&&Ks.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 ${ic(e)}, TLC expected a boolean expression,\nbut instead found ${z(t)}.\n${i}`},sc=(e,t,n)=>{let r=Vi(t),i=$c(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 ${ic(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
79
|
+
`:``}${i}`},cc=(e,t,n,r=!0)=>{let i=W(t,n);if(typeof i==`boolean`)return i;throw ac(e,oc(e,i,t,r))},lc=e=>e===`=`||e===`\\in`||e===`\\subseteq`,uc=(e,t,n)=>{let r=n?ec:tc,i=r.get(e);if(i)return i;let a=Lc(e,t,n);return r.set(e,a),a},dc=(e,t)=>{if(t.constants.has(e))return;let n=gl(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},fc=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return fc(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=dc(e.name,t);if(a&&!r.has(a))return r.add(a),fc(a.body,t,n,r)},pc=(e,t,n)=>fc(e,t,!n),mc=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return mc(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=mu(e.definitions,nc(r,t,n));return mc(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ll(t,e.name);if(a?.kind===`Thunk`)return mc(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=dc(e.name,r.environment);if(s)return mc(s.body,void 0,n,r,i)},hc=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||B(e))||!t&&e.kind===`Prime`,gc=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>gc(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=dc(e.name,t);if(i)return n.add(e.name),gc(i.body,t,n)},_c=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),vc=(e,t,n)=>_c.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||lc(e.operator)&&(hc(e.args[0],n)||pc(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,yc=/* @__PURE__ */ new Set,bc=(e,t)=>{if(B(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return $o(e,(e,i)=>{let a=r.isReadOnly?bc(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},xc=(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:gl(r,t);return i&&!n.has(i)&&(n.add(i),xc(i.body,t,n))?!0:_i(e).some(e=>xc(e,t,n))},Sc=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=pc(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=gc(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return vc(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:uc(e,t,n)}},Cc=(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(Cd(e,t)===void 0||xc(e,t,/* @__PURE__ */ new Set))return!0;let n=bc(e,yc);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)}},wc=(e,t,n)=>{let r=e.map(e=>Sc(e,t,n)),i=(e,t,n,a,o,s)=>{let c=a,l,u=Fs(t);for(let a=e;a<r.length;a++){if(a>0&&u&&Vc(c)){l??=nc(t,n,c);for(let e=a;e<r.length;e++)if(!cc(t,r[e].expression,l,!1))return;s(c,o);return}let e=r[a];if(e.kind===`Guard`){if(l??=nc(t,n,c),!cc(t,e.expression,l))return;continue}if(e.kind===`Assign`){l??=nc(t,n,c);let r=W(e.value,l),i=c[e.index];if(i===void 0)c=rc(c,e.index,r),l=void 0;else if(!tn(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=rc(c,t,n[t]),l=void 0;else if(!tn(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)},Tc=e=>(t,n,r,i,a,o)=>{cc(t,e,nc(t,n,r))&&o(r,i)},Ec=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=nc(r,i,a);if(a[l]!==void 0){cc(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!er(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${ic(r)}, the right side of \\IN is not enumerable.`;throw ac(r,`${t}\n${$c(e)}`)}let p=fr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(rc(a,l,p[e]),o)}},Dc=/* @__PURE__ */ new WeakMap,Oc=e=>{let t=Dc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Oc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Dc.set(e,n),n},kc=(e,t)=>{let n=e.args[0],r=Tc(e),i=(e,r,i)=>mc(n,r,i,e,!t)??-1,a=Ec(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],nc(t,n,o));l(rc(o,u,d),s)}},Ac=(e,t,n)=>{let r=$c(e);return(i,a,o,s,c,l)=>{let u=nc(i,a,o),d=W(e.function,n?u:pl(u)),f=Il(d);if(f!==void 0){uc(f.body,t,n)(i,Ll(f,e,u),o,s,c,l);return}if(!P(d))throw ac(i,`In computing ${ic(i)}, a non-function (${Vi(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw ac(i,`In computing ${ic(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},jc=(e,t)=>{if(gc(e,t))return wc([Oc(e)],t,!1);if(e.kind===`Tuple`)return uc(Oc(e),t,!1);let n=Oc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ll(i,e.name):void 0;l?.kind===`Thunk`?uc(Oc(l.expression),t,!1)(r,l.scope,a,o,s,c):cc(r,n,nc(r,i,a))&&c(a,o)}},Mc=(e,t,n)=>{let r=e.operator,i=Tc(e),a=B(e)?void 0:Ql(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=$u(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=uc(a.body,t,n),o.body(e,i(nc(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=nc(a,o,s),f=eu(e,d);f?.kind===`Closure`?uc(f.body,t,n)(a,fu(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Nc=(e,t,n)=>{let r=Tc(e),i=B(e)?void 0:dc(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ll(s,e.name);f?.kind===`Thunk`?uc(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=uc(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Pc=(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=fc(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=>Pc(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=Pc(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}},Fc=(e,t,n)=>{let r=ll(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Ic=(e,t,n)=>{let r=e.map(e=>uc(e,t,n)),i=n?[]:e.map(e=>Pc(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&&Fc(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)}},Lc=(e,t,n)=>{let r=e=>uc(e,t,n);switch(e.kind){case`And`:return wc(e.operands,t,n);case`Or`:return Ic(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=wl(W(a.set,nc(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,ul(r,e,u[t]),o,s,c,l)}}let o=n?void 0:Cc(e,t);if(o){let r=wc(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=nc(n,i,a),d=e.bounds.map(e=>wl(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=ul(t,o.names[e],r);if(e===d.length-1){let e=nc(n,i,a);if(!o.guards.every(t=>cc(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{jl(e.bounds,nc(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Cd(e,t)!==void 0&&!xc(e.body,t,/* @__PURE__ */ new Set)?bc(e,yc):void 0;return(t,n,r,o,s,c)=>{let l=[];jl(e.bounds,nc(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ll(n,e)?.kind===`Value`)){u.every(n=>cc(t,e.body,nc(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Vc(r)?u.slice(n).every(n=>cc(t,e.body,nc(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,nc(r,i,a));if(typeof l!=`boolean`)throw ac(r,sc(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=nc(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw ac(r,`In computing ${ic(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Vi(t)}) was used as a guard condition of a CASE.\n${el(e.source)}`)})?.body??n;if(!u)throw ac(r,`In computing ${ic(r)}, TLC encountered a CASE with no conditions true.\n${$c(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Tu(e.definitions,t);return(t,r,a,o,s,c)=>n(t,mu(e.definitions,nc(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new y(`UNCHANGED appears in an initial predicate at ${Zc(e)}`)}:jc(e.expression,t);case`AngleAction`:{let n=r(e.action),i=Oc(e.subscript),a=(e,n,r)=>{try{return cc(e,i,nc(e,n,r))}catch(n){throw e.isEnabled?_d(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,Oc(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Nc(e,t,n);case`FunctionApplication`:return Ac(e,t,n);case`Apply`:{let i=e.args;if(lc(e.operator)){let r=pc(i[0],t,n);if(r!==void 0)return e.operator===`=`?wc([e],t,n):Ec(e,()=>r);if(hc(i[0],n))return kc(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=W(i[0],nc(t,n,r));(typeof c==`boolean`?c:hl(c,`the left side of => at ${Zc(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Mc(e,t,n)}default:return Tc(e)}},Rc=/* @__PURE__ */ new WeakMap,zc=e=>{let t=Rc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Rc.set(e,n),n},Bc=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Vc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Hc=(e,t)=>{let n=t.state;if(!n||!Vc(n))throw new y(`ENABLED needs a complete state at ${Zc(e)}`);let r=t.environment;if(r.callStack)return Zs(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return uc(e,r,!1)(i,t.scope,zc(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Uc=(t,r,i,a)=>{let o={environment:r,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};uc(t,r,!0)(o,a,zc(r),void 0,!1,t=>{if(!o.isStopped){if(!Vc(t))throw n(new ne([...t]),e.error);o.isStopped=i(t)}})},Wc=(e,t,n)=>{let r=[];return Uc(e,t,e=>(r.push(e),!1),n),r},Gc=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return uc(e,n,!1)(a,i,zc(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Vc(e)){let r=Bc(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},Kc=(e,t,n,r)=>{let i=[];return Gc(e,t,n,e=>(i.push(e),!1),r),i},qc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Jc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Yc=e=>Jc.has(e.kind)||e.kind===`Apply`&&qc.has(e.operator),Xc=(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}},Zc=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}`,$c=e=>{let t=e.location.range;return t?Qc(t):Zc(e)},el=e=>e.kind===`Number`?e.text??String(e.value):$c(e),tl=(e,t)=>new y(`A non-boolean expression (${Vi(t)}) was used as the condition of an IF.\n${$c(e)}`),nl=(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 (${Vi(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${el(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${Vi(n)}.\n${$c({...e,location:{...e.location,range:{...r,end:i}}})}`)},rl=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${z(n)}\n${$c(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${$c(e)}`);let a=Kt(i);if(a===`tuple`)throw Nr(t);return Fr(i,t,a===`record`?n:r)}},il=e=>e===`1.7.4`?(t,n)=>Ar(t,n,e):void 0,al=e=>t=>{if(!P(t))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${Vi(t)})\n${$c(e)}`);return Lr(t)},ol=(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${$c(e)}`);return t.evaluate([n,r])},sl=t=>n(new y(`TLC can't handle real numbers: ${t.text} at ${Zc(t)}`),e.configParseError),cl=t=>n(new y(`TLC can't handle a number this big: ${t.text??t.value} at ${Zc(t)}`),e.error),ll=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},ul=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),dl=(e,t,n)=>{if(t.kind===`Name`)return ul(e,t.name,n);let r=Sr(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)=>ul(e,t,r[n]),e)},fl=(e,t)=>{if(P(e))return e;throw new y(`A non-function (${Vi(e)}) was applied as a function.\n${$c(t)}`)},pl=e=>e.isKeepLazy?e:{...e,isKeepLazy:!0},ml=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),hl=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Expected ${t} to be a boolean but found ${z(e)}`);return e},gl=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),_l=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),vl=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),yl=(e,t)=>{if(_l.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&vl.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=gl(n,t);if(e&&!t.constants.has(n)&&!bl(e,t))return!0}return _i(e).some(e=>yl(e,t))},bl=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!yl(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>yl(e.set,t)));return t.constantLevels.set(e,r),r},xl=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},Sl=(e,t,n)=>{if(!N(e)||Pt(e)){let r=z(e),i=n===`1.7.4`?void 0:xl(e,r);throw new y(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${el(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${el(t)}\n${i}`)}},Cl=(e,t,n)=>(Sl(e,t,n),typeof e==`object`&&e.kind===`Interval`?Jn(e):sr(e)??L(e).elements),wl=(e,t,n)=>n===`1.7.4`?(Sl(e,t,n),sr(e)??fr(e)):Cl(e,t,n),Tl=e=>{if(typeof e==`object`&&e.kind===`Interval`)return vr(e),e},El=(e,t,n)=>Tl(e)??wl(e,t,n),Dl=(e,t,n)=>Tl(e)??Cl(e,t,n),Ol=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},kl=(e,t)=>e.map(e=>El(W(e.set,t),e.set,t.environment.runtime.version)),Al=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Ol(t[n],t=>i(n-1,dl(a,e[n].pattern,t)));return i(e.length-1,n)},jl=(e,t,n)=>Al(e,kl(e,t),t.scope,n),Ml=(e,t)=>{let n=e.map(e=>W(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Nl=(e,t,n)=>{if(e.length===1)return dl(t,e[0].pattern,n);let r=Sr(n)??[];return e.reduce((e,t,n)=>dl(e,t.pattern,r[n]),t)},Pl=/* @__PURE__ */ new WeakMap,Fl=e=>(Pl.set(e.value,e),e.value),Il=e=>typeof e==`object`&&e.kind===`LazyFunction`?Pl.get(e):void 0,Ll=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:Qn(i),o=(e,n,i)=>`In applying the function\n${dt(z(r))},\nthe ${e} is:\n${dt(z(n))}${i}.\n${$c(t.function)}`,s=e.bounds;if(s.length===1){if(!Er(a,r.domain))throw new y(o(`first argument`,a,`which is not in its domain`));return Nl(s,e.scope,a)}let c=Sr(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${$c(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!Er(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`&&Sr(n)?.length!==e.pattern.names.length)throw new y(o(r,n,`which does not match its formal parameter`))}),Nl(s,e.scope,Qn(c.slice(0,s.length)))},Rl=/* @__PURE__ */ new WeakMap,zl=(e,t)=>{let n=Rl.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:Qc(r)};return Rl.set(t,i),i},Bl=(e,t,n)=>{let r=zl(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},Vl=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Xr(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(rn(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},Hl=/* @__PURE__ */ new WeakMap,Ul=e=>{let t=Hl.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return Hl.set(e,n),n},Wl=(e,t)=>{let n=Ml(e.bounds,t),r=Vl(n,(n,r)=>W(e.body,ml(t,Nl(e.bounds,ul(void 0,e.name,r),n))),Bl(e.bounds,e.body,n));return Fl({value:r,bounds:e.bounds,body:e.body,scope:ul(void 0,e.name,r)}),e.bounds.length===1?qt(r):r},Gl=(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=kr(t);return Ut(e.domain,e.range)}catch(e){if(e instanceof y)return t;throw e}},Kl=(e,t)=>e.kind===`Function`?e.isSelfReferential?Wl(e,t):W(Ul(e),t):W(e.body,t),ql=(e,t)=>{let n=bl(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=ml(t,void 0);if(!n)return Kl(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>Gl(e,Kl(e,i)));return t.environment.definitionValues.set(e,a),a},Jl=(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))&&bl(e,t))try{Nn(ql(e,{environment:t,scope:void 0,state:void 0,next:void 0}))}catch(e){if(!(e instanceof y)&&!c(e))throw e}}),Yl=(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,ml(t,e.scope));return n&&(e.cache=r),r},Xl=/* @__PURE__ */ new WeakMap,Zl=e=>{let t=Xl.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Xl.set(e,n),n},Ql=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Ql(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Zl(r):t.builtins.get(e)},$l=/* @__PURE__ */ new WeakMap,eu=(e,t)=>{if(B(e))return tu(e.operator,t);let n=$l.get(e),r=n===void 0?Ql(e.operator,t.environment)??null:n;return n===void 0&&$l.set(e,r),r??tu(e.operator,t)},tu=(e,t)=>{let n=ll(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Ql(e,t.environment)},nu=e=>e.kind===`Closure`?e.params.length:e.arity,ru=(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:tu(n,t);if(!r)throw new y(`Expected an operator argument at ${Zc(e)}`);return r},iu=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>ul(e,n.name,t[r]),e.scope);return W(e.body,ml(n,r))},au=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:nu(e),call:n=>iu(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},ou=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=tu(e.name,t);return n!==void 0&&nu(n)>0},su=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),cu=(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 cu(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([])}},lu=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&gu(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=B(e)?void 0:cu(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ll(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:su(e,t)}}return t=>su(e,t)},uu=/* @__PURE__ */ new WeakMap,du=(e,t)=>{let n=uu.get(e);if(n)return n;let r=lu(e,t);return uu.set(e,r),r},fu=(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:ru(t[i],n)}:du(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},pu=(e,t,n)=>e.kind===`Closure`?W(e.body,ml(n,fu(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Zu(t,n),n):e.evaluate(t.map(e=>ou(e,n)?au(ru(e,n),n):W(e,n)),n),mu=(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),hu=(e,t,n)=>{let r=ll(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Yl(r,n);if(r?.kind===`Operator`){if(nu(r.operator)===0)return iu(r.operator,[],n);throw new y(`Operator ${e} is used without arguments`)}let i=cu(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw gd(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 ${Zc(t)}`)},gu=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,_u=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),vu=(e,t)=>_u.has(e)||t.builtins.get(e)?.isStateLevel===!0,yu={builtins:_u,definitions:/* @__PURE__ */ new WeakMap},bu={builtins:new Set([..._u].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},xu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&bl(e,t),Su=(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=gl(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!xu(e,t)&&Cu(e,t,n))return!0}return _i(e).some(e=>Su(e,t,n))},Cu=(e,t,n=yu)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Su(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Su(e.set,t,n));return n.definitions.set(e,i),i},wu={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},Tu=(e,t)=>new Set(e.filter(e=>Cu(e,t)||Cu(e,t,wu))),Eu=e=>[...e.definitions.values()].some(t=>Cu(t,e)),Du=e=>[...e.definitions.values()].some(t=>Cu(t,e,bu)),Ou=/* @__PURE__ */ new WeakMap,ku=(e,t)=>{let n=Ou.get(e);if(n!==void 0)return n;let r=Nu(e,t,ju);return Ou.set(e,r),r},Au=/* @__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`]),ju=/* @__PURE__ */ new Set,Mu=(e,t,n)=>n.size===0?ku(e,t):Nu(e,t,n),Nu=(e,t,n)=>{if(!Au.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=cu(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&xu(n.definition,t)}if(e.kind===`Apply`){if(vu(e.operator,t)||wu.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=Ql(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=gl(e.operator,t);if(!n||!bl(n,t)||Cu(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`&&Mu(e,t,n))}let r={value:!0};return $o(e,(e,i)=>(r.value&&=Mu(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Pu=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Fu=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}},Iu=(e,t)=>{if(e.kind===`Identifier`&&B(e))return!t.has(e.name);if(B(e))return!0;let n={value:!1};return $o(e,(e,r)=>(n.value||=Iu(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Lu=(e,t)=>Go.has(e)&&Pu(e)&&Cd(e,t)!==void 0&&!Iu(e,ju),Ru=/* @__PURE__ */ new WeakMap,zu=(e,t,n,r)=>i=>{r.expressions.push(e);let a=wr.sets,o=wr.callStack,s=a??[],c=s.length;wr.sets=s,wr.callStack=r;try{let a=t(i),o=typeof a==`object`&&a.kind===`FilteredSet`?Ru.get(a):void 0,s=o?o(n):a;return r.values.set(e,s),typeof s==`object`&&s.kind!==`FilteredSet`&&Yc(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=Xc(e,r.values),a=i&&!_i(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!P(a)?void 0:a;throw Bu(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,wr.sets=a,wr.callStack=o}},Bu=(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},Vu=(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}},Hu=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Uu=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=bd(e,t),i=t.callStack,a=i?zu(e,r,t,i):Pu(e)&&ku(e,t)?Fu(r):Lu(e,t)?Ju(r):r;return t.evaluators.set(e,a),a},Wu=/* @__PURE__ */ new WeakMap,Gu=(e,t)=>{if(t.callStack)return Uu(e,t);let n=Wu.get(e);if(n)return n;let r=(Pu(e)&&ku(e,t)?void 0:ca(e,t))??Uu(e,t);return Wu.set(e,r),r},W=(e,t)=>Gu(e,t.environment)(t),Ku=(e,t)=>{let n=e.name,r=B(e)?void 0:cu(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw gd(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&bl(e,t))return t=>ql(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Gu(e.body,t),n.body(ml(r,void 0)));return qu(e,t)?Ju(r):r}return t=>ql(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>ql(e,t);return bl(e,t)||!qu(e,t)?n:Ju(n)}return t=>hu(n,e,t)},qu=(e,t)=>Cd(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Cd(e.set,t)!==void 0)),Ju=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},Yu=(e,t)=>{let n=Ql(e,t);return n!==void 0&&nu(n)>0},Xu=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!B(e)&&Yu(e.name,t)),Zu=(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(Zu(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Xu(t[0],n)){let e=Uu(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Xu(t[0],n)&&Xu(t[1],n);if(i&&a){let e=Uu(t[0],n),r=Uu(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>ou(e,n)?au(ru(e,n),n):W(e,n)),n)},$u=(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:du(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:ru(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},ed=/* @__PURE__ */ new WeakMap,td=e=>{let t=ed.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return ed.set(e,n),n},nd=(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},rd=(e,t)=>e.every((e,n)=>rn(e,t[n])),id=(e,t)=>{let n=gl(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&bl(n,t)&&!Cu(n,t)},ad=(e,t,n,r)=>{let i=$u(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Gu(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r)return e=>o(i(e),e);let s=td(e);return e=>{let n=i(e),r=nd(n,t.length);if(!r||e.isKeepLazy)return o(n,e);let a=r.length;for(let e of r)a=Vr(a,Xr(e));let c=s.calls.get(a),l=c?.find(e=>rd(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}},od=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Uu(n[0],t),r=Uu(n[1],t);return t=>!hl(e(t),`the left side of =>`)||hl(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&&id(e,t);return ad(r,n,t,i)}if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Uu(n[0],t),i=al(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Uu(n[0],t);return Ko.has(e)||yl(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=Uu(n[0],t),a=Uu(n[1],t),o=ol(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=tu(e.operator,r);if(i)return pu(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 ${Zc(e)}`)}},sd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Uu(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Uu(a.set,t);return s=>Ol(El(o(s),a.set,t.runtime.version),t=>hl(i(ml(s,ul(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>Uu(e.set,t));return s=>{let c=a.map((e,n)=>El(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?hl(i(ml(s,a)),r)!==n:Ol(c[t],n=>l(t-1,ul(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>jl(o,e,t=>hl(i(ml(e,t)),r)!==n)?!n:n},cd=(e,t)=>{if(e.kind===`Tuple`)return Qn(e.names.map(e=>{let n=ll(t,e);return n?.kind===`Value`&&n.value}));let n=ll(t,e.name);return n?.kind===`Value`?n.value:void 0},ld=/* @__PURE__ */ new WeakSet,ud=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&ld.add(e)},dd=(e,t)=>{let n=ld.has(e),r=Uu(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Uu(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=Xn(e),o=Ut(i,i.map(e=>r(ml(t,ul(t.scope,n,e)))));return ft(e)?o:qt(o)}let n=[],s=i.map(e=>Dl(W(e.set,t),e.set,t.environment.runtime.version));return Al(i,s,t.scope,e=>{let o=i.length===1?cd(a.pattern,e)??!1:Qn(i.map(t=>cd(t.pattern,e)??!1));return n.push([o,r(ml(t,e))]),!1}),Hn(n)},l=(t,n)=>{let a=Fl({value:Vl(t,e=>r(ml(n,Nl(i,n.scope,e))),Bl(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):Ml(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 Vu(u,e,t),t}}},fd=(e,t)=>{let n=ld.has(e);n&&ud(e.function);let r=Uu(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=>Uu(e,t))}),value:Uu(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Qn(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(ml(i,ul(i.scope,`@`,e))):Rr(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(la.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${$c(e.function)}`)}return n}},pd=(e,t)=>{if(e.kind===`SetFilter`){let n=Uu(e.predicate,t),r=Uu(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=>hl(e(ml(t,dl(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 Ru.set(i,r=>c(t,{...n,environment:r},Uu(e.predicate,r))),i};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=Uu(e.expression,t);return t=>{let r=[];return jl(e.bounds,t,e=>(r.push(n(ml(t,e))),!1)),Ln(r)}}let n=e.set;if(!n)return()=>{throw new y(`TLC cannot evaluate an unbounded CHOOSE at ${Zc(e)}`)};let r=Uu(e.body,t),i=Uu(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${$c(e)}`);let o={value:void 0},s=Dl(a,n,t.environment.runtime.version);if(Ol(s,n=>{let i=dl(t.scope,e.pattern,n);return hl(r(ml(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${$c(e)}`);return o.value}},md=e=>[...e].sort((e,t)=>zt(e.name,t.name)),hd=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),gd=(e,t)=>new te(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${$c(t)}`,e),_d=(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,vd=e=>new y(`A primed expression appears outside an action at ${Zc(e)}`),yd=(e,t)=>{let n=md(e),r=hd(n),i=n.map(e=>Uu(e.value,t));if(r)return e=>$n(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=>en(a,i.map(t=>t(e)))},bd=(e,t)=>{let n=e=>Uu(e,t);switch(e.kind){case`Number`:{let t=e.value;return gu(t)?()=>t:()=>{throw cl(e)}}case`Decimal`:return()=>{throw sl(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Ku(e,t);case`Apply`:return od(e,t);case`Bracket`:return()=>{throw new y(`A bracket without a function or subscript is not an expression at ${Zc(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new y(`An operator cannot be used as a value at ${Zc(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 nl(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 nl(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw vd(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=>tn(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 tl(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 (${Vi(t)}) was used as a condition of a CASE. ${el(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${$c(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(ml(n,mu(e.definitions,n)))}case`Forall`:case`Exists`:return sd(e,t);case`UnboundedQuantifier`:return()=>{throw new y(`TLC cannot evaluate an unbounded quantifier at ${Zc(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return pd(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Ln(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Qn(t.map(t=>t(e)))}case`FunctionConstruction`:return dd(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 yd(e.fields,t);case`RecordSet`:{let t=md(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 fd(e,t);case`ExceptAt`:return t=>{let n=ll(t.scope,`@`);if(n?.kind!==`Value`)throw new y(`@ appears outside an EXCEPT at ${Zc(e)}`);return n.value};case`FunctionApplication`:{ud(e.function);let r=n(e.function),i=t=>fl(r(pl(t)),e),a=e.args.map(n),o=il(t.runtime.version);if(a.length===1){let e=a[0];return t=>Fr(i(t),e(t),o)}return e=>Fr(i(e),Qn(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=rl(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?hl(t(e),`an action`)||r(e):hl(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Hc(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new y(`The subexpression reference at ${Zc(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 ${Zc(e)}`)}}},xd=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Sd=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Cd=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(xd.has(e.kind))return!1;let a=Sd(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&&vu(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 _i(e).every(i)};return i(e)?[...n]:void 0},wd=`-------------------------------- MODULE Reals -------------------------------
|
|
34
81
|
(***************************************************************************)
|
|
35
82
|
(* This module provides dummy definitions of the operators that are *)
|
|
36
83
|
(* defined by the real Reals module. It is expected that any tool that *)
|
|
@@ -47,7 +94,7 @@ EXTENDS Integers
|
|
|
47
94
|
Real == "Reals"
|
|
48
95
|
a / b == CHOOSE m \\in Real : m * b = a
|
|
49
96
|
Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
|
|
50
|
-
|
|
97
|
+
=============================================================================`,Td=`----------------------------- MODULE RealTime -------------------------------
|
|
51
98
|
(***************************************************************************)
|
|
52
99
|
(* This standard module is described in Chapter 9 of the book "Specifying *)
|
|
53
100
|
(* Systems". The type of specification described there cannot be handled *)
|
|
@@ -73,7 +120,7 @@ RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
|
|
|
73
120
|
IN /\\ now \\in Real
|
|
74
121
|
/\\ [][NowNext]_now
|
|
75
122
|
/\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
|
|
76
|
-
|
|
123
|
+
=============================================================================`,Ed=`----------------------------- MODULE Toolbox --------------------------------
|
|
77
124
|
(***************************************************************************)
|
|
78
125
|
(* *)
|
|
79
126
|
(***************************************************************************)
|
|
@@ -99,17 +146,7 @@ _TEPosition ==
|
|
|
99
146
|
THEN _TETraceLength
|
|
100
147
|
ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
|
|
101
148
|
|
|
102
|
-
|
|
103
|
-
`)},kl=(e,t)=>{let n=fe(e),r={index:0,offsideColumns:[]},i=[],a=/* @__PURE__ */ new Set,o=[],s={index:-1},c=[],l=e=>i[i.length-1].has(e),u=e=>({line:e.line,column:t&&e.kind===`String`?e.endColumn:e.column,range:void 0}),d=[],f=[],h=[],g=(e,t=r.index-1)=>{let i=e===t?h[e]:void 0;if(i)return i;let a=n[t];d[e]??=u(n[e]),f[t]??={line:a.line,column:a.endColumn};let o={module:c[0].name,start:d[e],end:f[t]};return e===t&&(h[e]=o),o},v=(e,t)=>(e.location.range=g(t),e),y=(e=0)=>n[Math.min(r.index+e,n.length-1)],b=(e=0)=>{let t=y(e),n=r.offsideColumns[r.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},x=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),S={index:0},C=e=>{let t=n.slice(S.index,r.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},w=e=>t&&(e.kind===`Keyword`||El.has(e.text)),T=e=>{let t=n.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},ee=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:yl.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):w(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,te=(e,t=y(),r)=>{let i=n[n.length-1],a=t.line===i.line&&t.column===i.column;return new p(`${e} at line ${t.line}, column ${t.column}`,void 0,ne(e,t,a,r))},ne=(e,r,i,a)=>{if(t&&i){let e=n[n.length-1];return{reason:`Unexpected EOF`,...C(T(e)),isEnd:i}}return t&&a?{reason:`Unexpected ${ee(a)}`,...T(a),isEnd:i}:{reason:e,line:r.line,column:r.column,isEnd:i}},E=(e,t=y())=>te(e,t,t),re=e=>(e.kind===`Identifier`||e.kind===`Keyword`)&&!w(e),D=(e,t=0)=>{let n=b(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},O=()=>{let e=b();if(e.kind===`End`)throw te(`Unexpected end of expression`);return r.index++,e},k=e=>D(e)?(r.index++,!0):!1,A=e=>{if(!D(e))throw E(`Expected ${JSON.stringify(e)} but found ${x(b())}`);return O()},ie=()=>{let e=b();if(e.kind!==`Identifier`)throw E(`Expected an identifier but found ${x(e)}`);if(w(e))throw E(`Unexpected keyword ${e.text}`);return r.index++,e.text},ae=()=>{let e=r.index;return{name:ie(),range:g(e)}},oe=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),se=e=>{r.offsideColumns.push(-1);let t=e();return r.offsideColumns.pop(),t},ce=(e,t=`,`)=>{let n=[e()];for(;k(t);)n.push(e());return n},le=()=>{if(D(`<<`)){let e={value:1};for(;b(e.value).kind===`Identifier`||D(`,`,e.value);)e.value++;return D(`>>`,e.value)&&D(`\\in`,e.value+1)}let e={value:0};for(;b(e.value).kind===`Identifier`;){if(D(`\\in`,e.value+1))return!0;if(!D(`,`,e.value+1))return!1;e.value+=2}return!1},ue=()=>{if(D(`::`))return!0;if(!D(`(`))return!1;let e={value:1};for(;b(e.value).kind===`Identifier`&&D(`,`,e.value+1);)e.value+=2;return b(e.value).kind===`Identifier`&&D(`)`,e.value+1)&&D(`::`,e.value+2)},de=()=>{if(!k(`<<`)){let e=ae();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=oe(ce(ae));return A(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},pe=()=>ce(()=>{let e=ce(de);A(`\\in`);let t=N();return e.map(e=>({pattern:e,set:t}))}).flat(),M=()=>{let e=b();if(e.kind===`Identifier`){let t=r.index,n=[O().text];for(;D(`!`)&&b(1).kind===`Identifier`;)O(),n.push(ie());return v({kind:`Identifier`,name:n.join(`!`),location:u(e)},t)}if(D(`<<`)||D(`(`))return Oe();throw E(`Expected a subscript but found ${x(e)}`)},me=e=>{let t=b(1),n=b(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&D(`==`,sl.has(n.text)?3:4))},he=e=>{if(!ll.has(e.text))return!0;let t=b(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||D(`,`,1)||D(`)`,1)||t.kind===`Keyword`&&hl.has(t.text)||me(e)},ge=()=>{let e=b(),n=e.kind===`Operator`&&(ol.has(e.text)||cl.has(e.text))&&he(e);if(t&&e.kind!==`String`&&(cl.has(e.text)||dl.has(e.text)&&e.text!==`'`&&!sl.has(e.text)||ul.has(e.text)&&b(-1).text===`(`&&b(-1).line===e.line&&b(-1).endColumn+1===e.column&&b(1).text===`)`&&b(1).line===e.line&&b(1).column===e.endColumn+1)&&he(e))throw te(`incomplete expression`,e);if(n)return r.index++,v({kind:`OperatorReference`,operator:e.text,location:u(e)},r.index-1);if(e.kind!==`String`&&dl.has(e.text)&&he(e)){r.index++;let t=u(e);if(sl.has(e.text))return{kind:`OperatorReference`,operator:e.text,location:t};let n={kind:`Identifier`,name:`argument`,location:t};return{kind:`Lambda`,params:[n.name],body:pl(e.text,n,t),location:t}}if(D(`LAMBDA`)){let t=r.index;O();let n=oe(ce(ae));A(`:`);let i=N();return v({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:i,location:u(e)},t)}let i=N();return i.kind===`Identifier`&&_e.delete(i),i},_e=/* @__PURE__ */ new Map,ve={range:void 0},ye=()=>se(()=>{let e=r.index;A(`(`);let t=ce(ge);return A(`)`),ve.range=g(e),t}),be=()=>{let e=O();r.offsideColumns.push(e.column);let t=[N()];for(;y().text===e.text&&y().column===e.column;)r.index++,t.push(N());return r.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:u(e)}},xe=e=>se(()=>{let t=u(e);if(b().kind===`Identifier`&&(D(`|->`,1)||D(`:`,1))){let e=D(`|->`,1)?`Record`:`RecordSet`,n=ce(()=>{let t=r.index,n=u(b()),i=ie();return n.range=g(t),A(e===`Record`?`|->`:`:`),{name:i,value:N(),location:n}});return A(`]`),{kind:e,fields:n,location:t}}if(le()){let e=pe();A(`|->`);let n=N();return A(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let n=N();if(k(`->`)){let e=N();return A(`]`),{kind:`FunctionSet`,domain:n,range:e,location:t}}if(k(`EXCEPT`)){let e=ce(()=>{A(`!`);let e=[];for(;D(`.`)||D(`[`);)if(k(`.`)){if(!re(b()))throw E(`Expected a field name but found ${x(b())}`);e.push({kind:`Field`,name:O().text})}else A(`[`),e.push({kind:`Index`,args:ce(()=>N())}),A(`]`);return A(`=`),{path:e,value:N()}});return A(`]`),{kind:`Except`,function:n,updates:e,location:t}}return A(`]_`),{kind:`BoxAction`,action:n,subscript:M(),location:t}}),Se=e=>se(()=>{let t=u(e);if(k(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(le()&&(b(1).text===`\\in`||D(`<<`))){let e=r.index,n=de();A(`\\in`);let i=N();if(k(`:`)){let e=N();return A(`}`),{kind:`SetFilter`,bound:{pattern:n,set:i},predicate:e,location:t}}r.index=e}let n=N();if(k(`:`)){let e=pe();return A(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let i=[n];for(;k(`,`);)i.push(N());return A(`}`),{kind:`SetEnumeration`,elements:i,location:t}}),Ce=e=>{let t=u(e),n=se(()=>D(`>>`)||D(`>>_`)?[]:ce(()=>N()));if(k(`>>_`)){if(n.length!==1)throw te(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:M(),location:t}}return A(`>>`),{kind:`Tuple`,elements:n,location:t}},we=e=>{let t=u(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&le()){let e=pe();return A(`:`),{kind:n,bounds:e,body:N(),location:t}}let i=oe(ce(ae));return A(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:N(),isTemporal:r,location:t}},Te=e=>{let t=[];do{if(k(`OTHER`))return A(`->`),{kind:`Case`,arms:t,other:N(),location:u(e)};let n=N();A(`->`),t.push({condition:n,body:N()})}while(k(`[]`));return{kind:`Case`,arms:t,other:void 0,location:u(e)}},Ee=()=>{let e=b(1);return D(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||ml.has(e.text)||e.kind===`Operator`&&(ol.has(e.text)||sl.has(e.text)||cl.has(e.text)))},De=()=>{let e=O();if(e.kind===`Number`)return{kind:`Operand`,operand:j(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return r.index--,{kind:`Bound`,args:ye()}}return{kind:`Name`,name:e.text,args:D(`(`)?ye():[]}},Oe=()=>{let e=r.index,n=e===s.index,a=O(),o=u(a);if(t&&a.kind===`Keyword`&&a.text===`LAMBDA`){let e=ce(ie);return A(`:`),{kind:`Lambda`,params:e,body:N(),location:o}}if(a.kind===`Number`){if(t&&/^\\[BOH]/.test(a.text))throw te(`incomplete expression`,a);return{kind:`Number`,value:j(a.text),text:a.text,location:o}}if(a.kind===`Decimal`)return{kind:`Decimal`,text:a.text,location:o};if(a.kind===`String`)return{kind:`String`,value:a.text,location:o};let l=a.kind===`Step`&&V(a);if(l&&z()<0&&R.length<=1)throw te(`Step number used outside proof`,a);if(l&&a.text[1]===`+`)throw te(`<+> step number used in an expression`,a);if(a.kind===`Identifier`||l){let i=l?H(a)??a.text:a.text;if(ue()){let e=oe(k(`(`)?ce(ae):[]);return e.names.length>0&&A(`)`),A(`::`),{kind:`Label`,name:i,params:e.names,paramRanges:e.ranges,body:N(),location:o}}let s=D(`(`),u=s?ye():[],d=[s?ve.range:void 0];if(!Ee())return s?{kind:`Apply`,operator:i,args:u,argumentsRange:ve.range,location:o}:{kind:`Identifier`,name:i,location:o};let f=c.flatMap(e=>e.instances).find(e=>e.name===i),p=f!==void 0&&!n&&!t&&f.params.length!==u.length;if(p&&u.length>0)throw te(`The operator ${i} requires ${f.params.length} arguments`,a);let m=[{kind:`Name`,name:i,args:u}],h=[g(e,e)];for(;Ee();)O(),h.push(g(r.index,r.index)),ve.range=void 0,m.push(De()),d.push(ve.range);let v=m.flatMap(e=>e.kind===`Name`?[e.name]:[]),y=v.join(`!`),b=m.flatMap(e=>`args`in e?e.args:[]),x=m.map(e=>`args`in e?e.args.length:0),S=d.findLast(e=>e!==void 0),C=v.length<m.length?{kind:`Subexpression`,selectors:m,selectorRanges:h,argumentRanges:d,location:o}:b.length===0?{kind:`Identifier`,name:y,selectorRanges:h,location:o}:x.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:y,args:b,argumentCounts:x,argumentsRange:S,selectorRanges:h,argumentRanges:d,location:o}:{kind:`Apply`,operator:y,args:b,argumentsRange:S,selectorRanges:h,argumentRanges:d,location:o};return p&&_e.set(C,{location:_(g(e)),message:`The operator ${i} requires ${f.params.length} arguments.`}),C}if(a.kind===`Operator`&&fl(a.text)&&D(`(`))return{kind:`Apply`,operator:a.text,args:ye(),location:o};switch(a.text){case`(`:{let e=se(()=>N());return A(`)`),e}case`[`:return xe(a);case`{`:return Se(a);case`<<`:return Ce(a);case`@`:return{kind:`ExceptAt`,location:o};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return we(a);case`IF`:{let e=N();A(`THEN`);let t=N();return A(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:N(),location:o}}case`CASE`:return Te(a);case`LET`:{let e=[],n=[];for(i.push(/* @__PURE__ */ new Set);!k(`IN`);){if(t&&D(`RECURSIVE`))throw te(`Unexpected keyword RECURSIVE`,C(y()));if(k(`RECURSIVE`)){Le();continue}let r=Me(!1);r.kind===`Instance`?n.push(r):e.push(r)}i.pop();let r=N();return n.length===0?{kind:`Let`,definitions:e,body:r,location:o}:{kind:`Let`,definitions:e,instances:n,body:r,location:o}}case`CHOOSE`:{let e=de(),t=k(`\\in`)?N():void 0;return A(`:`),{kind:`Choose`,pattern:e,set:t,body:N(),location:o}}case`WF_`:case`SF_`:{let e=M(),t=se(()=>{A(`(`);let e=N();return A(`)`),e});return{kind:a.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:o}}}throw E(`Unexpected ${x(a)}`,a)},ke=()=>{let e=b(),t=u(e);if(e.kind===`Operator`&&(e.text===`/\\`||e.text===`\\/`))return be();if(e.kind===`Operator`||e.kind===`Keyword`)switch(e.text){case`~`:return O(),{kind:`Apply`,operator:`~`,args:[N(5)],location:t};case`-`:return O(),{kind:`Apply`,operator:`-.`,args:[N(13)],location:t};case`[]`:return O(),{kind:`Always`,expression:N(16),location:t};case`<>`:return O(),{kind:`Eventually`,expression:N(16),location:t};case`ENABLED`:return O(),{kind:`Enabled`,expression:N(16),location:t};case`UNCHANGED`:return O(),{kind:`Unchanged`,expression:N(16),location:t};case`SUBSET`:case`UNION`:case`DOMAIN`:return O(),{kind:`Apply`,operator:e.text,args:[N(9)],location:t}}return Oe()},N=(e=0)=>{let t=r.index,n=ke(),i={left:n.location.range?n:v(n,t),previous:void 0};for(;;){let n=b();if(n.kind!==`Operator`)break;let r=u(n);if(n.text===`'`&&e<=15){O(),i.left=v({kind:`Prime`,expression:i.left,location:r},t);continue}if(sl.has(n.text)&&e<=15){O(),i.left=v({kind:`Apply`,operator:n.text,args:[i.left],location:r},t);continue}if(n.text===`[`){O();let e=se(()=>ce(()=>N()));se(()=>A(`]`)),i.left=v({kind:`FunctionApplication`,function:i.left,args:e,location:r},t);continue}if(n.text===`.`&&re(b(1))){O();let e=O().text;i.left=v({kind:`FieldAccess`,record:i.left,field:e,location:r},t);continue}let a=ol.get(n.text);if(!a||a.low<e)break;let o=i.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw te(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(O(),a.low>12&&D(`-`))throw te(`Precedence conflict between ${n.text} and -`,b());let s=N(a.high+1),c=i.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`;i.left=c.kind===e&&o?.text===n.text?{...c,operands:[...c.operands,s]}:{kind:e,operands:[c,s],location:r}}else i.left=n.text===`\\X`?c.kind===`Product`&&o?.text===`\\X`?{...c,factors:[...c.factors,s]}:{kind:`Product`,factors:[c,s],location:r}:{kind:`Apply`,operator:n.text,args:[c,s],location:r};i.left=v(i.left,t),i.previous={...a,text:n.text}}return i.left},Ae=()=>{if(!k(`(`))return[];let e=Ie();return A(`)`),e},je=()=>{let e=u(b()),t=N(),i=n[r.index-1],a={line:i.line,column:i.endColumn};return{body:t,bodyRange:{module:c[0].name,start:e,end:a}}},Me=e=>{let t=r.index;return v(P(e),t)},Ne=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),P=e=>{let t=b(),n=u(t),i=(t,r)=>({kind:`Operator`,name:t,params:r,...je(),isLocal:e,isRecursive:l(t),location:n});if(t.kind===`Identifier`&&b(1).kind===`Operator`&&ol.has(b(1).text)&&b(2).kind===`Identifier`&&D(`==`,3)){let e=ae(),t=O().text,n=ae();return A(`==`),i(t,[Ne(e),Ne(n)])}let a=t.kind===`Operator`&&t.text===`-.`,o=t.kind===`Identifier`&&sl.has(b(1).text)&&D(`==`,2);if(a||o){let e=a?t.text:b(1).text;a&&O();let n=ae();return o&&O(),A(`==`),i(e,[Ne(n)])}let s=ie();if(k(`[`)){let t=se(()=>pe());return A(`]`),A(`==`),{kind:`Function`,name:s,bounds:t,body:N(),isLocal:e,isRecursive:l(s),location:n}}let c=r.index,d=Ae();return A(`==`),D(`INSTANCE`)?{...Pe(s,d,e,n),definitionRange:g(c)}:i(s,d)},Pe=(e,t,n,i)=>{let a=r.index;return A(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ie(),substitutions:k(`WITH`)?ce(()=>{let e=r.index,t=O().text,n=g(e);return A(`<-`),{name:t,nameRange:n,expression:ge()}}):[],isLocal:n,location:i,instanceRange:g(a)}},Fe=()=>{let e=r.index;return v(F(),e)},F=()=>{let e=u(b());if(D(`_`)&&b(1).kind===`Operator`)return O(),{name:O().text,arity:k(`_`)?2:1,location:e};if(b().kind===`Operator`&&D(`_`,1)){let t=O().text;return O(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=ie();if(!k(`(`))return{name:t,arity:0,location:e};let n=ce(()=>A(`_`));return A(`)`),{name:t,arity:n.length,location:e}},Ie=()=>ce(Fe),Le=()=>{let e=Ie();return e.forEach(e=>i[i.length-1].add(e.name)),e},I=e=>{let t={value:0,offset:e};do{let e=b(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&wl.has(e.text)&&t.value++,e.kind===`Operator`&&Tl.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},L=()=>{let e=b(),t=b(1);return e.kind===`Identifier`?D(`(`,1)||D(`[`,1)?D(`==`,I(1)):t.kind===`Operator`&&sl.has(t.text)?D(`==`,2):t.kind===`Operator`&&ol.has(t.text)?b(2).kind===`Identifier`&&D(`==`,3):D(`==`,1):D(`-.`)&&t.kind===`Identifier`&&D(`==`,2)},R=[],z=()=>R[R.length-1]??-1,B=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Re=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},V=e=>!e.text.endsWith(`.`)&&!bl.has(Re(e)),H=e=>{let t=Re(e);if(bl.has(t))return;let n=B(e);if(n>=0)return`<${n}>${t}`;let r=z(),i=R[R.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},U=e=>{if(e.kind===`Keyword`)return _l.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return R.length===0;if(e.text[1]===`+`||R.length===0)return!0;let t=z();return t>=0&&B(e)>t},W=e=>{let t=B(e),n=R.length-1,r=R[n-1]??-1,i=R[n]<0;return i&&(R[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:R[n]===t},ze=e=>!a.has(e)&&c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),Be=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!El.has(e.name)&&!ze(e.name):!1,Ve=()=>{let e=b();return e.kind===`Step`?V(e):e.kind===`Keyword`?xl.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!L()},He=()=>{let e=r.index;s.index=e;let t=b();return t.kind===`Operator`&&!ll.has(t.text)&&fl(t.text)?(r.index++,v({kind:`OperatorReference`,operator:t.text,location:u(t)},e)):k(`MODULE`)?v({kind:`ModuleFact`,name:ie(),location:u(t)},e):N()},Ue=e=>o[o.length-1]?.add(e),We=e=>{o.push(/* @__PURE__ */ new Set);let t=e();return o.pop(),t},Ge=e=>o.some(t=>t.has(e))||c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),Ke=()=>{let e=r.index,t=b(),n=ce(()=>{let e=b();if((e.kind!==`Identifier`||w(e))&&e.kind!==`Operator`)throw E(`Expected a definition name but found ${x(e)}`,e);return r.index++,e.text},`!`),i=u(t);return v(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:i}:{kind:`Identifier`,name:n.join(`!`),location:i},e)},qe=()=>{if(t)return ce(Ke);let e=ce(He),n=e.find(e=>e.kind===`Identifier`&&Ge(e.name));if(n)throw te(`DEF clause entry should describe a defined operator`,n.location);return e},Je=()=>({facts:Ve()?ce(He):[],defs:k(`DEF`)||k(`DEFS`)?qe():[]}),Ye=()=>{let e=r.index,n=O(),i=n.text===`USE`&&k(`ONLY`),a=g(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:i,...Je(),keyword:a,location:u(n)},s=o.kind===`Hide`&&!t?o.facts.filter(e=>!Be(e)):[];if(s.length>0)throw m(s.map(t=>({location:_(t.location.range??g(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
104
|
-
the name of a theorem, assumption, or step.`})));return v(o,e)},Xe=()=>{let e=r.index,t=u(b()),n=k(`NEW`),i=b().kind===`Keyword`?Sl.get(b().text):void 0;if(!n&&i===void 0)throw E(`Expected a declaration but found ${x(b())}`);if(i!==void 0&&O(),i===`Variable`){let n=ae();return Ue(n.name),v({kind:`NewSymbol`,name:n.name,arity:0,level:i,set:void 0,nameRange:n.range,location:t},e)}let a=Fe();Ue(a.name);let o=(i??`Constant`)===`Constant`&&D(`\\in`);if(o&&a.arity>0)throw te(`declared symbol with arguments before \\in`);return o&&O(),v({kind:`NewSymbol`,name:a.name,arity:a.arity,level:i??`Constant`,set:o?N():void 0,nameRange:a.location.range,location:t},e)},Ze=()=>{let e=r.index,t=u(A(`ASSUME`)),n=ce(()=>D(`ASSUME`)?We(Ze):b().kind===`Keyword`&&Cl.has(b().text)?Xe():N());return A(`PROVE`),v({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)},Qe=e=>{let t={value:0};for(;b(t.value).kind===`Identifier`&&D(`,`,t.value+1);)t.value+=2;return b(t.value).kind===`Identifier`&&D(e,t.value+1)},$e=(e,t)=>{e.forEach(Ue),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(Ue))},et=()=>{let e=b();if(D(`USE`)||D(`HIDE`))return Ye();if(D(`INSTANCE`))return v(Pe(void 0,[],!1,u(e)),r.index);if(D(`DEFINE`)||L()){let t=r.index;k(`DEFINE`);let n=[Me(!1)];for(;L();)n.push(Me(!1));let i={kind:`Define`,definitions:n,location:u(e)};return v(i,t)}if(k(`HAVE`))return{kind:`Have`,expression:N()};if(k(`TAKE`)){let e=le(),t=oe(e?[]:ce(ae)),n=e?pe():[];return $e(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(k(`WITNESS`))return{kind:`Witness`,expressions:ce(()=>N())};if(k(`PICK`)){let e=Qe(`:`),t=oe(e?ce(ae):[]),n=e?[]:pe();return $e(t.names,n),A(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:N()}}return k(`CASE`)?{kind:`Case`,expression:N()}:{kind:`Assert`,isSuffices:k(`SUFFICES`),statement:D(`ASSUME`)?Ze():N()}},tt=e=>{let t=b();if(t.kind!==`Step`)throw E(`Expected a step number but found ${x(t)}`,t);if(!W(t))throw te(`${e?`QED step`:`step`}'s number has bad level`,t);if(B(t)<0&&H(t)!==void 0)throw te(`<*> and <+> cannot be used for a named step`,t);return r.index++,{name:H(t),token:t.text,location:u(t)}},nt=()=>{let e=r.index,t=tt(D(`QED`,1)),n=r.index,i=/* @__PURE__ */ new Set;o.push(i);let a=k(`QED`)?{kind:`Qed`}:et(),s=g(e),c=g(n),l=U(b());if(l&&!vl.has(a.kind))throw te(`Proof of a step that does not take a proof`);let u=l?G():void 0;return o.pop(),(a.kind!==`Assert`||a.isSuffices)&&i.forEach(Ue),v({...t,body:a,head:s,statement:c,proof:u},e)},rt=()=>{let e=u(b());if(D(`BY`)||D(`PROOF`)&&D(`BY`,1)){k(`PROOF`),O();let t=g(r.index-1);return{kind:`By`,isOnly:k(`ONLY`),...Je(),keyword:t,location:e}}let t=b(+!!D(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){k(`PROOF`),O();let n=g(r.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}k(`PROOF`);let n=[nt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(nt());return{kind:`Steps`,level:z(),steps:n,location:e}},G=()=>{let e=r.index;R.push(-1);let t=We(rt);return R.pop(),v(t,e)},K=e=>{let t=r.index,n=O(),i=b().kind===`Identifier`&&D(`==`,1)?ie():void 0;i!==void 0&&(a.add(i),O());let o=We(()=>({statement:D(`ASSUME`)?Ze():N(),proof:U(b())?G():void 0})),s=o.statement,c=v({name:i,statement:s,proof:o.proof,location:u(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&s.kind!==`AssumeProve`&&e.definitions.push(v({kind:`Operator`,name:i,params:[],body:s,isLocal:!1,isRecursive:!1,location:u(n)},t))},it=()=>{let e=r.index;return v(at(),e)},at=()=>{let e=O(),t=u(e),n=e.text===`AXIOM`;if(b().kind===`Identifier`&&D(`==`,1)){let e=ie();return a.add(e),O(),{name:e,expression:N(),isAxiom:n,location:t}}return{name:void 0,expression:N(),isAxiom:n,location:t}},ot=()=>{let e=u(A(`----`));A(`MODULE`);let t=ie();A(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(c.push(n),i.push(/* @__PURE__ */ new Set),k(`EXTENDS`)&&ce(()=>{let e=r.index;n.extends.push(ie()),n.extendsRanges.push(g(e))});;){let t=r.index;S.index=t;let a=b();if(a.kind===`ModuleEnd`||a.kind===`End`){if(a.kind===`ModuleEnd`&&(e.range={module:c[0].name,start:{line:e.line,column:e.column},end:{line:a.line,column:a.endColumn}}),_e.size>0)throw m([..._e.values()]);return c.pop(),i.pop(),n}if(a.kind===`Separator`){if(D(`MODULE`,1)){let e=ot();n.modules.push(e),n.units.push({kind:`Module`,module:e}),A(`====`);continue}O()}else{switch(a.text){case`CONSTANT`:case`CONSTANTS`:{O();let e=Ie();n.constants.push(...e),n.units.push({kind:`Constants`,declarations:e});continue}case`VARIABLE`:case`VARIABLES`:{O();let e=ce(()=>{let e=r.index,t=u(b());return v({name:ie(),arity:0,location:t},e)});n.variables.push(...e),n.units.push({kind:`Variables`,declarations:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=it();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&n.definitions.push({kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{let e=Ye();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:O(),n.units.push({kind:`Recursive`,declarations:Le()});continue;case`INSTANCE`:st(n,v(Pe(void 0,[],!1,u(a)),t));continue;case`LOCAL`:if(O(),D(`INSTANCE`)){st(n,v(Pe(void 0,[],!0,u(a)),t));continue}st(n,v(P(!0),t));continue}a.kind===`Keyword`&&gl.has(a.text)?K(n):st(n,Me(!1))}}},st=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))};return ot()},Al=e=>kl(e,!1),jl=e=>kl(e,!0),Ml=25214903917n,Nl=(1n<<48n)-1n,Pl=2147483647,Fl=e=>{let t={value:(BigInt.asUintN(64,e)^Ml)&Nl},n=e=>(t.value=t.value*Ml+11n&Nl,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Ml)&Nl},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=Pl)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Il=10454148508367108822n,Ll=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Il);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Rl=Int32Array.from(Ll,e=>Number(BigInt.asIntN(32,e>>32n))),zl=Int32Array.from(Ll,e=>Number(BigInt.asIntN(32,e))),Bl=Number(BigInt.asIntN(32,Il>>32n)),Vl=Number(BigInt.asIntN(32,Il));let Hl=Bl,Ul=Vl;const Wl=e=>{let t=(e^Ul)&255;Ul=(Ul>>>8|Hl<<24)^zl[t],Hl=Hl>>>8^Rl[t]},Gl=e=>{for(let t=0;t<32;t+=8)Wl(e>>>t)},Kl=e=>{if(typeof e==`boolean`)Wl(0),Wl(e?116:102);else if(typeof e==`number`)Wl(1),Gl(e);else if(typeof e==`string`){Wl(3),Gl(e.length);for(let t=0;t<e.length;t++)Wl(e.charCodeAt(t))}else if(Pe(e))Wl(21),Gl(He(e.name)+1);else if(P(e)){let t=xn(e);Wl(9),Gl(t.domain.length);for(let e=0;e<t.domain.length;e++)Kl(t.domain[e]),Kl(t.range[e])}else{let t=q(e).elements;Wl(5),Gl(t.length);for(let e of t)Kl(e)}},ql=e=>{let t={high:Hl,low:Ul};Hl=Bl,Ul=Vl;for(let t of e)Kl(t);let n=BigInt(Hl>>>0)<<32n|BigInt(Ul>>>0);return Hl=t.high,Ul=t.low,n},Jl=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||Pe(e))return 5;if(typeof e==`string`)return 5+e.length;if(P(e)){let t=xn(e);return t.domain.reduce((e,n,r)=>e+Jl(n)+Jl(t.range[r]),5)}return q(e).elements.reduce((e,t)=>e+Jl(t),5)},Yl=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Hl=n<32?0:1<<n-32,Ul=n<32?1<<n:0;for(let t=0;t<e;t++)Wl(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^Hl,t[n+1]=t[a+1]^Ul}}return t},Xl=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=r.get(e);if(t!==void 0)return t;let n=Jl(e);return Hl=0,Ul=0,Kl(e),r.set(e,i.length),i.push(n,Hl,Ul),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=Yl(e);return n.set(e,r),r};return(n,r)=>{let s={high:Hl,low:Ul},c={high:Bl,low:Vl};for(let t of e){let e=a(n[t]),r=o(i[e]),s={high:i[e+1],low:i[e+2]};for(let e=0;e<8;e++){let t=e<4?c.low:c.high,n=(e*256+(t>>>(e&3)*8&255))*2;s.high^=r[n],s.low^=r[n+1]}c.high=s.high,c.low=s.low}Hl=s.high,Ul=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},Zl=[],Ql=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},$l=()=>{for(let e=1277011;Zl.length<1341;e++)Ql(e)&&Zl.push(e);return Zl},eu=e=>{let t=$l(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},tu=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},nu=e=>{for(let t=Math.max(e,9);;t++){let e=tu(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},ru=(e,t,n)=>{if(t<=0)return[];let r=nu(t),i={index:BigInt(n.nextInt(t))},a=BigInt(eu(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},iu=(1n<<63n)-1n-24n,au=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(iu*BigInt(n)+i)%t;return r<0n?r+t:r})},ou=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,su=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Vt(e.domain),n=q(e.range).elements;return{lists:t.map(()=>n),create:e=>$e(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>q(e).elements),create:t=>Wt(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>q(e).elements),create:Ut}}},cu=(e,t,n)=>{if(cn(t))return[];if(typeof t==`object`&&t.kind===`Interval`)return ru(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let r=su(t);if(r){let t=r.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Pl)?au(e,t,n):ru(e,Number(t),n)).map(e=>r.create(ou(r.lists,e)))}let i=q(t).elements;return ru(e,i.length,n).map(e=>i[Number(e)])},lu=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new b(`RandomElement of the empty set`);return n},uu=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Vt(e.domain)];return $e(n,n.map(()=>uu(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Wt(e.names.map((n,r)=>[n,uu(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Ut(e.factors.map(e=>uu(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new b(`RandomElement of the empty set`);return e.low+r}return lu(q(e).elements,t)},du=(e,t=0n)=>{let n=Fl(t),r={random:Fl(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Wt([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:ql,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},fu=e=>Nt([...e.possibleCounts].map(([e,t])=>[e,t])),pu=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,fu(e)]]),mu=[[38,[`ACTION`,`ACTIONS`]],[39,[`ASSUME`]],[40,[`[]ASSUME`]],[41,[`ASSUMPTION`,`AXIOM`]],[42,[`CASE`]],[43,[`CHOOSE`]],[44,[`CONSTANT`,`CONSTANTS`]],[45,[`ELSE`]],[46,[`EXCEPT`]],[47,[`\\E`,`\\exists`,`∃`]],[48,[`EXTENDS`]],[49,[`\\A`,`\\forall`,`∀`]],[50,[`IF`]],[51,[`INSTANCE`]],[52,[`LET`]],[53,[`IN`]],[54,[`LOCAL`]],[55,[`MODULE`]],[56,[`NEW`]],[57,[`OTHER`]],[58,[`PROPOSITION`,`LEMMA`,`COROLLARY`]],[59,[`SF_`]],[60,[`\\EE`]],[61,[`\\AA`]],[62,[`THEN`]],[63,[`BY`]],[64,[`ONLY`]],[65,[`DEFINE`]],[66,[`DEF`,`DEFS`]],[67,[`THEOREM`]],[68,[`USE`]],[69,[`HIDE`]],[70,[`HAVE`]],[71,[`OBVIOUS`]],[72,[`OMITTED`]],[73,[`LAMBDA`]],[74,[`TAKE`]],[75,[`PROOF`]],[76,[`PROVE`]],[77,[`[]PROVE`]],[78,[`QED`]],[79,[`RECURSIVE`]],[80,[`STATE`]],[81,[`TEMPORAL`,`TEMPORALS`]],[82,[`PICK`]],[83,[`WITNESS`]],[84,[`SUFFICES`]],[85,[`VARIABLE`,`VARIABLES`]],[86,[`WF_`]],[87,[`WITH`]],[88,[`,`]],[89,[`:`]],[90,[`::`,`∷`]],[91,[`.`]],[92,[`_`]],[93,[`==`,`≜`]],[94,[`(`]],[95,[`)`]],[96,[`-|-`]],[97,[`[`]],[98,[`]_`]],[99,[`]`]],[100,[`{`]],[101,[`}`]],[102,[`<<`,`⟨`]],[103,[`>>_`,`⟩_`]],[104,[`>>`,`⟩`]],[105,[`!`]],[106,[`->`,`→`]],[107,[`<-`,`←`]],[108,[`|->`,`↦`]],[113,[`'`]],[114,[`^+`,`⁺`]],[115,[`^*`]],[116,[`^#`]],[117,[`-.`]],[118,[`\\lnot`,`¬`]],[119,[`\\neg`]],[120,[`~`]],[121,[`[]`,`□`]],[122,[`<>`,`◇`]],[123,[`ENABLED`]],[124,[`UNCHANGED`]],[125,[`SUBSET`]],[126,[`UNION`]],[127,[`DOMAIN`]],...[`//`,`/\\`,`/=`,`/`,`\\/`,`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`,`\\in`,`\\intersect`,`\\union`,`\\land`,`\\leq`,`\\ll`,`\\lor`,`\\o`,`\\odot`,`\\ominus`,`\\oplus`,`\\oslash`,`\\otimes`,`\\prec`,`\\preceq`,`\\propto`,`\\sim`,`\\simeq`,`\\sqcap`,`\\sqcup`,`\\sqsubset`,`\\sqsupset`,`\\sqsubseteq`,`\\sqsupseteq`,`\\star`,`\\subset`,`\\subseteq`,`\\succ`,`\\succeq`,`\\supset`,`\\supseteq`,`\\uplus`,`\\wr`,`\\`,`~>`,`=>`,`=<`,`=|`,`=`,`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`,`-`,`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`,`\\X`].map((e,t)=>[128+t,[e]]),[129,[`∧`]],[132,[`∨`]],[147,[`∈`]]],hu=(()=>{let e=/* @__PURE__ */ new Map;for(let t of mu)for(let n of t[1])e.set(n[0],[...e.get(n[0])??[],[t[0],n]]);return e})(),gu=/-{4,} *MODULE/y,_u=[/[0-9][A-Za-z0-9]*\.\/\\/y,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*\.\/\\/y,/[a-zA-RT-VX-Z][A-Za-z0-9]*\.\/\\/y],vu=[/[0-9][A-Za-z0-9]*\.\\\//y,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*\.\\\//y,/[a-zA-RT-VX-Z][A-Za-z0-9]*\.\\\//y],yu=[/_[A-Za-z0-9_]*[A-Za-z][A-Za-z0-9_]*/y,/[0-9][A-Za-z0-9_]*[A-Za-z][A-Za-z0-9_]*/y,/[WS](?:[a-zA-EG-Z_0-9][A-Za-z0-9_]*)?/y,/[WS]F(?:[A-Za-z0-9][A-Za-z0-9_]*)?/y,/[a-zA-RT-VX-Z][A-Za-z0-9_]*/y,/[@ℕℤℝ]/y],bu=[[35,[gu]],[36,[/-{4,}/y]],[37,[/={4,}/y]],[109,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[110,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[111,_u],[112,vu],[289,yu],[290,[/<[0-9]+>[A-Za-z0-9_]+/y]],[291,[/<[+*]>[A-Za-z0-9]+/y]],[292,[/<(?:[0-9]+|\+|\*)>[A-Za-z0-9_]+\.+/y]],[293,[/<(?:[0-9]+|\+|\*)>/y]],[294,[/<(?:[0-9]+|\+|\*)>(?:\*\.*|-\.*|\.+)/y]]],xu=[[20,[/[0-9]+/y]],[21,[gu]],[111,_u],[112,vu],[289,yu]],Su=(e,t,n)=>Math.max(0,...e.map(e=>(e.lastIndex=n,e.exec(t)?.[0].length??0))),Cu=(e,t,n,r)=>{let i=n.map(([n,r])=>[n,Su(r,e,t)]);if(r)for(let[n,r]of hu.get(e[t])??[])e.startsWith(r,t)&&i.push([n,r.length]);return i.reduce((e,t)=>t[1]>e[1]||t[1]===e[1]&&t[1]>0&&t[0]<e[0]?t:e,[0,0])},wu=(e,t)=>{if(e[t]===`?`)return 1;if(e[t]!==`"`)return 0;let n=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y;return n.lastIndex=t,n.exec(e)?.[0].length??0},Tu=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
105
|
-
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`],[`\0`,``]]),Eu=e=>e.split(``).map(e=>{let t=e.charCodeAt(0);return Tu.get(e)??(t<32||t>126?`\\u${t.toString(16).padStart(4,`0`)}`:e)}).join(``),Du=e=>{let t=[],n=[],r={line:1,column:0,isAfterCarriageReturn:!1,isAfterLineFeed:!1};for(let i of e.split(``))r.column++,r.isAfterLineFeed?(r.isAfterLineFeed=!1,r.line++,r.column=1):r.isAfterCarriageReturn&&(r.isAfterCarriageReturn=!1,i===`
|
|
106
|
-
`?r.isAfterLineFeed=!0:(r.line++,r.column=1)),i===`\r`&&(r.isAfterCarriageReturn=!0),i===`
|
|
107
|
-
`&&(r.isAfterLineFeed=!0),i===` `&&(r.column=r.column-1+(8-(r.column-1)%8)),t.push(r.line),n.push(r.column);let i={state:0,index:0,commentDepth:0},a=(r,i,a)=>({kind:r,image:e.slice(i,a),beginLine:t[i],beginColumn:n[i],endLine:t[a-1],endColumn:n[a-1],next:void 0}),o=(r,i,a)=>{if(a!==void 0&&a+1<e.length)throw new g(`Lexical error at line ${t[a]}, column ${n[a]}. Encountered: "${Eu(e[a])}" (${e.charCodeAt(a)}), after : "${Eu(i)}"`);let o=e.length-1,s=e[o]===`
|
|
108
|
-
`||e[o]===`\r`,c=`Lexical error at line ${s?t[o]+1:t[o]}, column ${s?0:n[o]+1}. Encountered: <EOF> after : "${Eu(i)}"`;throw new g(t[r]===t[o]?c:`Lexical {error: EOF reached, possibly open comment starting around line ${t[r]}`)},s=t=>{for(;;){if(i.index>=e.length)return o(t,``,void 0);let n=e.startsWith(`(*.`,i.index)?3:e.startsWith(`(*`,i.index)?2:0;if(i.state===5){let t=e.startsWith(`\r
|
|
109
|
-
`,i.index)?2:+(e[i.index]===`
|
|
110
|
-
`||e[i.index]===`\r`);if(t>0){i.index+=t,i.state=2;return}}else if(n>0){i.index+=n,i.commentDepth++,i.state=4;return}else if(e.startsWith(`*)`,i.index)){i.index+=2,i.state===3?i.state=2:(i.commentDepth--,i.commentDepth===0&&(i.state=3));return}i.index++}};return{getNextToken:()=>{for(;;){if(i.index>=e.length){let r=e.length-1;return{kind:0,image:``,beginLine:t[r]??0,beginColumn:n[r]??0,endLine:t[r]??0,endColumn:n[r]??0,next:void 0}}let r=i.index;if(i.state===0){let t=e.startsWith(`--->`,i.index)?4:0;gu.lastIndex=i.index;let n=gu.exec(e)?.[0].length??0;if(n>0&&n>=t)return i.index+=n,i.state=2,a(3,r,i.index);if(t>0)return i.index+=t,i.state=1,a(2,r,i.index);i.index++;continue}if(i.state===1){let[t,n]=Cu(e,i.index,xu,!1);if(n===0){i.index++;continue}return i.index+=n,t===21&&(i.state=2),a(t,r,i.index)}if(i.state!==2){s(r);continue}if(`
|
|
111
|
-
\r`.includes(e[i.index])){i.index++;continue}if(e.startsWith(`(*`,i.index)||e.startsWith(`\\*`,i.index)){i.state=e[i.index]===`(`?3:5,i.index+=e.startsWith(`(*.`,i.index)?3:2,s(r);continue}let[c,l]=Cu(e,i.index,bu,!0);if(l===0){let t=wu(e,i.index),n=i.index+t;return n<e.length?o(r,n+1<e.length||t===0?e.slice(r,n):e.slice(r,n+1),n):o(r,t<=1?``:e.slice(r),void 0)}return i.index+=l,a(c,r,i.index)}}}},Ou=2147483647,ku=-2147483648,Au=(e,t)=>Array.from({length:t-e+1},(t,n)=>e+n),ju=Au(118,127),Mu=Au(117,127),Nu=Au(128,288),Pu=Au(113,116),Fu=Au(290,294),Iu=[42,43,47,49,50,52,60,61],Lu=new Set(Au(113,291)),Ru=/* @__PURE__ */ new Set([59,86,94,97,100,102]),zu=/* @__PURE__ */ new Set([38,44,56,80,81,85]),Bu=/* @__PURE__ */ new Set([92,...Mu]),Vu=/* @__PURE__ */ new Set([`Tuple`,`ParenExpr`,`SetEnumerate`,`SubsetOf`,`SetOfAll`,`SetOfFcns`,`RcdConstructor`,`SetOfRcds`,`Except`,`FcnConst`,`ActionExpr`]),Hu=[[`[`,160,160,`left`,`postfix`],[`.`,170,170,`left`,`infix`],[`'`,150,150,`none`,`postfix`],[`^`,140,140,`none`,`infix`],[`/`,130,130,`none`,`infix`],[`*`,130,130,`left`,`infix`],[`-`,110,110,`left`,`infix`],[`-.`,120,120,`none`,`prefix`],[`+`,100,100,`left`,`infix`],[`=`,50,50,`none`,`infix`],[`\\lnot`,40,40,`left`,`prefix`],[`\\land`,30,30,`left`,`infix`],[`\\lor`,30,30,`left`,`infix`],[`~>`,20,20,`none`,`infix`],[`=>`,10,10,`none`,`infix`],[`[]`,40,150,`none`,`prefix`],[`<>`,40,150,`none`,`prefix`],[`ENABLED`,40,150,`none`,`prefix`],[`UNCHANGED`,40,150,`none`,`prefix`],[`SUBSET`,100,130,`none`,`prefix`],[`UNION`,100,130,`none`,`prefix`],[`DOMAIN`,100,130,`none`,`prefix`],[`^+`,150,150,`none`,`postfix`],[`^*`,150,150,`none`,`postfix`],[`^#`,150,150,`none`,`postfix`],[`\\cdot`,50,140,`left`,`infix`],[`\\equiv`,20,20,`none`,`infix`],[`-+->`,20,20,`none`,`infix`],[`/=`,50,50,`none`,`infix`],[`\\subseteq`,50,50,`none`,`infix`],[`\\in`,50,50,`none`,`infix`],[`\\notin`,50,50,`none`,`infix`],[`<`,50,50,`none`,`infix`],[`\\leq`,50,50,`none`,`infix`],[`>`,50,50,`none`,`infix`],[`\\geq`,50,50,`none`,`infix`],[`\\times`,100,130,`left`,`nfix`],[`\\`,80,80,`none`,`infix`],[`\\intersect`,80,80,`left`,`infix`],[`\\union`,80,80,`left`,`infix`],[`...`,90,90,`none`,`infix`],[`..`,90,90,`none`,`infix`],[`|`,100,110,`left`,`infix`],[`||`,100,110,`left`,`infix`],[`&&`,130,130,`left`,`infix`],[`&`,130,130,`left`,`infix`],[`$$`,90,130,`left`,`infix`],[`$`,90,130,`left`,`infix`],[`??`,90,130,`left`,`infix`],[`%%`,100,110,`left`,`infix`],[`%`,100,110,`none`,`infix`],[`##`,90,130,`left`,`infix`],[`++`,100,100,`left`,`infix`],[`--`,110,110,`left`,`infix`],[`**`,130,130,`left`,`infix`],[`//`,130,130,`none`,`infix`],[`^^`,140,140,`none`,`infix`],[`@@`,60,60,`left`,`infix`],[`!!`,90,130,`none`,`infix`],[`|-`,50,50,`none`,`infix`],[`|=`,50,50,`none`,`infix`],[`-|`,50,50,`none`,`infix`],[`=|`,50,50,`none`,`infix`],[`<:`,70,70,`none`,`infix`],[`:>`,70,70,`none`,`infix`],[`:=`,50,50,`none`,`infix`],[`::=`,50,50,`none`,`infix`],[`\\oplus`,100,100,`left`,`infix`],[`\\ominus`,110,110,`left`,`infix`],[`\\odot`,130,130,`left`,`infix`],[`\\oslash`,130,130,`none`,`infix`],[`\\otimes`,130,130,`left`,`infix`],[`\\uplus`,90,130,`left`,`infix`],[`\\sqcap`,90,130,`left`,`infix`],[`\\sqcup`,90,130,`left`,`infix`],[`\\div`,130,130,`none`,`infix`],[`\\wr`,90,140,`none`,`infix`],[`\\star`,130,130,`left`,`infix`],[`\\o`,130,130,`left`,`infix`],[`\\bigcirc`,130,130,`left`,`infix`],[`\\bullet`,130,130,`left`,`infix`],[`\\prec`,50,50,`none`,`infix`],[`\\succ`,50,50,`none`,`infix`],[`\\preceq`,50,50,`none`,`infix`],[`\\succeq`,50,50,`none`,`infix`],[`\\sim`,50,50,`none`,`infix`],[`\\simeq`,50,50,`none`,`infix`],[`\\ll`,50,50,`none`,`infix`],[`\\gg`,50,50,`none`,`infix`],[`\\asymp`,50,50,`none`,`infix`],[`\\subset`,50,50,`none`,`infix`],[`\\supset`,50,50,`none`,`infix`],[`\\supseteq`,50,50,`none`,`infix`],[`\\approx`,50,50,`none`,`infix`],[`\\cong`,50,50,`none`,`infix`],[`\\sqsubset`,50,50,`none`,`infix`],[`\\sqsubseteq`,50,50,`none`,`infix`],[`\\sqsupset`,50,50,`none`,`infix`],[`\\sqsupseteq`,50,50,`none`,`infix`],[`\\doteq`,50,50,`none`,`infix`],[`\\propto`,50,50,`none`,`infix`]].map(e=>({name:e[0],low:e[1],high:e[2],associativity:e[3],fix:e[4]})),Uu=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],Wu=(()=>{let e=new Map(Hu.map(e=>[e.name,e]));for(let t of Uu){let n=e.get(t[0]);if(n)for(let r of t.slice(1))e.set(r,n)}return e})(),Gu=Wu.get(`[`),Ku={name:`$$_void`,low:0,high:0,associativity:`none`,fix:`infix`},qu=e=>e.fix===`prefix`?e:Wu.get(`${e.name}.`),Ju=e=>e.fix===`infix`||e.fix===`nfix`,Yu=(e,t)=>e.low>t.high,Xu=(e,t)=>e.high<t.low,Zu=e=>e!==void 0&&e.kind>=113&&e.kind<=288,Qu=e=>e!==void 0&&e.kind>=128&&e.kind<=288,$u=(e,t)=>{let n=e[t];if(n.kind===95||n.kind===99){let n={index:t,depth:1};for(;n.index>0;){n.index--;let t=e[n.index].kind,r=t===94||t===97;if(r&&n.depth===1)break;r&&n.depth--,(t===95||t===99)&&n.depth++}return n.index>0&&e[n.index-1].kind===289?n.index-1:n.index}if(n.kind===289){let n=e[t-1];return!Zu(n)||n.kind>=113&&n.kind<=116||Qu(n)&&e[t-2]?.kind!==289||e[t-2]?.kind===107?t:Qu(n)?t-2:t-1}return Zu(n)?t-1:t},ed=e=>e.kind>=38&&e.kind<=46||e.kind===48||e.kind>=50&&e.kind<=59||e.kind===80||e.kind>=62&&e.kind<=87||e.kind===92||e.kind>=123&&e.kind<=127,td=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1,e.image.indexOf(`>`))),nd=e=>{let t=Du(e),n=[],r={kind:0,image:``,beginLine:0,beginColumn:0,endLine:0,endColumn:0,next:void 0},i={token:r,nextKind:-1,generation:0,expectedGeneration:-1,moduleName:void 0,expecting:``,lastOperator:void 0,fairnessHook:void 0,proofDepth:-1,operatorStack:void 0},a={scanPosition:r,lastPosition:r,remaining:0,isSucceeded:!1,isLookingAhead:!1,isRescanning:!1,endPosition:0,longestExpected:0},o=[],s=[],c=[],l=[],u=[],d=e=>e.next??=t.getNextToken(),f=e=>Array.from({length:e}).reduce(e=>d(e),a.isLookingAhead?a.scanPosition:i.token),p=()=>i.nextKind===-1?i.nextKind=d(i.token).kind:i.nextKind,m=()=>(i.expectedGeneration=i.generation,!1),h=e=>p()===e||m(),_=e=>`line ${e.location[0]}, col ${e.location[1]} to line ${e.location[2]}, col ${e.location[3]} of module ${i.moduleName??`null`}`,v=e=>new g(`***Parse Error***\n${i.expecting===``?``:`Was expecting "${i.expecting}"\n`}${e}\n\nResidual stack trace follows:\n${s.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``)}`),y=e=>{e>=100||(e===a.endPosition+1?a.endPosition++:a.endPosition!==0&&(a.longestExpected=Math.max(a.longestExpected,a.endPosition),e!==0&&(a.endPosition=e)))},b=(e,t)=>e===void 0||t>=100?void 0:e===a.scanPosition?t:b(e.next,t+1),x=e=>{a.scanPosition===a.lastPosition&&(a.remaining--,a.lastPosition=d(a.scanPosition)),a.scanPosition=d(a.scanPosition);let t=a.isRescanning?b(i.token,0):void 0;return t!==void 0&&y(t),e.has(a.scanPosition.kind)?(a.remaining===0&&a.scanPosition===a.lastPosition&&(a.isSucceeded=!0),!0):!1},S=e=>{if(typeof e!=`number`)return e;let t=/* @__PURE__ */ new Set([e]);return()=>x(t)},C=(...e)=>{let t=new Set(e);return()=>x(t)},w=(...e)=>{let t=e.map(S);return()=>{for(let e of t){if(!e())return!1;if(a.isSucceeded)return!0}return!0}},T=(...e)=>{let t=e.map(S);return()=>{let e=a.scanPosition;for(let n of t)if(a.scanPosition=e,n())return!0;return!1}},ee=e=>{let t=S(e);return()=>{let e=a.scanPosition;return t()||(a.scanPosition=e),!0}},te=e=>{let t=S(e);return()=>{for(;;){let e=a.scanPosition;if(!t())return a.scanPosition=e,!0;if(a.isSucceeded)return!0}}},ne=(e,t)=>{let n=S(t);return()=>{a.isLookingAhead=!0;let t=e();return a.isLookingAhead=!1,t&&n()}},E=e=>l.length===0||l[l.length-1].column<e,re=()=>E(f(1).beginColumn),D=()=>{let e=f(1),t=l.at(-1);return t!==void 0&&(e.kind===129||e.kind===132)&&t.column===e.beginColumn&&t.isConjunction===(e.kind===129)},O=()=>f(1).kind===39||f(1).kind===40,k=()=>O()||f(2).kind===90&&(f(3).kind===39||f(3).kind===40),A=()=>{let e=i.operatorStack?.at(-1)?.operator;return i.operatorStack===void 0||i.operatorStack.length===0||e!==void 0&&e.fix!==`postfix`},ie=()=>{let e=d(a.isLookingAhead?a.scanPosition:i.token);if(e.kind===102){let t={token:e,depth:1};for(;t.depth!==0;)if(t.token=d(t.token),t.token.kind===102&&t.depth++,t.token.kind===104&&t.depth--,t.token.kind===0)return!1;return d(t.token).kind===147}if(e.kind!==289)return!1;let t={token:d(e)};for(;t.token.kind===88;){let e=d(t.token);if(e.kind!==289)return!1;t.token=d(e)}return t.token.kind===147},j=()=>Me(),ae=()=>Te(),oe=w(102,ee(w(289,te(w(88,289)))),104),se=T(oe,289),ce=w(91,109),le=w(109,ee(ce)),ue=w(94,j),de=T(ne(ie,se),j,j,j),fe=w(100,ee(de),101),pe=w(97,T(ne(ie,se),289,ne(()=>f(2).kind===108&&ed(f(1)),289),289,j)),M=w(102,ee(j),C(104,103)),me=w(C(132,129),j),he=w(ee(54),96,C(289,...Mu)),ge=T(he,79),_e=w(289,ee(94)),ve=C(92,...Mu),ye=w(94,T(ne(re,C(...Mu,...Nu,...Pu)),ne(re,73),j)),be=w(56,44),xe=w(_e,ee(147)),Se=w(T(be,56,44),T(xe,ve)),Ce=w(ee(56),85,289),we=w(ee(56),C(80,38,81),T(_e,ve)),Te=w(ee(w(289,90,ae)),C(39,40),T(ne(k,ae),T(Se,Ce,we),j),te(88),C(76,77)),Ee=w(ee(96),289,93),De=w(289,93),Oe=S(75),ke=w(ee(84),T(j,ne(O,ae))),N=T(ne(re,110),ne(re,le),w(C(289,290,291,...Nu,...Pu,...Mu),ee(ye),te(105))),Ae=T(ne(re,C(...Pu)),ne(re,91),ne(re,pe)),je=T(ne(re,C(...Nu)),ne(re,90)),Me=w(te(C(...ju,...Nu)),T(ne(re,T(w(C(47,49),T(289,se)),w(C(60,61),289),w(50,j),w(42,j),w(52,ge,te(ge)),w(43,T(289,oe)))),ne(re,w(T(ne(A,T(me,me)),T(ue,fe,pe,M,w(C(86,59),T(289,ue,fe,pe,M))),N),te(Ae),ee(je))))),Ne={moduleUnit:[T(36,85,44,he,79,w(ee(54),51,289),w(C(41,39),ee(Ee),j),w(C(67,58),ee(De),T(ne(O,ae),j)),C(35,3,21),ne(()=>f(1).kind===68&&f(2).kind!==64||f(1).kind===69,T(w(ee(75),63),68,69))),1],unitDefinition:[he,2],unitInstance:[w(ee(54),51,289),2],unitAssumption:[w(C(41,39),ee(Ee),j),2],unitTheorem:[w(C(67,58),ee(De),T(ne(O,ae),j)),2],constantArguments:[w(94,92),2],definitionBody:[j,1],functionDefinition:[w(289,97),Ou],postfixDefinition:[w(289,C(...Pu)),Ou],infixDefinition:[w(289,C(...Nu)),Ou],identifierDefinition:[w(289,C(94,93)),Ou],nextSubstitution:[w(88,C(289,...Mu,...Nu,...Pu),107),3],assumptionName:[Ee,2],assumeExpression:[j,1],nextAssumeExpression:[j,1],newConstant:[be,2],constantDeclaration:[xe,2],constantSymbol:[Se,2],variableSymbol:[Ce,2],levelSymbol:[we,2],theoremName:[De,2],theoremAssumeProve:[ne(O,ae),3],theoremExpression:[j,1],proofKeyword:[Oe,2],terminalProof:[w(ee(75),C(71,72)),2],stepProof:[w(ee(Oe),te(C(...Fu)),C(...Fu)),1],usedExpression:[j,1],nextUsedExpression:[j,1],usedFacts:[T(55,j),1],definedExpression:[j,1],nextDefinedExpression:[j,1],assertStep:[ke,1],nextDefinition:[he,2],takeBounds:[T(w(289,te(w(88,289)),147),102),Ou],pickIdentifiers:[w(289,te(w(88,289)),89),Ou],assertedExpression:[j,1],decimalPart:[ce,2],operatorArgument:[w(C(...Mu,...Nu,...Pu),C(88,95,96,54,51,67,39,37,36,35,41,44,85,79)),2],lambdaArgument:[S(73),Ou],expressionArgument:[j,1],unboundQuantifier:[w(289,te(w(88,289)),89),Ou],setEnumeration:[w(se,88),Ou],setOfAll:[w(se,89),Ou],setExpression:[j,1],setContents:[de,1],recordFields:[w(289,108),Ou],recordSets:[w(289,89),Ou],bracketExpression:[j,1],tupleContents:[j,1],identifierArguments:[ye,2],fairnessArguments:[w(94,j),2],disjunctionList:[S(132),Ou],conjunctionList:[S(129),Ou],leadingOperator:[C(...ju,193),Ou],openExpression:[C(...Iu),Ou],junctionList:[C(129,132),Ou],primitiveExpression:[N,1],expressionSuffix:[Ae,1],postfixSuffix:[C(...Pu),Ou],recordSuffix:[S(91),Ou],applicationSuffix:[S(97),Ou],nextLeadingOperator:[C(...ju,193),Ou],nextOpenExpression:[C(...Iu),Ou],infixContinuation:[C(...Nu),Ou],labelContinuation:[S(90),Ou],expressionContinuation:[je,1],negativeOperator:[S(117),Ou],primitiveArguments:[ye,2],stringLiteral:[S(110),Ou],numberLiteral:[S(109),Ou],bangIdentifier:[S(289),Ou],bangArguments:[ye,2],bangOperand:[T(ne(()=>f(1).image!==`@`,289),C(...Mu),C(...Nu),C(...Pu)),1],structureOperator:[T(102,104,89,le,ne(()=>f(1).image===`@`,289)),1]},P=Object.keys(Ne),Pe=P.map(()=>[{generation:0,first:void 0,amount:0}]),Fe=(e,t,n)=>(a.remaining=n,a.scanPosition=t,a.lastPosition=t,a.isSucceeded=!1,e()),F=e=>{let t=Ne[e][1],n=Fe(Ne[e][0],i.token,t),r=Pe[P.indexOf(e)],o=r.find(e=>e.generation<=i.generation)??r[r.push({generation:0,first:void 0,amount:0})-1];return o.generation=i.generation+t-a.remaining,o.first=i.token,o.amount=t,n},Ie=(e,t)=>t===0?[]:e.kind===0?[`<EOF>`]:[e.image,...Ie(d(e),t-1)],Le=(e=-1)=>{a.longestExpected=+(e>=0||i.expectedGeneration===i.generation),a.endPosition=0,a.isRescanning=!0,Object.values(Ne).forEach((e,t)=>{for(let n of Pe[t])if(!(n.generation<=i.generation||n.first===void 0)&&(Fe(e[0],n.first,n.amount),a.isSucceeded))break}),a.isRescanning=!1,y(0);let t=d(i.token);return v(`Encountered "${Ie(t,a.longestExpected).join(` `)}" at line ${t.beginLine}, column ${t.beginColumn} and token "${Eu(i.token.image)}" `)},I=()=>(d(i.token),i.nextKind=-1,Le()),L=e=>{let t=i.token;if(i.token=d(i.token),i.nextKind=-1,i.token.kind===e)return i.generation++,i.token;throw i.token=t,Le(e)},R=e=>{if(e.includes(p()))return L(p());throw m(),I()},z=(e,t=e.kind)=>({kind:t,image:e.image,location:[e.beginLine,e.beginColumn,e.endLine,e.endColumn],heirs:[]}),B=(e,...t)=>{let n=t.flatMap(e=>e??[]),r=[Ou,Ou,ku,ku];for(let e of n)(e.location[0]<r[0]||e.location[0]===r[0]&&e.location[1]<r[1])&&(r[0]=e.location[0],r[1]=e.location[1]),(e.location[2]>r[2]||e.location[2]===r[2]&&e.location[3]>r[3])&&(r[2]=e.location[2],r[3]=e.location[3]);return{kind:e,image:e,location:r,heirs:n}},Re=()=>B(`IdPrefix`),V=e=>c.push(e),H=()=>{let e=c.lastIndexOf(void 0)+1;if(e!==c.length)return c.splice(e).filter(e=>e!==void 0)},U=e=>{c.push(void 0),s.push({name:e,token:f(1)}),i.expecting=``},W=()=>{s.pop(),c.pop(),i.expecting=``},ze=(e,t)=>{U(e);let n=t();return W(),n},Be=(e,t)=>ze(e,()=>{let e=t();return B(e,H())}),Ve=e=>{ed(e)&&(e.kind=289)},He=()=>{let e=[i.token,d(i.token)];for(;;){let t=e[e.length-1],n=d(t);if([0,67,58,41,37].includes(n.kind)||t.kind===67||t.kind===58)return;if(t.kind===93)break;e.push(n)}let t=$u(e,e.length-2);if(t<=0||e[t-1].kind===96)return;let n=e[t];e[t-1].next={kind:96,image:`Beginning of definition`,beginLine:n.beginLine,beginColumn:n.beginColumn,endLine:n.endLine,endColumn:n.endColumn,next:n}},Ue=(e,t)=>i.operatorStack?.push({node:e,operator:t}),We=()=>i.operatorStack??[],Ge=e=>We()[e].node??B(`Missing`),Ke=e=>{let t=We(),n=t.length-1;if(n<3)return;let r=Ge(n-2),i=Ge(n-3),a=Ge(n-1);t.splice(n-2,2);let o=e.fix===`nfix`&&i.kind===`Times`?B(`Times`,i.heirs,[r,a]):B(e.fix===`nfix`?`Times`:`InfixExpr`,[i,r,a]);t[n-3]={node:o,operator:void 0}},qe=()=>{let e=We(),t=e.length-1;if(t<2)return;let n=B(`PrefixExpr`,[Ge(t-2),Ge(t-1)]);e.splice(t-1,1),e[t-2]={node:n,operator:void 0}},Je=()=>{let e=We(),t=e.length-1;if(t<2)return;let n=Ge(t-1),r=e[t-1].operator===Gu?B(`FcnAppl`,[Ge(t-2)],n.heirs):B(`PostfixExpr`,[Ge(t-2),n]);e.splice(t-1,1),e[t-2]={node:r,operator:void 0}},Ye=()=>{let e=We();for(;;){let t=e.length-1,n=e[t],r=n.operator;if(r===void 0)return;let i=_(n.node??B(`Missing`));if(r.fix===`postfix`){if(t===0)throw v(`\n Encountered postfix op ${r.name} in block ${i} on empty stack`);let n=e[t-1];if(n.operator!==void 0){if(Ju(n.operator)||n.operator.fix===`prefix`)throw v(`\n Encountered postfix op ${r.name} in block ${i} following prefix or infix op ${n.operator.name}.`);Je()}else{if(t<=1)return;let n=e[t-2].operator;if(n===void 0)throw v(`Expression at location ${_(Ge(t-2))} and expression at location ${_(Ge(t-1))} follow each other without any intervening operator.`);if(Yu(n,r))Ju(n)?Ke(n):qe();else if(Xu(n,r))return;else throw v(`Precedence conflict between ops ${n.name} in block ${i} and ${r.name}.`)}}else if(r.fix===`prefix`){if(t===0)return;let n=e[t-1];if(n.operator===void 0)throw v(`\n Encountered prefix op ${r.name} in block ${i} following an expression.`);if(n.operator.fix===`postfix`)throw v(`\n Encountered prefix op ${r.name} in block ${i} following postfix op ${n.operator.name}.`);return}else if(t===0){if(qu(r)===void 0)throw v(`\n Encountered infix op ${r.name} in block ${i} on empty stack.`);return}else{let n=e[t-1];if(n.operator!==void 0){let e=n.operator;if(Ju(e)||e.fix===`prefix`){let n=qu(r),i=_(Ge(t-1));if(n===void 0)throw v(r===Ku?`\n Missing expression in block ${i} following prefix or infix op ${e.name}.`:`\n Encountered infix op ${r.name} in block ${i} following prefix or infix op ${e.name}.`);if(Yu(e,n)||e===n&&e.associativity===`left`)throw v(`\n Precedence conflict between ops ${e.name} in block ${i} and ${n.name}.`)}else Je()}else{if(t<=1)return;let n=e[t-2];if(n.operator===void 0)throw v(`Expression at location ${_(Ge(t-2))} and expression at location ${_(Ge(t-1))} follow each other without any intervening operator.`);let i=qu(n.operator),a=i!==void 0&&(t===2||e[t-3].operator!==void 0)?i:n.operator,o=_(Ge(t-2));if(Yu(a,r)||a===r&&a.associativity===`left`){if(Ju(a))Ke(a);else if(a.fix===`prefix`)qe();else if(Ge(t-2).location[0]<Ge(t-1).location[0]&&r.name===`=`)throw v(`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${a.name} in block ${o} and ${r.name}.`);else if(r===Ku)throw v(`\n Error following expression at ${o}, missing operator or separator.`);else throw v(`\n Illegal combination of operators ${a.name} in block ${o} and ${r.name}.`)}else if(Xu(a,r)||a===r&&a.associativity===`right`)return;else throw v(`\n Precedence conflict between ops ${a.name} in block ${o} and ${r.name}.`)}}if(t===e.length-1)return}},Xe=()=>{Ue(void 0,Ku),Ye();let e=We();if(e.length===2)return e[0].node;n.push(`Couldn't properly parse expression${e.slice(0,Math.max(e.length-1,1)).map((e,t)=>`-- incomplete expression at ${_(Ge(t))}.\n`).join(``)}`)},Ze=(e,t)=>{let n=We(),r=n.at(-1);if(r===void 0)throw v(`\n \`\`.'' has no left hand side at ${_(e)}.`);if(r.operator!==void 0){if(r.operator.fix!==`postfix`||n[n.length-2].operator!==void 0)throw v(`\n \`\`.'' follows operator ${_(r.node??B(`Missing`))}.`);n.push({node:void 0,operator:void 0}),Je(),n.pop()}let i=n.length-1;n[i]={node:B(`RecordComponent`,[Ge(i),e,t]),operator:void 0}},Qe=e=>{i.fairnessHook=e},$e=e=>e===void 0?!1:e.kind===`GeneralId`?e.heirs[0].heirs.length===0:e.kind===`OpApplication`&&e.heirs[1].heirs.filter((e,t)=>t%2==1).every(e=>e.kind===`GeneralId`&&e.heirs[0].heirs.length===0),et=(e,t)=>{for(let n of e.heirs)if(n.kind!==`ConjList`&&n.kind!==`DisjList`){if(!E(n.location[1]))throw v(`Item at ${_(n)} is not properly indented inside conjunction or disjunction list item at ${_(t)}`);et(n,t)}},tt=()=>i.proofDepth<0?i.proofDepth:o[i.proofDepth],nt=e=>e.image.length<2?!1:e.image[1]===`*`?i.proofDepth<0:e.image[1]===`+`?!0:[290,293,294,292].includes(e.kind)?i.proofDepth<0||o[i.proofDepth]>=0&&td(e)>o[i.proofDepth]:[63,75,71,72].includes(e.kind),rt=e=>{let t=td(e),n=i.proofDepth>0?o[i.proofDepth-1]:-1;return t===-1?(o[i.proofDepth]<0&&(o[i.proofDepth]=n+1),!0):o[i.proofDepth]>=0?t!==-2&&o[i.proofDepth]===t:(o[i.proofDepth]=t===-2?n+1:t,t===-2||t>n)},G=()=>z(L(289)),K=e=>V(z(L(e))),it=(e,t)=>{let n=R(e);return i.lastOperator=Wu.get(n.image),z(n,t)},at=()=>{U(`Infix Op`);let e=R(Nu);return i.lastOperator=Wu.get(e.image),W(),z(e,`InfixOp`)},ot=()=>{let e=R(Pu);return i.lastOperator=Wu.get(e.image),z(e,`PostfixOp`)},st=()=>it(Mu,`NonExpPrefixOp`),ct=()=>{U(`Module definition`),i.expecting=`---- MODULE`;let e=lt();i.expecting=`EXTENDS clause or module body`;let t=ut();i.expecting=`Module body`;let n=ft();i.expecting=`==== or more Module body`;let r=B(`EndModule`,[z(L(37))]);return W(),B(`Module`,[e,t,n,r])},lt=()=>{U(`Begin module`),i.expecting=`---- MODULE (beginning of module)`;let e=z(R([35,3,21]));i.expecting=`Identifier`,Ve(f(1));let t=G();i.moduleName??=t.image,i.expecting=`----`;let n=z(L(36));return W(),B(`BeginModule`,[e,t,n])},ut=()=>{if(U(`Extends`),h(48))for(K(48),i.expecting=`Identifier`,Ve(f(1)),V(G()),i.expecting=`comma or module body`;h(88);)K(88),i.expecting=`Identifier`,Ve(f(1)),V(G());let e=H();return W(),B(`Extends`,e)},dt=()=>{let e=p();if(e===36)return z(L(36));if(e===85)return pt();if(e===44)return mt();if(m(),F(`unitDefinition`))return yt();if(p()===79)return ht();if(m(),F(`unitInstance`))return Tt();if(F(`unitAssumption`))return Ot();if(F(`unitTheorem`))return Mt();if([35,3,21].includes(p())){let e=ct();return He(),e}if(m(),f(1).kind===68&&f(2).kind!==64||f(1).kind===69)return Ft();throw I()},ft=()=>{for(U(`Module body`),i.expecting=`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`;F(`moduleUnit`);)V(dt());let e=H();return W(),B(`Body`,e)},pt=()=>{U(`variable declaration`);let e=z(L(85));for(i.expecting=`Identifier`,V(G()),i.expecting=`comma or module body`;h(88);)K(88),i.expecting=`Identifier`,V(G());let t=H();return W(),B(`VariableDeclaration`,e,t)},mt=()=>{U(`Parameter declaration`),i.expecting=`CONSTANT`,U(`Parameter declaration item`);let e=B(`ConsDecl`,[z(L(44))]);for(W(),V(e),i.expecting=`Identifier, operator or _`,V(_t()),i.expecting=`,`;h(88);)K(88),i.expecting=`Identifier, operator or _`,V(_t());let t=H();return W(),B(`ParamDeclaration`,t)},ht=()=>{for(U(`Recursive`),i.expecting=`RECURSIVE`,K(79),i.expecting=`Identifier, operator or _`,V(_t()),i.expecting=`,`;h(88);)K(88),i.expecting=`Identifier, operator or _`,V(_t()),i.expecting="`,' or `)'";let e=H();return W(),B(`Recursive`,e)},gt=()=>{for(K(94),i.expecting=`_`,K(92),i.expecting=`comma or )`;h(88);)K(88),i.expecting=`_`,K(92),i.expecting=`comma or )`;K(95)},_t=()=>Be(`Constant declaration items`,()=>{i.expecting=`Identifier, _ or prefix op`;let e=p();if(e===289)return V(G()),i.expecting=`(, comma, or Module Body`,F(`constantArguments`)&>(),`IdentDecl`;if(Mu.includes(e)){let e=st();return i.expecting=`_`,V(e),K(92),`PrefixDecl`}if(e!==92)throw m(),I();let t=z(L(92));i.expecting=`prefix or postfix operator`;let n=p();if(Nu.includes(n)){let e=at();return i.expecting=`_`,V(t),V(e),K(92),`InfixDecl`}if(Pu.includes(n)){let e=ot();return V(t),V(e),`PostfixDecl`}throw m(),I()}),vt=e=>{let t=z(L(93));He(),V(t),i.expecting=e},yt=()=>Be(`Definition`,()=>{if(i.expecting=`LOCAL, Identifier or Operator Symbol`,h(54)&&K(54),L(96),i.expecting=`LOCAL, Identifier or Operator Symbol`,F(`functionDefinition`)){for(V(G()),i.expecting=`[`,K(97),i.expecting=`Identifier`,V(tn()),i.expecting=`COMMA or ]`;h(88);)K(88),i.expecting=`Identifier`,V(tn());let e=z(L(99));return i.expecting=`==`,V(e),vt(`Expression`),V(J()),`FunctionDefinition`}if(F(`postfixDefinition`)){U(`Postfix LHS`);let e=G(),t=z(R(Pu));return W(),V(B(`PostfixLHS`,[e,t])),i.expecting=`==`,vt(`Expression`),V(J()),`OperatorDefinition`}if(F(`infixDefinition`)){U(`Infix LHS`);let e=G(),t=z(R(Nu)),n=G();return W(),V(B(`InfixLHS`,[e,t,n])),i.expecting=`==`,vt(`Expression`),V(J()),`OperatorDefinition`}if(F(`identifierDefinition`)){if(V(St()),i.expecting=`==`,vt(`Expression or Instance`),F(`definitionBody`))return V(J()),`OperatorDefinition`;if(p()===51)return V(Et()),`ModuleDefinition`;throw m(),I()}if(!Mu.includes(p()))throw m(),I();U(`Prefix LHS`);let e=z(R(Mu));i.expecting=`Identifier`;let t=G();return W(),V(B(`PrefixLHS`,[e,t])),i.expecting=`==`,vt(`Expression`),V(J()),`OperatorDefinition`}),bt=()=>{if(U(`Identifier tuple`),K(102),i.expecting=`Identifier or >>`,h(289))for(V(G()),i.expecting=`COMMA or >>`;h(88);)K(88),i.expecting=`COMMA or >>`,V(G()),i.expecting=`COMMA or >>`;K(104);let e=H();return W(),B(`IdentifierTuple`,e)},xt=()=>{let e=p();if(e===289)return Ct();if(Bu.has(e))return wt();throw m(),I()},St=()=>{if(U(`Identifier LHS`),V(G()),i.expecting=`( or ==`,h(94)){for(K(94),i.expecting=`Identifier Declaration, prefix op, _ or )`,V(xt()),i.expecting=`COMMA or )`;h(88);)K(88),i.expecting=`Identifier Declaration, prefix op or _`,V(xt()),i.expecting=`COMMA or )`;K(95)}let e=H();return W(),B(`IdentLHS`,e)},Ct=()=>{if(U(`Identifier Declation`),V(G()),i.expecting=`( or ...`,h(94)){for(K(94),i.expecting=`_`,K(92),i.expecting=`COMMA or )`;h(88);)K(88),i.expecting=`_`,K(92),i.expecting=`COMMA or )`;K(95)}let e=H();return W(),B(`IdentDecl`,e)},wt=()=>Be(`Op. Symbol Declaration`,()=>{let e=p();if(Mu.includes(e))return V(st()),i.expecting=`_`,K(92),`PrefixDecl`;if(e!==92)throw m(),I();K(92),i.expecting=`infix or postfix operator`;let t=p();if(Nu.includes(t))return V(at()),i.expecting=`_`,K(92),`InfixDecl`;if(Pu.includes(t))return V(ot()),`PostfixDecl`;throw m(),I()}),Tt=()=>{U(`Instance`),i.expecting=`LOCAL or instance`;let e=h(54)?z(L(54)):void 0;V(Et()),i.expecting=`COMMA or Module Body`;let t=H();return W(),B(`Instance`,e,t)},Et=()=>{if(U(`NonLocalInstance`),K(51),i.expecting=`Module identifier`,Ve(f(1)),V(G()),i.expecting=`WITH or another definition.`,h(87))for(K(87),i.expecting=``,V(Dt()),i.expecting=``;F(`nextSubstitution`);)K(88),i.expecting=``,V(Dt()),i.expecting=``;let e=H();return W(),B(`NonLocalInstance`,e)},Dt=()=>{U(`Substitution`);let e=p(),t=e===289?G():Mu.includes(e)?st():Nu.includes(e)?at():Pu.includes(e)?ot():void 0;if(t===void 0)throw m(),I();i.expecting=`<-`;let n=z(L(107));i.expecting=`Expression or Op. Symbol`;let r=Zt();return W(),B(`Substitution`,[t,n,r])},Ot=()=>{U(`Assumption`),i.expecting=`ASSUM...`,V(z(R([41,39]))),F(`assumptionName`)&&(h(96)&&L(96),V(G()),i.expecting=`==`,K(93)),He(),i.expecting=`Expression`,V(J());let e=H();return W(),B(`Assumption`,e)},kt=e=>{if(k())return At();if(zu.has(p()))return jt();if(m(),F(e))return J();throw I()},At=()=>{if(U(`Assume-Prove`),h(289)){V(B(`GeneralId`,[Re(),G()])),K(90),V(At());let e=H();return W(),B(`Label`,e)}for(V(z(R([39,40]))),i.expecting=`Expression, Declaration, or AssumeProve`,V(kt(`assumeExpression`)),i.expecting="PROVE or `,'";h(88);)K(88),i.expecting=`Expression, Declaration, or AssumeProve`,V(kt(`nextAssumeExpression`)),i.expecting="PROVE or `,'";V(z(R([76,77]))),i.expecting=`Expression`,V(J());let e=H();return W(),B(`AssumeProve`,e)},jt=()=>{if(U(`NEW symbol declaration`),i.expecting=`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`,F(`constantSymbol`)){if(F(`newConstant`)?(K(56),K(44)):V(z(R([56,44]))),i.expecting=`Constant declaration`,F(`constantDeclaration`)){let e=Ct();if(V(e),h(147)){let t=L(147);if(e.heirs.length>1)throw v(`declared symbol with arguments before \\in at ${_(e)}`);V(z(t)),i.expecting=`Expression`,V(J())}}else if(Bu.has(p()))V(wt());else throw m(),I()}else if(F(`variableSymbol`))h(56)&&K(56),K(85),i.expecting=`Identifier`,V(B(`IdentDecl`,[G()]));else if(F(`levelSymbol`))h(56)&&K(56),V(z(R([80,38,81]))),i.expecting=`Declaration`,V(xt());else throw I();let e=H();return W(),B(`NewSymb`,e)},Mt=()=>{if(U(`Theorem`),i.expecting=`THEOREM, PROPOSITION`,V(z(R([67,58]))),i.expecting=`Identifier, Assume-Prove or Expression`,F(`theoremName`)&&(V(G()),i.expecting=`==`,K(93)),He(),F(`theoremAssumeProve`)){if(!O())throw I();V(At())}else if(F(`theoremExpression`))V(J());else throw I();nt(f(1))&&V(Nt());let e=H();return W(),B(`Theorem`,e)},Nt=()=>{if(i.proofDepth++,i.proofDepth>=100)throw v(`Proofs nested more than 100deep.`);o[i.proofDepth]=-1;let e=ze(`Proof`,()=>{if(f(1).kind===63||f(2).kind===63)return Ft();if(F(`terminalProof`)){let e=h(75)?z(L(75)):void 0;return B(`TerminalProof`,e,[z(R([71,72]))])}if(!F(`stepProof`))throw I();for(F(`proofKeyword`)&&K(75);f(2).kind!==78;)V(zt()),i.expecting=`a proof step`;return V(Lt()),B(`Proof`,H())});if(i.proofDepth<0)throw v(`Parser bug: an extra QED step found.`);return i.proofDepth--,e},Pt=e=>{if(p()===55)K(55),i.expecting=`identifier`,V(G());else{if(m(),!F(e))throw I();V(J())}},Ft=()=>{U(`UseOrHideOrBy`);let e=p(),t=e===63||e===75?`TerminalProof`:`UseOrHide`;if(t===`TerminalProof`)h(75)&&K(75),K(63),h(64)&&K(64);else if(e===68)K(68),h(64)&&K(64);else if(e===69)K(69);else throw m(),I();if(i.expecting="an expression, `MODULE' or `DEF'",F(`usedFacts`))for(Pt(`usedExpression`);h(88);)K(88),i.expecting=`MODULE or expression`,Pt(`nextUsedExpression`),i.expecting=t===`TerminalProof`?`comma, DEF, or [.]`:`comma, DEF, or proof step`;if(h(66))for(K(66),i.expecting=`MODULE or expression`,Pt(`definedExpression`);h(88);)K(88),i.expecting=`MODULE or expression`,Pt(`nextDefinedExpression`),i.expecting=t===`TerminalProof`?`comma or [.]`:`comma or proof step`;let n=H();return W(),B(t,n)},It=e=>{i.expecting=`Step number`;let t=z(R(Fu));if(!rt(i.token))throw v(`${_(t)}: ${e}`);V(t)},Lt=()=>{U(`QED step`),It(`QED step's number has bad level.`),i.expecting=`QED`,V(B(`QEDStep`,[z(L(78))])),nt(f(1))&&V(Nt());let e=H();return W(),B(`ProofStep`,e)},Rt=()=>{let e=f(1).kind;if(e===68||e===69)return[Ft(),!1];if(e===51)return[Et(),!1];if(e===96||e===65)return[Bt(),!1];let t=p();if(t===70)return[Vt(`HaveStep`,70),!1];if(t===74)return[Ut(),!1];if(t===83)return[Wt(),!1];if(t===82)return[Gt(),!0];if(t===42)return[Vt(`CaseStep`,42),!0];if(m(),F(`assertStep`))return[Kt(),!0];throw I()},zt=()=>{U(`Step`),It(`step's number has bad level.`),i.expecting=`proof step`;let e=Rt();if(V(e[0]),nt(f(1))){if(!e[1])throw v(`${_(e[0])}: proof of step that does not take a proof.`);V(Nt())}let t=H();return W(),B(`ProofStep`,t)},Bt=()=>{U(`DefStep`),h(65)&&K(65);do V(yt());while(F(`nextDefinition`));let e=H();return W(),B(`DefStep`,e)},Vt=(e,t)=>{U(e),K(t),i.expecting=`expression`,V(J());let n=H();return W(),B(e,n)},Ht=(e,t,n,r)=>{for(V(e()),i.expecting=t;h(88);)K(88),i.expecting=n,V(e()),i.expecting=r},Ut=()=>{if(U(`TakeStep`),K(74),i.expecting=`identifier`,F(`takeBounds`))Ht(tn,`comma or step`,`identifier or tuple of identifiers`,`comma or proof step`);else if(h(289))Ht(G,`comma or proof step`,`identifier`,`comma or proof step`);else throw I();let e=H();return W(),B(`TakeStep`,e)},Wt=()=>{for(U(`WitnessStep`),K(83),i.expecting=`expression`,V(J());h(88);)K(88),i.expecting=`expression`,V(J()),i.expecting=`comma or colon`;let e=H();return W(),B(`WitnessStep`,e)},Gt=()=>{if(U(`PickStep`),K(82),i.expecting=`identifier`,F(`pickIdentifiers`))Ht(G,`comma, or colon`,`identifier`,`comma or colon`);else if(p()===102||p()===289)Ht(tn,`comma or colon`,`identifier or tuple of identifiers`,`comma or colon`);else throw m(),I();K(89),i.expecting=`expression`,V(J());let e=H();return W(),B(`PickStep`,e)},Kt=()=>{if(U(`AssertStep`),h(84)&&(K(84),i.expecting=`expression or ASSUME/PROVE`),F(`assertedExpression`))V(J());else if(O())V(At());else throw I();let e=H();return W(),B(`AssertStep`,e)},qt=()=>{let e=p();if(e===94)return Qt();if(e===100)return nn();if(e===97)return on();if(e===102)return ln();if(e===59||e===86)return fn();throw m(),I()},Jt=()=>{let e=p();if(e===47||e===49)return $t();if(e===60||e===61)return en();if(e===50)return pn();if(e===42)return gn();if(e===52)return _n();if(e===43)return xn();throw m(),I()},Yt=()=>{let e=z(L(109));if(!F(`decimalPart`))return B(`Number`,[e]);let t=z(L(91));return B(`Real`,[e,t,z(L(109))])},Xt=()=>{for(U(`Optional Arguments`),K(94),V(Zt());h(88);)K(88),V(Zt());K(95);let e=H();return W(),B(`OpArgs`,e)},Zt=()=>{if(F(`operatorArgument`)&&re()){let e=p();if(Mu.includes(e))return B(`GenNonExpPrefixOp`,[Re(),st()]);if(Nu.includes(e)){let e=at();if(e.image===`\\X`||e.image===`\\times`)throw v(`${_(e)}: \\X may not be used as an infix operator.`);return B(`GenInfixOp`,[Re(),e])}if(Pu.includes(e))return B(`GenPostfixOp`,[Re(),ot()]);throw m(),I()}if(F(`lambdaArgument`)&&re())return Sn();if(F(`expressionArgument`))return J();throw I()},Qt=()=>B(`ParenExpr`,[z(L(94)),J(),z(L(95))]),$t=()=>{U(`Quantified form`),V(z(R([47,49])));let e=F(`unboundQuantifier`);if(e)for(V(G());h(88);)K(88),V(G());else if(p()===102||p()===289)for(V(tn());h(88);)K(88),V(tn());else throw m(),I();K(89),V(J());let t=H();return W(),B(e?`UnboundQuant`:`BoundQuant`,t)},en=()=>{for(U(`Bound Quantified Expression`),V(z(R([60,61]))),V(G());h(88);)K(88),V(G());K(89),V(J());let e=H();return W(),B(`UnboundQuant`,e)},tn=()=>{U(`Quant Bound`);let e=p();if(e===102)V(bt());else if(e===289)for(V(G());h(88);)K(88),V(G()),i.expecting=`, or \\in`;else throw m(),I();K(147),V(J());let t=H();return W(),B(`QuantBound`,t)},nn=()=>Be(`Some { } form`,()=>{K(100);let e=F(`setContents`)?rn():`SetEnumerate`;return K(101),e}),rn=()=>{if(ie()){let e=p(),t=e===102?bt():e===289?G():void 0;if(t===void 0)throw m(),I();i.expecting=`\\in`;let n=z(L(147)),r=J();if(i.expecting=`':', ',' or '}'`,p()===89){let e=z(L(89));return V(t),V(n),V(r),V(e),V(J()),`SubsetOf`}if(V(B(`InfixExpr`,[B(`GeneralId`,[Re(),t]),B(`GenInfixOp`,[Re(),n]),r])),p()!==88)return m(),`SetEnumerate`;do K(88),V(J());while(h(88));return`SetEnumerate`}if(F(`setEnumeration`)){for(V(J());h(88);)K(88),V(J());return`SetEnumerate`}if(F(`setOfAll`)){for(V(J()),K(89),V(tn());h(88);)K(88),V(tn());return`SetOfAll`}if(!F(`setExpression`))throw I();let e=J();V(e);let t=p();if(t===89){let t=L(89);if(e.heirs.length>1&&e.kind===`InfixExpr`&&e.heirs[1].heirs[1].image===`\\in`)throw v(`Form {a \\in b : c \\in d }, at line ${t.beginLine}, is not allowed`);for(V(z(t)),V(tn());h(88);)K(88),V(tn());return`SetOfAll`}if(t!==88)return m(),`SetEnumerate`;do K(88),V(J());while(h(88));return`SetEnumerate`},q=e=>{for(V(e());h(88);)K(88),V(e());K(99)},an=(e,t,n)=>()=>{U(e);let r=G(),i=z(L(n)),a=J();return W(),B(t,[r,i,a])},on=()=>Be(`Some [] Form`,()=>{if(K(97),ie()){for(V(tn());h(88);)K(88),V(tn());return K(108),V(J()),K(99),`FcnConst`}if(F(`recordFields`))return q(an(`Field Value`,`FieldVal`,108)),`RcdConstructor`;if(f(2).kind===108&&ed(f(1)))return f(1).kind=289,q(an(`Field Value`,`FieldVal`,108)),`RcdConstructor`;if(F(`recordSets`))return q(an(`Field Set`,`FieldSet`,89)),`SetOfRcds`;if(!F(`bracketExpression`))throw I();V(J());let e=p();if(e===88||e===99){for(;h(88);)K(88),V(J());return K(99),i.lastOperator=Gu,`FcnAppl`}if(e===106)return K(106),V(J()),K(99),`SetOfFcns`;if(e===46){for(K(46),V(sn());h(88);)K(88),V(sn());return K(99),`Except`}if(e===98)return K(98),V(dn()),`ActionExpr`;throw m(),I()}),sn=()=>{U(`Except Spec`),K(105);do V(cn()),i.expecting=`= or ,`;while(p()===91||p()===97||m());K(185),V(J());let e=H();return W(),B(`ExceptSpec`,e)},cn=()=>{U(`Except Component`);let e=p();if(e===91){K(91),Ve(f(1));let e=G();e.image===`@`&&n.push(`@ used in !.@`),V(e)}else if(e===97){for(K(97),V(J());h(88);)K(88),V(J());K(99)}else throw m(),I();let t=H();return W(),B(`ExceptComponent`,t)},ln=()=>Be(`Some << -- >> or >>_ Form`,()=>{if(K(102),F(`tupleContents`))for(V(J());h(88);)K(88),V(J());let e=p();if(e===104)return K(104),`Tuple`;if(e===103)return K(103),V(dn()),`ActionExpr`;throw m(),I()}),un=()=>{let e=G(),t=F(`identifierArguments`)?Xt():void 0;if(h(105)){let n=z(L(105));return V(B(`IdPrefixElement`,[e],t,[n])),un()}return Qe(t),B(`GeneralId`,[B(`IdPrefix`,H()),e])},dn=()=>{U(`restricted form of expression`);let e=p(),t=e===289?un():e===94?Qt():e===100?nn():e===97?on():e===102?ln():void 0;if(t===void 0)throw m(),I();return W(),t},fn=()=>{Qe(void 0),U(`Fairness Expression`);let e=z(R([86,59])),t=dn(),r=`${e.location[0]}`;if(F(`fairnessArguments`)){let a=z(L(94)),o=J(),s=z(L(95));return W(),t.kind===`GeneralId`&&i.fairnessHook!==void 0?B(`FairnessExpr`,[e,B(`OpApplication`,[t,i.fairnessHook]),a,o,s]):Vu.has(String(t.kind))?B(`FairnessExpr`,[e,t,a,o,s]):(n.push(`Error in fairness expression at ${r}: ${e.location[1]}: could not link arguments\n`),t)}if(W(),i.fairnessHook===void 0)throw v(`Ill-structured fairness expression at line ${r}, column ${e.location[1]}`);let a=i.fairnessHook.heirs;return a.length===3?B(`FairnessExpr`,[e,t,...a]):(n.push(`Error in fairness expression at ${r}: ${e.location[1]}\n`),t)},pn=()=>{U(`IF THEN ELSE`);let e=[z(L(50)),J(),z(L(62)),J(),z(L(45)),J()];return W(),B(`IfThenElse`,e)},mn=()=>{let e=f(1);return e.kind===121&&E(e.beginColumn)},hn=(e,t,n)=>{U(e);let r=[n(),z(L(106)),J()];return W(),B(t,r)},gn=()=>{for(U(`CASE Expression`),K(42),V(hn(`Case Arm`,`CaseArm`,J));mn()&&f(2).kind!==57;)K(121),V(hn(`Case Arm`,`CaseArm`,J));mn()&&(K(121),V(hn(`Case Other Arm`,`OtherArm`,()=>z(L(57)))));let e=H();return W(),B(`Case`,e)},_n=()=>{U(`Case Other Arm`);let e=[z(L(52)),vn(),z(L(53)),J()];return W(),B(`LetIn`,e)},vn=()=>{U(`Let Definitions`);do{let e=p();if(e===54||e===96)V(yt());else if(e===79)V(ht());else throw m(),I()}while([54,79,96].includes(p())||m());let e=H();return W(),B(`LetDefinitions`,e)},yn=e=>{U(`Junction Item`);let t=z(R([132,129])),n=J();W();let r=B(e,[t,n]);return et(n,r),r},bn=()=>{let e=f(1);return l.push({isConjunction:e.kind===129,column:e.beginColumn}),Be(`AND-OR Junction`,()=>{let e=F(`disjunctionList`)?`DisjList`:F(`conjunctionList`)?`ConjList`:void 0;if(e===void 0)throw I();let t=e===`DisjList`?`DisjItem`:`ConjItem`;for(V(yn(t));D();)V(yn(t));return l.pop(),e})},xn=()=>{U(`(Un)Bounded Choose`);let e=z(L(43)),t=p(),n=t===289?G():t===102?bt():void 0;if(n===void 0)throw m(),I();U(`Domain binding`),h(147)&&(K(147),i.expecting=`Expression`,V(J()));let r=B(`MaybeBound`,H());W();let a=[e,n,r,z(L(89)),J()];return W(),B(`UnboundOrBoundChoose`,a)},Sn=()=>{U(`Lambda`),K(73),i.expecting=`Identifier`,Ht(G,"`,' or `:'",`Identifier`,"`,' or `:'"),K(89),i.expecting=`Expression`,V(J());let e=H();return W(),B(`Lambda`,e)},Cn=(e,t)=>{Ue(B(e,[Re(),t]),i.lastOperator),We().length!==1&&Ye()},wn=()=>{let e=p();if(ju.includes(e))return Cn(`GenPrefixOp`,it(ju,`PrefixOp`));if(Nu.includes(e))return Cn(`GenInfixOp`,at());throw m(),I()},J=()=>{for(U(`Expression`),i.operatorStack=[],u.push(i.operatorStack);F(`leadingOperator`)&&re();)wn();if(F(`openExpression`)&&re())Ue(Jt());else if(re())Tn();else throw I();W();let e=Xe();if(e===void 0)throw v(` Couldn't reduce expression stack.`);return u.pop(),i.operatorStack=u.at(-1),e},Tn=()=>{if(U(`ExtendableExpr`),F(`junctionList`)&&A())Ue(bn());else if(Ru.has(p()))Ue(qt());else{if(m(),!F(`primitiveExpression`))throw I();Ue(On())}for(;F(`expressionSuffix`);)if(F(`postfixSuffix`)&&re())Cn(`GenPostfixOp`,ot());else if(F(`recordSuffix`)&&re()){let e=z(L(91));if(Ve(f(1)),!re())throw I();Ze(e,G())}else if(F(`applicationSuffix`)&&re()){i.expecting=`function argument`;let e=on();[`GenPrefixOp`,`GenNonExpPrefixOp`,`GenInfixOp`,`GenPostfixOp`,`FcnAppl`].includes(String(e.kind))?(Ue(e,i.lastOperator),We().length!==1&&Ye()):Ue(e)}else throw I();if(F(`expressionContinuation`)){if(F(`infixContinuation`)&&re()){for(Cn(`GenInfixOp`,at());F(`nextLeadingOperator`)&&re();)wn();if(F(`nextOpenExpression`)&&re())Ue(Jt());else if(re())Tn();else throw I()}else if(F(`labelContinuation`)&&re()){let e=z(L(90)),t=We().at(-1)?.node;if(!$e(t))throw v(`\`::' at ${_(e)} does not follow a label.`);We().pop();let n=J(),r=We().at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&We().length>0&&r!==void 0&&i.lastOperator!==void 0&&!Xu(r,i.lastOperator))throw v(`Removing label at ${_(t??B(`Missing`))} would change expression parsing.`);Ue(B(`Label`,[t??B(`Missing`),e,n]))}else throw I()}W()},En=()=>{let e=R([290,291]),t=z(e);if(tt()<0&&i.proofDepth<=0)throw v(`${_(t)}: Step number used outside proof.`);if(e.image[1]===`+`)throw v(`${_(t)}: <+> step number used in an expression.`);return t},Dn=()=>{let e=p();if(e===289)return G();if(e===290||e===291)return En();if(Nu.includes(e))return at();if(Pu.includes(e))return ot();if(m(),!F(`negativeOperator`))throw I();return st()},On=()=>ze(`Primitive expression`,()=>{if(F(`stringLiteral`)&&re())return ze(`String`,()=>z(L(110),`String`));if(F(`numberLiteral`)&&re())return Yt();if(!Lu.has(p()))throw m(),I();let e=Dn(),t=F(`primitiveArguments`)?Xt():void 0;for(;h(105);)V(kn());let n=H();if(n===void 0){let n=B(`GeneralId`,[B(`IdPrefix`,[]),e]);return t?B(`OpApplication`,[n,t]):n}let r=[B(`IdPrefixElement`,[e],t,[n[0].heirs[0]]),...n.slice(0,-1).map((e,t)=>B(`IdPrefixElement`,e.heirs.slice(1),[n[t+1].heirs[0]]))],i=n[n.length-1].heirs,a=B(`GeneralId`,[B(`IdPrefix`,r),i[1]]);return i.length===2?a:B(`OpApplication`,[a,i[2]])}),kn=()=>{if(U(`Bang Extension`),K(105),F(`bangOperand`)){if(F(`bangIdentifier`)&&f(1).image!==`@`)V(G());else{let e=p();if(Mu.includes(e))V(st());else if(Nu.includes(e))V(at());else if(Pu.includes(e))V(ot());else throw m(),I()}F(`bangArguments`)&&V(Xt())}else if(p()===94)V(Xt());else{if(m(),!F(`structureOperator`))throw I();V(An())}let e=B(`IdPrefixElement`,H());return W(),e},An=()=>{let e=ze(`StructOp`,()=>{i.expecting="`<<' , `>>' , `:' , `@' , or number";let e=p();if(e===102||e===104||e===89)return z(L(e),`StructOp`);if(e===109)return Yt();if(m(),f(1).image!==`@`)throw I();return z(L(289),`StructOp`)});if(e.kind===`Real`)throw v(`Illegal structural term at ${_(e)}`);return e.kind===`Number`?B(`StructOp`,[e]):e},jn=()=>{if(He(),h(2))for(L(2);;){let e=p();if(e!==20&&e!==289){m();break}L(e)}ct()};try{jn()}catch(e){if(!(e instanceof g))throw e;n.push(e.message)}return n.length===0?void 0:n.join(`
|
|
112
|
-
`)},rd=(e,t)=>{try{return Al(e)}catch(n){if(!(n instanceof p))throw n;let r=nd(e);throw r===void 0?n:m([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},id=(e,t,n)=>new x(`Applying ${e} to the following value,\nwhich is not ${t}:\n${Y(n)}`),ad=(e,t,n,r)=>new x(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${Y(r)}`),od=e=>P(e)?xn(e):void 0,sd=(e,t,n)=>{let r=Z(e,t,n),i=od(r);if(!i)throw id(n,`a function with a finite domain`,r);return i},cd=(e,t,n)=>{let r=Z(e,t,n),i=od(r);if(!i)throw ad(t===0?`first`:`second`,n,`bag`,r);return i},ld=(e,t)=>{if(!Me(e)||!Yt(e))throw t();return q(e).elements},ud=e=>e.range.every(e=>typeof e==`number`&&e>0),dd=(e,t)=>{let n=e.domain.findIndex(e=>et(e,t));return n===-1?void 0:e.range[n]},fd=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,pd=fd(`BagDiff`,`tlc2.value.impl.Value`,2),md=fd(`SqSubseteq`,`tlc2.value.IBoolValue`,2),hd=fd(`BagUnion`,`tlc2.value.impl.Value`,1),gd=fd(`BagOfAll`,`tlc2.value.impl.Value`,2),_d=fd(`BagCup`,`tlc2.value.impl.Value`,2),vd=fd(`BagCardinality`,`tlc2.value.impl.IntValue`,1),yd=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Nr(e)}`;throw Fr(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},bd=(e,t,n)=>{let r=yd(e,n)+yd(t,n);if(Or(r))throw kr(`${e}+${t}`);return r},xd=(e,t,n,r)=>{let i=dd(n,e.domain[t]),a=yd(e.range[t],r);return i===void 0?a:a-yd(i,r)|0},Sd=(e,t)=>Nt(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>et(e[0],r));a?a[1]=bd(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Cd=$e([],[]),wd=[wr(`EmptyBag`,Cd),Q(`IsABag`,1,e=>{let t=od(Z(e,0,`IsABag`));return t!==void 0&&ud(t)}),Q(`BagCardinality`,1,e=>{let t=Z(e,0,`BagCardinality`);return sd(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw id(`BagCardinality`,`a bag`,t);return bd(e,n,vd)},0)}),Q(`BagIn`,2,e=>{let t=Z(e,1,`BagIn`),n=dd(sd(e,1,`BagIn`),Z(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw ad(`second`,`BagIn`,`bag`,t);return n>0}),Q(`CopiesIn`,2,e=>{let t=Z(e,1,`CopiesIn`),n=dd(sd(e,1,`CopiesIn`),Z(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw ad(`second`,`CopiesIn`,`bag`,t);return n}),Q(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=cd(e,t,`(+)`);if(!ud(n))throw ad(t===0?`first`:`second`,`(+)`,`bag`,Z(e,t,`(+)`));return n});return Sd(t,_d)}),Q(`\\ominus`,2,e=>{let t=cd(e,0,`(-)`),n=cd(e,1,`(-)`);return Nt(t.domain.flatMap((e,r)=>{let i=xd(t,r,n,pd);return i>0?[[e,i]]:[]}))}),Q(`BagUnion`,1,e=>{let t=Z(e,0,`BagUnion`),n=ld(t,()=>id(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??Cd;let r=n.map(e=>{let n=od(e);if(!n)throw new x(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${Y(t)}`);return n});return Sd(r,hd)}),Q(`\\sqsubseteq`,2,e=>{let t=sd(e,0,`\\sqsubseteq`),n=sd(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>xd(t,r,n,md)<=0)}),Tr(`BagOfAll`,2,e=>{let t=Cr(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new x(`The first argument of BagOfAll should be an operator, but instead it is:\n${Y(t.literalBody)}`);let n=Z(e,1,`BagOfAll`),r=od(n);if(!r)throw ad(`second`,`BagOfAll`,`function with a finite domain`,n);return Sd(r.domain.map((e,n)=>$e([t.call([e])],[r.range[n]])),gd)}),Q(`SubBag`,1,e=>{let t=Z(e,0,`SubBag`);if(!P(t))throw new b(`DOMAIN expects a function but received ${Y(t)}`);let n=xn(t),r=Dt(n.range).elements,i=r.find(e=>typeof e!=`number`);if(i!==void 0){let e=typeof r[0]!=`number`;throw new b(`The ${e?`first`:`second`} argument of >= should be an integer, but instead it is:\n${Y(e?r[0]:i)}`)}let a=n.range.filter(e=>typeof e==`number`);if(a.some(e=>e<1))throw new b(`Attempted to apply a function to ${Y(n)}, which is not in its domain`);return Dt(n.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:a[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>$e(e.map(e=>e[0]),e.map(e=>e[1]))))}),Q(`BagToSet`,1,e=>Nn(sd(e,0,`BagToSet`))),Q(`SetToBag`,1,e=>{let t=Z(e,0,`SetToBag`),n=ld(t,()=>id(`BagToSet`,`a function with a finite domain`,t));return $e([...n],n.map(()=>1))})],Td=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Ed=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Dd=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Od=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,kd=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Ad=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,jd=e=>{if(!P(e))return!1;let t=xn(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Md=(e,t)=>Fr(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Nr(t)}`),Nd=(e,t)=>Fr(e,`Cannot cast tlc2.value.impl.${Nr(t)} to tlc2.value.impl.StringValue`),Pd=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Fd=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Md(t,e);return`[${q(e).elements.map(e=>Ld(e,t)).join(`,`)}]`},Id=(e,t)=>{let n=xn(e),r=hn(n);return r?`[${r.map(e=>Ld(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Pd(typeof e==`string`?e:Y(e))}:${Ld(n.range[r],t)}`).join(`,`)}}`},Ld=(e,t)=>typeof e==`string`?Pd(e):typeof e==`object`?e.kind===`ModelValue`?Pd(e.name):Me(e)?Fd(e,t):Id(e,t):String(e),Rd=e=>{if(Me(e))return Fd(e,Td);if(!P(e)||jd(e))throw Md(Td,e);return Id(e,Td)},zd=e=>{if(!P(e))throw Md(Ed,e);return Id(e,Ed)},Bd=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},Vd=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Be(e);if(Array.isArray(e))return Ut(e.map(e=>Vd(e,t)));if(typeof e==`object`&&e)return Wt(Object.entries(e).map(([e,n])=>[Be(e),Vd(n,t)]));throw Fr(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Hd=(e,t)=>{if(e.trim()===``)return Vd(null,t);try{return Vd(JSON.parse(e,(e,t,n)=>typeof t==`number`?Bd(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Fr(t,e.message):e}},Ud=(e,t)=>{if(typeof e!=`string`)throw Nd(t,e);return e},Wd=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Fr(n,`${t} (No such file or directory)`);return r},Gd=e=>[Er(`ToJson`,1,e=>Be(Ld(Z(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Er(`ToJsonArray`,1,e=>Be(Rd(Z(e,0,`ToJsonArray`)))),Er(`ToJsonObject`,1,e=>Be(zd(Z(e,0,`ToJsonObject`)))),Er(`JsonSerialize`,2,t=>{let n=Ud(Z(t,0,`JsonSerialize`),Dd),r=Z(t,1,`JsonSerialize`);if(!hn(r)&&!jd(r))throw new x(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${Y(r)}`);return e.writeFile?.(n,Ld(r,Dd)),!0}),Er(`ndJsonSerialize`,2,t=>{let n=Ud(Z(t,0,`ndJsonSerialize`),Od),r=Z(t,1,`ndJsonSerialize`),i=hn(r);if(!i)throw new x(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${Y(r)}`);return e.writeFile?.(n,i.map(e=>`${Ld(e,Od)}\n`).join(``)),!0}),Er(`JsonDeserialize`,1,t=>{let n=Ud(Z(t,0,`JsonDeserialize`),kd);return Hd(Wd(e,n,kd),kd)}),Er(`ndJsonDeserialize`,1,t=>{let n=Ud(Z(t,0,`ndJsonDeserialize`),Ad);return Ut(Wd(e,n,Ad).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Hd(e,Ad)))})],Kd=(e,t,n,r)=>new x(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),qd=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Kd(t,n,`nonnegative integer`,Y(e));return e},Jd=(e,t,n,r)=>{if(!Me(e)||!Yt(e))throw Kd(t,n,r,Y(e));return q(e).elements},Yd=(e,t,n,r)=>Dt(Array.from({length:t},()=>Dt(e.filter(()=>r.nextDouble()<n)))),Xd=(e,t)=>{let n=`RandomSetOfSubsets`,r=qd(Z(e,0,n),`first`,n),i=qd(Z(e,1,n),`second`,n),a=Jd(Z(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw Kd(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw Kd(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Yd(a,r,a.length===0?0:i/a.length,t.getRandom())},Zd=e=>[Er(`RandomSubset`,2,t=>{let n=Z(t,0,`RandomSubset`);if(typeof n!=`number`)throw Kd(`first`,`RandomSubset`,`nonnegative integer`,Y(n));if(n<0)throw new b(`Attempted to apply the operator overridden by the Java method\npublic static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value),\nbut it produced the following error:\n${n}`);let r=Z(t,1,`RandomSubset`);if(!Me(r)||!cn(r)&&!Yt(r))throw Kd(`second`,`RandomSubset`,`a finite set`,Y(r));return Dt(cu(n,r,e.getRandom()))}),Er(`RandomSetOfSubsets`,3,t=>Xd(t,e)),Er(`TestRandomSetOfSubsets`,3,t=>Ut(Array.from({length:5},()=>q(Xd(t,e)).elements.length)))],Qd=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,$d=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Qd})`,ef=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Qd}) throws java.io.IOException`,tf=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Qd})`,nf=()=>Wt([[`action`,Dt([])],[`state`,Dt([])]]),rf=()=>Wt([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),af=e=>Wt([[`name`,e??`UnnamedAction`],[`location`,rf()]]),of=(e,t)=>{let n=e.map((e,t)=>Ut([t+1,Wt(Object.entries(e.state))])),r=n.slice(1).map((t,r)=>Ut([n[r],af(e[r+1].action),t])),i=t?[Ut([n[n.length-1],af(t.action),n[t.start]])]:[];return Wt([[`action`,Dt([...r,...i])],[`state`,Dt(n)]])},sf=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return pu(e).get(t)},cf=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),Y(r));else throw new x(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${Y(n)}`)},lf=e=>e.every(e=>e!==void 0),uf=(e,t)=>Wt(t.variables.map((t,n)=>[t,e[n]])),df=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!X(e)){if(t.variableIndex.has(r))return!0;let e=os(r,t);if(e&&!n.has(e)&&(n.add(e),df(e.body,t,n)))return!0}return dr(e).some(e=>df(e,t,n))},ff=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[Q(`AssertEq`,2,t=>{let n=Z(t,0,`AssertEq`),r=Z(t,1,`AssertEq`),i=et(n,r);return i||(e(Y(`Assertion failed`,!0)),e(Y(n,!0)),e(Y(r,!0))),i}),Hr(`AssertError`,2,e=>{let t=Cr(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw Fr($d,`In computing AssertError, a non-string expression (line ${t.location.line}, col ${t.location.column}) was used as the err of an AssertError(err, exp).`);let n=Ur(e,0,`AssertError`)();try{Ur(e,1,`AssertError`)()}catch(e){if(e instanceof b)return e.message===n;throw e}return!1}),Er(`TLCGetOrDefault`,2,e=>{let n=Z(e,0,`TLCGetOrDefault`);return sf(t,n)??Z(e,1,`TLCGetOrDefault`)}),{...Tr(`TLCGetAndSet`,4,n=>{let r=Z(n,0,`TLCGetAndSet`),i=sf(t,r)??Z(n,3,`TLCGetAndSet`),a=Cr(n,1,`TLCGetAndSet`);return cf(t,e,r,a.call([i,Z(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Er(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!lf(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Fr(ef,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Ut(t.getBehavior(r).map(e=>uf(e,n.environment)))}),Er(`CounterExample`,0,()=>t.counterExample??nf()),Q(`ToTrace`,1,e=>{let t=Z(e,0,`ToTrace`);if(!P(t)||!et(Nn(t),Dt([`action`,`state`])))throw new b(`The argument of ToTrace should be a CounterExample, but instead it is:\n${Y(t)}`);let n=q(jn(t,`state`)).elements.map(e=>hn(e)??[]);return Ut(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),Q(`TLCModelValue`,1,e=>{let t=Z(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new x(`The argument of ModelValue should be a string, but instead it is:\n${Y(t)}`);return Ze(t)}),Hr(`TLCDefer`,1,()=>!0),Q(`TLCNoOp`,1,e=>Z(e,0,`TLCNoOp`)),Hr(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!lf(r))throw Fr(tf,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||as(Ur(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new te(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Hr(`TLCCache`,2,(e,t)=>{let r=Cr(e,0,`TLCCache`),a=er(Ur(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=df(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),Q(`TLCFP`,1,e=>Number(BigInt.asIntN(32,ql([Z(e,0,`TLCFP`)])))),Er(`TLCEvalDefinition`,1,(e,t)=>{let n=Z(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?os(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new x(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${Y(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new x(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return _c({kind:`Identifier`,name:n,location:r.location},t)})]},pf=(e,t)=>[Er(`_Track`,2,e=>{let n=String(Z(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,Z(e,0,`_Track`)===!0?r+1:r),!0}),Er(`_Counts`,0,()=>fu(t)),Er(`_CheckName`,1,n=>{let r=String(Z(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(Y(fu(t),!0)),!1)}),Er(`_PrintCounts`,0,()=>(e(Y(fu(t),!0)),!0))],mf=e=>String(e).padStart(2,`0`),hf=e=>`${e.getUTCFullYear()}.${mf(e.getUTCMonth()+1)}.${mf(e.getUTCDate())}.${mf(e.getUTCHours())}${mf(e.getUTCMinutes())}${mf(e.getUTCSeconds())}`,gf=e=>Nt([...e].map(([e,t])=>[e,Ut([t])])),_f=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),vf=(e,t,n)=>{if(!e.isStarted&&_f.has(t))throw new b(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return Wt([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Wt([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Wt([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Be(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Be(hf(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return af(void 0);case`all`:return gf(e.registers);case`all:named`:return gf(pu(e))}if(t.startsWith(`s:`)){let n=pu(e).get(t);if(n===void 0)throw new b(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Be(e.properties.get(t.slice(2))??t);throw new b(`TLCGet(${t}) was undefined.`)},yf=e=>e.length===0?[[]]:e.flatMap((t,n)=>yf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),bf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&q(e).elements.forEach(bf),e.kind===`Function`&&e.range.forEach(bf))},xf=(t,n)=>[Q(`Print`,2,e=>(t(`${Oe(Y(Z(e,0,`Print`),!0,!0))} ${Oe(Y(Z(e,1,`Print`),!0,!0))}`),Z(e,1,`Print`))),Q(`PrintT`,1,e=>(t(Oe(Y(Z(e,0,`PrintT`),!0,!0))),!0)),Q(`Assert`,2,t=>{if(Z(t,0,`Assert`)!==!0)throw new x(`The first argument of Assert evaluated to FALSE; the second argument was:\n${Oe(Y(Z(t,1,`Assert`)))}`,e.assertViolation);return!0}),Q(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),Q(`:>`,2,e=>Nt([[Z(e,0,`:>`),Z(e,1,`:>`)]])),Q(`@@`,2,e=>{let t=Sr(e,0,`@@`),n=Sr(e,1,`@@`);return Pt([...I(t),...I(n)])}),Q(`ToString`,1,e=>Be(Y(Z(e,0,`ToString`),!0))),Q(`TLCEval`,1,e=>{let t=Z(e,0,`TLCEval`);return bf(t),t}),Q(`Permutations`,1,e=>{let t=br(e,0,`Permutations`);return Dt(yf(t).map(e=>Nt(t.map((t,n)=>[t,e[n]]))))}),Tr(`SortSeq`,2,e=>{let t=Cr(e,1,`SortSeq`);return Ut(xr(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),Er(`TLCGet`,1,(e,t)=>{let r=Z(e,0,`TLCGet`);if(typeof r==`number`&&r>=0){let e=n.registers.get(r);if(e===void 0)throw new b(`TLCGet(${r}) was undefined.`);return e}if(typeof r!=`string`)throw new b(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${Y(r)}`);return vf(n,r,t?.state)}),Er(`TLCSet`,2,e=>{let r=Z(e,0,`TLCSet`);return cf(n,t,r,Z(e,1,`TLCSet`)),!0}),wr(`Any`,qe),Q(`RandomElement`,1,e=>uu(vr(e,0,`RandomElement`),n.getRandom()))],Sf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),Cf=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],wf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),Tf=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),Ef=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),Df=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
149
|
+
=============================================================================`,Dd=/* @__PURE__ */ new Map([[`Reals`,wd],[`RealTime`,Td],[`Toolbox`,Ed]]),Od=`tlc2/value/impl/`,kd=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},Ad=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),jd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Md=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Ad.get(e[3])}${`[]`.repeat(e[1].length)}`),Nd=(e,t)=>e[e[t].first].text,Pd=(e,t)=>Nd(e,t).replaceAll(`/`,`.`),Fd=e=>{let t=kd(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=Pd(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=Md(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:kd(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()},()=>Pd(n,d.readUint16())):[],p=jd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Md(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}},Id=(e,t)=>{let n=e[t],r=e[n.second];return{className:Nd(e,n.first),name:e[r.first].text}},Ld=(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=Id(t,l());if(n.className!==`${Od}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=Id(t,l()),a=s();if(n.className!==`${Od}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:Nd(t,l()),value:void 0}),e+=3;else if(n===183){let n=Id(t,l()),a=s(),o=s();if(!(n.className===`${Od}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()},Rd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Fd(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:Ld(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},zd=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),Bd=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],Vd=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),Hd=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),Ud=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),Wd=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
113
150
|
Nat == { }
|
|
114
151
|
a+b == {a, b}
|
|
115
152
|
a-b == CHOOSE n : b + n = a
|
|
@@ -425,15 +462,18 @@ _CheckName(name) ==
|
|
|
425
462
|
=> (PrintT(counts) /\\ FALSE)
|
|
426
463
|
_PrintCounts == PrintT(_Counts)
|
|
427
464
|
=============================================================================
|
|
428
|
-
`]]),Of=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCGet`,`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),kf=(e,t)=>e.every(e=>yn(e,t)),Af=Dt([!1,!0]),jf=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Mt(jf(e,t,r),jf(e,r,n))},Mf=[`\\cup`,`\\cap`,`\\`],Nf=e=>typeof e==`object`&&e.kind===`MixedSet`,Pf=e=>e.kind===`Interval`?q(e).elements:e.elements,Ff=(e,t,n)=>{let r=Pf(t);if(e!==`\\cup`){let t=e===`\\cap`;return Ot(r.filter(e=>yn(e,n)===t))}if(r.length===0)return n;if(!Ne(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=q(n).elements.filter(e=>!yn(e,t));return Ot([...r,...i])},If=[wr(`TRUE`,!0),wr(`FALSE`,!1),wr(`BOOLEAN`,Af),wr(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Dr(`=`,Tt),Dr(`#`,(e,t)=>!Tt(e,t)),Q(`~`,1,e=>!gr(e,0,`~`)),Q(`<=>`,2,e=>gr(e,0,`<=>`)===gr(e,1,`<=>`)),Q(`/\\`,2,e=>gr(e,0,`/\\`)&&gr(e,1,`/\\`)),Q(`\\/`,2,e=>gr(e,0,`\\/`)||gr(e,1,`\\/`)),Q(`=>`,2,e=>!gr(e,0,`=>`)||gr(e,1,`=>`)),Q(`\\in`,2,e=>yn(Z(e,0,`\\in`),Z(e,1,`\\in`))),Q(`\\notin`,2,e=>!yn(Z(e,0,`\\notin`),Z(e,1,`\\notin`))),Q(`\\subseteq`,2,e=>{let t=_r(e,0,`\\subseteq`),n=Z(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&Yt(t.base)?kf(q(t.base).elements,n.base):kf(q(t).elements,n)}),...Mf.map(e=>Q(e,2,t=>{let n=Z(t,0,e),r=Z(t,1,e);if(Ne(n)&&Ne(r)&&!Nf(n)&&!Nf(r)){if(e===`\\cup`&&cn(n))return r;let t=e===`\\cup`?Mt:e===`\\cap`?jt:At;try{return t(q(n),q(r))}catch(e){if(!(e instanceof b))throw e}}return Ne(n)?Ff(e,n,r):e!==`\\`&&Ne(r)?Ff(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),Q(`SUBSET`,1,e=>({kind:`Subset`,base:_r(e,0,`SUBSET`)})),Q(`UNION`,1,e=>{let t=_r(e,0,`UNION`),n=pt(t)?t.elements.filter(pt):[];if(!pt(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(Nf(t)||n.some(Nf)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{yn(t,e)||e.elements.push(t)})),Ot(e.elements)}return n.length===0?kt:jf(n.map(q),0,n.length)}),Q(`DOMAIN`,1,e=>{let t=Z(e,0,`DOMAIN`);if(!P(t))throw new b(`DOMAIN expects a function but received ${Y(t)}`);return Nn(t)})],Lf=Rr(`Integers`,`Neg`,`IntValue`,1),Rf=e=>{let t=Rr(e,`DotDot`,`IntervalValue`,2);return[zr(e,`+`,`Plus`,(e,t)=>e+t),zr(e,`-`,`Minus`,(e,t)=>e-t),zr(e,`*`,`Times`,(e,t)=>e*t),zr(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new x(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new x(`0^0 is undefined.`);return e**t}),zr(e,`\\div`,`Divide`,(e,t)=>{if(t===0)throw new x(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(Or(n))throw kr(`${e} \\div ${t}`);return n}),zr(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new x(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),Q(`..`,2,e=>({kind:`Interval`,low:Lr(Z(e,0,`..`),t),high:Lr(Z(e,1,`..`),t)}))]},zf=[wr(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Rf(`Naturals`),Vr(`<`,(e,t)=>e<t),Vr(`>`,(e,t)=>e>t),Vr(`<=`,(e,t)=>e<=t),Vr(`>=`,(e,t)=>e>=t)],Bf=[wr(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Rf(`Integers`),Q(`-.`,1,e=>{let t=Lr(Z(e,0,`-`),Lf);if(Or(-t))throw kr(`-${t}`);return-t})],Vf=(e,t,n)=>{let r=Z(e,t,n),i=hn(r);if(!i)throw new x(`${n}\n${Y(r)}`);return i},Hf=(e,t,n)=>{let r=Z(e,t,n);return typeof r==`string`?r:Vf(e,t,n)},Uf=(e,t,n)=>typeof e==`string`?Be(e.slice(t,n)):Ut(e.slice(t,n)),Wf=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Gf=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Kf=(e,t)=>{let n=Of.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Ir(e,t):e}):t},qf=Kf(`Sequences`,[Q(`Seq`,1,e=>({kind:`SequenceSet`,base:Z(e,0,`Seq`)})),Q(`Len`,1,e=>Hf(e,0,Wf(``,`Len`)).length),Q(`\\o`,2,e=>{let t=Hf(e,0,Gf(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Vf(e,1,Gf(`t \\o s`,`sequence`));return Ut([...t,...n])}let n=Z(e,1,`\\o`);if(typeof n!=`string`)throw new x(`${Gf(`t \\o s`,`string`)}\n${Y(n)}`);return Be(t+n)}),Q(`Append`,2,e=>Ut([...Vf(e,0,Gf(`Append(s, v)`,`sequence`)),Z(e,1,`Append`)])),Q(`Head`,1,e=>{let t=Vf(e,0,Wf(``,`Head`));if(t.length===0)throw new x(`Attempted to apply Head to the empty sequence.`);return t[0]}),Q(`Tail`,1,e=>{let t=Hf(e,0,Wf(``,`Tail`));if(t.length===0)throw new x(`Attempted to apply Tail to the empty sequence.`);return Uf(t,1)}),Q(`SubSeq`,3,e=>{let t=Hf(e,0,Wf(`first `,`SubSeq`)),n=hr(e,1,`SubSeq`),r=hr(e,2,`SubSeq`);if(n>r)return Uf(t,0,0);let i=n<1?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new x(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${Y(Z(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Uf(t,n-1,r)}),Tr(`SelectSeq`,2,e=>{let t=Cr(e,1,`SelectSeq`);return Ut(Vf(e,0,Wf(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new x(`The second argument of SelectSeq should be a operator, but instead it is:\n${Y(n)}`);return n}))})]),Jf=Kf(`FiniteSets`,[Q(`IsFiniteSet`,1,e=>{let t=Z(e,0,`IsFiniteSet`);if(Me(t))return pn(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new b(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${Y(t)}\nis a finite set.`:`Attempted to check if the ${Fe(t)} ${Y(t)} is a finite set.`)}),Q(`Cardinality`,1,e=>{let t=Z(e,0,`Cardinality`);if(!Me(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new x(`Attempted to compute cardinality of the value\n${Y(t)}`);return dn(t)})]),Yf=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Xf=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:zf};case`Integers`:return{extends:[`Naturals`],operators:Bf};case`Sequences`:return{extends:[],operators:qf};case`FiniteSets`:return{extends:[],operators:Jf};case`TLC`:return{extends:[],operators:Kf(`TLC`,xf(t,n))};case`Randomization`:return{extends:[],operators:Zd(n)};case`_Possible`:return{extends:[],operators:pf(t,n)};case`Json`:return{extends:[],operators:Gd(r)};case`Bags`:return{extends:[],operators:wd};case`TLCExt`:return{extends:[],operators:ff(t,n)};default:return}},Zf=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),Qf={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},$f=(e,t)=>{let n=Qf[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},ep=`$subexpression`,tp=(e,t)=>new p(`${e} at line ${t.line}, column ${t.column}`),np=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return np(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of dr(e)){let e=np(r,t,n);if(e)return e}},rp=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),ip=(e,t)=>{let n=e.location,r=rp(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw tp(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw tp(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:ep,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:ep,args:e.args,location:n,resolution:ti},location:n}},ap=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:ti})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ti}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ti};return ip({...t,params:[...t.params,...r]},a)},op=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw tp(r,i);ri.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:_(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw tp(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>ya(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw tp(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=ci(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw tp(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&np(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw tp(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||Oi(t.operand,1)!==0)throw tp(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=Mi(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[Oi(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw tp(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=Oi(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw tp(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw tp(`Unexpected subexpression selector`,i);let s=r?r.sets:Ni(n),c=s?.[Oi(t.operand,s.length)];if(!c)throw tp(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return ap(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw tp(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return ap(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw tp(`Subexpression selection failed`,i);return ip(a,o.current)},sp=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return ki(e,t,n)},cp=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||dr(e).some(cp),lp=(e,t,n,r=!1)=>{if(!cp(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n);return Sa(e,e=>lp(e,r,n))}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>lp(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Sa(e,e=>lp(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?sp(a.name,[],void 0,t):a.kind===`Apply`?sp(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n.has(s.name))return a;let c=op(o,t,a,r);return c!==a&&ni.add(c),c},up=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},dp=(e,t)=>{let n=up(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({...e,expression:lp(e.expression,n,/* @__PURE__ */ new Set,!0)}))}},fp=(e,t)=>{let n=up([...t,...e.definitions]);if(!(e.definitions.some(e=>cp(e.body))||e.assumptions.some(e=>cp(e.expression))))return e;let r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[]));return{...e,definitions:e.definitions.map(e=>xa(e,e=>lp(e,n,r))),assumptions:e.assumptions.map(e=>({...e,expression:lp(e.expression,n,r)}))}},pp=(e,t)=>`${e}${t}`,mp=(e,t,n)=>`${e}${t}${n}`,hp=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},gp=(e,t,n)=>`${e},${t},${n}`,_p=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),vp=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),yp=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),bp=(e,t,n,r)=>({..._p(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),xp=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Sp=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Cp=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...bp(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),wp=bp(`$Set`,0,[2],[1]),Tp=bp(`$Junction`,0,[3],[1]),Ep=bp(`$Choose`,0,[2],[1]),Dp=bp(`$Function`,0,[3],[1]),Op=bp(`$FcnApply`,0,[2,2],[1,1]),kp=bp(`$RcdSelect`,0,[2,0],[1,1]),Ap=bp(`'`,2,[1],[0]),jp=bp(`ENABLED`,1,[2],[0]),Mp=bp(`[]`,3,[3],[0]),Np=bp(`$SquareAct`,2,[2,1],[0,0]),Pp=bp(`$WF`,3,[1,2],[0,0]),Fp=bp(`$TemporalExists`,3,[3],[0]),Ip=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Lp=e=>e.map(e=>({name:e,arity:0})),Rp=(e,t)=>t.location.range?v(`${e}.`,t.location.range):new p(`${e} at line ${t.location.line}, column ${t.location.column}`),zp=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Bp=e=>e.kind!==`Let`&&e.kind!==`Label`,Vp=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=v(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Cp.get(t)??Zf.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=_p(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(mp(e,n,t))}),t.data.constraints.forEach((e,t)=>vp(r.constraints,t,e)),yp(r.argConstraints,pp(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>yp(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>xp(e,n))throw new p(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new p(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(gp(t,n,r)),s=_p(Math.max(e.level,...t.filter((t,n)=>Sp(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{Sp(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>vp(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||vp(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>vp(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||vp(s.constraints,t,xp(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>vp(s.constraints,e,xp(r,a)))}))}),e.argParams.forEach(e=>{let t=hp(e),n=a(t.operator)?.operator;n&&vp(s.constraints,t.param,xp(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>yp(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>yp(s.argConstraints,pp(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&yp(s.argConstraints,pp(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=hp(e),n=a(t.operator);n&&yp(s.argConstraints,pp(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(hp(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=hp(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(mp(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(mp(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(mp(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,Lp(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=_p();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=Ip(n,Lp(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),l=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Rp(`Formula has both temporal formula and action as arguments`,t)},u=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Rp(`Action used where only temporal formula or state predicate allowed`,e);zp.has(e.operator)&&l(t,e)},d=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Bp(n)&&n.kind!==r)throw Rp(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},f=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=v(e,n);t.constraints.forEach((e,t)=>vp(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>yp(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof p)||t.sany?t:Rp(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return _p();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return u(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return l(n,e),i(Tp,n)}case`Prime`:case`Unchanged`:return s(Ap,[e.expression],t);case`Enabled`:return s(jp,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return d(e,n.data.level),i(Mp,[n])}case`If`:return s(Tp,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Tp,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return f(e,t);case`Forall`:case`Exists`:{let n=s(Tp,[e.body],t,e.bounds.map(e=>e.set),bi(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Rp(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?Fp:Tp,[e.body],t,[],e.names);case`Choose`:return s(Ep,[e.body],t,e.set?[e.set]:[],yi(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(wp,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(wp,[e.predicate],t,[e.bound.set],yi(e.bound.pattern));case`SetMap`:return s(wp,[e.expression],t,e.bounds.map(e=>e.set),bi(e.bounds));case`FunctionConstruction`:return s(Dp,[e.body],t,e.bounds.map(e=>e.set),bi(e.bounds));case`Record`:return s(Dp,e.fields.map(e=>e.value),t);case`RecordSet`:return s(wp,e.fields.map(e=>e.value),t);case`Except`:return s(wp,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Op,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(wp,e.args,t)}]);case`FieldAccess`:return i(kp,[a(e.record,t),{data:_p()}]);case`BoxAction`:case`AngleAction`:return s(Np,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(Pp,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return _p()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return dr(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Ip(t,Lp(e.names))),i;default:return Sa(e,(e,n)=>(a(e,r,Ip(t,Lp(n))),e)),i}},_=(e,t,n,r)=>{let i=Ip(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={..._p(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(pp(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(mp(e.name,n,t.name))).map(e=>gp(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(hp(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=hp(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{..._p(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:a}},Hp=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?Hp(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=_p(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>vp(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>yp(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},Up=(e,t,n,r)=>{let i=Vp(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Hp(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=_(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:_(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=fa([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?Hp(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw m(n)}})),...n],r);if(l.length>0)throw m(l,!1,void 0,r)},Wp=(e,t)=>e.maxLevels[t]??3,Gp=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Vp({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>vp(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>vp(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>yp(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=hp(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&vp(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(Hp(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=_(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(pp(e.name,i));a!==void 0&&Wp(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=hp(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=Wp(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw m([...r.values()])}},Kp=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],qp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Jp=new Map(Cf.flatMap(e=>e.map(t=>[t,e[0]]))),Yp=e=>Jp.get(e)??e,Xp=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Zp=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(Xp(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},Qp=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),$p=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Yp(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Yp(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},em=(e,t)=>{let n=[];for(let r=t;;){let t=$p(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},tm=e=>({line:e.line,column:e.column}),nm=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(a.text===`EXTENDS`){let n=em(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}return{references:s,end:e.length}};return i(0,t??``).references},rm=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,im={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},am=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&rm(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&rm(e[n+1],e[n+2])?n+=rm(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>im[e])}"`:r.text)}return t},om=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},sm=(e,t)=>e.find(e=>e.name===t)??e.map(e=>sm(e.modules,t)).find(Boolean),cm=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:Df.get(i)??t?.(i)??Ol(e,i),s=o===void 0?[]:fe(o),c=om(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Al(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>sm(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},lm=(e,t,n)=>{let r=cm(e,t),i=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=em(t,e+1);r.push({location:tm(t[e]),apply:e=>i.forEach(t=>e.put(Qp(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:tm(u),apply:t=>t.put(Qp(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&em(t,l+1).every(e=>s.has(e))&&a(l,`definition`),qp.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(tm(u)),r.push({location:tm(u),apply:e=>e.put(Qp(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(Qp(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=Yp(e.name);r.push({location:e.location,apply:n=>n.put(Qp(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(Qp(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(Qp(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>si(e.location,t.location)?-1:+!!si(t.location,e.location))},a=/* @__PURE__ */ new Map,o=e=>{let t=a.get(e??``);if(t)return t;let n=Zp();a.set(e??``,n),Sf.toReversed().forEach(e=>n.put(Qp(e,`builtin`,!1)));let s=r(e);return s.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||n.put(e)})),i(s).forEach(e=>e.apply(n)),n};return o(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse()},um=(e,t,n)=>{let r=cm(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),wf.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=nm(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),m=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?m(n,r,t):[n,i]};return t},g=h(e=>e.extends),_=h(e=>e.instances),v=/* @__PURE__ */ new Set([void 0]),y=/* @__PURE__ */ new Map;am(s(void 0)).forEach((e,t)=>{t===3&&Ef.forEach(a),a(e)});let b=u(void 0);for(;;){let e=g(b,/* @__PURE__ */ new Set)??_(b,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;f.add(`${t.key}>${n}`),y.set(t.unit,[...y.get(t.unit)??[],n]),!v.has(n)&&(v.add(n),am(s(n)).forEach(a))}Kp.forEach(a);let x=/* @__PURE__ */ new Set,S=e=>{if(x.has(e))return;x.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(S),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return S(void 0),Tf.forEach(a),[...i]},dm=t=>{switch(t.kind){case`Number`:try{return F(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Ze(t.name);case`Set`:return Dt(t.elements.map(dm))}},fm=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],pm=e=>new p(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),mm=(e,t)=>e.location.range&&t.location.range&&{location:_(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${_(t.location.range)}.`},hm=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,gm=e=>e===`Theorem`?`ThmOrAssumpDefNode`:hm(e),_m=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:ti},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),vm=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>Y(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new b(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&et(t,r)})});if(t)return t[1];throw new b(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:Y(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},ym=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||dr(e).some(e=>ym(e,t)),bm=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ja(e),n.get(e)??n.size)),n},xm=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Sm=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw $o(e);if(e.kind===`Number`&&!Hs(e.value))throw es(e);Sm(e.kind===`Let`?[...dr(e),...xm(e.instances??[])]:dr(e))}),Cm=(e,t)=>{let n=Al(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(If.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,c=du(e.checkDeadlock,t.seed),l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Map,f=[],g=/* @__PURE__ */ new Map,v=[],S=[],C=(e,t)=>v.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),w={value:0},T=e=>`${e}#${w.value++}`,ee=[],te=[],ne=Gp(e=>{let t=d.get(e)??j(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>r.get(t.visible.get(e)?.key??e)}}),E=/* @__PURE__ */ new Map,re=/* @__PURE__ */ new Map,D=e=>{let n=s.get(e);if(n)return n;let r=Xf(e,t.print,c,t.files);if(!r)return;let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>D(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{o.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Zf.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:$f(e,t.name)??i.get(t.name)?.range})}),s.set(e,i),i},O=e=>{let t=D(e),n=Yf.get(e)??[];return t&&C(e,n),t&&n.includes(`Integers`)&&D(`Integers`),t},k=e=>(Sm([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...xm(e.instances)]),e.modules.forEach(k),e);k(n);let A=(e,n)=>{let r=t.loadModule?.(e)??Zc.get(e)??Ol(t.source,e);if(r===void 0)throw m([{location:`In module ${n}`,message:`Cannot find source file for module ${e} imported in module ${n}.`}],!0);let i=rd(r,e);if(i.name!==e)throw m([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return k(i)},ie=e=>{let t=S.indexOf(e.name);if(t!==-1)throw new p(`Circular dependency among .tla files; dependency cycle is: ${[...S.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];S.push(e.name),v.push(n);let o=fe(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:te,levelChecks:a});if(v.pop(),S.pop(),i.length>0)throw m(i,!1,void 0,te);let s=r.find(e=>n.has(e.name)),c=s&&l.get(s.name),u=c&&mm(s,c.module);if(u)throw m([u],!1,void 0,te);if(s)throw pm(s);return a.forEach(e=>e()),{linked:o,closure:n}},j=(e,t)=>{let n=l.get(e);if(n)return C(e,g.get(e)??[]),n;let r=ie(A(e,t));return l.set(e,r.linked),g.set(e,r.closure),C(e,r.closure),r.linked},ae=(e,t,n,o,s)=>{let c=s?void 0:O(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}]));let l=s??j(e.module,t.name);l.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let u=fm(l),d=`#${w.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=da(dp(e,t),u,t,n);ee.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=Ua({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,ga(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=T(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:T}),h=new Set(u.map(e=>e.name)),g=/* @__PURE__ */ new Map;return l.exported.forEach((t,n)=>{if(h.has(n))return;if(e.name===void 0){let r=m.getKey(t.key);u.length>0&&E.set(r,{name:n,location:e.location}),g.set(n,{key:r,arity:t.arity,params:t.params,kind:t.kind,range:i.get(t.key)===!0?e.location.range:t.range});return}let r=m.getQualifiedKey(t.key);u.length>0&&E.set(r,{name:`${e.name}!${n}`,location:e.location}),re.set(r,`${e.name}!${n}`),g.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length,params:t.params&&[...e.params.map(e=>e.arity),...t.params],kind:t.kind})}),g},oe=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:ti})),se=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:oe(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ce=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),le=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=ce(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:oe(r,n),location:n}}},ue=(e,t,n,a)=>{let o=e.location,s=a?void 0:O(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=ce(n.arity);return se(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??j(e.module,n),l=`#${w.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=fm(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};ee.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>ym(f(e),p),h=d.map(t=>{let n=le(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=Ua({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:oe(e.params,o),location:o,resolution:ti}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:ti}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:_m(a,i)),i},createName:T}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=ce(n.arity),a=[...e.params,...i];return se(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},de=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),fe=(e,a)=>{let o=al(e,t.loadClass?.(e.name)),s=ee.length,c=new Map([...If.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...a.symbols]),l={location:ca,errors:[],warnings:[]},p=[l],m=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){c.set(t,e),h.set(t,e);return}if(!n.range||!e.range||_(n.range)===_(e.range))return;let r=_(e.range),i=_(n.range);gm(n.kind)===gm(e.kind)?l.warnings.push({location:r,message:`Warning: the ${hm(n.kind)} of '${t}' conflicts with \nits ${hm(n.kind)} at ${i}.`}):l.errors.push({location:r,message:`The ${hm(e.kind)} of '${t}' conflicts with \nits ${hm(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,v=/* @__PURE__ */ new Map,y=[],b=[...o.constants],x=o.variables.map(e=>e.name),S=o.variables.map(e=>e.location);o.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:O(e);if(n){m(n);return}let r=t??j(e,o.name);b.push(...r.constants.filter(e=>b.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{x.includes(e)||(x.push(e),S.push(r.variableLocations[t]))}),m(r.exported),r.facts.forEach(e=>g.add(e)),r.modules.forEach((e,t)=>v.set(t,e)),y.push(r)});let C=new Map(c),w=[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))],T=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});w.forEach(e=>h.set(e.name,T(e)));let E=e=>({key:k(e),arity:ci(e),params:li(e),kind:la(o,e)?`Theorem`:`Definition`,range:e.location.range}),D=b.length===0&&x.length===0,k=e=>o===n?e.name:`${e.name}@${a.id}`,A=/* @__PURE__ */ new Map,ie=e=>({imported:c,bound:C,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:k,instanced:A,facts:g,reports:p,warnings:a.warnings}),oe=()=>new Map([...a.modules,...v]),se=e=>new Map([...c,...w.filter(t=>si(t.location,e)).map(e=>[e.name,T(e)]),...o.definitions.filter(t=>si(t.location,e)).map(e=>[e.name,E(e)])]),ce=e=>{let t=oe(),n=t.get(e.name),r=n&&mm(e,n.module);if(n&&!r)throw pm(e);a.nested.push(e);let i={location:e.location,errors:[],warnings:[]};p.push(i);let o=fe(e,{id:`${a.id}/${e.name}`,symbols:se(e.location),modules:t,nested:a.nested,errors:i.errors,warnings:i.warnings,levelChecks:a.levelChecks});r&&i.errors.push(r),n||v.set(e.name,o),u.has(e.name)||u.set(e.name,o)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=ae(e,o,ie(o),D,oe().get(e.module));A.set(e,t),t.forEach((t,n)=>{c.has(n)||(c.set(n,t),e.isLocal||h.set(n,t))})}})),...o.modules.map(e=>({location:e.location,link:()=>ce(e)}))].sort((e,t)=>si(e.location,t.location)?-1:1).forEach(e=>e.link());let le=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&si(e.location,t.location)},pe=e=>{let t=o.modules.find(t=>t.name===e.module);return t?le(t)?v.get(t.name):void 0:oe().get(e.module)},M=fp(qa(o,(e,t)=>ue(e,t,o.name,pe(e))),de(c));a.errors.push(...pa(M,ie(M))),M.definitions.forEach(e=>{let t=k(e);r.set(t,e),i.set(t,!D);let n=E(e);c.set(e.name,n),e.isLocal||h.set(e.name,n)});let me={module:M,constants:b,variables:x,variableLocations:S,visible:c,exported:h,modules:v,extended:y,facts:/* @__PURE__ */ new Set([...g,...[...M.theorems,...M.assumptions].flatMap(e=>e.name??[])])};d.has(o.name)||d.set(o.name,me);let he=ee.splice(s).map(e=>({location:e.location,check:()=>ne(e)}));return a.levelChecks.push(()=>Up(M,{constants:new Set(b.map(e=>e.name)),variables:new Set(x),getDefinition:e=>r.get(c.get(e)?.key??e),getQualifiedName:e=>re.get(c.get(e)?.key??e)},he,te)),f.push(me),me},pe=ie(n).linked;te.length>0&&t.print(h(te));let M=e=>pe.visible.get(e)?.key??e;pe.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let me=[],he=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>he(e,t)),me.push(...e.module.assumptions))};he(pe,/* @__PURE__ */ new Set);let ge=pe.constants.map(e=>e.name),_e=pe.variables,ve=e=>e.module===void 0?[e.name,M(e.name)]:e.module===n.name||ge.includes(e.name)?[]:[(l.get(e.module)??u.get(e.module))?.visible.get(e.name)?.key??e.name],ye=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:pe.constants.find(t=>t.name===e)?.arity??0},be=/* @__PURE__ */ new Map,xe=/* @__PURE__ */ new Set,Se=(e,t)=>{o.set(e,t),r.delete(e),be.delete(e),xe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=dm(e.value);ve(e).forEach(e=>{let n=ye(e);n===0?be.set(e,t):Se(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ce=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ce.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new y(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(dm),dm(e.value)]),Ce.set(t,n)}),Ce.forEach(e=>ve(e).forEach(t=>Se(t,vm(e.name,ye(t)||e.rows[0][0].length,e.rows))));let we=new Map(e.substitutions.flatMap(e=>ve(e).map(t=>[t,M(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!ge.includes(n)&&!pe.visible.has(n))throw new y(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new y(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=M(i),s=r.get(a);if(!(s!==void 0||o.has(a)||be.has(a)||ge.includes(i)||_e.includes(i)))throw new y(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(pe.constants.find(e=>e.name===n)?.arity??pe.visible.get(n)?.arity))throw new y(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let Te=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(ve)),Ee=(e,t)=>{if(Te.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&Ee(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=Ee(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=se(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),pe.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let De=ge.filter(e=>!be.has(e)&&!we.has(e)&&!xe.has(e));if(De.length>0)throw new y(`The constant parameter ${lm(t.source,t.loadModule,`constant`).find(e=>De.includes(e))??De[0]} is not assigned a value by the configuration file.`);let Oe={runtime:c,definitions:r,builtins:o,constants:be,substitutions:we,variables:_e,variableIndex:bm(_e,f.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap},ke=Vp({constants:new Set(be.keys()),variables:/* @__PURE__ */ new Set([..._e,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>os(e,Oe)}),N=e=>{try{_c(e,{environment:Oe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof b)return e;throw e}};return we.forEach((e,t)=>{let n=r.get(e),i=ge.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&ke.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?N(n.body):void 0;if(i)throw new y(`The configuration file substitutes constant ${t} with non-constant ${e}${i instanceof x?``:` - specifically: ${i.message}`}`)}),c.isStarted=!0,{environment:Oe,assumptions:me,variableLocations:pe.variableLocations,instanceActions:E}},wm={kind:`Boolean`,value:!0},Tm={kind:`Boolean`,value:!1},Em=e=>e?wm:Tm,Dm=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Om=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,km=(e,t)=>({kind:e,body:t}),Am=(e,t,n)=>({kind:e,operands:[t,n]}),jm=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?jm(e,t.operands).operands:[t])}),Mm=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Mm(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Mm(t)),0)}},Nm=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return Nm(e.body);case`And`:case`Or`:return e.operands.some(Nm)}},Pm=/* @__PURE__ */ new WeakMap,Fm={count:0},Im=e=>{let t=Pm.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${Fm.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Im).join(`,`)})`;default:return`${e.kind}(${Im(e.body)})`}})();return Pm.set(e,n),n},Lm=(e,t)=>e===t||Im(e)===Im(t),Rm=(e,t)=>{let n=Im(t);return e.some(e=>e===t||Im(e)===n)},zm=e=>e===`And`?`Or`:`And`,Bm=(e,t)=>{switch(e.kind){case`Boolean`:return t?Em(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?km(`Not`,e):e;case`Not`:return Bm(e.body,!t);case`And`:case`Or`:return jm(t?zm(e.kind):e.kind,e.operands.map(e=>Bm(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return km(n,Bm(e.body,t))}}},Vm=e=>{switch(e.kind){case`Boolean`:return Em(!e.value);case`Not`:return e.body;case`And`:case`Or`:return jm(zm(e.kind),e.operands.map(Vm));case`Always`:return km(`Eventually`,Vm(e.body));case`Eventually`:return km(`Always`,Vm(e.body));default:return km(`Not`,e)}},Hm=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Hm(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Em(t)}return n.length===0?Em(!t):n.length===1?n[0]:jm(e.kind,n)}case`Not`:{let t=Hm(e.body);return t.kind===`Boolean`?Em(!t.value):km(`Not`,t)}case`Always`:case`Eventually`:{let t=Hm(e.body);return km(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Um=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Wm=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Wm(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new b(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>jm(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Wm(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Um(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:jm(`Or`,t);n.push(km(`Always`,km(`Eventually`,e)))}return jm(`Or`,n)}case`Not`:return Dm(e.body)?e:Wm(Vm(e.body));default:return e}},Gm=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Gm(e.operands[0]):jm(e.kind,e.operands.map(Gm));case`Not`:return e.body.kind===`Not`?Gm(e.body.body):km(`Not`,Gm(e.body));case`Always`:case`Eventually`:case`Next`:return km(e.kind,Gm(e.body));default:return e}},Km=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Km(e.operands[0]);let t=Math.floor(e.operands.length/2);return Am(e.kind,Km(jm(e.kind,e.operands.slice(0,t))),Km(jm(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return km(e.kind,Km(e.body));default:return e}},qm=(e,t)=>{e.kind===`Eventually`&&!Rm(t,e)&&t.push(e),`body`in e&&qm(e.body,t),`operands`in e&&e.operands.forEach(e=>qm(e,t))},Jm=e=>{let t=e.filter(Om),n=e.flatMap(e=>e.kind===`Not`&&Om(e.body)?[e.body]:[]);return!t.some(e=>Rm(n,e))},Ym=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,km(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new b(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Xm=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:km(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Zm=(e,t,n)=>e.flatMap(e=>{let r=Xm(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Qm=e=>[...new Set(e.map(Im))].sort().join(`|`),$m=(e,t)=>{let n=new Set(t.map(Qm));return[...e.filter(e=>!n.has(Qm(e))),...t]},eh=e=>{let t=Ym(e),n=Zm(t,`Always`,`And`),r=Zm(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Xm(t,`Eventually`,`Or`);if(n&&!(Rm(e,n.first)||Rm(e,n.second)))return $m(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Rm(e,t.first)||Rm(e,t.second))&&!Rm(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Jm(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Xm(t[e],`Always`,`And`);n&&(Rm(t,n.first)||t.push(n.first),Rm(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)Rm(t,e.first)&&Rm(t,e.second)&&!Rm(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Jm(t)?[]:i(t)};return a(e)},th=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Mm(e)<=1)}),nh=e=>{let t=eh([e]).map(th),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Qm(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of eh(n)){let n=Qm(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(th(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},rh=(e,t)=>!Rm(e,t)||Rm(e,t.body),ih=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&Mm(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Um(e);if(n){let e=Mm(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Nm(e))throw new b(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},ah=(e,t)=>{let n=e.findIndex(e=>Lm(e,t));return n===-1?(e.push(t),e.length-1):n},oh=e=>{let t=Wm(Hm(Bm(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Gm(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])ih(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:jm(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Lm(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Km(e.formula),n=[];t&&qm(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>ah(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>ah(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>ah(i,e))}));return{tableau:t&&nh(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},sh=/* @__PURE__ */ new Set([`~>`,`-+->`]),ch=/* @__PURE__ */ new WeakMap,lh=/* @__PURE__ */ new WeakSet,uh=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),dh=(t,r)=>{try{return _c(t,r)}catch(t){if(!(t instanceof b)||t instanceof x)throw t;let r=o(t);throw r===void 0?n(new b(`${l}${t.message}`,t),e.error):n(t,r)}},fh=e=>new b(`TLC cannot handle the temporal formula at ${Wo(e)}`),ph=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ts(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return ph(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?ph(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=os(e,n);if(t)return mh(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?+!!r.isStateLevel:void 0},o=(e,t)=>r.has(e)?0:X(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Sa(e,(e,a)=>(i.value=Math.max(i.value,ph(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return sh.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},mh=(e,t)=>{let n=ch.get(e);if(n!==void 0)return n;ch.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(ph(e.body,void 0,t),...r.map(e=>ph(e.set,void 0,t)));return ch.set(e,i),i},hh=`Temporal formula is a tautology (its negation is unsatisfiable).`,gh=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>gh(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,Go(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,_h(t,r,i));if(t.kind===`Identifier`){let o=X(t)?ts(r,t.name):void 0;if(o?.kind===`Thunk`)return c(o.expression,o.scope);let l=i.constants.has(t.name)?void 0:os(t.name,i);if(!o&&l?.kind===`Operator`&&l.params.length===0&&mh(l,i)>0){if(s.has(l))throw n(new b(u),e.error);let r=c(l.body,void 0,t.name,/* @__PURE__ */ new Set([...s,l]));return!a&&mh(l,i)<2?[{expression:l.body,scope:void 0,name:t.name}]:r}}let l=uh(i,r);if(t.kind===`Apply`&&(e=>a||ph(e,r,i)===3)(t)){let e=Es(t,l),n=X(t)?void 0:os(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,Rs(e,t.args,l),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>ph(e.set,r,i)===0)){let r=[],i={count:0};if(ds(t.bounds,l,e=>(i.count++,r.push(...c(t.body,e,Go(t.body))),!1)),i.count===0)throw n(new b(hh),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},_h=(e,t,n)=>{let r=Bs(e.definitions,uh(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&lh.add(e.binding);return r},vh=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),yh=(t,r,i)=>{let a=(e,t,n)=>{let r=n===0?ph(e,t,i):n;if(r===0){let n=dh(e,uh(i,t));if(typeof n!=`boolean`)throw new b(`TLC expected a boolean in the temporal formula at ${Wo(e)}`);return Em(n)}return r===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},s=(t,r,i,s)=>{if(o.depth>=100)throw n(new b(u),e.error);o.depth++;let c=f(t,r);o.depth--;let l=Mm(c);return l>2?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,r=uh(i,t),a=X(e)||os(n,i)===void 0?ts(t,n):void 0;if(a?.kind===`Thunk`&&lh.has(a))return s(a.expression,a.scope,e,t);let o=a?.kind===`Operator`?a.operator:a?void 0:X(e)?Ds(n,r):ws(n,i);if(o?.kind!==`Closure`)throw fh(e);let c=e.kind===`Apply`?e.args:[];return s(o.body,Rs(o,c,r),e,t)},l=(e,t)=>{if(!e.bounds.every(e=>ph(e.set,t,i)===0))throw fh(e);let n=[];ds(e.bounds,uh(i,t),t=>(n.push(f(e.body,t)),!1));let r=e.kind===`Forall`;if(n.length===0)return Em(r);let o=jm(r?`And`:`Or`,n),s=Mm(o);return s>2?o:a(e,t,s)},d=(e,t)=>{switch(e.kind){case`Label`:f(e.body,t);return;case`Let`:f(e.body,_h(e,t,i));return;case`And`:case`Or`:for(let n of e.operands)f(n,t);return;case`Apply`:if(e.operator===`=>`||e.operator===`~`&&!X(e))for(let n of e.args)f(n,t);return;case`If`:{let n=f(e.condition,t),r=n.kind===`Boolean`?[n.value?e.consequent:e.alternative]:[e.consequent,e.alternative];for(let e of r)f(e,t)}}},f=(e,t)=>{let n=ph(e,t,i);if(n<=2)return d(e,t),a(e,t,n);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,_h(e,t,i));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?km(`Always`,Am(`Or`,km(`Not`,f(n[0],t)),km(`Eventually`,f(n[1],t)))):e.operator===`~`&&!X(e)?km(`Not`,f(n[0],t)):e.operator===`=>`?Am(`Or`,km(`Not`,f(n[0],t)),f(n[1],t)):c(e,t)}case`And`:case`Or`:return jm(e.kind,e.operands.map(e=>f(e,t)));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(ph(e.condition,t,i)===0){let n=dh(e.condition,uh(i,t));if(typeof n==`boolean`)return f(n?e.consequent:e.alternative,t)}let n=f(e.condition,t);return Am(`Or`,Am(`And`,n,f(e.consequent,t)),Am(`And`,km(`Not`,n),f(e.alternative,t)))}case`Always`:case`Eventually`:return km(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=vh(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=km(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?km(`Always`,km(`Eventually`,Am(`Or`,i,a))):Am(`Or`,km(`Eventually`,km(`Always`,i)),km(`Always`,km(`Eventually`,a)))}default:throw fh(e)}};return f(t,r)},bh=(e,t,n,r,i)=>{let a=e=>bh(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?as(_c(e.expression,a),`a temporal property predicate`):zo(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&as(_c(e.unchanged,a),`a subscript`)?!1:as(_c(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return bh(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new b(`TLC cannot evaluate a temporal formula in a single step`)}},xh=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>xh(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return bh(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Sh=(e,t)=>e.every((e,n)=>nt(e,t[n])),Ch=e=>e.filter((t,n)=>n===0||e[n-1]!==t),wh=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.pending.push(void 0),e.offsets.push(-1),e.edgeOffsets.push(-1),e.nodeStates.length-1),Th=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},Eh=(e,t)=>(e.offsets[t]??-1)!==-1,Dh=(e,t)=>e.pending[t]??=[],Oh=(e,t)=>{let n=e.edgeOffsets[t];return e.edges.ids.subarray(n+1,n+1+e.edges.ids[n])},kh=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,Ah=2**53-1,jh=(t,r,i,a)=>{if(t.length===0)return;let o=r.map(e=>yh(e.expression,e.scope,i)),s=t.map(e=>km(`Not`,yh(e.expression,e.scope,i))),c=s.length===1?s[0]:jm(`Or`,s),l=o.length===0?c:jm(`And`,[...o,c]),u=oh(l);if(u.length===0)throw n(new b(hh),e.livenessEvaluationFailure);let d=/* @__PURE__ */ new Map,f=u.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=Im(e),n=d.get(t)??d.size;return d.set(t,n),n}),nodeStates:[],nodeTableaux:[],pending:[],offsets:[],results:{bytes:/* @__PURE__ */ new Uint8Array(1024),length:0},edgeOffsets:[],edges:{ids:/* @__PURE__ */ new Int32Array(1024),length:0},initial:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),p={multiplier:1},m=!Qs(i),h={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},g=e=>{let t=h.states.get(e)??/* @__PURE__ */ new Map;return h.states.set(e,t),t},_=(e,t)=>{i.runtime.setLivenessSource(e);let n=t();return i.runtime.setLivenessSource(void 0),n},v=(e,t)=>bh(e,t,void 0,i,m?g(t):/* @__PURE__ */ new Map),y=(e,t,n)=>_(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!v(e,n))),x=(e,t,n,r)=>_(t,()=>{let t=e.solution.actionChecks;if(!m)return Uint8Array.from(t,e=>+!!bh(e,n,r,i,/* @__PURE__ */ new Map));let a=g(n),o=h.actions.get(n)??/* @__PURE__ */ new Map;h.actions.set(n,o);let s=o.get(r)??new Int8Array(d.size).fill(-1);return o.set(r,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!bh(t[o],n,r,i,a)),s[e]))}),S=(e,t,n,r)=>_(n,()=>e.nodes[t].statePredicates.every(e=>v(e,r))),C=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},w=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),T=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Th(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ee=(e,t,n)=>{let r=wh(e,t,n),i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),Th(i,e[t]-1,e[t+1]))}return i.slots.set([t+1,n,r],Th(i,t,n)),r},te=(e,t,n)=>t.nodes.flatMap((t,r)=>T(e,n,r)??[]).sort((e,t)=>e-t),ne=(e,t,n,r)=>{let i=e.solution.actionChecks.length,a=e.results,o=a.length;if(a.length+=r.length+n.length*i,a.length>a.bytes.length){let e=new Uint8Array(Math.max(2*a.bytes.length,a.length));e.set(a.bytes),a.bytes=e}a.bytes.set(r,o),n.forEach((e,t)=>a.bytes.set(e,o+r.length+t*i)),e.offsets[t]=o;let s=e.pending[t]??[],c=e.edges,l=c.length;if(c.length+=s.length+1,c.length>c.ids.length){let e=new Int32Array(Math.max(2*c.ids.length,c.length));e.set(c.ids),c.ids=e}c.ids[l]=s.length,c.ids.set(s,l+1),e.edgeOffsets[t]=l,e.pending[t]=void 0},E=(e,t,n)=>{let r={slots:Array.from({length:16*p.multiplier}),count:0},i=(e,t)=>{for(let n=(a.getFingerprint(t.index)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&Sh(r.state,t.state))return!1}},o=e=>{if(r.count>=r.slots.length>>1){let e=r.slots;r.slots=Array.from({length:2*e.length+1});for(let t of e)t&&i(r.slots,t)}i(r.slots,e)&&r.count++};return n.forEach(o),o({index:e,state:t}),r.slots.length>16*p.multiplier&&p.multiplier++,r.slots.filter(e=>e!==void 0)},re=(e,t,n,r,i)=>{let o=y(e,r,n),s=t.nodes[e.nodeTableaux[i]],c=[],l=Dh(e,i),u=s.successors.length>0?x(e,r,n,n):/* @__PURE__ */ new Uint8Array;for(let a of s.successors){if(!S(t,a,r,n))continue;if(C(t,a)&&e.errorNode===void 0&&w(e)){e.errorNode=i;return}let o=T(e,r,a);if(o!==void 0&&l.includes(o))continue;let s=o??ee(e,r,a);l.push(s),c.push(u),o===void 0&&re(e,t,n,r,s)}for(let i of a.getSuccessors(n)){let a=x(e,r,n,i.state),o=e.isDone[i.index]===!0;for(let n of s.successors){if(!S(t,n,r,i.state))continue;let s=T(e,i.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ee(e,i.index,n);l.push(u),c.push(a),s===void 0&&o&&re(e,t,i.state,i.index,u)}}l.length>0&&ne(e,i,c,o)},D=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>S(t,r,a,e.state)));e.isDone[a]=!0;for(let s of te(e,t,a)){let a=Dh(e,s),c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=T(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ee(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&re(e,t,n.state,n.index,d)}}),ne(e,s,c,i)}if(e.errorNode!==void 0)return Ch(k(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},O=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)wh(e,e.nodeStates.length,-1);let a=Dh(e,i),o=[];t.forEach((t,r)=>{Eh(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),ne(e,i,o,r)},k=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Eh(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of Oh(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}Eh(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new b(`Couldn't re-create liveness trace (path) starting at: ${t}`)},A=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=n.stateChecks.length,a=(t,n,a)=>e.results.bytes[e.offsets[t]+i+n*r+a]===1,o=(e,n)=>t.eventuallyAlways.every(t=>a(e,n,t)),s=new Float64Array(e.nodeStates.length).fill(-1),c=e.initial.filter(t=>Eh(e,t)),l=[],u=t=>{let n=Oh(e,t).indexOf(t);return n!==-1&&o(t,n)},d=(t,r)=>n.tableau!==void 0&&rh(n.tableau.nodes[e.nodeTableaux[t]].particle,r),f=r=>{let i=l.pop()??r;if(i===r&&!u(i)){s[i]=Ah;return}let c=/* @__PURE__ */ new Set,f=/* @__PURE__ */ new Map;for(let t=i;;t=l.pop()??r){c.add(t);let n=f.get(e.nodeStates[t]);if(n?n.push(t):f.set(e.nodeStates[t],[t]),s[t]=Ah,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...c].some(n=>kh(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>Oh(e,n).some((e,r)=>c.has(e)&&o(n,r)&&a(n,r,t)))),g=n.promises.every(e=>[...c].some(t=>d(t,e)));if(m&&h&&g)return p(r,c,f)},p=(r,i,s)=>{let c=Ch(k(e,r).reverse().map(t=>e.nodeStates[t])),l=[],u=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),p=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+p.length+h.length},_={node:r},v=e=>i.has(e),y=e=>{l.push(_.node),_.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&kh(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&d(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},i=g.count;if(Oh(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!v(r)||!o(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!p[t]&&a(_.node,c,e)&&(p[t]=!0,g.count--)})}return g.count<i?(y(r),u.clear(),!0):(v(r)&&!u.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){y(n.last),u.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new b(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=Oh(e,t).find(e=>v(e)&&!u.has(e))??-1}y(n.unvisited),u.add(n.unvisited)}}let x=m(r,_.node,s,o);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let S=c[c.length-1];return x[x.length-1]===S&&x.pop(),{prefix:c.slice(0,-1),cycle:[S,...x.reverse()]}},m=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of Oh(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new b(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<c.length;t++){let n=[c[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),a=n.pop()??0;if(i===-42){if(s[a]===t){let e=f(a);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(s[a]!==-1){n.push(Math.min(t,s[a]));continue}s[a]=r.link,n.push(t,a,-42),l.push(a);let u={value:r.link++};Oh(e,a).forEach((t,r)=>{Eh(e,t)&&(o(a,r)?s[t]===-1?n.push(t,-1):u.value=Math.min(u.value,s[t]):s[t]===-1&&c.push(t))}),n.push(u.value)}}};return{addInitialState:(e,t)=>{h.states.clear(),h.actions.clear();for(let n of f){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)S(r,i,void 0,t)&&n.initial.push(T(n,e,i)??ee(n,e,i))}},addState:(e,t,n)=>{h.states.clear(),h.actions.clear();let r=E(e,t,n);for(let n of f){let i=r.map(r=>x(n,e,t,r.state)),a=y(n,e,t),o=n.solution.tableau,s=o?D(n,o,r,i,a,e):O(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of f)for(let t of e.solution.models){let n=A(e,t);if(n)return n}},getViolatedProperties:(e,n)=>[...new Set(t.filter((t,r)=>!xh(s[r].body,e,n,0,i)).map(e=>e.name))]}},Mh=`UnnamedAction`,Nh={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Ph=e=>{let t=e.range??Nh;return Wt([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Fh=e=>{let t=[[`name`,e.name],[`location`,Ph(e.location)]];return e.parameters.length===0?Wt(t):Wt([...t,[`context`,Wt(e.parameters)],[`parameters`,Ut(e.parameters.map(e=>e[0]))]])},Ih=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),Lh=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Rh=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,zh=e=>e.kind===`Apply`?e.args:[],Bh=(e,t,n)=>{let r=Rh(e);if(r===void 0)return;if(X(e)){let e=ts(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=ws(r,n);return i?.kind===`Closure`?i:void 0},Vh=(e,t)=>{try{return _c(e,Lh(t,void 0)),!0}catch(e){if(e instanceof f)return!1;throw e}},Hh=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&cs(e,t)&&Vh(e.body,t),Uh=(e,t)=>{let n=os(e.name,t);return n?.body===e.body&&Hh(n,t)},Wh=(e,t)=>{if(e.kind!==`Identifier`||!X(e))return;let n=ts(t,e.name);return n?.kind===`Thunk`?n:void 0},Gh=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ts(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Kh=(e,t)=>{try{return e()}catch(e){if(e instanceof f)return t();throw e}},qh=(e,t,n,r,i)=>{let a=zh(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>ph(e,n,i)!==0)?o():Kh(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),_c(e,Lh(i,n))]),expression:t,scope:n}],o)},Jh=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Mh,location:e.location,parameters:Gh(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Jh(e.body,Bs(e.definitions,Lh(r,t)),n,r,i);case`Label`:return Jh(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Jh(e,t,n,r,i));case`Exists`:return Kh(()=>{let o=[];return ds(e.bounds,Lh(r,t),t=>(o.push(...Jh(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=X(e)?void 0:i.get(Rh(e)??``),s=Bh(e,t,r);if(o)return qh(o,e,t,s,r);if(!s)return[a()];let c=zh(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return Uh(s,r)||c.some(e=>ph(e,t,r)!==0)?l():Kh(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:_c(n,Lh(r,t))},parent:e}),s.scope);return Jh(s.body,e,s,r,i)},l)},Yh=(e,t,n,r,i)=>{let a=(e,t)=>Yh(e,t,n,r,i);if(e.kind===`Let`){a(e.body,Bs(e.definitions,Lh(n,t)));return}let o=Wh(e,t);if(o){a(o.expression,o.scope);return}let s=Bh(e,t,n);if(s&&Uh(s,n))return;if(s&&s.params.length===0){if(ph(s.body,s.scope,n)===1){r.inits.push(Ih(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,Rs(s,e.args,Lh(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(Ih(Mh,e));return}let c=ph(e,t,n);c<=1?r.inits.push(Ih(Mh,e)):c===3&&r.temporals.push(Ih(Mh,e))},Xh=(e,t,n,r,i)=>{let a=(t,n)=>Xh(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Bs(t.definitions,Lh(r,n)));return}let o=Wh(t,n);if(o){a(o.expression,o.scope);return}let s=Bh(t,n,r);if(s&&Uh(s,r))return;if(s&&s.params.length===zh(t).length){a(s.body,t.kind===`Apply`?Rs(s,t.args,Lh(r,n)):s.scope);return}if(t.kind===`Forall`&&Kh(()=>(ds(t.bounds,Lh(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(Ih(e,a)):ph(a,n,r)<2?i.invariants.push(Ih(e,a)):i.impliedTemporals.push(Ih(e,t));return}let c=ph(t,n,r);c<=1?i.impliedInits.push(Ih(e,t)):c===3&&i.impliedTemporals.push(Ih(e,t))},Zh=(e,t)=>{let n=os(e,t);return n?.kind===`Operator`&&!Hh(n,t)?n:void 0},Qh=e=>Wt([[`name`,e.name],[`location`,Ph(e.location)]]),$h=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Zh(e.specification,t);a&&(Yh(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Jh(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:ws(e.init,t);o?.kind===`Closure`&&r.inits.push(Ih(e.init??``,o.body));let s=e.next===void 0?void 0:ws(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Jh(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Zh(e,t);n&&r.invariants.push(Ih(e,n.body))}),e.properties.forEach(e=>{let n=Zh(e,t);n&&Xh(e,n.body,void 0,t,r)}),r},eg=(e,t,n)=>$h(e,t,n).actions,tg=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>Y(e[1])).join(`,`)})`,ng=e=>`${e.name===Mh?`Action`:e.name}${tg(e)} ${_(e.location.range??Nh)}`,rg=e=>`${e.name}${tg(e)}`,ig=(e,t,n,r)=>{let i=$h(e,t,r),a=e=>Dt(e.map(Fh)),o=e=>Dt(e.flatMap(e=>{let n=Zh(e,t);return n?[Qh(n)]:[]}));return Wt([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,Dt(t.variables.map((e,t)=>Wt([[`name`,e],[`location`,Ph(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},ag=`paired12`,og=(e,t=16)=>e<=t*.75?t:og(e,t*2),sg=(e,t)=>{let n=og(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},cg=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),lg=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),ug=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),dg=e=>ug(e).replaceAll(`
|
|
429
|
-
`,`\\n`),fg=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},close:()=>t?.(e.path,n.join(``))}},pg=(e,t)=>{let n=[`strict digraph DiskGraph {
|
|
430
|
-
`,`node [shape=box,style=rounded]
|
|
431
|
-
|
|
465
|
+
`]]),Gd=/* @__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)`]])]]),Kd=A(`EOF`),qd=A(`IDENTIFIER`),Jd=A(`DEFBREAK`),Yd=(e,t)=>Array.from({length:A(t)-A(e)+1},(t,n)=>A(e)+n),Xd=new Set(Yd(`op_57`,`op_119`)),Zd=new Set(Yd(`op_1`,`op_119`)),Qd=new Set(Yd(`op_57`,`op_70`)),$d=/* @__PURE__ */ new Set([...Yd(`ACTION`,`EXCEPT`),A(`EXTENDS`),...Yd(`IF`,`SF`),A(`STATE`),...Yd(`THEN`,`WITH`),A(`US`),...Yd(`op_112`,`op_116`)]),ef=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),tf=new Map([...ef(`postfix`,160,160,!0,`[`),...ef(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...ef(`prefix`,120,120,!1,`-.`),...ef(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...ef(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...ef(`prefix`,40,40,!0,`\\lnot`),...ef(`nfix`,100,130,!0,`\\times`),...ef(`infix`,140,140,!1,`^`,`^^`),...ef(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...ef(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...ef(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...ef(`infix`,100,110,!0,`|`,`||`,`%%`),...ef(`infix`,100,110,!1,`%`),...ef(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...ef(`infix`,90,140,!1,`\\wr`),...ef(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...ef(`infix`,90,130,!1,`!!`),...ef(`infix`,90,90,!1,`...`,`..`),...ef(`infix`,80,80,!0,`\\intersect`,`\\union`),...ef(`infix`,80,80,!1,`\\`),...ef(`infix`,70,70,!1,`<:`,`:>`),...ef(`infix`,60,60,!0,`@@`),...ef(`infix`,50,140,!0,`\\cdot`),...ef(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...ef(`infix`,30,30,!0,`\\land`,`\\lor`),...ef(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...ef(`infix`,10,10,!1,`=>`)]),nf=new Map([...tf,...Bd.flatMap(e=>e.slice(1).map(t=>[t,tf.get(e[0])]))]),rf=nf.get(`[`),af={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},of=e=>({type:`tokens`,kinds:new Set(e)}),sf=e=>typeof e==`string`?e.startsWith(`<`)?of([A(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(sf)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),cf=e=>(...t)=>({type:e,body:G(...t)}),q=cf(`zeroOrMore`),lf=cf(`oneOrMore`),J=cf(`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}),uf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),df=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=uf(e,n);return n},ff=(...e)=>{let t=e.map(A);return e=>t.includes(df(e,1).kind)},pf=(e,t=df(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},mf=e=>{let t=df(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},hf=e=>ff(`CASESEP`)(e)&&pf(e),gf=e=>{let t=df(e,1);$d.has(t.kind)&&(t.kind=qd)},_f=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,vf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),yf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},bf=e=>e.operatorStacks[e.operatorStacks.length-1],xf=(e,t)=>e.low>t.high,Sf=(e,t)=>e.high<t.low,Cf=e=>e.fix===`prefix`?e:nf.get(`${e.name}.`),wf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===rf?vf(`FcnAppl`,[n,...r.node.heirs]):vf(`PostfixExpr`,[n,r.node]),operator:void 0})},Tf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:vf(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:vf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Ef=e=>{let t=bf(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return wf(t,n),Ef(e);if(i.operator!==void 0){let t=Cf(r.operator);return t!==void 0&&xf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${_f(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${_f(e,a.node.first,a.node.last)} and expression at location ${_f(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Sf(a.operator,r.operator)?void 0:xf(a.operator,r.operator)?(Tf(t,a.operator),Ef(e)):`Precedence conflict between ops ${a.operator.name} in block ${_f(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Cf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Sf(s,r.operator))return;if(!xf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${_f(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Tf(t,s),Ef(e);let c=_f(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===af?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Df=e=>Y(t=>{let n=bf(t),r=yf(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:Ef(t)}),Of=Df(()=>!1),kf=Df(()=>!0),Af=Y(e=>{e.lastOperator=nf.get(e.token.image)}),jf=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},Mf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?jf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Nf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!pf(e,n.first.beginColumn))return n;let t=Nf(e,n);if(t!==void 0)return t}},Pf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(A),n=(e,...t)=>t.some(t=>e.kind===A(t)),r=e=>e!==void 0&&Xd.has(e.kind),i=e.token,a=uf(e,i);i.next=void 0;let o=uf(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===qd&&(e=e.next)}else if(e.kind===qd){let t=e.next;!r(t)||Qd.has(t.kind)||Zd.has(t.kind)&&t.next?.kind!==qd||(e=t.next?.kind===A(`SUBSTITUTE`)?i:Zd.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Jd&&(e.next={kind:Jd,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=uf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Ff=e=>{let t=df(e,1);if(t.kind===A(`LAB`)){let n=1;for(;n!==0;)if(t=uf(e,t),t.kind===A(`LAB`)&&n++,t.kind===A(`RAB`)&&n--,t.kind===Kd)return!1;return uf(e,t).kind===A(`IN`)}if(t.kind!==qd)return!1;for(t=uf(e,t);t.kind===A(`COMMA`);){if(t=uf(e,t),t.kind!==qd)return!1;t=uf(e,t)}return t.kind===A(`IN`)},If=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Lf=e=>e.proofLevels.at(-1)??-1,Rf=e=>{let t=df(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:ff(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Lf(e)>=0&&If(t)>Lf(e):ff(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},zf=(e,t)=>{let n=If(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},Bf=e=>Y(t=>zf(t,t.token)?void 0:`${_f(t,t.token)}: ${e}`),Vf=of([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(A)),Hf=of([...Vf.kinds,A(`op_76`)]),Uf=of(Zd),Wf=of(Qd),Gf=of([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(A)),Kf=()=>q(Z({expansion:[K(Vf,`<op_77>`)],semantic:pf}),K(`PrefixOp`,`InfixOp`),kf),qf=()=>K(G(Z({expansion:[`OpenStart`],semantic:pf}),`OpenExpression`,Of),G(Z({semantic:pf}),`ExtendableExpr`)),Jf=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),Yf=()=>K(G(Z({semantic:e=>ff(`ASSUME`,`BOXASSUME`)(e)||df(e,2).kind===A(`COLONCOLON`)&&[A(`ASSUME`),A(`BOXASSUME`)].includes(df(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Xf=()=>[`JuncItem`,q(Z({semantic:mf}),`JuncItem`)],Zf=e=>Y(t=>{t.expecting=e,gf(t)}),Qf=e=>Y(t=>{t.isTerminalProof=e}),$f=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{Pf(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),ep={CompilationUnit:Q(void 0,[Y(Pf),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>`),Zf(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,Zf(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,Zf(`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(Pf)),G(Z({semantic:e=>ff(`USE`)(e)&&df(e,2).kind!==A(`ONLY`)||ff(`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($f(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),$f(`Expression`,Z({expansion:[`<IDENTIFIER>`,Wf]}),`PostfixLHS`,`Expression`),$f(`Expression`,Z({expansion:[`<IDENTIFIER>`,Uf]}),`InfixLHS`,`Expression`),$f(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),$f(`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`,[Hf,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,Uf,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,Wf]),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>`,Zf(`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,[Vf,Af]),NonExpPrefixOp:Q(void 0,[Hf,Af]),InfixOp:Q(`Infix Op`,[Uf,Af]),PostfixOp:Q(void 0,[Wf,Af]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{Pf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),Yf(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),Yf(),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=yf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${_f(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(Pf),K(G(Z({amount:3}),Z({semantic:ff(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:Rf}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>ff(`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>`,Qf(!0),J(`<ONLY>`)),G(`<USE>`,Qf(!1),J(`<ONLY>`)),G(`<HIDE>`,Qf(!1))),X("an expression, `MODULE' or `DEF'"),J(Jf(),q(`<COMMA>`,X(`MODULE or expression`),Jf(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Jf(),q(`<COMMA>`,X(`MODULE or expression`),Jf(),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`),Gf,Bf(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:Rf}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),Gf,Bf(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:ff(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:ff(`INSTANCE`)}),`Instantiation`),G(Z({semantic:ff(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:Rf}),Y(e=>{let t=yf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${_f(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),lf(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:ff(`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(Hf,Uf,Wf),of([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(A))],semantic:pf}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${_f(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:pf}),`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:Ff}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),lf(`<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=yf(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),lf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:Ff}),`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`)&&$d.has(df(e,1).kind)}),Y(e=>{df(e,1).kind=qd}),`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=vf(`FcnAppl`,t.heirs),e.lastOperator=rf})),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>`,lf(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(gf),`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=>hf(e)&&df(e,2).kind!==A(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:hf}),`<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`,[lf(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>`]}),...Xf()),G(Z({expansion:[`<AND>`]}),...Xf())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Nf(t,e.heirs[1]);return n&&`Item at ${_f(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${_f(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose: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([])}),Kf(),qf()],(e,t)=>{let n=bf(t);n.push({node:e.heirs[0],operator:af});let r=Ef(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr: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`),Of,q(K(G(Z({expansion:[`PostfixOp`],semantic:pf}),`PostfixOp`,kf),G(Z({expansion:[`<DOT>`],semantic:pf}),`<DOT>`,Y(gf),Z({semantic:pf}),`Identifier`,Y(e=>{let t=bf(e);t[t.length-1].operator!==void 0&&wf(t,t.length),t[t.length-1]={node:vf(`RecordComponent`,[t[t.length-1].node,yf(e,2),yf(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:pf}),X(`function argument`),`SBracketCases`,Df(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:pf}),`InfixOp`,kf,Kf(),qf()),G(Z({expansion:[`<COLONCOLON>`],semantic:pf}),`<COLONCOLON>`,Y(e=>{let t=bf(e);if(!Mf(t[t.length-1].node))return`\`::' at ${_f(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=bf(e),n=yf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Sf(r,e.lastOperator)){let t=yf(e,3);return`Removing label at ${_f(e,t.first,t.last)} would change expression parsing.`}t.push({node:vf(`Label`,[yf(e,3),yf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:pf}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:pf}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>Lf(e)<0&&e.proofLevels.length<=1?`${_f(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${_f(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,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:jf(e.heirs)===void 0?e.heirs.length===1?vf(`GeneralId`,e.heirs):void 0:vf(`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 ${_f(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},tp=/* @__PURE__ */ new Map,np=e=>{let t=tp.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=np(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,np(ep[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return tp.set(e,n),n},rp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},ip=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=uf(e,e.scanPosition)),e.scanPosition=uf(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},ap=(e,t)=>{if(t.type===`tokens`)return ip(e,t.kinds);if(t.type===`call`)return ap(e,ep[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||rp(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=ap(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||rp(e,t.semantic)?ap(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=ap(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=ap(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},op=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=ap(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},sp=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||np(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!np(a).hasSemanticStart?np(a).first.has(df(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):op(e,i,a)&&(o===void 0||o(e))}),cp=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,ap(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=uf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Kd){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=uf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${qe(e.token.image)}" `},lp=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??cp(e)}\n\nResidual stack trace follows:\n${r}`,!1},up=(e,t)=>{let n=uf(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,lp(e))},dp=(e,t)=>{let n=ep[t];n.message!==void 0&&(e.messages.push({name:n.message,token:df(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!fp(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return lp(e,i);let a=r.node??(r.heirs.length===0?void 0:vf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},fp=(e,t)=>{if(t.type===`tokens`)return up(e,t.kinds);if(t.type===`call`)return dp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||lp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||lp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||fp(e,t));if(t.type===`choice`){let n=sp(e,t.alternatives);return n===-1?lp(e):fp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!fp(e,t.body))return!1;if(t.type===`optional`)return sp(e,[t.body])===-1||fp(e,t.body);for(;sp(e,[t.body])===0;)if(!fp(e,t.body))return!1;return!0},pp=e=>{let t=Ge(e),n={kind:Kd,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=fp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},mp={low:15,high:15},hp={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),gp=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)]]),_p=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),vp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),yp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),bp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),xp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Sp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,..._p]),Cp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?gp.has(e.operator):_p.has(e.operator)),wp=e=>gp.has(e)||_p.has(e)||e===`-.`,Tp=(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}}},Ep=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Dp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Op=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),kp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Ap=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),jp=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Mp=/* @__PURE__ */ new Set([``,`*`,`-`]),Np=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Pp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Fp=/* @__PURE__ */ new Set([`NEW`,...Pp.keys()]),Ip=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Lp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Rp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),zp=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
|
|
466
|
+
`)}\n`},Bp=(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`||Rp.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)?`====`:jp.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`&&(yp.has(e.text)||gp.has(e.text)||_p.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(`==`,_p.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`&&Dp.has(t.text)||Se(e)},k=()=>{let e=x(),t=e.kind===`Operator`&&(gp.has(e.text)||vp.has(e.text))&&we(e);if(n&&e.kind!==`String`&&(vp.has(e.text)||Sp.has(e.text)&&e.text!==`'`&&!_p.has(e.text)||xp.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`&&Sp.has(e.text)&&we(e)){i.index++;let t=f(e);if(_p.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:Tp(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`||Ep.has(e.text)||e.kind===`Operator`&&(gp.has(e.text)||_p.has(e.text)||vp.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&&Cp(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`&&wp(r.text)&&w(`(`))return{kind:`Apply`,operator:r.text,spelling:r.spelling,args:A(),location:s};if(r.kind===`Operator`&&wp(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===`'`||_p.has(o.text)?mp.high:gp.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=mp,r.left=y({kind:`Prime`,expression:r.left,location:i},t);continue}if(_p.has(n.text)&&e<=15){T(),a.last=mp,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=hp,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=gp.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`&&gp.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`&&yp.has(t.text),o=t.kind===`Identifier`&&_p.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`&&Ip.has(e.text)&&t.value++,e.kind===`Operator`&&Lp.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`&&_p.has(t.text)?w(`==`,2):t.kind===`Operator`&&gp.has(t.text)?x(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):e.kind!==`String`&&yp.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(`.`)&&!Mp.has($e(e)),tt=e=>{let t=$e(e);if(Mp.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 kp.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:!Rp.has(e.name)&&!M(e.name):!1,at=()=>{let e=x();return e.kind===`Step`?et(e):e.kind===`Keyword`?Np.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`&&!bp.has(t.text)&&wp(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`&<(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`?Pp.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`&&Fp.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&&!Ap.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`&&Op.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?pp(e):void 0;if(Dt!==void 0)throw new u(Dt);return Et},Vp=e=>Bp(e,`tlc`),Hp=e=>Bp(e,`tlapm`),Up=e=>Bp(e,`sany`),Wp=25214903917n,Gp=(1n<<48n)-1n,Kp=2147483647,qp=e=>{let t={value:(BigInt.asUintN(64,e)^Wp)&Gp},n=e=>(t.value=t.value*Wp+11n&Gp,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Wp)&Gp},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<=Kp)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Jp=10454148508367108822n,Yp=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Jp);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Xp=Int32Array.from(Yp,e=>Number(BigInt.asIntN(32,e>>32n))),Zp=Int32Array.from(Yp,e=>Number(BigInt.asIntN(32,e))),Qp=Number(BigInt.asIntN(32,Jp>>32n)),$p=Number(BigInt.asIntN(32,Jp));let em=Qp,tm=$p;const nm=e=>{let t=(e^tm)&255;tm=(tm>>>8|em<<24)^Zp[t],em=em>>>8^Xp[t]},rm=e=>{for(let t=0;t<32;t+=8)nm(e>>>t)},im=e=>{if(typeof e==`boolean`)nm(0),nm(e?116:102);else if(typeof e==`number`)nm(1),rm(e);else if(typeof e==`string`){nm(3),rm(e.length);for(let t=0;t<e.length;t++)nm(e.charCodeAt(t))}else if(F(e))nm(21),rm(Mt(e.name)+1);else if(P(e)){let t=kr(e);nm(9),rm(t.domain.length);for(let e=0;e<t.domain.length;e++)im(t.domain[e]),im(t.range[e])}else{let t=L(e).elements;nm(5),rm(t.length);for(let e of t)im(e)}},am=e=>{let t={high:em,low:tm};em=Qp,tm=$p;for(let t of e)im(t);let n=BigInt(em>>>0)<<32n|BigInt(tm>>>0);return em=t.high,tm=t.low,n},om=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=kr(e);return t.domain.reduce((e,n,r)=>e+om(n)+om(t.range[r]),5)}return L(e).elements.reduce((e,t)=>e+om(t),5)},sm=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){em=n<32?0:1<<n-32,tm=n<32?1<<n:0;for(let t=0;t<e;t++)nm(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]^em,t[n+1]=t[a+1]^tm}}return t},cm=(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=om(e);return em=0,tm=0,im(e),r.set(e,i.length),i.push(n,em,tm),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=sm(e);return n.set(e,r),r};return(n,r)=>{let s={high:em,low:tm},c={high:Qp,low:$p};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}em=s.high,tm=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},lm=[],um=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},dm=()=>{for(let e=1277011;lm.length<1341;e++)um(e)&&lm.push(e);return lm},fm=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]},pm=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},mm=e=>{for(let t=Math.max(e,9);;t++){let e=pm(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)}}},hm=(e,t,n)=>{if(t<=0)return[];let r=mm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(fm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},gm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Kp),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},_m=(1n<<63n)-1n-24n,vm=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(_m*BigInt(n)+i)%t;return r<0n?r+t:r})},ym=(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,bm=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Xn(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=>$n(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>L(e).elements),create:Qn}}},xm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Sm=(e,t,n,r)=>{if(R(t))return[];let i=r===`1.7.4`?gm:hm;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=xm(t,r)?void 0:bm(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Kp)?vm(e,t,n):i(e,Number(t),n)).map(e=>a.create(ym(a.lists,e)))}let o=L(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Cm=(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},wm=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Xn(e.domain)];return Ut(n,n.map(()=>wm(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return $n(e.names.map((n,r)=>[n,wm(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Qn(e.factors.map(e=>wm(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 Cm(L(e).elements,t)},Tm=(e,t=0n)=>{let n=qp(t),r={random:qp(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>$n([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:am,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},Em=e=>Hn([...e.possibleCounts].map(([e,t])=>[e,t])),Dm=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Em(e)]]),Om=(e,t,n)=>new S(`Applying ${e} to the following value,\nwhich is not ${t}:\n${z(n)}`),km=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${z(r)}`),Am=e=>P(e)?kr(e):void 0,jm=(e,t,n)=>{let r=V(e,t,n),i=Am(r);if(!i)throw Om(n,`a function with a finite domain`,r);return i},Mm=(e,t,n)=>{let r=V(e,t,n),i=Am(r);if(!i)throw km(t===0?`first`:`second`,n,`bag`,r);return i},Nm=(e,t)=>{if(!N(e)||!I(e))throw t();return L(e).elements},Pm=e=>e.range.every(e=>typeof e==`number`&&e>0),Fm=(e,t)=>{let n=e.domain.findIndex(e=>tn(e,t));return n===-1?void 0:e.range[n]},Im=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Lm=Im(`BagDiff`,`tlc2.value.impl.Value`,2),Rm=Im(`SqSubseteq`,`tlc2.value.IBoolValue`,2),zm=Im(`BagUnion`,`tlc2.value.impl.Value`,1),Bm=Im(`BagOfAll`,`tlc2.value.impl.Value`,2),Vm=Im(`BagCup`,`tlc2.value.impl.Value`,2),Hm=Im(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Um=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Bi(e)}`;throw Hi(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')`)},Wm=(e,t,n)=>{let r=Um(e,n)+Um(t,n);if(Pi(r))throw Fi(`${e}+${t}`);return r},Gm=(e,t,n,r)=>{let i=Fm(n,e.domain[t]),a=Um(e.range[t],r);return i===void 0?a:a-Um(i,r)|0},Km=(e,t)=>Hn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>tn(e[0],r));a?a[1]=Wm(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),qm=Ut([],[]),Jm=e=>[Ai(`EmptyBag`,qm),H(`IsABag`,1,e=>{let t=Am(V(e,0,`IsABag`));return t!==void 0&&Pm(t)}),H(`BagCardinality`,1,e=>{let t=V(e,0,`BagCardinality`);return jm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Om(`BagCardinality`,`a bag`,t);return Wm(e,n,Hm)},0)}),H(`BagIn`,2,e=>{let t=V(e,1,`BagIn`),n=Fm(jm(e,1,`BagIn`),V(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw km(`second`,`BagIn`,`bag`,t);return n>0}),H(`CopiesIn`,2,e=>{let t=V(e,1,`CopiesIn`),n=Fm(jm(e,1,`CopiesIn`),V(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw km(`second`,`CopiesIn`,`bag`,t);return n}),H(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Mm(e,t,`(+)`);if(!Pm(n))throw km(t===0?`first`:`second`,`(+)`,`bag`,V(e,t,`(+)`));return n});return Km(t,Vm)}),H(`\\ominus`,2,e=>{let t=Mm(e,0,`(-)`),n=Mm(e,1,`(-)`);return Hn(t.domain.flatMap((e,r)=>{let i=Gm(t,r,n,Lm);return i>0?[[e,i]]:[]}))}),H(`BagUnion`,1,e=>{let t=V(e,0,`BagUnion`),n=Nm(t,()=>Om(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??qm;let r=n.map(e=>{let n=Am(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 Km(r,zm)}),H(`\\sqsubseteq`,2,e=>{let t=jm(e,0,`\\sqsubseteq`),n=jm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Gm(t,r,n,Rm)<=0)}),ji(`BagOfAll`,2,e=>{let t=ki(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=Am(n);if(!r)throw km(`second`,`BagOfAll`,`function with a finite domain`,n);return Km(r.domain.map((e,n)=>Ut([t.call([e])],[r.range[n]])),Bm)}),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=kr(n),i=In(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 In(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=>Lr(jm(e,0,`BagToSet`))),H(`SetToBag`,1,e=>{let t=V(e,0,`SetToBag`),n=Nm(t,()=>Om(`BagToSet`,`a function with a finite domain`,t));return Ut([...n],n.map(()=>1))})],Ym=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Xm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Zm=`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`,$m=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,eh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,th=e=>{if(!P(e))return!1;let t=kr(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},nh=(e,t)=>Hi(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Bi(t)}`),rh=(e,t)=>Hi(e,`Cannot cast tlc2.value.impl.${Bi(t)} to tlc2.value.impl.StringValue`),ih=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),ah=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw nh(t,e);return`[${L(e).elements.map(e=>sh(e,t)).join(`,`)}]`},oh=(e,t)=>{let n=kr(e),r=Sr(n);return r?`[${r.map(e=>sh(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${ih(typeof e==`string`?e:z(e))}:${sh(n.range[r],t)}`).join(`,`)}}`},sh=(e,t)=>typeof e==`string`?ih(e):typeof e==`object`?e.kind===`ModelValue`?ih(e.name):N(e)?ah(e,t):oh(e,t):String(e),ch=e=>{if(N(e))return ah(e,Ym);if(!P(e)||th(e))throw nh(Ym,e);return oh(e,Ym)},lh=e=>{if(!P(e))throw nh(Xm,e);return oh(e,Xm)},uh=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))},dh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return At(e);if(Array.isArray(e))return Qn(e.map(e=>dh(e,t)));if(typeof e==`object`&&e)return $n(Object.entries(e).map(([e,n])=>[At(e),dh(n,t)]));throw Hi(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},fh=(e,t)=>{if(e.trim()===``)return dh(null,t);try{return dh(JSON.parse(e,(e,t,n)=>typeof t==`number`?uh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Hi(t,e.message):e}},ph=(e,t)=>{if(typeof e!=`string`)throw rh(t,e);return e},mh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Hi(n,`${t} (No such file or directory)`);return r},hh=e=>[Mi(`ToJson`,1,e=>At(sh(V(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Mi(`ToJsonArray`,1,e=>At(ch(V(e,0,`ToJsonArray`)))),Mi(`ToJsonObject`,1,e=>At(lh(V(e,0,`ToJsonObject`)))),Mi(`JsonSerialize`,2,t=>{let n=ph(V(t,0,`JsonSerialize`),Zm),r=V(t,1,`JsonSerialize`);if(!Sr(r)&&!th(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,sh(r,Zm)),!0}),Mi(`ndJsonSerialize`,2,t=>{let n=ph(V(t,0,`ndJsonSerialize`),Qm),r=V(t,1,`ndJsonSerialize`),i=Sr(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=>`${sh(e,Qm)}\n`).join(``)),!0}),Mi(`JsonDeserialize`,1,t=>{let n=ph(V(t,0,`JsonDeserialize`),$m);return fh(mh(e,n,$m),$m)}),Mi(`ndJsonDeserialize`,1,t=>{let n=ph(V(t,0,`ndJsonDeserialize`),eh);return Qn(mh(e,n,eh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>fh(e,eh)))})],gh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,_h=1e6,vh=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),yh=(e,t,n)=>{if(typeof e!=`number`||e<0)throw vh(t,n,`nonnegative integer`,z(e));return e},bh=(e,t,n,r)=>{if(!N(e)||!I(e))throw vh(t,n,r,z(e));return L(e).elements},xh=(e,t,n,r)=>In(Array.from({length:t},()=>In(e.filter(()=>r.nextDouble()<n)))),Sh=(e,t)=>{let n=`RandomSetOfSubsets`,r=yh(V(e,0,n),`first`,n),i=yh(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 vh(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw vh(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return xh(a,r,a.length===0?0:i/a.length,t.getRandom())},Ch=e=>[Mi(`RandomSubset`,2,t=>{let n=V(t,0,`RandomSubset`);if(typeof n!=`number`)throw vh(`first`,`RandomSubset`,`nonnegative integer`,z(n));if(n<0)throw Hi(gh,String(n));let r=V(t,1,`RandomSubset`);if(!N(r)||!R(r)&&!I(r))throw vh(`second`,`RandomSubset`,`a finite set`,z(r));let i=xm(r,e.version);if(i&&i.reduce((e,t)=>e*L(t).elements.length,1)>_h)throw Hi(gh,`Attempted to construct a set with too many elements (>${_h}).`);return In(Sm(n,r,e.getRandom(),e.version))}),Mi(`RandomSetOfSubsets`,3,t=>Sh(t,e)),Mi(`TestRandomSetOfSubsets`,3,t=>Qn(Array.from({length:5},()=>L(Sh(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`,Th=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${wh})`,Eh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${wh}) throws java.io.IOException`,Dh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${wh})`,Oh=()=>$n([[`action`,In([])],[`state`,In([])]]),kh=()=>$n([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Ah=e=>$n([[`name`,e??`UnnamedAction`],[`location`,kh()]]),jh=(e,t,n)=>{let r=e.map((e,t)=>Qn([t+1,$n(Object.entries(e))])),i=r.slice(1).map((e,n)=>Qn([r[n],t[n],e])),a=n?[Qn([r[r.length-1],n.action,r[n.start]])]:[];return $n([[`action`,In([...i,...a])],[`state`,In(r)]])},Mh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Dm(e).get(t)},Nh=(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)}`)},Ph=e=>e.every(e=>e!==void 0),Fh=(e,t)=>$n(t.variables.map((t,n)=>[t,e[n]])),Ih=(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=gl(r,t);if(e&&!n.has(e)&&(n.add(e),Ih(e.body,t,n)))return!0}return _i(e).some(e=>Ih(e,t,n))},Lh=(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=tn(n,r);return i||(e(z(`Assertion failed`,!0)),e(z(n,!0)),e(z(r,!0))),i}),Yi(`AssertError`,2,e=>{let n=ki(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Hi(Th,`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=Xi(e,0,`AssertError`)();try{Xi(e,1,`AssertError`)()}catch(e){if(e instanceof y)return Sa(e.message,t.isTool)===r;throw e}return!1}),Mi(`TLCGetOrDefault`,2,e=>{let n=V(e,0,`TLCGetOrDefault`);return Mh(t,n)??V(e,1,`TLCGetOrDefault`)}),{...ji(`TLCGetAndSet`,4,n=>{let r=V(n,0,`TLCGetAndSet`),i=Mh(t,r)??V(n,3,`TLCGetAndSet`),a=ki(n,1,`TLCGetAndSet`);return Nh(t,e,r,a.call([i,V(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Mi(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!Ph(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Hi(Eh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Qn(t.getBehavior(r).map(e=>Fh(e,n.environment)))}),Mi(`CounterExample`,0,()=>t.counterExample??Oh()),H(`ToTrace`,1,e=>{let t=V(e,0,`ToTrace`);if(!P(t)||!tn(Lr(t),In([`action`,`state`])))throw new y(`The argument of ToTrace should be a CounterExample, but instead it is:\n${z(t)}`);let n=L(Fr(t,`state`)).elements.map(e=>Sr(e)??[]);return Qn(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)}),Yi(`TLCDefer`,1,()=>!0),H(`TLCNoOp`,1,e=>V(e,0,`TLCNoOp`)),Yi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!Ph(r))throw Hi(Dh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||hl(Xi(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new C(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Yi(`TLCCache`,2,(e,t)=>{let r=ki(e,0,`TLCCache`),a=ai(Xi(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Ih(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,am([V(e,0,`TLCFP`)])))),Mi(`TLCEvalDefinition`,1,(e,t)=>{let n=V(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?gl(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)})]},Rh=(e,t)=>[Mi(`_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}),Mi(`_Counts`,0,()=>Em(t)),Mi(`_CheckName`,1,n=>{let r=String(V(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(z(Em(t),!0)),!1)}),Mi(`_PrintCounts`,0,()=>(e(z(Em(t),!0)),!0))],zh=e=>String(e).padStart(2,`0`),Bh=e=>`${e.getUTCFullYear()}.${zh(e.getUTCMonth()+1)}.${zh(e.getUTCDate())}.${zh(e.getUTCHours())}${zh(e.getUTCMinutes())}${zh(e.getUTCSeconds())}`,Vh=e=>Hn([...e].map(([e,t])=>[e,Qn([t])])),Hh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Uh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Wh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Gh=(e,t,n)=>{if(e.version===`1.7.4`?!Uh.has(t)||!e.isStarted&&Wh.has(t):!e.isStarted&&Hh.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 $n([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return $n([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return $n([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,At(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,At(Bh(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Ah(void 0);case`all`:return Vh(e.registers);case`all:named`:return Vh(Dm(e))}if(t.startsWith(`s:`)){let n=Dm(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.`)},Kh=(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 Gh(e,t,n?.state)},qh=e=>e.length===0?[[]]:e.flatMap((t,n)=>qh([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Jh=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&L(e).elements.forEach(Jh),e.kind===`Function`&&e.range.forEach(Jh))},Yh=(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=>Hn([[V(e,0,`:>`),V(e,1,`:>`)]])),H(`@@`,2,e=>{let t=Oi(e,0,`@@`),n=Oi(e,1,`@@`);return Un([..._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 Jh(t),t}),H(`Permutations`,1,e=>{let t=Ei(e,0,`Permutations`);return In(qh(t).map(e=>Hn(t.map((t,n)=>[t,e[n]]))))}),ji(`SortSeq`,2,e=>{let t=ki(e,1,`SortSeq`);return Qn(Di(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`?Ui({...Mi(`TLCGet`,1,(e,t)=>Kh(n,V(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Ui(Yi(`TLCGet`,1,(e,t)=>Kh(n,Xi(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Mi(`TLCSet`,2,e=>{let r=V(e,0,`TLCSet`);return Nh(n,t,r,V(e,1,`TLCSet`)),!0}),Ai(`Any`,Lt),H(`RandomElement`,1,e=>wm(wi(e,0,`RandomElement`),n.getRandom()))],Xh=(e,t)=>e.every(e=>Er(e,t)),Zh=In([!1,!0]),Qh=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Vn(Qh(e,t,r),Qh(e,r,n))},$h=[`\\cup`,`\\cap`,`\\`],eg=e=>typeof e==`object`&&e.kind===`MixedSet`,tg=e=>e.kind===`Interval`?L(e).elements:e.elements,ng=(e,t,n)=>{let r=tg(t);if(e!==`\\cup`){let t=e===`\\cap`;return Ln(r.filter(e=>Er(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=>!Er(e,t));return Ln([...r,...i])},rg=[Ai(`TRUE`,!0),Ai(`FALSE`,!1),Ai(`BOOLEAN`,Zh),Ai(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Ni(`=`,Pn),Ni(`#`,(e,t)=>!Pn(e,t)),H(`~`,1,e=>!Si(e,0,`~`)),H(`<=>`,2,e=>Si(e,0,`<=>`)===Si(e,1,`<=>`)),H(`/\\`,2,e=>Si(e,0,`/\\`)&&Si(e,1,`/\\`)),H(`\\/`,2,e=>Si(e,0,`\\/`)||Si(e,1,`\\/`)),H(`=>`,2,e=>!Si(e,0,`=>`)||Si(e,1,`=>`)),H(`\\in`,2,e=>Er(V(e,0,`\\in`),V(e,1,`\\in`))),H(`\\notin`,2,e=>!Er(V(e,0,`\\notin`),V(e,1,`\\notin`))),H(`\\subseteq`,2,e=>{let t=Ci(e,0,`\\subseteq`),n=V(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&I(t.base)?Xh(L(t.base).elements,n.base):Xh(L(t).elements,n)}),...$h.map(e=>H(e,2,t=>{let n=V(t,0,e),r=V(t,1,e);if(ft(n)&&ft(r)&&!eg(n)&&!eg(r)){if(e===`\\cup`&&R(n))return r;let t=e===`\\cup`?Vn:e===`\\cap`?Bn:zn;return Tr(()=>t(L(n),L(r)),()=>ng(e,n,r))}return ft(n)?ng(e,n,r):e!==`\\`&&ft(r)?ng(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=Ci(e,0,`UNION`),n=vn(t)?t.elements.filter(vn):[];if(!vn(t)||n.length!==t.elements.length)return Zt({kind:`Union`,base:t});if(eg(t)||n.some(eg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Er(t,e)||e.elements.push(t)})),Ln(e.elements)}return n.length===0?Rn:Qh(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 Lr(t)})],ig=Gi(`Integers`,`Neg`,`IntValue`,1),ag=e=>{let t=Gi(e,`DotDot`,`IntervalValue`,2);return[Ki(e,`+`,`Plus`,(e,t)=>e+t),Ki(e,`-`,`Minus`,(e,t)=>e-t),Ki(e,`*`,`Times`,(e,t)=>e*t),Ki(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}),Ki(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(Pi(r))throw Fi(`${t} \\div ${n}`);return r}),Ki(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:Wi(V(e,0,`..`),t),high:Wi(V(e,1,`..`),t)}))]},og=ag(`Naturals`),sg=ag(`Integers`),cg=e=>{let t=og.indexOf(e);return t===-1?void 0:sg[t]},lg=[Ai(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...og,Ji(`<`,(e,t)=>e<t),Ji(`>`,(e,t)=>e>t),Ji(`<=`,(e,t)=>e<=t),Ji(`>=`,(e,t)=>e>=t,`>`)],ug=[Ai(`Int`,{kind:`InfiniteSet`,name:`Int`}),...sg,Ji(`>=`,(e,t)=>e>=t),H(`-.`,1,e=>{let t=Wi(V(e,0,`-`),ig);if(Pi(-t))throw Fi(`-${t}`);return-t})],dg=(e,t,n)=>{let r=V(e,t,n),i=Sr(r);if(!i)throw new S(`${n}\n${z(r)}`);return i},fg=(e,t,n)=>{let r=V(e,t,n);return typeof r==`string`?r:dg(e,t,n)},pg=(e,t,n)=>typeof e==`string`?At(e.slice(t,n)):Qn(e.slice(t,n)),mg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,hg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,gg=(e,t)=>{let n=Gd.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Ui(e,t):e}):t},_g=e=>gg(`Sequences`,[H(`Seq`,1,e=>({kind:`SequenceSet`,base:V(e,0,`Seq`)})),H(`Len`,1,e=>fg(e,0,mg(``,`Len`)).length),H(`\\o`,2,e=>{let t=fg(e,0,hg(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=dg(e,1,hg(`t \\o s`,`sequence`));return Qn([...t,...n])}let n=V(e,1,`\\o`);if(typeof n!=`string`)throw new S(`${hg(`t \\o s`,`string`)}\n${z(n)}`);return At(t+n)}),H(`Append`,2,t=>Qn([...dg(t,0,hg(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),V(t,1,`Append`)])),H(`Head`,1,e=>{let t=dg(e,0,mg(``,`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=fg(e,0,mg(``,`Tail`));if(t.length===0)throw new S(`Attempted to apply Tail to the empty sequence.`);return pg(t,1)}),H(`SubSeq`,3,e=>{let t=fg(e,0,mg(`first `,`SubSeq`)),n=xi(e,1,`SubSeq`),r=xi(e,2,`SubSeq`);if(n>r)return pg(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 pg(t,n-1,r)}),ji(`SelectSeq`,2,e=>{let t=ki(e,1,`SelectSeq`);return Qn(dg(e,0,mg(`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}))})]),vg=e=>gg(`FiniteSets`,[H(`IsFiniteSet`,1,e=>{let t=V(e,0,`IsFiniteSet`);if(N(t))return br(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 vr(n,e)})]),yg=/* @__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:lg};case`Integers`:return{extends:[`Naturals`],operators:ug};case`Sequences`:return{extends:[],operators:_g(n.version)};case`FiniteSets`:return{extends:[],operators:vg(n.version)};case`TLC`:return{extends:[],operators:gg(`TLC`,Yh(t,n))};case`Randomization`:return{extends:[],operators:Ch(n)};case`_Possible`:return{extends:[],operators:Rh(t,n)};case`Json`:return{extends:[],operators:hh(r)};case`Bags`:return{extends:[],operators:Jm(i)};case`TLCExt`:return{extends:[],operators:Lh(t,n)};default:return}},xg=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}])),Sg={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]}},Cg=(e,t)=>{let n=Sg[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},wg=`$subexpression`,Tg=(e,t)=>new u(`${e} at line ${t.line}, column ${t.column}`),Eg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Eg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of _i(e)){let e=Eg(r,t,n);if(e)return e}},Dg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Og=(e,t)=>{let n=e.location,r=Dg(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 Tg(`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 Tg(`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:Ea},location:n}},kg=(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:Ea})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Ea}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Ea};return Og({...t,params:[...t.params,...r]},a)},Ag=(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 Tg(r,i);Oa.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 Tg(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>Xo(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw Tg(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=Na(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 Tg(`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&&Eg(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 Tg(`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`||eo(t.operand,1)!==0)throw Tg(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=io(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[eo(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw Tg(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=eo(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw Tg(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw Tg(`Unexpected subexpression selector`,i);let s=r?r.sets:ao(n),c=s?.[eo(t.operand,s.length)];if(!c)throw Tg(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return kg(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 Tg(`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 kg(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw Tg(`Subexpression selection failed`,i);return Og(a,o.current)},jg=(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 to(e,t,n)},Mg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||_i(e).some(Mg),Ng=(e,t,n,r=!1)=>{if(!Mg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=$o(e,e=>Ng(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Pg(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)=>Ng(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:$o(e,e=>Ng(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?jg(a.name,[],void 0,t):a.kind===`Apply`?jg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Ag(o,t,a,r);return c!==a&&Da.add(c),c},Pg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Ng(e.expression,t,n,!0)}))}),Fg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Ig=(e,t)=>Pg(e,Fg(t.definitions),()=>!1),Lg=(e,t)=>{let n=Fg([...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=>Ng(e,n,i),o=e=>i(e)||!n(e),s=e=>Ng(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 Pg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Pg(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=>Mg(e.body))||e.assumptions.some(e=>Mg(e.expression))?{...p,definitions:e.definitions.map(e=>Qo(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Rg=(e,t)=>`${e}${t}`,zg=(e,t,n)=>`${e}${t}${n}`,Bg=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Vg=(e,t,n)=>`${e},${t},${n}`,Hg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Ug=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Wg=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Gg=(e,t,n,r)=>({...Hg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Kg=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,qg=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Jg=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,{...Gg(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Yg=Gg(`$Set`,0,[2],[1]),Xg=Gg(`$Junction`,0,[3],[1]),Zg=Gg(`$Choose`,0,[2],[1]),Qg=Gg(`$Function`,0,[3],[1]),$g=Gg(`$FcnApply`,0,[2,2],[1,1]),e_=Gg(`$RcdSelect`,0,[2,0],[1,1]),t_=Gg(`'`,2,[1],[0]),n_=Gg(`ENABLED`,1,[2],[0]),r_=Gg(`[]`,3,[3],[0]),i_=Gg(`$SquareAct`,2,[2,1],[0,0]),a_=Gg(`$WF`,3,[1,2],[0,0]),o_=Gg(`$TemporalExists`,3,[3],[0]),s_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),c_=e=>e.map(e=>({name:e,arity:0})),l_=(e,t)=>t.location.range?_(`${e}.`,t.location.range):new u(`${e} at line ${t.location.line}, column ${t.location.column}`),u_=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),d_=e=>e.kind!==`Let`&&e.kind!==`Label`,f_=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=Jg.get(t)??xg.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Hg(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(zg(e,n,t))}),t.data.constraints.forEach((e,t)=>Ug(r.constraints,t,e)),Wg(r.argConstraints,Rg(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Wg(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>Kg(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(Vg(t,n,r)),s=Hg(Math.max(e.level,...t.filter((t,n)=>qg(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)=>{qg(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)=>Ug(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Ug(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Ug(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Ug(s.constraints,t,Kg(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=>Ug(s.constraints,e,Kg(r,a)))}))}),e.argParams.forEach(e=>{let t=Bg(e),n=a(t.operator)?.operator;n&&Ug(s.constraints,t.param,Kg(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Wg(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Wg(s.argConstraints,Rg(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Wg(s.argConstraints,Rg(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Bg(e),n=a(t.operator);n&&Wg(s.argConstraints,Rg(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Bg(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Bg(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(zg(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(zg(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(zg(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,c_(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=Hg();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=s_(n,c_(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 l_(`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 l_(`Action used where only temporal formula or state predicate allowed`,e);u_.has(e.operator)&&l(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&d_(n)&&n.kind!==r)throw l_(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)=>Ug(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Wg(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:l_(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Hg();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(Xg,n)}case`Prime`:case`Unchanged`:return s(t_,[e.expression],t);case`Enabled`:return s(n_,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(r_,[n])}case`If`:return s(Xg,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Xg,[...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(Xg,[e.body],t,e.bounds.map(e=>e.set),Ga(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw l_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?o_:Xg,[e.body],t,[],e.names);case`Choose`:return s(Zg,[e.body],t,e.set?[e.set]:[],Wa(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(Yg,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(Yg,[e.predicate],t,[e.bound.set],Wa(e.bound.pattern));case`SetMap`:return s(Yg,[e.expression],t,e.bounds.map(e=>e.set),Ga(e.bounds));case`FunctionConstruction`:return s(Qg,[e.body],t,e.bounds.map(e=>e.set),Ga(e.bounds));case`Record`:return s(Qg,e.fields.map(e=>e.value),t);case`RecordSet`:return s(Yg,e.fields.map(e=>e.value),t);case`Except`:return s(Yg,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i($g,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(Yg,e.args,t)}]);case`Bracket`:return Hg();case`FieldAccess`:return i(e_,[a(e.record,t),{data:Hg()}]);case`BoxAction`:case`AngleAction`:return s(i_,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(a_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Hg()}},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 _i(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,s_(t,c_(e.names))),i;default:return $o(e,(e,n)=>(a(e,r,s_(t,c_(n))),e)),i}},_=(e,t,n,r)=>{let i=s_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Hg(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(Rg(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(zg(e.name,n,t.name))).map(e=>Vg(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(Bg(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Bg(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,{...Hg(),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}},p_=(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`?p_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Hg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Ug(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Wg(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},m_=(e,t,n,r)=>{let i=f_(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`?p_(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=Uo([...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`?p_(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)},h_=(e,t)=>e.maxLevels[t]??3,g_=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=f_({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=>Ug(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Ug(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Wg(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Bg(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)&&Ug(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(p_(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(Rg(e.name,i));a!==void 0&&h_(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=Bg(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=h_(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()])}},__=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],v_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),y_=new Map(Bd.flatMap(e=>e.map(t=>[t,e[0]]))),b_=e=>y_.get(e)??e,x_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},S_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(x_(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()}},C_=(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}},T_=(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}},E_=e=>({line:e.line,column:e.column}),D_=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=T_(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}return{references:s,end:e.length}};return i(0,t??``).references},O_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,k_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},A_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&O_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&O_(e[n+1],e[n+2])?n+=O_(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=>k_[e])}"`:r.text)}return t},j_=e=>e[2]?.text,M_=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},N_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>N_(e.modules,t)).find(Boolean),P_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:Wd.get(i)??t?.(i)??zp(e,i),s=o===void 0?[]:Ce(o),c=M_(s),l=c.get(j_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Vp(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>N_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},F_=(e,t)=>{let n=P_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=T_(t,e+1);r.push({location:E_(t[e]),apply:e=>i.forEach(t=>e.put(C_(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:E_(u),apply:t=>t.put(C_(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`&&T_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),v_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(E_(u)),r.push({location:E_(u),apply:e=>e.put(C_(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(C_(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(C_(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(C_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(C_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Ma(e.location,t.location)?-1:+!!Ma(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=S_();i.set(e??``,s),zd.toReversed().forEach(e=>s.put(C_(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))}}},I_=(e,t,n)=>F_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),L_=(e,t)=>{let n=F_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},R_=(e,t)=>I_(e,t,`variable`),z_=(e,t,n)=>{let r=P_(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)}),Vd.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=D_(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;A_(s(void 0)).forEach((e,t)=>{t===3&&Ud.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??j_(r(void 0).tokens);throw m(n,e)}A_(s(n)).forEach(a)}}__.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),Hd.forEach(a),[...i]},B_=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 In(t.elements.map(B_))}},V_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],H_=(e,t)=>{try{return Vp(e)}catch(n){if(!(n instanceof u))throw n;let r=pp(e);throw r===void 0?n:p([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},U_=e=>new u(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),W_=(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)}.`},G_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,K_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:G_(e),q_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Ea},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),J_=(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`)&&tn(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}},Y_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||_i(e).some(e=>Y_(e,t)),X_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(cs(e),n.get(e)??n.size)),n},Z_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Q_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw sl(e);if(e.kind===`Number`&&!gu(e.value))throw cl(e);Q_(e.kind===`Let`?[..._i(e),...Z_(e.instances??[])]:_i(e))}),$_=(e,t)=>{let n=Vp(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Set,s=new Map(rg.map(e=>[e.name,e])),c=/* @__PURE__ */ new Map,l=Tm(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=g_(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;yg.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:xg.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Cg(e,t.name)??i.get(t.name)?.range})}),c.set(e,i),i},E=e=>{let t=T(e),n=yg.get(e)??[];return t&&S(e,n),t&&n.includes(`Integers`)&&T(`Integers`),t},D=e=>(Q_([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...Z_(e.instances)]),e.modules.forEach(D),e);D(n);let ce=(e,n)=>{let r=t.loadModule?.(e)??Dd.get(e)??zp(t.source,e);if(r===void 0)throw m(e,n);let i=H_(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&&W_(s,c.module);if(l)throw p([l],!1,void 0,C);if(s)throw U_(s);return a.forEach(e=>e()),{linked:o,closure:n}},ue=(e,t)=>{let n=d.get(e);if(n)return S(e,x.get(e)??[]),n;let r=le(ce(e,t));return d.set(e,r.linked),x.set(e,r.closure),S(e,r.closure),r.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=V_(u),f=`#${ne.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Ho(Ig(e,t),d,t,n);ie.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=bs({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:Ea})),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=V_(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=>Y_(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=[],_=bs({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:Ea}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Ea}])),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}:q_(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=Rd(e,t.loadClass?.(e.name),e===n);ye.set(e.name,o.overrides);let s=o.module,c=ie.length,l=new Map([...rg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...a.symbols]),u=/* @__PURE__ */ new Map,d={location:Lo,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);K_(n.kind)===K_(e.kind)?d.warnings.push({location:r,message:`Warning: the ${G_(n.kind)} of '${t}' conflicts with \nits ${G_(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${G_(e.kind)} of '${t}' conflicts with \nits ${G_(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:Na(e),params:Pa(e),kind:Ro(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&&Ma(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=V_(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=>Ma(t.location,e)).map(e=>[e.name,oe(e)]),...s.definitions.filter(t=>Ma(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&&W_(e,n.module);if(n&&!r)throw U_(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)=>Ma(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=Lg(ws(s,(e,t)=>_e(e,t,s.name,he(e))),ve(l));a.errors.push(...Wo(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&&!Ma(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(()=>m_(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=B_(e.value);Nn(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(B_),B_(e.value)]),Ae.set(t,n)}),Ae.forEach(e=>A(e).forEach(t=>ke(t,J_(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 ${I_(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=cg(e);n&&s.set(t,n)});let Fe={runtime:l,definitions:r,builtins:s,constants:De,substitutions:je,instanceNames:se,variables:Te,variableIndex:X_(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=f_({constants:new Set(De.keys()),variables:/* @__PURE__ */ new Set([...Te,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>s.has(e))]),getDefinition:e=>gl(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}${ya(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=L_(t.source,t.loadModule);return{environment:Fe,assumptions:Ce,variableLocations:xe.variableLocations,instanceActions:oe,startupDefinitions:b.filter(e=>!j.has(e.module.name)||V_(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)??[])}},ev={kind:`Boolean`,value:!0},tv={kind:`Boolean`,value:!1},nv=e=>e?ev:tv,rv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,iv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,av=(e,t)=>({kind:e,body:t}),ov=(e,t,n)=>({kind:e,operands:[t,n]}),sv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?sv(e,t.operands).operands:[t])}),cv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return cv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,cv(t)),0)}},lv=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 lv(e.body);case`And`:case`Or`:return e.operands.some(lv)}},uv=/* @__PURE__ */ new WeakMap,dv={count:0},fv=e=>{let t=uv.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`#${dv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(fv).join(`,`)})`;default:return`${e.kind}(${fv(e.body)})`}})();return uv.set(e,n),n},pv=(e,t)=>e===t||fv(e)===fv(t),mv=(e,t)=>{let n=fv(t);return e.some(e=>e===t||fv(e)===n)},hv=e=>e===`And`?`Or`:`And`,gv=(e,t)=>{switch(e.kind){case`Boolean`:return t?nv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?av(`Not`,e):e;case`Not`:return gv(e.body,!t);case`And`:case`Or`:return sv(t?hv(e.kind):e.kind,e.operands.map(e=>gv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return av(n,gv(e.body,t))}}},_v=e=>{switch(e.kind){case`Boolean`:return nv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return sv(hv(e.kind),e.operands.map(_v));case`Always`:return av(`Eventually`,_v(e.body));case`Eventually`:return av(`Always`,_v(e.body));default:return av(`Not`,e)}},vv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=vv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return nv(t)}return n.length===0?nv(!t):n.length===1?n[0]:sv(e.kind,n)}case`Not`:{let t=vv(e.body);return t.kind===`Boolean`?nv(!t.value):av(`Not`,t)}case`Always`:case`Eventually`:{let t=vv(e.body);return av(e.kind,t.kind===e.kind?t.body:t)}default:return e}},yv=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=>sv(`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=yv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:sv(`Or`,t);n.push(av(`Always`,av(`Eventually`,e)))}return sv(`Or`,n)}case`Not`:return rv(e.body)?e:bv(_v(e.body));default:return e}},xv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?xv(e.operands[0]):sv(e.kind,e.operands.map(xv));case`Not`:return e.body.kind===`Not`?xv(e.body.body):av(`Not`,xv(e.body));case`Always`:case`Eventually`:case`Next`:return av(e.kind,xv(e.body));default:return e}},Sv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Sv(e.operands[0]);let t=Math.floor(e.operands.length/2);return ov(e.kind,Sv(sv(e.kind,e.operands.slice(0,t))),Sv(sv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return av(e.kind,Sv(e.body));default:return e}},Cv=(e,t)=>{e.kind===`Eventually`&&!mv(t,e)&&t.push(e),`body`in e&&Cv(e.body,t),`operands`in e&&e.operands.forEach(e=>Cv(e,t))},wv=e=>{let t=e.filter(iv),n=e.flatMap(e=>e.kind===`Not`&&iv(e.body)?[e.body]:[]);return!t.some(e=>mv(n,e))},Tv=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,av(`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},Ev=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:av(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Dv=(e,t,n)=>e.flatMap(e=>{let r=Ev(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Ov=e=>[...new Set(e.map(fv))].sort().join(`|`),kv=(e,t)=>{let n=new Set(t.map(Ov));return[...e.filter(e=>!n.has(Ov(e))),...t]},Av=e=>{let t=Tv(e),n=Dv(t,`Always`,`And`),r=Dv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Ev(t,`Eventually`,`Or`);if(n&&!(mv(e,n.first)||mv(e,n.second)))return kv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(mv(e,t.first)||mv(e,t.second))&&!mv(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=Ev(t[e],`Always`,`And`);n&&(mv(t,n.first)||t.push(n.first),mv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)mv(t,e.first)&&mv(t,e.second)&&!mv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!wv(t)?[]:i(t)};return a(e)},jv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>cv(e)<=1)}),Mv=e=>{let t=Av([e]).map(jv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Ov(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 Av(n)){let n=Ov(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(jv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Nv=(e,t)=>!mv(e,t)||mv(e,t.body),Pv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&cv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=yv(e);if(n){let e=cv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(lv(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Fv=(e,t)=>{let n=e.findIndex(e=>pv(e,t));return n===-1?(e.push(t),e.length-1):n},Iv=e=>{let t=bv(vv(gv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=xv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Pv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:sv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:pv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Sv(e.formula),n=[];t&&Cv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Fv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Fv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Fv(i,e))}));return{tableau:t&&Mv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Lv=()=>n(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.livenessEvaluationFailure),Rv=()=>n(new x,e.error),zv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Bv=/* @__PURE__ */ new WeakMap,Vv=/* @__PURE__ */ new WeakSet,Hv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Uv=(e,t)=>new y(`TLC cannot handle the temporal formula ${$c(e)}${t===void 0?``:`:\n${t}`}`),Wv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ll(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Wv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Wv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=gl(e,n);if(t)return Gv(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 $o(e,(e,a)=>(i.value=Math.max(i.value,Wv(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 zv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Gv=(e,t)=>{let n=Bv.get(e);if(n!==void 0)return n;Bv.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(Wv(e.body,void 0,t),...r.map(e=>Wv(e.set,void 0,t)));return Bv.set(e,i),i},Kv=(t,r)=>{try{return kl(t,r)}catch(t){if(!(t instanceof y))throw t;if(!ya(t))return;throw n(new y(`${o(`tlc2.tool.EvalException`)}${t.message}`),e.error)}},qv=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>qv(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,$c(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,Jv(e,t,n));if(e.kind===`Identifier`){let r=B(e)?ll(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:gl(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Gv(a,n)>0){if(i.has(a))throw Rv();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=Hv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Wv(e,t,n)===3)){let t=eu(e,c),r=B(e)?void 0:gl(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,fu(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>Wv(e.set,t,n)===0),u=l?Kv(e.bounds,c):void 0;if(l&&u){let n=[];if(Al(e.bounds,u,t,t=>(n.push(...s(e.body,t,$c(e.body))),!1)),n.length===0)throw Lv();return n}return[{expression:e,scope:t,name:o}]},Jv=(e,t,n)=>{let r=mu(e.definitions,Hv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Vv.add(e.binding);return r},Yv=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),Xv=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?Wv(e,t,n):i;if(a===0){let r=W(e,Hv(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${el(e)}`);return nv(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 Rv();a.depth++;let o=f(e,t);a.depth--;let s=cv(o);return s>2?o:i(n,r,s)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=Hv(n,t),s=B(e)||gl(i,n)===void 0?ll(t,i):void 0;if(s?.kind===`Thunk`&&Vv.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:B(e)?tu(i,a):Ql(i,n);if(l?.kind!==`Closure`)throw Uv(e);let u=e.kind===`Apply`?e.args:[],d=!B(e)&&gl(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,fu(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:Uv(e)}},l=(e,t)=>{let r=Wv(e,t,n);if(!e.bounds.every(e=>Wv(e.set,t,n)===0)){if(r<=2)return i(e,t,r);throw Uv(e)}let a=[],o=e.kind===`Forall`;try{jl(e.bounds,Hv(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 Uv(e,o&&!ya(n)?n.message:void 0)}return a.length===0?nv(o):u(e,t,sv(o?`And`:`Or`,a))},u=(e,t,n)=>{let r=cv(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=Wv(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,Jv(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?av(`Always`,ov(`Or`,av(`Not`,f(n[0],t)),av(`Eventually`,f(n[1],t)))):e.operator===`~`&&!B(e)?u(e,t,av(`Not`,f(n[0],t))):e.operator===`=>`?u(e,t,ov(`Or`,av(`Not`,f(n[0],t)),f(n[1],t))):s(e,t)}case`And`:case`Or`:return u(e,t,sv(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(!r&&Wv(e.condition,t,n)===0){let r=W(e.condition,Hv(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return u(e,t,ov(`Or`,ov(`And`,i,f(e.consequent,t)),ov(`And`,av(`Not`,i),f(e.alternative,t))))}case`Always`:case`Eventually`:return av(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=Yv(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=av(`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`?av(`Always`,av(`Eventually`,ov(`Or`,i,a))):ov(`Or`,av(`Eventually`,av(`Always`,i)),av(`Always`,av(`Eventually`,a)))}default:throw Uv(e)}};return f(e,t)},Zv=(e,t,n,r,i)=>{let a=e=>Zv(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`?hl(W(e.expression,a),`a temporal property predicate`):Hc(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&&hl(W(e.unchanged,a),`a subscript`)?!1:hl(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 Zv(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 Zv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},$v=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return $v(e.body);case`And`:case`Or`:return e.operands.some($v);default:return!1}},ey=e=>e.promises.some(e=>$v(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),ty=(e,t)=>e.every((e,n)=>rn(e,t[n])),ny=e=>e.filter((t,n)=>n===0||e[n-1]!==t),ry=e=>({data:e(1024),length:0,create:e}),iy=(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)},ay=e=>new Int32Array(e).fill(-1),oy=(e,t)=>(e.edgeStarts[t]??-1)!==-1,sy=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},cy=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,ly=(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),uy=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},dy=2**53-1,fy=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>Xv(e.expression,e.scope,n)),a=e.map(e=>av(`Not`,Xv(e.expression,e.scope,n))),o=a.length===1?a[0]:sv(`Or`,a),s=i.length===0?o:sv(`And`,[...i,o]),c=Iv(s);if(c.length===0)throw Lv();let l=/* @__PURE__ */ new Map,u=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=fv(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:ry(e=>new Int32Array(e)),edgeActions:ry(e=>new Uint8Array(e)),stateResults:ry(e=>new Uint8Array(e)),initial:[],firstNodes:ry(ay),lastNodes:ry(ay),nextSiblings:[],isDone:[],errorNode:void 0})),d={multiplier:1},f=!Du(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)=>Zv(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=>+!!Zv(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]=+!!Zv(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)=>e.solution.tableau?uy(e,t).find(t=>e.nodeTableaux[t]===n):t,ne=(e,t,n)=>{let r=ly(e,t,n),i=e.lastNodes.data[t]??-1;return i===-1?iy(e.firstNodes,t,[r]):e.nextSiblings[i]=r,iy(e.lastNodes,t,[r]),r},re=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;iy(e.edgeTargets,a,n),r.forEach((t,n)=>iy(e.edgeActions,(a+n)*o,t)),iy(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&&ty(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 uy(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 ny(se(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)ly(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{oy(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)oy(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 sy(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}oy(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=>oy(e,t)),c=[],l=t=>{let n=sy(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&Nv(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=dy;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]=dy,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>cy(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>sy(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=ny(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]&&cy(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(sy(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=sy(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:ey(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 sy(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++};sy(e,l).forEach((t,r)=>{oy(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)=>!Qv(a[i].body,t,r,0,n)).map(e=>e.name))]}},py=`UnnamedAction`,my={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},hy=e=>{let t=e.range??my;return $n([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},gy=e=>{let t=[[`name`,e.name],[`location`,hy(e.location)]];return e.parameters.length===0?$n(t):$n([...t,[`context`,$n(e.parameters)],[`parameters`,Qn(e.parameters.map(e=>e[0]))]])},_y=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),vy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),yy=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,by=e=>e.kind===`Apply`?e.args:[],xy=(e,t,n)=>{let r=yy(e);if(r===void 0)return;if(B(e)){let e=ll(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},Sy=(e,t)=>{try{return W(e,vy(t,void 0)),!0}catch(e){if(e instanceof l)return!1;throw e}},Cy=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&bl(e,t)&&Sy(e.body,t),wy=(e,t)=>{let n=gl(e.name,t);return n?.body===e.body&&Cy(n,t)},Ty=(e,t)=>{if(e.kind!==`Identifier`||!B(e))return;let n=ll(t,e.name);return n?.kind===`Thunk`?n:void 0},Ey=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ll(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Dy=(e,t)=>{try{return e()}catch(e){if(e instanceof l)return t();throw e}},Oy=(e,t,n,r,i)=>{let a=by(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=>Wv(e,n,i)!==0)?o():Dy(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,vy(i,n))]),expression:t,scope:n}],o)},ky=(e,t,n,r,i)=>{let a=()=>({name:n?.name??py,location:e.location,parameters:Ey(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return ky(e.body,mu(e.definitions,vy(r,t)),n,r,i);case`Label`:return ky(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>ky(e,t,n,r,i));case`Exists`:return Dy(()=>{let o=[];return jl(e.bounds,vy(r,t),t=>(o.push(...ky(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=B(e)?void 0:i.get(yy(e)??``),s=xy(e,t,r);if(o)return Oy(o,e,t,s,r);if(!s)return[a()];let c=by(e),l=B(e)?s.name:r.instanceNames.get(yy(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return wy(s,r)||c.some(e=>Wv(e,t,r)!==0)?u():Dy(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,vy(r,t))},parent:e}),s.scope);return ky(s.body,e,{...s,name:l},r,i)},u)},Ay=(e,t,n,r,i)=>{let a=(e,t)=>Ay(e,t,n,r,i);if(e.kind===`Let`){a(e.body,mu(e.definitions,vy(n,t)));return}let o=Ty(e,t);if(o){a(o.expression,o.scope);return}let s=xy(e,t,n);if(s&&wy(s,n))return;if(s&&s.params.length===0){if(Wv(s.body,s.scope,n)===1){r.inits.push(_y(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,fu(s,e.args,vy(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(_y(py,e));return}let c=Wv(e,t,n);c<=1?r.inits.push(_y(py,e)):c===3&&r.temporals.push(_y(py,e))},jy=(e,t,n,r,i)=>{let a=(t,n)=>jy(e,t,n,r,i);if(t.kind===`Let`){a(t.body,mu(t.definitions,vy(r,n)));return}let o=Ty(t,n);if(o){a(o.expression,o.scope);return}let s=xy(t,n,r);if(s&&wy(s,r))return;if(s&&s.params.length===by(t).length){a(s.body,t.kind===`Apply`?fu(s,t.args,vy(r,n)):s.scope);return}if(t.kind===`Forall`&&Dy(()=>(jl(t.bounds,vy(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(_y(e,a)):Wv(a,n,r)<2?i.invariants.push(_y(e,a)):i.impliedTemporals.push(_y(e,t));return}let c=Wv(t,n,r);c<=1?i.impliedInits.push(_y(e,t)):c===3&&i.impliedTemporals.push(_y(e,t))},My=(e,t)=>{let n=gl(e,t);return n?.kind===`Operator`&&!Cy(n,t)?n:void 0},Ny=e=>$n([[`name`,e.name],[`location`,hy(e.location)]]),Py=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:My(e.specification,t);a&&(Ay(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...ky(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(_y(e.init??``,o.body));let s=e.next===void 0?void 0:Ql(e.next,t);return s?.kind===`Closure`&&r.actions.push(...ky(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=My(e,t);n&&r.invariants.push(_y(e,n.body))}),e.properties.forEach(e=>{let n=My(e,t);n&&jy(e,n.body,void 0,t,r)}),r},Fy=(e,t,n)=>Py(e,t,n).inits,Iy=(e,t,n)=>Py(e,t,n).actions,Ly=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>z(e[1])).join(`,`)})`,Ry=(e,t)=>`${e.name===py?`Action`:e.name}${t===`1.7.4`?``:Ly(e)} ${g(e.location.range??my)}`,zy=e=>`${e.name}${Ly(e)}`,By=(e,t,n,r)=>{let i=Py(e,t,r),a=e=>In(e.map(gy)),o=e=>In(e.flatMap(e=>{let n=My(e,t);return n?[Ny(n)]:[]}));return $n([[`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`,In(t.variables.map((e,t)=>$n([[`name`,e],[`location`,hy(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},Vy=`paired12`,Hy=(e,t=16)=>e<=t*.75?t:Hy(e,t*2),Uy=(e,t)=>{let n=Hy(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)},Wy=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Gy=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Ky=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),qy=e=>Ky(e).replaceAll(`
|
|
468
|
+
`,`\\n`),Jy=(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(``))}},Yy=(e,t,n)=>{let r=n===`1.7.4`,i=[`strict digraph DiskGraph {
|
|
469
|
+
`,r?``:`node [shape=box,style=rounded]
|
|
470
|
+
`,e.colorize?`edge [colorscheme="${Vy}"]\n`:``,`nodesep=0.35;
|
|
432
471
|
`,`subgraph cluster_graph {
|
|
433
472
|
`,`color="white";
|
|
434
|
-
`],
|
|
435
|
-
`,`node [ labeljust="l",colorscheme="${
|
|
436
|
-
`,e.colorize&&
|
|
473
|
+
`],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="${Vy}",style=filled,shape=record ]\n`,...Uy([...o.keys()],Gy).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${o.get(e)}]\n`),`}`].join(``),u=()=>[...Uy([...a],e=>e[0]).map(e=>`{rank = same; ${Uy([...e[1]],Wy).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="${qy(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?Ky(r?o.name:o.signature):``;if(i.push(`${t.fingerprint} -> ${n.fingerprint} [label="${u}",color="${l}",fontcolor="${l}"];\n`),!a){let e=r?``:`,tooltip="${qy(n.getText())}"`;i.push(`${n.fingerprint} [label="${qy(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())}},Xy=(e,t,n)=>e.dot?Yy(e,t,n):Jy(e,t),Zy=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},$y=t=>n(new y(`${s}${t}`),e.error),eb=e=>{let t=kr(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!F(e)||!F(i))throw $y(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},tb=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(tb);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},nb=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,rb=(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 $y(`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 $y(`The symmetry operator must specify a set of functions.`);let o=L(a).elements;if(!o.every(P))throw $y(`The symmetry values must be function records.`);let s=o.map(eb),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=tb(nb(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(la.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(Zy(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=Zy(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(!nb(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}},ib=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=sb(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(sb(e[r],t));return a}},ab=(e,t)=>{let n=[],r=[];for(let i of e){let e=sb(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},ob=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,sb=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=ob(e);if(n===0||n>64)return cb(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=cb(e,t),a=i!==e&&rn(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},cb=(e,t)=>{let n=e.kind;if(n===`Set`){let n=ab(e.elements,t);return n?Ht(n):e}if(n===`Function`||n===`LazyFunction`&&I(e.domain)){let n=kr(e),r=ib(n.domain,t),i=ib(n.range,t)??n.range;if(r){let e=Hn(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=ib(r.elements,t);return i?In(i):r},lb=(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},ub=(e,t,n)=>e.images[t]??=sb(e.images[0],n.permutations[t-1]),db=(e,t,n,r)=>{let i=lb(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=zt(ub(i,t,r),ub(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},fb=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?db(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)=>fb(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?ub(lb(e,t),r,t):e)},mb=(e,t)=>e*((t-e)/2**64),hb=e=>e.includes(`.`)?e:`${e}.0`,gb=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return hb(String(e));let[n,r]=e.toExponential().split(`e`);return`${hb(n)}E${r.replace(`+`,``)}`},_b=e=>e!==void 0&&e>=`0`&&e<=`9`,vb=e=>{if(e===0)return`0.0`;let t=gb(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;_b(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(;_b(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;_b(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(_b(t[n.next])&&Number(t[n.next])>=5&&(n.result=yb(n.result));_b(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},yb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${yb(r)}.`:n===`9`?`${yb(r)}0`:`${r}${Number(n)+1}`},bb=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}`)},xb=(e,t,n)=>{if(mb(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},Sb=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}).`},Cb=(e,t)=>({...e,traceOutput:[...e.traceOutput??[],...t]}),wb={line:0,column:0},Tb=`Failed to recover the initial state from its fingerprint.`,Eb=`Failed to recover the next state from its fingerprint.`,Db=e=>({kind:`Identifier`,name:e,location:wb}),Ob=/* @__PURE__ */ new Set([`name`,`property`]),kb=(e,t,n)=>{let r=gl(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(Ob.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},Ab=(e,t,n)=>{if(bl(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return W(Db(e),$b(n,void 0,void 0))}catch(e){if(e instanceof y||c(e))return;throw e}},jb=(e,t,n)=>{let r=kb(e,t,n);if(Ab(t,r,n)!==void 0)throw new v(`The ${e} ${t} cannot be a constant.`);return r},Mb=(e,t,n)=>{let r=n.constants.has(t)?void 0:kb(e,t,n),i=r?Ab(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},Nb=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Pb=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Jl(e.startupDefinitions,r),t.invariants.forEach(e=>{Mb(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Fb=(t,r)=>{let i=f_({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>gl(e,r)});return t.flatMap(t=>{let a=Mb(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
|
|
437
476
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
438
477
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
439
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new y(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Bg(t),scope:void 0}]})},qg=(e,t)=>{if(!P(e))return;let n=xn(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Jg=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Jg(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=os(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Jg(n.body,t)}return[e]},Yg=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||ph(r,e.scope,t)>0)return!1;let i=_c(r,l_(t,void 0,void 0,e.scope));if(i===!1)throw new y(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new y(`The operator ${r.name}, which equals ${Y(i)},\ncannot be used as a ${n}`);return!0},Xg=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=Hg(t,e,r).body,i=Bg(e);if(n.kind!==`Number`&&n.kind!==`String`&&ph(i,void 0,r)===0)throw new y(`The ${t} ${e} cannot be a constant.`);return i};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}let i=[],a=[],o=[],s=Hg(`name`,t.specification,r),c=Wg(t.specification,s,r);if(c!==void 0)throw new y(`The value of ${t.specification} is equal to ${Y(c)}`);if(gh(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Yg(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new y(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&ph(c.expression,s.scope,r)<2)throw n(new y(`TLC cannot handle the temporal formula ${Go(c.expression)}`),e.error);let l=ph(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new y(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new y(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...i,...a],u=e=>`$specification${e}`,d=l.reduce((e,t,n)=>t.scope===void 0?e:{name:u(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),f=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:u(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(f),location:Lg},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},Zg=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=Gg(`property`,e,t);r&&gh(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(Yg(r,t,`property`))return;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){n.actionProperties.push({name:r.name,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:r.scope});return}if(i.kind===`Always`&&ph(i.expression,r.scope,t)<=1){let e=i.expression;n.invariants.push({name:e.kind===`Identifier`?e.name:r.name,expression:e,scope:r.scope});return}let a=ph(i,r.scope,t);if(a<2)n.initialPredicates.push({name:r.name,expression:i,scope:r.scope});else{if(a===2)throw new y(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},Qg=(e,t,n)=>t.flatMap(t=>Gg(e,t,n)?[{name:t,expression:Bg(t),scope:void 0}]:[]),$g=(e,t)=>{let n=os(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},e_=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new y(`_POSSIBLE lists ${n} more than once`);Ug(`possible`,n,t);let i=Bg(n);if(ph(i,void 0,t)===3)throw new y(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),t_=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||X(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},n_=(e,t)=>e.flatMap(e=>Jg(e.expression,t).map(n=>{let r=e.scope===void 0?Xc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:t_(n,r,t)}})),r_=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},i_=/[\u0100-\uffff]/,a_=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),o_=e=>e.kind===`String`?i_.test(e.value):e.kind===`Set`&&e.elements.some(o_),s_=e=>e.kind===`String`&&i_.test(e.value)||e.kind===`Apply`&&a_.has(e.operator)||dr(e).some(s_),c_=(e,t)=>e.constants.some(e=>o_(e.value)||(e.args??[]).some(o_))||[...t.definitions.values()].some(e=>s_(e.body)||e.kind===`Function`&&e.bounds.some(e=>s_(e.set))),l_=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),u_=(e,t,n)=>as(_c(e,t),n),d_=(e,t,n=f_)=>{let r=_c(e,t);if(typeof r!=`boolean`)throw new b(n(e,t.environment));return r},f_=(e,t)=>{let n=e.kind===`Identifier`?os(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${r.kind===`Number`?r.text??String(r.value):i?_(i):Go(r)}`},p_=()=>{},m_=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=u_(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),h_=(e,t,n)=>{try{return u_(e,l_(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof b)return{message:e.message};throw e}},g_=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=h_(n.expression,t,`an assumption`);if(e)return{name:Go(n.expression),trace:[],message:e.message}}},__=(t,r,i)=>{let a=Kg(t.invariants,r),o=Xg(t,r),s=Zg(t,r),c=n_([...a,...s.invariants],r),l=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(l||s.initialPredicates.length>0||r.variables.length>0))throw new y(`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&l)throw new y(`The configuration file did not specify the next state predicate.`);let u=n_(Qg(`constraint`,t.constraints,r),r),d=Qg(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Hg(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Hg(`periodic`,t.periodic,r);let f=e_(t.possible,r);if(r.variables.length===0)return;let p=t.symmetry===void 0?[]:yg(t.symmetry,r);t.view!==void 0&&Hg(`view function`,t.view,r);let m=t.view===void 0?void 0:{name:t.view,expression:Bg(t.view),scope:void 0},h=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Lg};return{...e,unchanged:t}}),g=e=>ph(e.expression,void 0,r)>=2,v=f.filter(e=>!g(e)),b=f.filter(g),x=r.runtime,S={indices:void 0},C=()=>{if(S.indices)return S.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return S.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),S.indices},w=p.length>0?C():void 0,T=(e,t)=>_c(e,l_(r,t,void 0)),ee=e=>{let t=C(),n=p.length===0?e:Dg(e,p,t);return ql(m===void 0?t.map(e=>n[e]):[T(m.expression,n)])},te=c_(t,r);x.getFingerprint=ee;let ne=()=>{let e=f.find(e=>!x.possibleCounts.get(e.name));if(!e)return;let t=$g(e.name,r),n=t?` at ${_(t)}`:``;return{name:e.name,message:`The _POSSIBLE predicate ${e.name}${n} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:Oe(Y(fu(x),!0))}};return{properties:s,spec:o,isSymmetric:p.length>0,getTlcOrder:C,getStoredFingerprints:(e,t)=>{if(m!==void 0||te)return BigInt64Array.from(e,ee);let n=new BigInt64Array(t.length),r=Xl(C(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(te)return[String(ee(e))];let t=p.length===0?e:Dg(e,p,w);return m===void 0?t:[T(m.expression,t)]},findViolatedInvariant:(t,i)=>c.find(a=>{if(r_(a,t,i))return!1;try{let e=l_(r,t,void 0,a.scope),n=a.membership;return i&&n?!bn(t[n.variable],i[n.variable],_c(n.set,e)):!d_(a.expression,e)}catch(t){throw i?C_(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>u.every(n=>{try{return r_(n,e,t)||d_(n.expression,l_(r,e,void 0))}catch(e){throw t?y_(e):e}}),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!d_(t.expression,l_(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>h.find(n=>{try{return!d_(n.action,l_(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Go(n.box)}`)&&!u_(n.unchanged,l_(r,e,t,n.scope),`a subscript`)}catch(e){throw C_(v_(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>d.every(n=>{try{return d_(n.expression,l_(r,e,t))}catch(e){throw y_(e)}}),trackStatePossible:v.length===0?p_:e=>m_(v,x,l_(r,e,void 0)),trackActionPossible:b.length===0?p_:(e,t)=>m_(b,x,l_(r,e,t)),findUnwitnessedPossible:ne,findPostconditionViolation:()=>{let e=ne();if(e)return e;for(let e of t.postconditions){let t=h_(Bg(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},v_=e=>e instanceof x?n(e,e.exitCode):e,y_=e=>e instanceof b&&!(e instanceof x)&&!(e instanceof C)?n(new b(`${l}${e.message}`,e),ne(e)):v_(e),b_=(e,t,n)=>t>0&&n[t-1]===e,x_=e=>e.flatMap(e=>e.location.range?[_(e.location.range)]:[]).filter((e,t,n)=>!b_(e,t,n)).map((e,t)=>`${t}) ${e}`).reverse(),S_=(e,t)=>{try{return e(),{callStack:void 0}}catch(e){if(!(e instanceof b))return{callStack:[]};let n=t.flatMap(e=>{let t=e.location.range;return t?[`Line ${t.start.line}, column ${t.start.column} to line ${t.end.line}, column ${t.end.column} in ${t.module}`]:[]}).filter((e,t,n)=>!b_(e,t,n)),r=Ae(e);return{callStack:n,fingerprint:r&&{sources:x_(r),reason:e.message}}}},C_=(e,t)=>e instanceof b?n(new b(`${t}\n${e.message}`,e),ne(e)):e,w_=t=>{let r=t.dump&&mg(t.dump,t.writeFile);try{return T_(t,r)}catch(t){throw d(t)?n(new b(u),e.error):t}finally{r?.close()}},T_=(t,r)=>{let i=typeof t.config==`string`?Se(t.config):t.config,a=t.onPrint??console.log,o={isMuted:!1,replayed:void 0},s=e=>{o.replayed?o.replayed.push(e):o.isMuted||a(e)},l=e=>{o.isMuted=!0;let t=e();return o.isMuted=!1,t};ze(um(t.source,i,t.loadModule));let f=Cm(i,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:s,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed}),p=f.environment,m=p.runtime;m.pause=t.onPause??(()=>{}),m.getSpecification=()=>ig(i,p,f.variableLocations,f.instanceActions);let h={depth:0},g=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:m.generatedStates,distinctStates:m.distinctStates,queuedStates:m.queueSize,depth:m.generatedStates===0?0:Math.max(h.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),_=Array.from({length:32},()=>0),v={newStates:0},S=()=>Math.min(v.newStates,31),T=()=>_.map((e,t)=>t===S()?e+1:e),ee=()=>({...g(`success`),outDegrees:[..._],fingerprintDistance:Fg(m.distinctStates,m.generatedStates,()=>E?E.getStoredFingerprints(M,me):BigInt64Array.from(M,m.getFingerprint))}),te=()=>lm(t.source,t.loadModule,`variable`),E=__(i,p,te),re=g_(f.assumptions,p);if(re)return g(`assumption-violation`,re);if(!E)return ee();let D=i.postconditions.length>0||i.possible.length>0,O=(e,t,n)=>{if(D){let e=t.loopStart;m.counterExample=of(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=E.findUnwitnessedPossible();return r||E.findPostconditionViolation(),g(e,r?{...t,unwitnessed:r}:t)},k=E.spec,A=E.getFingerprintState,ie={value:void 0},j=(e,t,n=!1)=>{if(!e.failure)return e;let r=[],a={...p,evaluators:/* @__PURE__ */ new WeakMap,trace:r},s=__(i,a,te);if(!s)return e;let c=[];o.replayed=c,ke.current=/* @__PURE__ */ new WeakMap;let l=S_(()=>t(s,a),r);return ke.current=void 0,o.replayed=void 0,{...e,failure:{...e.failure,replay:{output:c,...l,isBeforeError:n}}}},ae=(e,t)=>{try{Fe(A(e))}catch(e){throw t.trace&&Ae(e)&&(t.trace.length=0),e}},oe=e=>j(e,(e,t)=>{k.init!==void 0&&Bo(k.init,t,n=>(e.satisfiesConstraints(n)&&ae(n,t),e.findViolatedInvariant(n)!==void 0||e.findFailedInitialPredicate(n)!==void 0),k.scope)}),se=e=>{let t=he[e];t===-1?Ee():(se(t),we(t,M[t],M[e]))},ce=(e,t)=>j(e,(e,n)=>{se(t);let r=M[t];ie.value??=eg(i,p,f.instanceActions),ie.value.find(t=>Uo(t.expression,r,n,t.scope).some(t=>{let i=e.satisfiesConstraints(t.state)&&e.satisfiesActionConstraints(r,t.state);return i&&ae(t.state,n),!i&&e.findViolatedInvariant(t.state)!==void 0||e.findViolatedActionProperty(r,t.state)!==void 0}))}),le=i.view!==void 0||i.symmetry!==void 0,ue=[],de={getFingerprint:e=>ue[e]??=Number(BigInt.asIntN(32,m.getFingerprint(M[e]))),getSuccessors:e=>{let t=[];return k.next===void 0||Ho(k.next,e,p,n=>{if(ye(n.state),!(E.satisfiesConstraints(n.state,e)&&E.satisfiesActionConstraints(e,n.state)))return!1;let r=A(n.state),i=Le(Fe(r),r);return t.push({index:i,state:n.state}),!1},k.scope),t}},fe=c(()=>jh(E.properties.liveness,k.temporals,p,de)),pe=E.isSymmetric||fe!==void 0,M=[],me=[],he=[],ge=[],_e=[],ve={slots:new Int32Array(1<<17),size:0,shift:16},ye=ur(),be=e=>Object.fromEntries(E.getTlcOrder().map(t=>[p.variables[t],e[t]])),xe=(e,t,n,r)=>(m.getLevel=()=>n+1,m.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Ce(e,t[n].state,(t[n+1]??t[r??n]).state)),Ce=(e,t,n)=>{try{let r=Ug(`alias`,e,p).body,i=_c(Bg(e),l_(p,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return qg(i,a)??be(t)}catch(e){if(!(e instanceof y||e instanceof b))throw e;return{...be(t),_ALIASEvalError:e.message}}},we=(e,t,n)=>{ie.value??=eg(i,p,f.instanceActions);let r={...B};Object.assign(B,{index:e,isExpanding:!0,candidate:void 0});let a=A(n),o=ie.value.find(e=>Uo(e.expression,t,p,e.scope).some(e=>F(A(e.state),a)));return Object.assign(B,r),o&&ng(o)},Te=(e,t,n)=>{let r=i.alias,a=l(()=>(e.length>1&&Zs(p)&&Ee(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:we(t[r-1],e[r-1].state,n.state))));return e.map((t,i)=>({action:t.action,label:a[i],state:r===void 0?be(t.state):xe(r,e,i,n)}))},Ee=()=>k.init===void 0?[]:Vo(k.init,p,k.scope),De=e=>k.next===void 0?[]:Uo(k.next,e,p,k.scope),Oe=(e,t)=>F(A(e),me[t]),N=(e,t)=>De(e).find(e=>Oe(e.state,t)),je=(e,t)=>{let n=le||Zs(p)?Ee().find(t=>Oe(t,e[0])):M[e[0]];if(!n)throw new b(Rg);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=N(i,e[n]);if(!a)throw new b(t);r.push(a)}return r},Me=(e,t)=>{let n=[];for(let t=e;t!==-1;t=he[t])n.unshift(t);let r=le&&n.length>1?je(n,Rg):n.map(e=>({state:M[e],action:ge[e]}));if(!t)return Te(r,n);let i=le?De(M[e]).find(e=>F(e.state,t.state))?.action:t.action;return Te([...r,{state:t.state,action:i}],n)},Ne=e=>he[e]===-1?[{action:void 0,label:void 0,state:be(M[e])}]:Me(e),P=(t,r,i,a)=>{if(d(t))return B.isExpanding?P(n(new b(u),e.error),Ne(B.index)):P(new b(u),r,i);if(!(t instanceof b))throw t;return{...g(`error`,void 0,{message:t.message,trace:r,initialState:i&&!(t instanceof x)?be(i):void 0,exitCode:ne(t)}),outDegrees:a}},Pe=(e,t)=>{let n=je(e,zg),r=n[n.length-1].state;if(le&&t!==void 0&&t!==e.length-1&&N(r,e[t])===void 0)throw new b(zg);return n},Fe=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Ln(t,Un(e[n]));return Gn(e),t&1073741823},F=(e,t)=>{for(let n=0;n<t.length;n++)if(!nt(e[n],t[n]))return!1;return!0},Ie=e=>Math.imul(e,2654435761)>>>ve.shift<<1,Le=(e,t)=>{let n=ve.slots.length-1;for(let r=Ie(e);;r=r+2&n){let n=ve.slots[r+1];if(n===0)return-1;if(ve.slots[r]===e&&F(me[n-1],t))return n-1}},I=(e,t)=>{let n=ve.slots.length-1,r=Ie(e);for(;ve.slots[r+1]!==0;)r=r+2&n;ve.slots[r]=e,ve.slots[r+1]=t},L=(e,t)=>{if(ve.size++,ve.size*4>ve.slots.length){let e=ve.slots;ve.slots=new Int32Array(e.length*2),ve.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&I(e[t],e[t+1])}I(e,t+1)},R=e=>{m.distinctStates=M.length+1,h.depth=Math.max(h.depth,e),m.diameter=Math.max(m.diameter,e)},z=(e,t,n,r)=>{let i=n===-1?1:_e[n]+1;M.push(e),me.push(t),he.push(n),ge.push(r),_e.push(i)},B={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,isFingerprinting:!1,livenessSource:-1},Re=e=>e===-1?[]:[...Re(he[e]),M[e]];m.isSeen=e=>{let t=A(e);return Le(Fe(t),t)!==-1},m.getBehavior=e=>{let t=e===B.candidate?-1:M.indexOf(e);return t===-1?[...Re(B.index),e]:Re(t)},m.getCurrentState=()=>B.index===-1?void 0:M[B.index],m.setLivenessSource=e=>{B.livenessSource=e??-1},m.getLevel=e=>{let t=B.livenessSource;return t===-1?e===B.candidate?B.candidateLevel:B.index===-1?0:e===M[B.index]?_e[B.index]:B.isExpanding?_e[B.index]+1:0:e===M[t]?_e[t]:_e[t]+1};let V=(e,t)=>({fingerprint:BigInt.asIntN(64,m.getFingerprint(e)),level:t,getLabel:()=>cr(i.alias===void 0?be(e):Ce(i.alias,e,void 0)),getText:()=>cr(be(e))}),H=e=>{ye(e),m.generatedStates++,m.initialStates++,B.candidate=e,B.candidateLevel=1;let t=A(e),n=Fe(t),i=E.satisfiesConstraints(e);if(i&&E.trackStatePossible(e),i&&Le(n,t)!==-1)return;i&&(R(1),m.queueSize++,fe?.addInitialState(M.length,e),r?.writeInitialState(V(e,1)));let a=E.findViolatedInvariant(e);if(a)return O(`invariant-violation`,{name:a.name,trace:Te([{action:void 0,state:e}],[])});let o=E.findFailedInitialPredicate(e);if(o)return O(`liveness-violation`,{name:o.name,trace:Te([{action:void 0,state:e}],[])});i&&(L(n,M.length),z(e,t,-1,void 0))},U=(e,t,n,i,a)=>{let o=M[e];m.generatedStates++,B.candidate=t.state,B.candidateLevel=_e[e]+1,pe&&ye(t.state),B.isFingerprinting=!0;let s=A(t.state),c=Fe(s);B.isFingerprinting=!1;let l=Le(c,s),u=E.satisfiesConstraints(t.state,o);u&&E.trackStatePossible(t.state);let d=u&&E.satisfiesActionConstraints(o,t.state);d&&E.trackActionPossible(o,t.state);let f=d?l:-1;if(i&&d&&r?.writeSuccessor(i,V(t.state,_e[e]+1),f!==-1,a&&{name:a.name,signature:rg(a)}),f!==-1&&fe){let e=M[f],r=e.every((e,n)=>e===t.state[n]);n.push({index:f,state:r?e:t.state})}let p=d&&f===-1;if(p&&(R(_e[e]+1),v.newStates++),f===-1)try{let n=E.findViolatedInvariant(t.state,o);if(n)return O(`invariant-violation`,{name:n.name,trace:Me(e,t)})}catch(n){return P(n,Me(e,t),void 0,T())}let h=E.findViolatedActionProperty(o,t.state);if(h)return O(`liveness-violation`,{name:h.name,trace:Me(e,t)});p&&(pe||ye(t.state),L(c,M.length),fe&&n.push({index:M.length,state:t.state}),z(t.state,s,e,t.action),m.queueSize++)},W={result:void 0};if(k.init!==void 0)try{Bo(k.init,p,e=>{try{W.result=H(e)}catch(t){W.result=P(t,[],e)}return W.result!==void 0},k.scope)}catch(e){if(!(e instanceof w))return oe(P(e,[]));let t=P(e,[],e.state.map(e=>e??Ze(`null`)));return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}if(W.result)return oe(W.result);let Be=k.next;if(Be===void 0){if(M.length>0)throw new b(`No next state actions defined to generate successor states from.`);return ee()}let Ve=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),He=(e,t)=>{if(!Ve)return Ho(Be,e,p,e=>t(e,void 0),k.scope);ie.value??=eg(i,p,f.instanceActions);let n={isStopped:!1};return ie.value.reduce((r,i)=>n.isStopped?r:r+Ho(i.expression,e,p,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},Ue=e=>{let t=M[e],n=[],a=r&&V(t,_e[e]),o=He(t,(t,r)=>{try{W.result=U(e,t,n,a,r)}catch(n){if(B.isFingerprinting)throw n;let r=P(n,Me(e,t));W.result=d(n)?r:ce(r,e)}return W.result!==void 0});if(B.isExpanding=!1,W.result)return W.result;if(o===0&&i.checkDeadlock)return O(`deadlock`,{name:`deadlock`,trace:Ne(e)});try{let r=fe?.addState(e,t,n);if(!fe||!r)return;let i=Pe(r),a=fe.getViolatedProperties(i.map(e=>e.state),i.length-1);return O(`property-violation`,{name:a[0],properties:a,trace:Te(i,r)})}catch(r){return j(P(y_(r),Ne(e),void 0,T()),(r,i)=>jh(E.properties.liveness,k.temporals,i,de)?.addState(e,t,n),!0)}},We=(e,t)=>{ie.value??=eg(i,p,f.instanceActions);let n=ie.value,r=n.length===1?n[0]:n.find(t=>t.name===e.action),a=`variable${e.missing.length>1?`s are`:` is`} not defined: ${e.missing.join(`, `)}.\n`;return m.generatedStates++,P(n.length===1?e:new b(`Successor state is not completely specified by action ${e.action} of the next-state relation. The following ${a}`),[...Ne(t),{action:e.action,label:r&&ng(r),state:be(e.state.map(e=>e??Ze(`null`)))}])},Ge=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=Pe(n,r),a=Te(i,n,r),o=e.getViolatedProperties(i.map(e=>e.state),r),s=n[r],c=n[n.length-1],u=i[i.length-1].state,d=s===c?void 0:l(()=>we(c,u,M[s]));return O(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:d},()=>s===c?a[a.length-1].action:N(u,s)?.action)},Ke=fe!==void 0&&t.livenessCheck!==`final`,qe=performance.now(),Je={at:qe+3e3,size:1,time:0},Ye=e=>{let t=performance.now();if(Je.at=t+6e4,!((e-Je.size)/Je.size>.1)||Je.time>(t-qe)*.2)return;Je.size=e;let n=fe?.findViolation();return Je.time+=performance.now()-t,n};for(let e=0;e<M.length&&!m.isStopped;e++){B.index=e,B.candidate=void 0,m.queueSize=M.length-e-1,B.isExpanding=!0;try{W.result=Ue(e)}catch(t){let n=t instanceof C?We(t,e):P(y_(t),Ne(e));W.result=t instanceof C||d(t)?n:ce(n,e)}if(W.result)return W.result;if(_[S()]++,v.newStates=0,Ke&&performance.now()>=Je.at){let t=Ye(e+1);if(fe&&t)return Ge(fe,t)}}B.index=-1,B.candidate=void 0;let Xe=fe?.findViolation();if(fe&&Xe)return Ge(fe,Xe);let Qe=E.findPostconditionViolation();return Qe?g(`postcondition-violation`,{...Qe,trace:[]}):ee()},E_=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},D_=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Un(e[t]),16777619),r=Math.imul(r^Qn(e[t]),1540483477);Gn(e),t[0]=E_(n)||1,t[1]=E_(r)},O_=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},k_=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},A_=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),j_=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return k_(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},M_=e=>Atomics.load(e.used,0)*2>=e.slots.length,N_=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&k_(t,n);return{slots:t,used:e.used}},P_=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=Mn(e.domain);return t?(r(7),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},F_=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Ze(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=Vt({kind:`Interval`,low:e,high:e+t-1});return $e(a,i(t))}let a=n[r.index++];if(e===5)return Qe(i(a));let o=i(a);return $e(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return ze}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return m}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Zs}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return cr}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return ur}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return b}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return T}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return fe}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return y}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return Y}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return te}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return jl}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Uo}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return h}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return Cm}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return N_}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return rd}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return D_}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return g_}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return Mg}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Ig}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return Og}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return A_}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return Se}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return Ve}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return w_}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return Fg}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return P_}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return j_}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Pg}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return O_}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return M_}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return F_}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return __}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return lm}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Vo}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return Al}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return um}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return ee}});
|
|
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:Db(t),scope:void 0}]})},Ib=(e,t)=>{if(!P(e))return;let n=kr(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])))},Lb=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Lb(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=gl(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Lb(n.body,t)}return[e]},Rb=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Wv(r,e.scope,t)>0)return!1;let i=W(r,$b(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},zb=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return jb(t,e,r),Db(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=kb(`name`,t.specification,r),c=Ab(t.specification,s,r);if(c!==void 0)throw new v(`The value of ${t.specification} is equal to ${z(c)}`);if(qv(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Rb(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`&&Wv(c.expression,s.scope,r)<2)throw n(new y(`TLC cannot handle the temporal formula ${$c(c.expression)}`),e.error);let l=Wv(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:wb},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},Bb=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=Mb(`property`,e,t);if(!i)return;Wv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;qv(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(Rb(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`&&Wv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!B(e)?gl(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=Wv(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},Vb=(e,t,n)=>t.flatMap(t=>Mb(e,t,n)?[{name:t,expression:Db(t),scope:void 0}]:[]),Hb=(e,t)=>{let n=gl(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Ub=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);jb(`possible`,n,t);let i=Db(n);if(Wv(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}}),Wb=(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},Gb=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=gl(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},Kb=(e,t)=>e.flatMap(e=>Lb(e.expression,t).map(n=>{let r=e.scope===void 0?Cd(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Wb(n,r,t),predicate:Gb(e.expression,t)}})),qb=(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},Jb=/[\u0100-\uffff]/,Yb=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Xb=e=>e.kind===`String`?Jb.test(e.value):e.kind===`Set`&&e.elements.some(Xb),Zb=e=>e.kind===`String`&&Jb.test(e.value)||e.kind===`Apply`&&Yb.has(e.operator)||_i(e).some(Zb),Qb=(e,t)=>e.constants.some(e=>Xb(e.value)||(e.args??[]).some(Xb))||[...t.definitions.values()].some(e=>Zb(e.body)||e.kind===`Function`&&e.bounds.some(e=>Zb(e.set))),$b=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),ex=(e,t,n)=>hl(W(e,t),n),tx=(e,t,n=nx)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},nx=(e,t)=>{let n=e.kind===`Identifier`?gl(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?Qc(i):el(r)}`},rx=(e,t)=>tx(e.expression,t,(n,r)=>(tx(e.predicate,t),nx(n,r))),ix=()=>{},ax=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=ex(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),ox=(e,t,n)=>{try{return ex(e,$b(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},sx=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=ox(n.expression,t,`an assumption`);if(e)return{name:$c(n.expression),trace:[],message:e.message}}},cx=(t,r,i,a)=>{let o=Fb(t.invariants,r),c=zb(t,r),l=Bb(t,r,a),u=Kb([...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`?pa:`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=Kb(Vb(`constraint`,t.constraints,r),r),m=Vb(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&kb(`rlreward`,t.rlReward,r),t.periodic!==void 0&&kb(`periodic`,t.periodic,r);let h=Ub(t.possible,r);if(r.variables.length===0)return;let g=t.symmetry===void 0?void 0:rb(t.symmetry,r,t.substitutions);t.view!==void 0&&kb(`view function`,t.view,r);let _=t.view===void 0?void 0:{name:t.view,expression:Db(t.view),scope:void 0},b=l.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:wb};return{...e,unchanged:t}}),x=e=>Wv(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,$b(r,t,void 0)),C=e=>{let t=re(),n=g===void 0?e:pb(e,g,t);return am(_===void 0?t.map(e=>n[e]):[ie(_.expression,n)])},ae=Qb(t,r);S.getFingerprint=C;let oe=()=>{let e=h.find(e=>!S.possibleCounts.get(e.name));if(!e)return;let t=Hb(e.name,r),n=t?` at ${Qc(t)}`:``;return{name:e.name,code:la.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(Em(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=cm(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(qb(a,t,i))return!1;try{let e=$b(r,t,void 0,a.scope),n=a.membership;return i&&n?!Or(t[n.variable],i[n.variable],W(n.set,e)):!rx(a,e)}catch(t){throw i?hx(n(t,e.safetyEvaluationFailure),la.invariantEvaluationFailed,`Evaluating invariant ${a.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>tx(n,$b(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=>tx(e.predicate,$b(n,t,void 0,e.scope)))&&m.every(r=>tx(r.expression,$b(n,e,t,r.scope))))||r())||d.every(e=>tx(e.predicate,$b(n,t,void 0,e.scope))))&&b.every(r=>tx(r.box,$b(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>p.every(n=>qb(n,e,t)||rx(n,$b(r,e,void 0))),findFailedInitialPredicate:e=>l.initialPredicates.find(t=>!tx(t.expression,$b(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>b.find(n=>{try{return!tx(n.action,$b(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${$c(n.box)}`)&&!ex(n.unchanged,$b(r,e,t,n.scope),`a subscript`)}catch(e){throw hx(lx(e),la.actionPropertyEvaluationFailed,`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>m.every(n=>tx(n.expression,$b(r,e,t),e=>`${s}${nx(e,r)}`)),trackStatePossible:ee.length===0?ix:e=>ax(ee,S,$b(r,e,void 0)),trackActionPossible:te.length===0?ix:(e,t)=>ax(te,S,$b(r,e,t)),findUnwitnessedPossible:oe,findPostconditionViolation:(i=!1)=>{let a=t.postconditions.find(e=>{let t=gl(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=ox(Db(e),r,`a postcondition`);if(!t)continue;let n=Hb(e,r),i=n?` at ${Qc(n)}`:``;return t.message===void 0?{name:e,code:la.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:la.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},lx=e=>e instanceof S?n(e,e.exitCode):e,ux=/* @__PURE__ */ Error(`The replay stopped`),dx=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),fx=t=>{let n=va(t.message);return n&&!n.isEvalException&&dx.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},mx=/* @__PURE__ */ new WeakMap,hx=(e,t,r)=>{if(!(e instanceof y))return e;let i=n(new y(`${r}\n${e.message}`,e),oe(e));return mx.set(i,{code:t,headline:r,inner:e}),i},gx=s.slice(0,s.indexOf(`
|
|
479
|
+
`)),_x=`${s}tlc2.tool.EvalException: `,vx=`${s}util.Assert$TLCRuntimeException: `,yx=o(`tlc2.tool.EvalException`),bx=e=>ya(e)?_x:vx,xx=e=>{try{return e()}catch(e){throw e instanceof y?ya(e)?new y(`${yx}${e.message}`):va(e.message)?e:new y(`${s}${e.message}`):e}},Sx=[_x,vx,s,yx],Cx=(e,t)=>{let n=mx.get(e);if(n)return`${n.headline}\n${Cx(n.inner,t)}`;let r=e.message,i=Sx.find(e=>r.startsWith(e))??``;return`${i}${Sa(r.slice(i.length),t)}`},wx=(e,t)=>{let n=mx.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Cx(e,!0)};if(t&&ya(e))return{code:va(r)?.code??la.general,message:r,toolMessage:r};let i=t&&!r.startsWith(gx)?s:``;return{code:la.general,message:`${i}${r}`,toolMessage:`${i}${Cx(e,!0)}`}},Tx=e=>{let t=e.dump&&Xy(e.dump,e.writeFile,e.version);try{return Dx(e,t)}catch(e){throw c(e)?Ex():e}finally{t?.close()}},Ex=()=>n(new x,e.error),Dx=(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(z_(t.source,o,t.loadModule)),kt(t.version);let p=$_(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});Pb(p,o,t.onProgress);let m=p.environment,h=m.runtime,g=h.version===`1.7.4`;h.pause=t.onPause??(()=>{}),h.getSpecification=()=>By(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:xb(h.distinctStates,h.generatedStates,()=>E?E.getStoredFingerprints(A,Ee):BigInt64Array.from(A,h.getFingerprint))}),E=cx(o,m,()=>R_(t.source,t.loadModule),t.onProgress),D=()=>sx(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?gy(t):Ah(e.action)},fe=(e,t)=>{ce&&(h.counterExample=jh(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??=Iy(o,m,p.instanceActions),_e=e=>{let t=Hu(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=Yr(e).find(e=>Jr(e)!==void 0);return[...n?[n]:[],...r===void 0?[]:ve(r,t)]},ye=(e,t)=>{for(let n of he(e)){let e=Jr(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($t)},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(Fy(o,m,p.instanceActions),r,i=>{if(Nb(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}),ux}}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();$s(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:zy(s)}:void 0),n}))throw ux})}),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(()=>xx(()=>fy(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,Gc(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=gi(),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=jb(`alias`,e,m).body,i=W(Db(e),$b(m,n,r)),a=t.kind===`Record`?t.fields.map(e=>e.name):[];return Ib(i,a)??Me(n)}catch(e){if(!(e instanceof v||e instanceof y))throw e;return{...Me(n),_ALIASEvalError:Sa(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=>Kc(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&&Ry(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?[]:Wc(me.init,m,me.scope),j=(e,t)=>f(()=>{for(let n of ge()){let r=Kc(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||Eu(m)?Le().find(t=>Re(t,e[0])):A[e[0]]).result;if(!n)throw new y(Tb);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,Tb):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?fx(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,{...wx(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:la.incompleteSuccessor,message:l,toolMessage:l,exitCode:e.specEvaluationFailure,trace:[...f.failure.trace,{action:r.action,label:a&&Ry(a,t.version),state:Me(d)}]}})},qe=(e,t)=>{let n=Be(e,Eb),r=n[n.length-1].state;if(Ce&&t!==void 0&&t!==e.length-1&&ze(r,e[t])===void 0)throw new y(Eb);return n},Je=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Vr(t,Xr(e[n]));return t&1073741823},Ye=e=>{for(let t of e){let e=Jr(t);if(e)throw e}},Xe=(e,t)=>{for(let n=0;n<t.length;n++)if(!rn(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:()=>mi(o.alias===void 0?Me(e):Pe(o.alias,e,void 0)),getText:()=>mi(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($t)),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($t));let m=p?u:-1;if(r&&p&&i?.writeSuccessor(r,ot(t.state,ke[e]+1),m!==-1,a&&{name:a.name,signature:zy(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,Cb(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{Uc(me.init,m,e=>{Nb(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 Gc(dt,e,m,e=>t(e,void 0),me.scope);let n={isStopped:!1};return ge().reduce((r,i)=>n.isStopped?r:r+Gc(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(Ex(),He(e)),ht=(e,t,n)=>{if(c(e))return mt(t);let r=pt(t,n);return Ge(lx(e),Cb(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&&!mx.has(n))return lt.result=Ge(new y(`${bx(n)}${n.message}`,n),Cb({trace:[]},i.lines),{isNextState:!0,...i.result}),!0;let a=he(e.state).some(e=>Jr(e)!==void 0)&&n instanceof y?wx(ya(n)?new y(`${yx}${n.message}`):n,!0):void 0;lt.result=Ge(n,Cb(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:Cb(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:Cb(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(`${ya(i)?yx: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:la.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=gl(e,m)?.location.range;if(!(me.temporals.length>0||!n))return{code:la.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}`}},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&&Ry(d.result,t.version),warning:p?_t():void 0},()=>c===l?de(o[o.length-1]):d.result?gy(d.result):Ah(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()},Ox=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},kx=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Xr(e[t]),16777619),r=Math.imul(r^ri(e[t]),1540483477);t[0]=Ox(n)||1,t[1]=Ox(r)},Ax=()=>{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)}}},jx=(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}},Mx=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Nx=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return jx(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Px=e=>Atomics.load(e.used,0)*2>=e.slots.length,Fx=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&jx(t,n);return{slots:t,used:e.used}},Ix=[void 0,`lambda`,`tuple`,`record`],Lx=()=>{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=Ir(e.domain);return t?(r(7),r(Ix.indexOf(Kt(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Ix.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})}},Rx=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=Ix[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=Xn({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 Td}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Sa}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return zp}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return pp}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Hp}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return Kc}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return gi}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return wa}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return la}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return jt}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return mi}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return ua}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return $c}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return Eu}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return Bd}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Wc}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return Ye}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return fa}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return R_}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Up}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return va}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Ta}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return _i}}),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 mb}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return o}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Fx}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return v}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return I_}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return kx}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return ae}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return sx}}),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 Nb}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return u}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return xb}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return oe}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return bb}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return s}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Mx}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return w}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return Ed}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return wd}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return Tx}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return vb}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return ie}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Lx}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return T}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return Nx}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return l}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Pb}}),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 Ax}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return Px}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return y}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return Rx}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return Ce}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return cx}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return Sb}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Vp}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return z_}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return $_}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return n}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return xa}});
|