tla-ts 0.0.3-dev.a85c0bd → 0.0.3-dev.a91da46
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 +167 -27
- package/dist/index.d.ts +167 -27
- 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 -20
- package/dist/run-cli.js +1351 -20
- package/dist/transfer.cjs +83 -28
- package/dist/transfer.js +83 -28
- package/package.json +5 -1
- package/src/ast.ts +52 -6
- package/src/bags.ts +4 -7
- package/src/builtins.ts +29 -11
- package/src/bundled-modules.ts +3 -3
- package/src/canonical.ts +4 -3
- package/src/check.ts +1332 -262
- package/src/cli.ts +8 -1
- package/src/codegen.ts +68 -21
- package/src/config.ts +252 -179
- package/src/environment.ts +431 -120
- package/src/errors.ts +195 -7
- package/src/evaluate.ts +718 -146
- package/src/exit-codes.ts +6 -24
- package/src/index.ts +1 -0
- package/src/instances.ts +4 -2
- package/src/java-overrides.ts +104 -25
- package/src/levels.ts +183 -37
- package/src/lexer.ts +32 -4
- package/src/live-check.ts +204 -148
- package/src/liveness.ts +190 -117
- 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 +436 -128
- 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 +1364 -405
- package/src/run-cli.ts +1167 -155
- package/src/runtime.ts +16 -0
- package/src/sany-builtins.ts +147 -0
- package/src/sany-generator.ts +3112 -0
- package/src/sany-levels.ts +1208 -0
- package/src/sany-lexer.ts +545 -0
- 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 +2161 -0
- package/src/sany-report.ts +354 -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 +26 -7
- package/src/standard-modules.ts +203 -146
- package/src/standard-ranges.ts +116 -0
- package/src/state-graph.ts +29 -6
- package/src/subexpressions.ts +221 -161
- package/src/substitution-levels.ts +38 -17
- package/src/successors.ts +158 -120
- 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/value-sources.ts +29 -0
- package/src/values.ts +683 -256
package/dist/transfer.js
CHANGED
|
@@ -6,24 +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
|
-
`),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=
|
|
18
|
-
`&&(a.line++,a.lineStart=a.index+1),a.index++},
|
|
15
|
+
to an element in its putative domain.`;var ee=class extends y{constructor(){super(b)}},x=class extends y{state;action;variables;constructor(e,t,n,r){super(e),this.state=t,this.action=n,this.variables=r}},S=class extends y{variable;constructor(e,t){super(e),this.variable=t}},C=class extends y{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},te=class extends y{state;constructor(e){super(`current state is not a legal state`),this.name=`TlaEvaluationError`,this.state=e}},ne=class extends l{failure;exception;constructor(e,t={}){super(e),this.name=`TlaProofError`,this.failure=t.exception===void 0?t.failure??e:void 0,this.exception=t.exception??`Failure(${JSON.stringify(this.failure)})`}},re=class extends ne{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},ie=class extends l{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}},ae=class extends ie{unwound;constructor(e,t){super(e),this.name=`TlaJavaException`,this.unwound=t}};const oe=t=>r(t)??(t instanceof u?e.specParseError:t instanceof v?e.configParseError:t instanceof y?e.specEvaluationFailure:e.error);var se=class extends l{node;constructor(e,t){super(e),this.name=`PcalError`,this.node=t}},ce=class extends l{constructor(e){super(e),this.name=`PcalRuntimeError`}},w=class extends l{constructor(e){super(`You have discovered a bug in pcal.trans.\nSend the following information and the\ninput file to the current maintainer(s).\n\n -- ${e}.`),this.name=`PcalBugError`}};const T=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),E=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),D=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),le=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),ue=/* @__PURE__ */ new Map([[`∧`,`/\\`],[`∨`,`\\/`],[`¬`,`~`],[`⇒`,`=>`],[`⟹`,`=>`],[`≡`,`<=>`],[`⇔`,`<=>`],[`∈`,`\\in`],[`∉`,`\\notin`],[`⊆`,`\\subseteq`],[`⊂`,`\\subset`],[`⊇`,`\\supseteq`],[`⊃`,`\\supset`],[`∪`,`\\cup`],[`∩`,`\\cap`],[`×`,`\\X`],[`∀`,`\\A`],[`∃`,`\\E`],[`≠`,`#`],[`≤`,`<=`],[`≥`,`>=`],[`↦`,`|->`],[`→`,`->`],[`⟨`,`<<`],[`⟩`,`>>`],[`□`,`[]`],[`◇`,`<>`],[`≜`,`==`],[`′`,`'`],[`∘`,`\\o`],[`⋅`,`\\cdot`]]),de=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,fe=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),pe=e=>e.startsWith(`\\`)?parseInt(e.slice(2),fe.get(e[1].toLowerCase())):Number(e),me=/-{4,}[ \t]*MODULE\b/,he=e=>/[A-Za-z0-9_]/.test(e),ge=(e,t)=>{let n=e[t];if(n===`\\`&&/[A-Za-z]/.test(e[t+1]??``)){let n=/^[A-Za-z]+/.exec(e.slice(t+1))?.[0]??``,r={value:n.length};for(;r.value>0&&!E.has(n.slice(0,r.value));)r.value--;let i=E.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=ue.get(n);if(r)return{text:r,length:n.length};let i=le.find(n=>e.startsWith(n,t));return i?{text:D.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},O=e=>e!==void 0&&e>=`0`&&e<=`9`,_e=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},ve=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:_e(e,t+1,O);if(n===t+1||e[n]!==`>`)return 0;let r=_e(e,n+1,he),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return _e(e,i?r+1:r,e=>e===`.`)-t},ye=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,be=(e,t)=>t===` `?e+8-e%8:e+1,xe=e=>{let t=me.exec(e);if(!t)throw new u(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
|
|
16
|
+
`),a={index:t.index,line:i.length,lineStart:t.index-i[i.length-1].length,moduleDepth:0},o={lineStart:-1,position:0,width:0},s=()=>{for((o.lineStart!==a.lineStart||o.position>a.index)&&(o.lineStart=a.lineStart,o.position=a.lineStart,o.width=0);o.position<a.index;o.position++)o.width=be(o.width,e[o.position]);return be(o.width,e[a.index])},c=(e,t,r,i)=>{let o=s();n.push({kind:e,text:t,spelling:i,line:a.line,column:o,endColumn:o+r-1}),a.index+=r},l=t=>{for(let n=0;n<t;n++)e[a.index]===`
|
|
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===`
|
|
19
18
|
`||t===` `||t===` `||t===`\r`){l(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
|
|
20
|
-
`,a.index);l((t===-1?e.length:t)-a.index);continue}if(e.startsWith(`(*`,a.index)){let t={value:0};do{if(a.index>=e.length)throw
|
|
21
|
-
|
|
22
|
-
`,t:` `,r:`\r`,f:`\f`}[t]??t),l(2)}else i.push(e[a.index]),l(1)}l(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
`).length-1,n.index+=e+2;continue}let a=/^\d+(?![A-Za-z_])/.exec(r)?.[0];if(a){t.push({kind:`Number`,text:a,line:n.line}),n.index+=a.length;continue}let o=/^[A-Za-z0-9_!]+/.exec(r)?.[0];if(o){t.push({kind:`Word`,text:o,line:n.line}),n.index+=o.length;continue}let s=/^"((?:[^"\\]|\\.)*)"/.exec(r);if(s){t.push({kind:`String`,text:s[1],line:n.line}),n.index+=s[0].length;continue}let c=ce.find(e=>r.startsWith(e));if(c){t.push({kind:`Symbol`,text:c,line:n.line}),n.index+=c.length;continue}let l=E(e,n.index);if(!l)throw new m(`Unexpected character ${JSON.stringify(r[0])} at line ${n.line}`);t.push({kind:`Word`,text:l.text,line:n.line}),n.index+=l.length}return t.push({kind:`End`,text:``,line:n.line}),t},ue=e=>{let t=le(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[n.index],o=()=>t[n.index++],s=e=>e.kind===`Word`&&A.has(e.text),c=e=>{let t=o();if(t.text!==e)throw new m(`Expected ${JSON.stringify(e)} but found ${JSON.stringify(t.text)} at line ${t.line}`)},l=()=>{let e=o();if(e.kind!==`Word`||s(e))throw new m(`Expected a name but found ${JSON.stringify(e.text)} at line ${e.line}`);return e.text},u=()=>a().kind===`Word`&&!s(a()),d=()=>{let e=[];for(;u();)e.push(o().text);return e},f=(e,t)=>{if(r[e]!==void 0)throw new m(`The keyword ${t} appears twice`);r[e]=l()},p=()=>{let e=o();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=[];for(a().text!==`}`&&e.push(p());a().text===`,`;)o(),e.push(p());return c(`}`),{kind:`Set`,elements:e}}if(e.kind===`Word`&&!s(e))return{kind:`ModelValue`,name:e.text};throw new m(`Expected a value but found ${JSON.stringify(e.text)} at line ${e.line}`)},h=()=>{if(a().text!==`[`)return;o();let e=l();return c(`]`),e},g=()=>{for(;u();){let e=o().text;if(a().text===`(`){o();let t=[];for(;a().text!==`)`;)t.push(p()),a().text!==`)`&&c(`,`);o(),c(`=`);let n=h();r.constants.push({name:e,value:p(),args:t,...n&&{module:n}});continue}if(a().text===`<-`){o();let t=h();r.substitutions.push({name:e,target:l(),...t&&{module:t}});continue}c(`=`);let t=h();r.constants.push({name:e,value:p(),...t&&{module:t}})}};for(;a().kind!==`End`;){let e=o();switch(e.text){case`CONSTANT`:case`CONSTANTS`:g();break;case`INIT`:f(`init`,e.text);break;case`NEXT`:f(`next`,e.text);break;case`SPECIFICATION`:f(`specification`,e.text);break;case`SYMMETRY`:f(`symmetry`,e.text);break;case`VIEW`:f(`view`,e.text);break;case`INVARIANT`:case`INVARIANTS`:r.invariants.push(...d());break;case`PROPERTY`:case`PROPERTIES`:r.properties.push(...d());break;case`CONSTRAINT`:case`CONSTRAINTS`:r.constraints.push(...d());break;case`ACTION_CONSTRAINT`:case`ACTION_CONSTRAINTS`:r.actionConstraints.push(...d());break;case`ALIAS`:f(`alias`,e.text);break;case`POSTCONDITION`:case`POSTCONDITIONS`:r.postconditions.push(...d());break;case`_POSSIBLE`:r.possible.push(...d());break;case`_PERIODIC`:f(`periodic`,e.text);break;case`_RL_REWARD`:f(`rlReward`,e.text);break;case`CHECK_DEADLOCK`:{if(i.isSet)throw new m(`The keyword CHECK_DEADLOCK appears twice`);i.isSet=!0;let e=o().text;if(e!==`TRUE`&&e!==`FALSE`)throw new m(`CHECK_DEADLOCK expects TRUE or FALSE but found ${JSON.stringify(e)}`);r.checkDeadlock=e===`TRUE`;break}default:throw new m(`Unexpected ${JSON.stringify(e.text)} at line ${e.line}`)}}if(r.specification!==void 0&&(r.init!==void 0||r.next!==void 0))throw new m(`SPECIFICATION cannot be combined with INIT or NEXT`);return r},de={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},fe=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},j=e=>e!==void 0&&/^\p{Nd}$/u.test(e),pe=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),me=e=>{let t=t=>{let n=O(e,t,fe);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=O(e,t,j);if(e.startsWith(`..`,n)&&j(e[n+2]))return{kind:`Constant`,first:t,last:O(e,n+2,j)-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=j(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:O(e,t+1,j)-1,children:[]};if(pe(n))return{kind:`Constant`,first:t,last:O(e,t,pe)-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)},he=e=>{let t=e.length===0?void 0:me(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=de[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},M=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,ge=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),N=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),P=e=>typeof e==`object`&&e.kind===`ModelValue`,_e=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:M(e)?`set`:`function`,ve=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new g(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ye={isUsed:!1},be=(e,t)=>(ye.isUsed=!0,e.writtenKeys=t,e),xe=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[$t(e.domain,t)]]),F=(e,t,n)=>be(R(e,t),n),Se=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(Se);e.writtenKeys=void 0,e.range.forEach(Se)}},Ce=e=>e.every(e=>typeof e==`string`),we=(e,t)=>e.length>0&&t.length>0&&Ce(e)!==Ce(t),Te=(e,t)=>{ye.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return we(n,r)?st(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Re(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=Re(i[e],a[e]);if(t!==0)return t}return 0},Ee=(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=Re(n[e],r[e]);if(t!==0)return t}return 0},De=e=>P(e)?e.type:void 0,Oe=(e,t,n)=>{let r=De(e),i=De(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(P(e)&&P(t)){if(r===void 0||i===void 0||r===i)return;throw new h(`Attempted to ${a} the differently-typed model values ${W(e)} and ${W(t)}`)}throw r===void 0?new h(`Attempted to ${a} the typed model value ${W(t)} and the non-model value\n${W(e)}`):new h(`Attempted to ${a}${n?``:` the`} typed model value ${W(e)} and non-model value\n${W(t)}`)},ke={ranks:Object.create(null),size:0},Ae=e=>{ke.ranks=Object.create(null),ke.size=0,ze.clear();for(let t of e)je(t)},je=e=>(ke.ranks[e]===void 0&&(ke.ranks[e]=ke.size++),e),Me=()=>ke.size,I=e=>ke.ranks[je(e)],Ne=(e,t)=>{if(e===t)return 0;let n=ke.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},L=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Pe=(e,t)=>(L(e)||L(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Fe=(e,t,n)=>{if(!L(e))throw new h(`Attempted to ${n} the set ${W(B(e)?V(e):e,!0)} with the value:\n${W(t,!0)}`);if(!L(t))throw new h(`Attempted to compare overridden value ${W(e,!0)} with non-overridden value:\n${W(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new h(`Attempted to compare ${W(e,!0)} with the value\n${W(t,!0)}`)},Ie={kind:`InfiniteSet`,name:`Any`},Le=e=>{throw new h(`Attempted to compare ANY with the value\n${W(e)}`)},Re=(e,t)=>{if(e===t)return ye.isUsed&&Se(e),e===Ie?Le(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Te(e,t);if(n===`Set`&&r===`Set`)return Ee(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&&Oe(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Oe(e,t,!1),n===`ModelValue`?-1:1;if(e===Ie||t===Ie)return Le(e===Ie?t:e);if(M(e)&&M(t)&&Pe(e,t))return Fe(e,t,`compare`);let i=M(e);if(i!==M(t))throw new h(`Attempted to compare ${_e(e)} ${W(e)} with ${_e(t)} ${W(t)}`);return i?Ee(V(e),Kt(t)):Te(U(e),U(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Ne(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Oe(e,t,!1),P(e))return-1;if(P(t))return 1;throw new h(`Attempted to compare ${_e(e)} ${W(e)} with ${_e(t)} ${W(t)}`)},ze=/* @__PURE__ */ new Map,Be=e=>{let t=ze.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:I(e)};return ze.set(e,n),n},Ve=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),R=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0}),He=(e,t)=>{if(e===t)return ye.isUsed&&Se(e),e!==Ie||Le(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Oe(e,t,!0),Re(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 Te(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Ee(e,t)===0;if(P(e)||P(t))return Oe(e,t,!0),P(e)&&P(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return He(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=H(e.domain),r=H(t.domain);if(n||r)return n===r;let i=H(e.range),a=H(t.range);return i||a?i===a:He(e.domain,t.domain)&&He(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(H(e))return H(t);if(H(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&He(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return H(e)?H(t):!H(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>He(e,t.factors[n]));let n=M(e)&&M(t)&&!(B(e)&&B(t));if(n&&Pe(e,t))return Fe(e,t,`check equality of`)===0;if(n){if(!L(e)){let n=V(e);if(!L(t))return Ee(n,V(t))===0}return In(e)===In(t)}return Re(e,t)===0},Ue=(e,t)=>e===t||e.length===t.length&&e.every((e,n)=>We(e,t[n])),We=(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)&&Ue(e.elements,t.elements):e.kind===`Function`&&t.kind===`Function`?(e.hash===0||t.hash===0||e.hash===t.hash)&&Ue(e.domain,t.domain)&&Ue(e.range,t.range):In(e)===In(t),Ge=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},Ke=e=>{if(!N(e))return;let t=U(e);return{domain:t.domain,range:t.range,low:Ge(t.domain)}},qe=e=>{if(!N(e))return;let t=U(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},Je=(e,t)=>{if(De(e)!==void 0)throw new h(`Attempted to compare the typed model value ${W(e)} and the non-model value\n${W(t)}`);return 1},Ye=(e,t)=>{if(De(e)!==void 0)throw new h(`Attempted to check equality of the typed model value ${W(e)} and the non-model value\n${W(t)}`);return!1},Xe=(e,t)=>{let n=De(e);if(n===void 0)return P(t)?e.rank-t.rank:-1;if(!P(t))throw new h(`Attempted to compare the typed model value ${W(e)} and non-model value\n${W(t)}`);let r=De(t);if(r!==void 0&&r!==n)throw new h(`Attempted to compare the differently-typed model values ${W(e)} and ${W(t)}`);return e.rank-t.rank},Ze=(e,t)=>{let n=De(e);if(n===void 0)return P(t)&&e.name===t.name;if(!P(t))throw new h(`Attempted to check equality of typed model value ${W(e)} and non-model value\n${W(t)}`);let r=De(t);if(r!==void 0&&r!==n)throw new h(`Attempted to check equality of the differently-typed model values ${W(e)} and ${W(t)}`);return e.name===t.name},Qe={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`}},$e=(e,t,n)=>{let r=Qe[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${W(e)} with ${r.other}:\n${W(t)}`},et=(e,t,n)=>{let r=Ke(n);if(!r){if(P(n))return Je(n,t);throw new h(`Attempted to compare the function ${W(t)} with the value:\n${W(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>tt(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 tt(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new h(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${W(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},tt=(e,t)=>{for(let n=0;n<e.length;n++){let r=st(e[n],t[n]);if(r!==0)return r}return 0},nt=(e,t)=>{let n=U(e);if(e.kind===`Function`&&en(n)!==void 0){let r=N(t)?en(t):void 0;return r?n.range.length-r.length||tt(n.range,r):et({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=qe(t);if(!r){if(P(t))return Je(t,e);throw new h(`Attempted to compare record:\n${W(e)}\nwith non-record\n${W(t)}`)}return n.domain.length-r.domain.length||tt(n.domain,r.domain)||tt(n.range,r.range)}return et({...n,low:Ge(n.domain)},e,t)},rt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),it=(e,t)=>L(e)||L(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),at=(e,t)=>{let n=rt(t)?t:V(t);return{elements:V(e).elements,otherElements:V(n).elements}},ot=(e,t)=>{if(it(e,t))return Re(e,t);if(!rt(e))return ot(V(e),t);if(!M(t)){if(P(t))return Je(t,e);throw new h(`Attempted to compare the set ${W(e)} with the value:\n${W(t)}`)}let n=at(e,t);return n.elements.length-n.otherElements.length||tt(n.elements,n.otherElements)},st=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return Re(e,t);if(P(t))return Je(t,e);throw new h($e(e,t,!1))}return e.kind===`ModelValue`?Xe(e,t):N(e)?nt(e,t):ot(e,t)},ct=(e,t)=>e.every((e,n)=>ft(e,t[n])),lt=(e,t,n)=>{let r=Ke(n);if(!r){if(P(n))return Ye(n,t);throw new h(`Attempted to check equality of the function ${W(t)} with the value:\n${W(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&ct(e.range,r.range);let i=e.low??r.low;return i===void 0?ct(e.domain,r.domain)&&ct(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new h(`Attempted to compare an integer with non-integer:\n${W(e)}.`);return e===i+t})&&ct(e.range,r.range)},ut=(e,t)=>{let n=U(e);if(e.kind===`Function`&&en(n)!==void 0){let r=N(t)?en(t):void 0;return r?n.range.length===r.length&&ct(n.range,r):lt({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=qe(t);if(!r){if(P(t))return Ye(t,e);throw new h(`Attempted to check equality of record:\n${W(e)}\nwith non-record\n${W(t)}`)}return n.domain.length===r.domain.length&&ct(n.domain,r.domain)&&ct(n.range,r.range)}return lt({...n,low:Ge(n.domain)},e,t)},dt=(e,t)=>{if(it(e,t))return He(e,t);if(!rt(e))return dt(V(e),t);if(!M(t)){if(P(t))return Ye(t,e);throw new h(`Attempted to check equality of the set ${W(e)} with the value:\n${W(t)}`)}let n=at(e,t);return n.elements.length===n.otherElements.length&&ct(n.elements,n.otherElements)},ft=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(P(t))return Ye(t,e);throw new h($e(e,t,!0))}return e.kind===`ModelValue`?Ze(e,t):N(e)?ut(e,t):dt(e,t)},pt=e=>{let t=[];for(let n of e){let e={low:0,high:t.length,comparison:1};for(;e.low<e.high;){let r=e.low+(e.high-e.low>>1);if(e.comparison=st(n,t[r]),e.comparison===0)break;e.comparison<0?e.high=r:e.low=r+1}e.comparison!==0&&t.splice(e.low,0,n)}return t},mt=(e,t)=>t.some(t=>ft(t,e)),ht=(e,t)=>{try{return He(e,t)}catch(n){if(!(n instanceof h))throw n;return ft(e,t)}},gt=e=>{for(let t=1;t<e.length;t++)if(Re(e[t],e[t-1])<=0)return!1;return!0},_t=e=>{if(e.length<2||gt(e))return Ve(e);let t=[...e].sort(Re),n=[t[0]];for(let e=1;e<t.length;e++)Re(n[n.length-1],t[e])!==0&&n.push(t[e]);return Ve(n)},vt=e=>{try{return _t(e)}catch(t){if(!(t instanceof h))throw t;return{kind:`MixedSet`,elements:e}}},yt=Ve([]),bt=(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&&Re(r[a],t)<0;)a++;a<r.length&&Re(r[a],t)===0||i.push(t)}return i.length===n.length?e:Ve(i)},xt=(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&&Re(r[a],t)<0;)a++;a<r.length&&Re(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Ve(i)},St=(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=Re(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=Ve(i);if(e.hash!==0){let t=e.hash;for(let e=0;e<a.length;e++)t=t+wn(a[e])|0;c.hash=t}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+jn(a[e])|0;c.fingerprint=t}return c},Ct=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Re(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Re(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return R(n,r)},wt=e=>{let t=Ct(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:be(t,e.map(e=>e[0]))},Tt=[],Et=[],Dt=/* @__PURE__ */ new WeakMap,Ot=e=>{let t=Tt[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Tt[e]=n,n},kt=e=>{if(Xt(e),e.low===1&&e.high>=1)return Ot(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},At=e=>e.length>0&&(e===Tt[e.length]||Dt.has(e)),jt=e=>{let t=V(e).elements;return At(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Mt=e=>{let t=Et[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Et[e]=n,n},z=e=>R(Ot(e.length),e),Nt=e=>Ct(e),Pt=e=>M(e)&&!L(e),Ft=(e,t=!1)=>`UNION(${W(e.base,t)})`,It=(e,t=e=>V(e).elements)=>{if(!Pt(e.base))throw new h(`Attempted to enumerate the nonenumerable set:\n${Ft(e)}`);return t(e.base)},Lt=(e,t,n)=>{if(Pt(e))return e;throw new h(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${W(e)}\nwhen enumerating:\n${Ft(n)}`)},B=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return B(e.base);case`FunctionSet`:return B(e.domain)&&B(e.range)||Rt(e.domain)===!0||Rt(e)===!0;case`RecordSet`:return e.sets.every(B)||Rt(e)===!0;case`ProductSet`:return e.factors.every(B)||Rt(e)===!0;case`Union`:return B(e.base)&&qt(e.base).every(B);case`SetOperation`:return e.operator===`\\cup`?B(e.left)&&B(e.right):e.operator===`\\cap`?B(e.left)||B(e.right):B(e.left);default:return!1}},Rt=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=Rt(e.domain);return t===void 0?void 0:!t&&Rt(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Rt(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return B(e)?V(e).elements.length===0:void 0;default:return}},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},Bt=(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},Vt=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Ve(r.map(t=>e[t])));while(Bt(r,e.length))}return t},Ht=e=>{if(typeof e!=`object`)throw new h(`Expected a set but found ${W(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return pt(e.elements);case`Interval`:{let t=kt(e);return t!==Tt[t.length]&&Dt.set(t,e),t}case`Subset`:{L(e.base)&&Xt(e.base);let t=V(e.base).elements;if(t.length>30)throw new h(Yt(e));return Vt(t)}case`FunctionSet`:{if(H(e))return[];if(L(e.domain))throw new h(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${W(e.domain)}\ncannot be enumerated.`);let t=jt(e.domain);if(t.length>0&&L(e.range))throw new h(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${W(e.range)}\ncannot be enumerated.`);let n=t.length===0?[]:V(e.range).elements;return zt(t.map(()=>n)).map(e=>R(t,e))}case`RecordSet`:{if(H(e))return[];let t=e.sets.map((t,n)=>{if(L(t))throw new h(`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${W(t)}`);return V(t).elements});return zt(t).map(t=>Nt(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(H(e))return[];let t=e.factors.map((e,t)=>{if(L(e))throw new h(`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${W(e)}`);return V(e).elements});return zt(t).map(z)}case`FilteredSet`:if(L(e.base))throw new h(`Attempted to enumerate { x \\in S : p(x) } when S:\n${W(e.base)}\nis not enumerable`);return V(e.base).elements.filter(e.test);case`Union`:{let t=It(e).flatMap((t,n)=>V(Lt(t,n,e)).elements);return V(vt(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(L(e.left)||L(e.right)))throw new h(`Attempted to enumerate S \\cup T when S:\n${W(e.left)}\nand T:\n${W(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&L(e.left)&&L(e.right))throw new h(`Attempted to enumerate S \\cap T when neither S:\n${W(e.left)}\nnor T:\n${W(e.right)}\nis enumerable`);if(e.operator===`\\`&&L(e.left))throw new h(`Attempted to enumerate S \\ T when S:\n${W(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return St(V(e.left),V(e.right)).elements;let t=e.operator===`\\`||B(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return V(n).elements.filter(t=>rn(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new h(`Attempted to enumerate the non-enumerable set ${W(e)}`);default:throw new h(`Expected a set but found ${W(e)}`)}},Ut=/* @__PURE__ */ new WeakMap,Wt=/* @__PURE__ */ new WeakMap,V=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Ve(Ht(e));let t=typeof e==`object`?Ut.get(e):void 0;if(t)return t;let n=(typeof e==`object`?Wt.get(e):void 0)??Gt(e);return typeof e==`object`&&Ut.set(e,n),n},Gt=e=>{let t=Ht(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`)?Ve(t):_t(t)},Kt=e=>{if(typeof e!=`object`||e.kind!==`Union`&&e.kind!==`SetOperation`&&e.kind!==`FilteredSet`||Ut.has(e))return V(e);let t=Wt.get(e);if(t)return t;let n=Gt(e);return Wt.set(e,n),n},qt=e=>{if(typeof e!=`object`||Ut.has(e))return V(e).elements;if(e.kind===`Union`)return It(e,qt).flatMap((t,n)=>qt(Lt(t,n,e)));if(e.kind===`FilteredSet`&&!L(e.base))return qt(e.base).filter(e.test);if(e.kind!==`SetOperation`)return V(e).elements;if(e.operator===`\\cup`)return L(e.left)||L(e.right)?V(e).elements:[...qt(e.left),...qt(e.right)];let t=e.operator===`\\`||B(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return L(n)?V(e).elements:qt(n).filter(t=>rn(t,r)===(e.operator===`\\cap`))},H=e=>{if(typeof e!=`object`||!M(e))throw new h(`Shouldn't call isEmpty() on value ${W(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new h(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(H);case`RecordSet`:return e.sets.some(H);case`FunctionSet`:return!H(e.domain)&&H(e.range);case`Union`:return It(e).every((t,n)=>H(Lt(t,n,e)));default:return V(e).elements.length===0}},Jt=(e,t)=>e.reduce((e,n)=>{let r=e*Xt(n);if(r>2147483647)throw new h(t());return r},1),Yt=e=>`Overflow when computing the number of elements in:\n${W(e)}`,Xt=e=>{if(typeof e!=`object`)return V(e).elements.length;switch(e.kind){case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new h(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new h(`Attempted to compute the number of elements in the overridden value ${W(e)}.`);case`Subset`:{let t=Xt(e.base);if(t>=31)throw new h(Yt(e));return 2**t}case`FunctionSet`:{if(H(e.domain))return 1;if(H(e.range))return 0;let t=Xt(e.range);if(t===1)return 1;let n=Xt(e.domain),r={value:1};for(let i=0;i<n;i++)if(r.value*=t,r.value>2147483647)throw new h(Yt(e));return r.value}case`RecordSet`:return H(e)?0:Jt(e.sets,()=>Yt(e));case`ProductSet`:return H(e)?0:Jt(e.factors,()=>`Overflow when computing the number of elements in ${W(e)}`);default:return V(e).elements.length}},Zt=e=>`Attempted to check if the set ${W(e)}is finite.`,Qt=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new h(`Attempted to check if the ${_e(e)} ${W(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new h(`Attempted to check if the function:\n${W(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Qt(e.base)&&H(e.base);case`Subset`:return Qt(e.base);case`FunctionSet`:{let t=Qt(e.domain);if(t&&H(e.domain))return!0;let n=Qt(e.range);return n&&H(e.range)?!0:n&&(t||Xt(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(!Qt(e))n.isAllFinite=!1;else if(H(e))return!0;return n.isAllFinite}case`Union`:if(!Pt(e.base))throw new h(`Attempted to check if the nonenumerable set:\n${Ft(e)}\nis a finite set.`);return V(e.base).elements.every(Qt);case`SetOperation`:if(e.operator===`\\cup`)return Qt(e.left)&&Qt(e.right);if(e.operator===`\\cap`){if(!Qt(e.left)&&!Qt(e.right))throw new h(Zt(e));return!0}if(Qt(e.left))return!0;if(!Qt(e.right))throw new h(Zt(e));return!1;case`FilteredSet`:if(!Qt(e.base))throw new h(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${W(e.base)}\nis finite.`);return!0}},$t=(e,t)=>{let n={low:0,high:e.length-1};for(;n.low<=n.high;){let r=n.low+n.high>>1,i=Re(e[r],t);if(i===0)return r;i<0?n.low=r+1:n.high=r-1}return-1},en=e=>{if(typeof e!=`object`||!N(e))return;let t=U(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},tn=(e,t)=>`Attempted to check if the value ${W(e)} is an element of ${W(t)}`,nn=(e,t)=>{let n=`Attempted to check if the value:\n${W(e)}\nis an element of the`;if(!N(t))return`${n} ${_e(t)} ${W(t)}`;let r=t.kind===`Function`||B(t.domain)?U(t).domain:[];return r.length>0&&r.every(e=>typeof e==`string`)?`Attempted to check if element:\n${W(e)}\nis in the record:\n${W(t)}`:r.every((e,t)=>e===t+1)?`Attempted to check set membership in a tuple value.`:`${n} function ${W(t)}`},rn=(e,t)=>{if(!M(t))throw new h(nn(e,t));switch(t.kind){case`Set`:try{return $t(t.elements,e)!==-1}catch(n){if(!(n instanceof h))throw n;return mt(e,t.elements)}case`MixedSet`:return mt(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!P(e))throw new h(`Attempted to check if the value:\n${W(e)}\nis in the integer interval ${W(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(P(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new h(`Attempted to check if the value:\n${W(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!M(e))throw new h(tn(e,t));return V(e).elements.every(e=>rn(e,t.base));case`FunctionSet`:{if(!N(e)){if(P(e))return!1;throw new h(tn(e,t))}let n=U(e),r=Ge(n.domain);return(r===void 0?ht(t.domain,Ve(n.domain)):ht({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>rn(e,t.range))}case`RecordSet`:{let n=N(e)?U(e):void 0;if(!n||!Ce(n.domain)){if(P(e))return!1;throw new h(`Attempted to check if non-record\n${W(e)}\nis in the set of records:\n${W(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=$t(n.domain,e);return i!==-1&&rn(n.range[i],t.sets[r])})}case`ProductSet`:{let n=N(e)?en(e):void 0;if(n===void 0){if(N(e)&&U(e).domain.every(e=>typeof e==`number`)||P(e))return!1;throw new h(`Attempted to check if non-tuple\n${W(e)}\nis in the set of tuples:\n${W(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>rn(e,t.factors[n]))}case`FilteredSet`:return rn(e,t.base)&&t.test(e);case`Union`:if(!Pt(t.base))throw new h(`Attempted to check if:\n ${W(e)}\nis an element of the non-enumerable set:\n ${Ft(t)}`);return V(t.base).elements.some(t=>rn(e,t));case`SetOperation`:return t.operator===`\\cup`?rn(e,t.left)||rn(e,t.right):rn(e,t.left)&&rn(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=en(e);if(n===void 0){if(P(e))return!1;throw new h(tn(e,t))}return n.every(e=>rn(e,t.base))}default:throw new h(nn(e,t))}},an=(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?rn(e,n):e.range.every((e,r)=>an(e,t.range[r],n.range)),U=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){B(e.domain)||Xt(e.domain);let t=jt(e.domain);return R(t,t.map(t=>e.apply(t)))}throw new h(`Expected a function but found ${W(e)}`)},on=/* @__PURE__ */ new WeakSet,sn=e=>(on.add(e),e),cn=e=>{let t=e.domain;return t.length===0?on.has(e)?`FcnRcdValue`:`TupleValue`:t===Tt[t.length]?`TupleValue`:Dt.has(t)?`IntervalFcnRcdValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},ln=(e,t)=>`Attempted to apply function:\n${he(W(e))}\nto argument ${he(W(t))}, which is not in the domain of the function.`,un=e=>`Attempted to apply function with integer domain to the non-integer argument ${he(W(e))}`,dn=(e,t)=>{if(on.has(e)||e.kind===`LazyFunction`)return`In applying the function\n${he(W(e))},\nthe first argument is:\n${he(W(t))}\nwhich is not in its domain.\n`;let n=cn(e);return n===`TupleValue`?typeof t==`number`?`Attempted to access index ${t} of tuple\n${he(W(e))}\nwhich is out of bounds.`:`Attempted to access tuple at a non integral index: ${he(W(t))}`:n===`RecordValue`?typeof t==`string`?`Attempted to access nonexistent field '${t}' of record\n${he(W(e))}`:`Attempted to access record by a non-string argument: ${he(W(t))}`:n===`IntervalFcnRcdValue`&&typeof t!=`number`?un(t):ln(e,t)},fn=(e,t)=>cn(e)===`FcnRcdValue`?ln(e,t):un(t),pn=e=>cn(e)===`RecordValue`,mn=(e,t)=>{let n=e[0];return typeof n==`number`?typeof t!=`number`&&(e===Tt[e.length]||Dt.has(e)):typeof n==`string`&&typeof t!=`string`},hn=(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 $t(e,t)},gn=(e,t,n,r)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!rn(t,e.domain))throw new h(on.has(e)?dn(e,t):`Attempted to apply a function to ${W(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new h(r?.(e)??`Attempted to apply ${W(e)}, which is not a function`);let i=mn(e.domain,t)?-1:hn(e.domain,t);if(i===-1)throw new h(n?.(e)??dn(e,t));return e.range[i]},_n=e=>At(e)?Dt.get(e)??Mt(e.length):void 0,vn=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=U(e).domain;return _n(t)??Ve(t)},yn=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!B(e.domain))){if(!rn(t,e.domain))return e;let r=n(e.apply(t));return{kind:`LazyFunction`,domain:e.domain,apply:n=>ht(t,n)?r:e.apply(n),source:e.source}}let i=U(e),a=hn(i.domain,t);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=R(i.domain,o);if(l.writtenKeys=i.writtenKeys,i.hash!==0){let e=i.domain[a];l.hash=s===c?i.hash:i.hash-Tn(e,s)+Tn(e,c)|0}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Mn(e,s)+Mn(e,c)|0}return l},bn=/* @__PURE__ */ new WeakMap,xn=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Sn=(e,t)=>Math.imul(e^t,16777619),Cn=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return xn(t)},wn=e=>xn(Dn(e)+2654435769|0),Tn=(e,t)=>xn(Math.imul(Dn(e),668265261)+Dn(t)|0),En=e=>{if(e.kind===`ModelValue`)return xn(Sn(Cn(e.name),109));if(M(e)){if(!B(e))return Cn(In(e));let t=V(e).elements,n=1940243425;for(let e=0;e<t.length;e++)n=n+wn(t[e])|0;return n}let t=U(e),n=1725019383;for(let e=0;e<t.domain.length;e++)n=n+Tn(t.domain[e],t.range[e])|0;return n},Dn=e=>{if(typeof e==`number`)return xn(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Cn(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=En(e)),e.hash;let t=bn.get(e);if(t!==void 0)return t;let n=En(e);return bn.set(e,n),n},On=/* @__PURE__ */ new WeakMap,kn=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},An=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return kn(t)},jn=e=>kn(Pn(e)+2135587861|0),Mn=(e,t)=>kn(Math.imul(Pn(e),374761393)+Pn(t)|0),Nn=e=>{if(e.kind===`ModelValue`)return kn(An(e.name)^60);if(M(e)){if(!B(e))return An(In(e));let t=V(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+jn(t[e])|0;return n}let t=U(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Mn(t.domain[e],t.range[e])|0;return n},Pn=e=>{if(typeof e==`number`)return kn(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return An(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Nn(e)),e.fingerprint;let t=On.get(e);if(t!==void 0)return t;let n=Nn(e);return On.set(e,n),n},Fn=/* @__PURE__ */ new WeakMap,In=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=Fn.get(e);if(t!==void 0)return t;let n=Ln(e);return Fn.set(e,n),n},Ln=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${In(e.base)}>`;if(e.kind===`FilteredSet`&&!B(e))throw new h(`Attempted to compare the non-enumerable set ${W(e)} with another value`);if(M(e))return B(e)?`{${V(e).elements.map(In).join(`,`)}}`:`<${e.kind} ${W(e)}>`;let t=U(e);return`(${t.domain.map((e,n)=>`${In(e)}:${In(t.range[n])}`).join(`,`)})`},Rn=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,zn=e=>e.reduce((e,t)=>e===0?0:e*Xt(t),1),Bn=e=>{if(e.kind===`Subset`)return Xt(e.base)<=6?V(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return V(e);if(e.kind===`FunctionSet`&&B(e.domain)&&Xt(e.domain)===0)return Ve([R([],[])]);let t=e.kind===`FunctionSet`?Xt(e.range)**Xt(e.domain):zn(e.kind===`RecordSet`?e.sets:e.factors);return t===0?yt:t<=1999?V(e):void 0},Vn=(e,t)=>{if(t)return Bn(e);if(B(e))try{return Bn(e)}catch(e){if(e instanceof h)return;throw e}},Hn=(e,t)=>{let n=e=>W(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return`{x \\in ${n(e.base)} : ...}`;case`Union`:return Ft(e,t)}},Un=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),W=(e,t=!1,n=!1)=>{let r=e=>W(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Rn(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(V(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Vn(e,t);return n?r(n):Hn(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{if(e.kind===`LazyFunction`&&!B(e.domain)){let t=e.source;return t?`[${t.parameters.map(e=>`${e.name} \\in ${W(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}let i=U(e),a=r=>W(r,t,n&&e.kind===`Function`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:i.domain.every(e=>typeof e==`string`&&Un(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):xe(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},Wn=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${he(W(n))}\n`).join(``)},Gn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Kn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Dn(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||We(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||We(i[e],n))return i[e]}return n.kind===`Set`?Gn(n.elements,t):(Gn(n.domain,t),Gn(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}},qn=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},G=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Jn=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),Yn=(e,t)=>Jn.has(e)?new h(t):new g(t),Xn=e=>typeof e==`object`&&e.kind===`Operator`,K=(e,t,n)=>{let r=e[t];if(r===void 0||Xn(r))throw Yn(n,`${n} expects a value as argument ${t+1}`);return r},Zn=(e,t,n)=>{let r=K(e,t,n);if(typeof r!=`number`)throw Yn(n,`${n} expects an integer but received ${W(r)}`);return r},Qn=(e,t,n)=>{let r=K(e,t,n);if(typeof r!=`boolean`)throw Yn(n,`${n} expects a boolean but received ${W(r)}`);return r},$n=(e,t,n)=>{let r=K(e,t,n);if(!M(r))throw Yn(n,`${n} expects a set but received ${W(r)}`);return r},er=(e,t,n)=>{let r=$n(e,t,n);if(!B(r))throw Yn(n,`${n} cannot enumerate the non-enumerable set ${W(r)}`);return r},tr=(e,t,n)=>V(er(e,t,n)),nr=(e,t,n)=>tr(e,t,n).elements,rr=(e,t,n)=>{let r=K(e,t,n),i=en(r);if(!i)throw Yn(n,`${n} expects a sequence but received ${W(r)}`);return i},ir=(e,t,n)=>{let r=K(e,t,n);if(!N(r))throw Yn(n,`${n} expects a function but received ${W(r)}`);return U(r)},ar=(e,t,n)=>{let r=e[t];if(r===void 0||!Xn(r))throw Yn(n,`${n} expects an operator as argument ${t+1}`);return r},or=(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}),sr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),cr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),lr=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(K(n,0,e),K(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),ur=e=>e>2147483647||e<-2147483648,dr=e=>new g(`Overflow when computing ${e}`),fr={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`},pr={"\\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`},hr=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return pr[e.operator];if(e.kind!==`Function`)return fr[e.kind];let t=e.domain;return t.every((e,t)=>e===t+1)?`TupleValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},gr=e=>mr[hr(e)],_r=(e,t)=>new h(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),vr=(e,t)=>{let n=n=>(...r)=>{try{return n(...r)}catch(n){throw n instanceof h&&(e.isLazy===!0||!(n instanceof g))?_r(t,n.message):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},yr=(e,t)=>{if(typeof e!=`number`)throw _r(t,`Cannot cast tlc2.value.impl.${hr(e)} to tlc2.value.impl.IntValue`);return e},br=(e,t,n)=>`public static tlc2.value.impl.${t} tlc2.module.Integers.${e}(${Array.from({length:n},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,xr=(e,t,n)=>{let r=br(t,`IntValue`,2);return lr(e,(t,i)=>{let a=yr(t,r),o=yr(i,r),s=n(a,o);if(ur(s))throw dr(`${a}${e}${o}`);return s})},Sr=(e,t,n)=>{if(typeof e!=`number`)throw new g(`The ${t} argument of ${n} should be an integer, but instead it is:\n${W(e)}`);return e},Cr=(e,t)=>lr(e,(n,r)=>t(Sr(n,`first`,e),Sr(r,`second`,e))),wr=(e,t,n)=>({...cr(e,t,n),isLazy:!0}),Tr=(e,t,n)=>{let r=ar(e,t,n);return()=>r.call([])},Er=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Dr=()=>({bool:po,condition:(e,t)=>{if(typeof e!=`boolean`)throw $a(t,e);return e},conjunct:(e,t,n)=>{if(typeof e!=`boolean`)throw eo(t,n,e);return e},apply:gn,tuple:z,set:vt,record:R,writtenRecord:F,equal:He,enumerate:vo,unassigned:(e,t)=>{throw Ws(e,t)},primeOutsideAction:e=>{throw Gs(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)=>lo(e,t,n[r]),e.scope),state:e.state,next:e.next})}),Or={value:void 0},kr=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Ar=e=>`local${e.counter++}`,jr=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),qn(e).forEach(e=>jr(e,t)),t),Mr=(e,t,n)=>{let r=kr(e,_s(t,e.environment)),i=jr(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=kr(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Nr=(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(()=>Ar(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Fr(e,t.set,s)}, ${kr(e,t.set)});`),u=t.bounds.map(t=>{let n=Ar(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Fr(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Ar(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})`},Pr=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Fr(e,r[0],n)}, "the left side of =>") ? bool(${Fr(e,r[1],n)}, "the right side of =>") : true)`;if(G(t))return Mr(e,t,n);let i=Mo(t.operator,e.environment);if(i?.kind!==`Builtin`)return Mr(e,t,n);if(i.name===`DOMAIN`)return`${kr(e,io(t))}(${Fr(e,r[0],n)})`;if(i.name===`TLCEval`)return Mr(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${kr(e,ao(t,i))}(${Fr(e,r[0],n)}, ${Fr(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&ws(r[0],a))return`${kr(e,i.evaluateUnary)}(${Fr(e,r[0],n)})`;let o=r.length===2&&ws(r[0],a)&&ws(r[1],a);return i.evaluateBinary&&o?`${kr(e,i.evaluateBinary)}(${Fr(e,r[0],n)}, ${Fr(e,r[1],n)})`:Mr(e,t,n)},Fr=(e,t,n)=>{let r=(t,r=n)=>Fr(e,t,r);if(ps(t)&&cs(t,e.environment))return Mr(e,t,n);switch(t.kind){case`Number`:return Xo(t.value)?String(t.value):Mr(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(G(t))return Mr(e,t,n);let i=Ho(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=kr(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?kr(e,i.value):Mr(e,t,n)}case`Apply`:return Pr(e,t,n);case`And`:{let n=kr(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)}, ${kr(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Rs(t.function);let n=r(t.function),i=kr(e,no(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)}, ${kr(e,to(t))}, ${kr(e,ro(t))})`;case`Record`:{let i=Hs(t.fields);if(Us(i))return Mr(e,t,n);let a=kr(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}, ${kr(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=kr(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`)?Nr(e,t,n):Mr(e,t,n);default:return Mr(e,t,n)}},Ir=(e,t)=>{if(!Er.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=Fr(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(`
|
|
26
|
-
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;Or.value??=Dr();let o=Or.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Lr={kind:`Local`},Rr=/* @__PURE__ */ new WeakMap,zr=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Br=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2}])),Vr=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Hr=e=>e.kind===`Operator`?e.params.length:0,Ur=e=>e.name.includes(`!`),Wr=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Gr=(e,t,n=0)=>t.reduce((e,t)=>({name:t,arity:n,parent:e}),e),Kr=(e,t)=>t.reduce((e,t)=>({name:t.name,arity:t.arity,parent:e}),e),qr=e=>e.kind===`Name`?[e.name]:e.names,Jr=e=>e.flatMap(e=>qr(e.pattern)),Yr=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Vr(n.location,t.location))?n:void 0},Xr=(e,t)=>{let n=Yr(e,t);return n?{key:t.getKey(n),arity:Hr(n)}:t.imported.get(e)},Zr=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),Qr=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),$r=(e,t,n,r)=>{let i=e.location,a=Rr.get(e);if(a!==void 0)return a;if(zr(t))return e.kind===`Apply`?e.args.length:0;if(Qr(t))return 0;let o=Wr(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=Lr),o)return o.arity;let s=Xr(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Rr.set(e,s.arity),s.arity;let c=t.slice(0,t.indexOf(`!`));if(c!==``&&(Wr(n,c)!==void 0||Xr(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=`at line ${i.line}, column ${i.column}`;throw new p(Zr(t)?`Could not find declaration or definition of symbol '${t}' ${l}`:`Unknown operator: \`${t}' ${l}`)},ei=(e,t,n)=>(e.forEach(e=>J(e.set,t,n)),e.reduce((e,t)=>Gr(e,qr(t.pattern)),t)),ti=(e,t)=>e.kind===`Identifier`&&e.name===t&&G(e)||qn(e).some(e=>ti(e,t)),ni=(e,t)=>{e.kind===`FunctionConstruction`&&ti(e.body,t)&&(e.isRecursive=!0),qn(e).forEach(e=>ni(e,t))},ri=(e,t,n)=>{let r=Gr(t,e.kind===`Function`?[e.name]:[]);e.kind===`Function`?(J(e.body,ei(e.bounds,r,n),n),ni(e.body,e.name)):J(e.body,Kr(r,e.params),n)},ii=(e,t,n)=>{let r=e.filter(e=>e.isRecursive).reduce((e,t)=>({name:t.name,arity:Hr(t),parent:e}),t);return e.reduce((e,t)=>(Ur(t)||ri(t,e,n),{name:t.name,arity:Hr(t),parent:e}),r)},ai=(e,t,n,r,i)=>{let a=e.kind===`Operator`?e.params[t]:void 0,o=n.location;if(a?.arity===0&&r>0)throw new p(`Operator used in argument number ${t+1} has incorrect number of arguments at line ${o.line}, column ${o.column}`);let s=i?.kind===`Operator`&&i.params.some(e=>e.arity>0);if(a!==void 0&&a.arity>0&&(r!==a.arity||s))throw new p(`Argument number ${t+1} to operator '${e.name}' should be a ${a.arity}-parameter operator at line ${o.line}, column ${o.column}`)},oi=e=>e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:void 0,si=(e,t,n)=>{let r=Wr(t,e.operator)?void 0:Yr(e.operator,n),i=$r(e,e.operator,t,n);if(i!==e.args.length)throw new p(`The operator ${e.operator} requires ${i} arguments at line ${e.location.line}, column ${e.location.column}`);e.args.forEach((e,i)=>{let a=oi(e),o=a===void 0||Wr(t,a)?void 0:Yr(a,n),s=ci(e,t,n);r&&ai(r,i,e,s,o)})},ci=(e,t,n)=>e.kind===`Identifier`?$r(e,e.name,t,n):e.kind===`OperatorReference`?$r(e,e.operator,t,n):(J(e,t,n),e.kind===`Lambda`?e.params.length:0),J=(e,t,n)=>{let r=e=>e.forEach(e=>J(e,t,n));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=$r(e,e.name,t,n);if(r>0)throw new p(`The operator ${e.name} requires ${r} arguments at line ${e.location.line}, column ${e.location.column}`);return}case`OperatorReference`:$r(e,e.operator,t,n);return;case`Apply`:si(e,t,n);return;case`Lambda`:J(e.body,Gr(t,e.params),n);return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:J(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&J(e.other,t,n);return;case`Let`:J(e.body,ii(e.definitions,t,n),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:J(e.body,ei(e.bounds,t,n),n);return;case`UnboundedQuantifier`:J(e.body,Gr(t,e.names),n);return;case`Choose`:e.set&&J(e.set,t,n),J(e.body,Gr(t,qr(e.pattern)),n);return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:J(e.predicate,ei([e.bound],t,n),n);return;case`SetMap`:J(e.expression,ei(e.bounds,t,n),n);return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:if(new Set(e.fields.map(e=>e.name)).size<e.fields.length)throw new p(`Non-unique fields in constructor at line ${e.location.line}, column ${e.location.column}`);r(e.fields.map(e=>e.value));return;case`Except`:r([e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])]);return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:J(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:J(e.body,t,n);return;case`Subexpression`:e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>ci(e,t,n))}},li=(e,t,n)=>(e.set&&J(e.set,t,n),{name:e.name,arity:e.arity,parent:t}),ui=(e,t,n)=>{let r=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?li(t,e,n):(t.kind===`AssumeProve`?ui(t,e,n):J(t,e,n),e),t);return J(e.conclusion,r,n),r},di=(e,t,n)=>e.kind===`AssumeProve`?ui(e,t,n):(J(e,t,n),t),fi=(e,t,n)=>{e?.kind===`Steps`&&e.steps.reduce((e,t)=>pi(t,e,n),t)},pi=(e,t,n)=>{let r=e.body;switch(r.kind){case`Assert`:{let i=di(r.statement,t,n);return fi(e.proof,i,n),r.isSuffices?i:t}case`Define`:return ii(r.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),t,n);case`Have`:case`Case`:return J(r.expression,t,n),fi(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>J(e,t,n)),t;case`Take`:return Gr(ei(r.bounds,t,n),r.names);case`Pick`:{let i=Gr(ei(r.bounds,t,n),r.names);return J(r.body,i,n),fi(e.proof,t,n),i}default:return fi(e.proof,t,n),t}},mi=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:di(e.statement,void 0,t);fi(e.proof,n,t)},hi=(e,t)=>new p(`Multiply-defined symbol '${e}' at line ${t.line}, column ${t.column}`),gi=(e,t,n,r)=>t.reduce((e,t)=>{if(Wr(e,t)||n(t))throw hi(t,r);return{name:t,arity:0,parent:e}},e),_i=(e,t,n,r)=>(e.forEach(e=>yi(e.set,t,n)),e.reduce((e,t)=>gi(e,qr(t.pattern),n,r),t)),vi=(e,t,n)=>{if(e.kind===`Function`){let r=Gr(t,[e.name]),i=_i(e.bounds,r,n,e.location);yi(e.body,i,n);return}let r=gi(t,e.params.map(e=>e.name),n,e.location);yi(e.body,r,n)},yi=(e,t,n)=>{let r=e.location;switch(e.kind){case`Lambda`:yi(e.body,gi(t,e.params,n,r),n);return;case`Let`:{let i=e.definitions.filter(e=>e.isRecursive).map(e=>e.name),a=e.definitions.reduce((e,t)=>{if(Wr(e,t.name)||n(t.name))throw hi(t.name,t.location);return vi(t,Gr(e,i),n),Gr(e,[t.name])},t);yi(e.body,gi(a,(e.instances??[]).flatMap(e=>e.name===void 0?[]:[e.name]),n,r),n);return}case`Forall`:case`Exists`:case`FunctionConstruction`:yi(e.body,_i(e.bounds,t,n,r),n);return;case`SetFilter`:yi(e.predicate,_i([e.bound],t,n,r),n);return;case`SetMap`:yi(e.expression,_i(e.bounds,t,n,r),n);return;case`UnboundedQuantifier`:yi(e.body,gi(t,e.names,n,r),n);return;case`Choose`:e.set&&yi(e.set,t,n),yi(e.body,gi(t,qr(e.pattern),n,r),n);return;default:qn(e).forEach(e=>yi(e,t,n))}},bi=e=>[...e.definitions.map(e=>({name:e.name,kind:`Definition`,location:e.location,isRecursive:e.isRecursive})),...e.instances.flatMap(e=>e.name===void 0?[]:[{name:e.name,kind:`Definition`,location:e.location,isRecursive:!1}]),...e.constants.map(e=>({name:e.name,kind:`Constant`,location:e.location,isRecursive:!1})),...e.variables.map(e=>({name:e.name,kind:`Variable`,location:e.location,isRecursive:!1}))],xi=(e,t)=>{let n=/* @__PURE__ */ new Map;bi(e).sort((e,t)=>Vr(e.location,t.location)?-1:1).forEach(e=>n.set(e.name,[...n.get(e.name)??[],e]));let r=(e,n)=>{if(!t.imported.has(e)&&!Br.has(e))return!1;let r=t.importedAt.get(e);return r===void 0||Vr(r,n)};n.forEach(e=>e.forEach((n,i)=>{let a=e.slice(0,i).some(e=>e.kind===`Definition`||n.kind===`Definition`||e.kind!==n.kind),o=t.imported.get(n.name)?.declaration===n.kind;if(a||!o&&r(n.name,n.location))throw hi(n.name,n.location)}));let i=e=>t=>(n.get(t)??[]).some(t=>t.isRecursive||Vr(t.location,e))||r(t,e);e.definitions.forEach(e=>vi(e,void 0,i(e.location))),e.assumptions.forEach(e=>yi(e.expression,void 0,i(e.location))),e.instances.forEach(e=>{let t=i(e.location),n=gi(void 0,e.params.map(e=>e.name),t,e.location);e.substitutions.forEach(e=>yi(e.expression,n,t))})},Si=(e,t)=>{let n=new Map([...Br,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0})),n},Ci=(e,t,n,r)=>{let i=Kr(void 0,e.params),a={imported:Si(n,r.imported),definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set},o=new Map(e.substitutions.map(e=>[e.name,e.expression])),s=`in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`;return o.forEach((e,n)=>{if(t.every(e=>e.name!==n))throw new p(`Identifier '${n}' is not a legal target of a substitution ${s}`)}),new Map(t.map(t=>{let n=t.name;if(!o.has(n)&&!Wr(i,n)&&!Xr(n,a))throw new p(`Substitution missing for symbol ${n} ${s}`);let r=o.get(n)??{kind:`Identifier`,name:n,location:e.location};if(t.arity===0||r.kind!==`Identifier`)return J(r,i,a),[n,r];if($r(r,r.name,i,a)!==t.arity)throw new p(`An operator must be substituted for symbol '${n}', and it must have arity ${t.arity} ${s}`);return[n,r]}))},wi=(e,t)=>{let n=Si(e,t.imported),r=new Set([...e.theorems,...e.assumptions].flatMap(e=>e.name??[])),i=(e,i)=>({imported:n,definitions:t.definitions,getKey:t.getKey,location:e,self:i,facts:r});e.definitions.forEach(e=>ri(e,void 0,i(e.location,e))),e.assumptions.forEach(e=>J(e.expression,void 0,i(e.location,void 0))),e.theorems.forEach(e=>mi(e,i(e.location,void 0)))},Ti=/* @__PURE__ */ new WeakSet,Ei=/* @__PURE__ */ new WeakSet,Di=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Ni(e,(e,r)=>Di(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&G(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&G(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Oi=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),ki=/* @__PURE__ */ new WeakMap,Ai=e=>ki.get(e)??e.name,ji=(e,t)=>(Ai(t)!==e.name&&ki.set(e,Ai(t)),e),Mi=(e,t)=>ji(e.kind===`Function`?{...e,bounds:Oi(e.bounds,e=>t(e,[])),body:t(e.body,Jr(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Ni=(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=>Mi(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Oi(e.bounds,n),body:t(e.body,Jr(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,qr(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,qr(e.bound.pattern))};case`SetMap`:return{...e,bounds:Oi(e.bounds,n),expression:t(e.expression,Jr(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({name:e.name,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Pi=`LAMBDA`,Fi=(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 Ni(e,(e,n)=>(r.push(...Fi(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Ii=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}},Li=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Ri=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},zi=(e,t)=>e.map(e=>({pattern:Ri(e.pattern,t),set:e.set})),Bi=(e,t)=>e.kind===`Function`?{...e,bounds:zi(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Vi=(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=>ji({...Bi(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:zi(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Ri(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Ri(e.bound.pattern,n),set:e.bound.set}};default:return e}},Hi=e=>`${e}@ENABLED`,Ui=(e,t)=>e.modes.get(t)??e,Wi=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!G(e)&&t.instantiation.variables.has(e.name),Gi=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Gi(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Wi(e,t,n))return[e.name];let r=G(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Gi(r.body,t,/* @__PURE__ */ new Map):void 0},Ki=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Wi(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Hi(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Zi(e.expression,Ui(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Zi(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Zi(e.subscript,Ui(t,`Primed`),n),location:r},Zi(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Gi(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:Hi(r),location:e.location},location:e.location},Zi({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},qi=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),Ji=(e,t)=>e.map(e=>qi(e.name,t)),Yi=(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:[...Ji(t,r),...i.map(e=>qi(e,r))],location:r},location:r}},Xi=(e,t)=>e.instantiation.isParameterized(t)?$i(e,t):void 0,Zi=(e,t,n)=>{let r=e=>Zi(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!G(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Zi(e.expression,Ui(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Zi(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Ui(t,`Enabled`),n)};let s=Ki(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Ti.add(n),n;let r=Xi(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&&Hr(o)>0?Yi(r,a,Hr(o),e.location):{kind:`Apply`,operator:r,args:Ji(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||Ei.has(e),c=e=>(s&&Ei.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:Pi,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:Pi,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=Xi(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...Ji(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=Xi(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?Yi(n,a,Hr(r),e.location):{...e,operator:n}}let c=Ii(t),l=Ni(e,(e,i)=>i.length===0?r(e):Zi(e,t,Li(n,i,c)));return Vi(l,n,c)},Qi=(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:qi(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},$i=(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=Ii(e),o=Bi(Mi(i,(t,n)=>Zi(t,e,Li(/* @__PURE__ */ new Map,n,a))),a);return Qi(o,r.params,i.location)}):t},ea=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Fi(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=>Xi(i,e)??e,getQualifiedKey:t=>{let n=Xi(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Qi(r,e.params,r.location)):t}}},ta=e=>e.kind===`Let`&&e.instances!==void 0||qn(e).some(ta),na=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Ni(e,e=>na(e,t,r));return i.kind!==`Let`||!i.instances?i:{kind:`Let`,definitions:i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Vr(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}},ra=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ia=(e,t)=>e.definitions.some(e=>ta(e.body))||e.assumptions.some(e=>ta(e.expression))||e.theorems.some(e=>{let t=ra(e);return t!==void 0&&ta(t)})?{...e,definitions:e.definitions.map(e=>Mi(e,e=>na(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:na(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=ra(e);return n===void 0?e:{...e,statement:na(n,t,[])}})}:e,aa=/* @__PURE__ */ new WeakMap,oa=/* @__PURE__ */ new WeakMap,Y=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},sa=(e,t,n)=>{let r=e.slice();return r[t]=n,r},ca=(e,t,n)=>{if(typeof t==`boolean`)return t;throw new h(`In computing ${n?`initial`:`next`} states, TLC expected a boolean expression,\nbut instead found ${W(t)}.\n${Qa(e)}`)},la=(t,r,i=X(t,r))=>{if(r.next!==void 0&&t.kind===`Number`)throw n(new h(`The next state relation is not a boolean expression.\n${t.text??t.value}`),e.error);return ca(t,i,r.next===void 0)},ua=e=>e===`=`||e===`\\in`||e===`\\subseteq`,da=(e,t,n)=>{let r=n?aa:oa,i=r.get(e);if(i)return i;let a=Ba(e,t,n);return r.set(e,a),a},fa=(e,t)=>{if(t.constants.has(e))return;let n=mo(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},pa=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return pa(e.expression,t,!1,r);if(e.kind!==`Identifier`||G(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=fa(e.name,t);if(a&&!r.has(a))return r.add(a),pa(a.body,t,n,r)},ma=(e,t,n)=>pa(e,t,!n),ha=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return ha(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Jo(e.definitions,Y(r,t,n));return ha(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=co(t,e.name);if(a?.kind===`Thunk`)return ha(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=fa(e.name,r.environment);if(s)return ha(s.body,void 0,n,r,i)},ga=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||G(e))||!t&&e.kind===`Prime`,_a=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>_a(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=fa(e.name,t);if(i)return n.add(e.name),_a(i.body,t,n)},va=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),ya=(e,t,n)=>va.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||ua(e.operator)&&(ga(e.args[0],n)||ma(e.args[0],t,n)!==void 0)||G(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,ba=/* @__PURE__ */ new Set,xa=(e,t)=>{if(G(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Ni(e,(e,i)=>{let a=r.isReadOnly?xa(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Sa=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||G(e)?void 0:mo(r,t);return i&&!n.has(i)&&(n.add(i),Sa(i.body,t,n))?!0:qn(e).some(e=>Sa(e,t,n))},Ca=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=ma(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=_a(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return ya(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:da(e,t,n)}},wa=(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(Xs(e,t)===void 0||Sa(e,t,/* @__PURE__ */ new Set))return!0;let n=xa(e,ba);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)}},Ta=(e,t,n)=>{let r=e.map(e=>Ca(e,t,n)),i=r.map(()=>void 0),a=(e,n,o,s,c,l)=>{let u=s,d;for(let s=e;s<r.length;s++){if(s>0&&n.isInit&&Wa(u)){d??=Y(n,o,u);for(let e=s;e<r.length;e++)if(!Ea(r[e].expression,d))return;l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Y(n,o,u);let r=i[s]??=ys(e.expression,t);if(!la(e.expression,d,r(d)))return;continue}if(e.kind===`Assign`){d??=Y(n,o,u);let r=(i[s]??=ys(e.value,t))(d),a=u[e.index];if(a===void 0)u=sa(u,e.index,r),d=void 0;else if(!He(a,r))return;continue}if(e.kind===`Unchanged`){let t=n.current;if(!t)return;for(let n of e.indices){let e=u[n];if(e===void 0)u=sa(u,n,t[n]),d=void 0;else if(!He(e,t[n]))return}continue}let f=s+1;e.runner(n,o,u,c,!0,(e,t)=>a(f,n,o,e,t,l));return}l(u,c)};return(e,t,n,r,i,o)=>a(0,e,t,n,r,o)},Ea=(e,t)=>ca(e,X(e,t),!0),Da=e=>(t,n,r,i,a,o)=>{la(e,Y(t,n,r))&&o(r,i)},Oa=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Y(r,i,a);if(a[l]!==void 0){la(e,u)&&c(a,o);return}let d=X(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!B(f))throw new h(`In computing ${r.isInit?`initial`:`next`} states, the right side of \\IN is not enumerable.\n${Qa(e)}`);let p=qt(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(sa(a,l,p[e]),o)}},ka=/* @__PURE__ */ new WeakMap,Aa=e=>{let t=ka.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Aa),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return ka.set(e,n),n},ja=(e,t)=>{let n=e.args[0],r=Da(e),i=(e,r,i)=>ha(n,r,i,e,!t)??-1,a=Oa(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=X(e.args[1],Y(t,n,o));l(sa(o,u,d),s)}},Ma=(e,t,n,r)=>{if(e.kind===`FunctionConstruction`)return{bounds:e.bounds,body:e.body,scope:t};if(e.kind!==`Identifier`)return;let i=co(t,e.name);if(i?.kind===`Thunk`)return Ma(i.expression,i.scope,n,r);let a=i?void 0:mo(e.name,r.environment);if(a?.kind!==`Function`)return;let o=X(e,Y(r,void 0,n));return{bounds:a.bounds,body:a.body,scope:lo(void 0,a.name,o)}},Na=(e,t,n)=>{let r=Da(e);return(i,a,o,s,c,l)=>{let u=Ma(e.function,a,o,i);if(!u){r(i,a,o,s,c,l);return}let d=Y(i,a,o),f=e.args.map(e=>X(e,d)),p=f.length===1?f[0]:z(f),m=bo(u.bounds,Y(i,u.scope,o));if(!rn(p,m))throw new h(`Attempted to apply a function to ${W(p)}, which is not in its domain at ${Xa(e)}`);da(u.body,t,n)(i,xo(u.bounds,u.scope,p),o,s,c,l)}},Pa=(e,t)=>{if(_a(e,t))return Ta([Aa(e)],t,!1);if(e.kind===`Tuple`)return da(Aa(e),t,!1);let n=Aa(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?co(i,e.name):void 0;l?.kind===`Thunk`?da(Aa(l.expression),t,!1)(r,l.scope,a,o,s,c):la(n,Y(r,i,a))&&c(a,o)}},Fa=(e,t,n)=>{let r=e.operator,i=Da(e),a=G(e)?void 0:Mo(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Ds(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=da(a.body,t,n),o.body(e,i(Y(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Y(a,o,s),f=Po(e,d);f?.kind===`Closure`?da(f.body,t,n)(a,Ko(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Ia=(e,t,n)=>{let r=Da(e),i=G(e)?void 0:fa(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=co(s,e.name);f?.kind===`Thunk`?da(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=da(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},La=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||G(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!G(a))return;let o=pa(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=>La(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||G(e))return;let r=Mo(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=La(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(i&&o?.kind===`Identifier`&&G(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Ra=(e,t,n)=>{let r=co(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},za=(e,t,n)=>{let r=e.map(e=>da(e,t,n)),i=n?[]:e.map(e=>La(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&&Ra(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)}},Ba=(e,t,n)=>{let r=e=>da(e,t,n);switch(e.kind){case`And`:return Ta(e.operands,t,n);case`Or`:return za(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=vo(X(a.set,Y(t,n,r)),a.set);for(let a=0;a<l.length&&!t.isStopped;a++)i(t,lo(n,e,l[a]),r,o,s,c)}}let o=n?void 0:wa(e,t);if(o){let r=Ta(o.rest,t,n);return(t,n,i,a,s,c)=>{let l=Y(t,n,i),u=e.bounds.map(e=>vo(X(e.set,l),e.set));if(u.some(e=>e.length===0))return;let d=(e,n)=>{if(e<0)r(t,n,i,a,s,c);else for(let r of u[e]){if(t.isStopped)return;let a=lo(n,o.names[e],r);if(e===u.length-1){let e=Y(t,a,i);if(!o.guards.every(t=>la(t,e)))continue}d(e-1,a)}};d(u.length-1,n)}}return(t,n,r,a,o,s)=>{yo(e.bounds,Y(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Xs(e,t)!==void 0&&!Sa(e.body,t,/* @__PURE__ */ new Set)?xa(e,ba):void 0;return(t,n,r,o,s,c)=>{let l=[];yo(e.bounds,Y(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>co(n,e)?.kind===`Value`)){u.every(n=>la(e.body,Y(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Wa(r)?u.slice(n).every(n=>Ea(e.body,Y(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=X(e.condition,Y(r,i,a));(po(l,`an IF condition`)?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=Y(r,i,a),u=t.find(e=>po(X(e.condition,l),`a CASE guard`))?.body??n;if(!u)throw new h(`In computing ${r.isInit?`initial`:`next`} states, TLC encountered a CASE with no conditions true.\n${Qa(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=is(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Jo(e.definitions,Y(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new h(`UNCHANGED appears in an initial predicate at ${Xa(e)}`)}:Pa(e.expression,t);case`AngleAction`:{let t=r(e.action),n=Aa(e.subscript);return(e,r,i,a,o,s)=>t(e,r,i,a,o,(t,i)=>{la(n,Y(e,r,t))||s(t,i)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,Aa(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Ia(e,t,n);case`FunctionApplication`:return Na(e,t,n);case`Apply`:{let i=e.args;if(ua(e.operator)){let r=ma(i[0],t,n);if(r!==void 0)return e.operator===`=`?Ta([e],t,n):Oa(e,()=>r);if(ga(i[0],n))return ja(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=X(i[0],Y(t,n,r));(typeof c==`boolean`?c:po(c,`the left side of => at ${Xa(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Fa(e,t,n)}default:return Da(e)}},Va=/* @__PURE__ */ new WeakMap,Ha=e=>{let t=Va.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Va.set(e,n),n},Ua=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Wa=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Ga=(e,t)=>{let n=t.state;if(!n||!Wa(n))throw new h(`ENABLED needs a complete state at ${Xa(e)}`);let r=t.environment,i={environment:r,isInit:!1,current:n,isStopped:!1};return da(e,r,!1)(i,t.scope,Ha(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Ka=(t,r,i,a)=>{let o={environment:r,isInit:!0,current:void 0,isStopped:!1};da(t,r,!0)(o,a,Ha(r),void 0,!1,t=>{if(!o.isStopped){if(!Wa(t))throw n(new h(`The initial predicate does not assign ${Ua(t,r).join(`, `)}`),e.error);o.isStopped=i(t)}})},qa=(e,t,n)=>{let r=[];return Ka(e,t,e=>(r.push(e),!1),n),r},Ja=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,current:t,isStopped:!1},o={successors:0};return da(e,n,!1)(a,i,Ha(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Wa(e))throw new _(e,t,Ua(e,n).sort());o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Ya=(e,t,n,r)=>{let i=[];return Ja(e,t,n,e=>(i.push(e),!1),r),i},Xa=e=>`line ${e.location.line}, column ${e.location.column}`,Za=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,Qa=e=>{let t=e.location.range;return t?Za(t):Xa(e)},$a=(e,t)=>new h(`A non-boolean expression (${gr(t)}) was used as the condition of an IF.\n${Qa(e)}`),eo=(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):Qa(r);return new h(`A non-boolean expression (${gr(n)}) was used as a formula in a conjunction.\n${i}`)}let i=e.operands[Math.max(t,1)].location.range?.end??r.end;return new h(`Attempted to evaluate an expression of form P /\\ Q when ${t===0?`P`:`Q`} was\n${gr(n)}.\n${Qa({...e,location:{...e.location,range:{...r,end:i}}})}`)},to=e=>t=>pn(t)?`Attempted to select nonexistent field "${e.field}" from the record\n${W(t)}\n${Qa(e)}`:fn(t,e.field),no=e=>t=>`A non-function (${gr(t)}) was applied as a function.\n${Qa(e)}`,ro=e=>t=>`Attempted to select field "${e.field}" from a non-record value ${W(t)}\n${Qa(e)}`,io=e=>t=>{if(!N(t))throw new h(`Attempted to apply the operator DOMAIN to a non-function\n(${gr(t)})\n${Qa(e)}`);return vn(t)},ao=(e,t)=>(n,r)=>{if(!M(n)||L(n))throw new h(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Qa(e)}`);return t.evaluate([n,r])},oo=t=>n(new h(`TLC can't handle real numbers: ${t.text} at ${Xa(t)}`),e.configParseError),so=t=>n(new h(`TLC can't handle a number this big: ${t.text??t.value} at ${Xa(t)}`),e.error),co=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},lo=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),uo=(e,t,n)=>{if(t.kind===`Name`)return lo(e,t.name,n);let r=en(n);if(!r||r.length!==t.names.length)throw new h(`Cannot bind <<${t.names.join(`, `)}>> to ${W(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>lo(e,t,r[n]),e)},fo=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next}),po=(e,t)=>{if(typeof e!=`boolean`)throw new h(`Expected ${t} to be a boolean but found ${W(e)}`);return e},mo=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),ho=(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=mo(n,t);if(e&&!t.constants.has(n)&&!go(e,t))return!0}return qn(e).some(e=>ho(e,t))},go=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!ho(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>ho(e.set,t)));return t.constantLevels.set(e,r),r},_o=(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.`},vo=(e,t)=>{if(!M(e)||L(e)){let n=W(e),r=_o(e,n);throw new h(r===void 0?`TLC encountered a non-enumerable quantifier bound\n${n}.\n${Qa(t)}`:`TLC encountered the non-enumerable quantifier bound\n${n}\n${Qa(t)}\n${r}`)}return typeof e==`object`&&e.kind===`Interval`?kt(e):V(e).elements},yo=(e,t,n)=>{let r=e.map(e=>vo(X(e.set,t),e.set)),i=(t,a)=>t<0?n(a):r[t].some(n=>i(t-1,uo(a,e[t].pattern,n)));return i(e.length-1,t.scope)},bo=(e,t)=>{let n=e.map(e=>X(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},xo=(e,t,n)=>{if(e.length===1)return uo(t,e[0].pattern,n);let r=en(n)??[];return e.reduce((e,t,n)=>uo(e,t.pattern,r[n]),t)},So=/* @__PURE__ */ new WeakMap,Co=(e,t)=>{let n=So.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:Za(r)};return So.set(t,i),i},wo=(e,t,n)=>{let r=Co(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}},To=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Dn(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(We(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},Eo=(e,t)=>{let n=bo(e.bounds,t),r=To(n,(n,r)=>X(e.body,fo(t,xo(e.bounds,lo(void 0,e.name,r),n))),wo(e.bounds,e.body,n));return e.bounds.length===1?sn(r):r},Do=(e,t)=>e.kind===`Function`?Eo(e,t):X(e.body,t),Oo=(e,t)=>{let n=go(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new h(`Operator ${e.name} requires ${e.params.length} arguments`);let i=fo(t,void 0);if(!n)return Do(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>Do(e,i));return t.environment.definitionValues.set(e,a),a},ko=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=X(e.expression,fo(t,e.scope));return n&&(e.cache=r),r},Ao=/* @__PURE__ */ new WeakMap,jo=e=>{let t=Ao.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Ao.set(e,n),n},Mo=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Mo(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?jo(r):t.builtins.get(e)},No=/* @__PURE__ */ new WeakMap,Po=(e,t)=>{if(G(e))return Fo(e.operator,t);let n=No.get(e),r=n===void 0?Mo(e.operator,t.environment)??null:n;return n===void 0&&No.set(e,r),r??Fo(e.operator,t)},Fo=(e,t)=>{let n=co(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Mo(e,t.environment)},Io=e=>e.kind===`Closure`?e.params.length:e.arity,Lo=(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:Fo(n,t);if(!r)throw new h(`Expected an operator argument at ${Xa(e)}`);return r},Ro=(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)=>lo(e,n.name,t[r]),e.scope);return X(e.body,fo(n,r))},zo=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Io(e),call:n=>Ro(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},Bo=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Fo(e.name,t);return n!==void 0&&Io(n)>0},Vo=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),Ho=(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 Ho(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([])}},Uo=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Xo(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=G(e)?void 0:Ho(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=co(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Vo(e,t)}}return t=>Vo(e,t)},Wo=/* @__PURE__ */ new WeakMap,Go=(e,t)=>{let n=Wo.get(e);if(n)return n;let r=Uo(e,t);return Wo.set(e,r),r},Ko=(e,t,n)=>{if(t.length!==e.params.length)throw new h(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`);let r=e.scope;for(let i=0;i<t.length;i++){let a=e.params[i],o=a.arity>0?{kind:`Operator`,operator:Lo(t[i],n)}:Go(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},qo=(e,t,n)=>e.kind===`Closure`?X(e.body,fo(n,Ko(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>X(e,n))):e.isLazy?e.evaluate(Ts(t,n),n):e.evaluate(t.map(e=>Bo(e,n)?zo(Lo(e,n),n):X(e,n)),n),Jo=(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),Yo=(e,t,n)=>{let r=co(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return ko(r,n);if(r?.kind===`Operator`){if(Io(r.operator)===0)return Ro(r.operator,[],n);throw new h(`Operator ${e} is used without arguments`)}let i=Ho(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Ws(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Oo(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new h(`Unknown identifier ${e} at ${Xa(t)}`)},Xo=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Zo=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Qo=(e,t)=>Zo.has(e)||t.builtins.get(e)?.isStateLevel===!0,$o={builtins:Zo,definitions:/* @__PURE__ */ new WeakMap},es={builtins:new Set([...Zo].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},ts=(e,t)=>e.kind===`Operator`&&e.params.length===0&&go(e,t),ns=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!G(e)){let e=mo(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!ts(e,t)&&rs(e,t,n))return!0}return qn(e).some(e=>ns(e,t,n))},rs=(e,t,n=$o)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=ns(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>ns(e.set,t,n));return n.definitions.set(e,i),i},is=(e,t)=>new Set(e.filter(e=>rs(e,t))),as=e=>[...e.definitions.values()].some(t=>rs(t,e)),os=e=>[...e.definitions.values()].some(t=>rs(t,e,es)),ss=/* @__PURE__ */ new WeakMap,cs=(e,t)=>{let n=ss.get(e);if(n!==void 0)return n;let r=fs(e,t,us);return ss.set(e,r),r},ls=/* @__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`]),us=/* @__PURE__ */ new Set,ds=(e,t,n)=>n.size===0?cs(e,t):fs(e,t,n),fs=(e,t,n)=>{if(!ls.has(e.kind))return!1;if(e.kind===`Identifier`&&G(e))return n.has(e.name);if(G(e))return!1;if(e.kind===`Identifier`){let n=Ho(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&ts(n.definition,t)}if(e.kind===`Apply`){if(Qo(e.operator,t)||e.operator===`~>`)return!1;let r=Mo(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=mo(e.operator,t);if(!n||!go(n,t)||rs(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&ds(e,t,n))}let r={value:!0};return Ni(e,(e,i)=>(r.value&&=ds(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},ps=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,ms=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}},hs=(e,t)=>{if(e.kind===`Identifier`&&G(e))return!t.has(e.name);if(G(e))return!0;let n={value:!1};return Ni(e,(e,r)=>(n.value||=hs(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},gs=(e,t)=>Ti.has(e)&&ps(e)&&Xs(e,t)!==void 0&&!hs(e,us),_s=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=qs(e,t),i=ps(e)&&cs(e,t)?ms(r):gs(e,t)?Ss(r):r;return t.evaluators.set(e,i),i},vs=/* @__PURE__ */ new WeakMap,ys=(e,t)=>{let n=vs.get(e);if(n)return n;let r=(ps(e)&&cs(e,t)?void 0:Ir(e,t))??_s(e,t);return vs.set(e,r),r},X=(e,t)=>ys(e,t.environment)(t),bs=(e,t)=>{let n=e.name,r=G(e)?void 0:Ho(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Ws(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&&go(e,t))return t=>Oo(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=ys(e.body,t),n.body(fo(r,void 0)));return xs(e,t)?Ss(r):r}return t=>Oo(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Oo(e,t);return go(e,t)||!xs(e,t)?n:Ss(n)}return t=>Yo(n,e,t)},xs=(e,t)=>Xs(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Xs(e.set,t)!==void 0)),Ss=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}},Cs=(e,t)=>{let n=Mo(e,t);return n!==void 0&&Io(n)>0},ws=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!G(e)&&Cs(e.name,t)),Ts=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>X(e,t),expression:e})),Es=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Ts(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&ws(t[0],n)){let e=_s(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&ws(t[0],n)&&ws(t[1],n);if(i&&a){let e=_s(t[0],n),r=_s(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>Bo(e,n)?zo(Lo(e,n),n):X(e,n)),n)},Ds=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new h(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Go(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:Lo(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Os=/* @__PURE__ */ new WeakMap,ks=e=>{let t=Os.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return Os.set(e,n),n},As=(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},js=(e,t)=>e.every((e,n)=>We(e,t[n])),Ms=(e,t)=>{let n=mo(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&go(n,t)&&!rs(n,t)},Ns=(e,t,n,r)=>{let i=Ds(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=ys(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next}));if(!r)return e=>o(i(e),e);let s=ks(e);return e=>{let n=i(e),r=As(n,t.length);if(!r)return o(n,e);let a=r.length;for(let e of r)a=Sn(a,Dn(e));let c=s.calls.get(a),l=c?.find(e=>js(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}},Ps=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=_s(n[0],t),r=_s(n[1],t);return t=>!po(e(t),`the left side of =>`)||po(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new h(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=G(e)?void 0:Mo(e.operator,t);if(r?.kind===`Closure`)return Ns(r,n,t,Ms(e,t));if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=_s(n[0],t),i=io(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=_s(n[0],t);return Ei.has(e)||ho(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=_s(n[0],t),a=_s(n[1],t),o=ao(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?Es(r,n,t):r=>{let i=Fo(e.operator,r);if(i)return qo(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new h(`${e.operator} is a function; apply it with brackets`):e.operator===`\\cdot`?new h(`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`):new h(`Unknown operator ${e.operator} at ${Xa(e)}`)}},Fs=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=_s(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=_s(a.set,t);return t=>{let s=vo(o(t),a.set);for(let a=0;a<s.length;a++){let o=po(i(fo(t,lo(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=>_s(e.set,t));return t=>{let s=a.map((e,n)=>vo(e(t),o[n].set)),c=(a,o)=>{if(a<0)return po(i(fo(t,o)),r)!==n;let l=s[a];for(let t=0;t<l.length;t++)if(c(a-1,lo(o,e[a],l[t])))return!0;return!1};return c(o.length-1,t.scope)?!n:n}}return e=>yo(o,e,t=>po(i(fo(e,t)),r)!==n)?!n:n},Is=(e,t)=>{if(e.kind===`Tuple`)return z(e.names.map(e=>{let n=co(t,e);return n?.kind===`Value`&&n.value}));let n=co(t,e.name);return n?.kind===`Value`?n.value:void 0},Ls=/* @__PURE__ */ new WeakSet,Rs=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Ls.add(e)},zs=(e,t)=>{let n=Ls.has(e),r=_s(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=_s(a.set,t);return t=>{let c=o?s(t):bo(i,t),l=typeof c==`object`&&c.kind===`ProductSet`&&i.length>1?c.factors:[c];if(e.isRecursive||n||!l.every(ge)){let n=To(c,e=>r(fo(t,xo(i,t.scope,e))),wo(i,e.body,c));return i.length===1?sn(n):n}if(o&&a.pattern.kind===`Name`){let e=a.pattern.name,n=jt(c);return sn(R(n,n.map(n=>r(fo(t,lo(t.scope,e,n))))))}let u=[];return yo(i,t,e=>{let n=i.length===1?Is(a.pattern,e)??!1:z(i.map(t=>Is(t.pattern,e)??!1));return u.push([n,r(fo(t,e))]),!1}),Ct(u)}},Bs=(e,t)=>{let n=Ls.has(e);n&&Rs(e.function);let r=_s(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=>_s(e,t))}),value:_s(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):z(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(fo(i,lo(i.scope,`@`,e))):yn(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}},Vs=(e,t)=>{if(e.kind===`SetFilter`){let n=_s(e.predicate,t),r=_s(e.bound.set,t),i=e.bound.pattern;return t=>{let a=r(t),o=e=>po(n(fo(t,uo(t.scope,i,e))),`a set filter predicate`);if(!ge(a)){if(M(a))return{kind:`FilteredSet`,base:a,test:o};throw new h(`TLC encountered a non-enumerable quantifier bound ${W(a)} at ${Xa(e.bound.set)}`)}return Ve(V(a).elements.filter(o))}}if(e.kind===`SetMap`){let n=_s(e.expression,t);return t=>{let r=[];return yo(e.bounds,t,e=>(r.push(n(fo(t,e))),!1)),vt(r)}}let n=e.set;if(!n)return()=>{throw new h(`TLC cannot evaluate an unbounded CHOOSE at ${Xa(e)}`)};let r=_s(e.body,t),i={pattern:e.pattern,set:n};return t=>{let n={value:void 0};if(yo([i],t,i=>po(r(fo(t,i)),`the body of CHOOSE`)?(n.value=Is(e.pattern,i),!0):!1),n.value===void 0)throw new h(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Qa(e)}`);return n.value}},Hs=e=>[...e].sort((e,t)=>Re(e.name,t.name)),Us=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Ws=(t,n)=>a(new h(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${Qa(n)}`),e.configParseError),Gs=e=>new h(`A primed expression appears outside an action at ${Xa(e)}`),Ks=(e,t)=>{let n=Hs(e),r=Us(n),i=n.map(e=>_s(e.value,t));if(r)return e=>Ct(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=>F(a,i.map(t=>t(e)),o):e=>R(a,i.map(t=>t(e)))},qs=(e,t)=>{let n=e=>_s(e,t);switch(e.kind){case`Number`:{let t=e.value;return Xo(t)?()=>t:()=>{throw so(e)}}case`Decimal`:return()=>{throw oo(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return bs(e,t);case`Apply`:return Ps(e,t);case`OperatorReference`:case`Lambda`:return()=>{throw new h(`An operator cannot be used as a value at ${Xa(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 eo(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(po(t[n](e),`a disjunct`))return!0;return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw Gs(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=>He(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 $a(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(po(e.condition(n),`a CASE guard`))return e.body(n);if(r)return r(n);throw new h(`Attempted to evaluate a CASE with no conditions true.\n${Qa(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(fo(n,Jo(e.definitions,n)))}case`Forall`:case`Exists`:return Fs(e,t);case`UnboundedQuantifier`:return()=>{throw new h(`TLC cannot evaluate an unbounded quantifier at ${Xa(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Vs(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>vt(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>z(t.map(t=>t(e)))}case`FunctionConstruction`:return zs(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 Ks(e.fields,t);case`RecordSet`:{let t=Hs(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 Bs(e,t);case`ExceptAt`:return t=>{let n=co(t.scope,`@`);if(n?.kind!==`Value`)throw new h(`@ appears outside an EXCEPT at ${Xa(e)}`);return n.value};case`FunctionApplication`:{Rs(e.function);let t=n(e.function),r=e.args.map(n),i=no(e);if(r.length===1){let e=r[0];return n=>gn(t(n),e(n),void 0,i)}return e=>gn(t(e),z(r.map(t=>t(e))),void 0,i)}case`FieldAccess`:{let t=n(e.record),r=e.field,i=to(e),a=ro(e);return e=>gn(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?po(t(e),`an action`)||r(e):po(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Ga(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new h(`The subexpression reference at ${Xa(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new h(`TLC cannot evaluate a temporal formula in a state at ${Xa(e)}`)}}},Js=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Ys=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Xs=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Js.has(e.kind))return!1;let a=Ys(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&&Qo(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 qn(e).every(i)};return i(e)?[...n]:void 0},Zs=/* @__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=_e(e,a.index,e=>e===`-`)-a.index;e.slice(a.index+t).trimStart().startsWith(`MODULE`)&&a.moduleDepth++,c(`Separator`,`----`,t);continue}if(e.startsWith(`====`,a.index)){if(c(`ModuleEnd`,`====`,_e(e,a.index,e=>e===`=`)-a.index),a.moduleDepth--,a.moduleDepth<=0)break;continue}if(t===`"`){let t=a.line,r=s(),i=[];for(l(1);e[a.index]!==`"`;){if(a.index>=e.length||`
|
|
20
|
+
\r`.includes(e[a.index]))throw d(`Unterminated string`);if(e[a.index]===`\\`){let t=e[a.index+1];if(t===void 0||!`ntrf\\"`.includes(t))throw d(`Invalid escape in string`);i.push({n:`
|
|
21
|
+
`,t:` `,r:`\r`,f:`\f`}[t]??t),l(2)}else i.push(e[a.index]),l(1)}l(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=de.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(he(t)){let t=e.slice(a.index,_e(e,a.index,he));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(a.index))?.[0]??t;c(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}let n=/^(_|\d+)/.exec(t)?.[0];if(n!==void 0&&!/[A-Za-z]/.test(t)){c(n===`_`?`Operator`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){c(`Keyword`,t.slice(0,3),3);continue}let i=r.get(t)??t;r.set(i,i),c(T.has(t)?`Keyword`:`Identifier`,i,t.length);continue}let o=ve(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let u=ge(e,a.index);if(u){let t=e.slice(a.index,a.index+u.length);c(`Operator`,u.text,u.length,t===u.text?void 0:t)}else throw d(`Unexpected character ${JSON.stringify(t)}`)}let f=s();return n.push({kind:`End`,text:``,line:a.line,column:f,endColumn:f}),n},Se=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],Ce=Se.map(e=>e[0]),we=new Map(Ce.map((e,t)=>[e,t]).reverse()),k=e=>{let t=we.get(e);if(t===void 0)throw new l(`Unknown SANY token kind ${e}`);return t},Te=new Map(Se.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),A=Math.max(...[...Te.keys()].map(e=>e.length)),Ee=Array.from({length:A},(e,t)=>A-t),De=/----+ *MODULE/y,Oe=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],ke=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),Ae=ke(String.raw`\.\/\\`),je=ke(String.raw`\.\\\/`),Me=String.raw`<(?:[0-9]+|\+|\*)>`,Ne=[[`_BM0`,[De]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,Ae],[`BOR`,je],[`IDENTIFIER`,Oe],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Me}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Me,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Me}(?:\*\.*|-\.*|\.+)`,`y`)]]],Pe=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[De]]],Fe=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[De]],[`BAND`,Ae],[`BOR`,je],[`IDENTIFIER`,Oe]],Ie=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Le=(e,t,n)=>e.map(([e,r])=>({kind:k(e),length:Math.max(...r.map(e=>Ie(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),Re=(e,t)=>{let n=Ee.find(n=>Te.has(e.slice(t,t+n))),r=Le(Ne,e,t);if(n===void 0)return r;let i={kind:Te.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},ze=e=>e+8-e%8,j=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
|
|
22
|
+
`?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
|
|
23
|
+
`?r.isAfterLf=!0:i===` `&&(r.column=ze(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},Be=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Ve=new Set([...Te.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),He=(e,t)=>{let n=0;for(;Ve.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,Ie(Be,e,t)))},Ue=e=>{let t=j(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(k(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?Ke(o,s,e[a],i):t.lines[n]===o?e[a]===`
|
|
24
|
+
`||e[a]===`\r`?Ke(o+1,0,void 0,i):Ke(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=Le(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,Ce[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),Ce[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(Pe);if(n.mode===`PRAGMA`)return s(Fe);for(;n.offset<e.length;){let t=n.offset;if(`
|
|
25
|
+
\r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=Re(e,t);if(i.length===0){let n=He(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},We=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
26
|
+
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Ge=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>We.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Ke=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Ge(n)}" (${n.charCodeAt(0)}), `}after : "${Ge(r)}"`,qe=e=>{let t=Ue(e);for(let e=t();typeof e!=`string`&&e.kind!==k(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?ze(e):e+1,e.beginColumn);return Ke(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Je=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],Ye=/* @__PURE__ */ new Set([...Je,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),Xe=[`TYPE`,`TYPE_CONSTRAINT`],Ze=/* @__PURE__ */ new Set([...Je,...Xe]),Qe=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],$e=e=>{let t=[],n={index:0,line:1,lineStart:0},r=(r,i)=>{t.push({kind:`Error`,text:Ke(n.line,r-n.lineStart+1,e[r],i),line:n.line})},i=e=>{t.push({kind:`Error`,text:Ke(n.line+1,0,void 0,e),line:n.line})},a=e=>{let t=e.split(`
|
|
27
|
+
`);t.length>1&&(n.line+=t.length-1,n.lineStart=n.index+e.length-t[t.length-1].length),n.index+=e.length};for(;n.index<e.length;){let o=e.slice(n.index),s=/^\s+/.exec(o)?.[0];if(s){a(s);continue}if(o.startsWith(`\\*`)){let e=o.indexOf(`
|
|
28
|
+
`);a(e===-1?o:o.slice(0,e));continue}if(o.startsWith(`(*`)){let e=o.indexOf(`*)`);if(e===-1)return a(o),i(``),t;a(o.slice(0,e+2));continue}let c=n.line,l=/^\d+(?![A-Za-z_])/.exec(o)?.[0];if(l){t.push({kind:`Number`,text:l,line:c}),a(l);continue}let u=/^[A-Za-z0-9_]+/.exec(o)?.[0];if(u){t.push({kind:`Word`,text:u,line:c}),a(u);continue}if(o.startsWith(`"`)){let s=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(o),l=s?.[0]??`"`;if(s?.[2]!==`"`)return a(l),n.index===e.length?i(`${l}\n`):r(n.index,l),t;t.push({kind:`String`,text:s[1],line:c}),a(l);continue}let d=Qe.find(e=>o.startsWith(e));if(d){t.push({kind:`Symbol`,text:d,line:c}),a(d);continue}let f=ge(e,n.index);if(!f)return r(n.index,``),t;t.push({kind:`Word`,text:f.text,line:c}),a(e.slice(n.index,n.index+f.length))}return t.push({kind:`End`,text:``,line:n.line}),t},et=(e,t)=>new v(`TLC found an error in the configuration file at line ${e}\n${t}`),tt=(e,t)=>et(e,`The keyword ${t} appeared twice.`),nt=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),rt=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),it=(e,t=`master`)=>{let n=t===`1.7.4`?Ze:Ye,r=$e(e),i={index:0},a={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},o={isSet:!1},s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i.index++,r.length-1)];if(e.kind===`Error`)throw new v(`TLC found an error in the configuration file:\n${e.text}`);return e},l=e=>{if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t={token:c()};if(t.token.text!==`}`)for(;e.push(l(t.token)),t.token=c(),t.token.text===`,`;)t.token=c();if(t.token.text!==`}`)throw et(t.token.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw et(e.line,`It was expecting a value, but did not find it.`)},u=e=>{let t=c();if(t.kind===`End`)throw et(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw et(n.line,`It was expecting ], but did not find it.`);return t.text},d=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let r={token:c(),name:t.text};for(;r.token.text===`!`;)r.name=`${r.name}!${c().text}`,r.token=c();let i=r.name;if(r.token.text===`<-`){if(r.token=c(),r.token.text===`[`){let e=u(`<-`),t=c();if(t.kind===`End`)throw et(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:i,target:t.text,module:e});continue}if(r.token.kind===`End`)throw et(r.token.line,`Expected an identifier after <-.`);a.substitutions.push({name:i,target:r.token.text});continue}let o=[],s=r.token.text===`(`;if(s){for(;o.push(l(c())),r.token=c(),r.token.text===`,`;);if(r.token.text!==`)`)throw et(e,``);r.token=c()}if(r.token.text!==`=`)throw et(r.token.line,`It was expecting = or <-, but did not find it.`);r.token=c();let d=r.token.text===`[`?u(`=`):void 0,f=l(d===void 0?r.token:c());a.constants.push({name:i,value:f,...s&&{args:o},...d!==void 0&&{module:d}})}},f=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},p={token:c()};for(;p.token.kind!==`End`;){let e=p.token.text,t=p.token.line,r=n.has(e)?nt.get(e):void 0,i=n.has(e)?rt.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw et(t,`The keyword ${e} was not followed by an identifier.`);return n};if(r!==void 0){let n=l();if(a[r]!==void 0)throw tt(t,e);a[r]=n.text,p.token=c()}else if(i!==void 0)p.token=f(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)p.token=d(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw et(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o.isSet)throw tt(t,e);o.isSet=!0,a.checkDeadlock=n.text===`TRUE`,p.token=c()}else{if(!n.has(e)||!Xe.includes(e))throw et(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw tt(t,e);s.add(e),p.token=c()}}return a},M={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},at=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},ot=e=>e!==void 0&&/^\p{Nd}$/u.test(e),st=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),ct=e=>{let t=t=>{let n=_e(e,t,at);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=_e(e,t,ot);if(e.startsWith(`..`,n)&&ot(e[n+2]))return{kind:`Constant`,first:t,last:_e(e,n+2,ot)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=ot(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:_e(e,t+1,ot)-1,children:[]};if(st(n))return{kind:`Constant`,first:t,last:_e(e,t,st)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},N=e=>{let t=e.length===0?void 0:ct(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=M[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},P=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,lt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),F=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),I=e=>typeof e==`object`&&e.kind===`ModelValue`,ut=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:P(e)?`set`:`function`,dt=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new C(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ft={isUsed:!1},pt=(e,t)=>(ft.isUsed=!0,e.writtenKeys=t,e),mt=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[yr(e.domain,t)]]),ht=(e,t,n)=>pt(Zt(e,t),n),gt=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(gt);e.writtenKeys=void 0,e.range.forEach(gt)}},_t=e=>e.every(e=>typeof e==`string`),vt=(e,t)=>e.length>0&&t.length>0&&_t(e)!==_t(t),yt=(e,t)=>{ft.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return vt(n,r)?yn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=It(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=It(i[e],a[e]);if(t!==0)return t}return 0},bt=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=It(n[e],r[e]);if(t!==0)return t}return 0},xt=e=>I(e)?e.type:void 0,St=(e,t,n)=>{let r=xt(e),i=xt(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(I(e)&&I(t)){if(r===void 0||i===void 0||r===i)return;throw new y(`Attempted to ${a} the differently-typed model values ${z(e)} and ${z(t)}`)}throw r===void 0?new y(`Attempted to ${a} the typed model value ${z(t)} and the non-model value\n${z(e)}`):new y(`Attempted to ${a}${n?``:` the`} typed model value ${z(e)} and non-model value\n${z(t)}`)},Ct={ranks:Object.create(null),size:0},wt=e=>{Ct.ranks=Object.create(null),Ct.size=0,Lt.clear();for(let t of e)Dt(t)},Tt={is174:!1},Et=e=>{Tt.is174=e===`1.7.4`},Dt=e=>(Ct.ranks[e]===void 0&&(Ct.ranks[e]=Ct.size++),e),Ot=()=>Ct.size,kt=e=>Ct.ranks[Dt(e)],At=(e,t)=>{if(e===t)return 0;let n=Ct.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},jt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Mt=(e,t)=>(jt(e)||jt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Nt=(e,t,n)=>{if(!jt(e))throw new y(`Attempted to ${n} the set ${z(L(e)?R(e):e,!0)} with the value:\n${z(t,!0)}`);if(!jt(t))throw new y(`Attempted to compare overridden value ${z(e,!0)} with non-overridden value:\n${z(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new y(`Attempted to compare ${z(e,!0)} with the value\n${z(t,!0)}`)},Pt={kind:`InfiniteSet`,name:`Any`},Ft=e=>{throw new y(`Attempted to compare ANY with the value\n${z(e)}`)},It=(e,t)=>{if(e===t)return ft.isUsed&>(e),e===Pt?Ft(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return yt(e,t);if(n===`Set`&&r===`Set`)return bt(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&St(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return St(e,t,!1),n===`ModelValue`?-1:1;if(e===Pt||t===Pt)return Ft(e===Pt?t:e);if(P(e)&&P(t)&&Mt(e,t))return Nt(e,t,`compare`);let i=P(e);if(i!==P(t))throw new y(`Attempted to compare ${ut(e)} ${z(e)} with ${ut(t)} ${z(t)}`);return i?bt(R(e),R(t)):yt(Dr(e),Dr(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return At(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(St(e,t,!1),I(e))return-1;if(I(t))return 1;throw new y(`Attempted to compare ${ut(e)} ${z(e)} with ${ut(t)} ${z(t)}`)},Lt=/* @__PURE__ */ new Map,Rt=e=>{let t=Lt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:kt(e)};return Lt.set(e,n),n},zt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),Bt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0}),Vt={isPresent:!1},Ht=(e,t)=>(t===`lambda`&&(Vt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Ut=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Wt=e=>Ht(e,`lambda`),Gt=/* @__PURE__ */ new WeakSet,Kt=/* @__PURE__ */ new WeakSet,qt={isPresent:!1},Jt=e=>(qt.isPresent=!0,e),Yt=e=>{qt.isPresent&&typeof e==`object`&&Kt.add(e)},Xt=e=>{!Vt.isPresent&&!qt.isPresent||typeof e!=`object`||Gt.has(e)||(Gt.add(e),e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Xt),e.range.forEach(Xt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Xt):P(e)&&L(e)&&(Yt(e),R(e).elements.forEach(Xt)))},Zt=(e,t)=>Ht(Bt(e,t),`record`),Qt=(e,t)=>{if(Yt(e),e===t)return ft.isUsed&>(e),e!==Pt||Ft(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&St(e,t,!0),It(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return yt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return bt(e,t)===0;if(I(e)||I(t))return St(e,t,!0),I(e)&&I(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Qt(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=pr(e.domain),r=pr(t.domain);if(n||r)return n===r;let i=pr(e.range),a=pr(t.range);return i||a?i===a:Qt(e.domain,t.domain)&&Qt(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(pr(e))return pr(t);if(pr(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&Qt(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return pr(e)?pr(t):!pr(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Qt(e,t.factors[n]));let n=P(e)&&P(t)&&!(L(e)&&L(t));if(n&&Mt(e,t))return Nt(e,t,`check equality of`)===0;if(n){if(!jt(e)){let n=R(e);if(!jt(t))return bt(n,R(t))===0}return ri(e)===ri(t)}return It(e,t)===0},$t=e=>{let t=(e,t)=>e===t||e.length===t.length&&e.every((e,r)=>n(e,t[r])),n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):ri(n)===ri(r);return n},en=$t(!1),tn=$t(!0),nn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},rn=e=>{if(!F(e))return;let t=Dr(e);return{domain:t.domain,range:t.range,low:nn(t.domain)}},an=e=>{if(!F(e))return;let t=Dr(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},on=(e,t)=>{if(xt(e)!==void 0)throw new y(`Attempted to compare the typed model value ${z(e)} and the non-model value\n${z(t)}`);return 1},sn=(e,t)=>{if(xt(e)!==void 0)throw new y(`Attempted to check equality of the typed model value ${z(e)} and the non-model value\n${z(t)}`);return!1},cn=(e,t)=>{let n=xt(e);if(n===void 0)return I(t)?e.rank-t.rank:-1;if(!I(t))throw new y(`Attempted to compare the typed model value ${z(e)} and non-model value\n${z(t)}`);let r=xt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to compare the differently-typed model values ${z(e)} and ${z(t)}`);return e.rank-t.rank},ln=(e,t)=>{let n=xt(e);if(n===void 0)return I(t)&&e.name===t.name;if(!I(t))throw new y(`Attempted to check equality of typed model value ${z(e)} and non-model value\n${z(t)}`);let r=xt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to check equality of the differently-typed model values ${z(e)} and ${z(t)}`);return e.name===t.name},un={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},dn=(e,t,n)=>{let r=un[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${z(e)} with ${r.other}:\n${z(t)}`},fn=(e,t,n)=>{let r=rn(n);if(!r){if(I(n))return on(n,t);throw new y(`Attempted to compare the function ${z(t)} with the value:\n${z(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>pn(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return pn(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new y(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${z(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},pn=(e,t)=>{for(let n=0;n<e.length;n++){let r=yn(e[n],t[n]);if(r!==0)return r}return 0},mn=(e,t)=>{let n=Dr(e);if(e.kind===`Function`&&br(n)!==void 0){let r=F(t)?br(t):void 0;return r?n.range.length-r.length||pn(n.range,r):fn({...n,low:1},e,t)}if(Ut(e)===`record`){let r=an(t);if(!r){if(I(t))return on(t,e);throw new y(`Attempted to compare record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length-r.domain.length||pn(n.domain,r.domain)||pn(n.range,r.range)}return fn({...n,low:nn(n.domain)},e,t)},hn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),gn=(e,t)=>jt(e)||jt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),_n=(e,t)=>{let n=hn(t)?t:R(t);return{elements:R(e).elements,otherElements:R(n).elements}},vn=(e,t)=>{if(gn(e,t))return It(e,t);if(!hn(e))return vn(R(e),t);if(!P(t)){if(I(t))return on(t,e);throw new y(`Attempted to compare the set ${z(e)} with the value:\n${z(t)}`)}let n=_n(e,t);return n.elements.length-n.otherElements.length||pn(n.elements,n.otherElements)},yn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return It(e,t);if(I(t))return on(t,e);throw new y(dn(e,t,!1))}return e.kind===`ModelValue`?cn(e,t):F(e)?mn(e,t):vn(e,t)},bn=(e,t)=>e.every((e,n)=>wn(e,t[n])),xn=(e,t,n)=>{let r=rn(n);if(!r){if(I(n))return sn(n,t);throw new y(`Attempted to check equality of the function ${z(t)} with the value:\n${z(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&bn(e.range,r.range);let i=e.low??r.low;return i===void 0?bn(e.domain,r.domain)&&bn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new y(`Attempted to compare an integer with non-integer:\n${z(e)}.`);return e===i+t})&&bn(e.range,r.range)},Sn=(e,t)=>{let n=Dr(e);if(e.kind===`Function`&&br(n)!==void 0){let r=F(t)?br(t):void 0;return r?n.range.length===r.length&&bn(n.range,r):xn({...n,low:1},e,t)}if(Ut(e)===`record`){let r=an(t);if(!r){if(I(t))return sn(t,e);throw new y(`Attempted to check equality of record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length===r.domain.length&&bn(n.domain,r.domain)&&bn(n.range,r.range)}return xn({...n,low:nn(n.domain)},e,t)},Cn=(e,t)=>{if(gn(e,t))return Qt(e,t);if(!hn(e))return Cn(R(e),t);if(!P(t)){if(I(t))return sn(t,e);throw new y(`Attempted to check equality of the set ${z(e)} with the value:\n${z(t)}`)}let n=_n(e,t);return n.elements.length===n.otherElements.length&&bn(n.elements,n.otherElements)},wn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(I(t))return sn(t,e);throw new y(dn(e,t,!0))}return e.kind===`ModelValue`?ln(e,t):F(e)?Sn(e,t):Cn(e,t)},Tn=e=>{let t=[];for(let n of e){let e=Dn(n,t);e.isFound||t.splice(e.index,0,n)}return t},En=(e,t)=>{let n=Sr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Dn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=En(e,()=>yn(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},On=(e,t)=>t.some(t=>En(t,()=>wn(t,e))),kn=/* @__PURE__ */ new WeakSet,An=e=>{typeof e==`object`&&(e.kind===`Set`&&(kn.add(e),e.elements.forEach(An)),e.kind===`Function`&&(e.domain.forEach(An),e.range.forEach(An)))},jn=(e,t)=>Cr(()=>Qt(e,t),()=>wn(e,t)),Mn=e=>{for(let t=1;t<e.length;t++)if(It(e[t-1],e[t])>=0)return!1;return!0},Nn=e=>{for(let t=1;t<e.length;t++)Yt(e[t]);if(e.length<2||Mn(e))return zt(e);let t=[...e].sort(It),n=[t[0]];for(let e=1;e<t.length;e++)It(n[n.length-1],t[e])!==0&&n.push(t[e]);return zt(n)},Pn=e=>Cr(()=>Nn(e),()=>({kind:`MixedSet`,elements:e})),Fn=zt([]),In=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&It(r[a],t)<0;)a++;a<r.length&&It(r[a],t)===0||i.push(t)}return i.length===n.length?e:zt(i)},Ln=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&It(r[a],t)<0;)a++;a<r.length&&It(r[a],t)===0&&i.push(t)}return i.length===n.length?e:zt(i)},Rn=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=It(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=zt(i);if(e.hash!==0&&e.hash!==Ur){let t=e.hash,n=0;for(;n<a.length;n++){let e=Jr(a[n]);if(e===Ur)break;t=t+Vr(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Qr(a[e])|0;c.fingerprint=t}return c},zn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>It(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&It(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Bt(n,r)},Bn=e=>{let t=zn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:pt(t,e.map(e=>e[0]))},Vn=[],Hn=[],Un=/* @__PURE__ */ new WeakMap,Wn=e=>{let t=Vn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Vn[e]=n,n},Gn=e=>{if(gr(e),e.low===1&&e.high>=1)return Wn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Kn=e=>e.length>0&&(e===Vn[e.length]||Un.has(e)),qn=e=>{let t=R(e).elements;return Kn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Jn=e=>{let t=Hn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Hn[e]=n,n},Yn=e=>Ht(Bt(Wn(e.length),e),`tuple`),Xn=e=>Ht(zn(e),`record`),Zn=e=>P(e)&&!jt(e),Qn=(e,t=!1)=>`UNION(${z(e.base,t)})`,$n=(e,t=e=>R(e).elements)=>{if(!Zn(e.base))throw new y(`Attempted to enumerate the nonenumerable set:\n${Qn(e)}`);return t(e.base)},er=(e,t,n)=>{if(Zn(e))return e;throw new y(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${z(e)}\nwhen enumerating:\n${Qn(n)}`)},L=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return L(e.base);case`FunctionSet`:return L(e.domain)&&L(e.range)||tr(e.domain)===!0||tr(e)===!0;case`RecordSet`:return e.sets.every(L)||tr(e)===!0;case`ProductSet`:return e.factors.every(L)||tr(e)===!0;case`Union`:return L(e.base)&&lr(e.base).every(L);case`SetOperation`:return e.operator===`\\cup`?L(e.left)&&L(e.right):e.operator===`\\cap`?L(e.left)||L(e.right):L(e.left);default:return!1}},tr=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=tr(e.domain);return t===void 0?void 0:!t&&tr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=tr(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return L(e)?R(e).elements.length===0:void 0;default:return}},nr=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},rr=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},ir=e=>{if(typeof e!=`object`||e.kind!==`Subset`||jt(e.base))return;let t=R(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:rr(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return zt(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},ar=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(zt(r.map(t=>e[t])));while(rr(r,e.length))}return t},or=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(jt(a))throw new y(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},sr=(e,t=e=>R(e).elements)=>{if(typeof e!=`object`)throw new y(`Expected a set but found ${z(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Tn(e.elements);case`Interval`:{let t=Gn(e);return t!==Vn[t.length]&&Un.set(t,e),t}case`Subset`:{if(gr(e.base)===0)return ar([]);if(!P(e.base))throw new y(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${N(z(e.base))}`);let t=R(e.base).elements;if(t.length>30)throw new y(hr(e));return ar(t)}case`FunctionSet`:{if(!Tt.is174&&pr(e))return[];if(jt(e.domain))throw new y(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${z(e.domain)}\ncannot be enumerated.`);let n=qn(e.domain);if((n.length>0||Tt.is174)&&jt(e.range))throw new y(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${z(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return nr(n.map(()=>r)).map(e=>Bt(n,e))}case`RecordSet`:{if(!Tt.is174&&pr(e))return[];let n=or(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${z(t)}`);return nr(n).map(t=>Xn(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Tt.is174&&pr(e))return[];let n=or(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${z(e)}`);return nr(n).map(Yn)}case`FilteredSet`:if(!P(e.base)||jt(e.base))throw new y(`Attempted to enumerate { x \\in S : p(x) } when S:\n${z(e.base)}\nis not enumerable`);return R(e.base).elements.filter(e.test);case`Union`:{let t=$n(e).flatMap((t,n)=>R(er(t,n,e)).elements);return R(Pn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Zn(e.left)||!Zn(e.right)))throw new y(`Attempted to enumerate S \\cup T when S:\n${z(e.left)}\nand T:\n${z(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Zn(e.left)&&!Zn(e.right))throw new y(`Attempted to enumerate S \\cap T when neither S:\n${z(e.left)}\nnor T:\n${z(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Zn(e.left))throw new y(`Attempted to enumerate S \\ T when S:\n${z(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Rn(R(e.left),R(e.right)).elements;let t=e.operator===`\\`||Zn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return R(n).elements.filter(t=>wr(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to enumerate the non-enumerable set ${z(e)}`);default:throw new y(`Expected a set but found ${z(e)}`)}},cr=/* @__PURE__ */ new WeakMap,R=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return zt(sr(e));let t=typeof e==`object`?cr.get(e):void 0;if(t)return t;let n=Sr.sets;n?.push(e);let r=sr(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?zt(r):Nn(r);return typeof e==`object`&&cr.set(e,i),i},lr=e=>{if(typeof e!=`object`||Kt.has(e))return R(e).elements;let t=Sr.sets;t?.push(e);let n=fr(e);return t?.pop(),n},ur=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,dr=e=>typeof e!=`object`||Kt.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?dr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||dr(e.left)||dr(e.right):ur(e)?.some(dr)??!1,fr=e=>{if(e.kind===`Union`)return $n(e,lr).flatMap((t,n)=>lr(er(t,n,e)));if(e.kind===`FilteredSet`&&!jt(e.base))return lr(e.base).filter(e.test);if(ur(e)?.some(dr))return sr(e,lr);if(e.kind!==`SetOperation`)return R(e).elements;if(e.operator===`\\cup`)return!Zn(e.left)||!Zn(e.right)?R(e).elements:[...lr(e.left),...lr(e.right)];let t=e.operator===`\\`||Zn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Zn(n)?lr(n).filter(t=>wr(t,r)===(e.operator===`\\cap`)):R(e).elements},pr=e=>{if(typeof e!=`object`||!P(e))throw new y(`Shouldn't call isEmpty() on value ${z(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new y(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(pr);case`RecordSet`:return e.sets.some(pr);case`FunctionSet`:return!pr(e.domain)&&pr(e.range);case`Union`:return $n(e).every((t,n)=>pr(er(t,n,e)));default:return R(e).elements.length===0}},mr=(e,t,n)=>e.reduce((e,r)=>{let i=e*gr(r,t);if(i>2147483647)throw new y(n());return i},1),hr=e=>`Overflow when computing the number of elements in:\n${z(e)}`,gr=(e,t)=>{if(typeof e!=`object`)throw new y(`Attempted to compute the number of elements in the ${typeof e==`number`?`integer`:typeof e==`string`?`string`:`boolean`} ${z(e)}.`);switch(e.kind){case`ModelValue`:throw new y(`Attempted to compute the number of elements in the model value ${z(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return gr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new y(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to compute the number of elements in the overridden value ${z(e)}.`);case`Subset`:{let n=gr(e.base,t);if(n>=31)throw new y(hr(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(pr(e.domain))return 1;if(pr(e.range))return 0;if(gr(e.range,t)===1)return 1}let n=gr(e.domain,t),r=gr(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new y(hr(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&pr(e)?0:mr(e.sets,t,()=>hr(e));case`ProductSet`:return t!==`1.7.4`&&pr(e)?0:mr(e.factors,t,()=>`Overflow when computing the number of elements in ${z(e)}`);default:return Yt(e),R(e).elements.length}},_r=e=>`Attempted to check if the set ${z(e)}is finite.`,vr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new y(`Attempted to check if the ${ut(e)} ${z(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new y(`Attempted to check if the function:\n${z(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return vr(e.base)&&pr(e.base);case`Subset`:return vr(e.base);case`FunctionSet`:{let t=vr(e.domain);if(t&&pr(e.domain))return!0;let n=vr(e.range);return n&&pr(e.range)?!0:n&&(t||gr(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!vr(e))n.isAllFinite=!1;else if(pr(e))return!0;return n.isAllFinite}case`Union`:if(!Zn(e.base))throw new y(`Attempted to check if the nonenumerable set:\n${Qn(e)}\nis a finite set.`);return R(e.base).elements.every(vr);case`SetOperation`:if(e.operator===`\\cup`)return vr(e.left)&&vr(e.right);if(e.operator===`\\cap`){if(!vr(e.left)&&!vr(e.right))throw new y(_r(e));return!0}if(vr(e.left))return!0;if(!vr(e.right))throw new y(_r(e));return!1;case`FilteredSet`:if(!vr(e.base))throw new y(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${z(e.base)}\nis finite.`);return!0}},yr=(e,t,n=It)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},br=e=>{if(typeof e!=`object`||!F(e))return;let t=Dr(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},xr=(e,t)=>{let n=`Attempted to check if the value:\n${z(e)}\nis an element of the`;if(!F(t))return`${n} ${ut(t)} ${z(t)}`;let r=Ut(t);return r===`record`?`Attempted to check if element:\n${z(e)}\nis in the record:\n${z(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${z(t)}`},Sr={sets:void 0},Cr=(e,t)=>{let n=Sr.sets,r=Sr.callStack,i=n?.length??0,a=r&&{...r,length:r.expressions.length};try{return e()}catch(e){if(!(e instanceof y))throw e;return n&&(n.length=i),r&&a&&(r.expressions.length=a.length,r.isFrozen=a.isFrozen,r.fingerprint=a.fingerprint),t(e)}},wr=(e,t)=>{let n=Sr.sets;if(n===void 0)return Tr(e,t);n.push(t);let r=Tr(e,t);return n.pop(),r},Tr=(e,t)=>{if(!P(t))throw new y(xr(e,t));switch(t.kind){case`Set`:return Yt(e),Cr(()=>yr(t.elements,e)!==-1,()=>kn.has(t)?Dn(e,t.elements).isFound:On(e,t.elements));case`MixedSet`:return On(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!I(e))throw new y(`Attempted to check if the value:\n${z(e)}\nis in the integer interval ${z(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(I(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new y(`Attempted to check if the value:\n${z(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!P(e)||jt(e))throw new y(`Attempted to check if the non-enumerable value\n${N(z(e))}\nis element of\n${N(z(t))}`);return R(e).elements.every(e=>wr(e,t.base));case`FunctionSet`:{if(!F(e)){if(I(e))return!1;throw new y(`Attempted to check if \n${z(e)}\nwhich is not a TLC function value, is in the set of functions:\n${N(z(t))}`)}let n=Dr(e),r=nn(n.domain);return(r===void 0?jn(t.domain,zt(n.domain)):jn({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>wr(e,t.range))}case`RecordSet`:{let n=F(e)?Dr(e):void 0;if(!n||!_t(n.domain)){if(I(e))return!1;throw new y(`Attempted to check if non-record\n${z(e)}\nis in the set of records:\n${z(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=yr(n.domain,e);return i!==-1&&wr(n.range[i],t.sets[r])})}case`ProductSet`:{let n=F(e)?br(e):void 0;if(n===void 0){if(F(e)&&Dr(e).domain.every(e=>typeof e==`number`)||I(e))return!1;throw new y(`Attempted to check if non-tuple\n${z(e)}\nis in the set of tuples:\n${z(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>wr(e,t.factors[n]))}case`FilteredSet`:return wr(e,t.base)&&t.test(e);case`Union`:if(!Zn(t.base))throw new y(`Attempted to check if:\n ${z(e)}\nis an element of the non-enumerable set:\n ${Qn(t)}`);return R(t.base).elements.some(t=>wr(e,t));case`SetOperation`:return t.operator===`\\cup`?wr(e,t.left)||wr(e,t.right):wr(e,t.left)&&wr(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=br(e);if(n===void 0){if(I(e))return!1;throw new y(`Attempted to check if the value:\n${N(z(e))}\nis an element of ${N(z(t))}.`)}return n.every(e=>wr(e,t.base))}default:throw new y(xr(e,t))}},Er=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?wr(e,n):e.range.every((e,r)=>Er(e,t.range[r],n.range)),Dr=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){L(e.domain)||gr(e.domain);let t=qn(e.domain);return Ht(Bt(t,t.map(t=>e.apply(t))),Ut(e))}throw new y(`Expected a function but found ${z(e)}`)},Or=(e,t,n)=>{let r=N(z(e)),i=N(z(t)),a=n===`1.7.4`;switch(Ut(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},kr=(e,t)=>{if(!Tt.is174)return Or(e,t);let n=N(z(t));return Ut(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Ar=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}if(e.length<=8){for(let n=0;n<e.length;n++)if(e[n]===t)return n}return yr(e,t)},jr=e=>new y(`Attempted to apply function with integer domain to the non-integer argument ${N(z(e))}`),Mr=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Ut(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new y(n(e,t));if(a===void 0&&!Tt.is174&&Kn(r))throw jr(t)}return Cr(()=>Ar(r,t),e=>{throw Tt.is174||r.length<32?r.forEach(e=>wn(e,t)):yr(r,t,yn),e})},Nr=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!wr(t,e.domain))throw new y(Ut(e)===`lambda`?Or(e,t):`Attempted to apply a function to ${z(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new y(`Attempted to apply ${z(e)}, which is not a function`);let r=n??Or,i=Mr(e,t,r);if(i===-1)throw new y(r(e,t));return e.range[i]},Pr=e=>Kn(e)?Un.get(e)??Jn(e.length):void 0,Fr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=Dr(e).domain;return Pr(t)??zt(t)},Ir=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!L(e.domain))){if(!wr(t,e.domain))return e;let r=n(e.apply(t));return Ht({kind:`LazyFunction`,domain:e.domain,apply:n=>jn(t,n)?r:e.apply(n),source:e.source},Ut(e))}if(!F(e))throw new y(`Attempted to apply EXCEPT construct to the value ${N(z(e))}.`);let i=Dr(e),a=Mr(i,t,kr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Ht(Bt(i.domain,o),Ut(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Ur){let e=Jr(c);if(e!==Ur){let t=Jr(i.domain[a]);l.hash=s===c?i.hash:i.hash-Hr(t,Jr(s))+Hr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-$r(e,s)+$r(e,c)|0}return l},Lr=/* @__PURE__ */ new WeakMap,Rr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},zr=(e,t)=>Math.imul(e^t,16777619),Br=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Rr(t)},Vr=e=>Rr(e+2654435769|0),Hr=(e,t)=>Rr(Math.imul(e,668265261)+t|0),Ur=795548749,Wr=e=>{if(e.kind===`ModelValue`)return Rr(zr(Br(e.name),109));if(P(e)){if(!L(e))return Ur;let t=R(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Jr(t[e]);if(r===Ur)return Ur;n=n+Vr(r)|0}return n}if(e.kind===`LazyFunction`&&!L(e.domain))return Ur;let t=Dr(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=Jr(t.domain[e]),i=Jr(t.range[e]);if(r===Ur||i===Ur)return Ur;n=n+Hr(r,i)|0}return n},Gr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new y(`TLC has found a state in which the value of a variable contains ${z(e)}`);if(P(e)){R(e).elements.forEach(Gr);return}let t=Dr(e);t.domain.forEach(Gr),t.range.forEach(Gr)},Kr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Jr(e)===Ur&&Gr(e);return}catch(e){if(!(e instanceof y))throw e;return e}},qr=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Jr=e=>{if(typeof e==`number`)return Rr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Br(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Wr(e)),e.hash;let t=Lr.get(e);if(t!==void 0)return t;let n=Wr(e);return Lr.set(e,n),n},Yr=/* @__PURE__ */ new WeakMap,Xr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Zr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Xr(t)},Qr=e=>Xr(ti(e)+2135587861|0),$r=(e,t)=>Xr(Math.imul(ti(e),374761393)+ti(t)|0),ei=e=>{if(e.kind===`ModelValue`)return Xr(Zr(e.name)^60);if(P(e)){if(!L(e))return Zr(ri(e));let t=R(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Qr(t[e])|0;return n}let t=Dr(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+$r(t.domain[e],t.range[e])|0;return n},ti=e=>{if(typeof e==`number`)return Xr(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return Zr(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=ei(e)),e.fingerprint;let t=Yr.get(e);if(t!==void 0)return t;let n=ei(e);return Yr.set(e,n),n},ni=/* @__PURE__ */ new WeakMap,ri=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=ni.get(e);if(t!==void 0)return t;let n=ii(e);return ni.set(e,n),n},ii=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ri(e.base)}>`;if(e.kind===`FilteredSet`&&!L(e))throw new y(`Attempted to compare the non-enumerable set ${z(e)} with another value`);if(P(e))return L(e)?`{${R(e).elements.map(ri).join(`,`)}}`:`<${e.kind} ${z(e)}>`;let t=Dr(e);return`(${t.domain.map((e,n)=>`${ri(e)}:${ri(t.range[n])}`).join(`,`)})`},ai=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,oi=e=>e.reduce((e,t)=>e===0?0:e*gr(t),1),si=e=>{if(e.kind===`Subset`)return gr(e.base)<=6?R(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return R(e);if(e.kind===`FunctionSet`&&L(e.domain)&&gr(e.domain)===0)return zt([Bt([],[])]);let t=e.kind===`FunctionSet`?gr(e.range)**gr(e.domain):oi(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Fn:t<=1999?R(e):void 0},ci=(e,t)=>{if(t)return si(e);if(L(e))try{return si(e)}catch(e){if(e instanceof y)return;throw e}},li=(e,t)=>{let n=e=>z(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return Qn(e,t)}},ui=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),di=e=>{if(L(e.domain))try{return Dr(e)}catch(e){if(e instanceof y)return;throw e}},z=(e,t=!1,n=!1)=>{let r=e=>z(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return ai(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(R(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=ci(e,t);return n?r(n):li(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?di(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${z(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Tt.is174&&Ut(e)!==`tuple`)return`<< >>`;let a=r=>z(r,t,n&&Ut(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Ut(e)===`record`||i.domain.every(e=>typeof e==`string`&&ui(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):mt(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},fi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${N(z(n))}\n`).join(``)},pi=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},mi=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Jr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||tn(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||tn(i[e],n))return i[e]}return n.kind===`Set`?pi(n.elements,t):(pi(n.domain,t),pi(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},hi=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},B=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,gi=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),_i=(e,t)=>gi.has(e)?new y(t):new C(t),vi=e=>typeof e==`object`&&e.kind===`Operator`,V=(e,t,n)=>{let r=e[t];if(r===void 0||vi(r))throw _i(n,`${n} expects a value as argument ${t+1}`);return r},yi=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`number`)throw _i(n,`${n} expects an integer but received ${z(r)}`);return r},bi=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`boolean`)throw _i(n,`${n} expects a boolean but received ${z(r)}`);return r},xi=(e,t,n)=>{let r=V(e,t,n);if(!P(r))throw _i(n,`${n} expects a set but received ${z(r)}`);return r},Si=(e,t,n)=>{let r=xi(e,t,n);if(!L(r))throw _i(n,`${n} cannot enumerate the non-enumerable set ${z(r)}`);return r},Ci=(e,t,n)=>R(Si(e,t,n)),wi=(e,t,n)=>Ci(e,t,n).elements,Ti=(e,t,n)=>{let r=V(e,t,n),i=br(r);if(!i)throw _i(n,`${n} expects a sequence but received ${z(r)}`);return i},Ei=(e,t,n)=>{let r=V(e,t,n);if(!F(r))throw _i(n,`${n} expects a function but received ${z(r)}`);return Dr(r)},Di=(e,t,n)=>{let r=e[t];if(r===void 0||!vi(r))throw _i(n,`${n} expects an operator as argument ${t+1}`);return r},Oi=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),H=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),ki=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Ai=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ji=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(V(n,0,e),V(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Mi=e=>e>2147483647||e<-2147483648,Ni=e=>new C(`Overflow when computing ${e}`),Pi={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},Fi={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Ii={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},Li={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ri=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Fi[e.operator];if(e.kind!==`Function`)return Pi[e.kind];let t=Ut(e);return t===void 0?`FcnRcdValue`:Li[t]},zi=e=>Ii[Ri(e)],Bi=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Vi=(e,t)=>{let n=n=>(...r)=>{let i=Sr.sets?.length??0;try{return n(...r)}catch(n){throw n instanceof y&&(e.isLazy===!0||!(n instanceof C))?(Sr.sets&&(Sr.sets.length=i),Bi(t,n.message)):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Hi=(e,t)=>{if(typeof e!=`number`)throw Bi(t,`Cannot cast tlc2.value.impl.${Ri(e)} to tlc2.value.impl.IntValue`);return e},Ui=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Wi=(e,t,n,r)=>{let i=Ui(e,n,`IntValue`,2);return ji(t,(e,n)=>{let a=Hi(e,i),o=Hi(n,i),s=r(a,o);if(Mi(s))throw Ni(`${a}${t}${o}`);return s})},Gi=(e,t,n)=>{if(typeof e!=`number`)throw new C(`The ${t} argument of ${n} should be an integer, but instead it is:\n${z(e)}`);return e},Ki=(e,t,n=e)=>ji(e,(e,r)=>t(Gi(e,`first`,n),Gi(r,`second`,n))),qi=(e,t,n)=>({...Ai(e,t,n),isLazy:!0}),Ji=(e,t,n)=>{let r=Di(e,t,n);return()=>r.call([])},Yi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Xi=()=>({bool:ul,condition:(e,t)=>{if(typeof e!=`boolean`)throw Xc(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Zc(t,n,e);return e},apply:Nr,expectFunction:sl,tuple:Yn,set:Pn,record:Zt,writtenRecord:ht,equal:Qt,enumerate:xl,unassigned:(e,t)=>{throw dd(e,t)},primeOutsideAction:e=>{throw pd(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:cl,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>al(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Zi={value:void 0},Qi=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),$i=e=>`local${e.counter++}`,ea=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),hi(e).forEach(e=>ea(e,t)),t),ta=(e,t,n)=>{let r=Qi(e,Ru(t,e.environment)),i=ea(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Qi(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},na=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>$i(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${aa(e,t.set,s)}, ${Qi(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=$i(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${aa(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=$i(e),a=$i(e),o=$i(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},ra=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${aa(e,r[0],n)}, "the left side of =>") ? bool(${aa(e,r[1],n)}, "the right side of =>") : true)`;if(B(t))return ta(e,t,n);let i=ql(t.operator,e.environment);if(i?.kind!==`Builtin`)return ta(e,t,n);if(i.name===`DOMAIN`)return`${Qi(e,el(t))}(${aa(e,r[0],n)})`;if(i.name===`TLCEval`)return ta(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Qi(e,tl(t,i))}(${aa(e,r[0],n)}, ${aa(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Gu(r[0],a))return`${Qi(e,i.evaluateUnary)}(${aa(e,r[0],n)})`;let o=r.length===2&&Gu(r[0],a)&&Gu(r[1],a);return i.evaluateBinary&&o?`${Qi(e,i.evaluateBinary)}(${aa(e,r[0],n)}, ${aa(e,r[1],n)})`:ta(e,t,n)},ia=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(B(e))return!1;let r=ru(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ia(e.expression,t,n);case`FieldAccess`:return ia(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ia(e,t,n));default:return!1}},aa=(e,t,n)=>{let r=(t,r=n)=>aa(e,t,r);if(ku(t)&&wu(t,e.environment))return ta(e,t,n);switch(t.kind){case`Number`:return du(t.value)?String(t.value):ta(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(B(t))return ta(e,t,n);let i=ru(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Qi(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Qi(e,i.value):ta(e,t,n)}case`Apply`:return ra(e,t,n);case`And`:case`Or`:{let n=Qi(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Qi(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{ad(t.function);let i=`expectFunction(${ia(t.function,n,e.environment)?r(t.function):ta(e,t.function,{...n,context:`keepLazyContext(${n.context})`})}, ${Qi(e,t)})`,a=$c(e.environment.runtime.version),o=a?`, ${Qi(e,a)}`:``;return t.args.length===1?`apply(${i}, ${r(t.args[0])}${o})`:`apply(${i}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${o})`}case`FieldAccess`:return`${Qi(e,Qc(t))}(${r(t.record)})`;case`Record`:{let i=ld(t.fields);if(ud(i))return ta(e,t,n);let a=Qi(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Qi(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=Qi(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?na(e,t,n):ta(e,t,n);default:return ta(e,t,n)}},oa=(e,t)=>{if(!Yi.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=aa(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
29
|
+
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;Zi.value??=Xi();let o=Zi.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},sa={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},ca={none:0,error:1,warning:3,state:4},la={0:``,1:`Error: `,3:`Warning: `,4:`State `},ua=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===ca.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
|
|
30
|
+
(Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${la[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},da=`The configuration file did not specify the initial state predicate.
|
|
31
|
+
Can also be caused by trying to run TLC on a specification from
|
|
32
|
+
a module imported with a parameterized INSTANCE statement.`,fa=[[1005,b,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
|
|
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,da,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
|
|
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]],pa={value:void 0},ma=()=>pa.value??=fa.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),ha=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,ga=e=>ha.test(e)?void 0:ma().find(t=>t.pattern.test(e))?.message,_a=e=>e instanceof C||ga(e.message)?.isEvalException===!0,va=/* @__PURE__ */ new Map([[1e3,`
|
|
74
|
+
: `],[2105,`failed.
|
|
75
|
+
`],[2154,`but it produced the following error:
|
|
76
|
+
`],[2213,`:
|
|
77
|
+
`],[2281,` - specifically: `]]),ya=(e,t,n)=>{let r=n?va.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${ba(t.slice(a),n)}`},ba=(e,t)=>{let n=t?ga(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${ca.none} @!@!@\n${ya(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},xa=e=>String(e).padStart(2,`0`),Sa=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${xa(r%24)}h`:e>36e5?`${xa(r%24)}h ${xa(n)}min`:e>6e4?`${xa(n)}min ${xa(t)}s`:`${xa(t)}s`},Ca=e=>`${e.getFullYear()}-${xa(e.getMonth()+1)}-${xa(e.getDate())} ${xa(e.getHours())}:${xa(e.getMinutes())}:${xa(e.getSeconds())}`,wa={kind:`Local`},Ta=/* @__PURE__ */ new WeakSet,Ea=/* @__PURE__ */ new WeakMap,Da=/* @__PURE__ */ new WeakMap,Oa=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ka=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),Aa=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,ja=e=>e.kind===`Operator`?e.params.length:0,Ma=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Na=e=>e.name.includes(`!`),Pa=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Fa=(e,t,n)=>{let r=t.bindings.get(e);return r&&Aa(r.position,t.location)&&(!n||Aa(r.position,n.start))?r:void 0},Ia=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),La=(e,t,n,r)=>{if(t===void 0)return!0;if(Ia(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=g(i),o=t.range&&g(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},Ra=(e,t,n,r)=>La(t,Pa(e,t)??Fa(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,za=(e,t,n)=>{La(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ba=(e,t,n,r)=>t.reduce((e,t,i)=>Ra(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Va=(e,t,n)=>t.reduce((e,t)=>Ra(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ha=e=>e.kind===`Name`?[e.name]:e.names,Ua=e=>e.flatMap(e=>Ha(e.pattern)),Wa=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Aa(n.location,t.location))?n:void 0},Ga=(e,t)=>{let n=Wa(e,t);return n?{key:t.getKey(n),arity:ja(n),params:Ma(n),kind:`Definition`}:t.imported.get(e)},Ka=(e,t,n)=>Pa(t,e)??Ga(e,n),qa=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Ja=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return Aa(e.location,e.args[0].location)?`prefix`:`postfix`}},Ya=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),Xa=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Za=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Qa=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},$a=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Qa(e.name,[],void 0):Qa(e.operator,e.args,e.argumentCounts),eo=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),to=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Ua(e.bounds),body:e.body,sets:eo(e.bounds)};case`SetMap`:return{names:Ua(e.bounds),body:e.expression,sets:eo(e.bounds)};case`SetFilter`:return{names:Ha(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ha(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},no=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},ro=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,io=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),ao=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?ao(e.body,t):hi(e).reduce((e,n)=>e??ao(n,t),void 0)},oo=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??oo(i,t,n||io(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&ao(e.set,t):ao(e,t)},so=e=>e.kind===`Label`?so(e.body):e,co=e=>typeof e==`number`?`argument selector ${e}`:e,lo=`within the scope of a declaration
|
|
78
|
+
from outside that declaration's scope.`,uo=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:g(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&so(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:oo(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?ao(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&io(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${lo}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=co(n.operand);if(l.isSufficesOpen){if(Za(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=so(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Ka(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=to(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:no(e);if(!c)return;let f=Za(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=Za(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(io(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${lo}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},fo=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:g(e.location.range),message:n}),!0)},po=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=g(r),a=e.params.filter((r,i)=>{let a=Pa(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:g(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},mo=(e,t,n,r)=>{if(!ro(e))return!1;let i=$a(e),a=i[0],o=i.length>1&&a.kind===`Name`?Pa(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&uo(e,i,o,t,n,r),o!==void 0},ho=(e,t,n,r)=>{let i=e.location;if(Co(e,n,r))return;let a=Da.get(e);if(a!==void 0)return a;if(Oa(t)||mo(e,n,r,!1)||Xa(t))return e.kind===`Apply`?e.args.length:0;let o=Pa(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=wa),o)return o.arity;let s=Ga(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Da.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(Pa(n,c)!==void 0||Ga(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=g(qa(i,l===`-.`?`-`:l));if(!Ya(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=Ja(e);d&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},go=(e,t,n)=>(e.forEach(e=>U(e.set,t,n)),e.reduce((e,t)=>Ba(e,Ha(t.pattern),t.pattern.ranges,n),t)),_o=(e,t)=>e.kind===`Identifier`&&e.name===t&&B(e)||hi(e).some(e=>_o(e,t)),vo=(e,t)=>{e.kind===`FunctionConstruction`&&_o(e.body,t)&&(e.isRecursive=!0),hi(e).forEach(e=>vo(e,t))},yo=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Ua(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:g(o),message:e})},c=e.kind===`Function`?go(e.bounds,t,i):Va(t,e.params,i),l=Pa(c,a)??Fa(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(U(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),vo(e.body,a),e.isSelfReferential=_o(e.body,a)):U(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:La(a,Pa(t,a)??Fa(a,i,o),{kind:`Definition`,arity:ja(e),range:o},i)},bo=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Pa(e,t.name)?.isPending)return e;let n={name:t.name,arity:ja(t),params:Ma(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>Io(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Oa(t.name)?e:s(e,e=>!Aa(t.location,e.location)),o={name:t.name,arity:ja(t),kind:`Definition`,range:t.location.range,parent:a};if(Na(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Oa(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return yo(t,a,u,i)?{...o,params:Ma(t)}:a},a),()=>!0)},xo=(e,t,n)=>{let r=e.operator,i=Ka(r,t,n),a=ho(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:g(e.argumentsRange??qa(e.location,r)),message:`The operator ${r} requires ${a} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>So(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:g(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=ho(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else U(i,t,n);return!0}if(i.kind===`Lambda`){U(i,t,n);let o=i.params.length===c;return!o&&Ta.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&s(e.selectorRanges?.at(-1)??qa(e.location,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return U(i,t,n),!0;if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=Ka(u,t,n)?.params??[],f=ho(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(qa(i.location,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},So=(e,t,n)=>{e.kind===`Identifier`?ho(e,e.name,t,n):U(e,t,n)},Co=(e,t,n)=>{let r=Ea.get(e);return r?(r.args.forEach(e=>So(e,t,n)),n.errors.push(r.error),!0):!1},U=(e,t,n)=>{if(Ta.has(e)&&!n.isGenerated){U(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>U(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=e.name,i=ho(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:g(qa(e.location,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:ho(e,e.operator,t,n);return;case`Apply`:xo(e,t,n);return;case`Lambda`:U(e.body,Ba(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:U(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&U(e.other,t,n);return;case`Let`:U(e.body,bo(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:U(e.body,go(e.bounds,t,n),i(Ua(e.bounds)));return;case`UnboundedQuantifier`:U(e.body,Ba(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&U(e.set,t,n),U(e.body,Ba(t,Ha(e.pattern),e.pattern.ranges,n),i(Ha(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:U(e.predicate,go([e.bound],t,n),i(Ha(e.bound.pattern)));return;case`SetMap`:U(e.expression,go(e.bounds,t,n),i(Ua(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:g(r.location.range??qa(r.location,r.name)),message:`Non-unique fields in constructor.`}),U(r.value,t,n)});return;case`Except`:U(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),U(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:U(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(fo(e,n))return;U(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),po(e,t,n);return;case`Subexpression`:if(Co(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>So(e,t,n)),mo(e,t,n,!1)}},wo=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||mo(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;n.facts.has(r)||U(e,t,n)}),To=(e,t,n)=>(e.set&&U(e.set,t,n),Ra(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Eo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:To(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Eo(t,e.scope,e.unit,!0):U(t,e.scope,e.unit),e),{scope:t,unit:n});return U(e.conclusion,i.scope,i.unit),i.scope},Do=(e,t,n)=>e.kind===`AssumeProve`?Eo(e,t,n):(U(e,t,n),t),Oo=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&wo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Ao(t,e,r),t)},ko=(e,t,n)=>{let r=Io(e,t,n);return e.name===void 0?r:Ra(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Ao=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set};switch(r.kind){case`Assert`:{let a=Do(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Oo(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Oo(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return wo(r.facts,t,n),t;case`Instance`:return ko(r,t,i);case`Define`:return r.definitions.reduce((e,t)=>t.kind===`Instance`?ko(t,e,i):bo([t],e,n),t);case`Have`:case`Case`:return U(r.expression,t,i),Oo(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>U(e,t,i)),t;case`Take`:return Ba(go(r.bounds,t,i),r.names,r.nameRanges,i);case`Pick`:{let a=Ba(go(r.bounds,t,i),r.names,r.nameRanges,i);return U(r.body,a,{...i,labelParams:[...i.labelParams,...Ua(r.bounds),...r.names]}),Oo(e.proof,t,n),a}default:return Oo(e.proof,t,n),t}},jo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Do(e.statement,void 0,t);e.name!==void 0&&za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Oo(e.proof,n,t),r&&(r.isInProof=!1)},Mo={line:0,column:0},No=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Po=(e,t)=>{let n=new Map([...ka,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},Fo=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){U(n,a,i);return}let r=ho(n,n.name,a,i);if(r!==void 0&&r!==t.arity)throw new u(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},s=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:g(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;o(r,a);let c=a.location.range;s.has(n)?c&&i.errors.push({location:g(c),message:`Multiple substitutions for symbol '${n}' in substitution.`}):s.set(n,a)});let c=t.filter(e=>!s.has(e.name)),l=e=>!Pa(a,e.name)&&!Ga(e.name,i);return c.filter(e=>!l(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};o(t,n),s.set(t.name,n)}),c.filter(l).forEach(t=>{let r=e.location.range,a=t.location.range;r&&a&&i.errors.push({location:g(r),message:`Substitution missing for symbol ${t.name} declared at ${g(a)} \nand instantiated in module ${n}.`})}),s},Io=(e,t,n)=>{let r=n.getInstance(e);return Fo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ra(e,t,r,n),t)},Lo=(e,t,n,r)=>{let i=Po(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Fo(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:Mo}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Ro=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>Aa(e.location,t.location)?-1:+!!Aa(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof u)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},zo=(e,t)=>{let n=Po(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...ka,...t.bound].map(([e,t])=>[e,{...t,position:Mo}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>za(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return Ro([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=La(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);No(e,t)?U(t.body,void 0,i):yo(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:ja(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);Va(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>za(t,e,i)),e.name!==void 0&&za(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);U(e.expression,void 0,r),e.name!==void 0&&za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>jo(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>wo(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:g(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Bo=/* @__PURE__ */ new WeakSet,Vo=/* @__PURE__ */ new WeakSet,Ho=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Jo(e,(e,r)=>Ho(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&B(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&B(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Uo=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Wo=/* @__PURE__ */ new WeakMap,Go=e=>Wo.get(e)??e.name,Ko=(e,t)=>(Go(t)!==e.name&&Wo.set(e,Go(t)),e),qo=(e,t)=>Ko(e.kind===`Function`?{...e,bounds:Uo(e.bounds,e=>t(e,[])),body:t(e.body,Ua(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Jo=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>qo(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Uo(e.bounds,n),body:t(e.body,Ua(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,Ha(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,Ha(e.bound.pattern))};case`SetMap`:return{...e,bounds:Uo(e.bounds,n),expression:t(e.expression,Ua(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Yo=`LAMBDA`,Xo=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return Jo(e,(e,n)=>(r.push(...Xo(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Zo=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Qo=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),$o=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},es=(e,t)=>e.map(e=>({pattern:$o(e.pattern,t),set:e.set})),ts=(e,t)=>e.kind===`Function`?{...e,bounds:es(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},ns=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>Ko({...ts(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:es(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:$o(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:$o(e.bound.pattern,n),set:e.bound.set}};default:return e}},rs=e=>`${e}@ENABLED`,is=(e,t)=>e.modes.get(t)??e,as=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!B(e)&&t.instantiation.variables.has(e.name),os=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>os(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(as(e,t,n))return[e.name];let r=B(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?os(r.body,t,/* @__PURE__ */ new Map):void 0},ss=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return as(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:rs(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:fs(e.expression,is(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[fs(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:fs(e.subscript,is(t,`Primed`),n),location:r},fs(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=os(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:rs(r),location:e.location},location:e.location},fs({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},cs=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),ls=(e,t)=>e.map(e=>cs(e.name,t)),us=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...ls(t,r),...i.map(e=>cs(e,r))],location:r},location:r}},ds=(e,t)=>e.instantiation.isParameterized(t)?ms(e,t):void 0,fs=(e,t,n)=>{let r=e=>fs(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!B(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:fs(e.expression,is(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:fs(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},is(t,`Enabled`),n)};let s=ss(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Bo.add(n),n;let r=ds(t,e.name);if(r===void 0)return e;if(a.length===0)return{...e,name:r};let o=i.getDefinition(e.name);return o&&ja(o)>0?us(r,a,ja(o),e.location):{kind:`Apply`,operator:r,args:ls(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),s=i.substitutions.size>0||a.length>0||Vo.has(e),c=e=>(s&&Vo.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return c({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return c({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Yo,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:Yo,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new u(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=ds(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...ls(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=ds(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?us(n,a,ja(r),e.location):{...e,operator:n}}let c=Zo(t),l=Jo(e,(e,i)=>i.length===0?r(e):fs(e,t,Qo(n,i,c)));return ns(l,n,c)},ps=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:cs(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ms=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Zo(e),o=ts(qo(i,(t,n)=>fs(t,e,Qo(/* @__PURE__ */ new Map,n,a))),a);return ps(o,r.params,i.location)}):t},hs=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Xo(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>ds(i,e)??e,getQualifiedKey:t=>{let n=ds(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>ps(r,e.params,r.location)):t}}},gs=e=>e.kind===`Let`&&e.instances!==void 0||hi(e).some(gs),_s=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Jo(e,e=>_s(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Aa(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},vs=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ys=(e,t)=>e.definitions.some(e=>gs(e.body))||e.assumptions.some(e=>gs(e.expression))||e.theorems.some(e=>{let t=vs(e);return t!==void 0&&gs(t)})?{...e,definitions:e.definitions.map(e=>qo(e,e=>_s(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:_s(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=vs(e);return n===void 0?e:{...e,statement:_s(n,t,[])}})}:e,bs=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=Sr.sets,a=i??[],o=a.length;Sr.sets=a;try{return n()}catch(e){throw Fu(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,Sr.sets=i}},xs=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Ss=e=>!e.includes(void 0),Cs=e=>e.variables.map(()=>void 0),ws=(e,t,n)=>{let r=[...e];return r[t]=n,r},Ts=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Es=e=>e.kind===`Identifier`?e.name:void 0,Ds=(e,t,n)=>{if(t.kind===`Label`)return Ds(e,t.body,n);let r=Es(t);if(r===void 0)return;let i=il(n,r);if(i?.kind===`Thunk`)return Ds(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=ql(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Ds(e,o.body,o.scope):void 0},Os=(e,t,n)=>{if(t.kind===`Prime`)return Ds(e,t.expression,n);if(t.kind===`Label`)return Os(e,t.body,n);let r=Es(t);if(r===void 0)return;let i=il(n,r);if(i?.kind===`Thunk`)return Os(e,i.expression,i.scope);if(i)return;let a=ql(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Os(e,a.body,a.scope):void 0},ks=e=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean expression.`);return e},As=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),js=(e,t,n)=>{t===void 0?Ss(n)&&e.onState(n):Ss(n)&&As(e)?Ns(e,t,n):t.kind===`Predicate`?Ps(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?Us(e,t.expression,t.rest,t.scope,n):Ms(e,t,n)&&js(e,t.rest,n)},Ms=(e,t,n)=>{let r=e.environment,i=W(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return W(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?fd(t,r.runtime.version):t}})();return!Qt(i,a)},Ns=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){Us(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Ms(e,r,n):!ks(W(r.expression,xs(e,r.scope,n))))return}e.onState(n)},Ps=(e,t,n,r,i)=>bs(e,t,()=>{switch(t.kind){case`Let`:Ps(e,t.body,n,lu(t.definitions,xs(e,r,i)),i);return;case`Label`:Ps(e,t.body,n,r,i);return;default:if(Vs.has(t.kind))throw new y(`The state relation is not a boolean expression.`);bs(e,t,()=>Hs(e,t,n,r,i))}}),Fs=(e,t,n,r)=>{ks(t)&&js(e,n,r)},Is=(e,t,n,r,i)=>{let a=xs(e,r,i);if(t.kind===`Identifier`){let o=il(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Ps(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Ps(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:ql(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&hl(s,e.environment))){Ps(e,c.body,n,c.scope,i);return}Fs(e,W(t,a),n,i);return}let o=Yl(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Ps(e,o.body,n,su(o,t.args,a),i):Fs(e,W(t,a),n,i)},Ls=(e,t,n,r,i)=>{let a=n[r];a===void 0?js(e,t,ws(n,r,i)):Qt(a,i)&&js(e,t,n)},Rs=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),zs=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?Ds(e,a,r):Os(e,a,r),c=xs(e,r,i);if(s===void 0){W(t,c)===!0&&js(e,n,i);return}let l=W(o,c),u=i[s];if(t.operator===`=`){Ls(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)W(t,c)===!0&&js(e,n,i);else{if(!Zn(d))throw new y(`The right side of \\IN is not enumerable.`);for(let t of lr(d))js(e,n,ws(i,s,t))}},Bs=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Vs=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Hs=(e,t,n,r,i)=>{let a=xs(e,r,i);switch(t.kind){case`Identifier`:Is(e,t,n,r,i);return;case`Apply`:if(Bs.has(t.operator)&&t.args.length===2){zs(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(ks(W(t.args[0],a))){Ps(e,t.args[1],n,r,i);return}js(e,n,i);return}Is(e,t,n,r,i);return;case`And`:{let a=t.operands;if(t.isBulleted||a.length===2){let t=a.slice(1).reduceRight((e,t)=>Rs(`Predicate`,t,r,e),n);Ps(e,a[0],t,r,i);return}let o=a[a.length-1];Ps(e,Ts(t,a.length-1),Rs(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>Ps(e,t,n,r,i));return}Ps(e,Ts(t,a.length-1),n,r,i),Ps(e,a[a.length-1],n,r,i);return}case`Exists`:El(t.bounds,a,r=>(Ps(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(El(t.bounds,a,e=>(r.push(e),!1)),r.length===0){js(e,n,i);return}let o=r.slice(1).reduce((e,n)=>Rs(`Predicate`,t.body,n,e),n);Ps(e,t.body,o,r[0],i);return}case`If`:Ps(e,ks(W(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>ks(W(e.condition,a)))?.body??t.other;if(o===void 0)throw new y(`TLC encountered a CASE with no conditions true.`);Ps(e,o,n,r,i);return}case`FunctionApplication`:{let r=jl(W(t.function,e.isInit?a:cl(a)));if(r){Ps(e,r.body,n,Ml(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){Us(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){Ps(e,t.action,n,r,i),Us(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){Ps(e,t.action,Rs(`Changed`,t.subscript,r,n),r,i);return}}Fs(e,W(t,a),n,i)},Us=(e,t,n,r,i)=>bs(e,t,()=>{let a=Ds(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Ls(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){js(e,n,i);return}let s=o.reduceRight((e,t)=>Rs(`Unchanged`,t,r,e),n);Us(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=il(r,t.name);if(a?.kind===`Thunk`){Us(e,a.expression,n,a.scope,i);return}let o=a?void 0:ql(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){Us(e,o.body,n,o.scope,i);return}}let o=e.environment,s=W(t,{environment:o,scope:r,state:e.current,next:void 0}),c=W(t,{environment:o,scope:r,state:i,next:void 0});Qt(s,c)&&js(e,n,i)}),Ws=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},Gs=/* @__PURE__ */ Error(`The replay found a successor`),Ks=(e,t,n,r)=>{let i=Ws(r,!1,n,()=>{throw Gs},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Rs(`Changed`,e.subscript,t,void 0);Ps(i,e.action,n,t,Cs(r))}else Ps(i,e,void 0,t,Cs(r));return!1}catch(e){if(e!==Gs)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},qs=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Ws(t,!0,void 0,n),o=i.reduceRight((e,t)=>Rs(`Predicate`,t.expression,t.scope,e),void 0);Ps(a,r.expression,o,r.scope,Cs(t))},Js=(e,t,n,r)=>{e.some(e=>Vs.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Ws(n,!1,t,e=>i.push(e));Ps(a,e.expression,void 0,e.scope,Cs(n)),i.forEach(t=>r(t,e))})},Ys=/* @__PURE__ */ new WeakMap,Xs=/* @__PURE__ */ new WeakMap,Zs=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Qs=(e,t,n)=>{let r=e.slice();return r[t]=n,r},$s=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,ec=(t,r)=>{let i=new y(r);return t.isInit?i:n(i,e.error)},tc=(e,t,n,r)=>{let i=Yc(n);return r&&Vs.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${$s(e)}, TLC expected a boolean expression,\nbut instead found ${z(t)}.\n${i}`},nc=(e,t,n)=>{let r=zi(t),i=Jc(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${$s(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
79
|
+
`:``}${i}`},rc=(e,t,n,r=!0)=>{let i=W(t,n);if(typeof i==`boolean`)return i;throw ec(e,tc(e,i,t,r))},ic=e=>e===`=`||e===`\\in`||e===`\\subseteq`,ac=(e,t,n)=>{let r=n?Ys:Xs,i=r.get(e);if(i)return i;let a=Mc(e,t,n);return r.set(e,a),a},oc=(e,t)=>{if(t.constants.has(e))return;let n=dl(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},sc=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return sc(e.expression,t,!1,r);if(e.kind!==`Identifier`||B(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=oc(e.name,t);if(a&&!r.has(a))return r.add(a),sc(a.body,t,n,r)},cc=(e,t,n)=>sc(e,t,!n),lc=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return lc(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=lu(e.definitions,Zs(r,t,n));return lc(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=il(t,e.name);if(a?.kind===`Thunk`)return lc(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=oc(e.name,r.environment);if(s)return lc(s.body,void 0,n,r,i)},uc=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||B(e))||!t&&e.kind===`Prime`,dc=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>dc(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=oc(e.name,t);if(i)return n.add(e.name),dc(i.body,t,n)},fc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),pc=(e,t,n)=>fc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||ic(e.operator)&&(uc(e.args[0],n)||cc(e.args[0],t,n)!==void 0)||B(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,mc=/* @__PURE__ */ new Set,hc=(e,t)=>{if(B(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Jo(e,(e,i)=>{let a=r.isReadOnly?hc(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},gc=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||B(e)?void 0:dl(r,t);return i&&!n.has(i)&&(n.add(i),gc(i.body,t,n))?!0:hi(e).some(e=>gc(e,t,n))},_c=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=cc(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=dc(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return pc(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:ac(e,t,n)}},vc=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(vd(e,t)===void 0||gc(e,t,/* @__PURE__ */ new Set))return!0;let n=hc(e,mc);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},yc=(e,t,n)=>{let r=e.map(e=>_c(e,t,n)),i=(e,t,n,a,o,s)=>{let c=a,l,u=As(t);for(let a=e;a<r.length;a++){if(a>0&&u&&Ic(c)){l??=Zs(t,n,c);for(let e=a;e<r.length;e++)if(!rc(t,r[e].expression,l,!1))return;s(c,o);return}let e=r[a];if(e.kind===`Guard`){if(l??=Zs(t,n,c),!rc(t,e.expression,l))return;continue}if(e.kind===`Assign`){l??=Zs(t,n,c);let r=W(e.value,l),i=c[e.index];if(i===void 0)c=Qs(c,e.index,r),l=void 0;else if(!Qt(i,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=c[t];if(e===void 0)c=Qs(c,t,n[t]),l=void 0;else if(!Qt(e,n[t]))return}continue}let d=a+1;e.runner(t,n,c,o,!0,(e,r)=>i(d,t,n,e,r,s));return}s(c,o)};return(e,t,n,r,a,o)=>i(0,e,t,n,r,o)},bc=e=>(t,n,r,i,a,o)=>{rc(t,e,Zs(t,n,r))&&o(r,i)},xc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Zs(r,i,a);if(a[l]!==void 0){rc(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Zn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${$s(r)}, the right side of \\IN is not enumerable.`;throw ec(r,`${t}\n${Jc(e)}`)}let p=lr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Qs(a,l,p[e]),o)}},Sc=/* @__PURE__ */ new WeakMap,Cc=e=>{let t=Sc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Cc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Sc.set(e,n),n},wc=(e,t)=>{let n=e.args[0],r=bc(e),i=(e,r,i)=>lc(n,r,i,e,!t)??-1,a=xc(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],Zs(t,n,o));l(Qs(o,u,d),s)}},Tc=(e,t,n)=>{let r=Jc(e);return(i,a,o,s,c,l)=>{let u=Zs(i,a,o),d=W(e.function,n?u:cl(u)),f=jl(d);if(f!==void 0){ac(f.body,t,n)(i,Ml(f,e,u),o,s,c,l);return}if(!F(d))throw ec(i,`In computing ${$s(i)}, a non-function (${zi(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw ec(i,`In computing ${$s(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Ec=(e,t)=>{if(dc(e,t))return yc([Cc(e)],t,!1);if(e.kind===`Tuple`)return ac(Cc(e),t,!1);let n=Cc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?il(i,e.name):void 0;l?.kind===`Thunk`?ac(Cc(l.expression),t,!1)(r,l.scope,a,o,s,c):rc(r,n,Zs(r,i,a))&&c(a,o)}},Dc=(e,t,n)=>{let r=e.operator,i=bc(e),a=B(e)?void 0:ql(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Ju(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=ac(a.body,t,n),o.body(e,i(Zs(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Zs(a,o,s),f=Yl(e,d);f?.kind===`Closure`?ac(f.body,t,n)(a,su(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Oc=(e,t,n)=>{let r=bc(e),i=B(e)?void 0:oc(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=il(s,e.name);f?.kind===`Thunk`?ac(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=ac(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},kc=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||B(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!B(a))return;let o=sc(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>kc(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||B(e))return;let r=ql(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=kc(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(i&&o?.kind===`Identifier`&&B(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Ac=(e,t,n)=>{let r=il(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},jc=(e,t,n)=>{let r=e.map(e=>ac(e,t,n)),i=n?[]:e.map(e=>kc(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&Ac(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},Mc=(e,t,n)=>{let r=e=>ac(e,t,n);switch(e.kind){case`And`:return yc(e.operands,t,n);case`Or`:return jc(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=yl(W(a.set,Zs(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,al(r,e,u[t]),o,s,c,l)}}let o=n?void 0:vc(e,t);if(o){let r=yc(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=Zs(n,i,a),d=e.bounds.map(e=>yl(W(e.set,u),e.set,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=al(t,o.names[e],r);if(e===d.length-1){let e=Zs(n,i,a);if(!o.guards.every(t=>rc(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{El(e.bounds,Zs(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&vd(e,t)!==void 0&&!gc(e.body,t,/* @__PURE__ */ new Set)?hc(e,mc):void 0;return(t,n,r,o,s,c)=>{let l=[];El(e.bounds,Zs(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>il(n,e)?.kind===`Value`)){u.every(n=>rc(t,e.body,Zs(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Ic(r)?u.slice(n).every(n=>rc(t,e.body,Zs(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=W(e.condition,Zs(r,i,a));if(typeof l!=`boolean`)throw ec(r,nc(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=Zs(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw ec(r,`In computing ${$s(r)}, a non-boolean expression${r.isEnabled?``:` `}(${zi(t)}) was used as a guard condition of a CASE.\n${Yc(e.source)}`)})?.body??n;if(!u)throw ec(r,`In computing ${$s(r)}, TLC encountered a CASE with no conditions true.\n${Jc(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=bu(e.definitions,t);return(t,r,a,o,s,c)=>n(t,lu(e.definitions,Zs(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new y(`UNCHANGED appears in an initial predicate at ${Kc(e)}`)}:Ec(e.expression,t);case`AngleAction`:{let n=r(e.action),i=Cc(e.subscript),a=(e,n,r)=>{try{return rc(e,i,Zs(e,n,r))}catch(n){throw e.isEnabled?fd(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,Cc(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Oc(e,t,n);case`FunctionApplication`:return Tc(e,t,n);case`Apply`:{let i=e.args;if(ic(e.operator)){let r=cc(i[0],t,n);if(r!==void 0)return e.operator===`=`?yc([e],t,n):xc(e,()=>r);if(uc(i[0],n))return wc(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=W(i[0],Zs(t,n,r));(typeof c==`boolean`?c:ul(c,`the left side of => at ${Kc(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Dc(e,t,n)}default:return bc(e)}},Nc=/* @__PURE__ */ new WeakMap,Pc=e=>{let t=Nc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Nc.set(e,n),n},Fc=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Ic=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Lc=(e,t)=>{let n=t.state;if(!n||!Ic(n))throw new y(`ENABLED needs a complete state at ${Kc(e)}`);let r=t.environment;if(r.callStack)return Ks(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return ac(e,r,!1)(i,t.scope,Pc(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Rc=(t,r,i,a)=>{let o={environment:r,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};ac(t,r,!0)(o,a,Pc(r),void 0,!1,t=>{if(!o.isStopped){if(!Ic(t))throw n(new te([...t]),e.error);o.isStopped=i(t)}})},zc=(e,t,n)=>{let r=[];return Rc(e,t,e=>(r.push(e),!1),n),r},Bc=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return ac(e,n,!1)(a,i,Pc(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Ic(e)){let r=Fc(e,n);throw new x(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Vc=(e,t,n,r)=>{let i=[];return Bc(e,t,n,e=>(i.push(e),!1),r),i},Hc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Uc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Wc=e=>Uc.has(e.kind)||e.kind===`Apply`&&Hc.has(e.operator),Gc=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&<(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Kc=e=>`line ${e.location.line}, column ${e.location.column}`,qc=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,Jc=e=>{let t=e.location.range;return t?qc(t):Kc(e)},Yc=e=>e.kind===`Number`?e.text??String(e.value):Jc(e),Xc=(e,t)=>new y(`A non-boolean expression (${zi(t)}) was used as the condition of an IF.\n${Jc(e)}`),Zc=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new y(`A non-boolean expression (${zi(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Yc(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new y(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${zi(n)}.\n${Jc({...e,location:{...e.location,range:{...r,end:i}}})}`)},Qc=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${z(n)}\n${Jc(e)}`,r=e=>`Attempted to apply function:\n${N(z(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!F(i))throw new y(`Attempted to select field "${t}" from a non-record value ${N(z(i))}\n${Jc(e)}`);let a=Ut(i);if(a===`tuple`)throw jr(t);return Nr(i,t,a===`record`?n:r)}},$c=e=>e===`1.7.4`?(t,n)=>Or(t,n,e):void 0,el=e=>t=>{if(!F(t))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${zi(t)})\n${Jc(e)}`);return Fr(t)},tl=(e,t)=>(n,r)=>{if(!P(n)||jt(n))throw new y(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Jc(e)}`);return t.evaluate([n,r])},nl=t=>n(new y(`TLC can't handle real numbers: ${t.text} at ${Kc(t)}`),e.configParseError),rl=t=>n(new y(`TLC can't handle a number this big: ${t.text??t.value} at ${Kc(t)}`),e.error),il=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},al=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),ol=(e,t,n)=>{if(t.kind===`Name`)return al(e,t.name,n);let r=br(n);if(!r||r.length!==t.names.length)throw new y(`Cannot bind <<${t.names.join(`, `)}>> to ${z(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>al(e,t,r[n]),e)},sl=(e,t)=>{if(F(e))return e;throw new y(`A non-function (${zi(e)}) was applied as a function.\n${Jc(t)}`)},cl=e=>e.isKeepLazy?e:{...e,isKeepLazy:!0},ll=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),ul=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Expected ${t} to be a boolean but found ${z(e)}`);return e},dl=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),fl=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),pl=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),ml=(e,t)=>{if(fl.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&pl.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=dl(n,t);if(e&&!t.constants.has(n)&&!hl(e,t))return!0}return hi(e).some(e=>ml(e,t))},hl=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!ml(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>ml(e.set,t)));return t.constantLevels.set(e,r),r},gl=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},_l=(e,t,n)=>{if(!P(e)||jt(e)){let r=z(e),i=n===`1.7.4`?void 0:gl(e,r);throw new y(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Yc(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Yc(t)}\n${i}`)}},vl=(e,t,n)=>(_l(e,t,n),typeof e==`object`&&e.kind===`Interval`?Gn(e):ir(e)??R(e).elements),yl=(e,t,n)=>n===`1.7.4`?(_l(e,t,n),ir(e)??lr(e)):vl(e,t,n),bl=e=>{if(typeof e==`object`&&e.kind===`Interval`)return gr(e),e},xl=(e,t,n)=>bl(e)??yl(e,t,n),Sl=(e,t,n)=>bl(e)??vl(e,t,n),Cl=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},wl=(e,t)=>e.map(e=>xl(W(e.set,t),e.set,t.environment.runtime.version)),Tl=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Cl(t[n],t=>i(n-1,ol(a,e[n].pattern,t)));return i(e.length-1,n)},El=(e,t,n)=>Tl(e,wl(e,t),t.scope,n),Dl=(e,t)=>{let n=e.map(e=>W(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Ol=(e,t,n)=>{if(e.length===1)return ol(t,e[0].pattern,n);let r=br(n)??[];return e.reduce((e,t,n)=>ol(e,t.pattern,r[n]),t)},kl=/* @__PURE__ */ new WeakMap,Al=e=>(kl.set(e.value,e),e.value),jl=e=>typeof e==`object`&&e.kind===`LazyFunction`?kl.get(e):void 0,Ml=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:Yn(i),o=(e,n,i)=>`In applying the function\n${N(z(r))},\nthe ${e} is:\n${N(z(n))}${i}.\n${Jc(t.function)}`,s=e.bounds;if(s.length===1){if(!wr(a,r.domain))throw new y(o(`first argument`,a,`which is not in its domain`));return Ol(s,e.scope,a)}let c=br(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new y(`Attempted to apply a function to an argument not in its domain.\n${Jc(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!wr(n,l[t]))throw new y(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
80
|
+
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&br(n)?.length!==e.pattern.names.length)throw new y(o(r,n,`which does not match its formal parameter`))}),Ol(s,e.scope,Yn(c.slice(0,s.length)))},Nl=/* @__PURE__ */ new WeakMap,Pl=(e,t)=>{let n=Nl.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:qc(r)};return Nl.set(t,i),i},Fl=(e,t,n)=>{let r=Pl(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},Il=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Jr(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(en(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},Ll=/* @__PURE__ */ new WeakMap,Rl=e=>{let t=Ll.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return Ll.set(e,n),n},zl=(e,t)=>{let n=Dl(e.bounds,t),r=Il(n,(n,r)=>W(e.body,ll(t,Ol(e.bounds,al(void 0,e.name,r),n))),Fl(e.bounds,e.body,n));return Al({value:r,bounds:e.bounds,body:e.body,scope:al(void 0,e.name,r)}),e.bounds.length===1?Wt(r):r},Bl=(e,t)=>{if(typeof t!=`object`||Ut(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!lt(t.domain))return t;try{let e=Dr(t);return Bt(e.domain,e.range)}catch(e){if(e instanceof y)return t;throw e}},Vl=(e,t)=>e.kind===`Function`?e.isSelfReferential?zl(e,t):W(Rl(e),t):W(e.body,t),Hl=(e,t)=>{let n=hl(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new y(`Operator ${e.name} requires ${e.params.length} arguments`);let i=ll(t,void 0);if(!n)return Vl(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>Bl(e,Vl(e,i)));return t.environment.definitionValues.set(e,a),a},Ul=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(!(t.constants.has(n)||t.substitutions.has(n))&&hl(e,t))try{An(Hl(e,{environment:t,scope:void 0,state:void 0,next:void 0}))}catch(e){if(!(e instanceof y)&&!c(e))throw e}}),Wl=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=W(e.expression,ll(t,e.scope));return n&&(e.cache=r),r},Gl=/* @__PURE__ */ new WeakMap,Kl=e=>{let t=Gl.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Gl.set(e,n),n},ql=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return ql(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Kl(r):t.builtins.get(e)},Jl=/* @__PURE__ */ new WeakMap,Yl=(e,t)=>{if(B(e))return Xl(e.operator,t);let n=Jl.get(e),r=n===void 0?ql(e.operator,t.environment)??null:n;return n===void 0&&Jl.set(e,r),r??Xl(e.operator,t)},Xl=(e,t)=>{let n=il(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return ql(e,t.environment)},Zl=e=>e.kind===`Closure`?e.params.length:e.arity,Ql=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:Xl(n,t);if(!r)throw new y(`Expected an operator argument at ${Kc(e)}`);return r},$l=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>al(e,n.name,t[r]),e.scope);return W(e.body,ll(n,r))},eu=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Zl(e),call:n=>$l(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},tu=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Xl(e.name,t);return n!==void 0&&Zl(n)>0},nu=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),ru=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return ru(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},iu=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&du(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=B(e)?void 0:ru(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=il(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:nu(e,t)}}return t=>nu(e,t)},au=/* @__PURE__ */ new WeakMap,ou=(e,t)=>{let n=au.get(e);if(n)return n;let r=iu(e,t);return au.set(e,r),r},su=(e,t,n)=>{if(t.length!==e.params.length)throw new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`);let r=e.scope;for(let i=0;i<t.length;i++){let a=e.params[i],o=a.arity>0?{kind:`Operator`,operator:Ql(t[i],n)}:ou(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},cu=(e,t,n)=>e.kind===`Closure`?W(e.body,ll(n,su(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Ku(t,n),n):e.evaluate(t.map(e=>tu(e,n)?eu(Ql(e,n),n):W(e,n)),n),lu=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0},i):r.params.length>0||n?.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0},i)},t.scope),uu=(e,t,n)=>{let r=il(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Wl(r,n);if(r?.kind===`Operator`){if(Zl(r.operator)===0)return $l(r.operator,[],n);throw new y(`Operator ${e} is used without arguments`)}let i=ru(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw dd(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Hl(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new y(`Unknown identifier ${e} at ${Kc(t)}`)},du=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,fu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),pu=(e,t)=>fu.has(e)||t.builtins.get(e)?.isStateLevel===!0,mu={builtins:fu,definitions:/* @__PURE__ */ new WeakMap},hu={builtins:new Set([...fu].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},gu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&hl(e,t),_u=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!B(e)){let e=dl(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!gu(e,t)&&vu(e,t,n))return!0}return hi(e).some(e=>_u(e,t,n))},vu=(e,t,n=mu)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=_u(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>_u(e.set,t,n));return n.definitions.set(e,i),i},yu={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},bu=(e,t)=>new Set(e.filter(e=>vu(e,t)||vu(e,t,yu))),xu=e=>[...e.definitions.values()].some(t=>vu(t,e)),Su=e=>[...e.definitions.values()].some(t=>vu(t,e,hu)),Cu=/* @__PURE__ */ new WeakMap,wu=(e,t)=>{let n=Cu.get(e);if(n!==void 0)return n;let r=Ou(e,t,Eu);return Cu.set(e,r),r},Tu=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),Eu=/* @__PURE__ */ new Set,Du=(e,t,n)=>n.size===0?wu(e,t):Ou(e,t,n),Ou=(e,t,n)=>{if(!Tu.has(e.kind))return!1;if(e.kind===`Identifier`&&B(e))return n.has(e.name);if(B(e))return!1;if(e.kind===`Identifier`){let n=ru(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&gu(n.definition,t)}if(e.kind===`Apply`){if(pu(e.operator,t)||yu.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=ql(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=dl(e.operator,t);if(!n||!hl(n,t)||vu(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&Du(e,t,n))}let r={value:!0};return Jo(e,(e,i)=>(r.value&&=Du(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},ku=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Au=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},ju=(e,t)=>{if(e.kind===`Identifier`&&B(e))return!t.has(e.name);if(B(e))return!0;let n={value:!1};return Jo(e,(e,r)=>(n.value||=ju(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Mu=(e,t)=>Bo.has(e)&&ku(e)&&vd(e,t)!==void 0&&!ju(e,Eu),Nu=/* @__PURE__ */ new WeakMap,Pu=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Sr.sets,o=Sr.callStack,s=a??[],c=s.length;Sr.sets=s,Sr.callStack=r;try{let a=t(i),o=typeof a==`object`&&a.kind===`FilteredSet`?Nu.get(a):void 0,s=o?o(n):a;return r.values.set(e,s),typeof s==`object`&&s.kind!==`FilteredSet`&&Wc(e)&&r.sources.set(s,e),s}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Gc(e,r.values),a=i&&!hi(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!F(a)?void 0:a;throw Fu(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Sr.sets=a,Sr.callStack=o}},Fu=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof y){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},Iu=(e,t,n)=>{if(!(n instanceof y))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},Lu=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Ru=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=hd(e,t),i=t.callStack,a=i?Pu(e,r,t,i):ku(e)&&wu(e,t)?Au(r):Mu(e,t)?Uu(r):r;return t.evaluators.set(e,a),a},zu=/* @__PURE__ */ new WeakMap,Bu=(e,t)=>{if(t.callStack)return Ru(e,t);let n=zu.get(e);if(n)return n;let r=(ku(e)&&wu(e,t)?void 0:oa(e,t))??Ru(e,t);return zu.set(e,r),r},W=(e,t)=>Bu(e,t.environment)(t),Vu=(e,t)=>{let n=e.name,r=B(e)?void 0:ru(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw dd(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&hl(e,t))return t=>Hl(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Bu(e.body,t),n.body(ll(r,void 0)));return Hu(e,t)?Uu(r):r}return t=>Hl(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Hl(e,t);return hl(e,t)||!Hu(e,t)?n:Uu(n)}return t=>uu(n,e,t)},Hu=(e,t)=>vd(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>vd(e.set,t)!==void 0)),Uu=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},Wu=(e,t)=>{let n=ql(e,t);return n!==void 0&&Zl(n)>0},Gu=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!B(e)&&Wu(e.name,t)),Ku=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),qu=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Ku(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Gu(t[0],n)){let e=Ru(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Gu(t[0],n)&&Gu(t[1],n);if(i&&a){let e=Ru(t[0],n),r=Ru(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>tu(e,n)?eu(Ql(e,n),n):W(e,n)),n)},Ju=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:ou(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:Ql(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Yu=/* @__PURE__ */ new WeakMap,Xu=e=>{let t=Yu.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return Yu.set(e,n),n},Zu=(e,t)=>{let n=[];for(let r=e;n.length<t;r=r?.parent){if(r?.binding.kind!==`Value`)return;n.push(r.binding.value)}return n},Qu=(e,t)=>e.every((e,n)=>en(e,t[n])),$u=(e,t)=>{let n=dl(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&hl(n,t)&&!vu(n,t)},ed=(e,t,n,r)=>{let i=Ju(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Bu(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r)return e=>o(i(e),e);let s=Xu(e);return e=>{let n=i(e),r=Zu(n,t.length);if(!r||e.isKeepLazy)return o(n,e);let a=r.length;for(let e of r)a=zr(a,Jr(e));let c=s.calls.get(a),l=c?.find(e=>Qu(e.args,r));if(l)return l.value;let u=o(n,e);return s.size<65536&&(s.size++,c?c.push({args:r,value:u}):s.calls.set(a,[{args:r,value:u}])),u}},td=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Ru(n[0],t),r=Ru(n[1],t);return t=>!ul(e(t),`the left side of =>`)||ul(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new y(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=B(e)?void 0:ql(e.operator,t);if(r?.kind===`Closure`){let i=!t.callStack&&$u(e,t);return ed(r,n,t,i)}if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Ru(n[0],t),i=el(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Ru(n[0],t);return Vo.has(e)||ml(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=Ru(n[0],t),a=Ru(n[1],t),o=tl(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?qu(r,n,t):e.operator===`\\cdot`&&n.length===2?()=>{throw new y(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)}:r=>{let i=Xl(e.operator,r);if(i)return cu(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new y(`${e.operator} is a function; apply it with brackets`):new y(`Unknown operator ${e.operator} at ${Kc(e)}`)}},nd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Ru(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Ru(a.set,t);return s=>Cl(xl(o(s),a.set,t.runtime.version),t=>ul(i(ll(s,al(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>Ru(e.set,t));return s=>{let c=a.map((e,n)=>xl(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?ul(i(ll(s,a)),r)!==n:Cl(c[t],n=>l(t-1,al(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>El(o,e,t=>ul(i(ll(e,t)),r)!==n)?!n:n},rd=(e,t)=>{if(e.kind===`Tuple`)return Yn(e.names.map(e=>{let n=il(t,e);return n?.kind===`Value`&&n.value}));let n=il(t,e.name);return n?.kind===`Value`?n.value:void 0},id=/* @__PURE__ */ new WeakSet,ad=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&id.add(e)},od=(e,t)=>{let n=id.has(e),r=Ru(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Ru(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=qn(e),o=Bt(i,i.map(e=>r(ll(t,al(t.scope,n,e)))));return lt(e)?o:Wt(o)}let n=[],s=i.map(e=>Sl(W(e.set,t),e.set,t.environment.runtime.version));return Tl(i,s,t.scope,e=>{let o=i.length===1?rd(a.pattern,e)??!1:Yn(i.map(t=>rd(t.pattern,e)??!1));return n.push([o,r(ll(t,e))]),!1}),zn(n)},l=(t,n)=>{let a=Al({value:Il(t,e=>r(ll(n,Ol(i,n.scope,e))),Fl(i,e.body,t)),bounds:i,body:e.body,scope:n.scope});return i.length===1?Wt(a):a},u=t.callStack;return t=>{let r=o?s(t):Dl(i,t);if(e.isRecursive||n||t.isKeepLazy||!L(r))return l(r,t);if(!lt(r)){if(u)return l(r,t);try{return c(r,t)}catch(e){if(!(e instanceof y))throw e;return l(r,t)}}if(!u)return c(r,t);try{return c(r,t)}catch(t){throw Iu(u,e,t),t}}},sd=(e,t)=>{let n=id.has(e);n&&ad(e.function);let r=Ru(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>Ru(e,t))}),value:Ru(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Yn(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(ll(i,al(i.scope,`@`,e))):Ir(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(sa.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Jc(e.function)}`)}return n}},cd=(e,t)=>{if(e.kind===`SetFilter`){let n=Ru(e.predicate,t),r=Ru(e.bound.set,t),i=e.bound.pattern,a=e.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:qc(a)},s=(e,t)=>n=>ul(e(ll(t,ol(t.scope,i,n))),`a set filter predicate`),c=(t,n,r)=>{let i={kind:`FilteredSet`,base:t,test:s(r,n),source:o};return Nu.set(i,r=>c(t,{...n,environment:r},Ru(e.predicate,r))),i};return e=>{let t=r(e);return lt(t)?zt(R(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=Ru(e.expression,t);return t=>{let r=[];return El(e.bounds,t,e=>(r.push(n(ll(t,e))),!1)),Pn(r)}}let n=e.set;if(!n)return()=>{throw new y(`TLC cannot evaluate an unbounded CHOOSE at ${Kc(e)}`)};let r=Ru(e.body,t),i=Ru(n,t);return t=>{let a=i(t);if(!P(a)||jt(a))throw new y(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${Jc(e)}`);let o={value:void 0},s=Sl(a,n,t.environment.runtime.version);if(Cl(s,n=>{let i=ol(t.scope,e.pattern,n);return ul(r(ll(t,i)),`the body of CHOOSE`)?(o.value=rd(e.pattern,i),!0):!1}),o.value===void 0)throw new y(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Jc(e)}`);return o.value}},ld=e=>[...e].sort((e,t)=>It(e.name,t.name)),ud=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),dd=(e,t)=>new S(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${Jc(t)}`,e),fd=(e,t)=>e instanceof S&&t!==`1.7.4`?new y(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,pd=e=>new y(`A primed expression appears outside an action at ${Kc(e)}`),md=(e,t)=>{let n=ld(e),r=ud(n),i=n.map(e=>Ru(e.value,t));if(r)return e=>Xn(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>ht(a,i.map(t=>t(e)),o):e=>Zt(a,i.map(t=>t(e)))},hd=(e,t)=>{let n=e=>Ru(e,t);switch(e.kind){case`Number`:{let t=e.value;return du(t)?()=>t:()=>{throw rl(e)}}case`Decimal`:return()=>{throw nl(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Vu(e,t);case`Apply`:return td(e,t);case`Bracket`:return()=>{throw new y(`A bracket without a function or subscript is not an expression at ${Kc(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new y(`An operator cannot be used as a value at ${Kc(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw Zc(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw Zc(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw pd(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>Qt(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Xc(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new y(`A non-boolean expression (${zi(t)}) was used as a condition of a CASE. ${Yc(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new y(`Attempted to evaluate a CASE with no conditions true.\n${Jc(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(ll(n,lu(e.definitions,n)))}case`Forall`:case`Exists`:return nd(e,t);case`UnboundedQuantifier`:return()=>{throw new y(`TLC cannot evaluate an unbounded quantifier at ${Kc(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return cd(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Pn(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Yn(t.map(t=>t(e)))}case`FunctionConstruction`:return od(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return md(e.fields,t);case`RecordSet`:{let t=ld(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return sd(e,t);case`ExceptAt`:return t=>{let n=il(t.scope,`@`);if(n?.kind!==`Value`)throw new y(`@ appears outside an EXCEPT at ${Kc(e)}`);return n.value};case`FunctionApplication`:{ad(e.function);let r=n(e.function),i=t=>sl(r(cl(t)),e),a=e.args.map(n),o=$c(t.runtime.version);if(a.length===1){let e=a[0];return t=>Nr(i(t),e(t),o)}return e=>Nr(i(e),Yn(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Qc(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?ul(t(e),`an action`)||r(e):ul(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Lc(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new y(`The subexpression reference at ${Kc(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new y(`TLC cannot evaluate a temporal formula in a state at ${Kc(e)}`)}}},gd=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),_d=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},vd=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(gd.has(e.kind))return!1;let a=_d(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&pu(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return hi(e).every(i)};return i(e)?[...n]:void 0},yd=`-------------------------------- MODULE Reals -------------------------------
|
|
27
81
|
(***************************************************************************)
|
|
28
82
|
(* This module provides dummy definitions of the operators that are *)
|
|
29
83
|
(* defined by the real Reals module. It is expected that any tool that *)
|
|
@@ -40,7 +94,7 @@ EXTENDS Integers
|
|
|
40
94
|
Real == "Reals"
|
|
41
95
|
a / b == CHOOSE m \\in Real : m * b = a
|
|
42
96
|
Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
|
|
43
|
-
|
|
97
|
+
=============================================================================`,bd=`----------------------------- MODULE RealTime -------------------------------
|
|
44
98
|
(***************************************************************************)
|
|
45
99
|
(* This standard module is described in Chapter 9 of the book "Specifying *)
|
|
46
100
|
(* Systems". The type of specification described there cannot be handled *)
|
|
@@ -66,7 +120,7 @@ RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
|
|
|
66
120
|
IN /\\ now \\in Real
|
|
67
121
|
/\\ [][NowNext]_now
|
|
68
122
|
/\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
|
|
69
|
-
|
|
123
|
+
=============================================================================`,xd=`----------------------------- MODULE Toolbox --------------------------------
|
|
70
124
|
(***************************************************************************)
|
|
71
125
|
(* *)
|
|
72
126
|
(***************************************************************************)
|
|
@@ -92,8 +146,7 @@ _TEPosition ==
|
|
|
92
146
|
THEN _TETraceLength
|
|
93
147
|
ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
|
|
94
148
|
|
|
95
|
-
|
|
96
|
-
`)},kc=(e,t)=>{let n=se(e),r={index:0,offsideColumns:[]},i=[],a=/* @__PURE__ */ new Set,o=[],s={index:-1},c=[],l=e=>i[i.length-1].has(e),u=e=>({line:e.line,column:t&&e.kind===`String`?e.endColumn:e.column,range:void 0}),d=[],f=[],m=[],h=e=>{let t=r.index-1,i=e===t?m[e]:void 0;if(i)return i;let a=n[t];d[e]??=u(n[e]),f[t]??={line:a.line,column:a.endColumn};let o={module:c[c.length-1].name,start:d[e],end:f[t]};return e===t&&(m[e]=o),o},g=(e,t)=>(e.location.range=h(t),e),_=(e=0)=>n[Math.min(r.index+e,n.length-1)],v=(e=0)=>{let t=_(e),n=r.offsideColumns[r.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},y=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),b={index:0},x=e=>{let t=n.slice(b.index,r.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ee=e=>t&&(e.kind===`Keyword`||Ec.has(e.text)),te=e=>{let t=n.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},ne=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:yc.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ee(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,S=(e,t=_(),r)=>{let i=n[n.length-1],a=t.line===i.line&&t.column===i.column;return new p(`${e} at line ${t.line}, column ${t.column}`,void 0,re(e,t,a,r))},re=(e,r,i,a)=>{if(t&&i){let e=n[n.length-1];return{reason:`Unexpected EOF`,...x(te(e)),isEnd:i}}return t&&a?{reason:`Unexpected ${ne(a)}`,...te(a),isEnd:i}:{reason:e,line:r.line,column:r.column,isEnd:i}},C=(e,t=_())=>S(e,t,t),ie=e=>(e.kind===`Identifier`||e.kind===`Keyword`)&&!ee(e),w=(e,t=0)=>{let n=v(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=v();if(e.kind===`End`)throw S(`Unexpected end of expression`);return r.index++,e},E=e=>w(e)?(r.index++,!0):!1,D=e=>{if(!w(e))throw C(`Expected ${JSON.stringify(e)} but found ${y(v())}`);return T()},O=()=>{let e=v();if(e.kind!==`Identifier`)throw C(`Expected an identifier but found ${y(e)}`);if(ee(e))throw C(`Unexpected keyword ${e.text}`);return r.index++,e.text},oe=e=>{r.offsideColumns.push(-1);let t=e();return r.offsideColumns.pop(),t},k=(e,t=`,`)=>{let n=[e()];for(;E(t);)n.push(e());return n},A=()=>{if(w(`<<`)){let e={value:1};for(;v(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;v(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},ce=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;v(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return v(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},le=()=>{if(!E(`<<`))return{kind:`Name`,name:O()};let e=k(O);return D(`>>`),{kind:`Tuple`,names:e}},ue=()=>k(()=>{let e=k(le);D(`\\in`);let t=F();return e.map(e=>({pattern:e,set:t}))}).flat(),de=()=>{let e=v();if(e.kind===`Identifier`){let t=r.index,n=[T().text];for(;w(`!`)&&v(1).kind===`Identifier`;)T(),n.push(O());return g({kind:`Identifier`,name:n.join(`!`),location:u(e)},t)}if(w(`<<`)||w(`(`))return be();throw C(`Expected a subscript but found ${y(e)}`)},fe=e=>{let t=v(1),n=v(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&w(`==`,sc.has(n.text)?3:4))},j=e=>{if(!lc.has(e.text))return!0;let t=v(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&hc.has(t.text)||fe(e)},pe=()=>{let e=v(),n=e.kind===`Operator`&&(oc.has(e.text)||cc.has(e.text))&&j(e);if(t&&e.kind!==`String`&&(cc.has(e.text)||dc.has(e.text)&&e.text!==`'`&&!sc.has(e.text)||uc.has(e.text)&&v(-1).text===`(`&&v(-1).line===e.line&&v(-1).endColumn+1===e.column&&v(1).text===`)`&&v(1).line===e.line&&v(1).column===e.endColumn+1)&&j(e))throw S(`incomplete expression`,e);if(n)return r.index++,g({kind:`OperatorReference`,operator:e.text,location:u(e)},r.index-1);if(e.kind!==`String`&&dc.has(e.text)&&j(e)){r.index++;let t=u(e);if(sc.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:pc(e.text,n,t),location:t}}if(w(`LAMBDA`)){let t=r.index;T();let n=k(O);D(`:`);let i=F();return g({kind:`Lambda`,params:n,body:i,location:u(e)},t)}return F()},me=()=>oe(()=>{D(`(`);let e=k(pe);return D(`)`),e}),he=()=>{let e=T();r.offsideColumns.push(e.column);let t=[F()];for(;_().text===e.text&&_().column===e.column;)r.index++,t.push(F());return r.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:u(e)}},M=e=>oe(()=>{let t=u(e);if(v().kind===`Identifier`&&(w(`|->`,1)||w(`:`,1))){let e=w(`|->`,1)?`Record`:`RecordSet`,n=k(()=>{let t=O();return D(e===`Record`?`|->`:`:`),{name:t,value:F()}});return D(`]`),{kind:e,fields:n,location:t}}if(A()){let e=ue();D(`|->`);let n=F();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let n=F();if(E(`->`)){let e=F();return D(`]`),{kind:`FunctionSet`,domain:n,range:e,location:t}}if(E(`EXCEPT`)){let e=k(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!ie(v()))throw C(`Expected a field name but found ${y(v())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:k(()=>F())}),D(`]`);return D(`=`),{path:e,value:F()}});return D(`]`),{kind:`Except`,function:n,updates:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:n,subscript:de(),location:t}}),ge=e=>oe(()=>{let t=u(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(A()&&(v(1).text===`\\in`||w(`<<`))){let e=r.index,n=le();D(`\\in`);let i=F();if(E(`:`)){let e=F();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:i},predicate:e,location:t}}r.index=e}let n=F();if(E(`:`)){let e=ue();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let i=[n];for(;E(`,`);)i.push(F());return D(`}`),{kind:`SetEnumeration`,elements:i,location:t}}),N=e=>{let t=u(e),n=oe(()=>w(`>>`)||w(`>>_`)?[]:k(()=>F()));if(E(`>>_`)){if(n.length!==1)throw S(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:de(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},P=e=>{let t=u(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&A()){let e=ue();return D(`:`),{kind:n,bounds:e,body:F(),location:t}}let i=k(O);return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i,body:F(),isTemporal:r,location:t}},_e=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:F(),location:u(e)};let n=F();D(`->`),t.push({condition:n,body:F()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:u(e)}},ve=()=>{let e=v(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||mc.has(e.text)||e.kind===`Operator`&&(oc.has(e.text)||sc.has(e.text)||cc.has(e.text)))},ye=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:ae(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return r.index--,{kind:`Bound`,args:me()}}return{kind:`Name`,name:e.text,args:w(`(`)?me():[]}},be=()=>{let e=r.index===s.index,n=T(),a=u(n);if(t&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=k(O);return D(`:`),{kind:`Lambda`,params:e,body:F(),location:a}}if(n.kind===`Number`){if(t&&/^\\[BOH]/.test(n.text))throw S(`incomplete expression`,n);return{kind:`Number`,value:ae(n.text),text:n.text,location:a}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:a};if(n.kind===`String`)return{kind:`String`,value:n.text,location:a};let o=n.kind===`Step`&&Pe(n);if(o&&I()<0&&Me.length<=1)throw S(`Step number used outside proof`,n);if(o&&n.text[1]===`+`)throw S(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||o){let r=o?Fe(n)??n.text:n.text;if(ce()){let e=E(`(`)?k(O):[];return e.length>0&&D(`)`),D(`::`),{kind:`Label`,name:r,params:e,body:F(),location:a}}let i=w(`(`),s=i?me():[];if(!ve())return i?{kind:`Apply`,operator:r,args:s,location:a}:{kind:`Identifier`,name:r,location:a};let l=c.flatMap(e=>e.instances).find(e=>e.name===r);if(l&&!e&&!t&&l.params.length!==s.length)throw S(`The operator ${r} requires ${l.params.length} arguments`,n);let u=[{kind:`Name`,name:r,args:s}];for(;ve();)T(),u.push(ye());let d=u.flatMap(e=>e.kind===`Name`?[e.name]:[]);if(d.length<u.length)return{kind:`Subexpression`,selectors:u,location:a};let f=d.join(`!`),p=u.flatMap(e=>`args`in e?e.args:[]);if(p.length===0)return{kind:`Identifier`,name:f,location:a};let m=u.map(e=>`args`in e?e.args.length:0);return m.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:f,args:p,argumentCounts:m,location:a}:{kind:`Apply`,operator:f,args:p,location:a}}if(n.kind===`Operator`&&fc(n.text)&&w(`(`))return{kind:`Apply`,operator:n.text,args:me(),location:a};switch(n.text){case`(`:{let e=oe(()=>F());return D(`)`),e}case`[`:return M(n);case`{`:return ge(n);case`<<`:return N(n);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return P(n);case`IF`:{let e=F();D(`THEN`);let t=F();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:F(),location:a}}case`CASE`:return _e(n);case`LET`:{let e=[],n=[];for(i.push(/* @__PURE__ */ new Set);!E(`IN`);){if(t&&w(`RECURSIVE`))throw S(`Unexpected keyword RECURSIVE`,x(_()));if(E(`RECURSIVE`)){ke();continue}let r=we(!1);r.kind===`Instance`?n.push(r):e.push(r)}i.pop();let r=F();return n.length===0?{kind:`Let`,definitions:e,body:r,location:a}:{kind:`Let`,definitions:e,instances:n,body:r,location:a}}case`CHOOSE`:{let e=le(),t=E(`\\in`)?F():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:F(),location:a}}case`WF_`:case`SF_`:{let e=de(),t=oe(()=>{D(`(`);let e=F();return D(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:a}}}throw C(`Unexpected ${y(n)}`,n)},xe=()=>{let e=v(),t=u(e);if(e.kind===`Operator`&&(e.text===`/\\`||e.text===`\\/`))return he();if(e.kind===`Operator`||e.kind===`Keyword`)switch(e.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[F(5)],location:t};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[F(13)],location:t};case`[]`:return T(),{kind:`Always`,expression:F(16),location:t};case`<>`:return T(),{kind:`Eventually`,expression:F(16),location:t};case`ENABLED`:return T(),{kind:`Enabled`,expression:F(16),location:t};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:F(16),location:t};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:e.text,args:[F(9)],location:t}}return be()},F=(e=0)=>{let t=r.index,n=xe(),i={left:n.location.range?n:g(n,t),previous:void 0};for(;;){let n=v();if(n.kind!==`Operator`)break;let r=u(n);if(n.text===`'`&&e<=15){T(),i.left=g({kind:`Prime`,expression:i.left,location:r},t);continue}if(sc.has(n.text)&&e<=15){T(),i.left=g({kind:`Apply`,operator:n.text,args:[i.left],location:r},t);continue}if(n.text===`[`){T();let e=oe(()=>k(()=>F()));oe(()=>D(`]`)),i.left=g({kind:`FunctionApplication`,function:i.left,args:e,location:r},t);continue}if(n.text===`.`&&ie(v(1))){T();let e=T().text;i.left=g({kind:`FieldAccess`,record:i.left,field:e,location:r},t);continue}let a=oc.get(n.text);if(!a||a.low<e)break;let o=i.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw S(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(T(),a.low>12&&w(`-`))throw S(`Precedence conflict between ${n.text} and -`,v());let s=F(a.high+1),c=i.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`;i.left=c.kind===e&&o?.text===n.text?{...c,operands:[...c.operands,s]}:{kind:e,operands:[c,s],location:r}}else i.left=n.text===`\\X`?c.kind===`Product`&&o?.text===`\\X`?{...c,factors:[...c.factors,s]}:{kind:`Product`,factors:[c,s],location:r}:{kind:`Apply`,operator:n.text,args:[c,s],location:r};i.left=g(i.left,t),i.previous={...a,text:n.text}}return i.left},Se=()=>{if(!E(`(`))return[];let e=Oe();return D(`)`),e},Ce=()=>{let e=u(v()),t=F(),i=n[r.index-1],a={line:i.line,column:i.endColumn};return{body:t,bodyRange:{module:c[c.length-1].name,start:e,end:a}}},we=e=>{let t=r.index;return g(Te(e),t)},Te=e=>{let t=v(),n=u(t),i=(t,r)=>({kind:`Operator`,name:t,params:r,...Ce(),isLocal:e,isRecursive:l(t),location:n});if(t.kind===`Identifier`&&v(1).kind===`Operator`&&oc.has(v(1).text)&&v(2).kind===`Identifier`&&w(`==`,3)){let e=O(),t=T().text,n=O();return D(`==`),i(t,[{name:e,arity:0},{name:n,arity:0}])}let a=t.kind===`Operator`&&t.text===`-.`,o=t.kind===`Identifier`&&sc.has(v(1).text)&&w(`==`,2);if(a||o){let e=a?t.text:v(1).text;r.index+=a?1:2;let n=a?O():t.text;return D(`==`),i(e,[{name:n,arity:0}])}let s=O();if(E(`[`)){let t=oe(()=>ue());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:F(),isLocal:e,isRecursive:l(s),location:n}}let c=r.index,d=Se();return D(`==`),w(`INSTANCE`)?{...Ee(s,d,e,n),definitionRange:h(c)}:i(s,d)},Ee=(e,t,n,i)=>{let a=r.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:O(),substitutions:E(`WITH`)?k(()=>{let e=T().text;return D(`<-`),{name:e,expression:pe()}}):[],isLocal:n,location:i,instanceRange:h(a)}},De=()=>{let e=u(v());if(w(`_`)&&v(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(v().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=O();if(!E(`(`))return{name:t,arity:0,location:e};let n=k(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},Oe=()=>k(De),ke=()=>{let e=Oe();return e.forEach(e=>i[i.length-1].add(e.name)),e},Ae=e=>{let t={value:0,offset:e};do{let e=v(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&wc.has(e.text)&&t.value++,e.kind===`Operator`&&Tc.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},je=()=>{let e=v(),t=v(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,Ae(1)):t.kind===`Operator`&&sc.has(t.text)?w(`==`,2):t.kind===`Operator`&&oc.has(t.text)?v(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):w(`-.`)&&t.kind===`Identifier`&&w(`==`,2)},Me=[],I=()=>Me[Me.length-1]??-1,Ne=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),L=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)},Pe=e=>!e.text.endsWith(`.`)&&!bc.has(L(e)),Fe=e=>{let t=L(e);if(bc.has(t))return;let n=Ne(e);if(n>=0)return`<${n}>${t}`;let r=I(),i=Me[Me.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Ie=e=>{if(e.kind===`Keyword`)return _c.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Me.length===0;if(e.text[1]===`+`||Me.length===0)return!0;let t=I();return t>=0&&Ne(e)>t},Le=e=>{let t=Ne(e),n=Me.length-1,r=Me[n-1]??-1,i=Me[n]<0;return i&&(Me[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Me[n]===t},Re=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)),ze=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Ec.has(e.name)&&!Re(e.name):!1,Be=()=>{let e=v();return e.kind===`Step`?Pe(e):e.kind===`Keyword`?xc.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!je()},Ve=()=>{let e=r.index;s.index=e;let t=v();return t.kind===`Operator`&&!lc.has(t.text)&&fc(t.text)?(r.index++,g({kind:`OperatorReference`,operator:t.text,location:u(t)},e)):E(`MODULE`)?g({kind:`ModuleFact`,name:O(),location:u(t)},e):F()},R=e=>o[o.length-1]?.add(e),He=e=>{o.push(/* @__PURE__ */ new Set);let t=e();return o.pop(),t},Ue=e=>o.some(t=>t.has(e))||c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),We=()=>{let e=r.index,t=v(),n=k(()=>{let e=v();if((e.kind!==`Identifier`||ee(e))&&e.kind!==`Operator`)throw C(`Expected a definition name but found ${y(e)}`,e);return r.index++,e.text},`!`),i=u(t);return g(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:i}:{kind:`Identifier`,name:n.join(`!`),location:i},e)},Ge=()=>{if(t)return k(We);let e=k(Ve),n=e.find(e=>e.kind===`Identifier`&&Ue(e.name));if(n)throw S(`DEF clause entry should describe a defined operator`,n.location);return e},Ke=()=>({facts:Be()?k(Ve):[],defs:E(`DEF`)||E(`DEFS`)?Ge():[]}),qe=()=>{let e=r.index,n=T(),i=n.text===`USE`&&E(`ONLY`),a=h(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:i,...Ke(),keyword:a,location:u(n)},s=o.kind===`Hide`&&!t?o.facts.find(e=>!ze(e)):void 0;if(s)throw S(`The only expression allowed as a fact in a HIDE is the name of a theorem, assumption, or step`,s.location);return g(o,e)},Je=()=>{let e=r.index,t=u(v()),n=E(`NEW`),i=v().kind===`Keyword`?Sc.get(v().text):void 0;if(!n&&i===void 0)throw C(`Expected a declaration but found ${y(v())}`);if(i!==void 0&&T(),i===`Variable`){let n=O();return R(n),g({kind:`NewSymbol`,name:n,arity:0,level:i,set:void 0,location:t},e)}let a=De();R(a.name);let o=(i??`Constant`)===`Constant`&&w(`\\in`);if(o&&a.arity>0)throw S(`declared symbol with arguments before \\in`);return o&&T(),g({kind:`NewSymbol`,name:a.name,arity:a.arity,level:i??`Constant`,set:o?F():void 0,location:t},e)},Ye=()=>{let e=r.index,t=u(D(`ASSUME`)),n=k(()=>w(`ASSUME`)?He(Ye):v().kind===`Keyword`&&Cc.has(v().text)?Je():F());return D(`PROVE`),g({kind:`AssumeProve`,assumptions:n,conclusion:F(),location:t},e)},Xe=e=>{let t={value:0};for(;v(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return v(t.value).kind===`Identifier`&&w(e,t.value+1)},Ze=(e,t)=>{e.forEach(R),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(R))},Qe=()=>{let e=v();if(w(`USE`)||w(`HIDE`))return qe();if(w(`INSTANCE`))return g(Ee(void 0,[],!1,u(e)),r.index);if(w(`DEFINE`)||je()){let t=r.index;E(`DEFINE`);let n=[we(!1)];for(;je();)n.push(we(!1));let i={kind:`Define`,definitions:n,location:u(e)};return g(i,t)}if(E(`HAVE`))return{kind:`Have`,expression:F()};if(E(`TAKE`)){let e=A(),t=e?[]:k(O),n=e?ue():[];return Ze(t,n),{kind:`Take`,names:t,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:k(()=>F())};if(E(`PICK`)){let e=Xe(`:`),t=e?k(O):[],n=e?[]:ue();return Ze(t,n),D(`:`),{kind:`Pick`,names:t,bounds:n,body:F()}}return E(`CASE`)?{kind:`Case`,expression:F()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?Ye():F()}},$e=e=>{let t=v();if(t.kind!==`Step`)throw C(`Expected a step number but found ${y(t)}`,t);if(!Le(t))throw S(`${e?`QED step`:`step`}'s number has bad level`,t);if(Ne(t)<0&&Fe(t)!==void 0)throw S(`<*> and <+> cannot be used for a named step`,t);return r.index++,{name:Fe(t),token:t.text,location:u(t)}},et=()=>{let e=r.index,t=$e(w(`QED`,1)),n=/* @__PURE__ */ new Set;o.push(n);let i=E(`QED`)?{kind:`Qed`}:Qe(),a=h(e),s=Ie(v());if(s&&!vc.has(i.kind))throw S(`Proof of a step that does not take a proof`);let c=s?nt():void 0;return o.pop(),(i.kind!==`Assert`||i.isSuffices)&&n.forEach(R),g({...t,body:i,head:a,proof:c},e)},tt=()=>{let e=u(v());if(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=h(r.index-1);return{kind:`By`,isOnly:E(`ONLY`),...Ke(),keyword:t,location:e}}let t=v(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=h(r.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`PROOF`);let n=[et()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(et());return{kind:`Steps`,level:I(),steps:n,location:e}},nt=()=>{let e=r.index;Me.push(-1);let t=He(tt);return Me.pop(),g(t,e)},rt=e=>{let t=r.index,n=T(),i=v().kind===`Identifier`&&w(`==`,1)?O():void 0;i!==void 0&&(a.add(i),T());let o=He(()=>({statement:w(`ASSUME`)?Ye():F(),proof:Ie(v())?nt():void 0})),s=o.statement,c=g({name:i,statement:s,proof:o.proof,location:u(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&s.kind!==`AssumeProve`&&e.definitions.push(g({kind:`Operator`,name:i,params:[],body:s,isLocal:!1,isRecursive:!1,location:u(n)},t))},it=()=>{let e=r.index;return g(at(),e)},at=()=>{let e=T(),t=u(e),n=e.text===`AXIOM`;if(v().kind===`Identifier`&&w(`==`,1)){let e=O();return a.add(e),T(),{name:e,expression:F(),isAxiom:n,location:t}}return{name:void 0,expression:F(),isAxiom:n,location:t}},ot=()=>{let e=u(D(`----`));D(`MODULE`);let t=O();D(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(c.push(n),i.push(/* @__PURE__ */ new Set),E(`EXTENDS`)&&k(()=>{let e=r.index;n.extends.push(O()),n.extendsRanges.push(h(e))});;){let a=r.index;b.index=a;let o=v();if(o.kind===`ModuleEnd`||o.kind===`End`)return o.kind===`ModuleEnd`&&(e.range={module:t,start:{line:e.line,column:e.column},end:{line:o.line,column:o.endColumn}}),c.pop(),i.pop(),n;if(o.kind===`Separator`){if(w(`MODULE`,1)){let e=ot();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(o.text){case`CONSTANT`:case`CONSTANTS`:{T();let e=Oe();n.constants.push(...e),n.units.push({kind:`Constants`,declarations:e});continue}case`VARIABLE`:case`VARIABLES`:{T();let e=k(()=>{let e=r.index,t=u(v());return g({name:O(),arity:0,location:t},e)});n.variables.push(...e),n.units.push({kind:`Variables`,declarations:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=it();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&n.definitions.push({kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{let e=qe();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:ke()});continue;case`INSTANCE`:st(n,g(Ee(void 0,[],!1,u(o)),a));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){st(n,g(Ee(void 0,[],!0,u(o)),a));continue}st(n,we(!0));continue}o.kind===`Keyword`&&gc.has(o.text)?rt(n):st(n,we(!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()},Ac=e=>kc(e,!1),jc=e=>kc(e,!0),Mc=25214903917n,Nc=(1n<<48n)-1n,Pc=2147483647,Fc=e=>{let t={value:(BigInt.asUintN(64,e)^Mc)&Nc},n=e=>(t.value=t.value*Mc+11n&Nc,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Mc)&Nc},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<=Pc)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Ic=10454148508367108822n,Lc=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Ic);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Rc=Int32Array.from(Lc,e=>Number(BigInt.asIntN(32,e>>32n))),zc=Int32Array.from(Lc,e=>Number(BigInt.asIntN(32,e))),Bc=Number(BigInt.asIntN(32,Ic>>32n)),Vc=Number(BigInt.asIntN(32,Ic));let Hc=Bc,Uc=Vc;const Wc=e=>{let t=(e^Uc)&255;Uc=(Uc>>>8|Hc<<24)^zc[t],Hc=Hc>>>8^Rc[t]},Gc=e=>{for(let t=0;t<32;t+=8)Wc(e>>>t)},Kc=e=>{if(typeof e==`boolean`)Wc(0),Wc(e?116:102);else if(typeof e==`number`)Wc(1),Gc(e);else if(typeof e==`string`){Wc(3),Gc(e.length);for(let t=0;t<e.length;t++)Wc(e.charCodeAt(t))}else if(P(e))Wc(21),Gc(I(e.name)+1);else if(N(e)){let t=U(e);Wc(9),Gc(t.domain.length);for(let e=0;e<t.domain.length;e++)Kc(t.domain[e]),Kc(t.range[e])}else{let t=V(e).elements;Wc(5),Gc(t.length);for(let e of t)Kc(e)}},qc=e=>{let t={high:Hc,low:Uc};Hc=Bc,Uc=Vc;for(let t of e)Kc(t);let n=BigInt(Hc>>>0)<<32n|BigInt(Uc>>>0);return Hc=t.high,Uc=t.low,n},Jc=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||P(e))return 5;if(typeof e==`string`)return 5+e.length;if(N(e)){let t=U(e);return t.domain.reduce((e,n,r)=>e+Jc(n)+Jc(t.range[r]),5)}return V(e).elements.reduce((e,t)=>e+Jc(t),5)},Yc=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Hc=n<32?0:1<<n-32,Uc=n<32?1<<n:0;for(let t=0;t<e;t++)Wc(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]^Hc,t[n+1]=t[a+1]^Uc}}return t},Xc=(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=Jc(e);return Hc=0,Uc=0,Kc(e),r.set(e,i.length),i.push(n,Hc,Uc),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=Yc(e);return n.set(e,r),r};return(n,r)=>{let s={high:Hc,low:Uc},c={high:Bc,low:Vc};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}Hc=s.high,Uc=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},Zc=[],Qc=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},$c=()=>{for(let e=1277011;Zc.length<1341;e++)Qc(e)&&Zc.push(e);return Zc},el=e=>{let t=$c(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},tl=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},nl=e=>{for(let t=Math.max(e,9);;t++){let e=tl(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)}}},rl=(e,t,n)=>{if(t<=0)return[];let r=nl(t),i={index:BigInt(n.nextInt(t))},a=BigInt(el(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},il=(1n<<63n)-1n-24n,al=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(il*BigInt(n)+i)%t;return r<0n?r+t:r})},ol=(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,sl=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=jt(e.domain),n=V(e.range).elements;return{lists:t.map(()=>n),create:e=>R(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>V(e).elements),create:t=>Nt(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>V(e).elements),create:z}}},cl=(e,t,n)=>{if(H(t))return[];if(typeof t==`object`&&t.kind===`Interval`)return rl(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let r=sl(t);if(r){let t=r.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Pc)?al(e,t,n):rl(e,Number(t),n)).map(e=>r.create(ol(r.lists,e)))}let i=V(t).elements;return rl(e,i.length,n).map(e=>i[Number(e)])},ll=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new h(`RandomElement of the empty set`);return n},ul=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...jt(e.domain)];return R(n,n.map(()=>ul(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Nt(e.names.map((n,r)=>[n,ul(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return z(e.factors.map(e=>ul(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new h(`RandomElement of the empty set`);return e.low+r}return ll(V(e).elements,t)},dl=(e,t=0n)=>{let n=Fc(t),r={random:Fc(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Nt([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:qc,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},fl=e=>Ct([...e.possibleCounts].map(([e,t])=>[e,t])),pl=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,fl(e)]]),ml=(e,t,n)=>new g(`Applying ${e} to the following value,\nwhich is not ${t}:\n${W(n)}`),hl=(e,t,n,r)=>new g(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${W(r)}`),gl=e=>N(e)?U(e):void 0,_l=(e,t,n)=>{let r=K(e,t,n),i=gl(r);if(!i)throw ml(n,`a function with a finite domain`,r);return i},vl=(e,t,n)=>{let r=K(e,t,n),i=gl(r);if(!i)throw hl(t===0?`first`:`second`,n,`bag`,r);return i},yl=(e,t)=>{if(!M(e)||!B(e))throw t();return V(e).elements},bl=e=>e.range.every(e=>typeof e==`number`&&e>0),xl=(e,t)=>{let n=e.domain.findIndex(e=>He(e,t));return n===-1?void 0:e.range[n]},Sl=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Cl=Sl(`BagDiff`,`tlc2.value.impl.Value`,2),wl=Sl(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Tl=Sl(`BagUnion`,`tlc2.value.impl.Value`,1),El=Sl(`BagOfAll`,`tlc2.value.impl.Value`,2),Dl=Sl(`BagCup`,`tlc2.value.impl.Value`,2),Ol=Sl(`BagCardinality`,`tlc2.value.impl.IntValue`,1),kl=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${hr(e)}`;throw _r(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')`)},Al=(e,t,n)=>{let r=kl(e,n)+kl(t,n);if(ur(r))throw dr(`${e}+${t}`);return r},jl=(e,t,n,r)=>{let i=xl(n,e.domain[t]),a=kl(e.range[t],r);return i===void 0?a:a-kl(i,r)|0},Ml=(e,t)=>Ct(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>He(e[0],r));a?a[1]=Al(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Nl=R([],[]),Pl=[or(`EmptyBag`,Nl),q(`IsABag`,1,e=>{let t=gl(K(e,0,`IsABag`));return t!==void 0&&bl(t)}),q(`BagCardinality`,1,e=>{let t=K(e,0,`BagCardinality`);return _l(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw ml(`BagCardinality`,`a bag`,t);return Al(e,n,Ol)},0)}),q(`BagIn`,2,e=>{let t=K(e,1,`BagIn`),n=xl(_l(e,1,`BagIn`),K(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw hl(`second`,`BagIn`,`bag`,t);return n>0}),q(`CopiesIn`,2,e=>{let t=K(e,1,`CopiesIn`),n=xl(_l(e,1,`CopiesIn`),K(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw hl(`second`,`CopiesIn`,`bag`,t);return n}),q(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=vl(e,t,`(+)`);if(!bl(n))throw hl(t===0?`first`:`second`,`(+)`,`bag`,K(e,t,`(+)`));return n});return Ml(t,Dl)}),q(`\\ominus`,2,e=>{let t=vl(e,0,`(-)`),n=vl(e,1,`(-)`);return Ct(t.domain.flatMap((e,r)=>{let i=jl(t,r,n,Cl);return i>0?[[e,i]]:[]}))}),q(`BagUnion`,1,e=>{let t=K(e,0,`BagUnion`),n=yl(t,()=>ml(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??Nl;let r=n.map(e=>{let n=gl(e);if(!n)throw new g(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${W(t)}`);return n});return Ml(r,Tl)}),q(`\\sqsubseteq`,2,e=>{let t=_l(e,0,`\\sqsubseteq`),n=_l(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>jl(t,r,n,wl)<=0)}),sr(`BagOfAll`,2,e=>{let t=ar(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new g(`The first argument of BagOfAll should be an operator, but instead it is:\n${W(t.literalBody)}`);let n=K(e,1,`BagOfAll`),r=gl(n);if(!r)throw hl(`second`,`BagOfAll`,`function with a finite domain`,n);return Ml(r.domain.map((e,n)=>R([t.call([e])],[r.range[n]])),El)}),q(`SubBag`,1,e=>{let t=K(e,0,`SubBag`);if(!N(t))throw new h(`DOMAIN expects a function but received ${W(t)}`);let n=U(t),r=_t(n.range).elements,i=r.find(e=>typeof e!=`number`);if(i!==void 0){let e=typeof r[0]!=`number`;throw new h(`The ${e?`first`:`second`} argument of >= should be an integer, but instead it is:\n${W(e?r[0]:i)}`)}let a=n.range.filter(e=>typeof e==`number`);if(a.some(e=>e<1))throw new h(`Attempted to apply a function to ${W(n)}, which is not in its domain`);return _t(n.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:a[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>R(e.map(e=>e[0]),e.map(e=>e[1]))))}),q(`BagToSet`,1,e=>vn(_l(e,0,`BagToSet`))),q(`SetToBag`,1,e=>{let t=K(e,0,`SetToBag`),n=yl(t,()=>ml(`BagToSet`,`a function with a finite domain`,t));return R([...n],n.map(()=>1))})],Fl=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Il=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Ll=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Rl=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,zl=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Bl=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Vl=e=>{if(!N(e))return!1;let t=U(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Hl=(e,t)=>_r(e,`Cannot convert value: unsupported value type tlc2.value.impl.${hr(t)}`),Ul=(e,t)=>_r(e,`Cannot cast tlc2.value.impl.${hr(t)} to tlc2.value.impl.StringValue`),Wl=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Gl=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Hl(t,e);return`[${V(e).elements.map(e=>ql(e,t)).join(`,`)}]`},Kl=(e,t)=>{let n=U(e),r=en(n);return r?`[${r.map(e=>ql(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Wl(typeof e==`string`?e:W(e))}:${ql(n.range[r],t)}`).join(`,`)}}`},ql=(e,t)=>typeof e==`string`?Wl(e):typeof e==`object`?e.kind===`ModelValue`?Wl(e.name):M(e)?Gl(e,t):Kl(e,t):String(e),Jl=e=>{if(M(e))return Gl(e,Fl);if(!N(e)||Vl(e))throw Hl(Fl,e);return Kl(e,Fl)},Yl=e=>{if(!N(e))throw Hl(Il,e);return Kl(e,Il)},Xl=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))},Zl=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return je(e);if(Array.isArray(e))return z(e.map(e=>Zl(e,t)));if(typeof e==`object`&&e)return Nt(Object.entries(e).map(([e,n])=>[je(e),Zl(n,t)]));throw _r(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Ql=(e,t)=>{if(e.trim()===``)return Zl(null,t);try{return Zl(JSON.parse(e,(e,t,n)=>typeof t==`number`?Xl(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?_r(t,e.message):e}},$l=(e,t)=>{if(typeof e!=`string`)throw Ul(t,e);return e},eu=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw _r(n,`${t} (No such file or directory)`);return r},tu=e=>[cr(`ToJson`,1,e=>je(ql(K(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),cr(`ToJsonArray`,1,e=>je(Jl(K(e,0,`ToJsonArray`)))),cr(`ToJsonObject`,1,e=>je(Yl(K(e,0,`ToJsonObject`)))),cr(`JsonSerialize`,2,t=>{let n=$l(K(t,0,`JsonSerialize`),Ll),r=K(t,1,`JsonSerialize`);if(!en(r)&&!Vl(r))throw new g(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${W(r)}`);return e.writeFile?.(n,ql(r,Ll)),!0}),cr(`ndJsonSerialize`,2,t=>{let n=$l(K(t,0,`ndJsonSerialize`),Rl),r=K(t,1,`ndJsonSerialize`),i=en(r);if(!i)throw new g(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${W(r)}`);return e.writeFile?.(n,i.map(e=>`${ql(e,Rl)}\n`).join(``)),!0}),cr(`JsonDeserialize`,1,t=>{let n=$l(K(t,0,`JsonDeserialize`),zl);return Ql(eu(e,n,zl),zl)}),cr(`ndJsonDeserialize`,1,t=>{let n=$l(K(t,0,`ndJsonDeserialize`),Bl);return z(eu(e,n,Bl).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Ql(e,Bl)))})],nu=(e,t,n,r)=>new g(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),ru=(e,t,n)=>{if(typeof e!=`number`||e<0)throw nu(t,n,`nonnegative integer`,W(e));return e},iu=(e,t,n,r)=>{if(!M(e)||!B(e))throw nu(t,n,r,W(e));return V(e).elements},au=(e,t,n,r)=>_t(Array.from({length:t},()=>_t(e.filter(()=>r.nextDouble()<n)))),ou=(e,t)=>{let n=`RandomSetOfSubsets`,r=ru(K(e,0,n),`first`,n),i=ru(K(e,1,n),`second`,n),a=iu(K(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw nu(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw nu(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return au(a,r,a.length===0?0:i/a.length,t.getRandom())},su=e=>[cr(`RandomSubset`,2,t=>{let n=K(t,0,`RandomSubset`);if(typeof n!=`number`)throw nu(`first`,`RandomSubset`,`nonnegative integer`,W(n));if(n<0)throw new h(`Attempted to apply the operator overridden by the Java method\npublic static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value),\nbut it produced the following error:\n${n}`);let r=K(t,1,`RandomSubset`);if(!M(r)||!H(r)&&!B(r))throw nu(`second`,`RandomSubset`,`a finite set`,W(r));return _t(cl(n,r,e.getRandom()))}),cr(`RandomSetOfSubsets`,3,t=>ou(t,e)),cr(`TestRandomSetOfSubsets`,3,t=>z(Array.from({length:5},()=>V(ou(t,e)).elements.length)))],cu=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,lu=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${cu})`,uu=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${cu}) throws java.io.IOException`,du=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${cu})`,fu=()=>Nt([[`action`,_t([])],[`state`,_t([])]]),pu=()=>Nt([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),mu=e=>Nt([[`name`,e??`UnnamedAction`],[`location`,pu()]]),hu=(e,t)=>{let n=e.map((e,t)=>z([t+1,Nt(Object.entries(e.state))])),r=n.slice(1).map((t,r)=>z([n[r],mu(e[r+1].action),t])),i=t?[z([n[n.length-1],mu(t.action),n[t.start]])]:[];return Nt([[`action`,_t([...r,...i])],[`state`,_t(n)]])},gu=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return pl(e).get(t)},_u=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),W(r));else throw new g(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${W(n)}`)},vu=e=>e.every(e=>e!==void 0),yu=(e,t)=>Nt(t.variables.map((t,n)=>[t,e[n]])),bu=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!G(e)){if(t.variableIndex.has(r))return!0;let e=mo(r,t);if(e&&!n.has(e)&&(n.add(e),bu(e.body,t,n)))return!0}return qn(e).some(e=>bu(e,t,n))},xu=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[q(`AssertEq`,2,t=>{let n=K(t,0,`AssertEq`),r=K(t,1,`AssertEq`),i=He(n,r);return i||(e(W(`Assertion failed`,!0)),e(W(n,!0)),e(W(r,!0))),i}),wr(`AssertError`,2,e=>{let t=ar(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw _r(lu,`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=Tr(e,0,`AssertError`)();try{Tr(e,1,`AssertError`)()}catch(e){if(e instanceof h)return e.message===n;throw e}return!1}),cr(`TLCGetOrDefault`,2,e=>{let n=K(e,0,`TLCGetOrDefault`);return gu(t,n)??K(e,1,`TLCGetOrDefault`)}),{...sr(`TLCGetAndSet`,4,n=>{let r=K(n,0,`TLCGetAndSet`),i=gu(t,r)??K(n,3,`TLCGetAndSet`),a=ar(n,1,`TLCGetAndSet`);return _u(t,e,r,a.call([i,K(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},cr(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!vu(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw _r(uu,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return z(t.getBehavior(r).map(e=>yu(e,n.environment)))}),cr(`CounterExample`,0,()=>t.counterExample??fu()),q(`ToTrace`,1,e=>{let t=K(e,0,`ToTrace`);if(!N(t)||!He(vn(t),_t([`action`,`state`])))throw new h(`The argument of ToTrace should be a CounterExample, but instead it is:\n${W(t)}`);let n=V(gn(t,`state`)).elements.map(e=>en(e)??[]);return z(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),q(`TLCModelValue`,1,e=>{let t=K(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new g(`The argument of ModelValue should be a string, but instead it is:\n${W(t)}`);return Be(t)}),wr(`TLCDefer`,1,()=>!0),q(`TLCNoOp`,1,e=>K(e,0,`TLCNoOp`)),wr(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!vu(r))throw _r(du,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||po(Tr(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new b(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),wr(`TLCCache`,2,(e,t)=>{let r=ar(e,0,`TLCCache`),a=In(Tr(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=bu(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,qc([K(e,0,`TLCFP`)])))),cr(`TLCEvalDefinition`,1,(e,t)=>{let n=K(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?mo(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new g(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${W(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new g(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return X({kind:`Identifier`,name:n,location:r.location},t)})]},Su=(e,t)=>[cr(`_Track`,2,e=>{let n=String(K(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,K(e,0,`_Track`)===!0?r+1:r),!0}),cr(`_Counts`,0,()=>fl(t)),cr(`_CheckName`,1,n=>{let r=String(K(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(W(fl(t),!0)),!1)}),cr(`_PrintCounts`,0,()=>(e(W(fl(t),!0)),!0))],Cu=e=>String(e).padStart(2,`0`),wu=e=>`${e.getUTCFullYear()}.${Cu(e.getUTCMonth()+1)}.${Cu(e.getUTCDate())}.${Cu(e.getUTCHours())}${Cu(e.getUTCMinutes())}${Cu(e.getUTCSeconds())}`,Tu=e=>Ct([...e].map(([e,t])=>[e,z([t])])),Eu=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Du=(e,t,n)=>{if(!e.isStarted&&Eu.has(t))throw new h(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return Nt([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Nt([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Nt([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,je(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,je(wu(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return mu(void 0);case`all`:return Tu(e.registers);case`all:named`:return Tu(pl(e))}if(t.startsWith(`s:`)){let n=pl(e).get(t);if(n===void 0)throw new h(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return je(e.properties.get(t.slice(2))??t);throw new h(`TLCGet(${t}) was undefined.`)},Ou=e=>e.length===0?[[]]:e.flatMap((t,n)=>Ou([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),ku=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&V(e).elements.forEach(ku),e.kind===`Function`&&e.range.forEach(ku))},Au=(t,n)=>[q(`Print`,2,e=>(t(`${he(W(K(e,0,`Print`),!0,!0))} ${he(W(K(e,1,`Print`),!0,!0))}`),K(e,1,`Print`))),q(`PrintT`,1,e=>(t(he(W(K(e,0,`PrintT`),!0,!0))),!0)),q(`Assert`,2,t=>{if(K(t,0,`Assert`)!==!0)throw new g(`The first argument of Assert evaluated to FALSE; the second argument was:\n${he(W(K(t,1,`Assert`)))}`,e.assertViolation);return!0}),q(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),q(`:>`,2,e=>Ct([[K(e,0,`:>`),K(e,1,`:>`)]])),q(`@@`,2,e=>{let t=ir(e,0,`@@`),n=ir(e,1,`@@`);return wt([...xe(t),...xe(n)])}),q(`ToString`,1,e=>je(W(K(e,0,`ToString`),!0))),q(`TLCEval`,1,e=>{let t=K(e,0,`TLCEval`);return ku(t),t}),q(`Permutations`,1,e=>{let t=nr(e,0,`Permutations`);return _t(Ou(t).map(e=>Ct(t.map((t,n)=>[t,e[n]]))))}),sr(`SortSeq`,2,e=>{let t=ar(e,1,`SortSeq`);return z(rr(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)]},[]))}),cr(`TLCGet`,1,(e,t)=>{let r=K(e,0,`TLCGet`);if(typeof r==`number`&&r>=0){let e=n.registers.get(r);if(e===void 0)throw new h(`TLCGet(${r}) was undefined.`);return e}if(typeof r!=`string`)throw new h(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${W(r)}`);return Du(n,r,t?.state)}),cr(`TLCSet`,2,e=>{let r=K(e,0,`TLCSet`);return _u(n,t,r,K(e,1,`TLCSet`)),!0}),or(`Any`,Ie),q(`RandomElement`,1,e=>ul(er(e,0,`RandomElement`),n.getRandom()))],ju=/* @__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(`,`),Mu=[[`\\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`,`≀`],[`^+`,`⁺`]],Nu=/* @__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(`,`),Pu=/* @__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(`.`),Fu=/* @__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(`.`),Iu=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
149
|
+
=============================================================================`,Sd=/* @__PURE__ */ new Map([[`Reals`,yd],[`RealTime`,bd],[`Toolbox`,xd]]),Cd=`tlc2/value/impl/`,wd=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},Td=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Ed=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Dd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Td.get(e[3])}${`[]`.repeat(e[1].length)}`),Od=(e,t)=>e[e[t].first].text,kd=(e,t)=>Od(e,t).replaceAll(`/`,`.`),Ad=e=>{let t=wd(e);if(t.readUint32()!==3405691582)throw new u(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===1?a.text=i.decode(t.readBytes(t.readUint16())):r===3?a.value=t.readInt32():r===4?t.readUint32():r===5||r===6?(t.readBytes(8),e++):r===7||r===8||r===16||r===19||r===20?a.first=t.readUint16():r===15?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=kd(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=Dd(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:wd(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>kd(n,d.readUint16())):[],p=Ed.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Dd(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},jd=(e,t)=>{let n=e[t],r=e[n.second];return{className:Od(e,n.first),name:e[r.first].text}},Md=(e,t,n,r)=>{let i=()=>new ie(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===3)return n.value;if(n.tag===8)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=2&&n<=8)o.push(n-3),e+=1;else if(n===16)o.push(a[e+1]<<24>>24),e+=2;else if(n===17)o.push(l()<<16>>16),e+=3;else if(n===18)o.push(c(a[e+1])),e+=2;else if(n===19)o.push(c(l())),e+=3;else if(n===89){let t=s();o.push(t,t),e+=1}else if(n===178){let n=jd(t,l());if(n.className!==`${Cd}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===184){let n=jd(t,l()),a=s();if(n.className!==`${Cd}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===187)o.push({className:Od(t,l()),value:void 0}),e+=3;else if(n===183){let n=jd(t,l()),a=s(),o=s();if(!(n.className===`${Cd}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===176){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},Nd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Ad(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:Md(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},Pd=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),Fd=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],Id=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),Ld=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),Rd=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),zd=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
97
150
|
Nat == { }
|
|
98
151
|
a+b == {a, b}
|
|
99
152
|
a-b == CHOOSE n : b + n = a
|
|
@@ -409,16 +462,18 @@ _CheckName(name) ==
|
|
|
409
462
|
=> (PrintT(counts) /\\ FALSE)
|
|
410
463
|
_PrintCounts == PrintT(_Counts)
|
|
411
464
|
=============================================================================
|
|
412
|
-
`]]),Lu=/* @__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)`]])]]),Ru=(e,t)=>e.every(e=>rn(e,t)),zu=_t([!1,!0]),Bu=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return St(Bu(e,t,r),Bu(e,r,n))},Vu=[`\\cup`,`\\cap`,`\\`],Hu=e=>typeof e==`object`&&e.kind===`MixedSet`,Uu=e=>e.kind===`Interval`?V(e).elements:e.elements,Wu=(e,t,n)=>{let r=Uu(t);if(e!==`\\cup`){let t=e===`\\cap`;return vt(r.filter(e=>rn(e,n)===t))}if(r.length===0)return n;if(!ge(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=V(n).elements.filter(e=>!rn(e,t));return vt([...r,...i])},Gu=[or(`TRUE`,!0),or(`FALSE`,!1),or(`BOOLEAN`,zu),or(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),lr(`=`,ht),lr(`#`,(e,t)=>!ht(e,t)),q(`~`,1,e=>!Qn(e,0,`~`)),q(`<=>`,2,e=>Qn(e,0,`<=>`)===Qn(e,1,`<=>`)),q(`/\\`,2,e=>Qn(e,0,`/\\`)&&Qn(e,1,`/\\`)),q(`\\/`,2,e=>Qn(e,0,`\\/`)||Qn(e,1,`\\/`)),q(`=>`,2,e=>!Qn(e,0,`=>`)||Qn(e,1,`=>`)),q(`\\in`,2,e=>rn(K(e,0,`\\in`),K(e,1,`\\in`))),q(`\\notin`,2,e=>!rn(K(e,0,`\\notin`),K(e,1,`\\notin`))),q(`\\subseteq`,2,e=>{let t=$n(e,0,`\\subseteq`),n=$n(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&B(t.base)?Ru(V(t.base).elements,n.base):Ru(V(t).elements,n)}),...Vu.map(e=>q(e,2,t=>{let n=$n(t,0,e),r=$n(t,1,e);return ge(n)&&ge(r)&&!Hu(n)&&!Hu(r)?e===`\\cup`&&H(n)?r:(e===`\\cup`?St:e===`\\cap`?xt:bt)(V(n),V(r)):ge(n)?Wu(e,n,r):e!==`\\`&&ge(r)?Wu(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),q(`SUBSET`,1,e=>({kind:`Subset`,base:$n(e,0,`SUBSET`)})),q(`UNION`,1,e=>{let t=$n(e,0,`UNION`),n=rt(t)?t.elements.filter(rt):[];if(!rt(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(Hu(t)||n.some(Hu)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{rn(t,e)||e.elements.push(t)})),vt(e.elements)}return n.length===0?yt:Bu(n.map(V),0,n.length)}),q(`DOMAIN`,1,e=>{let t=K(e,0,`DOMAIN`);if(!N(t))throw new h(`DOMAIN expects a function but received ${W(t)}`);return vn(t)})],Ku=br(`DotDot`,`IntervalValue`,2),qu=br(`Neg`,`IntValue`,1),Ju=[or(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),xr(`+`,`Plus`,(e,t)=>e+t),xr(`-`,`Minus`,(e,t)=>e-t),xr(`*`,`Times`,(e,t)=>e*t),xr(`^`,`Expt`,(e,t)=>{if(t<0)throw new g(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new g(`0^0 is undefined.`);return e**t}),xr(`\\div`,`Divide`,(e,t)=>{if(t===0)throw new g(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(ur(n))throw dr(`${e} \\div ${t}`);return n}),xr(`%`,`Mod`,(e,t)=>{if(t<=0)throw new g(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),Cr(`<`,(e,t)=>e<t),Cr(`>`,(e,t)=>e>t),Cr(`<=`,(e,t)=>e<=t),Cr(`>=`,(e,t)=>e>=t),q(`..`,2,e=>({kind:`Interval`,low:yr(K(e,0,`..`),Ku),high:yr(K(e,1,`..`),Ku)}))],Yu=[or(`Int`,{kind:`InfiniteSet`,name:`Int`}),q(`-.`,1,e=>{let t=yr(K(e,0,`-`),qu);if(ur(-t))throw dr(`-${t}`);return-t})],Xu=(e,t,n)=>{let r=K(e,t,n),i=en(r);if(!i)throw new g(`${n}\n${W(r)}`);return i},Zu=(e,t,n)=>{let r=K(e,t,n);return typeof r==`string`?r:Xu(e,t,n)},Qu=(e,t,n)=>typeof e==`string`?je(e.slice(t,n)):z(e.slice(t,n)),$u=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,ed=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,td=(e,t)=>{let n=Lu.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?vr(e,t):e}):t},nd=td(`Sequences`,[q(`Seq`,1,e=>({kind:`SequenceSet`,base:K(e,0,`Seq`)})),q(`Len`,1,e=>Zu(e,0,$u(``,`Len`)).length),q(`\\o`,2,e=>{let t=Zu(e,0,ed(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Xu(e,1,ed(`t \\o s`,`sequence`));return z([...t,...n])}let n=K(e,1,`\\o`);if(typeof n!=`string`)throw new g(`${ed(`t \\o s`,`string`)}\n${W(n)}`);return je(t+n)}),q(`Append`,2,e=>z([...Xu(e,0,ed(`Append(s, v)`,`sequence`)),K(e,1,`Append`)])),q(`Head`,1,e=>{let t=Xu(e,0,$u(``,`Head`));if(t.length===0)throw new g(`Attempted to apply Head to the empty sequence.`);return t[0]}),q(`Tail`,1,e=>{let t=Zu(e,0,$u(``,`Tail`));if(t.length===0)throw new g(`Attempted to apply Tail to the empty sequence.`);return Qu(t,1)}),q(`SubSeq`,3,e=>{let t=Zu(e,0,$u(`first `,`SubSeq`)),n=Zn(e,1,`SubSeq`),r=Zn(e,2,`SubSeq`);if(n>r)return Qu(t,0,0);let i=n<1?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new g(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${W(K(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Qu(t,n-1,r)}),sr(`SelectSeq`,2,e=>{let t=ar(e,1,`SelectSeq`);return z(Xu(e,0,$u(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new g(`The second argument of SelectSeq should be a operator, but instead it is:\n${W(n)}`);return n}))})]),rd=td(`FiniteSets`,[q(`IsFiniteSet`,1,e=>{let t=K(e,0,`IsFiniteSet`);if(M(t))return Qt(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new h(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${W(t)}\nis a finite set.`:`Attempted to check if the ${_e(t)} ${W(t)} is a finite set.`)}),q(`Cardinality`,1,e=>{let t=K(e,0,`Cardinality`);if(!M(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new g(`Attempted to compute cardinality of the value\n${W(t)}`);return Xt(t)})]),id=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),ad=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:Ju};case`Integers`:return{extends:[`Naturals`],operators:Yu};case`Sequences`:return{extends:[],operators:nd};case`FiniteSets`:return{extends:[],operators:rd};case`TLC`:return{extends:[],operators:td(`TLC`,Au(t,n))};case`Randomization`:return{extends:[],operators:su(n)};case`_Possible`:return{extends:[],operators:Su(t,n)};case`Json`:return{extends:[],operators:tu(r)};case`Bags`:return{extends:[],operators:Pl};case`TLCExt`:return{extends:[],operators:xu(t,n)};default:return}},od=`$subexpression`,sd=(e,t)=>new p(`${e} at line ${t.line}, column ${t.column}`),cd=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),ld=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,ud=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},dd=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Jr(e.bounds),body:e.body,sets:cd(e.bounds)};case`SetMap`:return{names:Jr(e.bounds),body:e.expression,sets:cd(e.bounds)};case`SetFilter`:return{names:qr(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:qr(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}},fd=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return fd(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of qn(e)){let e=fd(r,t,n);if(e)return e}},pd=(e,t,n)=>e.length===0&&n.length>0?n.splice(0,t):e,md=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),hd=(e,t)=>{let n=e.location,r=md(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 sd(`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 sd(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:od,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:od,args:e.args,location:n,resolution:Lr},location:n}},gd=(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:Lr})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Lr}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Lr};return hd({...t,params:[...t.params,...r]},a)},_d=(e,t,n,r)=>{let i={params:[],args:[],lets:[],location:n},a={index:0,current:void 0},o=i=>{let o=[],s=[];for(;a.index<e.length;){let c=e[a.index];if(c.kind!==`Name`)throw sd(`Expected an operator name`,n);o.push(c.name),s.push(...c.args);let l=o.join(`!`),u=i?i.find(e=>Ai(e)===l):t(l);if(u)return{definition:u,args:pd(s,Hr(u),r)};a.index++}throw sd(`Unknown operator ${o.join(`!`)}`,n)},s=t=>{let r=o(t),s=r.definition,c=Hr(s),l=a.index===e.length-1;if(r.args.length!==c&&r.args.length!==0)throw sd(`The operator ${s.name} requires ${c} arguments`,n);if(l)return{definition:s,args:r.args};if(s.kind!==`Operator`)throw sd(`Cannot select a subexpression of ${s.name}`,n);i.params.push(...s.params),i.args.push(...r.args),a.current=s.body,a.index++},c=()=>{for(;a.index<e.length;){let t=e[a.index];if(t.kind!==`Name`)return;let o=a.current&&fd(a.current,t.name,[]);if(!o)throw sd(`Cannot find label ${t.name}`,n);i.lets.push(...o.lets),i.params.push(...o.label.params.map(e=>({name:e,arity:0}))),i.args.push(...pd(t.args,o.label.params.length,r)),a.current=o.label.body,a.index++}},l=t=>{let o=a.current;if(!o)throw sd(`Subexpression selection failed`,n);if(t.kind===`Colon`)return;if(o.kind===`Label`){a.current=o.body,l(t);return}if(o.kind===`Let`){if(t.kind!==`Operand`||ld(t.operand,1)!==0)throw sd(`A LET/IN expression has only one operand`,n);i.lets.push(o.definitions),a.current=o.body;return}let s=dd(o);if(s&&(t.kind===`Bound`||t.kind===`At`)){i.params.push(...s.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&i.args.push(...pd(t.args,s.names.length,r)),a.current=s.body;return}if(o.kind===`Case`&&t.kind===`Operand`){let r=[...o.arms,...o.other?[{condition:void 0,body:o.other}]:[]],i=r[ld(t.operand,r.length)],s=e[a.index+1];if(!i||s?.kind!==`Operand`)throw sd(`A subexpression of CASE must have the form !i!j`,n);a.index++;let c=ld(s.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw sd(`Nonexistent CASE operand`,n);a.current=l;return}if(t.kind!==`Operand`)throw sd(`Unexpected subexpression selector`,n);let c=s?s.sets:ud(o),u=c?.[ld(t.operand,c.length)];if(!u)throw sd(`Nonexistent operand specified by the selector`,n);a.current=u},u=s(void 0);if(u)return gd(u.definition,{...i,args:u.args});for(c();a.index<e.length;){let t=e[a.index];if(t.kind===`Name`){for(;a.current?.kind===`Label`;)a.current=a.current.body;if(a.current?.kind!==`Let`)throw sd(`A name selector here must be from a LET clause`,n);i.lets.push(a.current.definitions);let e=s(a.current.definitions);if(e)return gd(e.definition,{...i,args:[...i.args,...e.args]});c()}else l(t),a.index++}if(!a.current)throw sd(`Subexpression selection failed`,n);return hd(i,a.current)},vd=(e,t)=>{if(!e.includes(`!`)||t(e))return;let n=e.split(`!`),r=n.findIndex((e,r)=>t(n.slice(0,r+1).join(`!`)));if(r!==-1)return[{kind:`Name`,name:n.slice(0,r+1).join(`!`),args:[]},...n.slice(r+1).map(e=>({kind:`Name`,name:e,args:[]}))]},yd=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||qn(e).some(yd),bd=(e,t)=>{if(!yd(e))return e;if(e.kind===`Let`){let n=n=>e.definitions.find(e=>e.name===n)??t(n);return Ni(e,e=>bd(e,n))}let n=Ni(e,e=>bd(e,t));if(n.kind===`Subexpression`)return _d(n.selectors,t,n.location,[]);let r=n.kind===`Identifier`?n.name:n.kind===`Apply`?n.operator:``,i=vd(r,t);if(!i)return n;let a=n.kind===`Apply`?[...n.args]:[],o=_d(i,t,n.location,a);if(a.length>0)throw sd(`Too many arguments for ${r}`,n.location);return o},xd=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Sd=(e,t)=>{let n=xd(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({name:e.name,expression:bd(e.expression,n)}))}},Cd=(e,t)=>{let n=xd([...t,...e.definitions]);return e.definitions.some(e=>yd(e.body))||e.assumptions.some(e=>yd(e.expression))?{...e,definitions:e.definitions.map(e=>Mi(e,e=>bd(e,n))),assumptions:e.assumptions.map(e=>({...e,expression:bd(e.expression,n)}))}:e},wd=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}])),Td=(e,t)=>`${e}${t}`,Ed=(e,t,n)=>`${e}${t}${n}`,Dd=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Od=(e,t,n)=>`${e},${t},${n}`,kd=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Ad=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),jd=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Md=(e,t,n,r)=>({...kd(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Nd=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Pd=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Fd=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,{...Md(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Id=Md(`$Set`,0,[2],[1]),Ld=Md(`$Junction`,0,[3],[1]),Rd=Md(`$Choose`,0,[2],[1]),zd=Md(`$Function`,0,[3],[1]),Bd=Md(`$FcnApply`,0,[2,2],[1,1]),Vd=Md(`$RcdSelect`,0,[2,0],[1,1]),Hd=Md(`'`,2,[1],[0]),Ud=Md(`ENABLED`,1,[2],[0]),Wd=Md(`[]`,3,[3],[0]),Gd=Md(`$SquareAct`,2,[2,1],[0,0]),Kd=Md(`$WF`,3,[1,2],[0,0]),qd=Md(`$TemporalExists`,3,[3],[0]),Jd=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Yd=e=>e.map(e=>({name:e,arity:0})),Xd=(e,t)=>new p(`${e} at line ${t.line}, column ${t.column}`),Zd=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Qd=e=>e.kind!==`Let`&&e.kind!==`Label`,$d=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:_(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i)return{kind:`Defined`,levels:_(i,/* @__PURE__ */ new Map)};let a=Fd.get(t)??wd.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=kd(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(Ed(e,n,t))}),t.data.constraints.forEach((e,t)=>Ad(r.constraints,t,e)),jd(r.argConstraints,Td(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>jd(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>Nd(e,n))throw new p(`Level error in applying operator ${e.name}: The level of argument ${n+1} exceeds the maximum level allowed by the operator.`)}),n.some(e=>e.level>2))throw new p(`Level error in applying operator ${e.name}: The level of the range for a bounded variable exceeds the maximum level allowed by the operator.`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(Od(t,n,r)),s=kd(Math.max(e.level,...t.filter((t,n)=>Pd(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)=>{Pd(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)=>Ad(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Ad(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Ad(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Ad(s.constraints,t,Nd(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=>Ad(s.constraints,e,Nd(r,a)))}))}),e.argParams.forEach(e=>{let t=Dd(e),n=a(t.operator)?.operator;n&&Ad(s.constraints,t.param,Nd(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>jd(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>jd(s.argConstraints,Td(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&jd(s.argConstraints,Td(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Dd(e),n=a(t.operator);n&&jd(s.argConstraints,Td(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Dd(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Dd(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(Ed(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(Ed(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(Ed(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=g(`LAMBDA`,Yd(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=kd();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=Jd(n,Yd(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 Xd(`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 Xd(`Action used where only temporal formula or state predicate allowed`,e.location);Zd.has(e.operator)&&l(t,e.location)},d=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Qd(n)&&n.kind!==r)throw Xd(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e.location)},f=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=_(e,n);t.constraints.forEach((e,t)=>Ad(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>jd(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return kd();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return u(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return l(n,e.location),i(Ld,n)}case`Prime`:case`Unchanged`:return s(Hd,[e.expression],t);case`Enabled`:return s(Ud,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return d(e,n.data.level),i(Wd,[n])}case`If`:return s(Ld,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Ld,[...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(Ld,[e.body],t,e.bounds.map(e=>e.set),Jr(e.bounds));if(n.level===3&&e.bounds.some(e=>m(e.set,t).level===2))throw Xd(`Action-level bound of quantified temporal formula`,e.location);return n}case`UnboundedQuantifier`:return s(e.isTemporal?qd:Ld,[e.body],t,[],e.names);case`Choose`:return s(Rd,[e.body],t,e.set?[e.set]:[],qr(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(Id,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(Id,[e.predicate],t,[e.bound.set],qr(e.bound.pattern));case`SetMap`:return s(Id,[e.expression],t,e.bounds.map(e=>e.set),Jr(e.bounds));case`FunctionConstruction`:return s(zd,[e.body],t,e.bounds.map(e=>e.set),Jr(e.bounds));case`Record`:return s(zd,e.fields.map(e=>e.value),t);case`RecordSet`:return s(Id,e.fields.map(e=>e.value),t);case`Except`:return s(Id,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Bd,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(Id,e.args,t)}]);case`FieldAccess`:return i(Vd,[a(e.record,t),{data:kd()}]);case`BoxAction`:case`AngleAction`:return s(Gd,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(Kd,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return kd()}},h=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>h(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return qn(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Jd(t,Yd(e.names))),i;default:return Ni(e,(e,n)=>(a(e,r,Jd(t,Yd(n))),e)),i}},g=(e,t,n,r)=>{let i=Jd(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=h(n,i),c={...kd(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(Td(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(Ed(e.name,n,t.name))).map(e=>Od(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(Dd(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Dd(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},_=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...kd(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=g(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:_,toOperand:a}},ef=(e,t,n)=>{let r=new Map(t);e.assumptions.forEach(e=>{e.kind===`NewSymbol`?(e.set&&n.analyze(e.set,r),r.set(e.name,{kind:`Formal`,arity:e.arity})):e.kind===`AssumeProve`?ef(e,r,n):n.analyze(e,r)}),n.analyze(e.conclusion,r)},tf=(e,t)=>{let n=$d(t);e.definitions.filter(e=>!e.name.includes(`!`)).forEach(e=>n.analyzeDefinition(e,/* @__PURE__ */ new Map)),e.assumptions.forEach(e=>n.analyze(e.expression,/* @__PURE__ */ new Map)),e.theorems.forEach(e=>e.statement.kind===`AssumeProve`?ef(e.statement,/* @__PURE__ */ new Map,n):n.analyze(e.statement,/* @__PURE__ */ new Map))},nf=(e,t)=>e.maxLevels[t]??3,rf=(e,t)=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=$d({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Ad(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Ad(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>jd(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Dd(e);t(n.operator,n.param)&&c.argParams.add(e)})};return s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n))),a.assumptions.forEach(e=>l(o.analyze(e,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c},o=/* @__PURE__ */ new Set;if(e.forEach(e=>{let n=`at line ${e.location.line}, column ${e.location.column}`,i=e=>o.add(`${e} ${n}`),s=t(e.module),c=a(e.module),l=r(e.instancer),u=/* @__PURE__ */ new Map;e.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(t=>{let n=e.substitutions.get(t.name);if(!n)return[];if(t.arity===0){let e=l.analyze(n,u);return[{...t,level:e.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...t,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(t,n)=>`Level error in instantiating module '${e.module}': the level of the expression or operator substituted for '${t}' must be at most ${n}`;d.forEach(t=>{!c.isConstant&&t.level>t.maximumLevel&&i(f(t.name,t.maximumLevel)),t.isLeibniz||i(`Error in instantiating module '${e.module}': a non-Leibniz operator substituted for '${t.name}'`)}),d.forEach(t=>{let n=c.constraints.get(t.name);n!==void 0&&t.level>n&&i(f(t.name,n));let r=t.operator;r&&Array.from({length:t.arity},(n,a)=>{let o=c.argConstraints.get(Td(t.name,a));o!==void 0&&nf(r,a)<o&&i(`Level error in instantiating module '${e.module}': the level of the argument ${a+1} of the operator ${r.name} must be at least ${o}`)})}),c.argParams.forEach(t=>{let n=Dd(t),r=d.find(e=>e.name===n.operator)?.operator,a=d.find(e=>e.name===n.param);if(!r||!a)return;let o=nf(r,n.index);a.level>o&&i(`Level error when instantiating module '${e.module}': the level of the argument ${n.index} of the operator ${n.operator}' must be at most ${o}`)})}),o.size>0)throw new p([...o].join(`
|
|
413
|
-
`))},af=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],of=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),sf=new Map(Mu.flatMap(e=>e.map(t=>[t,e[0]]))),cf=e=>sf.get(e)??e,lf=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},uf=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(lf(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},df=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),ff=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:cf(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:cf(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}},pf=(e,t)=>{let n=[];for(let r=t;;){let t=ff(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},mf=e=>({line:e.line,column:e.column}),hf=(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=pf(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},gf=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,_f={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},vf=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&gf(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&gf(e[n+1],e[n+2])?n+=gf(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=>_f[e])}"`:r.text)}return t},yf=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},bf=(e,t)=>e.find(e=>e.name===t)??e.map(e=>bf(e.modules,t)).find(Boolean),xf=(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:Iu.get(i)??t?.(i)??Oc(e,i),s=o===void 0?[]:se(o),c=yf(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Ac(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>bf(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},Sf=(e,t,n)=>{let r=xf(e,t),i=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=pf(t,e+1);r.push({location:mf(t[e]),apply:e=>i.forEach(t=>e.put(df(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:mf(u),apply:t=>t.put(df(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&pf(t,l+1).every(e=>s.has(e))&&a(l,`definition`),of.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(mf(u)),r.push({location:mf(u),apply:e=>e.put(df(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(df(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=cf(e.name);r.push({location:e.location,apply:n=>n.put(df(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(df(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(df(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Vr(e.location,t.location)?-1:+!!Vr(t.location,e.location))},a=/* @__PURE__ */ new Map,o=e=>{let t=a.get(e??``);if(t)return t;let n=uf();a.set(e??``,n),ju.toReversed().forEach(e=>n.put(df(e,`builtin`,!1)));let s=r(e);return s.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||n.put(e)})),i(s).forEach(e=>e.apply(n)),n};return o(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse()},Cf=(e,t,n)=>{let r=xf(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)}),Nu.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=hf(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;vf(s(void 0)).forEach((e,t)=>{t===3&&Fu.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),vf(s(n)).forEach(a))}af.forEach(a);let x=/* @__PURE__ */ new Set,ee=e=>{if(x.has(e))return;x.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ee),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return ee(void 0),Pu.forEach(a),[...i]},wf=t=>{switch(t.kind){case`Number`:try{return ve(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Be(t.name);case`Set`:return _t(t.elements.map(wf))}},Tf=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],Ef=e=>new p(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Df=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Lr},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),Of=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>W(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new h(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&He(t,r)})});if(t)return t[1];throw new h(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:W(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},kf=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||qn(e).some(e=>kf(e,t)),Af=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Hi(e),n.get(e)??n.size)),n},jf=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Mf=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw oo(e);if(e.kind===`Number`&&!Xo(e.value))throw so(e);Mf(e.kind===`Let`?[...qn(e),...jf(e.instances??[])]:qn(e))}),Nf=(e,t)=>{let n=Ac(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(Gu.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,c=dl(e.checkDeadlock,t.seed),l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=[],f=/* @__PURE__ */ new Map,_=[],v=[],y=(e,t)=>_.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),b={value:0},x=e=>`${e}#${b.value++}`,ee=[],te=/* @__PURE__ */ new Map,ne=e=>{let n=s.get(e);if(n)return n;let r=ad(e,t.print,c,t.files);if(!r)return;let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>ne(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(e=>{o.set(e.name,e),i.set(e.name,{key:e.name,arity:e.arity})}),s.set(e,i),i},S=e=>{let t=ne(e);return t&&y(e,id.get(e)??[]),t},re=e=>(Mf([...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]),...jf(e.instances)]),e.modules.forEach(re),e);re(n);let C=(e,n)=>{let r=t.loadModule?.(e)??Zs.get(e)??Oc(t.source,e);if(r===void 0)throw new p(`Cannot find source file for module ${e} imported in module ${n}.`);let i=Ac(r);if(i.name!==e)throw new p(`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`);return re(i)},ie=e=>{let t=v.indexOf(e.name);if(t!==-1)throw new p(`Circular dependency among .tla files; dependency cycle is: ${[...v.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];v.push(e.name),_.push(n);let i=se(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});_.pop(),v.pop();let a=r.find(e=>n.has(e.name));if(a)throw Ef(a);return{linked:i,closure:n}},ae=(e,t)=>{let n=l.get(e);if(n)return y(e,f.get(e)??[]),n;let r=ie(C(e,t));return l.set(e,r.linked),f.set(e,r.closure),y(e,r.closure),r.linked},w=(e,t,n,o,s)=>{let c=s?void 0:S(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,n]));let l=s??ae(e.module,t.name),u=Tf(l),d=`#${b.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=Ci(Sd(e,t),u,t,n);ee.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=ea({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,Di(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=x(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:x}),h=new Set(u.map(e=>e.name)),g=/* @__PURE__ */ new Map;return l.exported.forEach((t,n)=>{if(h.has(n))return;if(e.name===void 0){let r=m.getKey(t.key);u.length>0&&te.set(r,{name:n,location:e.location}),g.set(n,{key:r,arity:t.arity});return}let r=m.getQualifiedKey(t.key);u.length>0&&te.set(r,{name:`${e.name}!${n}`,location:e.location}),g.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length})}),g},T=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Lr})),E=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:T(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),D=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),O=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=D(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:T(r,n),location:n}}},oe=(e,t,n,a)=>{let o=e.location,s=a?void 0:S(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=D(n.arity);return E(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??ae(e.module,n),l=`#${b.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Tf(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=>kf(f(e),p),h=d.map(t=>{let n=O(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=ea({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:T(e.params,o),location:o,resolution:Lr}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Lr}])),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}:Df(a,i)),i},createName:x}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=D(n.arity),a=[...e.params,...i];return E(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},k=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),se=(e,a)=>{let o=ac(e,t.loadClass?.(e.name)),s=new Map([...Gu.map(e=>[e.name,{key:e.name,arity:e.arity}]),...a.symbols]),c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,f=[],p=[...o.constants],m=o.variables.map(e=>e.name),h=o.variables.map(e=>e.location),g=(e,t)=>e.forEach((e,n)=>{s.set(n,e),t&&c.set(n,e)});o.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:S(e);if(n){g(n,!0);return}let r=t??ae(e,o.name);p.push(...r.constants.filter(e=>p.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{m.includes(e)||(m.push(e),h.push(r.variableLocations[t]))}),g(r.exported,!0),r.modules.forEach((e,t)=>l.set(t,e)),f.push(r)}),o.constants.forEach(e=>c.set(e.name,{key:e.name,arity:e.arity,declaration:`Constant`})),o.variables.forEach(e=>c.set(e.name,{key:e.name,arity:0,declaration:`Variable`}));let _=p.length===0&&m.length===0,v=e=>o===n?e.name:`${e.name}@${a.id}`,y=/* @__PURE__ */ new Map,b=e=>({imported:s,importedAt:y,definitions:new Map(e.definitions.map(e=>[e.name,e])),getKey:v}),x=()=>new Map([...a.modules,...l]),ee=e=>new Map([...s,...[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))].filter(t=>Vr(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>Vr(t.location,e)).map(e=>[e.name,{key:v(e),arity:Hr(e)}])]),te=e=>{let t=x();if(t.has(e.name))throw Ef(e);a.nested.push(e);let n=se(e,{id:`${a.id}/${e.name}`,symbols:ee(e.location),modules:t,nested:a.nested});l.set(e.name,n),u.has(e.name)||u.set(e.name,n)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=w(e,o,b(o),_,x().get(e.module));t.forEach((t,n)=>{s.has(n)||y.set(n,e.location)}),g(t,!e.isLocal)}})),...o.modules.map(e=>({location:e.location,link:()=>te(e)}))].sort((e,t)=>Vr(e.location,t.location)?-1:1).forEach(e=>e.link()),xi(o,b(o));let ne=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&Vr(e.location,t.location)},re=e=>{let t=o.modules.find(t=>t.name===e.module);return t?ne(t)?l.get(t.name):void 0:x().get(e.module)},C=Cd(ia(o,(e,t)=>oe(e,t,o.name,re(e))),k(s));wi(C,b(C)),C.definitions.forEach(e=>{let t=v(e);r.set(t,e),i.set(t,!_);let n={key:t,arity:Hr(e)};s.set(e.name,n),e.isLocal||c.set(e.name,n)}),tf(C,{constants:new Set(p.map(e=>e.name)),variables:new Set(m),getDefinition:e=>r.get(s.get(e)?.key??e)});let ie={module:C,constants:p,variables:m,variableLocations:h,visible:s,exported:c,modules:l,extended:f};return d.push(ie),ie},A=ie(n).linked,ce=e=>A.visible.get(e)?.key??e;A.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let le=[],ue=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ue(e,t)),le.push(...e.module.assumptions))};ue(A,/* @__PURE__ */ new Set);let de=A.constants.map(e=>e.name),fe=A.variables,j=e=>e.module===void 0?[e.name,ce(e.name)]:e.module===n.name||de.includes(e.name)?[]:[(l.get(e.module)??u.get(e.module))?.visible.get(e.name)?.key??e.name],pe=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:A.constants.find(t=>t.name===e)?.arity??0},me=/* @__PURE__ */ new Map,he=/* @__PURE__ */ new Set,M=(e,t)=>{o.set(e,t),r.delete(e),me.delete(e),he.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=wf(e.value);j(e).forEach(e=>{let n=pe(e);n===0?me.set(e,t):M(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let ge=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=ge.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new m(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(wf),wf(e.value)]),ge.set(t,n)}),ge.forEach(e=>j(e).forEach(t=>M(t,Of(e.name,pe(t)||e.rows[0][0].length,e.rows))));let N=new Map(e.substitutions.flatMap(e=>j(e).map(t=>[t,ce(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!de.includes(n)&&!A.visible.has(n))throw new m(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new m(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=ce(i),s=r.get(a);if(!(s!==void 0||o.has(a)||me.has(a)||de.includes(i)||fe.includes(i)))throw new m(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(A.constants.find(e=>e.name===n)?.arity??A.visible.get(n)?.arity))throw new m(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let P=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(j)),_e=(e,t)=>{if(P.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&_e(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=_e(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=E(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),A.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let ve=de.filter(e=>!me.has(e)&&!N.has(e)&&!he.has(e));if(ve.length>0)throw new m(`The constant parameter ${Sf(t.source,t.loadModule,`constant`).find(e=>ve.includes(e))??ve[0]} is not assigned a value by the configuration file.`);let ye={runtime:c,definitions:r,builtins:o,constants:me,substitutions:N,variables:fe,variableIndex:Af(fe,d.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap};rf(ee,e=>{let t=l.get(e)??u.get(e)??A;return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),getDefinition:e=>r.get(t.visible.get(e)?.key??e)}});let be=$d({constants:new Set(me.keys()),variables:/* @__PURE__ */ new Set([...fe,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>mo(e,ye)}),xe=e=>{try{X(e,{environment:ye,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof h)return e;throw e}};return N.forEach((e,t)=>{let n=r.get(e),i=de.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&be.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?xe(n.body):void 0;if(i)throw new m(`The configuration file substitutes constant ${t} with non-constant ${e}${i instanceof g?``:` - specifically: ${i.message}`}`)}),c.isStarted=!0,{environment:ye,assumptions:le,variableLocations:A.variableLocations,instanceActions:te}},Pf={kind:`Boolean`,value:!0},Ff={kind:`Boolean`,value:!1},If=e=>e?Pf:Ff,Lf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Rf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Q=(e,t)=>({kind:e,body:t}),zf=(e,t,n)=>({kind:e,operands:[t,n]}),Bf=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Bf(e,t.operands).operands:[t])}),Vf=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Vf(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Vf(t)),0)}},Hf=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 Hf(e.body);case`And`:case`Or`:return e.operands.some(Hf)}},Uf=/* @__PURE__ */ new WeakMap,Wf={count:0},Gf=e=>{let t=Uf.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`#${Wf.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Gf).join(`,`)})`;default:return`${e.kind}(${Gf(e.body)})`}})();return Uf.set(e,n),n},Kf=(e,t)=>e===t||Gf(e)===Gf(t),qf=(e,t)=>{let n=Gf(t);return e.some(e=>e===t||Gf(e)===n)},Jf=e=>e===`And`?`Or`:`And`,Yf=(e,t)=>{switch(e.kind){case`Boolean`:return t?If(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Q(`Not`,e):e;case`Not`:return Yf(e.body,!t);case`And`:case`Or`:return Bf(t?Jf(e.kind):e.kind,e.operands.map(e=>Yf(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Q(n,Yf(e.body,t))}}},Xf=e=>{switch(e.kind){case`Boolean`:return If(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Bf(Jf(e.kind),e.operands.map(Xf));case`Always`:return Q(`Eventually`,Xf(e.body));case`Eventually`:return Q(`Always`,Xf(e.body));default:return Q(`Not`,e)}},Zf=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Zf(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return If(t)}return n.length===0?If(!t):n.length===1?n[0]:Bf(e.kind,n)}case`Not`:{let t=Zf(e.body);return t.kind===`Boolean`?If(!t.value):Q(`Not`,t)}case`Always`:case`Eventually`:{let t=Zf(e.body);return Q(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Qf=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,$f=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=$f(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new h(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>Bf(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=$f(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Qf(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:Bf(`Or`,t);n.push(Q(`Always`,Q(`Eventually`,e)))}return Bf(`Or`,n)}case`Not`:return Lf(e.body)?e:$f(Xf(e.body));default:return e}},ep=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?ep(e.operands[0]):Bf(e.kind,e.operands.map(ep));case`Not`:return e.body.kind===`Not`?ep(e.body.body):Q(`Not`,ep(e.body));case`Always`:case`Eventually`:case`Next`:return Q(e.kind,ep(e.body));default:return e}},tp=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return tp(e.operands[0]);let t=Math.floor(e.operands.length/2);return zf(e.kind,tp(Bf(e.kind,e.operands.slice(0,t))),tp(Bf(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Q(e.kind,tp(e.body));default:return e}},np=(e,t)=>{e.kind===`Eventually`&&!qf(t,e)&&t.push(e),`body`in e&&np(e.body,t),`operands`in e&&e.operands.forEach(e=>np(e,t))},rp=e=>{let t=e.filter(Rf),n=e.flatMap(e=>e.kind===`Not`&&Rf(e.body)?[e.body]:[]);return!t.some(e=>qf(n,e))},ip=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,Q(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new h(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},ap=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Q(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},op=(e,t,n)=>e.flatMap(e=>{let r=ap(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),sp=e=>[...new Set(e.map(Gf))].sort().join(`|`),cp=(e,t)=>{let n=new Set(t.map(sp));return[...e.filter(e=>!n.has(sp(e))),...t]},lp=e=>{let t=ip(e),n=op(t,`Always`,`And`),r=op(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=ap(t,`Eventually`,`Or`);if(n&&!(qf(e,n.first)||qf(e,n.second)))return cp(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(qf(e,t.first)||qf(e,t.second))&&!qf(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!rp(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=ap(t[e],`Always`,`And`);n&&(qf(t,n.first)||t.push(n.first),qf(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)qf(t,e.first)&&qf(t,e.second)&&!qf(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!rp(t)?[]:i(t)};return a(e)},up=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Vf(e)<=1)}),dp=e=>{let t=lp([e]).map(up),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=sp(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 lp(n)){let n=sp(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(up(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},fp=(e,t)=>!qf(e,t)||qf(e,t.body),pp=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&Vf(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Qf(e);if(n){let e=Vf(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Hf(e))throw new h(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},mp=(e,t)=>{let n=e.findIndex(e=>Kf(e,t));return n===-1?(e.push(t),e.length-1):n},hp=e=>{let t=$f(Zf(Yf(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=ep(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])pp(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Bf(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Kf(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&tp(e.formula),n=[];t&&np(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>mp(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>mp(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>mp(i,e))}));return{tableau:t&&dp(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},gp=/* @__PURE__ */ new Set([`~>`,`-+->`]),_p=/* @__PURE__ */ new WeakMap,vp=/* @__PURE__ */ new WeakSet,yp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),bp=(t,r)=>{try{return X(t,r)}catch(t){if(!(t instanceof h)||t instanceof g)throw t;let r=o(t);throw r===void 0?n(new h(`${l}${t.message}`,t),e.error):n(t,r)}},xp=e=>new h(`TLC cannot handle the temporal formula at ${Xa(e)}`),$=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=co(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return $(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?$(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=mo(e,n);if(t)return Sp(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?+!!r.isStateLevel:void 0},o=(e,t)=>r.has(e)?0:G(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Ni(e,(e,a)=>(i.value=Math.max(i.value,$(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return gp.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Sp=(e,t)=>{let n=_p.get(e);if(n!==void 0)return n;_p.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max($(e.body,void 0,t),...r.map(e=>$(e.set,void 0,t)));return _p.set(e,i),i},Cp=`Temporal formula is a tautology (its negation is unsatisfiable).`,wp=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>wp(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,Qa(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,Tp(t,r,i));if(t.kind===`Identifier`){let a=G(t)?co(r,t.name):void 0;if(a?.kind===`Thunk`)return c(a.expression,a.scope);let o=i.constants.has(t.name)?void 0:mo(t.name,i);if(!a&&o?.kind===`Operator`&&o.params.length===0&&Sp(o,i)>0){if(s.has(o))throw n(new h(u),e.error);return c(o.body,void 0,t.name,/* @__PURE__ */ new Set([...s,o]))}}let l=yp(i,r);if(t.kind===`Apply`&&(e=>a||$(e,r,i)===3)(t)){let e=Po(t,l),n=G(t)?void 0:mo(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,Ko(e,t.args,l),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>$(e.set,r,i)===0)){let r=[],i={count:0};if(yo(t.bounds,l,e=>(i.count++,r.push(...c(t.body,e,Qa(t.body))),!1)),i.count===0)throw n(new h(Cp),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},Tp=(e,t,n)=>{let r=Jo(e.definitions,yp(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&vp.add(e.binding);return r},Ep=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),Dp=(t,r,i)=>{let a=(e,t,n)=>{let r=n===0?$(e,t,i):n;if(r===0){let n=bp(e,yp(i,t));if(typeof n!=`boolean`)throw new h(`TLC expected a boolean in the temporal formula at ${Xa(e)}`);return If(n)}return r===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},s=(t,r,i,s)=>{if(o.depth>=100)throw n(new h(u),e.error);o.depth++;let c=f(t,r);o.depth--;let l=Vf(c);return l>2?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,r=yp(i,t),a=G(e)||mo(n,i)===void 0?co(t,n):void 0;if(a?.kind===`Thunk`&&vp.has(a))return s(a.expression,a.scope,e,t);let o=a?.kind===`Operator`?a.operator:a?void 0:G(e)?Fo(n,r):Mo(n,i);if(o?.kind!==`Closure`)throw xp(e);let c=e.kind===`Apply`?e.args:[];return s(o.body,Ko(o,c,r),e,t)},l=(e,t)=>{if(!e.bounds.every(e=>$(e.set,t,i)===0))throw xp(e);let n=[];yo(e.bounds,yp(i,t),t=>(n.push(f(e.body,t)),!1));let r=e.kind===`Forall`;if(n.length===0)return If(r);let o=Bf(r?`And`:`Or`,n),s=Vf(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,Tp(e,t,i));return;case`And`:case`Or`:for(let n of e.operands)f(n,t);return;case`Apply`:if(e.operator===`=>`||e.operator===`~`&&!G(e))for(let n of e.args)f(n,t);return;case`If`:{let n=f(e.condition,t),r=n.kind===`Boolean`?[n.value?e.consequent:e.alternative]:[e.consequent,e.alternative];for(let e of r)f(e,t)}}},f=(e,t)=>{let n=$(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,Tp(e,t,i));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Q(`Always`,zf(`Or`,Q(`Not`,f(n[0],t)),Q(`Eventually`,f(n[1],t)))):e.operator===`~`&&!G(e)?Q(`Not`,f(n[0],t)):e.operator===`=>`?zf(`Or`,Q(`Not`,f(n[0],t)),f(n[1],t)):c(e,t)}case`And`:case`Or`:return Bf(e.kind,e.operands.map(e=>f(e,t)));case`Forall`:case`Exists`:return l(e,t);case`If`:{if($(e.condition,t,i)===0){let n=bp(e.condition,yp(i,t));if(typeof n==`boolean`)return f(n?e.consequent:e.alternative,t)}let n=f(e.condition,t);return zf(`Or`,zf(`And`,n,f(e.consequent,t)),zf(`And`,Q(`Not`,n),f(e.alternative,t)))}case`Always`:case`Eventually`:return Q(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=Ep(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Q(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?Q(`Always`,Q(`Eventually`,zf(`Or`,i,a))):zf(`Or`,Q(`Eventually`,Q(`Always`,i)),Q(`Always`,Q(`Eventually`,a)))}default:throw xp(e)}};return f(t,r)},Op=(e,t,n,r,i)=>{let a=e=>Op(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`?po(X(e.expression,a),`a temporal property predicate`):Ga(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&&po(X(e.unchanged,a),`a subscript`)?!1:po(X(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return Op(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new h(`TLC cannot evaluate a temporal formula in a single step`)}},kp=(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)=>kp(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 Op(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Ap=(e,t)=>e.every((e,n)=>We(e,t[n])),jp=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Mp=(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),Np=(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}},Pp=(e,t)=>(e.offsets[t]??-1)!==-1,Fp=(e,t)=>e.pending[t]??=[],Ip=(e,t)=>{let n=e.edgeOffsets[t];return e.edges.ids.subarray(n+1,n+1+e.edges.ids[n])},Lp=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,Rp=2**53-1,zp=(t,r,i,a)=>{if(t.length===0)return;let o=r.map(e=>Dp(e.expression,e.scope,i)),s=t.map(e=>Q(`Not`,Dp(e.expression,e.scope,i))),c=s.length===1?s[0]:Bf(`Or`,s),l=o.length===0?c:Bf(`And`,[...o,c]),u=hp(l);if(u.length===0)throw n(new h(Cp),e.livenessEvaluationFailure);let d=/* @__PURE__ */ new Map,f=u.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=Gf(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=!os(i),g={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},_=e=>{let t=g.states.get(e)??/* @__PURE__ */ new Map;return g.states.set(e,t),t},v=(e,t)=>{i.runtime.setLivenessSource(e);let n=t();return i.runtime.setLivenessSource(void 0),n},y=(e,t)=>Op(e,t,void 0,i,m?_(t):/* @__PURE__ */ new Map),b=(e,t,n)=>v(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!y(e,n))),x=(e,t,n,r)=>v(t,()=>{let t=e.solution.actionChecks;if(!m)return Uint8Array.from(t,e=>+!!Op(e,n,r,i,/* @__PURE__ */ new Map));let a=_(n),o=g.actions.get(n)??/* @__PURE__ */ new Map;g.actions.set(n,o);let s=o.get(r)??new Int8Array(d.size).fill(-1);return o.set(r,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!Op(t[o],n,r,i,a)),s[e]))}),ee=(e,t,n,r)=>v(n,()=>e.nodes[t].statePredicates.every(e=>y(e,r))),te=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},ne=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),S=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Np(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},re=(e,t,n)=>{let r=Mp(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),Np(i,e[t]-1,e[t+1]))}return i.slots.set([t+1,n,r],Np(i,t,n)),r},C=(e,t,n)=>t.nodes.flatMap((t,r)=>S(e,n,r)??[]).sort((e,t)=>e-t),ie=(e,t,n,r)=>{let i=e.solution.actionChecks.length,a=e.results,o=a.length;if(a.length+=r.length+n.length*i,a.length>a.bytes.length){let e=new Uint8Array(Math.max(2*a.bytes.length,a.length));e.set(a.bytes),a.bytes=e}a.bytes.set(r,o),n.forEach((e,t)=>a.bytes.set(e,o+r.length+t*i)),e.offsets[t]=o;let s=e.pending[t]??[],c=e.edges,l=c.length;if(c.length+=s.length+1,c.length>c.ids.length){let e=new Int32Array(Math.max(2*c.ids.length,c.length));e.set(c.ids),c.ids=e}c.ids[l]=s.length,c.ids.set(s,l+1),e.edgeOffsets[t]=l,e.pending[t]=void 0},ae=(e,t,n)=>{let r={slots:Array.from({length:16*p.multiplier}),count:0},i=(e,t)=>{for(let n=(a.getFingerprint(t.index)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&Ap(r.state,t.state))return!1}},o=e=>{if(r.count>=r.slots.length>>1){let e=r.slots;r.slots=Array.from({length:2*e.length+1});for(let t of e)t&&i(r.slots,t)}i(r.slots,e)&&r.count++};return n.forEach(o),o({index:e,state:t}),r.slots.length>16*p.multiplier&&p.multiplier++,r.slots.filter(e=>e!==void 0)},w=(e,t,n,r,i)=>{let o=b(e,r,n),s=t.nodes[e.nodeTableaux[i]],c=[],l=Fp(e,i),u=s.successors.length>0?x(e,r,n,n):/* @__PURE__ */ new Uint8Array;for(let a of s.successors){if(!ee(t,a,r,n))continue;if(te(t,a)&&e.errorNode===void 0&&ne(e)){e.errorNode=i;return}let o=S(e,r,a);if(o!==void 0&&l.includes(o))continue;let s=o??re(e,r,a);l.push(s),c.push(u),o===void 0&&w(e,t,n,r,s)}for(let i of a.getSuccessors(n)){let a=x(e,r,n,i.state),o=e.isDone[i.index]===!0;for(let n of s.successors){if(!ee(t,n,r,i.state))continue;let s=S(e,i.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??re(e,i.index,n);l.push(u),c.push(a),s===void 0&&o&&w(e,t,i.state,i.index,u)}}l.length>0&&ie(e,i,c,o)},T=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>ee(t,r,a,e.state)));e.isDone[a]=!0;for(let s of C(e,t,a)){let a=Fp(e,s),c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=S(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??re(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&w(e,t,n.state,n.index,d)}}),ie(e,s,c,i)}if(e.errorNode!==void 0)return jp(D(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},E=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Mp(e,e.nodeStates.length,-1);let a=Fp(e,i),o=[];t.forEach((t,r)=>{Pp(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),ie(e,i,o,r)},D=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Pp(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 Ip(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}Pp(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new h(`Couldn't re-create liveness trace (path) starting at: ${t}`)},O=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=n.stateChecks.length,a=(t,n,a)=>e.results.bytes[e.offsets[t]+i+n*r+a]===1,o=(e,n)=>t.eventuallyAlways.every(t=>a(e,n,t)),s=new Float64Array(e.nodeStates.length).fill(-1),c=e.initial.filter(t=>Pp(e,t)),l=[],u=t=>{let n=Ip(e,t).indexOf(t);return n!==-1&&o(t,n)},d=(t,r)=>n.tableau!==void 0&&fp(n.tableau.nodes[e.nodeTableaux[t]].particle,r),f=r=>{let i=l.pop()??r;if(i===r&&!u(i)){s[i]=Rp;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]=Rp,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...c].some(n=>Lp(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>Ip(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=jp(D(e,r).reverse().map(t=>e.nodeStates[t])),l=[],u=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),p=t.infinitelyOftenActions.map(()=>!1),g=n.promises.map(()=>!1),_={count:f.length+p.length+g.length},v={node:r},y=e=>i.has(e),b=e=>{l.push(v.node),v.node=e};for(;_.count>0;){let r=_.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&Lp(e,v.node,t)&&(f[n]=!0,_.count--)}),n.promises.forEach((e,t)=>{!g[t]&&d(v.node,e)&&(g[t]=!0,_.count--)}),!(_.count<=0);){let n={last:-1,unvisited:-1},i=_.count;if(Ip(e,v.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!y(r)||!o(v.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!p[t]&&a(v.node,c,e)&&(p[t]=!0,_.count--)})}return _.count<i?(b(r),u.clear(),!0):(y(r)&&!u.has(r)&&(n.unvisited=r),!1)}))break;if(_.count<r){b(n.last),u.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new h(`TLC failed to build the counterexample of a liveness property`);v.node=t,n.unvisited=Ip(e,t).find(e=>y(e)&&!u.has(e))??-1}b(n.unvisited),u.add(n.unvisited)}}let x=m(r,v.node,s,o);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let ee=c[c.length-1];return x[x.length-1]===ee&&x.pop(),{prefix:c.slice(0,-1),cycle:[ee,...x.reverse()]}},m=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of Ip(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new h(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<c.length;t++){let n=[c[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),a=n.pop()??0;if(i===-42){if(s[a]===t){let e=f(a);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(s[a]!==-1){n.push(Math.min(t,s[a]));continue}s[a]=r.link,n.push(t,a,-42),l.push(a);let u={value:r.link++};Ip(e,a).forEach((t,r)=>{Pp(e,t)&&(o(a,r)?s[t]===-1?n.push(t,-1):u.value=Math.min(u.value,s[t]):s[t]===-1&&c.push(t))}),n.push(u.value)}}};return{addInitialState:(e,t)=>{g.states.clear(),g.actions.clear();for(let n of f){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)ee(r,i,void 0,t)&&n.initial.push(S(n,e,i)??re(n,e,i))}},addState:(e,t,n)=>{g.states.clear(),g.actions.clear();let r=ae(e,t,n);for(let n of f){let i=r.map(r=>x(n,e,t,r.state)),a=b(n,e,t),o=n.solution.tableau,s=o?T(n,o,r,i,a,e):E(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of f)for(let t of e.solution.models){let n=O(e,t);if(n)return n}},getViolatedProperties:(e,n)=>[...new Set(t.filter((t,r)=>!kp(s[r].body,e,n,0,i)).map(e=>e.name))]}},Bp=`UnnamedAction`,Vp={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Hp=e=>{let t=e.range??Vp;return Nt([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Up=e=>{let t=[[`name`,e.name],[`location`,Hp(e.location)]];return e.parameters.length===0?Nt(t):Nt([...t,[`context`,Nt(e.parameters)],[`parameters`,z(e.parameters.map(e=>e[0]))]])},Wp=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),Gp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Kp=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,qp=e=>e.kind===`Apply`?e.args:[],Jp=(e,t,n)=>{let r=Kp(e);if(r===void 0)return;if(G(e)){let e=co(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=Mo(r,n);return i?.kind===`Closure`?i:void 0},Yp=(e,t)=>{try{return X(e,Gp(t,void 0)),!0}catch(e){if(e instanceof f)return!1;throw e}},Xp=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&go(e,t)&&Yp(e.body,t),Zp=(e,t)=>{let n=mo(e.name,t);return n?.body===e.body&&Xp(n,t)},Qp=(e,t)=>{if(e.kind!==`Identifier`||!G(e))return;let n=co(t,e.name);return n?.kind===`Thunk`?n:void 0},$p=(e,t)=>(e?.params??[]).flatMap(e=>{let n=co(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),em=(e,t)=>{try{return e()}catch(e){if(e instanceof f)return t();throw e}},tm=(e,t,n,r,i)=>{let a=qp(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>$(e,n,i)!==0)?o():em(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),X(e,Gp(i,n))]),expression:t,scope:n}],o)},nm=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Bp,location:e.location,parameters:$p(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return nm(e.body,Jo(e.definitions,Gp(r,t)),n,r,i);case`Label`:return nm(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>nm(e,t,n,r,i));case`Exists`:return em(()=>{let o=[];return yo(e.bounds,Gp(r,t),t=>(o.push(...nm(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=G(e)?void 0:i.get(Kp(e)??``),s=Jp(e,t,r);if(o)return tm(o,e,t,s,r);if(!s)return[a()];let c=qp(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return Zp(s,r)||c.some(e=>$(e,t,r)!==0)?l():em(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:X(n,Gp(r,t))},parent:e}),s.scope);return nm(s.body,e,s,r,i)},l)},rm=(e,t,n,r,i)=>{let a=(e,t)=>rm(e,t,n,r,i);if(e.kind===`Let`){a(e.body,Jo(e.definitions,Gp(n,t)));return}let o=Qp(e,t);if(o){a(o.expression,o.scope);return}let s=Jp(e,t,n);if(s&&Zp(s,n))return;if(s&&s.params.length===0){if($(s.body,s.scope,n)===1){r.inits.push(Wp(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,Ko(s,e.args,Gp(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(Wp(Bp,e));return}let c=$(e,t,n);c<=1?r.inits.push(Wp(Bp,e)):c===3&&r.temporals.push(Wp(Bp,e))},im=(e,t,n,r,i)=>{let a=(t,n)=>im(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Jo(t.definitions,Gp(r,n)));return}let o=Qp(t,n);if(o){a(o.expression,o.scope);return}let s=Jp(t,n,r);if(s&&Zp(s,r))return;if(s&&s.params.length===qp(t).length){a(s.body,t.kind===`Apply`?Ko(s,t.args,Gp(r,n)):s.scope);return}if(t.kind===`Forall`&&em(()=>(yo(t.bounds,Gp(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(Wp(e,a)):$(a,n,r)<2?i.invariants.push(Wp(e,a)):i.impliedTemporals.push(Wp(e,t));return}let c=$(t,n,r);c<=1?i.impliedInits.push(Wp(e,t)):c===3&&i.impliedTemporals.push(Wp(e,t))},am=(e,t)=>{let n=mo(e,t);return n?.kind===`Operator`&&!Xp(n,t)?n:void 0},om=e=>Nt([[`name`,e.name],[`location`,Hp(e.location)]]),sm=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:am(e.specification,t);a&&(rm(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...nm(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Mo(e.init,t);o?.kind===`Closure`&&r.inits.push(Wp(e.init??``,o.body));let s=e.next===void 0?void 0:Mo(e.next,t);return s?.kind===`Closure`&&r.actions.push(...nm(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=am(e,t);n&&r.invariants.push(Wp(e,n.body))}),e.properties.forEach(e=>{let n=am(e,t);n&&im(e,n.body,void 0,t,r)}),r},cm=(e,t,n)=>sm(e,t,n).actions,lm=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>W(e[1])).join(`,`)})`,um=e=>`${e.name===Bp?`Action`:e.name}${lm(e)} ${Za(e.location.range??Vp)}`,dm=e=>`${e.name}${lm(e)}`,fm=(e,t,n,r)=>{let i=sm(e,t,r),a=e=>_t(e.map(Up)),o=e=>_t(e.flatMap(e=>{let n=am(e,t);return n?[om(n)]:[]}));return Nt([[`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`,_t(t.variables.map((e,t)=>Nt([[`name`,e],[`location`,Hp(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},pm=`paired12`,mm=(e,t=16)=>e<=t*.75?t:mm(e,t*2),hm=(e,t)=>{let n=mm(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)},gm=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),_m=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),vm=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),ym=e=>vm(e).replaceAll(`
|
|
414
|
-
`,`\\n`),bm=(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(``))}},xm=(e,t)=>{let n=[`strict digraph DiskGraph {
|
|
415
|
-
|
|
416
|
-
`,
|
|
465
|
+
`]]),Bd=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),Vd=k(`EOF`),Hd=k(`IDENTIFIER`),Ud=k(`DEFBREAK`),Wd=(e,t)=>Array.from({length:k(t)-k(e)+1},(t,n)=>k(e)+n),Gd=new Set(Wd(`op_57`,`op_119`)),Kd=new Set(Wd(`op_1`,`op_119`)),qd=new Set(Wd(`op_57`,`op_70`)),Jd=/* @__PURE__ */ new Set([...Wd(`ACTION`,`EXCEPT`),k(`EXTENDS`),...Wd(`IF`,`SF`),k(`STATE`),...Wd(`THEN`,`WITH`),k(`US`),...Wd(`op_112`,`op_116`)]),Yd=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),Xd=new Map([...Yd(`postfix`,160,160,!0,`[`),...Yd(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Yd(`prefix`,120,120,!1,`-.`),...Yd(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Yd(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Yd(`prefix`,40,40,!0,`\\lnot`),...Yd(`nfix`,100,130,!0,`\\times`),...Yd(`infix`,140,140,!1,`^`,`^^`),...Yd(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Yd(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Yd(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Yd(`infix`,100,110,!0,`|`,`||`,`%%`),...Yd(`infix`,100,110,!1,`%`),...Yd(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Yd(`infix`,90,140,!1,`\\wr`),...Yd(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Yd(`infix`,90,130,!1,`!!`),...Yd(`infix`,90,90,!1,`...`,`..`),...Yd(`infix`,80,80,!0,`\\intersect`,`\\union`),...Yd(`infix`,80,80,!1,`\\`),...Yd(`infix`,70,70,!1,`<:`,`:>`),...Yd(`infix`,60,60,!0,`@@`),...Yd(`infix`,50,140,!0,`\\cdot`),...Yd(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Yd(`infix`,30,30,!0,`\\land`,`\\lor`),...Yd(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Yd(`infix`,10,10,!1,`=>`)]),Zd=new Map([...Xd,...Fd.flatMap(e=>e.slice(1).map(t=>[t,Xd.get(e[0])]))]),Qd=Zd.get(`[`),$d={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},ef=e=>({type:`tokens`,kinds:new Set(e)}),tf=e=>typeof e==`string`?e.startsWith(`<`)?ef([k(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(tf)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),nf=e=>(...t)=>({type:e,body:G(...t)}),q=nf(`zeroOrMore`),rf=nf(`oneOrMore`),J=nf(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),af=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),of=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=af(e,n);return n},sf=(...e)=>{let t=e.map(k);return e=>t.includes(of(e,1).kind)},cf=(e,t=of(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},lf=e=>{let t=of(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},uf=e=>sf(`CASESEP`)(e)&&cf(e),df=e=>{let t=of(e,1);Jd.has(t.kind)&&(t.kind=Hd)},ff=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,pf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),mf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},hf=e=>e.operatorStacks[e.operatorStacks.length-1],gf=(e,t)=>e.low>t.high,_f=(e,t)=>e.high<t.low,vf=e=>e.fix===`prefix`?e:Zd.get(`${e.name}.`),yf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Qd?pf(`FcnAppl`,[n,...r.node.heirs]):pf(`PostfixExpr`,[n,r.node]),operator:void 0})},bf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:pf(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:pf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},xf=e=>{let t=hf(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return yf(t,n),xf(e);if(i.operator!==void 0){let t=vf(r.operator);return t!==void 0&&gf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${ff(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${ff(e,a.node.first,a.node.last)} and expression at location ${ff(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return _f(a.operator,r.operator)?void 0:gf(a.operator,r.operator)?(bf(t,a.operator),xf(e)):`Precedence conflict between ops ${a.operator.name} in block ${ff(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=vf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(_f(s,r.operator))return;if(!gf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${ff(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return bf(t,s),xf(e);let c=ff(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===$d?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Sf=e=>Y(t=>{let n=hf(t),r=mf(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:xf(t)}),Cf=Sf(()=>!1),wf=Sf(()=>!0),Tf=Y(e=>{e.lastOperator=Zd.get(e.token.image)}),Ef=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},Df=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Ef(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Of=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!cf(e,n.first.beginColumn))return n;let t=Of(e,n);if(t!==void 0)return t}},kf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(k),n=(e,...t)=>t.some(t=>e.kind===k(t)),r=e=>e!==void 0&&Gd.has(e.kind),i=e.token,a=af(e,i);i.next=void 0;let o=af(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===Hd&&(e=e.next)}else if(e.kind===Hd){let t=e.next;!r(t)||qd.has(t.kind)||Kd.has(t.kind)&&t.next?.kind!==Hd||(e=t.next?.kind===k(`SUBSTITUTE`)?i:Kd.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Ud&&(e.next={kind:Ud,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=af(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Af=e=>{let t=of(e,1);if(t.kind===k(`LAB`)){let n=1;for(;n!==0;)if(t=af(e,t),t.kind===k(`LAB`)&&n++,t.kind===k(`RAB`)&&n--,t.kind===Vd)return!1;return af(e,t).kind===k(`IN`)}if(t.kind!==Hd)return!1;for(t=af(e,t);t.kind===k(`COMMA`);){if(t=af(e,t),t.kind!==Hd)return!1;t=af(e,t)}return t.kind===k(`IN`)},jf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Mf=e=>e.proofLevels.at(-1)??-1,Nf=e=>{let t=of(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:sf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Mf(e)>=0&&jf(t)>Mf(e):sf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Pf=(e,t)=>{let n=jf(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},Ff=e=>Y(t=>Pf(t,t.token)?void 0:`${ff(t,t.token)}: ${e}`),If=ef([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(k)),Lf=ef([...If.kinds,k(`op_76`)]),Rf=ef(Kd),zf=ef(qd),Bf=ef([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(k)),Vf=()=>q(Z({expansion:[K(If,`<op_77>`)],semantic:cf}),K(`PrefixOp`,`InfixOp`),wf),Hf=()=>K(G(Z({expansion:[`OpenStart`],semantic:cf}),`OpenExpression`,Cf),G(Z({semantic:cf}),`ExtendableExpr`)),Uf=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),Wf=()=>K(G(Z({semantic:e=>sf(`ASSUME`,`BOXASSUME`)(e)||of(e,2).kind===k(`COLONCOLON`)&&[k(`ASSUME`),k(`BOXASSUME`)].includes(of(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Gf=()=>[`JuncItem`,q(Z({semantic:lf}),`JuncItem`)],Kf=e=>Y(t=>{t.expecting=e,df(t)}),qf=e=>Y(t=>{t.isTerminalProof=e}),Jf=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{kf(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),Yf={CompilationUnit:Q(void 0,[Y(kf),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),Kf(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,Kf(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,Kf(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(kf)),G(Z({semantic:e=>sf(`USE`)(e)&&of(e,2).kind!==k(`ONLY`)||sf(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(Jf(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Jf(`Expression`,Z({expansion:[`<IDENTIFIER>`,zf]}),`PostfixLHS`,`Expression`),Jf(`Expression`,Z({expansion:[`<IDENTIFIER>`,Rf]}),`InfixLHS`,`Expression`),Jf(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),Jf(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[Lf,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,Rf,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,zf]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,Kf(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[If,Tf]),NonExpPrefixOp:Q(void 0,[Lf,Tf]),InfixOp:Q(`Infix Op`,[Rf,Tf]),PostfixOp:Q(void 0,[zf,Tf]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{kf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),Wf(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),Wf(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=mf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${ff(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(kf),K(G(Z({amount:3}),Z({semantic:sf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:Nf}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>sf(`BY`)(e)||of(e,2).kind===k(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>of(e,2).kind!==k(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,qf(!0),J(`<ONLY>`)),G(`<USE>`,qf(!1),J(`<ONLY>`)),G(`<HIDE>`,qf(!1))),X("an expression, `MODULE' or `DEF'"),J(Uf(),q(`<COMMA>`,X(`MODULE or expression`),Uf(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Uf(),q(`<COMMA>`,X(`MODULE or expression`),Uf(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),Bf,Ff(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:Nf}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),Bf,Ff(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:sf(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:sf(`INSTANCE`)}),`Instantiation`),G(Z({semantic:sf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:Nf}),Y(e=>{let t=mf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${ff(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),rf(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:sf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(Lf,Rf,zf),ef([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(k))],semantic:cf}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${ff(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:cf}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:Af}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),rf(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=mf(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),rf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:Af}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>of(e,2).kind===k(`MAPTO`)&&Jd.has(of(e,1).kind)}),Y(e=>{of(e,1).kind=Hd}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=pf(`FcnAppl`,t.heirs),e.lastOperator=Qd})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,rf(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(df),`Identifier`),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===k(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>uf(e)&&of(e,2).kind!==k(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:uf}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[rf(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=of(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...Gf()),G(Z({expansion:[`<AND>`]}),...Gf())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Of(t,e.heirs[1]);return n&&`Item at ${ff(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${ff(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),Vf(),Hf()],(e,t)=>{let n=hf(t);n.push({node:e.heirs[0],operator:$d});let r=xf(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Cf,q(K(G(Z({expansion:[`PostfixOp`],semantic:cf}),`PostfixOp`,wf),G(Z({expansion:[`<DOT>`],semantic:cf}),`<DOT>`,Y(df),Z({semantic:cf}),`Identifier`,Y(e=>{let t=hf(e);t[t.length-1].operator!==void 0&&yf(t,t.length),t[t.length-1]={node:pf(`RecordComponent`,[t[t.length-1].node,mf(e,2),mf(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:cf}),X(`function argument`),`SBracketCases`,Sf(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:cf}),`InfixOp`,wf,Vf(),Hf()),G(Z({expansion:[`<COLONCOLON>`],semantic:cf}),`<COLONCOLON>`,Y(e=>{let t=hf(e);if(!Df(t[t.length-1].node))return`\`::' at ${ff(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=hf(e),n=mf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!_f(r,e.lastOperator)){let t=mf(e,3);return`Removing label at ${ff(e,t.first,t.last)} would change expression parsing.`}t.push({node:pf(`Label`,[mf(e,3),mf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:cf}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:cf}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>Mf(e)<0&&e.proofLevels.length<=1?`${ff(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${ff(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Ef(e.heirs)===void 0?e.heirs.length===1?pf(`GeneralId`,e.heirs):void 0:pf(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>of(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>of(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${ff(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Xf=/* @__PURE__ */ new Map,Zf=e=>{let t=Xf.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Zf(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,Zf(Yf[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return Xf.set(e,n),n},Qf=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},$f=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=af(e,e.scanPosition)),e.scanPosition=af(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},ep=(e,t)=>{if(t.type===`tokens`)return $f(e,t.kinds);if(t.type===`call`)return ep(e,Yf[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Qf(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=ep(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||Qf(e,t.semantic)?ep(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=ep(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=ep(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},tp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=ep(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},np=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||Zf(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Zf(a).hasSemanticStart?Zf(a).first.has(of(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):tp(e,i,a)&&(o===void 0||o(e))}),rp=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,ep(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=af(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Vd){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=af(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ge(e.token.image)}" `},ip=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??rp(e)}\n\nResidual stack trace follows:\n${r}`,!1},ap=(e,t)=>{let n=af(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,ip(e))},op=(e,t)=>{let n=Yf[t];n.message!==void 0&&(e.messages.push({name:n.message,token:of(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!sp(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return ip(e,i);let a=r.node??(r.heirs.length===0?void 0:pf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},sp=(e,t)=>{if(t.type===`tokens`)return ap(e,t.kinds);if(t.type===`call`)return op(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||ip(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||ip(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||sp(e,t));if(t.type===`choice`){let n=np(e,t.alternatives);return n===-1?ip(e):sp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!sp(e,t.body))return!1;if(t.type===`optional`)return np(e,[t.body])===-1||sp(e,t.body);for(;np(e,[t.body])===0;)if(!sp(e,t.body))return!1;return!0},cp=e=>{let t=Ue(e),n={kind:Vd,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=sp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},lp={low:15,high:15},up={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),dp=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),fp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),pp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),mp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),hp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),gp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),_p=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...fp]),vp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?dp.has(e.operator):fp.has(e.operator)),yp=e=>dp.has(e)||fp.has(e)||e===`-.`,bp=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},xp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Sp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Cp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),wp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Tp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Ep=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Dp=/* @__PURE__ */ new Set([``,`*`,`-`]),Op=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),kp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Ap=/* @__PURE__ */ new Set([`NEW`,...kp.keys()]),jp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Mp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Np=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Pp=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
|
|
466
|
+
`)}\n`},Fp=(e,t)=>{let n=t===`tlapm`,r=n?xe(e):xe(e).map(ye),i={index:0,offsideColumns:[]},a={},o=[],s=/* @__PURE__ */ new Set,c=[],l={index:-1},d=[],f=e=>o[o.length-1].has(e),m=e=>({line:e.line,column:n&&e.kind===`String`?e.endColumn:e.column,range:void 0}),h=[],_=[],v=[],y=(e,t=i.index-1)=>{let n=e===t?v[e]:void 0;if(n)return n;let a=r[t];h[e]??=m(r[e]),_[t]??={line:a.line,column:a.endColumn};let o={module:d[0].name,start:h[e],end:_[t]};return e===t&&(v[e]=o),o},b=(e,t)=>(e.location.range=y(t),e),ee=(e=0)=>r[Math.min(i.index+e,r.length-1)],x=(e=0)=>{let t=ee(e),n=i.offsideColumns[i.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},S=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),C={index:0},te=e=>{let t=r.slice(C.index,i.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ne=e=>n&&(e.kind===`Keyword`||Np.has(e.text)),re=e=>{let t=r.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},ie=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Ep.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ne(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,ae=(e,t=ee(),n)=>{let i=r[r.length-1],a=t.line===i.line&&t.column===i.column;return new u(`${e} at line ${t.line}, column ${t.column}`,void 0,oe(e,t,a,n))},oe=(e,t,i,a)=>{if(n&&i){let e=r[r.length-1];return{reason:`Unexpected EOF`,...te(re(e)),isEnd:i}}return n&&a?{reason:`Unexpected ${ie(a)}`,...re(a),isEnd:i}:{reason:e,line:t.line,column:t.column,isEnd:i}},se=(e,t=ee())=>ae(e,t,t),ce=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ne(e),w=(e,t=0)=>{let n=x(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=x();if(e.kind===`End`)throw ae(`Unexpected end of expression`);return i.index++,e},E=e=>w(e)?(i.index++,!0):!1,D=e=>{if(!w(e))throw se(`Expected ${JSON.stringify(e)} but found ${S(x())}`);return T()},le=()=>{let e=x();if(e.kind!==`Identifier`)throw se(`Expected an identifier but found ${S(e)}`);if(ne(e))throw se(`Unexpected keyword ${e.text}`);return i.index++,e.text},ue=()=>{let e=i.index;return{name:le(),range:y(e)}},de=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),fe=()=>{let e=x();return e.kind!==`String`&&(mp.has(e.text)||dp.has(e.text)||fp.has(e.text)||e.text===`'`)?(i.index++,e.text):le()},me={isUsed:!1},he=()=>x().kind===`Identifier`||!ce(x())?le():(me.isUsed=!0,T().text),ge=e=>{if(!n)return e();i.offsideColumns.push(-1);let t=e();return i.offsideColumns.pop(),t},O=(e,t=`,`)=>{let n=[e()];for(;E(t);)n.push(e());return n},_e=()=>{if(w(`<<`)){let e={value:1};for(;x(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;x(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},ve=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;x(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return x(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},be=()=>{if(!E(`<<`)){let e=ue();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=de(O(ue));return D(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Se=()=>O(()=>{let e=O(be);D(`\\in`);let t=j();return e.map(e=>({pattern:e,set:t}))}).flat(),Ce=()=>{let e=x();if(e.kind===`Identifier`){let t=i.index,n=[T().text];for(;w(`!`)&&x(1).kind===`Identifier`;)T(),n.push(le());return b({kind:`Identifier`,name:n.join(`!`),location:m(e)},t)}if(w(`<<`)||w(`(`))return Le();throw se(`Expected a subscript but found ${S(e)}`)},we=e=>{let t=x(1),n=x(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&w(`==`,fp.has(n.text)?3:4))},k=e=>{let t=x(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&Sp.has(t.text)||we(e)},Te=()=>{let e=x(),t=e.kind===`Operator`&&(dp.has(e.text)||pp.has(e.text))&&k(e);if(n&&e.kind!==`String`&&(pp.has(e.text)||_p.has(e.text)&&e.text!==`'`&&!fp.has(e.text)||gp.has(e.text)&&x(-1).text===`(`&&x(-1).line===e.line&&x(-1).endColumn+1===e.column&&x(1).text===`)`&&x(1).line===e.line&&x(1).column===e.endColumn+1)&&k(e))throw ae(`incomplete expression`,e);if(t)return i.index++,b({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:m(e)},i.index-1);if(e.kind!==`String`&&_p.has(e.text)&&k(e)){i.index++;let t=m(e);if(fp.has(e.text))return{kind:`OperatorReference`,operator:e.text,location:t};let n={kind:`Identifier`,name:`argument`,location:t};return{kind:`Lambda`,params:[n.name],body:bp(e.text,n,t),location:t}}if(w(`LAMBDA`)){let t=i.index;T();let n=de(O(ue));D(`:`);let r=j();return b({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:m(e)},t)}let r=j();return r.kind===`Identifier`&&A.delete(r),r},A=/* @__PURE__ */ new Map,Ee={range:void 0},De=()=>ge(()=>{let e=i.index;D(`(`);let t=O(Te);return D(`)`),Ee.range=y(e),t}),Oe=()=>{let e=T();i.offsideColumns.push(e.column);let t=[j()];for(;ee().text===e.text&&ee().column===e.column;)i.index++,t.push(j());return i.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:m(e)}},ke=e=>ge(()=>{let t=m(e),r=x().kind===`Identifier`,a=w(`|->`,1)&&(r||ce(x()));if(a||r&&w(`:`,1)){let e=a?`Record`:`RecordSet`,n=e=>{let t=i.index,n=m(x()),r=e();return n.range=y(t),D(a?`|->`:`:`),{name:r,value:j(),location:n}},o=[n(()=>r?le():T().text),...E(`,`)?O(()=>n(le)):[]];return D(`]`),{kind:e,fields:o,location:t}}if(_e()){let e=Se();D(`|->`);let n=j();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let o=j();if(E(`->`)){let e=j();return D(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(E(`EXCEPT`)){let e=O(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!ce(x()))throw se(`Expected a field name but found ${S(x())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:O(()=>j())}),D(`]`);return D(`=`),{path:e,value:j()}});return D(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!n&&!w(`]_`)){let e=[o];for(;E(`,`);)e.push(j());return D(`]`),{kind:`Bracket`,args:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:o,subscript:Ce(),location:t}}),Ae=()=>{let e=i.index,t=b(ze(),e),n=m(T());return b({kind:`Apply`,operator:`\\in`,args:[t,j()],location:n},e)},je=e=>ge(()=>{let t=m(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(_e()&&(x(1).text===`\\in`||w(`<<`))){let e=i.index,n=be();D(`\\in`);let r=j();if(E(`:`)){let e=j();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}i.index=e}let n=x().kind===`Identifier`&&w(`\\in`,1)?Ae():j();if(E(`:`)){let e=Se();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;E(`,`);)r.push(j());return D(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Me=e=>{let t=m(e),n=ge(()=>w(`>>`)||w(`>>_`)?[]:O(()=>j()));if(E(`>>_`)){if(n.length!==1)throw ae(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:Ce(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},Ne=e=>{let t=m(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&_e()){let e=Se();return D(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=de(O(ue));return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Pe=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:j(),location:m(e)};let n=j();D(`->`),t.push({condition:n,body:j()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:m(e)}},Fe=()=>{let e=x(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||xp.has(e.text)||e.kind===`Operator`&&(dp.has(e.text)||fp.has(e.text)||pp.has(e.text)))},Ie=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:pe(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return i.index--,{kind:`Bound`,args:De()}}return{kind:`Name`,name:e.text,args:w(`(`)?De():[]}},Le=e=>{let r=i.index,s=r===l.index,c=T(),u=m(c);if(n&&c.kind===`Keyword`&&c.text===`LAMBDA`){let e=O(le);return D(`:`),{kind:`Lambda`,params:e,body:j(),location:u}}if(c.kind===`Number`){if(n&&/^\\[BOH]/.test(c.text))throw ae(`incomplete expression`,c);return{kind:`Number`,value:pe(c.text),text:c.text,location:u}}if(c.kind===`Decimal`)return{kind:`Decimal`,text:c.text,location:u};if(c.kind===`String`)return{kind:`String`,value:c.text,location:u};let f=c.kind===`Step`&&nt(c);if(f&&$e()<0&&Qe.length<=1)throw ae(`Step number used outside proof`,c);if(f&&c.text[1]===`+`)throw ae(`<+> step number used in an expression`,c);if(c.kind===`Identifier`||f){let o=f?rt(c)??c.text:c.text;if(ve()){let t=de(E(`(`)?O(ue):[]);t.names.length>0&&D(`)`),D(`::`);let r=j();if(!n&&e!==void 0&&a.last!==void 0&&vp(r)&&e.high>=a.last.low)throw ae(`Removing the label would change expression parsing`,c);return{kind:`Label`,name:o,params:t.names,paramRanges:t.ranges,body:r,location:u}}let l=w(`(`);if(o===`@`&&!l&&!Fe())return{kind:`ExceptAt`,location:u};let p=l?De():[],m=[l?Ee.range:void 0];if(!Fe())return l?{kind:`Apply`,operator:o,args:p,argumentsRange:Ee.range,location:u}:{kind:`Identifier`,name:o,location:u};let h=d.flatMap(e=>e.instances).find(e=>e.name===o),_=h!==void 0&&t===`tlc`&&!s&&h.params.length!==p.length;if(_&&p.length>0)throw ae(`The operator ${o} requires ${h.params.length} arguments`,c);let v=[{kind:`Name`,name:o,args:p}],b=[y(r,r)];for(;Fe();)T(),b.push(y(i.index,i.index)),Ee.range=void 0,v.push(Ie()),m.push(Ee.range);let ee=v.flatMap(e=>e.kind===`Name`?[e.name]:[]),x=ee.join(`!`),S=v.flatMap(e=>`args`in e?e.args:[]),C=v.map(e=>`args`in e?e.args.length:0),te=m.findLast(e=>e!==void 0),ne=ee.length<v.length?{kind:`Subexpression`,selectors:v,selectorRanges:b,argumentRanges:m,location:u}:S.length===0?{kind:`Identifier`,name:x,selectorRanges:b,location:u}:C.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:x,args:S,argumentCounts:C,argumentsRange:te,selectorRanges:b,argumentRanges:m,location:u}:{kind:`Apply`,operator:x,args:S,argumentsRange:te,selectorRanges:b,argumentRanges:m,location:u};return _&&A.set(ne,{location:g(y(r)),message:`The operator ${o} requires ${h.params.length} arguments.`}),ne}if(c.kind===`Operator`&&yp(c.text)&&w(`(`))return{kind:`Apply`,operator:c.text,args:De(),location:u};if(c.kind===`Operator`&&yp(c.text)&&!n)return{kind:`Identifier`,name:c.text,location:u};switch(c.text){case`(`:{let e=ge(()=>j());return D(`)`),e}case`[`:return ke(c);case`{`:return je(c);case`<<`:return Me(c);case`@`:return{kind:`ExceptAt`,location:u};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Ne(c);case`IF`:{let e=j();D(`THEN`);let t=j();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:u}}case`CASE`:return Pe(c);case`LET`:{let e=[],t=[];for(o.push(/* @__PURE__ */ new Set);!E(`IN`);){if(n&&w(`RECURSIVE`))throw ae(`Unexpected keyword RECURSIVE`,te(ee()));if(E(`RECURSIVE`)){Ye();continue}let r=He(!1);r.kind===`Instance`?t.push(r):e.push(r)}o.pop();let r=j();return t.length===0?{kind:`Let`,definitions:e,body:r,location:u}:{kind:`Let`,definitions:e,instances:t,body:r,location:u}}case`CHOOSE`:{let e=be(),t=E(`\\in`)?j():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:u}}case`WF_`:case`SF_`:{let e=Ce(),t=ge(()=>{D(`(`);let e=j();return D(`)`),e});return{kind:c.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:u}}}throw se(`Unexpected ${S(c)}`,c)},Re=(e,t,r)=>{a.last=a.preceding={low:t,high:r};let i=j(r+1),o=x(),s=o.text===`'`||fp.has(o.text)?lp.high:dp.get(o.text)?.high;if(!n&&o.kind===`Operator`&&s!==void 0&&s>=t)throw ae(`Precedence conflict between ${e.text} and ${o.text}`,o);return i},ze=()=>{let e=a.preceding;a.preceding=void 0;let t=x(),r=m(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return Oe();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[Re(t,4,4)],location:r};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[Re(t,12,12)],location:r};case`[]`:return T(),{kind:`Always`,expression:Re(t,4,15),location:r};case`<>`:return T(),{kind:`Eventually`,expression:Re(t,4,15),location:r};case`ENABLED`:return T(),{kind:`Enabled`,expression:Re(t,4,15),location:r};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:Re(t,4,15),location:r};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:t.text,args:[n?j(9):Re(t,10,13)],location:r}}return Le(e)},j=(e=0)=>{let t=i.index,n=ze(),r={left:n.location.range?n:b(n,t),previous:void 0};for(;;){let n=x();if(n.kind!==`Operator`)break;let i=m(n);if(n.text===`'`&&e<=15){T(),a.last=lp,r.left=b({kind:`Prime`,expression:r.left,location:i},t);continue}if(fp.has(n.text)&&e<=15){T(),a.last=lp,r.left=b({kind:`Apply`,operator:n.text,args:[r.left],location:i},t);continue}if(n.text===`[`){T();let e=ge(()=>O(()=>j()));ge(()=>D(`]`)),a.last=up,r.left=b({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&ce(x(1))){T();let e=T().text;r.left=b({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let o=dp.get(n.text);if(!o||o.low<e)break;let s=r.previous;if(s){let e=!(s.low>o.high||s.high<o.low),t=s.text===n.text&&o.isAssociative;if(e&&!t&&(s.text!==`\\X`||n.text!==`\\X`))throw ae(`Precedence conflict between ${s.text} and ${n.text}`,n)}if(T(),o.low>12&&w(`-`))throw ae(`Precedence conflict between ${n.text} and -`,x());a.last=a.preceding=o;let c=j(o.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[y(t).end];r.left=l.kind===e&&s?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&s?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=b(r.left,t),r.previous={...o,text:n.text}}return r.left},Be=()=>{if(!E(`(`))return[];let e=Je();return D(`)`),e},Ve=()=>{let e=m(x()),t=j(),n=r[i.index-1],a={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:a}}},He=e=>{let t=i.index;return b(We(e),t)},Ue=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),We=e=>{let t=x(),n=m(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...Ve(),isLocal:e,isRecursive:f(t),location:n});if(t.kind===`Identifier`&&x(1).kind===`Operator`&&dp.has(x(1).text)&&x(2).kind===`Identifier`&&w(`==`,3)){let e=ue(),t=T().text,n=ue();return D(`==`),r(t,[Ue(e),Ue(n)])}let a=t.kind!==`String`&&mp.has(t.text),o=t.kind===`Identifier`&&fp.has(x(1).text)&&w(`==`,2);if(a||o){let e=a?t.text:x(1).text;a&&T();let n=ue();return o&&T(),D(`==`),r(e,[Ue(n)])}let s=le();if(E(`[`)){let t=ge(()=>Se());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:j(),isLocal:e,isRecursive:f(s),location:n}}let c=i.index,l=Be();return D(`==`),w(`INSTANCE`)?{...Ge(s,l,e,n),definitionRange:y(c)}:r(s,l)},Ge=(e,t,n,r)=>{let a=i.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:he(),substitutions:E(`WITH`)?O(()=>{let e=i.index,t=fe(),n=y(e);return D(`<-`),{name:t,nameRange:n,expression:Te()}}):[],isLocal:n,location:r,instanceRange:y(a)}},Ke=()=>{let e=i.index;return b(qe(),e)},qe=()=>{let e=m(x());if(w(`_`)&&x(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(x().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=le();if(!E(`(`))return{name:t,arity:0,location:e};let n=O(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},Je=()=>O(Ke),Ye=()=>{let e=Je();return e.forEach(e=>o[o.length-1].add(e.name)),e},Xe=e=>{let t={value:0,offset:e};do{let e=x(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&jp.has(e.text)&&t.value++,e.kind===`Operator`&&Mp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ze=()=>{let e=x(),t=x(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,Xe(1)):t.kind===`Operator`&&fp.has(t.text)?w(`==`,2):t.kind===`Operator`&&dp.has(t.text)?x(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):e.kind!==`String`&&mp.has(e.text)&&t.kind===`Identifier`&&w(`==`,2)},Qe=[],$e=()=>Qe[Qe.length-1]??-1,et=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),tt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},nt=e=>!e.text.endsWith(`.`)&&!Dp.has(tt(e)),rt=e=>{let t=tt(e);if(Dp.has(t))return;let n=et(e);if(n>=0)return`<${n}>${t}`;let r=$e(),i=Qe[Qe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},it=e=>{if(e.kind===`Keyword`)return wp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Qe.length===0;if(e.text[1]===`+`||Qe.length===0)return!0;let t=$e();return t>=0&&et(e)>t},M=e=>{let t=et(e),n=Qe.length-1,r=Qe[n-1]??-1,i=Qe[n]<0;return i&&(Qe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Qe[n]===t},at=e=>!s.has(e)&&d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),ot=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Np.has(e.name)&&!at(e.name):!1,st=()=>{let e=x();return e.kind===`Step`?nt(e):e.kind===`Keyword`?Op.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ze()},ct=()=>{let e=i.index;l.index=e;let t=x();return t.kind===`Operator`&&!hp.has(t.text)&&yp(t.text)?(i.index++,b({kind:`OperatorReference`,operator:t.text,location:m(t)},e)):E(`MODULE`)?b({kind:`ModuleFact`,name:le(),location:m(t)},e):j()},N=e=>c[c.length-1]?.add(e),P=e=>{c.push(/* @__PURE__ */ new Set);let t=e();return c.pop(),t},lt=e=>c.some(t=>t.has(e))||d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),F=()=>{let e=i.index,t=x(),n=O(()=>{let e=x();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw se(`Expected a definition name but found ${S(e)}`,e);return i.index++,e.text},`!`),r=m(t);return b(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},I=()=>{if(n)return O(F);let e=O(ct),r=t===`tlc`?e.find(e=>e.kind===`Identifier`&<(e.name)):void 0;if(r)throw ae(`DEF clause entry should describe a defined operator`,r.location);return e},ut=()=>({facts:st()?O(ct):[],defs:E(`DEF`)||E(`DEFS`)?I():[]}),dt=()=>{let e=i.index,n=T(),r=n.text===`USE`&&E(`ONLY`),a=y(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...ut(),keyword:a,location:m(n)},s=o.kind===`Hide`&&t===`tlc`?o.facts.filter(e=>!ot(e)):[];if(s.length>0)throw p(s.map(t=>({location:g(t.location.range??y(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
467
|
+
the name of a theorem, assumption, or step.`})));return b(o,e)},ft=()=>{let e=i.index,t=m(x()),n=E(`NEW`),r=x().kind===`Keyword`?kp.get(x().text):void 0;if(!n&&r===void 0)throw se(`Expected a declaration but found ${S(x())}`);if(r!==void 0&&T(),r===`Variable`){let n=ue();return N(n.name),b({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let a=Ke();N(a.name);let o=(r??`Constant`)===`Constant`&&w(`\\in`);if(o&&a.arity>0)throw ae(`declared symbol with arguments before \\in`);return o&&T(),b({kind:`NewSymbol`,name:a.name,arity:a.arity,level:r??`Constant`,set:o?j():void 0,nameRange:a.location.range,location:t},e)},pt=()=>{let e=i.index,t=m(D(`ASSUME`)),n=O(()=>w(`ASSUME`)?P(pt):x().kind===`Keyword`&&Ap.has(x().text)?ft():j());return D(`PROVE`),b({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)},mt=e=>{let t={value:0};for(;x(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return x(t.value).kind===`Identifier`&&w(e,t.value+1)},ht=(e,t)=>{e.forEach(N),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(N))},gt=()=>{let e=x();if(w(`USE`)||w(`HIDE`))return dt();if(w(`INSTANCE`)){let t=i.index;return b(Ge(void 0,[],!1,m(e)),t)}if(w(`DEFINE`)||Ze()){let t=i.index;E(`DEFINE`);let n=[He(!1)];for(;Ze();)n.push(He(!1));let r={kind:`Define`,definitions:n,location:m(e)};return b(r,t)}if(E(`HAVE`))return{kind:`Have`,expression:j()};if(E(`TAKE`)){let e=_e(),t=de(e?[]:O(ue)),n=e?Se():[];return ht(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:O(()=>j())};if(E(`PICK`)){let e=mt(`:`),t=de(e?O(ue):[]),n=e?[]:Se();return ht(t.names,n),D(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return E(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?pt():j()}},_t=e=>{let t=x();if(t.kind!==`Step`)throw se(`Expected a step number but found ${S(t)}`,t);if(!M(t))throw ae(`${e?`QED step`:`step`}'s number has bad level`,t);if(et(t)<0&&rt(t)!==void 0)throw ae(`<*> and <+> cannot be used for a named step`,t);return i.index++,{name:rt(t),token:t.text,location:m(t)}},vt=()=>{let e=i.index,t=_t(w(`QED`,1)),n=i.index,r=/* @__PURE__ */ new Set;c.push(r);let a=E(`QED`)?{kind:`Qed`}:gt(),o=y(e),s=y(n),l=it(x());if(l&&!Tp.has(a.kind))throw ae(`Proof of a step that does not take a proof`);let u=l?bt():void 0;return c.pop(),(a.kind!==`Assert`||a.isSuffices)&&r.forEach(N),b({...t,body:a,head:o,statement:s,proof:u},e)},yt=()=>{let e=m(x());if(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=y(i.index-1);return{kind:`By`,isOnly:E(`ONLY`),...ut(),keyword:t,location:e}}let t=x(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=y(i.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`PROOF`);let n=[vt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(vt());return{kind:`Steps`,level:$e(),steps:n,location:e}},bt=()=>{let e=i.index;Qe.push(-1);let t=P(yt);return Qe.pop(),b(t,e)},xt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},St=e=>{let t=i.index,n=T(),r=x().kind===`Identifier`&&w(`==`,1)?le():void 0;r!==void 0&&(s.add(r),T());let a=P(()=>({statement:w(`ASSUME`)?pt():j(),proof:it(x())?bt():void 0})),o=a.statement,c=b({name:r,statement:o,proof:a.proof,location:m(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&o.kind!==`AssumeProve`&&xt(e,b({kind:`Operator`,name:r,params:[],body:o,isLocal:!1,isRecursive:!1,location:m(n)},t))},Ct=()=>{let e=i.index;return b(wt(),e)},wt=()=>{let e=T(),t=m(e),n=e.text===`AXIOM`;if(x().kind===`Identifier`&&w(`==`,1)){let e=le();return s.add(e),T(),{name:e,expression:j(),isAxiom:n,location:t}}return{name:void 0,expression:j(),isAxiom:n,location:t}},Tt=()=>{let e=m(D(`----`));D(`MODULE`);let t=he();D(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),o.push(/* @__PURE__ */ new Set),E(`EXTENDS`)&&O(()=>{let e=i.index;n.extends.push(he()),n.extendsRanges.push(y(e))});;){let t=i.index;C.index=t;let r=x();if(r.kind===`ModuleEnd`){if(e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},A.size>0)throw p([...A.values()]);return d.pop(),o.pop(),n}if(r.kind===`Separator`){if(w(`MODULE`,1)){let e=Tt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=m(T()),r=Je();n.constants.push(...r),e.range=y(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=m(T()),r=O(()=>{let e=i.index,t=m(x());return b({name:le(),arity:0,location:t},e)});n.variables.push(...r),e.range=y(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Ct();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&xt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(w(`USE`)&&w(`ONLY`,1))throw se(`Expected a module unit but found ${S(r)}`);let e=dt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:Ye()});continue;case`INSTANCE`:Et(n,b(Ge(void 0,[],!1,m(r)),t));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){Et(n,b(Ge(void 0,[],!0,m(r)),t));continue}Et(n,b(We(!0),t));continue}r.kind===`Keyword`&&Cp.has(r.text)?St(n):Et(n,He(!1))}}},Et=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},Dt=Tt(),Ot=me.isUsed?cp(e):void 0;if(Ot!==void 0)throw new u(Ot);return Dt},Ip=e=>Fp(e,`tlc`),Lp=e=>Fp(e,`tlapm`),Rp=e=>Fp(e,`sany`),zp=25214903917n,Bp=(1n<<48n)-1n,Vp=2147483647,Hp=e=>{let t={value:(BigInt.asUintN(64,e)^zp)&Bp},n=e=>(t.value=t.value*zp+11n&Bp,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^zp)&Bp},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=Vp)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Up=10454148508367108822n,Wp=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Up);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Gp=Int32Array.from(Wp,e=>Number(BigInt.asIntN(32,e>>32n))),Kp=Int32Array.from(Wp,e=>Number(BigInt.asIntN(32,e))),qp=Number(BigInt.asIntN(32,Up>>32n)),Jp=Number(BigInt.asIntN(32,Up));let Yp=qp,Xp=Jp;const Zp=e=>{let t=(e^Xp)&255;Xp=(Xp>>>8|Yp<<24)^Kp[t],Yp=Yp>>>8^Gp[t]},Qp=e=>{for(let t=0;t<32;t+=8)Zp(e>>>t)},$p=e=>{if(typeof e==`boolean`)Zp(0),Zp(e?116:102);else if(typeof e==`number`)Zp(1),Qp(e);else if(typeof e==`string`){Zp(3),Qp(e.length);for(let t=0;t<e.length;t++)Zp(e.charCodeAt(t))}else if(I(e))Zp(21),Qp(kt(e.name)+1);else if(F(e)){let t=Dr(e);Zp(9),Qp(t.domain.length);for(let e=0;e<t.domain.length;e++)$p(t.domain[e]),$p(t.range[e])}else{let t=R(e).elements;Zp(5),Qp(t.length);for(let e of t)$p(e)}},em=e=>{let t={high:Yp,low:Xp};Yp=qp,Xp=Jp;for(let t of e)$p(t);let n=BigInt(Yp>>>0)<<32n|BigInt(Xp>>>0);return Yp=t.high,Xp=t.low,n},tm=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||I(e))return 5;if(typeof e==`string`)return 5+e.length;if(F(e)){let t=Dr(e);return t.domain.reduce((e,n,r)=>e+tm(n)+tm(t.range[r]),5)}return R(e).elements.reduce((e,t)=>e+tm(t),5)},nm=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Yp=n<32?0:1<<n-32,Xp=n<32?1<<n:0;for(let t=0;t<e;t++)Zp(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^Yp,t[n+1]=t[a+1]^Xp}}return t},rm=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=r.get(e);if(t!==void 0)return t;let n=tm(e);return Yp=0,Xp=0,$p(e),r.set(e,i.length),i.push(n,Yp,Xp),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=nm(e);return n.set(e,r),r};return(n,r)=>{let s={high:Yp,low:Xp},c={high:qp,low:Jp};for(let t of e){let e=a(n[t]),r=o(i[e]),s={high:i[e+1],low:i[e+2]};for(let e=0;e<8;e++){let t=e<4?c.low:c.high,n=(e*256+(t>>>(e&3)*8&255))*2;s.high^=r[n],s.low^=r[n+1]}c.high=s.high,c.low=s.low}Yp=s.high,Xp=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},im=[],am=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},om=()=>{for(let e=1277011;im.length<1341;e++)am(e)&&im.push(e);return im},sm=e=>{let t=om(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},cm=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},lm=e=>{for(let t=Math.max(e,9);;t++){let e=cm(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},um=(e,t,n)=>{if(t<=0)return[];let r=lm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(sm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},dm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Vp),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},fm=(1n<<63n)-1n-24n,pm=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(fm*BigInt(n)+i)%t;return r<0n?r+t:r})},mm=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,hm=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=qn(e.domain),n=R(e.range).elements;return{lists:t.map(()=>n),create:e=>Bt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>R(e).elements),create:t=>Xn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>R(e).elements),create:Yn}}},gm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,_m=(e,t,n,r)=>{if(pr(t))return[];let i=r===`1.7.4`?dm:um;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=gm(t,r)?void 0:hm(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Vp)?pm(e,t,n):i(e,Number(t),n)).map(e=>a.create(mm(a.lists,e)))}let o=R(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},vm=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new y(`RandomElement of the empty set`);return n},ym=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...qn(e.domain)];return Bt(n,n.map(()=>ym(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Xn(e.names.map((n,r)=>[n,ym(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Yn(e.factors.map(e=>ym(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new y(`RandomElement of the empty set`);return e.low+r}return vm(R(e).elements,t)},bm=(e,t=0n)=>{let n=Hp(t),r={random:Hp(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Xn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:em,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},xm=e=>zn([...e.possibleCounts].map(([e,t])=>[e,t])),Sm=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,xm(e)]]),Cm=(e,t,n)=>new C(`Applying ${e} to the following value,\nwhich is not ${t}:\n${z(n)}`),wm=(e,t,n,r)=>new C(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${z(r)}`),Tm=e=>F(e)?Dr(e):void 0,Em=(e,t,n)=>{let r=V(e,t,n),i=Tm(r);if(!i)throw Cm(n,`a function with a finite domain`,r);return i},Dm=(e,t,n)=>{let r=V(e,t,n),i=Tm(r);if(!i)throw wm(t===0?`first`:`second`,n,`bag`,r);return i},Om=(e,t)=>{if(!P(e)||!L(e))throw t();return R(e).elements},km=e=>e.range.every(e=>typeof e==`number`&&e>0),Am=(e,t)=>{let n=e.domain.findIndex(e=>Qt(e,t));return n===-1?void 0:e.range[n]},jm=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Mm=jm(`BagDiff`,`tlc2.value.impl.Value`,2),Nm=jm(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Pm=jm(`BagUnion`,`tlc2.value.impl.Value`,1),Fm=jm(`BagOfAll`,`tlc2.value.impl.Value`,2),Im=jm(`BagCup`,`tlc2.value.impl.Value`,2),Lm=jm(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Rm=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Ri(e)}`;throw Bi(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},zm=(e,t,n)=>{let r=Rm(e,n)+Rm(t,n);if(Mi(r))throw Ni(`${e}+${t}`);return r},Bm=(e,t,n,r)=>{let i=Am(n,e.domain[t]),a=Rm(e.range[t],r);return i===void 0?a:a-Rm(i,r)|0},Vm=(e,t)=>zn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Qt(e[0],r));a?a[1]=zm(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Hm=Bt([],[]),Um=e=>[Oi(`EmptyBag`,Hm),H(`IsABag`,1,e=>{let t=Tm(V(e,0,`IsABag`));return t!==void 0&&km(t)}),H(`BagCardinality`,1,e=>{let t=V(e,0,`BagCardinality`);return Em(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Cm(`BagCardinality`,`a bag`,t);return zm(e,n,Lm)},0)}),H(`BagIn`,2,e=>{let t=V(e,1,`BagIn`),n=Am(Em(e,1,`BagIn`),V(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw wm(`second`,`BagIn`,`bag`,t);return n>0}),H(`CopiesIn`,2,e=>{let t=V(e,1,`CopiesIn`),n=Am(Em(e,1,`CopiesIn`),V(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw wm(`second`,`CopiesIn`,`bag`,t);return n}),H(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Dm(e,t,`(+)`);if(!km(n))throw wm(t===0?`first`:`second`,`(+)`,`bag`,V(e,t,`(+)`));return n});return Vm(t,Im)}),H(`\\ominus`,2,e=>{let t=Dm(e,0,`(-)`),n=Dm(e,1,`(-)`);return zn(t.domain.flatMap((e,r)=>{let i=Bm(t,r,n,Mm);return i>0?[[e,i]]:[]}))}),H(`BagUnion`,1,e=>{let t=V(e,0,`BagUnion`),n=Om(t,()=>Cm(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??Hm;let r=n.map(e=>{let n=Tm(e);if(!n)throw new C(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${z(t)}`);return n});return Vm(r,Pm)}),H(`\\sqsubseteq`,2,e=>{let t=Em(e,0,`\\sqsubseteq`),n=Em(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Bm(t,r,n,Nm)<=0)}),ki(`BagOfAll`,2,e=>{let t=Di(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new C(`The first argument of BagOfAll should be an operator, but instead it is:\n${z(t.literalBody)}`);let n=V(e,1,`BagOfAll`),r=Tm(n);if(!r)throw wm(`second`,`BagOfAll`,`function with a finite domain`,n);return Vm(r.domain.map((e,n)=>Bt([t.call([e])],[r.range[n]])),Fm)}),H(`SubBag`,1,t=>{let n=V(t,0,`SubBag`);if(!F(n))throw new y(`DOMAIN expects a function but received ${z(n)}`);let r=Dr(n),i=Nn(r.range).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new y(`Attempted to apply a function to ${z(r)}, which is not in its domain`);return Nn(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Bt(e.map(e=>e[0]),e.map(e=>e[1]))))}),H(`BagToSet`,1,e=>Fr(Em(e,0,`BagToSet`))),H(`SetToBag`,1,e=>{let t=V(e,0,`SetToBag`),n=Om(t,()=>Cm(`BagToSet`,`a function with a finite domain`,t));return Bt([...n],n.map(()=>1))})],Wm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Gm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Km=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,qm=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Jm=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Ym=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Xm=e=>{if(!F(e))return!1;let t=Dr(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Zm=(e,t)=>Bi(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Ri(t)}`),Qm=(e,t)=>Bi(e,`Cannot cast tlc2.value.impl.${Ri(t)} to tlc2.value.impl.StringValue`),$m=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),eh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Zm(t,e);return`[${R(e).elements.map(e=>nh(e,t)).join(`,`)}]`},th=(e,t)=>{let n=Dr(e),r=br(n);return r?`[${r.map(e=>nh(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${$m(typeof e==`string`?e:z(e))}:${nh(n.range[r],t)}`).join(`,`)}}`},nh=(e,t)=>typeof e==`string`?$m(e):typeof e==`object`?e.kind===`ModelValue`?$m(e.name):P(e)?eh(e,t):th(e,t):String(e),rh=e=>{if(P(e))return eh(e,Wm);if(!F(e)||Xm(e))throw Zm(Wm,e);return th(e,Wm)},ih=e=>{if(!F(e))throw Zm(Gm,e);return th(e,Gm)},ah=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},oh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Dt(e);if(Array.isArray(e))return Yn(e.map(e=>oh(e,t)));if(typeof e==`object`&&e)return Xn(Object.entries(e).map(([e,n])=>[Dt(e),oh(n,t)]));throw Bi(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},sh=(e,t)=>{if(e.trim()===``)return oh(null,t);try{return oh(JSON.parse(e,(e,t,n)=>typeof t==`number`?ah(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Bi(t,e.message):e}},ch=(e,t)=>{if(typeof e!=`string`)throw Qm(t,e);return e},lh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Bi(n,`${t} (No such file or directory)`);return r},uh=e=>[Ai(`ToJson`,1,e=>Dt(nh(V(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Ai(`ToJsonArray`,1,e=>Dt(rh(V(e,0,`ToJsonArray`)))),Ai(`ToJsonObject`,1,e=>Dt(ih(V(e,0,`ToJsonObject`)))),Ai(`JsonSerialize`,2,t=>{let n=ch(V(t,0,`JsonSerialize`),Km),r=V(t,1,`JsonSerialize`);if(!br(r)&&!Xm(r))throw new C(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${z(r)}`);return e.writeFile?.(n,nh(r,Km)),!0}),Ai(`ndJsonSerialize`,2,t=>{let n=ch(V(t,0,`ndJsonSerialize`),qm),r=V(t,1,`ndJsonSerialize`),i=br(r);if(!i)throw new C(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${z(r)}`);return e.writeFile?.(n,i.map(e=>`${nh(e,qm)}\n`).join(``)),!0}),Ai(`JsonDeserialize`,1,t=>{let n=ch(V(t,0,`JsonDeserialize`),Jm);return sh(lh(e,n,Jm),Jm)}),Ai(`ndJsonDeserialize`,1,t=>{let n=ch(V(t,0,`ndJsonDeserialize`),Ym);return Yn(lh(e,n,Ym).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>sh(e,Ym)))})],dh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,fh=1e6,ph=(e,t,n,r)=>new C(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),mh=(e,t,n)=>{if(typeof e!=`number`||e<0)throw ph(t,n,`nonnegative integer`,z(e));return e},hh=(e,t,n,r)=>{if(!P(e)||!L(e))throw ph(t,n,r,z(e));return R(e).elements},gh=(e,t,n,r)=>Nn(Array.from({length:t},()=>Nn(e.filter(()=>r.nextDouble()<n)))),_h=(e,t)=>{let n=`RandomSetOfSubsets`,r=mh(V(e,0,n),`first`,n),i=mh(V(e,1,n),`second`,n),a=hh(V(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw ph(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw ph(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return gh(a,r,a.length===0?0:i/a.length,t.getRandom())},vh=e=>[Ai(`RandomSubset`,2,t=>{let n=V(t,0,`RandomSubset`);if(typeof n!=`number`)throw ph(`first`,`RandomSubset`,`nonnegative integer`,z(n));if(n<0)throw Bi(dh,String(n));let r=V(t,1,`RandomSubset`);if(!P(r)||!pr(r)&&!L(r))throw ph(`second`,`RandomSubset`,`a finite set`,z(r));let i=gm(r,e.version);if(i&&i.reduce((e,t)=>e*R(t).elements.length,1)>fh)throw Bi(dh,`Attempted to construct a set with too many elements (>${fh}).`);return Nn(_m(n,r,e.getRandom(),e.version))}),Ai(`RandomSetOfSubsets`,3,t=>_h(t,e)),Ai(`TestRandomSetOfSubsets`,3,t=>Yn(Array.from({length:5},()=>R(_h(t,e)).elements.length)))],yh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,bh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${yh})`,xh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${yh}) throws java.io.IOException`,Sh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${yh})`,Ch=()=>Xn([[`action`,Nn([])],[`state`,Nn([])]]),wh=()=>Xn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Th=e=>Xn([[`name`,e??`UnnamedAction`],[`location`,wh()]]),Eh=(e,t,n)=>{let r=e.map((e,t)=>Yn([t+1,Xn(Object.entries(e))])),i=r.slice(1).map((e,n)=>Yn([r[n],t[n],e])),a=n?[Yn([r[r.length-1],n.action,r[n.start]])]:[];return Xn([[`action`,Nn([...i,...a])],[`state`,Nn(r)]])},Dh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Sm(e).get(t)},Oh=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),z(r));else throw new C(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${z(n)}`)},kh=e=>e.every(e=>e!==void 0),Ah=(e,t)=>Xn(t.variables.map((t,n)=>[t,e[n]])),jh=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!B(e)){if(t.variableIndex.has(r))return!0;let e=dl(r,t);if(e&&!n.has(e)&&(n.add(e),jh(e.body,t,n)))return!0}return hi(e).some(e=>jh(e,t,n))},Mh=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[H(`AssertEq`,2,t=>{let n=V(t,0,`AssertEq`),r=V(t,1,`AssertEq`),i=Qt(n,r);return i||(e(z(`Assertion failed`,!0)),e(z(n,!0)),e(z(r,!0))),i}),qi(`AssertError`,2,e=>{let n=Di(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Bi(bh,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=Ji(e,0,`AssertError`)();try{Ji(e,1,`AssertError`)()}catch(e){if(e instanceof y)return ba(e.message,t.isTool)===r;throw e}return!1}),Ai(`TLCGetOrDefault`,2,e=>{let n=V(e,0,`TLCGetOrDefault`);return Dh(t,n)??V(e,1,`TLCGetOrDefault`)}),{...ki(`TLCGetAndSet`,4,n=>{let r=V(n,0,`TLCGetAndSet`),i=Dh(t,r)??V(n,3,`TLCGetAndSet`),a=Di(n,1,`TLCGetAndSet`);return Oh(t,e,r,a.call([i,V(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Ai(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!kh(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Bi(xh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Yn(t.getBehavior(r).map(e=>Ah(e,n.environment)))}),Ai(`CounterExample`,0,()=>t.counterExample??Ch()),H(`ToTrace`,1,e=>{let t=V(e,0,`ToTrace`);if(!F(t)||!Qt(Fr(t),Nn([`action`,`state`])))throw new y(`The argument of ToTrace should be a CounterExample, but instead it is:\n${z(t)}`);let n=R(Nr(t,`state`)).elements.map(e=>br(e)??[]);return Yn(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),H(`TLCModelValue`,1,e=>{let t=V(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new C(`The argument of ModelValue should be a string, but instead it is:\n${z(t)}`);return Rt(t)}),qi(`TLCDefer`,1,()=>!0),H(`TLCNoOp`,1,e=>V(e,0,`TLCNoOp`)),qi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!kh(r))throw Bi(Sh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||ul(Ji(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new ie(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),qi(`TLCCache`,2,(e,t)=>{let r=Di(e,0,`TLCCache`),a=ri(Ji(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=jh(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),H(`TLCFP`,1,e=>Number(BigInt.asIntN(32,em([V(e,0,`TLCFP`)])))),Ai(`TLCEvalDefinition`,1,(e,t)=>{let n=V(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?dl(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new C(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${z(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new C(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return W({kind:`Identifier`,name:n,location:r.location},t)})]},Nh=(e,t)=>[Ai(`_Track`,2,e=>{let n=String(V(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,V(e,0,`_Track`)===!0?r+1:r),!0}),Ai(`_Counts`,0,()=>xm(t)),Ai(`_CheckName`,1,n=>{let r=String(V(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(z(xm(t),!0)),!1)}),Ai(`_PrintCounts`,0,()=>(e(z(xm(t),!0)),!0))],Ph=e=>String(e).padStart(2,`0`),Fh=e=>`${e.getUTCFullYear()}.${Ph(e.getUTCMonth()+1)}.${Ph(e.getUTCDate())}.${Ph(e.getUTCHours())}${Ph(e.getUTCMinutes())}${Ph(e.getUTCSeconds())}`,Ih=e=>zn([...e].map(([e,t])=>[e,Yn([t])])),Lh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Rh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),zh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Bh=(e,t,n)=>{if(e.version===`1.7.4`?!Rh.has(t)||!e.isStarted&&zh.has(t):!e.isStarted&&Lh.has(t))throw new C(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return Xn([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Xn([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Xn([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Dt(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Dt(Fh(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Th(void 0);case`all`:return Ih(e.registers);case`all:named`:return Ih(Sm(e))}if(t.startsWith(`s:`)){let n=Sm(e).get(t);if(n===void 0)throw new C(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Dt(e.properties.get(t.slice(2))??t);throw new C(`TLCGet(${t}) was undefined.`)},Vh=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new C(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new C(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${z(t)}`);return Bh(e,t,n?.state)},Hh=e=>e.length===0?[[]]:e.flatMap((t,n)=>Hh([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Uh=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&R(e).elements.forEach(Uh),e.kind===`Function`&&e.range.forEach(Uh))},Wh=(t,n)=>[H(`Print`,2,e=>(t(`${N(z(V(e,0,`Print`),!0,!0))} ${N(z(V(e,1,`Print`),!0,!0))}`),V(e,1,`Print`))),H(`PrintT`,1,e=>(t(N(z(V(e,0,`PrintT`),!0,!0))),!0)),H(`Assert`,2,t=>{if(V(t,0,`Assert`)!==!0)throw new C(`The first argument of Assert evaluated to FALSE; the second argument was:\n${N(z(V(t,1,`Assert`)))}`,e.assertViolation);return!0}),H(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),H(`:>`,2,e=>zn([[V(e,0,`:>`),V(e,1,`:>`)]])),H(`@@`,2,e=>{let t=Ei(e,0,`@@`),n=Ei(e,1,`@@`);return Bn([...mt(t),...mt(n)])}),H(`ToString`,1,e=>Dt(z(V(e,0,`ToString`),!0))),H(`TLCEval`,1,e=>{let t=V(e,0,`TLCEval`);return Uh(t),t}),H(`Permutations`,1,e=>{let t=wi(e,0,`Permutations`);return Nn(Hh(t).map(e=>zn(t.map((t,n)=>[t,e[n]]))))}),ki(`SortSeq`,2,e=>{let t=Di(e,1,`SortSeq`);return Yn(Ti(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),n.version===`1.7.4`?Vi({...Ai(`TLCGet`,1,(e,t)=>Vh(n,V(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Vi(qi(`TLCGet`,1,(e,t)=>Vh(n,Ji(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Ai(`TLCSet`,2,e=>{let r=V(e,0,`TLCSet`);return Oh(n,t,r,V(e,1,`TLCSet`)),!0}),Oi(`Any`,Pt),H(`RandomElement`,1,e=>ym(Si(e,0,`RandomElement`),n.getRandom()))],Gh=(e,t)=>e.every(e=>wr(e,t)),Kh=Nn([!1,!0]),qh=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Rn(qh(e,t,r),qh(e,r,n))},Jh=[`\\cup`,`\\cap`,`\\`],Yh=e=>typeof e==`object`&&e.kind===`MixedSet`,Xh=e=>e.kind===`Interval`?R(e).elements:e.elements,Zh=(e,t,n)=>{let r=Xh(t);if(e!==`\\cup`){let t=e===`\\cap`;return Pn(r.filter(e=>wr(e,n)===t))}if(r.length===0)return n;if(!lt(n))return Jt({kind:`SetOperation`,operator:e,left:t,right:n});let i=R(n).elements.filter(e=>!wr(e,t));return Pn([...r,...i])},Qh=[Oi(`TRUE`,!0),Oi(`FALSE`,!1),Oi(`BOOLEAN`,Kh),Oi(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ji(`=`,jn),ji(`#`,(e,t)=>!jn(e,t)),H(`~`,1,e=>!bi(e,0,`~`)),H(`<=>`,2,e=>bi(e,0,`<=>`)===bi(e,1,`<=>`)),H(`/\\`,2,e=>bi(e,0,`/\\`)&&bi(e,1,`/\\`)),H(`\\/`,2,e=>bi(e,0,`\\/`)||bi(e,1,`\\/`)),H(`=>`,2,e=>!bi(e,0,`=>`)||bi(e,1,`=>`)),H(`\\in`,2,e=>wr(V(e,0,`\\in`),V(e,1,`\\in`))),H(`\\notin`,2,e=>!wr(V(e,0,`\\notin`),V(e,1,`\\notin`))),H(`\\subseteq`,2,e=>{let t=xi(e,0,`\\subseteq`),n=V(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&L(t.base)?Gh(R(t.base).elements,n.base):Gh(R(t).elements,n)}),...Jh.map(e=>H(e,2,t=>{let n=V(t,0,e),r=V(t,1,e);if(lt(n)&<(r)&&!Yh(n)&&!Yh(r)){if(e===`\\cup`&&pr(n))return r;let t=e===`\\cup`?Rn:e===`\\cap`?Ln:In;return Cr(()=>t(R(n),R(r)),()=>Zh(e,n,r))}return lt(n)?Zh(e,n,r):e!==`\\`&<(r)?Zh(e,r,n):Jt({kind:`SetOperation`,operator:e,left:n,right:r})})),H(`SUBSET`,1,e=>({kind:`Subset`,base:V(e,0,`SUBSET`)})),H(`UNION`,1,e=>{let t=xi(e,0,`UNION`),n=hn(t)?t.elements.filter(hn):[];if(!hn(t)||n.length!==t.elements.length)return Jt({kind:`Union`,base:t});if(Yh(t)||n.some(Yh)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{wr(t,e)||e.elements.push(t)})),Pn(e.elements)}return n.length===0?Fn:qh(n.map(R),0,n.length)}),H(`DOMAIN`,1,e=>{let t=V(e,0,`DOMAIN`);if(!F(t))throw new y(`DOMAIN expects a function but received ${z(t)}`);return Fr(t)})],$h=Ui(`Integers`,`Neg`,`IntValue`,1),eg=e=>{let t=Ui(e,`DotDot`,`IntervalValue`,2);return[Wi(e,`+`,`Plus`,(e,t)=>e+t),Wi(e,`-`,`Minus`,(e,t)=>e-t),Wi(e,`*`,`Times`,(e,t)=>e*t),Wi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new C(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new C(`0^0 is undefined.`);return e**t}),Wi(e,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new C(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/n)|0;return e<0&&Math.imul(e,n)!==t?e-1:e}let r=Math.floor(t/n);if(Mi(r))throw Ni(`${t} \\div ${n}`);return r}),Wi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new C(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),H(`..`,2,e=>({kind:`Interval`,low:Hi(V(e,0,`..`),t),high:Hi(V(e,1,`..`),t)}))]},tg=eg(`Naturals`),ng=eg(`Integers`),rg=e=>{let t=tg.indexOf(e);return t===-1?void 0:ng[t]},ig=[Oi(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...tg,Ki(`<`,(e,t)=>e<t),Ki(`>`,(e,t)=>e>t),Ki(`<=`,(e,t)=>e<=t),Ki(`>=`,(e,t)=>e>=t,`>`)],ag=[Oi(`Int`,{kind:`InfiniteSet`,name:`Int`}),...ng,Ki(`>=`,(e,t)=>e>=t),H(`-.`,1,e=>{let t=Hi(V(e,0,`-`),$h);if(Mi(-t))throw Ni(`-${t}`);return-t})],og=(e,t,n)=>{let r=V(e,t,n),i=br(r);if(!i)throw new C(`${n}\n${z(r)}`);return i},sg=(e,t,n)=>{let r=V(e,t,n);return typeof r==`string`?r:og(e,t,n)},cg=(e,t,n)=>typeof e==`string`?Dt(e.slice(t,n)):Yn(e.slice(t,n)),lg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,ug=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,dg=(e,t)=>{let n=Bd.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Vi(e,t):e}):t},fg=e=>dg(`Sequences`,[H(`Seq`,1,e=>({kind:`SequenceSet`,base:V(e,0,`Seq`)})),H(`Len`,1,e=>sg(e,0,lg(``,`Len`)).length),H(`\\o`,2,e=>{let t=sg(e,0,ug(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=og(e,1,ug(`t \\o s`,`sequence`));return Yn([...t,...n])}let n=V(e,1,`\\o`);if(typeof n!=`string`)throw new C(`${ug(`t \\o s`,`string`)}\n${z(n)}`);return Dt(t+n)}),H(`Append`,2,t=>Yn([...og(t,0,ug(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),V(t,1,`Append`)])),H(`Head`,1,e=>{let t=og(e,0,lg(``,`Head`));if(t.length===0)throw new C(`Attempted to apply Head to the empty sequence.`);return t[0]}),H(`Tail`,1,e=>{let t=sg(e,0,lg(``,`Tail`));if(t.length===0)throw new C(`Attempted to apply Tail to the empty sequence.`);return cg(t,1)}),H(`SubSeq`,3,e=>{let t=sg(e,0,lg(`first `,`SubSeq`)),n=yi(e,1,`SubSeq`),r=yi(e,2,`SubSeq`);if(n>r)return cg(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new C(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${z(V(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return cg(t,n-1,r)}),ki(`SelectSeq`,2,e=>{let t=Di(e,1,`SelectSeq`);return Yn(og(e,0,lg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new C(`The second argument of SelectSeq should be a operator, but instead it is:\n${z(n)}`);return n}))})]),pg=e=>dg(`FiniteSets`,[H(`IsFiniteSet`,1,e=>{let t=V(e,0,`IsFiniteSet`);if(P(t))return vr(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new y(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${z(t)}\nis a finite set.`:`Attempted to check if the ${ut(t)} ${z(t)} is a finite set.`)}),H(`Cardinality`,1,t=>{let n=V(t,0,`Cardinality`);if(!P(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new C(`Attempted to compute cardinality of the value\n${z(n)}`);return gr(n,e)})]),mg=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),hg=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:ig};case`Integers`:return{extends:[`Naturals`],operators:ag};case`Sequences`:return{extends:[],operators:fg(n.version)};case`FiniteSets`:return{extends:[],operators:pg(n.version)};case`TLC`:return{extends:[],operators:dg(`TLC`,Wh(t,n))};case`Randomization`:return{extends:[],operators:vh(n)};case`_Possible`:return{extends:[],operators:Nh(t,n)};case`Json`:return{extends:[],operators:uh(r)};case`Bags`:return{extends:[],operators:Um(i)};case`TLCExt`:return{extends:[],operators:Mh(t,n)};default:return}},gg=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),_g={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},vg=(e,t)=>{let n=_g[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},yg=`$subexpression`,bg=(e,t)=>new u(`${e} at line ${t.line}, column ${t.column}`),xg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return xg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of hi(e)){let e=xg(r,t,n);if(e)return e}},Sg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Cg=(e,t)=>{let n=e.location,r=Sg(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw bg(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw bg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:yg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:yg,args:e.args,location:n,resolution:wa},location:n}},wg=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:wa})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:wa}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:wa};return Cg({...t,params:[...t.params,...r]},a)},Tg=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw bg(r,i);Ea.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:g(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw bg(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>Go(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw bg(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=ja(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw bg(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&xg(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw bg(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||Za(t.operand,1)!==0)throw bg(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=to(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[Za(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw bg(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=Za(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw bg(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw bg(`Unexpected subexpression selector`,i);let s=r?r.sets:no(n),c=s?.[Za(t.operand,s.length)];if(!c)throw bg(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return wg(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw bg(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return wg(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw bg(`Subexpression selection failed`,i);return Cg(a,o.current)},Eg=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return Qa(e,t,n)},Dg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||hi(e).some(Dg),Og=(e,t,n,r=!1)=>{if(!Dg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Jo(e,e=>Og(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>kg(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>Og(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Jo(e,e=>Og(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Eg(a.name,[],void 0,t):a.kind===`Apply`?Eg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Tg(o,t,a,r);return c!==a&&Ta.add(c),c},kg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Og(e.expression,t,n,!0)}))}),Ag=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},jg=(e,t)=>kg(e,Ag(t.definitions),()=>!1),Mg=(e,t)=>{let n=Ag([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>Og(e,n,i),o=e=>i(e)||!n(e),s=e=>Og(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return kg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?kg(e,n,o):qo(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>Dg(e.body))||e.assumptions.some(e=>Dg(e.expression))?{...p,definitions:e.definitions.map(e=>qo(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Ng=(e,t)=>`${e}${t}`,Pg=(e,t,n)=>`${e}${t}${n}`,Fg=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Ig=(e,t,n)=>`${e},${t},${n}`,Lg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Rg=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),zg=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Bg=(e,t,n,r)=>({...Lg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Vg=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Hg=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Ug=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...Bg(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Wg=Bg(`$Set`,0,[2],[1]),Gg=Bg(`$Junction`,0,[3],[1]),Kg=Bg(`$Choose`,0,[2],[1]),qg=Bg(`$Function`,0,[3],[1]),Jg=Bg(`$FcnApply`,0,[2,2],[1,1]),Yg=Bg(`$RcdSelect`,0,[2,0],[1,1]),Xg=Bg(`'`,2,[1],[0]),Zg=Bg(`ENABLED`,1,[2],[0]),Qg=Bg(`[]`,3,[3],[0]),$g=Bg(`$SquareAct`,2,[2,1],[0,0]),e_=Bg(`$WF`,3,[1,2],[0,0]),t_=Bg(`$TemporalExists`,3,[3],[0]),n_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),r_=e=>e.map(e=>({name:e,arity:0})),i_=(e,t)=>t.location.range?_(`${e}.`,t.location.range):new u(`${e} at line ${t.location.line}, column ${t.location.column}`),a_=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),o_=e=>e.kind!==`Let`&&e.kind!==`Label`,s_=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=v(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Ug.get(t)??gg.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Lg(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(Pg(e,n,t))}),t.data.constraints.forEach((e,t)=>Rg(r.constraints,t,e)),zg(r.argConstraints,Ng(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>zg(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>Vg(e,n))throw new u(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new u(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(Ig(t,n,r)),s=Lg(Math.max(e.level,...t.filter((t,n)=>Hg(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{Hg(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>Rg(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Rg(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Rg(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Rg(s.constraints,t,Vg(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Rg(s.constraints,e,Vg(r,a)))}))}),e.argParams.forEach(e=>{let t=Fg(e),n=a(t.operator)?.operator;n&&Rg(s.constraints,t.param,Vg(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>zg(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>zg(s.argConstraints,Ng(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&zg(s.argConstraints,Ng(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Fg(e),n=a(t.operator);n&&zg(s.argConstraints,Ng(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Fg(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Fg(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(Pg(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(Pg(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(Pg(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,r_(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Lg();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=n_(n,r_(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),l=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw i_(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw i_(`Action used where only temporal formula or state predicate allowed`,e);a_.has(e.operator)&&l(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&o_(n)&&n.kind!==r)throw i_(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=v(e,n);t.constraints.forEach((e,t)=>Rg(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>zg(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof u)||t.sany?t:i_(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Lg();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return l(n,e),i(Gg,n)}case`Prime`:case`Unchanged`:return s(Xg,[e.expression],t);case`Enabled`:return s(Zg,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(Qg,[n])}case`If`:return s(Gg,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Gg,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=s(Gg,[e.body],t,e.bounds.map(e=>e.set),Ua(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw i_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?t_:Gg,[e.body],t,[],e.names);case`Choose`:return s(Kg,[e.body],t,e.set?[e.set]:[],Ha(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(Wg,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(Wg,[e.predicate],t,[e.bound.set],Ha(e.bound.pattern));case`SetMap`:return s(Wg,[e.expression],t,e.bounds.map(e=>e.set),Ua(e.bounds));case`FunctionConstruction`:return s(qg,[e.body],t,e.bounds.map(e=>e.set),Ua(e.bounds));case`Record`:return s(qg,e.fields.map(e=>e.value),t);case`RecordSet`:return s(Wg,e.fields.map(e=>e.value),t);case`Except`:return s(Wg,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Jg,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(Wg,e.args,t)}]);case`Bracket`:return Lg();case`FieldAccess`:return i(Yg,[a(e.record,t),{data:Lg()}]);case`BoxAction`:case`AngleAction`:return s($g,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(e_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Lg()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return hi(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,n_(t,r_(e.names))),i;default:return Jo(e,(e,n)=>(a(e,r,n_(t,r_(n))),e)),i}},_=(e,t,n,r)=>{let i=n_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Lg(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(Ng(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(Pg(e.name,n,t.name))).map(e=>Ig(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(Fg(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Fg(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...Lg(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:a}},c_=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?c_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Lg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Rg(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>zg(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},l_=(e,t,n,r)=>{let i=s_(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?c_(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:g(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=Ro([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?c_(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw p(n)}})),...n],r);if(l.length>0)throw p(l,!1,void 0,r)},u_=(e,t)=>e.maxLevels[t]??3,d_=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=s_({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Rg(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Rg(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>zg(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Fg(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&Rg(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(c_(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=g(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(Ng(e.name,i));a!==void 0&&u_(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=Fg(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=u_(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw p([...r.values()])}},f_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],p_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),m_=new Map(Fd.flatMap(e=>e.map(t=>[t,e[0]]))),h_=e=>m_.get(e)??e,g_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},__=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(g_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},v_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),y_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:h_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:h_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},b_=(e,t)=>{let n=[];for(let r=t;;){let t=y_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},x_=e=>({line:e.line,column:e.column}),S_=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=b_(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}return{references:s,end:e.length}};return i(0,t??``).references},C_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,w_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},T_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&C_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&C_(e[n+1],e[n+2])?n+=C_(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>w_[e])}"`:r.text)}return t},E_=e=>e[2]?.text,D_=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},O_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>O_(e.modules,t)).find(Boolean),k_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:zd.get(i)??t?.(i)??Pp(e,i),s=o===void 0?[]:xe(o),c=D_(s),l=c.get(E_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Ip(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>O_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},A_=(e,t)=>{let n=k_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=b_(t,e+1);r.push({location:x_(t[e]),apply:e=>i.forEach(t=>e.put(v_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:x_(u),apply:t=>t.put(v_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&b_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),p_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(x_(u)),r.push({location:x_(u),apply:e=>e.put(v_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(v_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=h_(e.name);r.push({location:e.location,apply:n=>n.put(v_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(v_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(v_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Aa(e.location,t.location)?-1:+!!Aa(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=__();i.set(e??``,s),Pd.toReversed().forEach(e=>s.put(v_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},j_=(e,t,n)=>A_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),M_=(e,t)=>{let n=A_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},N_=(e,t)=>j_(e,t,`variable`),P_=(e,t,n)=>{let r=k_(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),Id.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=S_(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),h=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},g=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?h(n,r,t):[n,i]};return t},_=g(e=>e.extends),v=g(e=>e.instances),y=/* @__PURE__ */ new Set([void 0]),b=/* @__PURE__ */ new Map;T_(s(void 0)).forEach((e,t)=>{t===3&&Rd.forEach(a),a(e)});let ee=u(void 0);for(;;){let e=_(ee,/* @__PURE__ */ new Set)??v(ee,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;if(f.add(`${t.key}>${n}`),b.set(t.unit,[...b.get(t.unit)??[],n]),!y.has(n)){if(y.add(n),r(n).tokens.length===0){let e=t.unit??E_(r(void 0).tokens);throw m(n,e)}T_(s(n)).forEach(a)}}f_.forEach(a);let x=/* @__PURE__ */ new Set,S=e=>{if(x.has(e))return;x.add(e);let t=b.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(S),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return S(void 0),Ld.forEach(a),[...i]},F_=t=>{switch(t.kind){case`Number`:try{return dt(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Rt(t.name);case`Set`:return Nn(t.elements.map(F_))}},I_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],L_=(e,t)=>{try{return Ip(e)}catch(n){if(!(n instanceof u))throw n;let r=cp(e);throw r===void 0?n:p([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},R_=e=>new u(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),z_=(e,t)=>e.location.range&&t.location.range&&{location:g(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${g(t.location.range)}.`},B_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,V_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:B_(e),H_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:wa},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),U_=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>z(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new y(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Qt(t,r)})});if(t)return t[1];throw new y(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:z(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},W_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||hi(e).some(e=>W_(e,t)),G_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(rs(e),n.get(e)??n.size)),n},K_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),q_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw nl(e);if(e.kind===`Number`&&!du(e.value))throw rl(e);q_(e.kind===`Let`?[...hi(e),...K_(e.instances??[])]:hi(e))}),J_=(e,t)=>{let n=Ip(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Set,s=new Map(Qh.map(e=>[e.name,e])),c=/* @__PURE__ */ new Map,l=bm(e.checkDeadlock,t.seed);l.isWarningEnabled=t.isWarningEnabled??!0,l.isTool=t.isTool??!1,l.version=t.version??`master`;let d=/* @__PURE__ */ new Map,f=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,b=[],ee=/* @__PURE__ */ new Map,x=[],S=[],C=(e,t)=>x.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),te={value:0},ne=e=>`${e}#${te.value++}`,re=[],ie=[],ae=d_(e=>{let t=_.get(e)??ue(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>r.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=/* @__PURE__ */ new Map,w=e=>{let n=c.get(e);if(n)return n;let r=hg(e,t.print,l,t.files,s);if(!r)return;mg.get(e)?.forEach(w);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>w(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{s.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:gg.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:vg(e,t.name)??i.get(t.name)?.range})}),c.set(e,i),i},T=e=>{let t=w(e),n=mg.get(e)??[];return t&&C(e,n),t&&n.includes(`Integers`)&&w(`Integers`),t},E=e=>(q_([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...K_(e.instances)]),e.modules.forEach(E),e);E(n);let D=(e,n)=>{let r=t.loadModule?.(e)??Sd.get(e)??Pp(t.source,e);if(r===void 0)throw m(e,n);let i=L_(r,e);if(i.name!==e)throw p([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return E(i)},le=e=>{let t=S.indexOf(e.name);if(t!==-1)throw new u(`Circular dependency among .tla files; dependency cycle is: ${[...S.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];S.push(e.name),x.push(n);let o=be(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:ie,levelChecks:a});if(x.pop(),S.pop(),i.length>0)throw p(i,!1,void 0,ie);let s=r.find(e=>n.has(e.name)),c=s&&d.get(s.name),l=c&&z_(s,c.module);if(l)throw p([l],!1,void 0,ie);if(s)throw R_(s);return a.forEach(e=>e()),{linked:o,closure:n}},ue=(e,t)=>{let n=d.get(e);if(n)return C(e,ee.get(e)??[]),n;let r=le(D(e,t));return d.set(e,r.linked),ee.set(e,r.closure),C(e,r.closure),r.linked},de=(e,t,n,s,c)=>{let l=c?void 0:T(e.module);if(l)return fe(e,l);let u=c??ue(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=I_(u),f=`#${te.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Lo(jg(e,t),d,t,n);re.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=hs({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Ho(t,p)])),variables:new Set(u.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,c,l)=>{let u=ne(`${c}@${t.name}`),f=l(u);return r.set(u,f),d.length>0&&o.add(f),e.name!==void 0&&se.set(u,`${e.name}!${se.get(n)??c}`),i.set(u,!s),a.set(u,{source:n,prefix:e.params.length}),u},createName:ne});return pe(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&ce.set(r,n),r})},fe=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),pe=(e,t,n,r)=>{let a=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!a.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:i.get(n.key)===!0?e.location.range:n.range}];let a=`${e.name}!${t}`;return[a,{key:r(n.key,a),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},me=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:wa})),he=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:me(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ge=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),O=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=ge(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:me(r,n),location:n}}},_e=(e,t,n,a)=>{let o=e.location,s=a?void 0:T(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=ge(n.arity);return he(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??ue(e.module,n),l=`#${te.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=I_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};re.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>W_(f(e),p),h=d.map(t=>{let n=O(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=hs({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:me(e.params,o),location:o,resolution:wa}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:wa}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:H_(a,i)),i},createName:ne}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=ge(n.arity),a=[...e.params,...i];return he(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ve=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),ye=/* @__PURE__ */ new Map,be=(e,a)=>{let o=Nd(e,t.loadClass?.(e.name),e===n);ye.set(e.name,o.overrides);let s=o.module,c=re.length,l=new Map([...Qh.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...a.symbols]),u=/* @__PURE__ */ new Map,d={location:Mo,errors:[],warnings:[]},p=[d],m=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);V_(n.kind)===V_(e.kind)?d.warnings.push({location:r,message:`Warning: the ${B_(n.kind)} of '${t}' conflicts with \nits ${B_(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${B_(e.kind)} of '${t}' conflicts with \nits ${B_(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,ee=[],x=[...s.constants],S=s.variables.map(e=>e.name),C=s.variables.map(e=>e.location);s.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:T(e);if(n){m(n);return}let r=t??ue(e,s.name);x.push(...r.constants.filter(e=>x.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{S.includes(e)||(S.push(e),C.push(r.variableLocations[t]))}),m(r.exported),r.facts.forEach(e=>v.add(e)),r.modules.forEach((e,t)=>y.set(t,e)),ee.push(r)});let te=new Map(l),ne=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ne.forEach(e=>h.set(e.name,oe(e)));let se=e=>({key:E(e),arity:ja(e),params:Ma(e),kind:No(s,e)?`Theorem`:`Definition`,range:e.location.range}),w=x.length===0&&S.length===0,E=e=>s===n?e.name:`${e.name}@${a.id}`,D=/* @__PURE__ */ new Map,le=()=>new Map([...a.modules,...y]),me=e=>{let t=s.instances.find(t=>t.module===e.name);return t!==void 0&&Aa(e.location,t.location)},he=e=>{let t=s.modules.find(t=>t.name===e.module);return t?me(t)?y.get(t.name):void 0:le().get(e.module)},ge=e=>({imported:l,getInstance:e=>{let t=he(e),n=t?void 0:T(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:s.name};let r=t??ue(e.module,s.name),i=I_(r);return{declarations:i,symbols:pe(e,r.exported,i,e=>e),instancer:s.name}},bound:te,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:E,instanced:D,facts:v,reports:p,warnings:a.warnings}),O=e=>new Map([...l,...ne.filter(t=>Aa(t.location,e)).map(e=>[e.name,oe(e)]),...s.definitions.filter(t=>Aa(t.location,e)).map(e=>[e.name,se(e)])]),xe=e=>{let t=le(),n=t.get(e.name),r=n&&z_(e,n.module);if(n&&!r)throw R_(e);a.nested.push(e);let i={location:e.location,errors:[],warnings:[]};p.push(i);let o=be(e,{id:`${a.id}/${e.name}`,symbols:O(e.location),modules:t,nested:a.nested,errors:i.errors,warnings:i.warnings,levelChecks:a.levelChecks});r&&i.errors.push(r),n||y.set(e.name,o),f.has(e.name)||f.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=de(e,s,ge(s),w,le().get(e.module));D.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>xe(e)}))].sort((e,t)=>Aa(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=Mg(ys(s,(e,t)=>_e(e,t,s.name,he(e))),ve(l));a.errors.push(...zo(Se,ge(Se))),Se.definitions.forEach(e=>{let t=E(e);r.set(t,e),i.set(t,!w);let n=se(e),a=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||a!==void 0&&!Aa(a,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ce={module:Se,constants:x,variables:S,variableLocations:C,visible:l,exported:h,modules:y,extended:ee,facts:/* @__PURE__ */ new Set([...v,...[...Se.theorems,...Se.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,Ce);let we=re.splice(c).map(e=>({location:e.location,check:()=>ae(e)}));return a.levelChecks.push(()=>l_(Se,{constants:new Set(x.map(e=>e.name)),variables:new Set(S),getDefinition:e=>r.get(l.get(e)?.key??e),getQualifiedName:e=>ce.get(l.get(e)?.key??e)},we,ie)),b.push(Ce),Ce},xe=le(n).linked;ie.length>0&&!t.isSanyReported&&t.print(h(ie));let Se=e=>xe.visible.get(e)?.key??e;xe.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(xe,/* @__PURE__ */ new Set);let k=xe.constants.map(e=>e.name),Te=xe.variables,A=e=>e.module===void 0?[e.name,Se(e.name)]:e.module===n.name||k.includes(e.name)?[]:[(d.get(e.module)??f.get(e.module))?.visible.get(e.name)?.key??e.name],Ee=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:xe.constants.find(t=>t.name===e)?.arity??0},De=/* @__PURE__ */ new Map,Oe=/* @__PURE__ */ new Set,ke=(e,t)=>{s.set(e,t),r.delete(e),De.delete(e),Oe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=F_(e.value);An(t),A(e).forEach(e=>{let n=Ee(e);n===0?De.set(e,t):ke(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ae=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ae.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new v(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(F_),F_(e.value)]),Ae.set(t,n)}),Ae.forEach(e=>A(e).forEach(t=>ke(t,U_(e.name,Ee(t)||e.rows[0][0].length,e.rows))));let je=new Map(e.substitutions.flatMap(e=>A(e).map(t=>[t,Se(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!k.includes(n)&&!xe.visible.has(n))throw new v(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new v(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=Se(i),o=r.get(a);if(!(o!==void 0||s.has(a)||De.has(a)||k.includes(i)||Te.includes(i)))throw new v(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(o?.kind===`Operator`&&o.params.length!==(xe.constants.find(e=>e.name===n)?.arity??xe.visible.get(n)?.arity))throw new v(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let Me=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(A)),Ne=(e,t)=>{if(Me.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&Ne(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=Ne(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=he(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),xe.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let Pe=k.filter(e=>!De.has(e)&&!je.has(e)&&!Oe.has(e));if(Pe.length>0&&!t.isUnconfigured)throw new v(`The constant parameter ${j_(t.source,t.loadModule,`constant`).find(e=>Pe.includes(e))??Pe[0]} is not assigned a value by the configuration file.`);t.isTraceRecorded&&s.forEach((e,t)=>{let n=rg(e);n&&s.set(t,n)});let Fe={runtime:l,definitions:r,builtins:s,constants:De,substitutions:je,instanceNames:se,variables:Te,variableIndex:G_(Te,b.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:o,evaluators:/* @__PURE__ */ new WeakMap},Ie=s_({constants:new Set(De.keys()),variables:/* @__PURE__ */ new Set([...Te,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>s.has(e))]),getDefinition:e=>dl(e,Fe)}),Le=e=>{try{W(e,{environment:Fe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};je.forEach((e,t)=>{let n=r.get(e),i=k.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ie.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Le(n.body):void 0;if(i)throw new v(`The configuration file substitutes constant ${t} with non-constant ${e}${_a(i)?``:` - specifically: ${i.message}`}`)}),l.version!==`1.7.4`&&(l.isStarted=!0);let Re=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),ze=M_(t.source,t.loadModule);return{environment:Fe,assumptions:Ce,variableLocations:xe.variableLocations,instanceActions:oe,startupDefinitions:b.filter(e=>!Re.has(e.module.name)||I_(e).length===0).flatMap(e=>ze(e===xe?void 0:e.module.name).flatMap(t=>{let n=r.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:xe.constants,rootSymbols:xe.visible,javaOverrides:b.flatMap(e=>ye.get(e.module.name)??[])}},Y_={kind:`Boolean`,value:!0},X_={kind:`Boolean`,value:!1},Z_=e=>e?Y_:X_,Q_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,$_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,ev=(e,t)=>({kind:e,body:t}),tv=(e,t,n)=>({kind:e,operands:[t,n]}),nv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?nv(e,t.operands).operands:[t])}),rv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return rv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,rv(t)),0)}},iv=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return iv(e.body);case`And`:case`Or`:return e.operands.some(iv)}},av=/* @__PURE__ */ new WeakMap,ov={count:0},sv=e=>{let t=av.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${ov.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(sv).join(`,`)})`;default:return`${e.kind}(${sv(e.body)})`}})();return av.set(e,n),n},cv=(e,t)=>e===t||sv(e)===sv(t),lv=(e,t)=>{let n=sv(t);return e.some(e=>e===t||sv(e)===n)},uv=e=>e===`And`?`Or`:`And`,dv=(e,t)=>{switch(e.kind){case`Boolean`:return t?Z_(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?ev(`Not`,e):e;case`Not`:return dv(e.body,!t);case`And`:case`Or`:return nv(t?uv(e.kind):e.kind,e.operands.map(e=>dv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return ev(n,dv(e.body,t))}}},fv=e=>{switch(e.kind){case`Boolean`:return Z_(!e.value);case`Not`:return e.body;case`And`:case`Or`:return nv(uv(e.kind),e.operands.map(fv));case`Always`:return ev(`Eventually`,fv(e.body));case`Eventually`:return ev(`Always`,fv(e.body));default:return ev(`Not`,e)}},pv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=pv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Z_(t)}return n.length===0?Z_(!t):n.length===1?n[0]:nv(e.kind,n)}case`Not`:{let t=pv(e.body);return t.kind===`Boolean`?Z_(!t.value):ev(`Not`,t)}case`Always`:case`Eventually`:{let t=pv(e.body);return ev(e.kind,t.kind===e.kind?t.body:t)}default:return e}},mv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,hv=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=hv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new y(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>nv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=hv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=mv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:nv(`Or`,t);n.push(ev(`Always`,ev(`Eventually`,e)))}return nv(`Or`,n)}case`Not`:return Q_(e.body)?e:hv(fv(e.body));default:return e}},gv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?gv(e.operands[0]):nv(e.kind,e.operands.map(gv));case`Not`:return e.body.kind===`Not`?gv(e.body.body):ev(`Not`,gv(e.body));case`Always`:case`Eventually`:case`Next`:return ev(e.kind,gv(e.body));default:return e}},_v=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return _v(e.operands[0]);let t=Math.floor(e.operands.length/2);return tv(e.kind,_v(nv(e.kind,e.operands.slice(0,t))),_v(nv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return ev(e.kind,_v(e.body));default:return e}},vv=(e,t)=>{e.kind===`Eventually`&&!lv(t,e)&&t.push(e),`body`in e&&vv(e.body,t),`operands`in e&&e.operands.forEach(e=>vv(e,t))},yv=e=>{let t=e.filter($_),n=e.flatMap(e=>e.kind===`Not`&&$_(e.body)?[e.body]:[]);return!t.some(e=>lv(n,e))},bv=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,ev(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new y(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},xv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:ev(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Sv=(e,t,n)=>e.flatMap(e=>{let r=xv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Cv=e=>[...new Set(e.map(sv))].sort().join(`|`),wv=(e,t)=>{let n=new Set(t.map(Cv));return[...e.filter(e=>!n.has(Cv(e))),...t]},Tv=e=>{let t=bv(e),n=Sv(t,`Always`,`And`),r=Sv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=xv(t,`Eventually`,`Or`);if(n&&!(lv(e,n.first)||lv(e,n.second)))return wv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(lv(e,t.first)||lv(e,t.second))&&!lv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!yv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=xv(t[e],`Always`,`And`);n&&(lv(t,n.first)||t.push(n.first),lv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)lv(t,e.first)&&lv(t,e.second)&&!lv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!yv(t)?[]:i(t)};return a(e)},Ev=e=>({particle:e,successors:[],statePredicates:e.filter(e=>rv(e)<=1)}),Dv=e=>{let t=Tv([e]).map(Ev),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Cv(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of Tv(n)){let n=Cv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Ev(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Ov=(e,t)=>!lv(e,t)||lv(e,t.body),kv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&rv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=mv(e);if(n){let e=rv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(iv(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Av=(e,t)=>{let n=e.findIndex(e=>cv(e,t));return n===-1?(e.push(t),e.length-1):n},jv=e=>{let t=hv(pv(dv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=gv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])kv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:nv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:cv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&_v(e.formula),n=[];t&&vv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Av(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Av(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Av(i,e))}));return{tableau:t&&Dv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Mv=()=>n(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.livenessEvaluationFailure),Nv=()=>n(new ee,e.error),Pv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Fv=/* @__PURE__ */ new WeakMap,Iv=/* @__PURE__ */ new WeakSet,Lv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Rv=(e,t)=>new y(`TLC cannot handle the temporal formula ${Jc(e)}${t===void 0?``:`:\n${t}`}`),zv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=il(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return zv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?zv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=dl(e,n);if(t)return Bv(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?r.isStateLevel&&!r.isLevelConstant?1:0:void 0},o=(e,t)=>r.has(e)?0:B(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Jo(e,(e,a)=>(i.value=Math.max(i.value,zv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Pv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Bv=(e,t)=>{let n=Fv.get(e);if(n!==void 0)return n;Fv.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(zv(e.body,void 0,t),...r.map(e=>zv(e.set,void 0,t)));return Fv.set(e,i),i},Vv=(t,r)=>{try{return wl(t,r)}catch(t){if(!(t instanceof y))throw t;if(!_a(t))return;throw n(new y(`${o(`tlc2.tool.EvalException`)}${t.message}`),e.error)}},Hv=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>Hv(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,Jc(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,Uv(e,t,n));if(e.kind===`Identifier`){let r=B(e)?il(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:dl(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Bv(a,n)>0){if(i.has(a))throw Nv();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=Lv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||zv(e,t,n)===3)){let t=Yl(e,c),r=B(e)?void 0:dl(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,su(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>zv(e.set,t,n)===0),u=l?Vv(e.bounds,c):void 0;if(l&&u){let n=[];if(Tl(e.bounds,u,t,t=>(n.push(...s(e.body,t,Jc(e.body))),!1)),n.length===0)throw Mv();return n}return[{expression:e,scope:t,name:o}]},Uv=(e,t,n)=>{let r=lu(e.definitions,Lv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Iv.add(e.binding);return r},Wv=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),Gv=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?zv(e,t,n):i;if(a===0){let r=W(e,Lv(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${Yc(e)}`);return Z_(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},a={depth:0},o=(e,t,n,r)=>{if(a.depth>=100)throw Nv();a.depth++;let o=f(e,t);a.depth--;let s=rv(o);return s>2?o:i(n,r,s)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=Lv(n,t),s=B(e)||dl(i,n)===void 0?il(t,i):void 0;if(s?.kind===`Thunk`&&Iv.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:B(e)?Xl(i,a):ql(i,n);if(l?.kind!==`Closure`)throw Rv(e);let u=e.kind===`Apply`?e.args:[],d=!B(e)&&dl(i,n)?.isRecursive===!0;return c(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(l.body,su(l,u,a),e,t)),d)},c=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof ee||n&&!r;throw!(t instanceof y)||i?t:Rv(e)}},l=(e,t)=>{let r=zv(e,t,n);if(!e.bounds.every(e=>zv(e.set,t,n)===0)){if(r<=2)return i(e,t,r);throw Rv(e)}let a=[],o=e.kind===`Forall`;try{El(e.bounds,Lv(n,t),t=>(a.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof y)||n instanceof ee)throw n;if(r<=2)return i(e,t,r);throw Rv(e,o&&!_a(n)?n.message:void 0)}return a.length===0?Z_(o):u(e,t,nv(o?`And`:`Or`,a))},u=(e,t,n)=>{let r=rv(n);return r>2?n:i(e,t,r)},d=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!B(e)||e.operator===`=>`),f=(e,t)=>{let a=zv(e,t,n);if(a<=2&&!d(e))return i(e,t,a);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,Uv(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?ev(`Always`,tv(`Or`,ev(`Not`,f(n[0],t)),ev(`Eventually`,f(n[1],t)))):e.operator===`~`&&!B(e)?u(e,t,ev(`Not`,f(n[0],t))):e.operator===`=>`?u(e,t,tv(`Or`,ev(`Not`,f(n[0],t)),f(n[1],t))):s(e,t)}case`And`:case`Or`:return u(e,t,nv(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(!r&&zv(e.condition,t,n)===0){let r=W(e.condition,Lv(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return u(e,t,tv(`Or`,tv(`And`,i,f(e.consequent,t)),tv(`And`,ev(`Not`,i),f(e.alternative,t))))}case`Always`:case`Eventually`:return ev(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=Wv(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=ev(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?ev(`Always`,ev(`Eventually`,tv(`Or`,i,a))):tv(`Or`,ev(`Eventually`,ev(`Always`,i)),ev(`Always`,ev(`Eventually`,a)))}default:throw Rv(e)}};return f(e,t)},Kv=(e,t,n,r,i)=>{let a=e=>Kv(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?ul(W(e.expression,a),`a temporal property predicate`):Lc(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&ul(W(e.unchanged,a),`a subscript`)?!1:ul(W(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return Kv(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new y(`TLC cannot evaluate a temporal formula in a single step`)}},qv=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>qv(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return Kv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Jv=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return Jv(e.body);case`And`:case`Or`:return e.operands.some(Jv);default:return!1}},Yv=e=>e.promises.some(e=>Jv(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),Xv=(e,t)=>e.every((e,n)=>en(e,t[n])),Zv=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Qv=e=>({data:e(1024),length:0,create:e}),$v=(e,t,n)=>{let r=t+n.length;if(r>e.data.length){let t=e.create(Math.max(2*e.data.length,r));t.set(e.data),e.data=t}e.data.set(n,t),e.length=Math.max(e.length,r)},ey=e=>new Int32Array(e).fill(-1),ty=(e,t)=>(e.edgeStarts[t]??-1)!==-1,ny=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},ry=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,iy=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),ay=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},oy=2**53-1,sy=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>Gv(e.expression,e.scope,n)),a=e.map(e=>ev(`Not`,Gv(e.expression,e.scope,n))),o=a.length===1?a[0]:nv(`Or`,a),s=i.length===0?o:nv(`And`,[...i,o]),c=jv(s);if(c.length===0)throw Mv();let l=/* @__PURE__ */ new Map,u=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=sv(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:Qv(e=>new Int32Array(e)),edgeActions:Qv(e=>new Uint8Array(e)),stateResults:Qv(e=>new Uint8Array(e)),initial:[],firstNodes:Qv(ey),lastNodes:Qv(ey),nextSiblings:[],isDone:[],errorNode:void 0})),d={multiplier:1},f=!Su(n),p={environment:n},m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>Kv(e,t,void 0,p.environment,f?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),b=(e,t,n,r)=>g(t,()=>{let t=e.solution.actionChecks;if(!f)return Uint8Array.from(t,e=>+!!Kv(e,n,r,p.environment,/* @__PURE__ */ new Map));let i=h(n),a=m.actions.get(n)??/* @__PURE__ */ new Map;m.actions.set(n,a);let o=a.get(r)??new Int8Array(l.size).fill(-1);return a.set(r,o),Uint8Array.from(e.actionIds,(e,a)=>(o[e]===-1&&(o[e]=+!!Kv(t[a],n,r,p.environment,i)),o[e]))}),ee=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),x=(e,t)=>{if(n.runtime.version===`1.7.4`)return!1;let r=e.nodes[t];return r.particle.length===0&&r.successors.length===1&&r.successors[0]===t},S=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),C=(e,t,n)=>e.solution.tableau?ay(e,t).find(t=>e.nodeTableaux[t]===n):t,te=(e,t,n)=>{let r=iy(e,t,n),i=e.lastNodes.data[t]??-1;return i===-1?$v(e.firstNodes,t,[r]):e.nextSiblings[i]=r,$v(e.lastNodes,t,[r]),r},ne=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;$v(e.edgeTargets,a,n),r.forEach((t,n)=>$v(e.edgeActions,(a+n)*o,t)),$v(e.stateResults,e.nodeStates[t]*i.length,i),e.edgeStarts[t]=a,e.edgeCounts[t]=n.length},re=(e,t,n)=>{let i={slots:Array.from({length:16*d.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&Xv(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*d.multiplier&&d.multiplier++,i.slots.filter(e=>e!==void 0)},ie=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=[],u=s.successors.length>0?b(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!ee(t,r,i,n))continue;if(x(t,r)&&e.errorNode===void 0&&S(e)){e.errorNode=a;return}let o=C(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??te(e,i,r);l.push(s),c.push(u),o===void 0&&ie(e,t,n,i,s)}for(let a of r.getSuccessors(i,n)){let r=b(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!ee(t,n,i,a.state)||a.index===-1)continue;let s=C(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??te(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&ie(e,t,a.state,a.index,u)}}l.length>0&&ne(e,a,l,c,o)},ae=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>ee(t,r,a,e.state)));e.isDone[a]=!0;for(let s of ay(e,a)){let a=[],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=C(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??te(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&ie(e,t,n.state,n.index,d)}}),ne(e,s,a,c,i)}if(e.errorNode!==void 0)return Zv(se(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)iy(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{ty(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),ne(e,i,a,o,r)},se=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)ty(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of ny(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}ty(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new y(`Couldn't re-create liveness trace (path) starting at: ${t}`)},ce=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>ty(e,t)),c=[],l=t=>{let n=ny(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&Ov(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=oy;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=oy,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>ry(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>ny(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=Zv(se(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+m.length+h.length},_={node:r},v=e=>o.has(e),b=e=>{l.push(_.node),_.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&ry(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},o=g.count;if(ny(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!v(r)||!a(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_.node,c,e)&&(m[t]=!0,g.count--)})}return g.count<o?(b(r),d.clear(),!0):(v(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){b(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=ny(e,t).find(e=>v(e)&&!d.has(e))??-1}b(n.unvisited),d.add(n.unvisited)}}let ee=p(r,_.node,s,a);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];ee[ee.length-1]!==n&&ee.push(n)}let x=c[c.length-1];return ee[ee.length-1]===x&&ee.pop(),{prefix:c.slice(0,-1),cycle:[x,...ee.reverse()],isCycleConstrained:Yv(n)}},p=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of ny(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r.link,n.push(t,l,-42),c.push(l);let u={value:r.link++};ny(e,l).forEach((t,r)=>{ty(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u.value=Math.min(u.value,o[t]):o[t]===-1&&s.push(t))}),n.push(u.value)}}};return{branches:u.length,addInitialState:(e,t,r)=>{p.environment=r??n,m.states.clear(),m.actions.clear();try{for(let n of u){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)ee(r,i,void 0,t)&&n.initial.push(C(n,e,i)??te(n,e,i))}}finally{p.environment=n}},addState:(e,t,r,i)=>{p.environment=i??n,m.states.clear(),m.actions.clear();try{let n=re(e,t,r);for(let r of u){let i=n.map(n=>b(r,e,t,n.state)),a=v(r,e,t),o=r.solution.tableau,s=o?ae(r,o,n,i,a,e):oe(r,n,i,a,e);if(s)return s}return}finally{p.environment=n}},findViolation:()=>{for(let e of u)for(let t of e.solution.models){let n=ce(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!qv(a[i].body,t,r,0,n)).map(e=>e.name))]}},cy=`UnnamedAction`,ly={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},uy=e=>{let t=e.range??ly;return Xn([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},dy=e=>{let t=[[`name`,e.name],[`location`,uy(e.location)]];return e.parameters.length===0?Xn(t):Xn([...t,[`context`,Xn(e.parameters)],[`parameters`,Yn(e.parameters.map(e=>e[0]))]])},fy=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),py=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),my=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,hy=e=>e.kind===`Apply`?e.args:[],gy=(e,t,n)=>{let r=my(e);if(r===void 0)return;if(B(e)){let e=il(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=ql(r,n);return i?.kind===`Closure`?i:void 0},_y=(e,t)=>{try{return W(e,py(t,void 0)),!0}catch(e){if(e instanceof l)return!1;throw e}},vy=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&hl(e,t)&&_y(e.body,t),yy=(e,t)=>{let n=dl(e.name,t);return n?.body===e.body&&vy(n,t)},by=(e,t)=>{if(e.kind!==`Identifier`||!B(e))return;let n=il(t,e.name);return n?.kind===`Thunk`?n:void 0},xy=(e,t)=>(e?.params??[]).flatMap(e=>{let n=il(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Sy=(e,t)=>{try{return e()}catch(e){if(e instanceof l)return t();throw e}},Cy=(e,t,n,r,i)=>{let a=hy(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>zv(e,n,i)!==0)?o():Sy(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,py(i,n))]),expression:t,scope:n}],o)},wy=(e,t,n,r,i)=>{let a=()=>({name:n?.name??cy,location:e.location,parameters:xy(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return wy(e.body,lu(e.definitions,py(r,t)),n,r,i);case`Label`:return wy(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>wy(e,t,n,r,i));case`Exists`:return Sy(()=>{let o=[];return El(e.bounds,py(r,t),t=>(o.push(...wy(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=B(e)?void 0:i.get(my(e)??``),s=gy(e,t,r);if(o)return Cy(o,e,t,s,r);if(!s)return[a()];let c=hy(e),l=B(e)?s.name:r.instanceNames.get(my(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return yy(s,r)||c.some(e=>zv(e,t,r)!==0)?u():Sy(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,py(r,t))},parent:e}),s.scope);return wy(s.body,e,{...s,name:l},r,i)},u)},Ty=(e,t,n,r,i)=>{let a=(e,t)=>Ty(e,t,n,r,i);if(e.kind===`Let`){a(e.body,lu(e.definitions,py(n,t)));return}let o=by(e,t);if(o){a(o.expression,o.scope);return}let s=gy(e,t,n);if(s&&yy(s,n))return;if(s&&s.params.length===0){if(zv(s.body,s.scope,n)===1){r.inits.push(fy(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,su(s,e.args,py(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(fy(cy,e));return}let c=zv(e,t,n);c<=1?r.inits.push(fy(cy,e)):c===3&&r.temporals.push(fy(cy,e))},Ey=(e,t,n,r,i)=>{let a=(t,n)=>Ey(e,t,n,r,i);if(t.kind===`Let`){a(t.body,lu(t.definitions,py(r,n)));return}let o=by(t,n);if(o){a(o.expression,o.scope);return}let s=gy(t,n,r);if(s&&yy(s,r))return;if(s&&s.params.length===hy(t).length){a(s.body,t.kind===`Apply`?su(s,t.args,py(r,n)):s.scope);return}if(t.kind===`Forall`&&Sy(()=>(El(t.bounds,py(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(fy(e,a)):zv(a,n,r)<2?i.invariants.push(fy(e,a)):i.impliedTemporals.push(fy(e,t));return}let c=zv(t,n,r);c<=1?i.impliedInits.push(fy(e,t)):c===3&&i.impliedTemporals.push(fy(e,t))},Dy=(e,t)=>{let n=dl(e,t);return n?.kind===`Operator`&&!vy(n,t)?n:void 0},Oy=e=>Xn([[`name`,e.name],[`location`,uy(e.location)]]),ky=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Dy(e.specification,t);a&&(Ty(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...wy(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:ql(e.init,t);o?.kind===`Closure`&&r.inits.push(fy(e.init??``,o.body));let s=e.next===void 0?void 0:ql(e.next,t);return s?.kind===`Closure`&&r.actions.push(...wy(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Dy(e,t);n&&r.invariants.push(fy(e,n.body))}),e.properties.forEach(e=>{let n=Dy(e,t);n&&Ey(e,n.body,void 0,t,r)}),r},Ay=(e,t,n)=>ky(e,t,n).inits,jy=(e,t,n)=>ky(e,t,n).actions,My=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>z(e[1])).join(`,`)})`,Ny=(e,t)=>`${e.name===cy?`Action`:e.name}${t===`1.7.4`?``:My(e)} ${g(e.location.range??ly)}`,Py=e=>`${e.name}${My(e)}`,Fy=(e,t,n,r)=>{let i=ky(e,t,r),a=e=>Nn(e.map(dy)),o=e=>Nn(e.flatMap(e=>{let n=Dy(e,t);return n?[Oy(n)]:[]}));return Xn([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,Nn(t.variables.map((e,t)=>Xn([[`name`,e],[`location`,uy(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},Iy=`paired12`,Ly=(e,t=16)=>e<=t*.75?t:Ly(e,t*2),Ry=(e,t)=>{let n=Ly(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},zy=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),By=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Vy=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Hy=e=>Vy(e).replaceAll(`
|
|
468
|
+
`,`\\n`),Uy=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},writeStuttering:r,close:()=>t?.(e.path,n.join(``))}},Wy=(e,t,n)=>{let r=n===`1.7.4`,i=[`strict digraph DiskGraph {
|
|
469
|
+
`,r?``:`node [shape=box,style=rounded]
|
|
470
|
+
`,e.colorize?`edge [colorscheme="${Iy}"]\n`:``,`nodesep=0.35;
|
|
417
471
|
`,`subgraph cluster_graph {
|
|
418
472
|
`,`color="white";
|
|
419
|
-
`],
|
|
420
|
-
`,`node [ labeljust="l",colorscheme="${
|
|
421
|
-
`,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="${Iy}",style=filled,shape=record ]\n`,...Ry([...o.keys()],By).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${o.get(e)}]\n`),`}`].join(``),u=()=>[...Ry([...a],e=>e[0]).map(e=>`{rank = same; ${Ry([...e[1]],zy).map(e=>`${e};`).join(``)}}\n`),`}
|
|
475
|
+
`,e.colorize&&o.size>1?l():``,`}`].join(``),d=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),i.join(``)+u())};return{writeInitialState:e=>{i.push(`${e.fingerprint} [label="${Hy(e.getLabel())}",style = filled]\n`),s(e),d()},writeSuccessor:(t,n,a,o)=>{let l=e.colorize?String(c(o)):`black`,u=e.actionLabels&&o?Vy(r?o.name:o.signature):``;if(i.push(`${t.fingerprint} -> ${n.fingerprint} [label="${u}",color="${l}",fontcolor="${l}"];\n`),!a){let e=r?``:`,tooltip="${Hy(n.getText())}"`;i.push(`${n.fingerprint} [label="${Hy(n.getLabel())}"${e}];\n`)}s(t),d()},writeStuttering:e=>{i.push(`${e.fingerprint} -> ${e.fingerprint} [style="dashed"];\n`),s(e),d()},close:()=>t?.(e.path,i.join(``)+u())}},Gy=(e,t,n)=>e.dot?Wy(e,t,n):Uy(e,t),Ky=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),qy=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},Jy=t=>n(new y(`${s}${t}`),e.error),Yy=e=>{let t=Dr(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!I(e)||!I(i))throw Jy(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Xy=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(Xy);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},Zy=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,Qy=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new v(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw Jy(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!P(a)||!L(a))throw Jy(`The symmetry operator must specify a set of functions.`);let o=R(a).elements;if(!o.every(F))throw Jy(`The symmetry values must be function records.`);let s=o.map(Yy),c=r.body.kind===`Apply`?r.body.args:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=Xy(Zy(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(sa.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;s.forEach(e=>{e.size>0&&d.set(Ky(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=qy(n,e),r=Ky(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!Zy(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>I(e)&&m.has(e.name))})),d.size===0)return;let g=Math.max(256,Math.floor(4194304/d.size));return{permutations:[...d.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:g})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:g}},$y=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=nb(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(nb(e[r],t));return a}},eb=(e,t)=>{let n=[],r=[];for(let i of e){let e=nb(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(It);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(It(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},tb=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,nb=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=tb(e);if(n===0||n>64)return rb(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=rb(e,t),a=i!==e&&en(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},rb=(e,t)=>{let n=e.kind;if(n===`Set`){let n=eb(e.elements,t);return n?zt(n):e}if(n===`Function`||n===`LazyFunction`&&L(e.domain)){let n=Dr(e),r=$y(n.domain,t),i=$y(n.range,t)??n.range;if(r){let e=zn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Bt(n.domain,e.range):e}return i===n.range?n:Bt(n.domain,i)}if(n===`Interval`||!P(e)||!L(e))return e;let r=R(e),i=$y(r.elements,t);return i?Nn(i):r},ib=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},ab=(e,t,n)=>e.images[t]??=nb(e.images[0],n.permutations[t-1]),ob=(e,t,n,r)=>{let i=ib(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=It(ab(i,t,r),ab(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},sb=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?ob(i,t,n,r):0;if(o!==0)return o<0}return!1},cb=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>sb(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?ab(ib(e,t),r,t):e)},lb=(e,t)=>e*((t-e)/2**64),ub=e=>e.includes(`.`)?e:`${e}.0`,db=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return ub(String(e));let[n,r]=e.toExponential().split(`e`);return`${ub(n)}E${r.replace(`+`,``)}`},fb=e=>e!==void 0&&e>=`0`&&e<=`9`,pb=e=>{if(e===0)return`0.0`;let t=db(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;fb(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;fb(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;fb(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(fb(t[n.next])&&Number(t[n.next])>=5&&(n.result=mb(n.result));fb(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},mb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${mb(r)}.`:n===`9`?`${mb(r)}0`:`${r}${Number(n)+1}`},hb=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},gb=(e,t,n)=>{if(lb(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},_b=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},vb=(e,t)=>({...e,traceOutput:[...e.traceOutput??[],...t]}),yb={line:0,column:0},bb=`Failed to recover the initial state from its fingerprint.`,xb=`Failed to recover the next state from its fingerprint.`,Sb=e=>({kind:`Identifier`,name:e,location:yb}),Cb=/* @__PURE__ */ new Set([`name`,`property`]),wb=(e,t,n)=>{let r=dl(t,n);if(!r)throw new v(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new v(Cb.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},Tb=(e,t,n)=>{if(hl(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return W(Sb(e),Jb(n,void 0,void 0))}catch(e){if(e instanceof y||c(e))return;throw e}},Eb=(e,t,n)=>{let r=wb(e,t,n);if(Tb(t,r,n)!==void 0)throw new v(`The ${e} ${t} cannot be a constant.`);return r},Db=(e,t,n)=>{let r=n.constants.has(t)?void 0:wb(e,t,n),i=r?Tb(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new v(`The ${e} of ${t} is equal to ${z(i)}`);return i===void 0?r:void 0},Ob=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},kb=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Ul(e.startupDefinitions,r),t.invariants.forEach(e=>{Db(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Ab=(t,r)=>{let i=s_({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>dl(e,r)});return t.flatMap(t=>{let a=Db(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
|
|
422
476
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
423
477
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
424
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new m(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Jm(t),scope:void 0}]})},th=(e,t)=>{if(!N(e))return;let n=U(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},nh=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>nh(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=mo(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return nh(n.body,t)}return[e]},rh=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||$(r,e.scope,t)>0)return!1;let i=X(r,_h(t,void 0,void 0,e.scope));if(i===!1)throw new m(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new m(`The operator ${r.name}, which equals ${W(i)},\ncannot be used as a ${n}`);return!0},ih=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=Xm(t,e,r).body,i=Jm(e);if(n.kind!==`Number`&&n.kind!==`String`&&$(i,void 0,r)===0)throw new m(`The ${t} ${e} cannot be a constant.`);return i};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}let i=[],a=[],o=[],s=Xm(`name`,t.specification,r),c=Qm(t.specification,s,r);if(c!==void 0)throw new m(`The value of ${t.specification} is equal to ${W(c)}`);if(wp(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(rh(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new m(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&$(c.expression,s.scope,r)<2)throw n(new m(`TLC cannot handle the temporal formula ${Qa(c.expression)}`),e.error);let l=$(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new m(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new m(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...i,...a],u=e=>`$specification${e}`,d=l.reduce((e,t,n)=>t.scope===void 0?e:{name:u(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),f=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:u(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(f),location:Gm},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},ah=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=$m(`property`,e,t);r&&wp(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(rh(r,t,`property`))return;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){n.actionProperties.push({name:r.name,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:r.scope});return}if(i.kind===`Always`&&$(i.expression,r.scope,t)<=1){let e=i.expression;n.invariants.push({name:e.kind===`Identifier`?e.name:r.name,expression:e,scope:r.scope});return}let a=$(i,r.scope,t);if(a<2)n.initialPredicates.push({name:r.name,expression:i,scope:r.scope});else{if(a===2)throw new m(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},oh=(e,t,n)=>t.flatMap(t=>$m(e,t,n)?[{name:t,expression:Jm(t),scope:void 0}]:[]),sh=(e,t)=>{let n=mo(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},ch=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new m(`_POSSIBLE lists ${n} more than once`);Zm(`possible`,n,t);let i=Jm(n);if($(i,void 0,t)===3)throw new m(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),lh=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||G(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},uh=(e,t)=>e.flatMap(e=>nh(e.expression,t).map(n=>{let r=e.scope===void 0?Xs(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:lh(n,r,t)}})),dh=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},fh=/[\u0100-\uffff]/,ph=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),mh=e=>e.kind===`String`?fh.test(e.value):e.kind===`Set`&&e.elements.some(mh),hh=e=>e.kind===`String`&&fh.test(e.value)||e.kind===`Apply`&&ph.has(e.operator)||qn(e).some(hh),gh=(e,t)=>e.constants.some(e=>mh(e.value)||(e.args??[]).some(mh))||[...t.definitions.values()].some(e=>hh(e.body)||e.kind===`Function`&&e.bounds.some(e=>hh(e.set))),_h=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),vh=(e,t,n)=>po(X(e,t),n),yh=(e,t,n=bh)=>{let r=X(e,t);if(typeof r!=`boolean`)throw new h(n(e,t.environment));return r},bh=(e,t)=>{let n=e.kind===`Identifier`?mo(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?Za(i):Qa(r)}`},xh=()=>{},Sh=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=vh(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Ch=(e,t,n)=>{try{return vh(e,_h(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof h)return{message:e.message};throw e}},wh=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Ch(n.expression,t,`an assumption`);if(e)return{name:Qa(n.expression),trace:[],message:e.message}}},Th=(t,r,i)=>{let a=eh(t.invariants,r),o=ih(t,r),s=ah(t,r),c=uh([...a,...s.invariants],r),u=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(u||s.initialPredicates.length>0||r.variables.length>0))throw new m(`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&u)throw new m(`The configuration file did not specify the next state predicate.`);let d=uh(oh(`constraint`,t.constraints,r),r),f=oh(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Xm(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Xm(`periodic`,t.periodic,r);let p=ch(t.possible,r);if(r.variables.length===0)return;let h=t.symmetry===void 0?[]:Dm(t.symmetry,r);t.view!==void 0&&Xm(`view function`,t.view,r);let g=t.view===void 0?void 0:{name:t.view,expression:Jm(t.view),scope:void 0},_=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Gm};return{...e,unchanged:t}}),v=e=>$(e.expression,void 0,r)>=2,y=p.filter(e=>!v(e)),b=p.filter(v),x=r.runtime,ee={indices:void 0},te=()=>{if(ee.indices)return ee.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return ee.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ee.indices},ne=h.length>0?te():void 0,S=(e,t)=>X(e,_h(r,t,void 0)),re=e=>{let t=te(),n=h.length===0?e:Fm(e,h,t);return qc(g===void 0?t.map(e=>n[e]):[S(g.expression,n)])},C=gh(t,r);x.getFingerprint=re;let ie=()=>{let e=p.find(e=>!x.possibleCounts.get(e.name));if(!e)return;let t=sh(e.name,r),n=t?` at ${Za(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:he(W(fl(x),!0))}};return{properties:s,spec:o,isSymmetric:h.length>0,getTlcOrder:te,getStoredFingerprints:(e,t)=>{if(g!==void 0||C)return BigInt64Array.from(e,re);let n=new BigInt64Array(t.length),r=Xc(te(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(C)return[String(re(e))];let t=h.length===0?e:Fm(e,h,ne);return g===void 0?t:[S(g.expression,t)]},findViolatedInvariant:(t,i)=>c.find(a=>{if(dh(a,t,i))return!1;try{let e=_h(r,t,void 0,a.scope),n=a.membership;return i&&n?!an(t[n.variable],i[n.variable],X(n.set,e)):!yh(a.expression,e)}catch(t){throw i?Oh(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>d.every(n=>dh(n,e,t)||yh(n.expression,_h(r,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!yh(t.expression,_h(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>_.find(n=>{try{return!yh(n.action,_h(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Qa(n.box)}`)&&!vh(n.unchanged,_h(r,e,t,n.scope),`a subscript`)}catch(e){throw Oh(Eh(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>f.every(n=>yh(n.expression,_h(r,e,t),e=>`${l}${bh(e,r)}`)),trackStatePossible:y.length===0?xh:e=>Sh(y,x,_h(r,e,void 0)),trackActionPossible:b.length===0?xh:(e,t)=>Sh(b,x,_h(r,e,t)),findUnwitnessedPossible:ie,findPostconditionViolation:()=>{let e=ie();if(e)return e;for(let e of t.postconditions){let t=Ch(Jm(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},Eh=e=>e instanceof g?n(e,e.exitCode):e,Dh=e=>e instanceof h&&!(e instanceof g)&&!(e instanceof _)?n(new h(`${l}${e.message}`,e),x(e)):Eh(e),Oh=(e,t)=>e instanceof h?n(new h(`${t}\n${e.message}`,e),x(e)):e,kh=t=>{let r=t.dump&&Sm(t.dump,t.writeFile);try{return Ah(t,r)}catch(t){throw d(t)?n(new h(u),e.error):t}finally{r?.close()}},Ah=(t,r)=>{let i=typeof t.config==`string`?ue(t.config):t.config,a=t.onPrint??console.log,o={isMuted:!1},s=e=>{o.isMuted||a(e)},l=e=>{o.isMuted=!0;let t=e();return o.isMuted=!1,t};Ae(Cf(t.source,i,t.loadModule));let f=Nf(i,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:s,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed}),p=f.environment,v=p.runtime;v.pause=t.onPause??(()=>{}),v.getSpecification=()=>fm(i,p,f.variableLocations,f.instanceActions);let y={depth:0},b=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:v.generatedStates,distinctStates:v.distinctStates,queuedStates:v.queueSize,depth:v.generatedStates===0?0:Math.max(y.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),ee=Array.from({length:32},()=>0),te={newStates:0},ne=()=>Math.min(te.newStates,31),S=()=>ee.map((e,t)=>t===ne()?e+1:e),re=()=>({...b(`success`),outDegrees:[...ee],fingerprintDistance:Um(v.distinctStates,v.generatedStates,()=>C?C.getStoredFingerprints(A,ce):BigInt64Array.from(A,v.getFingerprint))}),C=Th(i,p,()=>Sf(t.source,t.loadModule,`variable`)),ie=wh(f.assumptions,p);if(ie)return b(`assumption-violation`,ie);if(!C)return re();let ae=i.postconditions.length>0||i.possible.length>0,w=(e,t,n)=>{if(ae){let e=t.loopStart;v.counterExample=hu(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=C.findUnwitnessedPossible();return r||C.findPostconditionViolation(),b(e,r?{...t,unwitnessed:r}:t)},T=C.spec,E=C.getFingerprintState,D={value:void 0},O=i.view!==void 0||i.symmetry!==void 0,oe=[],k=c(()=>zp(C.properties.liveness,T.temporals,p,{getFingerprint:e=>oe[e]??=Number(BigInt.asIntN(32,v.getFingerprint(A[e]))),getSuccessors:e=>{let t=[];return T.next===void 0||Ja(T.next,e,p,n=>{if(pe(n.state),!(C.satisfiesConstraints(n.state,e)&&C.satisfiesActionConstraints(e,n.state)))return!1;let r=E(n.state),i=De(we(r),r);return t.push({index:i,state:n.state}),!1},T.scope),t}})),se=C.isSymmetric||k!==void 0,A=[],ce=[],le=[],de=[],fe=[],j={slots:new Int32Array(1<<17),size:0,shift:16},pe=Kn(),me=e=>Object.fromEntries(C.getTlcOrder().map(t=>[p.variables[t],e[t]])),he=(e,t,n,r)=>(v.getLevel=()=>n+1,v.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),M(e,t[n].state,(t[n+1]??t[r??n]).state)),M=(e,t,n)=>{try{let r=Zm(`alias`,e,p).body,i=X(Jm(e),_h(p,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return th(i,a)??me(t)}catch(e){if(!(e instanceof m||e instanceof h))throw e;return{...me(t),_ALIASEvalError:e.message}}},ge=(e,t,n)=>{D.value??=cm(i,p,f.instanceActions);let r={...I};Object.assign(I,{index:e,isExpanding:!0,candidate:void 0});let a=E(n),o=D.value.find(e=>Ya(e.expression,t,p,e.scope).some(e=>Te(E(e.state),a)));return Object.assign(I,r),o&&um(o)},N=(e,t,n)=>{let r=i.alias,a=l(()=>(e.length>1&&as(p)&&P(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:ge(t[r-1],e[r-1].state,n.state))));return e.map((t,i)=>({action:t.action,label:a[i],state:r===void 0?me(t.state):he(r,e,i,n)}))},P=()=>T.init===void 0?[]:qa(T.init,p,T.scope),_e=e=>T.next===void 0?[]:Ya(T.next,e,p,T.scope),ve=(e,t)=>Te(E(e),ce[t]),ye=(e,t)=>_e(e).find(e=>ve(e.state,t)),be=(e,t)=>{let n=O||as(p)?P().find(t=>ve(t,e[0])):A[e[0]];if(!n)throw new h(Km);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=ye(i,e[n]);if(!a)throw new h(t);r.push(a)}return r},xe=(e,t)=>{let n=[];for(let t=e;t!==-1;t=le[t])n.unshift(t);let r=O&&n.length>1?be(n,Km):n.map(e=>({state:A[e],action:de[e]}));if(!t)return N(r,n);let i=O?_e(A[e]).find(e=>Te(e.state,t.state))?.action:t.action;return N([...r,{state:t.state,action:i}],n)},F=e=>le[e]===-1?[{action:void 0,label:void 0,state:me(A[e])}]:xe(e),Se=(t,r,i,a)=>{if(d(t))return I.isExpanding?Se(n(new h(u),e.error),F(I.index)):Se(new h(u),r,i);if(!(t instanceof h))throw t;return{...b(`error`,void 0,{message:t.message,trace:r,initialState:i&&!(t instanceof g)?me(i):void 0,exitCode:x(t)}),outDegrees:a}},Ce=(e,t)=>{let n=be(e,qm),r=n[n.length-1].state;if(O&&t!==void 0&&t!==e.length-1&&ye(r,e[t])===void 0)throw new h(qm);return n},we=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Sn(t,Dn(e[n]));return t&1073741823},Te=(e,t)=>{for(let n=0;n<t.length;n++)if(!We(e[n],t[n]))return!1;return!0},Ee=e=>Math.imul(e,2654435761)>>>j.shift<<1,De=(e,t)=>{let n=j.slots.length-1;for(let r=Ee(e);;r=r+2&n){let n=j.slots[r+1];if(n===0)return-1;if(j.slots[r]===e&&Te(ce[n-1],t))return n-1}},Oe=(e,t)=>{let n=j.slots.length-1,r=Ee(e);for(;j.slots[r+1]!==0;)r=r+2&n;j.slots[r]=e,j.slots[r+1]=t},ke=(e,t)=>{if(j.size++,j.size*4>j.slots.length){let e=j.slots;j.slots=new Int32Array(e.length*2),j.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&Oe(e[t],e[t+1])}Oe(e,t+1)},je=e=>{v.distinctStates=A.length+1,y.depth=Math.max(y.depth,e),v.diameter=Math.max(v.diameter,e)},Me=(e,t,n,r)=>{let i=n===-1?1:fe[n]+1;A.push(e),ce.push(t),le.push(n),de.push(r),fe.push(i)},I={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},Ne=e=>e===-1?[]:[...Ne(le[e]),A[e]];v.isSeen=e=>{let t=E(e);return De(we(t),t)!==-1},v.getBehavior=e=>{let t=e===I.candidate?-1:A.indexOf(e);return t===-1?[...Ne(I.index),e]:Ne(t)},v.getCurrentState=()=>I.index===-1?void 0:A[I.index],v.setLivenessSource=e=>{I.livenessSource=e??-1},v.getLevel=e=>{let t=I.livenessSource;return t===-1?e===I.candidate?I.candidateLevel:I.index===-1?0:e===A[I.index]?fe[I.index]:I.isExpanding?fe[I.index]+1:0:e===A[t]?fe[t]:fe[t]+1};let L=(e,t)=>({fingerprint:BigInt.asIntN(64,v.getFingerprint(e)),level:t,getLabel:()=>Wn(i.alias===void 0?me(e):M(i.alias,e,void 0)),getText:()=>Wn(me(e))}),Pe=e=>{pe(e),v.generatedStates++,v.initialStates++,I.candidate=e,I.candidateLevel=1;let t=E(e),n=we(t),i=C.satisfiesConstraints(e);if(i&&C.trackStatePossible(e),i&&De(n,t)!==-1)return;i&&(je(1),v.queueSize++,k?.addInitialState(A.length,e),r?.writeInitialState(L(e,1)));let a=C.findViolatedInvariant(e);if(a)return w(`invariant-violation`,{name:a.name,trace:N([{action:void 0,state:e}],[])});let o=C.findFailedInitialPredicate(e);if(o)return w(`liveness-violation`,{name:o.name,trace:N([{action:void 0,state:e}],[])});i&&(ke(n,A.length),Me(e,t,-1,void 0))},Fe=(e,t,n,i,a)=>{let o=A[e];v.generatedStates++,I.candidate=t.state,I.candidateLevel=fe[e]+1,se&&pe(t.state);let s=E(t.state),c=we(s),l=De(c,s),u=C.satisfiesConstraints(t.state,o);u&&C.trackStatePossible(t.state);let d=u&&C.satisfiesActionConstraints(o,t.state);d&&C.trackActionPossible(o,t.state);let f=d?l:-1;if(i&&d&&r?.writeSuccessor(i,L(t.state,fe[e]+1),f!==-1,a&&{name:a.name,signature:dm(a)}),f!==-1&&k){let e=A[f],r=e.every((e,n)=>e===t.state[n]);n.push({index:f,state:r?e:t.state})}let p=d&&f===-1;if(p&&(je(fe[e]+1),te.newStates++),f===-1)try{let n=C.findViolatedInvariant(t.state,o);if(n)return w(`invariant-violation`,{name:n.name,trace:xe(e,t)})}catch(n){return Se(n,xe(e,t),void 0,S())}let m=C.findViolatedActionProperty(o,t.state);if(m)return w(`liveness-violation`,{name:m.name,trace:xe(e,t)});p&&(se||pe(t.state),ke(c,A.length),k&&n.push({index:A.length,state:t.state}),Me(t.state,s,e,t.action),v.queueSize++)},Ie={result:void 0};if(T.init!==void 0)try{Ka(T.init,p,e=>{try{Ie.result=Pe(e)}catch(t){Ie.result=Se(t,[],e)}return Ie.result!==void 0},T.scope)}catch(e){return Se(e,[])}if(Ie.result)return Ie.result;let Le=T.next;if(Le===void 0){if(A.length>0)throw new h(`No next state actions defined to generate successor states from.`);return re()}let Re=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),ze=(e,t)=>{if(!Re)return Ja(Le,e,p,e=>t(e,void 0),T.scope);D.value??=cm(i,p,f.instanceActions);let n={isStopped:!1};return D.value.reduce((r,i)=>n.isStopped?r:r+Ja(i.expression,e,p,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},Ve=e=>{let t=A[e],n=[],a=r&&L(t,fe[e]),o=ze(t,(t,r)=>{try{Ie.result=Fe(e,t,n,a,r)}catch(n){Ie.result=Se(n,xe(e,t))}return Ie.result!==void 0});if(I.isExpanding=!1,Ie.result)return Ie.result;if(o===0&&i.checkDeadlock)return w(`deadlock`,{name:`deadlock`,trace:F(e)});try{let r=k?.addState(e,t,n);if(!k||!r)return;let i=Ce(r),a=k.getViolatedProperties(i.map(e=>e.state),i.length-1);return w(`property-violation`,{name:a[0],properties:a,trace:N(i,r)})}catch(t){return Se(t,F(e),void 0,S())}},R=(e,t)=>{D.value??=cm(i,p,f.instanceActions);let n=D.value,r=n.length===1?n[0]:n.find(t=>t.name===e.action),a=`variable${e.missing.length>1?`s are`:` is`} not defined: ${e.missing.join(`, `)}.\n`;return v.generatedStates++,Se(n.length===1?e:new h(`Successor state is not completely specified by action ${e.action} of the next-state relation. The following ${a}`),[...F(t),{action:e.action,label:r&&um(r),state:me(e.state.map(e=>e??Be(`null`)))}])},He=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=Ce(n,r),a=N(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(()=>ge(c,u,A[s]));return w(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:d},()=>s===c?a[a.length-1].action:ye(u,s)?.action)},Ue=k!==void 0&&t.livenessCheck!==`final`,Ge=performance.now(),Ke={at:Ge+3e3,size:1,time:0},qe=e=>{let t=performance.now();if(Ke.at=t+6e4,!((e-Ke.size)/Ke.size>.1)||Ke.time>(t-Ge)*.2)return;Ke.size=e;let n=k?.findViolation();return Ke.time+=performance.now()-t,n};for(let e=0;e<A.length&&!v.isStopped;e++){I.index=e,I.candidate=void 0,v.queueSize=A.length-e-1,I.isExpanding=!0;try{Ie.result=Ve(e)}catch(t){Ie.result=t instanceof _?R(t,e):Se(Dh(t),F(e))}if(Ie.result)return Ie.result;if(ee[ne()]++,te.newStates=0,Ue&&performance.now()>=Ke.at){let t=qe(e+1);if(k&&t)return He(k,t)}}I.index=-1,I.candidate=void 0;let Je=k?.findViolation();if(k&&Je)return He(k,Je);let Ye=C.findPostconditionViolation();return Ye?b(`postcondition-violation`,{...Ye,trace:[]}):re()},jh=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Mh=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Dn(e[t]),16777619),r=Math.imul(r^Pn(e[t]),1540483477);t[0]=jh(n)||1,t[1]=jh(r)},Nh=()=>{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)}}},Ph=(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}},Fh=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Ih=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Ph(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Lh=e=>Atomics.load(e.used,0)*2>=e.slots.length,Rh=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Ph(t,n);return{slots:t,used:e.used}},zh=()=>{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=_n(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})}},Bh=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 Be(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=jt({kind:`Interval`,low:e,high:e+t-1});return R(a,i(t))}let a=n[r.index++];if(e===5)return Ve(i(a));let o=i(a);return R(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{ue as A,e as B,qa as C,W as D,Wn as E,v as F,p as I,b as L,m as M,f as N,Me as O,h as P,y as R,as as S,Kn as T,Nf as _,Rh as a,Ac as b,Mh as c,wh as d,Bm as f,Wm as g,Im as h,Fh as i,se as j,Ae as k,kh as l,Um as m,zh as n,Ih as o,Hm as p,Nh as r,Lh as s,Bh as t,Th as u,Sf as v,Ya as w,jc as x,Cf as y,x as z};
|
|
478
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new v(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Sb(t),scope:void 0}]})},jb=(e,t)=>{if(!F(e))return;let n=Dr(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Mb=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Mb(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=dl(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Mb(n.body,t)}return[e]},Nb=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||zv(r,e.scope,t)>0)return!1;let i=W(r,Jb(t,void 0,void 0,e.scope));if(i===!1)throw new v(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new v(`The operator ${r.name}, which equals ${z(i)},\ncannot be used as a ${n}`);return!0},Pb=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return Eb(t,e,r),Sb(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let i=[],a=[],o=[],s=wb(`name`,t.specification,r),c=Tb(t.specification,s,r);if(c!==void 0)throw new v(`The value of ${t.specification} is equal to ${z(c)}`);if(Hv(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Nb(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new v(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&zv(c.expression,s.scope,r)<2)throw n(new y(`TLC cannot handle the temporal formula ${Jc(c.expression)}`),e.error);let l=zv(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new v(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new v(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...i,...a],u=e=>`$specification${e}`,d=l.reduce((e,t,n)=>t.scope===void 0?e:{name:u(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),f=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:u(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(f),location:yb},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},Fb=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=Db(`property`,e,t);if(!i)return;zv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Hv(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(Nb(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&zv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!B(e)?dl(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=zv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new v(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},Ib=(e,t,n)=>t.flatMap(t=>Db(e,t,n)?[{name:t,expression:Sb(t),scope:void 0}]:[]),Lb=(e,t)=>{let n=dl(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Rb=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);Eb(`possible`,n,t);let i=Sb(n);if(zv(i,void 0,t)===3)throw new v(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),zb=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||B(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Bb=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=dl(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},Vb=(e,t)=>e.flatMap(e=>Mb(e.expression,t).map(n=>{let r=e.scope===void 0?vd(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:zb(n,r,t),predicate:Bb(e.expression,t)}})),Hb=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},Ub=/[\u0100-\uffff]/,Wb=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Gb=e=>e.kind===`String`?Ub.test(e.value):e.kind===`Set`&&e.elements.some(Gb),Kb=e=>e.kind===`String`&&Ub.test(e.value)||e.kind===`Apply`&&Wb.has(e.operator)||hi(e).some(Kb),qb=(e,t)=>e.constants.some(e=>Gb(e.value)||(e.args??[]).some(Gb))||[...t.definitions.values()].some(e=>Kb(e.body)||e.kind===`Function`&&e.bounds.some(e=>Kb(e.set))),Jb=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),Yb=(e,t,n)=>ul(W(e,t),n),Xb=(e,t,n=Zb)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},Zb=(e,t)=>{let n=e.kind===`Identifier`?dl(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?qc(i):Yc(r)}`},Qb=(e,t)=>Xb(e.expression,t,(n,r)=>(Xb(e.predicate,t),Zb(n,r))),$b=()=>{},ex=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=Yb(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),tx=(e,t,n)=>{try{return Yb(e,Jb(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},nx=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=tx(n.expression,t,`an assumption`);if(e)return{name:Jc(n.expression),trace:[],message:e.message}}},rx=(t,r,i,a)=>{let o=Ab(t.invariants,r),c=Pb(t,r),l=Fb(t,r,a),u=Vb([...o,...l.invariants],r),d=[...new Map(u.map(e=>[e.predicate,e])).values()],f=u.length>0||l.actionProperties.length>0||l.liveness.length>0;if(c.init===void 0&&(f||l.initialPredicates.length>0||r.variables.length>0))throw new v(r.runtime.version===`1.7.4`?da:`The configuration file did not specify the initial state predicate.`);if(c.next===void 0&&f)throw new v(`The configuration file did not specify the next state predicate.`);let p=Vb(Ib(`constraint`,t.constraints,r),r),m=Ib(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&wb(`rlreward`,t.rlReward,r),t.periodic!==void 0&&wb(`periodic`,t.periodic,r);let h=Rb(t.possible,r);if(r.variables.length===0)return;let g=t.symmetry===void 0?void 0:Qy(t.symmetry,r,t.substitutions);t.view!==void 0&&wb(`view function`,t.view,r);let _=t.view===void 0?void 0:{name:t.view,expression:Sb(t.view),scope:void 0},b=l.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:yb};return{...e,unchanged:t}}),ee=e=>zv(e.expression,void 0,r)>=2,x=h.filter(e=>!ee(e)),S=h.filter(ee),C=r.runtime,te={indices:void 0},ne=()=>{if(te.indices)return te.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return te.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),te.indices},re=(e,t)=>W(e,Jb(r,t,void 0)),ie=e=>{let t=ne(),n=g===void 0?e:cb(e,g,t);return em(_===void 0?t.map(e=>n[e]):[re(_.expression,n)])},ae=qb(t,r);C.getFingerprint=ie;let oe=()=>{let e=h.find(e=>!C.possibleCounts.get(e.name));if(!e)return;let t=Lb(e.name,r),n=t?` at ${qc(t)}`:``;return{name:e.name,code:sa.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${n} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:N(z(xm(C),!0))}};return{properties:l,spec:c,isSymmetric:g!==void 0,isConstrained:p.length>0||m.length>0,getTlcOrder:ne,getStoredFingerprints:(e,t)=>{if(_!==void 0||ae)return BigInt64Array.from(e,ie);let n=new BigInt64Array(t.length),r=rm(ne(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ae)return[String(ie(e))];let t=g===void 0?e:cb(e,g,ne());return _===void 0?t:[re(_.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(Hb(a,t,i))return!1;try{let e=Jb(r,t,void 0,a.scope),n=a.membership;return i&&n?!Er(t[n.variable],i[n.variable],W(n.set,e)):!Qb(a,e)}catch(t){throw i?ux(n(t,e.safetyEvaluationFailure),sa.invariantEvaluationFailed,`Evaluating invariant ${a.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Xb(n,Jb(t,e,void 0,r));p.every(e=>r(e.predicate,e.scope))&&n();let i=d.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=l.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(p.every(e=>Xb(e.predicate,Jb(n,t,void 0,e.scope)))&&m.every(r=>Xb(r.expression,Jb(n,e,t,r.scope))))||r())||d.every(e=>Xb(e.predicate,Jb(n,t,void 0,e.scope))))&&b.every(r=>Xb(r.box,Jb(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>p.every(n=>Hb(n,e,t)||Qb(n,Jb(r,e,void 0))),findFailedInitialPredicate:e=>l.initialPredicates.find(t=>!Xb(t.expression,Jb(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>b.find(n=>{try{return!Xb(n.action,Jb(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Jc(n.box)}`)&&!Yb(n.unchanged,Jb(r,e,t,n.scope),`a subscript`)}catch(e){throw ux(ix(e),sa.actionPropertyEvaluationFailed,`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>m.every(n=>Xb(n.expression,Jb(r,e,t),e=>`${s}${Zb(e,r)}`)),trackStatePossible:x.length===0?$b:e=>ex(x,C,Jb(r,e,void 0)),trackActionPossible:S.length===0?$b:(e,t)=>ex(S,C,Jb(r,e,t)),findUnwitnessedPossible:oe,findPostconditionViolation:(i=!1)=>{let a=t.postconditions.find(e=>{let t=dl(e,r);return t!==void 0&&r.definitionValues.has(t)});if(a!==void 0){if(i)return;throw n(new y(`${s}The post condition ${a} cannot be a constant.`),e.error)}let o=oe();if(o)return o;for(let e of t.postconditions){let t=tx(Sb(e),r,`a postcondition`);if(!t)continue;let n=Lb(e,r),i=n?` at ${qc(n)}`:``;return t.message===void 0?{name:e,code:sa.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:sa.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},ix=e=>e instanceof C?n(e,e.exitCode):e,ax=/* @__PURE__ */ Error(`The replay stopped`),ox=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),sx=t=>{let n=ga(t.message);return n&&!n.isEvalException&&ox.has(n.code)?e.configParseError:oe(t)},cx=t=>{let n=t.cause;return n instanceof y?cx(n):t instanceof C?t.exitCode:e.specEvaluationFailure},lx=/* @__PURE__ */ new WeakMap,ux=(e,t,r)=>{if(!(e instanceof y))return e;let i=n(new y(`${r}\n${e.message}`,e),oe(e));return lx.set(i,{code:t,headline:r,inner:e}),i},dx=s.slice(0,s.indexOf(`
|
|
479
|
+
`)),fx=`${s}tlc2.tool.EvalException: `,px=`${s}util.Assert$TLCRuntimeException: `,mx=o(`tlc2.tool.EvalException`),hx=e=>_a(e)?fx:px,gx=e=>{try{return e()}catch(e){throw e instanceof y?_a(e)?new y(`${mx}${e.message}`):ga(e.message)?e:new y(`${s}${e.message}`):e}},_x=[fx,px,s,mx],vx=(e,t)=>{let n=lx.get(e);if(n)return`${n.headline}\n${vx(n.inner,t)}`;let r=e.message,i=_x.find(e=>r.startsWith(e))??``;return`${i}${ba(r.slice(i.length),t)}`},yx=(e,t)=>{let n=lx.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:vx(e,!0)};if(t&&_a(e))return{code:ga(r)?.code??sa.general,message:r,toolMessage:r};let i=t&&!r.startsWith(dx)?s:``;return{code:sa.general,message:`${i}${r}`,toolMessage:`${i}${vx(e,!0)}`}},bx=e=>{let t=e.dump&&Gy(e.dump,e.writeFile,e.version);try{return Sx(e,t)}catch(e){throw c(e)?xx():e}finally{t?.close()}},xx=()=>n(new ee,e.error),Sx=(t,i)=>{let o=typeof t.config==`string`?it(t.config,t.version):t.config,l=t.onPrint??console.log,u={lines:void 0},d=e=>{u.lines?u.lines.push(e):l(e)},f=e=>{let t=u.lines,n=[];u.lines=n;try{return{result:e(),lines:n}}finally{u.lines=t}};wt(P_(t.source,o,t.loadModule)),Et(t.version);let p=J_(o,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:d,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed,isTool:t.isTool,isTraceRecorded:t.isTraceRecorded,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version});kb(p,o,t.onProgress);let m=p.environment,h=m.runtime,g=h.version===`1.7.4`;h.pause=t.onPause??(()=>{}),h.getSpecification=()=>Fy(o,m,p.variableLocations,p.instanceActions);let _={depth:0,initialStates:void 0},b=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:h.generatedStates,distinctStates:h.distinctStates,queuedStates:h.queueSize,depth:h.generatedStates===0?0:Math.max(_.depth,1),initialStates:_.initialStates,outDegrees:void 0,fingerprintDistance:void 0}),S=Array.from({length:32},()=>0),ne={newStates:0},re=()=>Math.min(ne.newStates,31),ie=()=>S.map((e,t)=>t===re()?e+1:e),ae=()=>g?[...S]:ie(),se=(e,t,n)=>g?[]:e.getViolatedProperties(t,n),ce=(e,t=[...S])=>({...e,violationOutDegrees:t}),w=()=>({...b(`success`),outDegrees:[...S],fingerprintDistance:gb(h.distinctStates,h.generatedStates,()=>T?T.getStoredFingerprints(A,Ee):BigInt64Array.from(A,h.getFingerprint))}),T=rx(o,m,()=>N_(t.source,t.loadModule),t.onProgress),E=()=>nx(p.assumptions,m);if(!T){h.isStarted=!0;let e=E();return e?b(`assumption-violation`,e):(_.initialStates={generated:0,distinct:0},t.onProgress?.({kind:`initial-states-started`}),t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates}),w())}let D=o.postconditions.length>0||o.possible.length>0,le=/* @__PURE__ */ new WeakMap,ue=e=>le.get(e)?.state??e.state,de=e=>{let t=le.get(e)?.action;return t?dy(t):Th(e.action)},fe=(e,t)=>{D&&(h.counterExample=Eh(e.map(ue),e.slice(1).map(de),t));let n=T.findUnwitnessedPossible(),r=n?{result:void 0,lines:[]}:f(()=>T.findPostconditionViolation(!0));return{unwitnessed:n,postcondition:r.result,lines:r.lines}},pe=(e,t,n)=>{let r=t.loopStart,i=fe(t.trace,r===void 0||!n?void 0:{start:r,action:n()}),a=[...t.traceOutput??[],...i.lines];return b(e,{...t,...a.length>0&&{traceOutput:a},...i.unwitnessed&&{unwitnessed:i.unwitnessed},...i.postcondition&&{postcondition:i.postcondition}})},me=T.spec,he=T.getFingerprintState,ge={value:void 0},O=()=>ge.value??=jy(o,m,p.instanceActions),_e=e=>{let t=Lu(m),n=t.callStack;try{e(t);return}catch(e){return c(e)?{callStack:[],fingerprint:void 0}:!(e instanceof y)||!n?void 0:{callStack:n.expressions,fingerprint:n.fingerprint}}},ve=(e,t)=>{if(typeof e!=`object`)return[];let n=t.get(e),r=qr(e).find(e=>Kr(e)!==void 0);return[...n?[n]:[],...r===void 0?[]:ve(r,t)]},ye=(e,t)=>{for(let n of he(e)){let e=Kr(n);if(!e)continue;let r=t?ve(n,t.sources):[];throw t&&r.length>0&&(t.expressions.length=0,t.isFrozen=!0,t.fingerprint={sources:r,reason:e.message}),e}e.forEach(Xt)},be=()=>{let e=tt.fingerprint?[tt.fingerprint]:[];return(t,n)=>{ye(t,n);let r=he(t);return Qe(Je(r),r)!==-1||e.some(e=>Xe(e,r))?!1:(e.push(r),h.distinctStates++,!0)}},xe=()=>{let e={count:0},t=[],n=be();return _e(r=>{if(qs(Ay(o,m,p.instanceActions),r,i=>{if(Ob(e.count,e=>u.lines?.push(e)),e.count++,h.generatedStates=e.count,!(t.length>0))try{let e=T.checkReplayedInitialState(i,r,()=>{n(i,r.callStack)&&(h.queueSize++,k?.addInitialState(A.length,i,r))});if(e){let t=Ie([{action:void 0,state:i}],[]).trace[0].state;throw u.lines?.push({kind:`initial-state-violation`,...e,state:t}),ax}}catch(e){if(!(e instanceof y)||!r.callStack?.fingerprint)throw e;t.push(e)}}),t.length>0)throw t[0]})},Se=e=>_e(t=>{let n=A[e],r=i&&ot(n,ke[e]),a=be();Js(O(),n,t,(o,s)=>{if(!T.checkReplayedSuccessor(n,o,t,()=>{let n=a(o,t.callStack);return r&&i?.writeSuccessor(r,ot(o,ke[e]+1),!n,F?{name:s.name,signature:Py(s)}:void 0),n}))throw ax})}),Ce=o.view!==void 0||o.symmetry!==void 0,we=[];T.properties.liveness.length>0&&t.onProgress?.({kind:`liveness-initializing`,isSymmetric:T.isSymmetric,isConstrained:T.isConstrained});let k=a(()=>gx(()=>sy(T.properties.liveness,me.temporals,m,{getFingerprint:({index:e,state:t})=>we[e]??=Number(BigInt.asIntN(32,h.getFingerprint(t))),getSuccessors:(e,t)=>{let n=[];if(me.next===void 0)return n;let r=M.livenessSource;return M.livenessSource=e,Bc(me.next,t,m,e=>{if(je(e.state),!(T.satisfiesConstraints(e.state,t)&&T.satisfiesActionConstraints(t,e.state)))return!1;let r=he(e.state),i=Qe(Je(r),r);return n.push({index:i,state:e.state}),!1},me.scope),M.livenessSource=r,n}})));h.isStarted=!0;let Te=T.isSymmetric||k!==void 0,A=[],Ee=[],De=[],Oe=[],ke=[],Ae={slots:new Int32Array(1<<17),size:0,shift:16},je=mi(),Me=e=>Object.fromEntries(T.getTlcOrder().map(t=>[m.variables[t],e[t]])),Ne=(e,t,n,r)=>(h.getLevel=()=>n+1,h.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Pe(e,t[n].state,(t[n+1]??t[r??n]).state)),Pe=(e,n,r)=>{try{let t=Eb(`alias`,e,m).body,i=W(Sb(e),Jb(m,n,r)),a=t.kind===`Record`?t.fields.map(e=>e.name):[];return jb(i,a)??Me(n)}catch(e){if(!(e instanceof v||e instanceof y))throw e;return{...Me(n),_ALIASEvalError:ba(e.message,t.isTool??!1)}}},Fe=(e,t,n,r)=>{let i=O(),a={...M};Object.assign(M,{index:e,isExpanding:!0,candidate:void 0});let o=r?e=>e:he,s=o(n),c=i.find(e=>Vc(e.expression,t,m,e.scope).some(e=>Xe(o(e.state),s)));return Object.assign(M,a),c},Ie=(e,n,r={})=>{let i=o.alias,a=r.known??1,s=e.length>1?f(Le).lines:[],c=e.map((t,r)=>r===0||t.action===`Stuttering`?{result:void 0,lines:[]}:f(()=>Fe(n[r-1],e[r-1].state,t.state,a===2&&r===e.length-1))),l=c.map(e=>e.lines),u=r.loopStart,d=g&&u!==void 0?u+1:e.length-a,p=d>0?[s,...l.slice(1,d)].flat():[];return{trace:e.map((n,r)=>{let a=c[r].result,o={action:n.action,label:a&&Ny(a,t.version),state:i===void 0?Me(n.state):Ne(i,e,r,u),output:r===0?p:r<d?[]:l[r]};return(i!==void 0||a)&&le.set(o,{state:Me(n.state),action:a}),o}),traceOutput:a>0&&!g?[s,...l].flat():[]}},Le=()=>me.init===void 0?[]:zc(me.init,m,me.scope),Re=(e,t)=>f(()=>{for(let n of O()){let r=Vc(n.expression,e,m,n.scope).find(t);if(r)return{...r,action:r.action??n.name}}}).result,ze=(e,t)=>Xe(he(e),Ee[t]),j=(e,t)=>Re(e,e=>ze(e.state,t)),Be=(e,t)=>{let n=f(()=>Ce||xu(m)?Le().find(t=>ze(t,e[0])):A[e[0]]).result;if(!n)throw new y(bb);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=j(i,e[n]);if(!a)throw new y(t);r.push(a)}return r},Ve=(e,t)=>{let n=[];for(let t=e;t!==-1;t=De[t])n.unshift(t);let r=Ce&&n.length>1?Be(n,bb):n.map(e=>({state:A[e],action:Oe[e]}));if(!t)return Ie(r,n);let i=Ce?Re(A[e],e=>Xe(e.state,t.state))?.action:t.action;return Ie([...r,{state:t.state,action:i}],n,{known:2})},He=e=>De[e]===-1?{trace:[{action:void 0,label:void 0,state:Me(A[e])}],traceOutput:g?[]:f(Le).lines}:Ve(e),Ue=(e,t)=>({trace:Ve(e,t).trace}),We=(t,n)=>n.isInitial&&!n.callStack&&!n.fingerprint&&g?e.success:n.callStack?n.isCallStackFirst?oe(t):n.isLiveCallStack?r(t)??(t instanceof C?t.exitCode:e.error):n.isInitial||n.fingerprint?e.specEvaluationFailure:cx(t):n.isInitial?sx(t):oe(t),Ge=(e,t,n={})=>{let r=c(e)?new ee:e;if(!(r instanceof y))throw r;let i=t.trace.length>0&&!n.traceFailure?fe(t.trace,void 0):void 0,a=i?.unwitnessed??i?.postcondition,o=[...t.traceOutput??[],...i?.lines??[]];return{...b(`error`,void 0,{...yx(r,n.isNextState??!1),...t,...o.length>0&&{traceOutput:o},...a&&{postcondition:a},initialState:n.initialState&&!(r instanceof C)?Me(n.initialState):void 0,exitCode:We(r,n),callStack:n.callStack,...n.isCallStackFirst&&{isCallStackFirst:!0},...n.fingerprint&&{fingerprint:n.fingerprint},...n.traceFailure&&{traceFailure:n.traceFailure}}),outDegrees:n.outDegrees}},Ke=(n,r)=>{h.generatedStates++;let i=O(),a=i.length===1?i[0]:i.find(e=>e.name===r.action),o=r.variables,s=i.length===1?`the next-state action`:`action ${r.action} of the next-state relation`,c=g?`assigned`:`defined`,l=`Successor state is not completely specified by ${s}. The following variable${o.length>1?`s are`:` is`} not ${c}: ${o.join(`, `)}.\n`,u=Rt(`null`),d=r.state.map(e=>e??u),f=Ge(r,He(n));return ce({...f,failure:f.failure&&{...f.failure,code:sa.incompleteSuccessor,message:l,toolMessage:l,exitCode:e.specEvaluationFailure,trace:[...f.failure.trace,{action:r.action,label:a&&Ny(a,t.version),state:Me(d)}]}})},qe=(e,t)=>{let n=Be(e,xb),r=n[n.length-1].state;if(Ce&&t!==void 0&&t!==e.length-1&&j(r,e[t])===void 0)throw new y(xb);return n},Je=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=zr(t,Jr(e[n]));return t&1073741823},Ye=e=>{for(let t of e){let e=Kr(t);if(e)throw e}},Xe=(e,t)=>{for(let n=0;n<t.length;n++)if(!en(e[n],t[n]))return!1;return!0},Ze=e=>Math.imul(e,2654435761)>>>Ae.shift<<1,Qe=(e,t)=>{let n=Ae.slots.length-1;for(let r=Ze(e);;r=r+2&n){let n=Ae.slots[r+1];if(n===0)return-1;if(Ae.slots[r]===e&&Xe(Ee[n-1],t))return n-1}},$e=(e,t)=>{let n=Ae.slots.length-1,r=Ze(e);for(;Ae.slots[r+1]!==0;)r=r+2&n;Ae.slots[r]=e,Ae.slots[r+1]=t},et=(e,t)=>{if(Ae.size++,Ae.size*4>Ae.slots.length){let e=Ae.slots;Ae.slots=new Int32Array(e.length*2),Ae.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&$e(e[t],e[t+1])}$e(e,t+1)},tt={fingerprint:void 0},nt=e=>{h.distinctStates=A.length+1,_.depth=Math.max(_.depth,e),h.diameter=Math.max(h.diameter,e)},rt=(e,t,n,r)=>{let i=n===-1?1:ke[n]+1;A.push(e),Ee.push(t),De.push(n),Oe.push(r),ke.push(i)},M={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},at=e=>e===-1?[]:[...at(De[e]),A[e]];h.isSeen=e=>{let t=he(e);return Qe(Je(t),t)!==-1},h.getBehavior=e=>{let t=e===M.candidate?-1:A.indexOf(e);return t===-1?[...at(M.index),e]:at(t)},h.getCurrentState=()=>M.index===-1?void 0:A[M.index],h.setLivenessSource=e=>{M.livenessSource=e??-1},h.getLevel=e=>{let t=M.livenessSource;if(g){let e=t===-1?M.isExpanding?M.index:-1:t;return e===-1?0:ke[e]}return t===-1?e===M.candidate?M.candidateLevel:M.index===-1?0:e===A[M.index]?ke[M.index]:M.isExpanding?ke[M.index]+1:0:e===A[t]?ke[t]:ke[t]+1};let ot=(e,t)=>({fingerprint:BigInt.asIntN(64,h.getFingerprint(e)),level:t,getLabel:()=>fi(o.alias===void 0?Me(e):Pe(o.alias,e,void 0)),getText:()=>fi(Me(e))}),st=e=>{je(e),h.generatedStates++,h.initialStates++,M.candidate=e,M.candidateLevel=1;let t=he(e),n=Je(t),r=T.satisfiesConstraints(e);if(r&&(T.trackStatePossible(e),Ye(t),e.forEach(Xt)),r&&Qe(n,t)!==-1)return;tt.fingerprint=r?t:void 0,r&&(nt(1),h.queueSize++,k?.addInitialState(A.length,e),i?.writeInitialState(ot(e,1)));let a=T.findViolatedInvariant(e);if(a)return pe(`invariant-violation`,{name:a.name,...Ie([{action:void 0,state:e}],[])});let o=T.findFailedInitialPredicate(e);if(o)return pe(`liveness-violation`,{name:o.name,...Ie([{action:void 0,state:e}],[])});r&&(et(n,A.length),rt(e,t,-1,void 0))},ct=(e,t,n,r,a)=>{let o=A[e];h.generatedStates++,M.candidate=t.state,M.candidateLevel=ke[e]+1,Te&&je(t.state);let s=he(t.state),l=Je(s),u=Qe(l,s),d=T.satisfiesConstraints(t.state,o);d&&T.trackStatePossible(t.state);let p=d&&T.satisfiesActionConstraints(o,t.state);p&&(T.trackActionPossible(o,t.state),Ye(s),t.state.forEach(Xt));let m=p?u:-1;if(r&&p&&i?.writeSuccessor(r,ot(t.state,ke[e]+1),m!==-1,a&&{name:a.name,signature:Py(a)}),m!==-1&&k){let e=A[m],r=e.every((e,n)=>e===t.state[n]);n.push({index:m,state:r?e:t.state})}let g=p&&m===-1;if(g&&k&&n.push({index:A.length,state:t.state}),tt.fingerprint=g?s:void 0,g&&(nt(ke[e]+1),ne.newStates++),m===-1)try{let n=T.findViolatedInvariant(t.state,o);if(n)return ce(pe(`invariant-violation`,{name:n.name,...Ve(e,t)}))}catch(n){if(c(n))throw n;let r=f(()=>Se(e));return Ge(n,vb(Ue(e,t),r.lines),r.result??{outDegrees:ae()})}let _=T.findViolatedActionProperty(o,t.state);if(_)return ce(pe(`liveness-violation`,{name:_.name,...Ve(e,t)}));g&&(Te||je(t.state),et(l,A.length),rt(t.state,s,e,t.action),h.queueSize++)},N={result:void 0};k&&t.onProgress?.({kind:`liveness-prepared`,branches:k.branches});let P=E();if(P)return b(`assumption-violation`,P);if(t.onProgress?.({kind:`initial-states-started`}),me.init!==void 0)try{Rc(me.init,m,e=>{Ob(h.initialStates,t.onProgress);try{N.result=st(e)}catch(t){let n=f(xe);N.result=Ge(t,{trace:[],traceOutput:n.lines},{initialState:e,...n.result,isInitial:!0})}return N.result!==void 0},me.scope)}catch(e){if(e instanceof te){let t=Ge(e,{trace:[]},{initialState:e.state.map(e=>e??Rt(`null`))});return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}let t=f(xe);return Ge(e,{trace:[],traceOutput:t.lines},{...t.result,isInitial:!0})}if(N.result)return N.result;_.initialStates={generated:h.initialStates,distinct:h.distinctStates},t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates});let lt=me.next;if(lt===void 0){if(A.length>0)throw new y(`No next state actions defined to generate successor states from.`);return w()}let F=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),I=(e,t)=>{if(!F)return Bc(lt,e,m,e=>t(e,void 0),me.scope);let n={isStopped:!1};return O().reduce((r,i)=>n.isStopped?r:r+Bc(i.expression,e,m,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},ut=(e,t)=>{if(!k||g)return;let n=_e(n=>k.addState(e,A[e],t,n));return n?.callStack.length&&!n.fingerprint?n.callStack:void 0},dt=(e,t)=>{try{k?.addState(e,A[e],t);return}catch(n){if(!(n instanceof y))throw n;return ut(e,t)}},ft=(e,t)=>{let n=f(()=>dt(e,t));if(n.result)return{result:{callStack:n.result,fingerprint:void 0,isLiveCallStack:!0},lines:n.lines};let r=f(()=>Se(e));return{result:r.result,lines:[...n.lines,...r.lines]}},pt=e=>Ge(xx(),He(e)),mt=(e,t,n)=>{if(c(e))return pt(t);let r=ft(t,n);return Ge(ix(e),vb(He(t),r.lines),{isNextState:!0,...r.result})},ht=(t,r)=>{let a=A[t],l=i&&ot(a,ke[t]),u=I(a,(e,n)=>{try{N.result=ct(t,e,r,l,n)}catch(n){if(c(n))return N.result=pt(t),!0;let i=g?f(()=>Se(t)):ft(t,r);if(g&&n instanceof y&&!lx.has(n))return N.result=Ge(new y(`${hx(n)}${n.message}`,n),vb({trace:[]},i.lines),{isNextState:!0,...i.result}),!0;let a=he(e.state).some(e=>Kr(e)!==void 0)&&n instanceof y?yx(_a(n)?new y(`${mx}${n.message}`):n,!0):void 0;N.result=Ge(n,vb(a?He(t):Ue(t,e),i.lines),{isNextState:!0,...i.result,traceFailure:a})}return N.result!==void 0});M.isExpanding=!1;let d=N.result;if(d?.violation&&!g){let e=f(()=>dt(t,r));return{...d,violation:vb(d.violation,e.lines),...e.result&&{liveCallStack:e.result}}}if(d)return d;let p=()=>{k&&l&&g&&i?.writeStuttering(l);let e=k?.addState(t,a,r);if(!k||!e)return;let n=qe(e),o=se(k,n.map(e=>e.state),n.length-1);return pe(`property-violation`,{name:o[0],properties:o,...Ie(n,e,{known:0})})};if(u===0&&o.checkDeadlock){let e=pe(`deadlock`,{name:`deadlock`,...He(t)}),n=f(()=>{try{return{additional:p()?.violation}}catch(e){if(!(e instanceof y))throw e;return{isFailed:!0,callStack:ut(t,r)}}}),i=e.violation?{...e,violation:vb(e.violation,n.lines)}:e,a=ce(i,n.result.isFailed?ae():ie());return n.result.additional?{...a,additionalViolation:n.result.additional}:n.result.callStack?{...a,liveCallStack:n.result.callStack}:a}try{return p()}catch(i){if(g&&i instanceof y){let t=new y(`${_a(i)?mx:s}${i.message}`);return Ge(n(t,e.error),{trace:[]},{outDegrees:ae()})}let o=_e(e=>k?.addState(t,a,r,e));return Ge(i,He(t),{outDegrees:ae(),callStack:o?.callStack.length?o.callStack:void 0,isNextState:!0,isCallStackFirst:!0})}},gt=()=>{let e=o.specification,t=`(compare Chapter 8, page 87ff of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`;if(e===void 0)return{code:sa.noSpecificationButProperty,text:`The stuttering counterexample above may be caused by the absence of a behavior specification (SPECIFICATION). Only INIT and NEXT have been provided, so TLC permits infinite stuttering. To rule out such counterexamples, use SPECIFICATION Spec, with Spec asserting a suitable fairness constraint ${t}`};let n=dl(e,m)?.location.range;if(!(me.temporals.length>0||!n))return{code:sa.noFairnessButProperty,text:`The stuttering counterexample above may be caused by the absence of a fairness constraint in the behavior specification ${e} defined at ${qc(n)}. To rule out such counterexamples, conjoin a suitable fairness constraint to ${e} ${t}`}},_t=(e,n)=>{let r=[...n.prefix,...n.cycle],i=n.prefix.length,a=qe(r,i),o=Ie(a,r,{loopStart:i,known:0}).trace,s=se(e,a.map(e=>e.state),i),c=r[i],l=r[r.length-1],u=a[a.length-1].state,d=c===l?{result:void 0,lines:[]}:f(()=>Fe(l,u,A[c],!1)),p=c===l&&n.isCycleConstrained;return pe(`liveness-violation`,{name:s[0],properties:s,trace:o,traceOutput:d.lines,loopStart:i,loopLabel:d.result&&Ny(d.result,t.version),warning:p?gt():void 0},()=>c===l?de(o[o.length-1]):d.result?dy(d.result):Th(j(u,c)?.action))},vt=k!==void 0&&t.livenessCheck!==`final`,yt=performance.now(),bt={at:yt+3e3,size:1,time:0},xt=e=>{let n=performance.now();if(!((e-bt.size)/bt.size>.1)||bt.time>(n-yt)*.2||(bt.size=e,!k))return;t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!1,states:e,statistics:b(`success`)});let r=k.findViolation();return r||t.onProgress?.({kind:`liveness-finished`}),bt.time+=performance.now()-n,r};for(let e=0;e<A.length&&!h.isStopped;e++){M.index=e,M.candidate=void 0,h.queueSize=A.length-e-1,M.isExpanding=!0;let n=[];try{N.result=ht(e,n)}catch(t){N.result=t instanceof x?Ke(e,t):mt(t,e,n)}if(N.result)return N.result;if(S[re()]++,ne.newStates=0,(vt||t.onProgress)&&performance.now()>=bt.at){bt.at=performance.now()+6e4;let n=vt?xt(e+1):void 0;if(k&&n)return _t(k,n);t.onProgress?.({kind:`progress`,statistics:b(`success`)})}}M.index=-1,M.candidate=void 0,k&&t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!0,states:h.distinctStates,statistics:b(`success`)});let St=k?.findViolation();if(k&&St)return _t(k,St);k&&t.onProgress?.({kind:`liveness-finished`});try{let e=T.findPostconditionViolation();if(e)return b(`postcondition-violation`,{name:e.name,message:e.message,counts:e.counts,trace:[],postcondition:e})}catch(e){return Ge(e,{trace:[]})}return w()},Cx=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},wx=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Jr(e[t]),16777619),r=Math.imul(r^ti(e[t]),1540483477);t[0]=Cx(n)||1,t[1]=Cx(r)},Tx=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},Ex=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},Dx=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Ox=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Ex(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},kx=e=>Atomics.load(e.used,0)*2>=e.slots.length,Ax=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Ex(t,n);return{slots:t,used:e.used}},jx=[void 0,`lambda`,`tuple`,`record`],Mx=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=Pr(e.domain);return t?(r(7),r(jx.indexOf(Ut(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(jx.indexOf(Ut(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},Nx=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Rt(t.strings[n[r.index++]]);if(e===5)return zt(i(n[r.index++]));let a=jx[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=qn({kind:`Interval`,low:e,high:e+t-1});return Ht(Bt(o,i(t)),a)}let o=n[r.index++],s=i(o);return Ht(Bt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{ze as $,bd as A,ba as B,Pp as C,cp as D,Lp as E,Vc as F,mi as G,Sa as H,sa as I,Ot as J,fi as K,ca as L,Jc as M,xu as N,Fd as O,zc as P,qe as Q,ua as R,N_ as S,Rp as T,ga as U,Ca as V,hi as W,Et as X,wt as Y,it as Z,lb as _,o as _t,Ax as a,v as at,j_ as b,wx as c,ae as ct,nx as d,d as dt,ye as et,Ob as f,u as ft,gb as g,oe as gt,hb as h,s as ht,Dx as i,ce as it,xd as j,yd as k,bx as l,f as lt,pb as m,re as mt,Mx as n,w as nt,Ox as o,l as ot,kb as p,ie as pt,z as q,Tx as r,se as rt,kx as s,y as st,Nx as t,xe as tt,rx as u,ne as ut,_b as v,e as vt,Ip as w,P_ as x,J_ as y,n as yt,ya as z};
|