tla-ts 0.0.3-dev.6a30eee → 0.0.3-dev.6d0aeb6
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/README.md +5 -1
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +58 -22
- package/dist/index.d.ts +58 -22
- 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 +20 -18
- package/dist/run-cli.js +22 -20
- package/dist/transfer.cjs +40 -15
- package/dist/transfer.js +40 -15
- package/package.json +1 -1
- package/src/ast.ts +101 -1
- package/src/builtins.ts +9 -3
- package/src/check.ts +473 -100
- package/src/cli-options.ts +11 -5
- package/src/codegen.ts +15 -22
- package/src/config.ts +224 -170
- package/src/dependencies.ts +2 -2
- package/src/environment.ts +158 -49
- package/src/errors.ts +93 -3
- package/src/evaluate.ts +214 -147
- package/src/exit-codes.ts +21 -14
- package/src/fingerprints.ts +2 -1
- package/src/instances.ts +16 -15
- package/src/levels.ts +181 -45
- package/src/live-check.ts +132 -70
- package/src/liveness.ts +118 -24
- package/src/parallel-worker.ts +2 -2
- package/src/parallel.ts +5 -2
- package/src/parser.ts +71 -19
- package/src/resolve.ts +490 -95
- package/src/run-cli.ts +104 -18
- package/src/runtime.ts +2 -0
- package/src/sany-lexer.ts +615 -0
- package/src/sany-parse-error.ts +3143 -0
- package/src/spec-description.ts +19 -8
- package/src/standard-modules.ts +54 -45
- package/src/state-graph.ts +157 -0
- package/src/subexpressions.ts +35 -23
- package/src/substitution-levels.ts +38 -17
- package/src/successors.ts +176 -36
- package/src/symmetry.ts +16 -6
- package/src/tableau.ts +51 -24
- package/src/tlc-ext.ts +29 -12
- package/src/tlc-module.ts +14 -33
- package/src/tlc-modules.ts +4 -0
- package/src/tlc-order.ts +8 -4
- package/src/tlc-random.ts +9 -6
- package/src/tlc-summary.ts +20 -5
- package/src/value-sources.ts +29 -0
- package/src/values.ts +242 -61
package/dist/transfer.cjs
CHANGED
|
@@ -6,21 +6,30 @@
|
|
|
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
|
|
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=/* @__PURE__ */ new WeakMap,a=(e,t)=>(i.set(e,t),e),o=e=>e instanceof Error?i.get(e):void 0,s=t=>{try{return t()}catch(t){throw n(t,e.error)}},c=t=>{let r=s(t);return r&&{addInitialState:(t,i)=>{try{r.addInitialState(t,i)}catch(t){throw n(t,o(t)??e.error)}},addState:(e,t,n)=>s(()=>r.addState(e,t,n)),findViolation:()=>s(()=>r.findViolation()),getViolatedProperties:(e,t)=>s(()=>r.getViolatedProperties(e,t))}},l=`TLC threw an unexpected exception.
|
|
10
10
|
This was probably caused by an error in the spec or model.
|
|
11
11
|
See the User Output or TLC Console for clues to what happened.
|
|
12
12
|
The exception was a java.lang.RuntimeException
|
|
13
|
-
:
|
|
14
|
-
|
|
15
|
-
|
|
13
|
+
: `,u=`This was a Java StackOverflowError. It was probably the result
|
|
14
|
+
of an incorrect recursive function definition that caused TLC to enter
|
|
15
|
+
an infinite loop when trying to compute the function or its application
|
|
16
|
+
to an element in its putative domain.`,d=e=>e instanceof RangeError&&e.message===`Maximum call stack size exceeded`;var f=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},p=class extends f{failure;sany;constructor(e,t,n,r){super(e,t),this.name=`TlaSyntaxError`,this.failure=n,this.sany=r}};const m=(e,t=!1,n)=>new p(e.map(e=>`${e.location}\n\n${e.message}`).join(`
|
|
17
|
+
|
|
18
|
+
`),void 0,void 0,{errors:e,isFatal:t,parseError:n});var h=class extends f{constructor(e){super(e),this.name=`TlaParseError`}};const 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)=>m([{location:g(t),message:e}]);var v=class extends f{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},y=class extends f{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}},b=class extends y{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},ee=class extends y{variable;constructor(e,t){super(e),this.name=`TlaEvaluationError`,this.variable=t}},x=class extends y{state;action;missing;constructor(e,t,n){super(`Successor state is not completely specified by the next-state action. The following variable${n.length>1?`s are`:` is`} not defined: ${n.join(`, `)}.\n`),this.name=`TlaEvaluationError`,this.state=e,this.action=t,this.missing=n}},S=class extends y{state;constructor(e){super(`current state is not a legal state`),this.name=`TlaEvaluationError`,this.state=e}},C=class extends f{failure;exception;constructor(e,t={}){super(e),this.name=`TlaProofError`,this.failure=t.exception===void 0?t.failure??e:void 0,this.exception=t.exception??`Failure(${JSON.stringify(this.failure)})`}},w=class extends C{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},T=class extends f{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}};const te=t=>r(t)??(t instanceof p?e.specParseError:t instanceof v?e.configParseError:t instanceof y?e.specEvaluationFailure:e.error),ne=/* @__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`]]),re=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),D=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),O=/* @__PURE__ */ new Map([[`∧`,`/\\`],[`∨`,`\\/`],[`¬`,`~`],[`⇒`,`=>`],[`⟹`,`=>`],[`≡`,`<=>`],[`⇔`,`<=>`],[`∈`,`\\in`],[`∉`,`\\notin`],[`⊆`,`\\subseteq`],[`⊂`,`\\subset`],[`⊇`,`\\supseteq`],[`⊃`,`\\supset`],[`∪`,`\\cup`],[`∩`,`\\cap`],[`×`,`\\X`],[`∀`,`\\A`],[`∃`,`\\E`],[`≠`,`#`],[`≤`,`<=`],[`≥`,`>=`],[`↦`,`|->`],[`→`,`->`],[`⟨`,`<<`],[`⟩`,`>>`],[`□`,`[]`],[`◇`,`<>`],[`≜`,`==`],[`′`,`'`],[`∘`,`\\o`],[`⋅`,`\\cdot`]]),k=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,A=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),ie=e=>e.startsWith(`\\`)?parseInt(e.slice(2),A.get(e[1].toLowerCase())):Number(e),j=/-{4,}[ \t]*MODULE\b/,ae=e=>/[A-Za-z0-9_]/.test(e),oe=(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=O.get(n);if(r)return{text:r,length:n.length};let i=D.find(n=>e.startsWith(n,t));return i?{text:re.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},se=e=>e!==void 0&&e>=`0`&&e<=`9`,ce=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},le=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:ce(e,t+1,se);if(n===t+1||e[n]!==`>`)return 0;let r=ce(e,n+1,ae),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return ce(e,i?r+1:r,e=>e===`.`)-t},ue=(e,t)=>t===` `?e+8-e%8:e+1,de=e=>{let t=j.exec(e);if(!t)throw new p(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
|
|
19
|
+
`),a={index:t.index,line:i.length,lineStart:t.index-i[i.length-1].length,moduleDepth:0},o={lineStart:-1,position:0,width:0},s=()=>{for((o.lineStart!==a.lineStart||o.position>a.index)&&(o.lineStart=a.lineStart,o.position=a.lineStart,o.width=0);o.position<a.index;o.position++)o.width=ue(o.width,e[o.position]);return ue(o.width,e[a.index])},c=(e,t,r)=>{let i=s();n.push({kind:e,text:t,line:a.line,column:i,endColumn:i+r-1}),a.index+=r},l=t=>{for(let n=0;n<t;n++)e[a.index]===`
|
|
20
|
+
`&&(a.line++,a.lineStart=a.index+1),a.index++},u=t=>new p(`${t} at line ${a.line}, column ${s()}`,void 0,{reason:t,line:a.line,column:s(),isEnd:a.index>=e.length});for(;a.index<e.length;){let t=e[a.index];if(t===`
|
|
16
21
|
`||t===` `||t===` `||t===`\r`){l(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
|
|
17
|
-
`,a.index);l((t===-1?e.length:t)-a.index);continue}if(e.startsWith(`(*`,a.index)){let t={value:0};do{if(a.index>=e.length)throw u(`Unterminated comment`);e.startsWith(`(*`,a.index)?(t.value++,l(2)):e.startsWith(`*)`,a.index)?(t.value--,l(2)):l(1)}while(t.value>0);continue}if(e.startsWith(`----`,a.index)){let t=
|
|
22
|
+
`,a.index);l((t===-1?e.length:t)-a.index);continue}if(e.startsWith(`(*`,a.index)){let t={value:0};do{if(a.index>=e.length)throw u(`Unterminated comment`);e.startsWith(`(*`,a.index)?(t.value++,l(2)):e.startsWith(`*)`,a.index)?(t.value--,l(2)):l(1)}while(t.value>0);continue}if(e.startsWith(`----`,a.index)){let t=ce(e,a.index,e=>e===`-`)-a.index;e.slice(a.index+t).trimStart().startsWith(`MODULE`)&&a.moduleDepth++,c(`Separator`,`----`,t);continue}if(e.startsWith(`====`,a.index)){if(c(`ModuleEnd`,`====`,ce(e,a.index,e=>e===`=`)-a.index),a.moduleDepth--,a.moduleDepth<=0)break;continue}if(t===`"`){let t=a.line,r=s(),i=[];for(l(1);e[a.index]!==`"`;){if(a.index>=e.length||e[a.index]===`
|
|
18
23
|
`)throw u(`Unterminated string`);if(e[a.index]===`\\`){let t=e[a.index+1];i.push({n:`
|
|
19
|
-
`,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=
|
|
20
|
-
`)
|
|
21
|
-
`)
|
|
22
|
-
`).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=k.find(e=>r.startsWith(e));if(c){t.push({kind:`Symbol`,text:c,line:n.line}),n.index+=c.length;continue}let l=w(e,n.index);if(!l)throw new p(`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},le=e=>{let t=ce(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`&&se.has(e.text),c=e=>{let t=o();if(t.text!==e)throw new p(`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 p(`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 p(`The keyword ${t} appears twice`);r[e]=l()},m=()=>{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(m());a().text===`,`;)o(),e.push(m());return c(`}`),{kind:`Set`,elements:e}}if(e.kind===`Word`&&!s(e))return{kind:`ModelValue`,name:e.text};throw new p(`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(m()),a().text!==`)`&&c(`,`);o(),c(`=`);let n=h();r.constants.push({name:e,value:m(),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:m(),...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 p(`The keyword CHECK_DEADLOCK appears twice`);i.isSet=!0;let e=o().text;if(e!==`TRUE`&&e!==`FALSE`)throw new p(`CHECK_DEADLOCK expects TRUE or FALSE but found ${JSON.stringify(e)}`);r.checkDeadlock=e===`TRUE`;break}default:throw new p(`Unexpected ${JSON.stringify(e.text)} at line ${e.line}`)}}if(r.specification!==void 0&&(r.init!==void 0||r.next!==void 0))throw new p(`SPECIFICATION cannot be combined with INIT or NEXT`);return r},ue={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:` `}},de=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},fe=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=E(e,t,de);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,fe);if(e.startsWith(`..`,n)&&fe(e[n+2]))return{kind:`Constant`,first:t,last:E(e,n+2,fe)-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=fe(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,fe)-1,children:[]};if(pe(n))return{kind:`Constant`,first:t,last:E(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=ue[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},A=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,j=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),M=e=>typeof e==`object`&&e.kind===`ModelValue`,ge=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:A(e)?`set`:`function`,_e=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new h(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ve={isUsed:!1},ye=(e,t)=>(ve.isUsed=!0,e.writtenKeys=t,e),be=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Yt(e.domain,t)]]),xe=(e,t,n)=>ye(Be(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`),N=(e,t)=>e.length>0&&t.length>0&&Ce(e)!==Ce(t),we=(e,t)=>{ve.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return N(n,r)?ot(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=I(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=I(i[e],a[e]);if(t!==0)return t}return 0},Te=(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=I(n[e],r[e]);if(t!==0)return t}return 0},P=e=>M(e)?e.type:void 0,Ee=(e,t,n)=>{let r=P(e),i=P(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(M(e)&&M(t)){if(r===void 0||i===void 0||r===i)return;throw new m(`Attempted to ${a} the differently-typed model values ${U(e)} and ${U(t)}`)}throw r===void 0?new m(`Attempted to ${a} the typed model value ${U(t)} and the non-model value\n${U(e)}`):new m(`Attempted to ${a}${n?``:` the`} typed model value ${U(e)} and non-model value\n${U(t)}`)},De={ranks:Object.create(null),size:0},Oe=e=>{De.ranks=Object.create(null),De.size=0,Le.clear();for(let t of e)ke(t)},ke=e=>(De.ranks[e]===void 0&&(De.ranks[e]=De.size++),e),Ae=()=>De.size,je=e=>De.ranks[ke(e)],Me=(e,t)=>{if(e===t)return 0;let n=De.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},F=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Ne=(e,t)=>(F(e)||F(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Pe=(e,t,n)=>{if(!F(e))throw new m(`Attempted to ${n} the set ${U(R(e)?z(e):e,!0)} with the value:\n${U(t,!0)}`);if(!F(t))throw new m(`Attempted to compare overridden value ${U(e,!0)} with non-overridden value:\n${U(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new m(`Attempted to compare ${U(e,!0)} with the value\n${U(t,!0)}`)},Fe={kind:`InfiniteSet`,name:`Any`},Ie=e=>{throw new m(`Attempted to compare ANY with the value\n${U(e)}`)},I=(e,t)=>{if(e===t)return ve.isUsed&&Se(e),e===Fe?Ie(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return we(e,t);if(n===`Set`&&r===`Set`)return Te(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&&Ee(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Ee(e,t,!1),n===`ModelValue`?-1:1;if(e===Fe||t===Fe)return Ie(e===Fe?t:e);if(A(e)&&A(t)&&Ne(e,t))return Pe(e,t,`compare`);let i=A(e);if(i!==A(t))throw new m(`Attempted to compare ${ge(e)} ${U(e)} with ${ge(t)} ${U(t)}`);return i?Te(z(e),z(t)):we(H(e),H(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Me(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Ee(e,t,!1),M(e))return-1;if(M(t))return 1;throw new m(`Attempted to compare ${ge(e)} ${U(e)} with ${ge(t)} ${U(t)}`)},Le=/* @__PURE__ */ new Map,Re=e=>{let t=Le.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:je(e)};return Le.set(e,n),n},ze=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),Be=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0}),Ve=(e,t)=>{if(e===t)return ve.isUsed&&Se(e),e!==Fe||Ie(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Ee(e,t,!0),I(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 we(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Te(e,t)===0;if(M(e)||M(t))return Ee(e,t,!0),M(e)&&M(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Ve(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=B(e.domain),r=B(t.domain);if(n||r)return n===r;let i=B(e.range),a=B(t.range);return i||a?i===a:Ve(e.domain,t.domain)&&Ve(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(B(e))return B(t);if(B(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]&&Ve(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return B(e)?B(t):!B(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Ve(e,t.factors[n]));let n=A(e)&&A(t)&&!(R(e)&&R(t));if(n&&Ne(e,t))return Pe(e,t,`check equality of`)===0;if(n){if(!F(e)){let n=z(e);if(!F(t))return Te(n,z(t))===0}return Tn(e)===Tn(t)}return I(e,t)===0},He=(e,t)=>e===t||e.length===t.length&&e.every((e,n)=>Ue(e,t[n])),Ue=(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)&&He(e.elements,t.elements):e.kind===`Function`&&t.kind===`Function`?(e.hash===0||t.hash===0||e.hash===t.hash)&&He(e.domain,t.domain)&&He(e.range,t.range):Tn(e)===Tn(t),We=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},Ge=e=>{if(!j(e))return;let t=H(e);return{domain:t.domain,range:t.range,low:We(t.domain)}},Ke=e=>{if(!j(e))return;let t=H(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},qe=(e,t)=>{if(P(e)!==void 0)throw new m(`Attempted to compare the typed model value ${U(e)} and the non-model value\n${U(t)}`);return 1},Je=(e,t)=>{if(P(e)!==void 0)throw new m(`Attempted to check equality of the typed model value ${U(e)} and the non-model value\n${U(t)}`);return!1},Ye=(e,t)=>{let n=P(e);if(n===void 0)return M(t)?e.rank-t.rank:-1;if(!M(t))throw new m(`Attempted to compare the typed model value ${U(e)} and non-model value\n${U(t)}`);let r=P(t);if(r!==void 0&&r!==n)throw new m(`Attempted to compare the differently-typed model values ${U(e)} and ${U(t)}`);return e.rank-t.rank},Xe=(e,t)=>{let n=P(e);if(n===void 0)return M(t)&&e.name===t.name;if(!M(t))throw new m(`Attempted to check equality of typed model value ${U(e)} and non-model value\n${U(t)}`);let r=P(t);if(r!==void 0&&r!==n)throw new m(`Attempted to check equality of the differently-typed model values ${U(e)} and ${U(t)}`);return e.name===t.name},Ze={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`}},Qe=(e,t,n)=>{let r=Ze[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${U(e)} with ${r.other}:\n${U(t)}`},$e=(e,t,n)=>{let r=Ge(n);if(!r){if(M(n))return qe(n,t);throw new m(`Attempted to compare the function ${U(t)} with the value:\n${U(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>et(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 et(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 m(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${U(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},et=(e,t)=>{for(let n=0;n<e.length;n++){let r=ot(e[n],t[n]);if(r!==0)return r}return 0},tt=(e,t)=>{let n=H(e);if(e.kind===`Function`&&Xt(n)!==void 0){let r=j(t)?Xt(t):void 0;return r?n.range.length-r.length||et(n.range,r):$e({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=Ke(t);if(!r){if(M(t))return qe(t,e);throw new m(`Attempted to compare record:\n${U(e)}\nwith non-record\n${U(t)}`)}return n.domain.length-r.domain.length||et(n.domain,r.domain)||et(n.range,r.range)}return $e({...n,low:We(n.domain)},e,t)},nt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),rt=(e,t)=>F(e)||F(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),it=(e,t)=>{let n=nt(t)?t:z(t);return{elements:z(e).elements,otherElements:z(n).elements}},at=(e,t)=>{if(rt(e,t))return I(e,t);if(!nt(e))return at(z(e),t);if(!A(t)){if(M(t))return qe(t,e);throw new m(`Attempted to compare the set ${U(e)} with the value:\n${U(t)}`)}let n=it(e,t);return n.elements.length-n.otherElements.length||et(n.elements,n.otherElements)},ot=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return I(e,t);if(M(t))return qe(t,e);throw new m(Qe(e,t,!1))}return e.kind===`ModelValue`?Ye(e,t):j(e)?tt(e,t):at(e,t)},st=(e,t)=>e.every((e,n)=>dt(e,t[n])),ct=(e,t,n)=>{let r=Ge(n);if(!r){if(M(n))return Je(n,t);throw new m(`Attempted to check equality of the function ${U(t)} with the value:\n${U(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&st(e.range,r.range);let i=e.low??r.low;return i===void 0?st(e.domain,r.domain)&&st(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new m(`Attempted to compare an integer with non-integer:\n${U(e)}.`);return e===i+t})&&st(e.range,r.range)},lt=(e,t)=>{let n=H(e);if(e.kind===`Function`&&Xt(n)!==void 0){let r=j(t)?Xt(t):void 0;return r?n.range.length===r.length&&st(n.range,r):ct({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=Ke(t);if(!r){if(M(t))return Je(t,e);throw new m(`Attempted to check equality of record:\n${U(e)}\nwith non-record\n${U(t)}`)}return n.domain.length===r.domain.length&&st(n.domain,r.domain)&&st(n.range,r.range)}return ct({...n,low:We(n.domain)},e,t)},ut=(e,t)=>{if(rt(e,t))return Ve(e,t);if(!nt(e))return ut(z(e),t);if(!A(t)){if(M(t))return Je(t,e);throw new m(`Attempted to check equality of the set ${U(e)} with the value:\n${U(t)}`)}let n=it(e,t);return n.elements.length===n.otherElements.length&&st(n.elements,n.otherElements)},dt=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(M(t))return Je(t,e);throw new m(Qe(e,t,!0))}return e.kind===`ModelValue`?Xe(e,t):j(e)?lt(e,t):ut(e,t)},ft=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=ot(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},pt=(e,t)=>t.some(t=>dt(t,e)),mt=(e,t)=>{try{return Ve(e,t)}catch(n){if(!(n instanceof m))throw n;return dt(e,t)}},ht=e=>{for(let t=1;t<e.length;t++)if(I(e[t-1],e[t])>=0)return!1;return!0},gt=e=>{if(e.length<2||ht(e))return ze(e);let t=[...e].sort(I),n=[t[0]];for(let e=1;e<t.length;e++)I(n[n.length-1],t[e])!==0&&n.push(t[e]);return ze(n)},_t=e=>{try{return gt(e)}catch(t){if(!(t instanceof m))throw t;return{kind:`MixedSet`,elements:e}}},vt=ze([]),yt=(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&&I(r[a],t)<0;)a++;a<r.length&&I(r[a],t)===0||i.push(t)}return i.length===n.length?e:ze(i)},bt=(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&&I(r[a],t)<0;)a++;a<r.length&&I(r[a],t)===0&&i.push(t)}return i.length===n.length?e:ze(i)},xt=(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=I(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=ze(i);if(e.hash!==0){let t=e.hash;for(let e=0;e<a.length;e++)t=t+pn(a[e])|0;c.hash=t}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+bn(a[e])|0;c.fingerprint=t}return c},St=e=>{let t=e.length<2?e:[...e].sort((e,t)=>I(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&I(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Be(n,r)},Ct=e=>{let t=St(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:ye(t,e.map(e=>e[0]))},wt=[],Tt=[],Et=/* @__PURE__ */ new WeakMap,Dt=e=>{let t=wt[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return wt[e]=n,n},Ot=e=>{if(Kt(e),e.low===1&&e.high>=1)return Dt(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},kt=e=>e.length>0&&(e===wt[e.length]||Et.has(e)),At=e=>{let t=z(e).elements;return kt(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},jt=e=>{let t=Tt[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Tt[e]=n,n},L=e=>Be(Dt(e.length),e),Mt=e=>St(e),Nt=e=>A(e)&&!F(e),Pt=(e,t=!1)=>`UNION(${U(e.base,t)})`,Ft=e=>{if(!Nt(e.base))throw new m(`Attempted to enumerate the nonenumerable set:\n${Pt(e)}`);return z(e.base).elements},It=(e,t,n)=>{if(Nt(e))return e;throw new m(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${U(e)}\nwhen enumerating:\n${Pt(n)}`)},R=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 R(e.base);case`FunctionSet`:return R(e.domain)&&R(e.range)||Lt(e.domain)===!0||Lt(e)===!0;case`RecordSet`:return e.sets.every(R)||Lt(e)===!0;case`ProductSet`:return e.factors.every(R)||Lt(e)===!0;case`Union`:return R(e.base)&&z(e.base).elements.every(R);case`SetOperation`:return e.operator===`\\cup`?R(e.left)&&R(e.right):e.operator===`\\cap`?R(e.left)||R(e.right):R(e.left);default:return!1}},Lt=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=Lt(e.domain);return t===void 0?void 0:!t&&Lt(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Lt(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return R(e)?z(e).elements.length===0:void 0;default:return}},Rt=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},zt=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},Bt=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(ze(r.map(t=>e[t])));while(zt(r,e.length))}return t},Vt=e=>{if(typeof e!=`object`)throw new m(`Expected a set but found ${U(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return ft(e.elements);case`Interval`:{let t=Ot(e);return t!==wt[t.length]&&Et.set(t,e),t}case`Subset`:{F(e.base)&&Kt(e.base);let t=z(e.base).elements;if(t.length>30)throw new m(`SUBSET of a set with ${t.length} elements is too large to enumerate`);return Bt(t)}case`FunctionSet`:{if(B(e))return[];if(F(e.domain))throw new m(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${U(e.domain)}\ncannot be enumerated.`);let t=At(e.domain);if(t.length>0&&F(e.range))throw new m(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${U(e.range)}\ncannot be enumerated.`);let n=t.length===0?[]:z(e.range).elements;return Rt(t.map(()=>n)).map(e=>Be(t,e))}case`RecordSet`:{if(B(e))return[];let t=e.sets.map((t,n)=>{if(F(t))throw new m(`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${U(t)}`);return z(t).elements});return Rt(t).map(t=>Mt(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(B(e))return[];let t=e.factors.map((e,t)=>{if(F(e))throw new m(`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${U(e)}`);return z(e).elements});return Rt(t).map(L)}case`FilteredSet`:if(F(e.base))throw new m(`Attempted to enumerate { x \\in S : p(x) } when S:\n${U(e.base)}\nis not enumerable`);return z(e.base).elements.filter(e.test);case`Union`:{let t=Ft(e).flatMap((t,n)=>z(It(t,n,e)).elements);return z(_t(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(F(e.left)||F(e.right)))throw new m(`Attempted to enumerate S \\cup T when S:\n${U(e.left)}\nand T:\n${U(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&F(e.left)&&F(e.right))throw new m(`Attempted to enumerate S \\cap T when neither S:\n${U(e.left)}\nnor T:\n${U(e.right)}\nis enumerable`);if(e.operator===`\\`&&F(e.left))throw new m(`Attempted to enumerate S \\ T when S:\n${U(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return xt(z(e.left),z(e.right)).elements;let t=e.operator===`\\`||R(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return z(n).elements.filter(t=>V(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new m(`Attempted to enumerate the non-enumerable set ${U(e)}`);default:throw new m(`Expected a set but found ${U(e)}`)}},Ht=/* @__PURE__ */ new WeakMap,z=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return ze(Vt(e));let t=typeof e==`object`?Ht.get(e):void 0;if(t)return t;let n=Vt(e),r=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?ze(n):gt(n);return typeof e==`object`&&Ht.set(e,r),r},Ut=e=>{if(typeof e!=`object`||Ht.has(e))return z(e).elements;if(e.kind===`Union`)return Ft(e).flatMap((t,n)=>Ut(It(t,n,e)));if(e.kind===`FilteredSet`&&!F(e.base))return Ut(e.base).filter(e.test);if(e.kind!==`SetOperation`)return z(e).elements;if(e.operator===`\\cup`)return F(e.left)||F(e.right)?z(e).elements:[...Ut(e.left),...Ut(e.right)];let t=e.operator===`\\`||R(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return F(n)?z(e).elements:Ut(n).filter(t=>V(t,r)===(e.operator===`\\cap`))},B=e=>{if(typeof e!=`object`||!A(e))throw new m(`Shouldn't call isEmpty() on value ${U(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new m(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(B);case`RecordSet`:return e.sets.some(B);case`FunctionSet`:return!B(e.domain)&&B(e.range);case`Union`:return Ft(e).every((t,n)=>B(It(t,n,e)));default:return z(e).elements.length===0}},Wt=(e,t)=>e.reduce((e,n)=>{let r=e*Kt(n);if(r>2147483647)throw new m(t());return r},1),Gt=e=>`Overflow when computing the number of elements in:\n${U(e)}`,Kt=e=>{if(typeof e!=`object`)return z(e).elements.length;switch(e.kind){case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new m(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new m(`Attempted to compute the number of elements in the overridden value ${U(e)}.`);case`Subset`:{let t=Kt(e.base);if(t>=31)throw new m(Gt(e));return 2**t}case`FunctionSet`:{if(B(e.domain))return 1;if(B(e.range))return 0;let t=Kt(e.range);if(t===1)return 1;let n=Kt(e.domain),r={value:1};for(let i=0;i<n;i++)if(r.value*=t,r.value>2147483647)throw new m(Gt(e));return r.value}case`RecordSet`:return B(e)?0:Wt(e.sets,()=>Gt(e));case`ProductSet`:return B(e)?0:Wt(e.factors,()=>`Overflow when computing the number of elements in ${U(e)}`);default:return z(e).elements.length}},qt=e=>`Attempted to check if the set ${U(e)}is finite.`,Jt=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new m(`Attempted to check if the ${ge(e)} ${U(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new m(`Attempted to check if the function:\n${U(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Jt(e.base)&&B(e.base);case`Subset`:return Jt(e.base);case`FunctionSet`:{let t=Jt(e.domain);if(t&&B(e.domain))return!0;let n=Jt(e.range);return n&&B(e.range)?!0:n&&(t||Kt(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(!Jt(e))n.isAllFinite=!1;else if(B(e))return!0;return n.isAllFinite}case`Union`:if(!Nt(e.base))throw new m(`Attempted to check if the nonenumerable set:\n${Pt(e)}\nis a finite set.`);return z(e.base).elements.every(Jt);case`SetOperation`:if(e.operator===`\\cup`)return Jt(e.left)&&Jt(e.right);if(e.operator===`\\cap`){if(!Jt(e.left)&&!Jt(e.right))throw new m(qt(e));return!0}if(Jt(e.left))return!0;if(!Jt(e.right))throw new m(qt(e));return!1;case`FilteredSet`:if(!Jt(e.base))throw new m(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${U(e.base)}\nis finite.`);return!0}},Yt=(e,t)=>{let n={low:0,high:e.length-1};for(;n.low<=n.high;){let r=n.low+n.high>>1,i=I(e[r],t);if(i===0)return r;i<0?n.low=r+1:n.high=r-1}return-1},Xt=e=>{if(typeof e!=`object`||!j(e))return;let t=H(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Zt=(e,t)=>`Attempted to check if the value ${U(e)} is an element of ${U(t)}`,Qt=(e,t)=>{let n=`Attempted to check if the value:\n${U(e)}\nis an element of the`;if(!j(t))return`${n} ${ge(t)} ${U(t)}`;let r=t.kind===`Function`||R(t.domain)?H(t).domain:[];return r.length>0&&r.every(e=>typeof e==`string`)?`Attempted to check if element:\n${U(e)}\nis in the record:\n${U(t)}`:r.every((e,t)=>e===t+1)?`Attempted to check set membership in a tuple value.`:`${n} function ${U(t)}`},V=(e,t)=>{if(!A(t))throw new m(Qt(e,t));switch(t.kind){case`Set`:try{return Yt(t.elements,e)!==-1}catch(n){if(!(n instanceof m))throw n;return pt(e,t.elements)}case`MixedSet`:return pt(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!M(e))throw new m(`Attempted to check if the value:\n${U(e)}\nis in the integer interval ${U(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(M(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new m(`Attempted to check if the value:\n${U(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!A(e))throw new m(Zt(e,t));return z(e).elements.every(e=>V(e,t.base));case`FunctionSet`:{if(!j(e)){if(M(e))return!1;throw new m(Zt(e,t))}let n=H(e),r=We(n.domain);return(r===void 0?mt(t.domain,ze(n.domain)):mt({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>V(e,t.range))}case`RecordSet`:{let n=j(e)?H(e):void 0;if(!n||!Ce(n.domain)){if(M(e))return!1;throw new m(`Attempted to check if non-record\n${U(e)}\nis in the set of records:\n${U(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Yt(n.domain,e);return i!==-1&&V(n.range[i],t.sets[r])})}case`ProductSet`:{let n=j(e)?Xt(e):void 0;if(n===void 0){if(j(e)&&H(e).domain.every(e=>typeof e==`number`)||M(e))return!1;throw new m(`Attempted to check if non-tuple\n${U(e)}\nis in the set of tuples:\n${U(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>V(e,t.factors[n]))}case`FilteredSet`:return V(e,t.base)&&t.test(e);case`Union`:if(!Nt(t.base))throw new m(`Attempted to check if:\n ${U(e)}\nis an element of the non-enumerable set:\n ${Pt(t)}`);return z(t.base).elements.some(t=>V(e,t));case`SetOperation`:return t.operator===`\\cup`?V(e,t.left)||V(e,t.right):V(e,t.left)&&V(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Xt(e);if(n===void 0){if(M(e))return!1;throw new m(Zt(e,t))}return n.every(e=>V(e,t.base))}default:throw new m(Qt(e,t))}},$t=(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?V(e,n):e.range.every((e,r)=>$t(e,t.range[r],n.range)),H=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){R(e.domain)||Kt(e.domain);let t=At(e.domain);return Be(t,t.map(t=>e.apply(t)))}throw new m(`Expected a function but found ${U(e)}`)},en=/* @__PURE__ */ new WeakSet,tn=e=>(en.add(e),e),nn=(e,t)=>typeof e==`object`&&en.has(e)?`In applying the function\n${he(U(e))},\nthe first argument is:\n${he(U(t))}\nwhich is not in its domain.\n`:`Attempted to apply function ${U(e)} to ${U(t)}, which is not in its domain`,rn=(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 Yt(e,t)},an=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!V(t,e.domain))throw new m(en.has(e)?nn(e,t):`Attempted to apply a function to ${U(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new m(`Attempted to apply ${U(e)}, which is not a function`);let r=rn(e.domain,t);if(r===-1)throw new m(n?.(e)??nn(e,t));return e.range[r]},on=e=>kt(e)?Et.get(e)??jt(e.length):void 0,sn=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=H(e).domain;return on(t)??ze(t)},cn=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!R(e.domain))){if(!V(t,e.domain))return e;let r=n(e.apply(t));return{kind:`LazyFunction`,domain:e.domain,apply:n=>mt(t,n)?r:e.apply(n),source:e.source}}let i=H(e),a=rn(i.domain,t);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Be(i.domain,o);if(l.writtenKeys=i.writtenKeys,i.hash!==0){let e=i.domain[a];l.hash=s===c?i.hash:i.hash-mn(e,s)+mn(e,c)|0}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-xn(e,s)+xn(e,c)|0}return l},ln=/* @__PURE__ */ new WeakMap,un=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},dn=(e,t)=>Math.imul(e^t,16777619),fn=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return un(t)},pn=e=>un(gn(e)+2654435769|0),mn=(e,t)=>un(Math.imul(gn(e),668265261)+gn(t)|0),hn=e=>{if(e.kind===`ModelValue`)return un(dn(fn(e.name),109));if(A(e)){if(!R(e))return fn(Tn(e));let t=z(e).elements,n=1940243425;for(let e=0;e<t.length;e++)n=n+pn(t[e])|0;return n}let t=H(e),n=1725019383;for(let e=0;e<t.domain.length;e++)n=n+mn(t.domain[e],t.range[e])|0;return n},gn=e=>{if(typeof e==`number`)return un(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return fn(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=hn(e)),e.hash;let t=ln.get(e);if(t!==void 0)return t;let n=hn(e);return ln.set(e,n),n},_n=/* @__PURE__ */ new WeakMap,vn=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},yn=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return vn(t)},bn=e=>vn(Cn(e)+2135587861|0),xn=(e,t)=>vn(Math.imul(Cn(e),374761393)+Cn(t)|0),Sn=e=>{if(e.kind===`ModelValue`)return vn(yn(e.name)^60);if(A(e)){if(!R(e))return yn(Tn(e));let t=z(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+bn(t[e])|0;return n}let t=H(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+xn(t.domain[e],t.range[e])|0;return n},Cn=e=>{if(typeof e==`number`)return vn(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return yn(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Sn(e)),e.fingerprint;let t=_n.get(e);if(t!==void 0)return t;let n=Sn(e);return _n.set(e,n),n},wn=/* @__PURE__ */ new WeakMap,Tn=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=wn.get(e);if(t!==void 0)return t;let n=En(e);return wn.set(e,n),n},En=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${Tn(e.base)}>`;if(e.kind===`FilteredSet`&&!R(e))throw new m(`Attempted to compare the non-enumerable set ${U(e)} with another value`);if(A(e))return R(e)?`{${z(e).elements.map(Tn).join(`,`)}}`:`<${e.kind} ${U(e)}>`;let t=H(e);return`(${t.domain.map((e,n)=>`${Tn(e)}:${Tn(t.range[n])}`).join(`,`)})`},Dn=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,On=e=>e.reduce((e,t)=>e===0?0:e*Kt(t),1),kn=e=>{if(e.kind===`Subset`)return Kt(e.base)<=6?z(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return z(e);if(e.kind===`FunctionSet`&&R(e.domain)&&Kt(e.domain)===0)return ze([Be([],[])]);let t=e.kind===`FunctionSet`?Kt(e.range)**Kt(e.domain):On(e.kind===`RecordSet`?e.sets:e.factors);return t===0?vt:t<=1999?z(e):void 0},An=(e,t)=>{if(t)return kn(e);if(R(e))try{return kn(e)}catch(e){if(e instanceof m)return;throw e}},jn=(e,t)=>{let n=e=>U(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return`{x \\in ${n(e.base)} : ...}`;case`Union`:return Pt(e,t)}},Mn=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),U=(e,t=!1,n=!1)=>{let r=e=>U(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Dn(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(z(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=An(e,t);return n?r(n):jn(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{if(e.kind===`LazyFunction`&&!R(e.domain)){let t=e.source;return t?`[${t.parameters.map(e=>`${e.name} \\in ${U(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}let t=H(e);return t.domain.every((e,t)=>e===t+1)?`<<${t.range.map(r).join(`, `)}>>`:t.domain.every(e=>typeof e==`string`&&Mn(e))?`[${(n||t.hash!==0||t.fingerprint!==0?t.domain.map((e,n)=>[e,t.range[n]]):be(t)).map(e=>`${String(e[0])} |-> ${r(e[1])}`).join(`, `)}]`:`(${t.domain.map((e,n)=>`${r(e)} :> ${r(t.range[n])}`).join(` @@ `)})`}}},Nn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Pn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=gn(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Ue(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Ue(i[e],n))return i[e]}return n.kind===`Set`?Nn(n.elements,t):(Nn(n.domain,t),Nn(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}},Fn=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),In=(e,t)=>Fn.has(e)?new m(t):new h(t),Ln=e=>typeof e==`object`&&e.kind===`Operator`,W=(e,t,n)=>{let r=e[t];if(r===void 0||Ln(r))throw In(n,`${n} expects a value as argument ${t+1}`);return r},Rn=(e,t,n)=>{let r=W(e,t,n);if(typeof r!=`number`)throw In(n,`${n} expects an integer but received ${U(r)}`);return r},zn=(e,t,n)=>{let r=W(e,t,n);if(typeof r!=`boolean`)throw In(n,`${n} expects a boolean but received ${U(r)}`);return r},Bn=(e,t,n)=>{let r=W(e,t,n);if(!A(r))throw In(n,`${n} expects a set but received ${U(r)}`);return r},Vn=(e,t,n)=>{let r=Bn(e,t,n);if(!R(r))throw In(n,`${n} cannot enumerate the non-enumerable set ${U(r)}`);return r},Hn=(e,t,n)=>z(Vn(e,t,n)),Un=(e,t,n)=>Hn(e,t,n).elements,Wn=(e,t,n)=>{let r=W(e,t,n),i=Xt(r);if(!i)throw In(n,`${n} expects a sequence but received ${U(r)}`);return i},Gn=(e,t,n)=>{let r=W(e,t,n);if(!j(r))throw In(n,`${n} expects a function but received ${U(r)}`);return H(r)},Kn=(e,t,n)=>{let r=e[t];if(r===void 0||!Ln(r))throw In(n,`${n} expects an operator as argument ${t+1}`);return r},qn=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),G=(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}),Jn=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Yn=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Xn=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(W(n,0,e),W(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Zn=e=>e>2147483647||e<-2147483648,Qn=e=>new h(`Overflow when computing ${e}`),$n={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`},er={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},tr={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},nr=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return er[e.operator];if(e.kind!==`Function`)return $n[e.kind];let t=e.domain;return t.every((e,t)=>e===t+1)?`TupleValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},rr=e=>tr[nr(e)],ir=(e,t)=>new m(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),ar=(e,t)=>{let n=n=>(...r)=>{try{return n(...r)}catch(n){throw n instanceof m&&(e.isLazy===!0||!(n instanceof h))?ir(t,n.message):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},or=(e,t)=>{if(typeof e!=`number`)throw ir(t,`Cannot cast tlc2.value.impl.${nr(e)} to tlc2.value.impl.IntValue`);return e},sr=(e,t,n)=>`public static tlc2.value.impl.${t} tlc2.module.Integers.${e}(${Array.from({length:n},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,cr=(e,t,n)=>{let r=sr(t,`IntValue`,2);return Xn(e,(t,i)=>{let a=or(t,r),o=or(i,r),s=n(a,o);if(Zn(s))throw Qn(`${a}${e}${o}`);return s})},lr=(e,t,n)=>{if(typeof e!=`number`)throw new h(`The ${t} argument of ${n} should be an integer, but instead it is:\n${U(e)}`);return e},ur=(e,t)=>Xn(e,(n,r)=>t(lr(n,`first`,e),lr(r,`second`,e))),dr=(e,t,n)=>({...Yn(e,t,n),isLazy:!0}),fr=(e,t,n)=>{let r=Kn(e,t,n);return()=>r.call([])},pr=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),mr=()=>({bool:Ya,condition:(e,t)=>{if(typeof e!=`boolean`)throw Ra(t,e);return e},conjunct:(e,t,n)=>{if(typeof e!=`boolean`)throw za(t,n,e);return e},apply:an,tuple:L,set:_t,record:Be,writtenRecord:xe,equal:Ve,enumerate:to,unassigned:(e,t)=>{throw new m(`The variable ${e} is not assigned at ${q(t)}`)},primeOutsideAction:e=>{throw new m(`A primed expression appears outside an action at ${q(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)=>Ka(e,t,n[r]),e.scope),state:e.state,next:e.next})}),hr={value:void 0},gr=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),_r=e=>`local${e.counter++}`,vr=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Xa(e).forEach(e=>vr(e,t)),t),yr=(e,t,n)=>{let r=gr(e,Y(t,e.environment)),i=vr(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=gr(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},br=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>_r(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Sr(e,t.set,s)}, ${gr(e,t.set)});`),u=t.bounds.map(t=>{let n=_r(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Sr(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=_r(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})`},xr=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Sr(e,r[0],n)}, "the left side of =>") ? bool(${Sr(e,r[1],n)}, "the right side of =>") : true)`;if(J(t))return yr(e,t,n);let i=go(t.operator,e.environment);if(i?.kind!==`Builtin`)return yr(e,t,n);if(i.name===`DOMAIN`)return`${gr(e,Va(t))}(${Sr(e,r[0],n)})`;if(i.name===`TLCEval`)return yr(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${gr(e,Ha(t,i))}(${Sr(e,r[0],n)}, ${Sr(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&ss(r[0],a))return`${gr(e,i.evaluateUnary)}(${Sr(e,r[0],n)})`;let o=r.length===2&&ss(r[0],a)&&ss(r[1],a);return i.evaluateBinary&&o?`${gr(e,i.evaluateBinary)}(${Sr(e,r[0],n)}, ${Sr(e,r[1],n)})`:yr(e,t,n)},Sr=(e,t,n)=>{let r=(t,r=n)=>Sr(e,t,r);if(Zo(t)&&Ko(t,e.environment))return yr(e,t,n);switch(t.kind){case`Number`:return Po(t.value)?String(t.value):yr(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(J(t))return yr(e,t,n);let i=Eo(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=gr(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?gr(e,i.value):yr(e,t,n)}case`Apply`:return xr(e,t,n);case`And`:{let n=gr(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)}, ${gr(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{xs(t.function);let e=r(t.function);return t.args.length===1?`apply(${e}, ${r(t.args[0])})`:`apply(${e}, tuple([${t.args.map(e=>r(e)).join(`, `)}]))`}case`FieldAccess`:return`apply(${r(t.record)}, ${JSON.stringify(t.field)}, ${gr(e,Ba(t))})`;case`Record`:{let i=[...t.fields].sort((e,t)=>I(e.name,t.name));if(i.some((e,t)=>t>0&&i[t-1].name===e.name))return yr(e,t,n);let a=gr(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}, ${gr(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=gr(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?br(e,t,n):yr(e,t,n);default:return yr(e,t,n)}},Cr=(e,t)=>{if(!pr.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=Sr(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(`
|
|
23
|
-
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;hr.value??=mr();let o=hr.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},wr={kind:`Local`},Tr=/* @__PURE__ */ new WeakMap,Er=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Dr=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2}])),Or=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,kr=e=>e.kind===`Operator`?e.params.length:0,Ar=e=>e.name.includes(`!`),jr=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Mr=(e,t,n=0)=>t.reduce((e,t)=>({name:t,arity:n,parent:e}),e),Nr=(e,t)=>t.reduce((e,t)=>({name:t.name,arity:t.arity,parent:e}),e),Pr=e=>e.kind===`Name`?[e.name]:e.names,Fr=e=>e.flatMap(e=>Pr(e.pattern)),Ir=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Or(n.location,t.location))?n:void 0},Lr=(e,t)=>{let n=Ir(e,t);return n?{key:t.getKey(n),arity:kr(n)}:t.imported.get(e)},Rr=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),zr=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Br=(e,t,n,r)=>{let i=e.location,a=Tr.get(e);if(a!==void 0)return a;if(Er(t))return e.kind===`Apply`?e.args.length:0;if(zr(t))return 0;let o=jr(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=wr),o)return o.arity;let s=Lr(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Tr.set(e,s.arity),s.arity;let c=t.slice(0,t.indexOf(`!`));if(c!==``&&(jr(n,c)!==void 0||Lr(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 f(Rr(t)?`Could not find declaration or definition of symbol '${t}' ${l}`:`Unknown operator: \`${t}' ${l}`)},Vr=(e,t,n)=>(e.forEach(e=>K(e.set,t,n)),e.reduce((e,t)=>Mr(e,Pr(t.pattern)),t)),Hr=(e,t)=>e.kind===`Identifier`&&e.name===t&&J(e)||Xa(e).some(e=>Hr(e,t)),Ur=(e,t)=>{e.kind===`FunctionConstruction`&&Hr(e.body,t)&&(e.isRecursive=!0),Xa(e).forEach(e=>Ur(e,t))},Wr=(e,t,n)=>{let r=Mr(t,e.kind===`Function`?[e.name]:[]);e.kind===`Function`?(K(e.body,Vr(e.bounds,r,n),n),Ur(e.body,e.name)):K(e.body,Nr(r,e.params),n)},Gr=(e,t,n)=>{let r=e.filter(e=>e.isRecursive).reduce((e,t)=>({name:t.name,arity:kr(t),parent:e}),t);return e.reduce((e,t)=>(Ar(t)||Wr(t,e,n),{name:t.name,arity:kr(t),parent:e}),r)},Kr=(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 f(`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 f(`Argument number ${t+1} to operator '${e.name}' should be a ${a.arity}-parameter operator at line ${o.line}, column ${o.column}`)},qr=e=>e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:void 0,Jr=(e,t,n)=>{let r=jr(t,e.operator)?void 0:Ir(e.operator,n),i=Br(e,e.operator,t,n);if(i!==e.args.length)throw new f(`The operator ${e.operator} requires ${i} arguments at line ${e.location.line}, column ${e.location.column}`);e.args.forEach((e,i)=>{let a=qr(e),o=a===void 0||jr(t,a)?void 0:Ir(a,n),s=Yr(e,t,n);r&&Kr(r,i,e,s,o)})},Yr=(e,t,n)=>e.kind===`Identifier`?Br(e,e.name,t,n):e.kind===`OperatorReference`?Br(e,e.operator,t,n):(K(e,t,n),e.kind===`Lambda`?e.params.length:0),K=(e,t,n)=>{let r=e=>e.forEach(e=>K(e,t,n));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=Br(e,e.name,t,n);if(r>0)throw new f(`The operator ${e.name} requires ${r} arguments at line ${e.location.line}, column ${e.location.column}`);return}case`OperatorReference`:Br(e,e.operator,t,n);return;case`Apply`:Jr(e,t,n);return;case`Lambda`:K(e.body,Mr(t,e.params),n);return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:K(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&&K(e.other,t,n);return;case`Let`:K(e.body,Gr(e.definitions,t,n),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:K(e.body,Vr(e.bounds,t,n),n);return;case`UnboundedQuantifier`:K(e.body,Mr(t,e.names),n);return;case`Choose`:e.set&&K(e.set,t,n),K(e.body,Mr(t,Pr(e.pattern)),n);return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:K(e.predicate,Vr([e.bound],t,n),n);return;case`SetMap`:K(e.expression,Vr(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 f(`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`:K(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`:K(e.body,t,n);return;case`Subexpression`:e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Yr(e,t,n))}},Xr=(e,t,n)=>(e.set&&K(e.set,t,n),{name:e.name,arity:e.arity,parent:t}),Zr=(e,t,n)=>{let r=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?Xr(t,e,n):(t.kind===`AssumeProve`?Zr(t,e,n):K(t,e,n),e),t);return K(e.conclusion,r,n),r},Qr=(e,t,n)=>e.kind===`AssumeProve`?Zr(e,t,n):(K(e,t,n),t),$r=(e,t,n)=>{e?.kind===`Steps`&&e.steps.reduce((e,t)=>ei(t,e,n),t)},ei=(e,t,n)=>{let r=e.body;switch(r.kind){case`Assert`:{let i=Qr(r.statement,t,n);return $r(e.proof,i,n),r.isSuffices?i:t}case`Define`:return Gr(r.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),t,n);case`Have`:case`Case`:return K(r.expression,t,n),$r(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>K(e,t,n)),t;case`Take`:return Mr(Vr(r.bounds,t,n),r.names);case`Pick`:{let i=Mr(Vr(r.bounds,t,n),r.names);return K(r.body,i,n),$r(e.proof,t,n),i}default:return $r(e.proof,t,n),t}},ti=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Qr(e.statement,void 0,t);$r(e.proof,n,t)},ni=(e,t)=>new f(`Multiply-defined symbol '${e}' at line ${t.line}, column ${t.column}`),ri=(e,t,n,r)=>t.reduce((e,t)=>{if(jr(e,t)||n(t))throw ni(t,r);return{name:t,arity:0,parent:e}},e),ii=(e,t,n,r)=>(e.forEach(e=>oi(e.set,t,n)),e.reduce((e,t)=>ri(e,Pr(t.pattern),n,r),t)),ai=(e,t,n)=>{if(e.kind===`Function`){let r=Mr(t,[e.name]),i=ii(e.bounds,r,n,e.location);oi(e.body,i,n);return}let r=ri(t,e.params.map(e=>e.name),n,e.location);oi(e.body,r,n)},oi=(e,t,n)=>{let r=e.location;switch(e.kind){case`Lambda`:oi(e.body,ri(t,e.params,n,r),n);return;case`Let`:{let i=e.definitions.filter(e=>e.isRecursive).map(e=>e.name),a=e.definitions.reduce((e,t)=>{if(jr(e,t.name)||n(t.name))throw ni(t.name,t.location);return ai(t,Mr(e,i),n),Mr(e,[t.name])},t);oi(e.body,ri(a,(e.instances??[]).flatMap(e=>e.name===void 0?[]:[e.name]),n,r),n);return}case`Forall`:case`Exists`:case`FunctionConstruction`:oi(e.body,ii(e.bounds,t,n,r),n);return;case`SetFilter`:oi(e.predicate,ii([e.bound],t,n,r),n);return;case`SetMap`:oi(e.expression,ii(e.bounds,t,n,r),n);return;case`UnboundedQuantifier`:oi(e.body,ri(t,e.names,n,r),n);return;case`Choose`:e.set&&oi(e.set,t,n),oi(e.body,ri(t,Pr(e.pattern),n,r),n);return;default:Xa(e).forEach(e=>oi(e,t,n))}},si=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}))],ci=(e,t)=>{let n=/* @__PURE__ */ new Map;si(e).sort((e,t)=>Or(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)&&!Dr.has(e))return!1;let r=t.importedAt.get(e);return r===void 0||Or(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 ni(n.name,n.location)}));let i=e=>t=>(n.get(t)??[]).some(t=>t.isRecursive||Or(t.location,e))||r(t,e);e.definitions.forEach(e=>ai(e,void 0,i(e.location))),e.assumptions.forEach(e=>oi(e.expression,void 0,i(e.location))),e.instances.forEach(e=>{let t=i(e.location),n=ri(void 0,e.params.map(e=>e.name),t,e.location);e.substitutions.forEach(e=>oi(e.expression,n,t))})},li=(e,t)=>{let n=new Map([...Dr,...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},ui=(e,t,n,r)=>{let i=Nr(void 0,e.params),a={imported:li(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 f(`Identifier '${n}' is not a legal target of a substitution ${s}`)}),new Map(t.map(t=>{let n=t.name;if(!o.has(n)&&!jr(i,n)&&!Lr(n,a))throw new f(`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 K(r,i,a),[n,r];if(Br(r,r.name,i,a)!==t.arity)throw new f(`An operator must be substituted for symbol '${n}', and it must have arity ${t.arity} ${s}`);return[n,r]}))},di=(e,t)=>{let n=li(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=>Wr(e,void 0,i(e.location,e))),e.assumptions.forEach(e=>K(e.expression,void 0,i(e.location,void 0))),e.theorems.forEach(e=>ti(e,i(e.location,void 0)))},fi=/* @__PURE__ */ new WeakSet,pi=/* @__PURE__ */ new WeakSet,mi=(e,t,n=/* @__PURE__ */ new Set)=>{let r=bi(e,(e,r)=>mi(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&J(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&J(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},hi=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),gi=/* @__PURE__ */ new WeakMap,_i=e=>gi.get(e)??e.name,vi=(e,t)=>(_i(t)!==e.name&&gi.set(e,_i(t)),e),yi=(e,t)=>vi(e.kind===`Function`?{...e,bounds:hi(e.bounds,e=>t(e,[])),body:t(e.body,Fr(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),bi=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>yi(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:hi(e.bounds,n),body:t(e.body,Fr(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,Pr(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,Pr(e.bound.pattern))};case`SetMap`:return{...e,bounds:hi(e.bounds,n),expression:t(e.expression,Fr(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)}}},xi=`LAMBDA`,Si=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return bi(e,(e,n)=>(r.push(...Si(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Ci=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},wi=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Ti=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Ei=(e,t)=>e.map(e=>({pattern:Ti(e.pattern,t),set:e.set})),Di=(e,t)=>e.kind===`Function`?{...e,bounds:Ei(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Oi=(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=>vi({...Di(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Ei(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Ti(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Ti(e.bound.pattern,n),set:e.bound.set}};default:return e}},ki=e=>`${e}@ENABLED`,Ai=(e,t)=>e.modes.get(t)??e,ji=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!J(e)&&t.instantiation.variables.has(e.name),Mi=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Mi(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(ji(e,t,n))return[e.name];let r=J(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Mi(r.body,t,/* @__PURE__ */ new Map):void 0},Ni=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return ji(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:ki(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Ri(e.expression,Ai(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Ri(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Ri(e.subscript,Ai(t,`Primed`),n),location:r},Ri(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Mi(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:ki(r),location:e.location},location:e.location},Ri({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Pi=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),Fi=(e,t)=>e.map(e=>Pi(e.name,t)),Ii=(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:[...Fi(t,r),...i.map(e=>Pi(e,r))],location:r},location:r}},Li=(e,t)=>e.instantiation.isParameterized(t)?Bi(e,t):void 0,Ri=(e,t,n)=>{let r=e=>Ri(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!J(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Ri(e.expression,Ai(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Ri(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Ai(t,`Enabled`),n)};let s=Ni(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return fi.add(n),n;let r=Li(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&&kr(o)>0?Ii(r,a,kr(o),e.location):{kind:`Apply`,operator:r,args:Fi(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||pi.has(e),c=e=>(s&&pi.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:xi,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:xi,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new f(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=Li(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...Fi(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=Li(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?Ii(n,a,kr(r),e.location):{...e,operator:n}}let c=Ci(t),l=bi(e,(e,i)=>i.length===0?r(e):Ri(e,t,wi(n,i,c)));return Oi(l,n,c)},zi=(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:Pi(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Bi=(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(i.name,n=>{e.copies.set(t,n);let a=Ci(e),o=Di(yi(i,(t,n)=>Ri(t,e,wi(/* @__PURE__ */ new Map,n,a))),a);return zi(o,r.params,i.location)}):t},Vi=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Si(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=>Li(i,e)??e,getQualifiedKey:t=>{let n=Li(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(r.name,()=>zi(r,e.params,r.location)):t}}},Hi=e=>e.kind===`Let`&&e.instances!==void 0||Xa(e).some(Hi),Ui=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=bi(e,e=>Ui(e,t,r));return i.kind!==`Let`||!i.instances?i:{kind:`Let`,definitions:i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Or(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}},Wi=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Gi=(e,t)=>e.definitions.some(e=>Hi(e.body))||e.assumptions.some(e=>Hi(e.expression))||e.theorems.some(e=>{let t=Wi(e);return t!==void 0&&Hi(t)})?{...e,definitions:e.definitions.map(e=>yi(e,e=>Ui(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ui(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Wi(e);return n===void 0?e:{...e,statement:Ui(n,t,[])}})}:e,Ki=/* @__PURE__ */ new WeakMap,qi=/* @__PURE__ */ new WeakMap,Ji=(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},Yi=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Xi=(t,n)=>{let r=X(t,n);if(typeof r==`boolean`)return r;try{return Ya(r,`the action at ${q(t)}`)}catch(t){throw n.next===void 0?t:a(t,e.error)}},Zi=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Qi=(e,t,n)=>{let r=n?Ki:qi,i=r.get(e);if(i)return i;let a=Ea(e,t,n);return r.set(e,a),a},$i=(e,t)=>{if(t.constants.has(e))return;let n=Za(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},ea=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return ea(e.expression,t,!1,r);if(e.kind!==`Identifier`||J(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=$i(e.name,t);if(a&&!r.has(a))return r.add(a),ea(a.body,t,n,r)},ta=(e,t,n)=>ea(e,t,!n),na=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return na(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Mo(e.definitions,Ji(r,t,n));return na(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Ga(t,e.name);if(a?.kind===`Thunk`)return na(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=$i(e.name,r.environment);if(s)return na(s.body,void 0,n,r,i)},ra=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||J(e))||!t&&e.kind===`Prime`,ia=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ia(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=$i(e.name,t);if(i)return n.add(e.name),ia(i.body,t,n)},aa=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),oa=(e,t,n)=>aa.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Zi(e.operator)&&(ra(e.args[0],n)||ta(e.args[0],t,n)!==void 0)||J(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,sa=/* @__PURE__ */ new Set,ca=(e,t)=>{if(J(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return bi(e,(e,i)=>{let a=r.isReadOnly?ca(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},la=(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||J(e)?void 0:Za(r,t);return i&&!n.has(i)&&(n.add(i),la(i.body,t,n))?!0:Xa(e).some(e=>la(e,t,n))},ua=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=ta(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=ia(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return oa(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Qi(e,t,n)}},da=(e,t,n)=>{let r=e.map(e=>ua(e,t,n)),i=(e,t,n,a,o,s)=>{let c=a,l;for(let a=e;a<r.length;a++){if(a>0&&t.isInit&&Aa(c)){l??=Ji(t,n,c);for(let e=a;e<r.length;e++)if(!fa(r[e].expression,l))return;s(c,o);return}let e=r[a];if(e.kind===`Guard`){if(l??=Ji(t,n,c),!Xi(e.expression,l))return;continue}if(e.kind===`Assign`){l??=Ji(t,n,c);let r=X(e.value,l),i=c[e.index];if(i===void 0)c=Yi(c,e.index,r),l=void 0;else if(!Ve(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=Yi(c,t,n[t]),l=void 0;else if(!Ve(e,n[t]))return}continue}let u=a+1;e.runner(t,n,c,o,!0,(e,r)=>i(u,t,n,e,r,s));return}s(c,o)};return(e,t,n,r,a,o)=>i(0,e,t,n,r,o)},fa=(e,t)=>Ya(X(e,t),`the initial predicate at ${q(e)}`),pa=e=>(t,n,r,i,a,o)=>{Xi(e,Ji(t,n,r))&&o(r,i)},ma=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Ji(r,i,a);if(a[l]!==void 0){Xi(e,u)&&c(a,o);return}let d=X(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!R(f))throw new m(`In computing next states, the right side of \\in is not enumerable: ${U(f)} at ${q(e)}`);let p=Ut(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Yi(a,l,p[e]),o)}},ha=/* @__PURE__ */ new WeakMap,ga=e=>{let t=ha.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(ga),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return ha.set(e,n),n},_a=(e,t)=>{let n=e.args[0],r=pa(e),i=(e,r,i)=>na(n,r,i,e,!t)??-1,a=ma(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],Ji(t,n,o));l(Yi(o,u,d),s)}},va=(e,t,n,r)=>{if(e.kind===`FunctionConstruction`)return{bounds:e.bounds,body:e.body,scope:t};if(e.kind!==`Identifier`)return;let i=Ga(t,e.name);if(i?.kind===`Thunk`)return va(i.expression,i.scope,n,r);let a=i?void 0:Za(e.name,r.environment);if(a?.kind!==`Function`)return;let o=X(e,Ji(r,void 0,n));return{bounds:a.bounds,body:a.body,scope:Ka(void 0,a.name,o)}},ya=(e,t,n)=>{let r=pa(e);return(i,a,o,s,c,l)=>{let u=va(e.function,a,o,i);if(!u){r(i,a,o,s,c,l);return}let d=Ji(i,a,o),f=e.args.map(e=>X(e,d)),p=f.length===1?f[0]:L(f),h=ro(u.bounds,Ji(i,u.scope,o));if(!V(p,h))throw new m(`Attempted to apply a function to ${U(p)}, which is not in its domain at ${q(e)}`);Qi(u.body,t,n)(i,io(u.bounds,u.scope,p),o,s,c,l)}},ba=(e,t)=>{if(ia(e,t))return da([ga(e)],t,!1);if(e.kind===`Tuple`)return Qi(ga(e),t,!1);let n=ga(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Ga(i,e.name):void 0;l?.kind===`Thunk`?Qi(ga(l.expression),t,!1)(r,l.scope,a,o,s,c):Xi(n,Ji(r,i,a))&&c(a,o)}},xa=(e,t,n)=>{let r=e.operator,i=pa(e),a=J(e)?void 0:go(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=us(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=Qi(a.body,t,n),o.body(e,i(Ji(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Ji(a,o,s),f=vo(e,d);f?.kind===`Closure`?Qi(f.body,t,n)(a,Ao(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Sa=(e,t,n)=>{let r=pa(e),i=J(e)?void 0:$i(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=Ga(s,e.name);f?.kind===`Thunk`?Qi(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=Qi(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Ca=(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!==`=`||J(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`||!J(a))return;let o=ea(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=>Ca(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`||J(e))return;let r=go(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Ca(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`&&J(o))return{variable:i.variable,argument:o.name,labels:i.labels}},wa=(e,t,n)=>{let r=Ga(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},Ta=(e,t,n)=>{let r=e.map(e=>Qi(e,t,n)),i=n?[]:e.map(e=>Ca(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&&wa(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)}},Ea=(e,t,n)=>{let r=e=>Qi(e,t,n);switch(e.kind){case`And`:return da(e.operands,t,n);case`Or`:return Ta(e.operands,t,n);case`Exists`:{let t=r(e.body),n=e.bounds[0];if(e.bounds.length===1&&n.pattern.kind===`Name`){let e=n.pattern.name;return(r,i,a,o,s,c)=>{let l=to(X(n.set,Ji(r,i,a)),n.set);for(let n=0;n<l.length&&!r.isStopped;n++)t(r,Ka(i,e,l[n]),a,o,s,c)}}return(n,r,i,a,o,s)=>{no(e.bounds,Ji(n,r,i),e=>(t(n,e,i,a,o,s),n.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&ks(e,t)!==void 0&&!la(e.body,t,/* @__PURE__ */ new Set)?ca(e,sa):void 0;return(t,n,r,o,s,c)=>{let l=[];no(e.bounds,Ji(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Ga(n,e)?.kind===`Value`)){u.every(n=>Xi(e.body,Ji(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Aa(r)?u.slice(n).every(n=>fa(e.body,Ji(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,Ji(r,i,a));(Ya(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=Ji(r,i,a),d=t.find(e=>Ya(X(e.condition,l),`a CASE guard`))?.body??n;if(!d)throw new m(`${u}In computing next states, TLC encountered a CASE with no conditions true.\n${La(e)}`);d(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Ho(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Mo(e.definitions,Ji(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new m(`UNCHANGED appears in an initial predicate at ${q(e)}`)}:ba(e.expression,t);case`AngleAction`:{let t=r(e.action),n=ga(e.subscript);return(e,r,i,a,o,s)=>t(e,r,i,a,o,(t,i)=>{Xi(n,Ji(e,r,t))||s(t,i)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,ga(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Sa(e,t,n);case`FunctionApplication`:return ya(e,t,n);case`Apply`:{let i=e.args;if(Zi(e.operator)){let r=ta(i[0],t,n);if(r!==void 0)return e.operator===`=`?da([e],t,n):ma(e,()=>r);if(ra(i[0],n))return _a(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=X(i[0],Ji(t,n,r));(typeof c==`boolean`?c:Ya(c,`the left side of => at ${q(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return xa(e,t,n)}default:return pa(e)}},Da=/* @__PURE__ */ new WeakMap,Oa=e=>{let t=Da.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Da.set(e,n),n},ka=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Aa=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},ja=(e,t)=>{let n=t.state;if(!n||!Aa(n))throw new m(`ENABLED needs a complete state at ${q(e)}`);let r=t.environment,i={environment:r,isInit:!1,current:n,isStopped:!1};return Qi(e,r,!1)(i,t.scope,Oa(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Ma=(t,n,r,i)=>{let o={environment:n,isInit:!0,current:void 0,isStopped:!1};Qi(t,n,!0)(o,i,Oa(n),void 0,!1,t=>{if(!o.isStopped){if(!Aa(t))throw a(new m(`The initial predicate does not assign ${ka(t,n).join(`, `)}`),e.error);o.isStopped=r(t)}})},Na=(e,t,n)=>{let r=[];return Ma(e,t,e=>(r.push(e),!1),n),r},Pa=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,current:t,isStopped:!1},o={successors:0};return Qi(e,n,!1)(a,i,Oa(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Aa(e))throw new m(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${ka(e,n).join(`, `)}`);o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Fa=(e,t,n,r)=>{let i=[];return Pa(e,t,n,e=>(i.push(e),!1),r),i},q=e=>`line ${e.location.line}, column ${e.location.column}`,Ia=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,La=e=>{let t=e.location.range;return t?Ia(t):q(e)},Ra=(e,t)=>new m(`A non-boolean expression (${rr(t)}) was used as the condition of an IF.\n${La(e)}`),za=(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):La(r);return new m(`A non-boolean expression (${rr(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 m(`Attempted to evaluate an expression of form P /\\ Q when ${t===0?`P`:`Q`} was\n${rr(n)}.\n${La({...e,location:{...e.location,range:{...r,end:i}}})}`)},Ba=e=>t=>`Attempted to select nonexistent field "${e.field}" from the record\n${U(t)}\n${La(e)}`,Va=e=>t=>{if(!j(t))throw new m(`Attempted to apply the operator DOMAIN to a non-function\n(${rr(t)})\n${La(e)}`);return sn(t)},Ha=(e,t)=>(n,r)=>{if(!A(n)||F(n))throw new m(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${La(e)}`);return t.evaluate([n,r])},Ua=t=>a(new m(`TLC can't handle real numbers: ${t.text} at ${q(t)}`),e.configParseError),Wa=t=>a(new m(`TLC can't handle a number this big: ${t.text??t.value} at ${q(t)}`),e.error),Ga=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Ka=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),qa=(e,t,n)=>{if(t.kind===`Name`)return Ka(e,t.name,n);let r=Xt(n);if(!r||r.length!==t.names.length)throw new m(`Cannot bind <<${t.names.join(`, `)}>> to ${U(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>Ka(e,t,r[n]),e)},Ja=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next}),Ya=(e,t)=>{if(typeof e!=`boolean`)throw new m(`Expected ${t} to be a boolean but found ${U(e)}`);return e},Xa=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:[])}},J=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Za=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Qa=(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=Za(n,t);if(e&&!t.constants.has(n)&&!$a(e,t))return!0}return Xa(e).some(e=>Qa(e,t))},$a=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!Qa(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>Qa(e.set,t)));return t.constantLevels.set(e,r),r},eo=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},to=(e,t)=>{if(!A(e)||F(e)){let n=U(e),r=eo(e,n);throw new m(r===void 0?`TLC encountered a non-enumerable quantifier bound\n${n}.\n${La(t)}`:`TLC encountered the non-enumerable quantifier bound\n${n}\n${La(t)}\n${r}`)}return typeof e==`object`&&e.kind===`Interval`?Ot(e):z(e).elements},no=(e,t,n)=>{let r=e.map(e=>to(X(e.set,t),e.set)),i=(t,a)=>t<0?n(a):r[t].some(n=>i(t-1,qa(a,e[t].pattern,n)));return i(e.length-1,t.scope)},ro=(e,t)=>{let n=e.map(e=>X(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},io=(e,t,n)=>{if(e.length===1)return qa(t,e[0].pattern,n);let r=Xt(n)??[];return e.reduce((e,t,n)=>qa(e,t.pattern,r[n]),t)},ao=/* @__PURE__ */ new WeakMap,oo=(e,t)=>{let n=ao.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:Ia(r)};return ao.set(t,i),i},so=(e,t,n)=>{let r=oo(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}},co=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=gn(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(Ue(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},lo=(e,t)=>{let n=ro(e.bounds,t),r=co(n,(n,r)=>X(e.body,Ja(t,io(e.bounds,Ka(void 0,e.name,r),n))),so(e.bounds,e.body,n));return e.bounds.length===1?tn(r):r},uo=(e,t)=>e.kind===`Function`?lo(e,t):X(e.body,t),fo=(e,t)=>{let n=$a(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 m(`Operator ${e.name} requires ${e.params.length} arguments`);let i=Ja(t,void 0);if(!n)return uo(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>uo(e,i));return t.environment.definitionValues.set(e,a),a},po=(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,Ja(t,e.scope));return n&&(e.cache=r),r},mo=/* @__PURE__ */ new WeakMap,ho=e=>{let t=mo.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return mo.set(e,n),n},go=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return go(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?ho(r):t.builtins.get(e)},_o=/* @__PURE__ */ new WeakMap,vo=(e,t)=>{if(J(e))return yo(e.operator,t);let n=_o.get(e),r=n===void 0?go(e.operator,t.environment)??null:n;return n===void 0&&_o.set(e,r),r??yo(e.operator,t)},yo=(e,t)=>{let n=Ga(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return go(e,t.environment)},bo=e=>e.kind===`Closure`?e.params.length:e.arity,xo=(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:yo(n,t);if(!r)throw new m(`Expected an operator argument at ${q(e)}`);return r},So=(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)=>Ka(e,n.name,t[r]),e.scope);return X(e.body,Ja(n,r))},Co=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:bo(e),call:n=>So(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},wo=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=yo(e.name,t);return n!==void 0&&bo(n)>0},To=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),Eo=(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 Eo(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([])}},Do=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Po(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=J(e)?void 0:Eo(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=Ga(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:To(e,t)}}return t=>To(e,t)},Oo=/* @__PURE__ */ new WeakMap,ko=(e,t)=>{let n=Oo.get(e);if(n)return n;let r=Do(e,t);return Oo.set(e,r),r},Ao=(e,t,n)=>{if(t.length!==e.params.length)throw new m(`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:xo(t[i],n)}:ko(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},jo=(e,t,n)=>e.kind===`Closure`?X(e.body,Ja(n,Ao(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>X(e,n))):e.isLazy?e.evaluate(cs(t,n),n):e.evaluate(t.map(e=>wo(e,n)?Co(xo(e,n),n):X(e,n)),n),Mo=(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),No=(e,t,n)=>{let r=Ga(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return po(r,n);if(r?.kind===`Operator`){if(bo(r.operator)===0)return So(r.operator,[],n);throw new m(`Operator ${e} is used without arguments`)}let i=Eo(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw new m(`The variable ${e} is not assigned at ${q(t)}`);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return fo(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new m(`Unknown identifier ${e} at ${q(t)}`)},Po=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Fo=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Io=(e,t)=>Fo.has(e)||t.builtins.get(e)?.isStateLevel===!0,Lo={builtins:Fo,definitions:/* @__PURE__ */ new WeakMap},Ro={builtins:new Set([...Fo].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},zo=(e,t)=>e.kind===`Operator`&&e.params.length===0&&$a(e,t),Bo=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!J(e)){let e=Za(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!zo(e,t)&&Vo(e,t,n))return!0}return Xa(e).some(e=>Bo(e,t,n))},Vo=(e,t,n=Lo)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Bo(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Bo(e.set,t,n));return n.definitions.set(e,i),i},Ho=(e,t)=>new Set(e.filter(e=>Vo(e,t))),Uo=e=>[...e.definitions.values()].some(t=>Vo(t,e)),Wo=e=>[...e.definitions.values()].some(t=>Vo(t,e,Ro)),Go=/* @__PURE__ */ new WeakMap,Ko=(e,t)=>{let n=Go.get(e);if(n!==void 0)return n;let r=Xo(e,t,Jo);return Go.set(e,r),r},qo=/* @__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`]),Jo=/* @__PURE__ */ new Set,Yo=(e,t,n)=>n.size===0?Ko(e,t):Xo(e,t,n),Xo=(e,t,n)=>{if(!qo.has(e.kind))return!1;if(e.kind===`Identifier`&&J(e))return n.has(e.name);if(J(e))return!1;if(e.kind===`Identifier`){let n=Eo(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&zo(n.definition,t)}if(e.kind===`Apply`){if(Io(e.operator,t)||e.operator===`~>`)return!1;let r=go(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=Za(e.operator,t);if(!n||!$a(n,t)||Vo(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`&&Yo(e,t,n))}let r={value:!0};return bi(e,(e,i)=>(r.value&&=Yo(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Zo=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Qo=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}},$o=(e,t)=>{if(e.kind===`Identifier`&&J(e))return!t.has(e.name);if(J(e))return!0;let n={value:!1};return bi(e,(e,r)=>(n.value||=$o(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},es=(e,t)=>fi.has(e)&&Zo(e)&&ks(e,t)!==void 0&&!$o(e,Jo),Y=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Es(e,t),i=Zo(e)&&Ko(e,t)?Qo(r):es(e,t)?as(r):r;return t.evaluators.set(e,i),i},ts=/* @__PURE__ */ new WeakMap,ns=(e,t)=>{let n=ts.get(e);if(n)return n;let r=(Zo(e)&&Ko(e,t)?void 0:Cr(e,t))??Y(e,t);return ts.set(e,r),r},X=(e,t)=>ns(e,t.environment)(t),rs=(e,t)=>{let n=e.name,r=J(e)?void 0:Eo(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw new m(`The variable ${n} is not assigned at ${q(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&&$a(e,t))return t=>fo(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=ns(e.body,t),n.body(Ja(r,void 0)));return is(e,t)?as(r):r}return t=>fo(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>fo(e,t);return $a(e,t)||!is(e,t)?n:as(n)}return t=>No(n,e,t)},is=(e,t)=>ks(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>ks(e.set,t)!==void 0)),as=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}},os=(e,t)=>{let n=go(e,t);return n!==void 0&&bo(n)>0},ss=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!J(e)&&os(e.name,t)),cs=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>X(e,t),expression:e})),ls=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(cs(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&ss(t[0],n)){let e=Y(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&ss(t[0],n)&&ss(t[1],n);if(i&&a){let e=Y(t[0],n),r=Y(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>wo(e,n)?Co(xo(e,n),n):X(e,n)),n)},us=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new m(`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:ko(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:xo(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},ds=/* @__PURE__ */ new WeakMap,fs=e=>{let t=ds.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return ds.set(e,n),n},ps=(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},ms=(e,t)=>e.every((e,n)=>Ue(e,t[n])),hs=(e,t)=>{let n=Za(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&$a(n,t)&&!Vo(n,t)},gs=(e,t,n,r)=>{let i=us(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=ns(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next}));if(!r)return e=>o(i(e),e);let s=fs(e);return e=>{let n=i(e),r=ps(n,t.length);if(!r)return o(n,e);let a=r.length;for(let e of r)a=dn(a,gn(e));let c=s.calls.get(a),l=c?.find(e=>ms(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}},_s=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Y(n[0],t),r=Y(n[1],t);return t=>!Ya(e(t),`the left side of =>`)||Ya(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new m(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=J(e)?void 0:go(e.operator,t);if(r?.kind===`Closure`)return gs(r,n,t,hs(e,t));if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Y(n[0],t),i=Va(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Y(n[0],t);return pi.has(e)||Qa(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=Y(n[0],t),a=Y(n[1],t),o=Ha(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?ls(r,n,t):r=>{let i=yo(e.operator,r);if(i)return jo(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new m(`${e.operator} is a function; apply it with brackets`):new m(`Unknown operator ${e.operator} at ${q(e)}`)}},vs=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Y(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Y(a.set,t);return t=>{let s=to(o(t),a.set);for(let a=0;a<s.length;a++){let o=Ya(i(Ja(t,Ka(t.scope,e,s[a]))),r);if(o!==n)return o}return n}}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>Y(e.set,t));return t=>{let s=a.map((e,n)=>to(e(t),o[n].set)),c=(a,o)=>{if(a<0)return Ya(i(Ja(t,o)),r)!==n;let l=s[a];for(let t=0;t<l.length;t++)if(c(a-1,Ka(o,e[a],l[t])))return!0;return!1};return c(o.length-1,t.scope)?!n:n}}return e=>no(o,e,t=>Ya(i(Ja(e,t)),r)!==n)?!n:n},ys=(e,t)=>{if(e.kind===`Tuple`)return L(e.names.map(e=>{let n=Ga(t,e);return n?.kind===`Value`&&n.value}));let n=Ga(t,e.name);return n?.kind===`Value`?n.value:void 0},bs=/* @__PURE__ */ new WeakSet,xs=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&bs.add(e)},Ss=(e,t)=>{let n=bs.has(e),r=Y(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Y(a.set,t);return t=>{let c=o?s(t):ro(i,t);if(e.isRecursive||n||!R(c)){let n=co(c,e=>r(Ja(t,io(i,t.scope,e))),so(i,e.body,c));return i.length===1?tn(n):n}if(o&&a.pattern.kind===`Name`){let e=a.pattern.name,n=At(c);return tn(Be(n,n.map(n=>r(Ja(t,Ka(t.scope,e,n))))))}let l=[];return no(i,t,e=>{let n=i.length===1?ys(a.pattern,e)??!1:L(i.map(t=>ys(t.pattern,e)??!1));return l.push([n,r(Ja(t,e))]),!1}),St(l)}},Cs=(e,t)=>{let n=bs.has(e);n&&xs(e.function);let r=Y(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>Y(e,t))}),value:Y(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):L(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Ja(i,Ka(i.scope,`@`,e))):cn(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}},ws=(e,t)=>{if(e.kind===`SetFilter`){let n=Y(e.predicate,t),r=Y(e.bound.set,t),i=e.bound.pattern;return t=>{let a=r(t),o=e=>Ya(n(Ja(t,qa(t.scope,i,e))),`a set filter predicate`);if(typeof a!=`object`||a.kind!==`Set`&&a.kind!==`MixedSet`&&a.kind!==`Interval`){if(A(a))return{kind:`FilteredSet`,base:a,test:o};throw new m(`TLC encountered a non-enumerable quantifier bound ${U(a)} at ${q(e.bound.set)}`)}return ze(z(a).elements.filter(o))}}if(e.kind===`SetMap`){let n=Y(e.expression,t);return t=>{let r=[];return no(e.bounds,t,e=>(r.push(n(Ja(t,e))),!1)),_t(r)}}let n=e.set;if(!n)return()=>{throw new m(`TLC cannot evaluate an unbounded CHOOSE at ${q(e)}`)};let r=Y(e.body,t),i={pattern:e.pattern,set:n};return t=>{let n={value:void 0};if(no([i],t,i=>Ya(r(Ja(t,i)),`the body of CHOOSE`)?(n.value=ys(e.pattern,i),!0):!1),n.value===void 0)throw new m(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${La(e)}`);return n.value}},Ts=(e,t)=>{let n=[...e].sort((e,t)=>I(e.name,t.name)),r=n.some((e,t)=>t>0&&n[t-1].name===e.name),i=n.map(e=>Y(e.value,t));if(r)return e=>St(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=>xe(a,i.map(t=>t(e)),o):e=>Be(a,i.map(t=>t(e)))},Es=(e,t)=>{let n=e=>Y(e,t);switch(e.kind){case`Number`:{let t=e.value;return Po(t)?()=>t:()=>{throw Wa(e)}}case`Decimal`:return()=>{throw Ua(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return rs(e,t);case`Apply`:return _s(e,t);case`OperatorReference`:case`Lambda`:return()=>{throw new m(`An operator cannot be used as a value at ${q(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 za(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(Ya(t[n](e),`a disjunct`))return!0;return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw new m(`A primed expression appears outside an action at ${q(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=>Ve(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 Ra(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(Ya(e.condition(n),`a CASE guard`))return e.body(n);if(r)return r(n);throw new m(`Attempted to evaluate a CASE with no conditions true.\n${La(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Ja(n,Mo(e.definitions,n)))}case`Forall`:case`Exists`:return vs(e,t);case`UnboundedQuantifier`:return()=>{throw new m(`TLC cannot evaluate an unbounded quantifier at ${q(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return ws(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>_t(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>L(t.map(t=>t(e)))}case`FunctionConstruction`:return Ss(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 Ts(e.fields,t);case`RecordSet`:{let t=[...e.fields].sort((e,t)=>I(e.name,t.name)),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 Cs(e,t);case`ExceptAt`:return t=>{let n=Ga(t.scope,`@`);if(n?.kind!==`Value`)throw new m(`@ appears outside an EXCEPT at ${q(e)}`);return n.value};case`FunctionApplication`:{xs(e.function);let t=n(e.function),r=e.args.map(n);if(r.length===1){let e=r[0];return n=>an(t(n),e(n))}return e=>an(t(e),L(r.map(t=>t(e))))}case`FieldAccess`:{let t=n(e.record),r=e.field,i=Ba(e);return e=>an(t(e),r,i)}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?Ya(t(e),`an action`)||r(e):Ya(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>ja(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new m(`The subexpression reference at ${q(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new m(`TLC cannot evaluate a temporal formula in a state at ${q(e)}`)}}},Ds=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Os=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},ks=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Ds.has(e.kind))return!1;let a=Os(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&&Io(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 Xa(e).every(i)};return i(e)?[...n]:void 0},As=/* @__PURE__ */ new Map([[`Reals`,`-------------------------------- MODULE Reals -------------------------------
|
|
24
|
+
`,t:` `,r:`\r`,f:`\f`}[t]??t),l(2)}else i.push(e[a.index]),l(1)}l(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=k.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(ae(t)){let t=e.slice(a.index,ce(e,a.index,ae));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(a.index))?.[0]??t;c(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){c(`Keyword`,t.slice(0,3),3);continue}let n=r.get(t)??t;r.set(n,n),c(ne.has(t)?`Keyword`:`Identifier`,n,t.length);continue}let o=le(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let d=oe(e,a.index);if(d)c(`Operator`,d.text,d.length);else throw u(`Unexpected character ${JSON.stringify(t)}`)}let d=s();return n.push({kind:`End`,text:``,line:a.line,column:d,endColumn:d}),n},fe=/* @__PURE__ */ new Set([`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),pe=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`],M={INIT:`init`,NEXT:`next`,SPECIFICATION:`specification`,VIEW:`view`,SYMMETRY:`symmetry`,ALIAS:`alias`,_PERIODIC:`periodic`,_RL_REWARD:`rlReward`},me={INVARIANT:`invariants`,INVARIANTS:`invariants`,PROPERTY:`properties`,PROPERTIES:`properties`,CONSTRAINT:`constraints`,CONSTRAINTS:`constraints`,ACTION_CONSTRAINT:`actionConstraints`,ACTION_CONSTRAINTS:`actionConstraints`,POSTCONDITION:`postconditions`,POSTCONDITIONS:`postconditions`,_POSSIBLE:`possible`},he=e=>Object.hasOwn(M,e),ge=e=>Object.hasOwn(me,e),_e=e=>[...e].map(e=>{let t={"\b":`\\b`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`}[e];if(t)return t;if(e===`"`||e===`'`||e===`\\`)return`\\${e}`;let n=e.codePointAt(0)??0;return n<32||n>126?`\\u${n.toString(16).padStart(4,`0`)}`:e}).join(``),ve=(e,t,n,r=``)=>new v(`TLC found an error in the configuration file:\nLexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${_e(n)}" (${n.codePointAt(0)}), `}after : "${_e(r)}"`),ye=(e,t)=>new v(`TLC found an error in the configuration file at line ${e}\n${t}`),be=e=>{let t=`${e}\n`,n=[],r={index:0,line:1,lineStart:0},i=e=>{let n=t.slice(r.index,r.index+e),i=n.lastIndexOf(`
|
|
25
|
+
`);i!==-1&&(r.line+=n.split(`
|
|
26
|
+
`).length-1,r.lineStart=r.index+i+1),r.index+=e},a=e=>ve(r.line+1,0,void 0,e);for(;r.index<t.length;){let e=t.slice(r.index),o=/^\s+/.exec(e)?.[0];if(o){i(o.length);continue}if(e.startsWith(`\\*`)){r.index+=e.indexOf(`
|
|
27
|
+
`);continue}if(e.startsWith(`(*`)){let t=e.indexOf(`*)`);if(t===-1)throw r.line+=e.split(`
|
|
28
|
+
`).length-2,a(``);i(t+2);continue}let s=/^\d+(?![A-Za-z_])/.exec(e)?.[0];if(s){n.push({kind:`Number`,text:s,line:r.line}),r.index+=s.length;continue}let c=/^[A-Za-z0-9_!]+/.exec(e)?.[0];if(c){n.push({kind:`Word`,text:c,line:r.line}),r.index+=c.length;continue}if(e.startsWith(`"`)){let t=/^"((?:[^"\\\n]|\\.)*)"/.exec(e);if(!t){let t=e.indexOf(`
|
|
29
|
+
`);throw t===e.length-1?a(e):ve(r.line,r.index+t-r.lineStart+1,`
|
|
30
|
+
`,e.slice(0,t))}n.push({kind:`String`,text:t[1],line:r.line}),r.index+=t[0].length;continue}let l=pe.find(t=>e.startsWith(t));if(l){n.push({kind:`Symbol`,text:l,line:r.line}),r.index+=l.length;continue}let u=oe(t,r.index);if(!u)throw ve(r.line,r.index-r.lineStart+1,e[0]);n.push({kind:`Word`,text:u.text,line:r.line}),r.index+=u.length}return n.push({kind:`End`,text:``,line:r.line-1}),n},xe=e=>{let t=be(e),n={index:0},r={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},i={isSet:!1},a=()=>t[Math.min(n.index++,t.length-1)],o=e=>e.kind===`Word`&&fe.has(e.text),s=e=>{if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t=a();if(t.text!==`}`)for(;e.push(s(t)),t=a(),t.text===`,`;)t=a();if(t.text!==`}`)throw ye(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw ye(e.line,`It was expecting a value, but did not find it.`)},c=e=>{let t=a();if(t.kind===`End`)throw ye(t.line,`Expected an identifier after ${e}[.`);let n=a();if(n.text!==`]`)throw ye(n.line,`It was expecting ], but did not find it.`);return t.text},l=e=>{for(;;){let t=a();if(t.kind===`End`||o(t))return t;let n={text:t.text},i=a();for(;i.text===`!`;)n.text=`${n.text}!${a().text}`,i=a();if(i.text===`<-`){if(i=a(),i.text===`[`){let e=c(`<-`),t=a();if(t.kind===`End`)throw ye(t.line,`Expected an identifier after <-[mod].`);r.substitutions.push({name:n.text,target:t.text,module:e});continue}if(i.kind===`End`)throw ye(i.line,`Expected an identifier after <-.`);r.substitutions.push({name:n.text,target:i.text});continue}let l=[];if(i.text===`(`){for(;l.push(s(a())),i=a(),i.text===`,`;);if(i.text!==`)`)throw ye(e,``);i=a()}if(i.text!==`=`)throw ye(i.line,`It was expecting = or <-, but did not find it.`);i=a();let u=i.text===`[`?c(`=`):void 0,d=s(u===void 0?i:a());r.constants.push({name:n.text,value:d,...l.length>0&&{args:l},...u&&{module:u}})}},u=a();for(;u.kind!==`End`;){let e=u.text,t=u.line;if(he(e)){let n=a();if(n.kind===`End`)throw ye(t,`The keyword ${e} was not followed by an identifier.`);let i=M[e];if(r[i]!==void 0)throw ye(t,`The keyword ${e} appeared twice.`);r[i]=n.text,u=a()}else if(ge(e)){let t=r[me[e]];for(u=a();u.kind!==`End`&&!o(u);)t.push(u.text),u=a()}else if(e===`CONSTANT`||e===`CONSTANTS`)u=l(t);else if(e===`CHECK_DEADLOCK`){let e=a();if(e.kind===`End`)throw ye(t,`The keyword CHECK_DEADLOCK was not followed by an identifier.`);if(e.text!==`TRUE`&&e.text!==`FALSE`)throw ye(e.line,`It was expecting TRUE or FALSE, but did not find it.`);if(i.isSet)throw ye(t,`The keyword CHECK_DEADLOCK appeared twice.`);i.isSet=!0,r.checkDeadlock=e.text===`TRUE`,u=a()}else throw ye(t,`It was expecting a keyword, but did not find it.`)}if(r.specification!==void 0&&(r.init!==void 0||r.next!==void 0))throw new v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);return r},Se={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:` `}},Ce=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},we=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Te=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Ee=e=>{let t=t=>{let n=ce(e,t,Ce);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=ce(e,t,we);if(e.startsWith(`..`,n)&&we(e[n+2]))return{kind:`Constant`,first:t,last:ce(e,n+2,we)-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=we(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:ce(e,t+1,we)-1,children:[]};if(Te(n))return{kind:`Constant`,first:t,last:ce(e,t,Te)-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)},De=e=>{let t=e.length===0?void 0:Ee(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=Se[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},N={current:void 0},Oe=/* @__PURE__ */ new WeakMap,ke=e=>e instanceof y?Oe.get(e):void 0,Ae=(e,t)=>{let n=N.current;if(!n||typeof e!=`object`)return t();try{return t()}catch(t){let r=n.get(e);throw r&&t instanceof y&&Oe.set(t,[r,...Oe.get(t)??[]]),t}},je=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Me=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),Ne=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),P=e=>typeof e==`object`&&e.kind===`ModelValue`,Pe=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:je(e)?`set`:`function`,Fe=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new b(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},F={isUsed:!1},Ie=(e,t)=>(F.isUsed=!0,e.writtenKeys=t,e),Le=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[pn(e.domain,t)]]),I=(e,t,n)=>Ie($e(e,t),n),L=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(L);e.writtenKeys=void 0,e.range.forEach(L)}},Re=e=>e.every(e=>typeof e==`string`),R=(e,t)=>e.length>0&&t.length>0&&Re(e)!==Re(t),z=(e,t)=>{F.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return R(n,r)?_t(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Ye(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=Ye(i[e],a[e]);if(t!==0)return t}return 0},ze=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=Ye(n[e],r[e]);if(t!==0)return t}return 0},B=e=>P(e)?e.type:void 0,V=(e,t,n)=>{let r=B(e),i=B(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 y(`Attempted to ${a} the differently-typed model values ${Y(e)} and ${Y(t)}`)}throw r===void 0?new y(`Attempted to ${a} the typed model value ${Y(t)} and the non-model value\n${Y(e)}`):new y(`Attempted to ${a}${n?``:` the`} typed model value ${Y(e)} and non-model value\n${Y(t)}`)},H={ranks:Object.create(null),size:0},U=e=>{H.ranks=Object.create(null),H.size=0,Xe.clear();for(let t of e)Be(t)},Be=e=>(H.ranks[e]===void 0&&(H.ranks[e]=H.size++),e),Ve=()=>H.size,He=e=>H.ranks[Be(e)],Ue=(e,t)=>{if(e===t)return 0;let n=H.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},We=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Ge=(e,t)=>(We(e)||We(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Ke=(e,t,n)=>{if(!We(e))throw new y(`Attempted to ${n} the set ${Y(K(e)?q(e):e,!0)} with the value:\n${Y(t,!0)}`);if(!We(t))throw new y(`Attempted to compare overridden value ${Y(e,!0)} with non-overridden value:\n${Y(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new y(`Attempted to compare ${Y(e,!0)} with the value\n${Y(t,!0)}`)},qe={kind:`InfiniteSet`,name:`Any`},Je=e=>{throw new y(`Attempted to compare ANY with the value\n${Y(e)}`)},Ye=(e,t)=>{if(e===t)return F.isUsed&&L(e),e===qe?Je(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return z(e,t);if(n===`Set`&&r===`Set`)return ze(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&&V(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return V(e,t,!1),n===`ModelValue`?-1:1;if(e===qe||t===qe)return Je(e===qe?t:e);if(je(e)&&je(t)&&Ge(e,t))return Ke(e,t,`compare`);let i=je(e);if(i!==je(t))throw new y(`Attempted to compare ${Pe(e)} ${Y(e)} with ${Pe(t)} ${Y(t)}`);return i?ze(q(e),an(t)):z(bn(e),bn(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Ue(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(V(e,t,!1),P(e))return-1;if(P(t))return 1;throw new y(`Attempted to compare ${Pe(e)} ${Y(e)} with ${Pe(t)} ${Y(t)}`)},Xe=/* @__PURE__ */ new Map,Ze=e=>{let t=Xe.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:He(e)};return Xe.set(e,n),n},Qe=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),$e=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0}),et=(e,t)=>{if(e===t)return F.isUsed&&L(e),e!==qe||Je(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&V(e,t,!0),Ye(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return z(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return ze(e,t)===0;if(P(e)||P(t))return V(e,t,!0),P(e)&&P(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return et(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=sn(e.domain),r=sn(t.domain);if(n||r)return n===r;let i=sn(e.range),a=sn(t.range);return i||a?i===a:et(e.domain,t.domain)&&et(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(sn(e))return sn(t);if(sn(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&et(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return sn(e)?sn(t):!sn(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>et(e,t.factors[n]));let n=je(e)&&je(t)&&!(K(e)&&K(t));if(n&&Ge(e,t))return Ke(e,t,`check equality of`)===0;if(n){if(!We(e)){let n=q(e);if(!We(t))return ze(n,q(t))===0}return $n(e)===$n(t)}return Ye(e,t)===0},tt=(e,t)=>e===t||e.length===t.length&&e.every((e,n)=>nt(e,t[n])),nt=(e,t)=>e===t?!0:typeof e!=`object`||typeof t!=`object`?!1:e.kind===`Set`&&t.kind===`Set`?(e.hash===0||t.hash===0||e.hash===t.hash)&&tt(e.elements,t.elements):e.kind===`Function`&&t.kind===`Function`?(e.hash===0||t.hash===0||e.hash===t.hash)&&tt(e.domain,t.domain)&&tt(e.range,t.range):$n(e)===$n(t),rt=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},it=e=>{if(!Ne(e))return;let t=bn(e);return{domain:t.domain,range:t.range,low:rt(t.domain)}},W=e=>{if(!Ne(e))return;let t=bn(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},G=(e,t)=>{if(B(e)!==void 0)throw new y(`Attempted to compare the typed model value ${Y(e)} and the non-model value\n${Y(t)}`);return 1},at=(e,t)=>{if(B(e)!==void 0)throw new y(`Attempted to check equality of the typed model value ${Y(e)} and the non-model value\n${Y(t)}`);return!1},ot=(e,t)=>{let n=B(e);if(n===void 0)return P(t)?e.rank-t.rank:-1;if(!P(t))throw new y(`Attempted to compare the typed model value ${Y(e)} and non-model value\n${Y(t)}`);let r=B(t);if(r!==void 0&&r!==n)throw new y(`Attempted to compare the differently-typed model values ${Y(e)} and ${Y(t)}`);return e.rank-t.rank},st=(e,t)=>{let n=B(e);if(n===void 0)return P(t)&&e.name===t.name;if(!P(t))throw new y(`Attempted to check equality of typed model value ${Y(e)} and non-model value\n${Y(t)}`);let r=B(t);if(r!==void 0&&r!==n)throw new y(`Attempted to check equality of the differently-typed model values ${Y(e)} and ${Y(t)}`);return e.name===t.name},ct={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},lt=(e,t,n)=>{let r=ct[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${Y(e)} with ${r.other}:\n${Y(t)}`},ut=(e,t,n)=>{let r=it(n);if(!r){if(P(n))return G(n,t);throw new y(`Attempted to compare the function ${Y(t)} with the value:\n${Y(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>dt(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return dt(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new y(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${Y(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},dt=(e,t)=>{for(let n=0;n<e.length;n++){let r=_t(e[n],t[n]);if(r!==0)return r}return 0},ft=(e,t)=>{let n=bn(e);if(e.kind===`Function`&&mn(n)!==void 0){let r=Ne(t)?mn(t):void 0;return r?n.range.length-r.length||dt(n.range,r):ut({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=W(t);if(!r){if(P(t))return G(t,e);throw new y(`Attempted to compare record:\n${Y(e)}\nwith non-record\n${Y(t)}`)}return n.domain.length-r.domain.length||dt(n.domain,r.domain)||dt(n.range,r.range)}return ut({...n,low:rt(n.domain)},e,t)},pt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),mt=(e,t)=>We(e)||We(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),ht=(e,t)=>{let n=pt(t)?t:q(t);return{elements:q(e).elements,otherElements:q(n).elements}},gt=(e,t)=>{if(mt(e,t))return Ye(e,t);if(!pt(e))return gt(q(e),t);if(!je(t)){if(P(t))return G(t,e);throw new y(`Attempted to compare the set ${Y(e)} with the value:\n${Y(t)}`)}let n=ht(e,t);return n.elements.length-n.otherElements.length||dt(n.elements,n.otherElements)},_t=(e,t)=>Ae(e,()=>{if(typeof e!=`object`){if(typeof t==typeof e)return Ye(e,t);if(P(t))return G(t,e);throw new y(lt(e,t,!1))}return e.kind===`ModelValue`?ot(e,t):Ne(e)?ft(e,t):gt(e,t)}),vt=(e,t)=>e.every((e,n)=>St(e,t[n])),yt=(e,t,n)=>{let r=it(n);if(!r){if(P(n))return at(n,t);throw new y(`Attempted to check equality of the function ${Y(t)} with the value:\n${Y(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&vt(e.range,r.range);let i=e.low??r.low;return i===void 0?vt(e.domain,r.domain)&&vt(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new y(`Attempted to compare an integer with non-integer:\n${Y(e)}.`);return e===i+t})&&vt(e.range,r.range)},bt=(e,t)=>{let n=bn(e);if(e.kind===`Function`&&mn(n)!==void 0){let r=Ne(t)?mn(t):void 0;return r?n.range.length===r.length&&vt(n.range,r):yt({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=W(t);if(!r){if(P(t))return at(t,e);throw new y(`Attempted to check equality of record:\n${Y(e)}\nwith non-record\n${Y(t)}`)}return n.domain.length===r.domain.length&&vt(n.domain,r.domain)&&vt(n.range,r.range)}return yt({...n,low:rt(n.domain)},e,t)},xt=(e,t)=>{if(mt(e,t))return et(e,t);if(!pt(e))return xt(q(e),t);if(!je(t)){if(P(t))return at(t,e);throw new y(`Attempted to check equality of the set ${Y(e)} with the value:\n${Y(t)}`)}let n=ht(e,t);return n.elements.length===n.otherElements.length&&vt(n.elements,n.otherElements)},St=(e,t)=>Ae(e,()=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(P(t))return at(t,e);throw new y(lt(e,t,!0))}return e.kind===`ModelValue`?st(e,t):Ne(e)?bt(e,t):xt(e,t)}),Ct=e=>{let t=[];for(let n of e){let e={low:0,high:t.length,comparison:1};for(;e.low<e.high;){let r=e.low+(e.high-e.low>>1);if(e.comparison=_t(n,t[r]),e.comparison===0)break;e.comparison<0?e.high=r:e.low=r+1}e.comparison!==0&&t.splice(e.low,0,n)}return t},wt=(e,t)=>t.some(t=>St(t,e)),Tt=(e,t)=>{try{return et(e,t)}catch(n){if(!(n instanceof y))throw n;return St(e,t)}},Et=e=>{for(let t=1;t<e.length;t++)if(Ye(e[t],e[t-1])<=0)return!1;return!0},Dt=e=>{if(e.length<2||Et(e))return Qe(e);let t=[...e].sort(Ye),n=[t[0]];for(let e=1;e<t.length;e++)Ye(n[n.length-1],t[e])!==0&&n.push(t[e]);return Qe(n)},Ot=e=>{try{return Dt(e)}catch(t){if(!(t instanceof y))throw t;return{kind:`MixedSet`,elements:e}}},kt=Qe([]),At=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Ye(r[a],t)<0;)a++;a<r.length&&Ye(r[a],t)===0||i.push(t)}return i.length===n.length?e:Qe(i)},jt=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Ye(r[a],t)<0;)a++;a<r.length&&Ye(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Qe(i)},Mt=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=Ye(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=Qe(i);if(e.hash!==0){let t=e.hash;for(let e=0;e<a.length;e++)t=t+Rn(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},Nt=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Ye(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Ye(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return $e(n,r)},Pt=e=>{let t=Nt(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Ie(t,e.map(e=>e[0]))},Ft=[],It=[],Lt=/* @__PURE__ */ new WeakMap,Rt=e=>{let t=Ft[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Ft[e]=n,n},zt=e=>{if(un(e),e.low===1&&e.high>=1)return Rt(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Bt=e=>e.length>0&&(e===Ft[e.length]||Lt.has(e)),Vt=e=>{let t=q(e).elements;return Bt(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Ht=e=>{let t=It[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return It[e]=n,n},Ut=e=>$e(Rt(e.length),e),Wt=e=>Nt(e),Gt=e=>je(e)&&!We(e),Kt=(e,t=!1)=>`UNION(${Y(e.base,t)})`,qt=(e,t=e=>q(e).elements)=>{if(!Gt(e.base))throw new y(`Attempted to enumerate the nonenumerable set:\n${Kt(e)}`);return t(e.base)},Jt=(e,t,n)=>{if(Gt(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${Y(e)}\nwhen enumerating:\n${Kt(n)}`)},K=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 K(e.base);case`FunctionSet`:return K(e.domain)&&K(e.range)||Yt(e.domain)===!0||Yt(e)===!0;case`RecordSet`:return e.sets.every(K)||Yt(e)===!0;case`ProductSet`:return e.factors.every(K)||Yt(e)===!0;case`Union`:return K(e.base)&&on(e.base).every(K);case`SetOperation`:return e.operator===`\\cup`?K(e.left)&&K(e.right):e.operator===`\\cap`?K(e.left)||K(e.right):K(e.left);default:return!1}},Yt=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=Yt(e.domain);return t===void 0?void 0:!t&&Yt(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Yt(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return K(e)?q(e).elements.length===0:void 0;default:return}},Xt=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},Zt=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},Qt=e=>{if(typeof e!=`object`||e.kind!==`Subset`||We(e.base))return;let t=q(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:Zt(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Qe(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},$t=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Qe(r.map(t=>e[t])));while(Zt(r,e.length))}return t},en=e=>{if(typeof e!=`object`)throw new y(`Expected a set but found ${Y(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Ct(e.elements);case`Interval`:{let t=zt(e);return t!==Ft[t.length]&&Lt.set(t,e),t}case`Subset`:{We(e.base)&&un(e.base);let t=q(e.base).elements;if(t.length>30)throw new y(ln(e));return $t(t)}case`FunctionSet`:{if(sn(e))return[];if(We(e.domain))throw new y(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${Y(e.domain)}\ncannot be enumerated.`);let t=Vt(e.domain);if(t.length>0&&We(e.range))throw new y(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${Y(e.range)}\ncannot be enumerated.`);let n=t.length===0?[]:q(e.range).elements;return Xt(t.map(()=>n)).map(e=>$e(t,e))}case`RecordSet`:{if(sn(e))return[];let t=e.sets.map((t,n)=>{if(We(t))throw new y(`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${Y(t)}`);return q(t).elements});return Xt(t).map(t=>Wt(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(sn(e))return[];let t=e.factors.map((e,t)=>{if(We(e))throw new y(`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${Y(e)}`);return q(e).elements});return Xt(t).map(Ut)}case`FilteredSet`:if(We(e.base))throw new y(`Attempted to enumerate { x \\in S : p(x) } when S:\n${Y(e.base)}\nis not enumerable`);return q(e.base).elements.filter(e.test);case`Union`:{let t=qt(e).flatMap((t,n)=>q(Jt(t,n,e)).elements);return q(Ot(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Gt(e.left)||!Gt(e.right)))throw new y(`Attempted to enumerate S \\cup T when S:\n${Y(e.left)}\nand T:\n${Y(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Gt(e.left)&&!Gt(e.right))throw new y(`Attempted to enumerate S \\cap T when neither S:\n${Y(e.left)}\nnor T:\n${Y(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Gt(e.left))throw new y(`Attempted to enumerate S \\ T when S:\n${Y(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Mt(q(e.left),q(e.right)).elements;let t=e.operator===`\\`||K(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return q(n).elements.filter(t=>vn(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to enumerate the non-enumerable set ${Y(e)}`);default:throw new y(`Expected a set but found ${Y(e)}`)}},tn=/* @__PURE__ */ new WeakMap,nn=/* @__PURE__ */ new WeakMap,q=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Qe(en(e));let t=typeof e==`object`?tn.get(e):void 0;if(t)return t;let n=(typeof e==`object`?nn.get(e):void 0)??(N.current?Ae(e,()=>rn(e)):rn(e));return typeof e==`object`&&tn.set(e,n),n},rn=e=>{let t=en(e);return typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?Qe(t):Dt(t)},an=e=>{if(typeof e!=`object`||e.kind!==`Union`&&e.kind!==`SetOperation`&&e.kind!==`FilteredSet`||tn.has(e))return q(e);let t=nn.get(e);if(t)return t;let n=rn(e);return nn.set(e,n),n},on=e=>{if(typeof e!=`object`||tn.has(e))return q(e).elements;if(e.kind===`Union`)return qt(e,on).flatMap((t,n)=>on(Jt(t,n,e)));if(e.kind===`FilteredSet`&&!We(e.base))return on(e.base).filter(e.test);if(e.kind!==`SetOperation`)return q(e).elements;if(e.operator===`\\cup`)return!Gt(e.left)||!Gt(e.right)?q(e).elements:[...on(e.left),...on(e.right)];let t=e.operator===`\\`||K(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Gt(n)?on(n).filter(t=>vn(t,r)===(e.operator===`\\cap`)):q(e).elements},sn=e=>{if(typeof e!=`object`||!je(e))throw new y(`Shouldn't call isEmpty() on value ${Y(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new y(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(sn);case`RecordSet`:return e.sets.some(sn);case`FunctionSet`:return!sn(e.domain)&&sn(e.range);case`Union`:return qt(e).every((t,n)=>sn(Jt(t,n,e)));default:return q(e).elements.length===0}},cn=(e,t)=>e.reduce((e,n)=>{let r=e*un(n);if(r>2147483647)throw new y(t());return r},1),ln=e=>`Overflow when computing the number of elements in:\n${Y(e)}`,un=e=>{if(typeof e!=`object`)return q(e).elements.length;switch(e.kind){case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new 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 ${Y(e)}.`);case`Subset`:{let t=un(e.base);if(t>=31)throw new y(ln(e));return 2**t}case`FunctionSet`:{if(sn(e.domain))return 1;if(sn(e.range))return 0;let t=un(e.range);if(t===1)return 1;let n=un(e.domain),r={value:1};for(let i=0;i<n;i++)if(r.value*=t,r.value>2147483647)throw new y(ln(e));return r.value}case`RecordSet`:return sn(e)?0:cn(e.sets,()=>ln(e));case`ProductSet`:return sn(e)?0:cn(e.factors,()=>`Overflow when computing the number of elements in ${Y(e)}`);default:return q(e).elements.length}},dn=e=>`Attempted to check if the set ${Y(e)}is finite.`,fn=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new y(`Attempted to check if the ${Pe(e)} ${Y(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${Y(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return fn(e.base)&&sn(e.base);case`Subset`:return fn(e.base);case`FunctionSet`:{let t=fn(e.domain);if(t&&sn(e.domain))return!0;let n=fn(e.range);return n&&sn(e.range)?!0:n&&(t||un(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(!fn(e))n.isAllFinite=!1;else if(sn(e))return!0;return n.isAllFinite}case`Union`:if(!Gt(e.base))throw new y(`Attempted to check if the nonenumerable set:\n${Kt(e)}\nis a finite set.`);return q(e.base).elements.every(fn);case`SetOperation`:if(e.operator===`\\cup`)return fn(e.left)&&fn(e.right);if(e.operator===`\\cap`){if(!fn(e.left)&&!fn(e.right))throw new y(dn(e));return!0}if(fn(e.left))return!0;if(!fn(e.right))throw new y(dn(e));return!1;case`FilteredSet`:if(!fn(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${Y(e.base)}\nis finite.`);return!0}},pn=(e,t)=>{let n={low:0,high:e.length-1};for(;n.low<=n.high;){let r=n.low+n.high>>1,i=Ye(e[r],t);if(i===0)return r;i<0?n.low=r+1:n.high=r-1}return-1},mn=e=>{if(typeof e!=`object`||!Ne(e))return;let t=bn(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},hn=(e,t)=>`Attempted to check if the value ${Y(e)} is an element of ${Y(t)}`,gn=(e,t)=>{let n=`Attempted to check if the value:\n${Y(e)}\nis an element of the`;if(!Ne(t))return`${n} ${Pe(t)} ${Y(t)}`;let r=t.kind===`Function`||K(t.domain)?bn(t).domain:[];return r.length>0&&r.every(e=>typeof e==`string`)?`Attempted to check if element:\n${Y(e)}\nis in the record:\n${Y(t)}`:r.every((e,t)=>e===t+1)?`Attempted to check set membership in a tuple value.`:`${n} function ${Y(t)}`},_n=(e,t)=>N.current?Ae(t,()=>vn(e,t)):vn(e,t),vn=(e,t)=>{if(!je(t))throw new y(gn(e,t));switch(t.kind){case`Set`:try{return pn(t.elements,e)!==-1}catch(n){if(!(n instanceof y))throw n;return Ae(t,()=>wt(e,t.elements))}case`MixedSet`:return Ae(t,()=>wt(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 y(`Attempted to check if the value:\n${Y(e)}\nis in the integer interval ${Y(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(P(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new y(`Attempted to check if the value:\n${Y(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!Gt(e))throw new y(`Attempted to check if the non-enumerable value\n${De(Y(e))}\nis element of\n${De(Y(t))}`);return q(e).elements.every(e=>_n(e,t.base));case`FunctionSet`:{if(!Ne(e)){if(P(e))return!1;throw new y(`Attempted to check if \n${Y(e)}\nwhich is not a TLC function value, is in the set of functions:\n${De(Y(t))}`)}let n=bn(e),r=rt(n.domain);return(r===void 0?Tt(t.domain,Qe(n.domain)):Tt({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>_n(e,t.range))}case`RecordSet`:{let n=Ne(e)?bn(e):void 0;if(!n||!Re(n.domain)){if(P(e))return!1;throw new y(`Attempted to check if non-record\n${Y(e)}\nis in the set of records:\n${Y(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=pn(n.domain,e);return i!==-1&&_n(n.range[i],t.sets[r])})}case`ProductSet`:{let n=Ne(e)?mn(e):void 0;if(n===void 0){if(Ne(e)&&bn(e).domain.every(e=>typeof e==`number`)||P(e))return!1;throw new y(`Attempted to check if non-tuple\n${Y(e)}\nis in the set of tuples:\n${Y(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>_n(e,t.factors[n]))}case`FilteredSet`:return _n(e,t.base)&&t.test(e);case`Union`:if(!Gt(t.base))throw new y(`Attempted to check if:\n ${Y(e)}\nis an element of the non-enumerable set:\n ${Kt(t)}`);return q(t.base).elements.some(t=>_n(e,t));case`SetOperation`:return t.operator===`\\cup`?_n(e,t.left)||_n(e,t.right):_n(e,t.left)&&_n(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=mn(e);if(n===void 0){if(P(e))return!1;throw new y(hn(e,t))}return n.every(e=>vn(e,t.base))}default:throw new y(gn(e,t))}},yn=(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?vn(e,n):e.range.every((e,r)=>yn(e,t.range[r],n.range)),bn=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){K(e.domain)||un(e.domain);let t=Vt(e.domain);return $e(t,t.map(t=>e.apply(t)))}throw new y(`Expected a function but found ${Y(e)}`)},xn=/* @__PURE__ */ new WeakSet,Sn=e=>(xn.add(e),e),Cn=e=>{let t=e.domain;return t.length===0?xn.has(e)?`FcnRcdValue`:`TupleValue`:t===Ft[t.length]?`TupleValue`:Lt.has(t)?`IntervalFcnRcdValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},wn=(e,t)=>`Attempted to apply function:\n${De(Y(e))}\nto argument ${De(Y(t))}, which is not in the domain of the function.`,J=e=>`Attempted to apply function with integer domain to the non-integer argument ${De(Y(e))}`,Tn=(e,t)=>{if(xn.has(e)||e.kind===`LazyFunction`)return`In applying the function\n${De(Y(e))},\nthe first argument is:\n${De(Y(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${De(Y(e))}\nwhich is out of bounds.`:`Attempted to access tuple at a non integral index: ${De(Y(t))}`:n===`RecordValue`?typeof t==`string`?`Attempted to access nonexistent field '${t}' of record\n${De(Y(e))}`:`Attempted to access record by a non-string argument: ${De(Y(t))}`:n===`IntervalFcnRcdValue`&&typeof t!=`number`?J(t):wn(e,t)},En=(e,t)=>Cn(e)===`FcnRcdValue`?wn(e,t):J(t),Dn=e=>Cn(e)===`RecordValue`,On=(e,t)=>{let n=e[0];return typeof n==`number`?typeof t!=`number`&&(e===Ft[e.length]||Lt.has(e)):typeof n==`string`&&typeof t!=`string`},kn=(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 pn(e,t)},An=(e,t,n,r)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!vn(t,e.domain))throw new y(xn.has(e)?Tn(e,t):`Attempted to apply a function to ${Y(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new y(r?.(e)??`Attempted to apply ${Y(e)}, which is not a function`);let i=On(e.domain,t)?-1:kn(e.domain,t);if(i===-1)throw new y(n?.(e)??Tn(e,t));return e.range[i]},jn=e=>Bt(e)?Lt.get(e)??Ht(e.length):void 0,Mn=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=bn(e).domain;return jn(t)??Qe(t)},Nn=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!K(e.domain))){if(!vn(t,e.domain))return e;let r=n(e.apply(t));return{kind:`LazyFunction`,domain:e.domain,apply:n=>Tt(t,n)?r:e.apply(n),source:e.source}}let i=bn(e),a=kn(i.domain,t);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=$e(i.domain,o);if(l.writtenKeys=i.writtenKeys,i.hash!==0){let e=i.domain[a];l.hash=s===c?i.hash:i.hash-zn(e,s)+zn(e,c)|0}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Yn(e,s)+Yn(e,c)|0}return l},Pn=/* @__PURE__ */ new WeakMap,Fn=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},In=(e,t)=>Math.imul(e^t,16777619),Ln=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Fn(t)},Rn=e=>Fn(Hn(e)+2654435769|0),zn=(e,t)=>Fn(Math.imul(Hn(e),668265261)+Hn(t)|0),Bn={isHashed:!1},Vn=e=>{if(e.kind===`ModelValue`)return Fn(In(Ln(e.name),109));if(je(e)){if(!K(e))return Bn.isHashed=!0,Ln($n(e));let t=q(e).elements,n=1940243425;for(let e=0;e<t.length;e++)n=n+Rn(t[e])|0;return n}let t=bn(e),n=1725019383;for(let e=0;e<t.domain.length;e++)n=n+zn(t.domain[e],t.range[e])|0;return n},Hn=e=>{if(typeof e==`number`)return Fn(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Ln(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Vn(e)),e.hash;let t=Pn.get(e);if(t!==void 0)return t;let n=Vn(e);return Pn.set(e,n),n},Un=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(We(e))throw new y(`TLC has found a state in which the value of a variable contains ${Y(e)}`);if(je(e))return q(e).elements.forEach(Un);let t=bn(e);t.domain.forEach(Un),t.range.forEach(Un)},Wn=e=>{Bn.isHashed&&e.forEach(Un)},Gn=/* @__PURE__ */ new WeakMap,Kn=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},qn=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(Zn(e)+2135587861|0),Yn=(e,t)=>Kn(Math.imul(Zn(e),374761393)+Zn(t)|0),Xn=e=>{if(e.kind===`ModelValue`)return Kn(qn(e.name)^60);if(je(e)){if(!K(e))return Bn.isHashed=!0,qn($n(e));let t=q(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Jn(t[e])|0;return n}let t=bn(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Yn(t.domain[e],t.range[e])|0;return n},Zn=e=>{if(typeof e==`number`)return Kn(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return qn(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Xn(e)),e.fingerprint;let t=Gn.get(e);if(t!==void 0)return t;let n=Xn(e);return Gn.set(e,n),n},Qn=/* @__PURE__ */ new WeakMap,$n=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=Qn.get(e);if(t!==void 0)return t;let n=er(e);return Qn.set(e,n),n},er=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${$n(e.base)}>`;if(e.kind===`FilteredSet`&&!K(e))throw new y(`Attempted to compare the non-enumerable set ${Y(e)} with another value`);if(je(e))return K(e)?`{${q(e).elements.map($n).join(`,`)}}`:`<${e.kind} ${Y(e)}>`;let t=bn(e);return`(${t.domain.map((e,n)=>`${$n(e)}:${$n(t.range[n])}`).join(`,`)})`},tr=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,nr=e=>e.reduce((e,t)=>e===0?0:e*un(t),1),rr=e=>{if(e.kind===`Subset`)return un(e.base)<=6?q(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return q(e);if(e.kind===`FunctionSet`&&K(e.domain)&&un(e.domain)===0)return Qe([$e([],[])]);let t=e.kind===`FunctionSet`?un(e.range)**un(e.domain):nr(e.kind===`RecordSet`?e.sets:e.factors);return t===0?kt:t<=1999?q(e):void 0},ir=(e,t)=>{if(t)return rr(e);if(K(e))try{return rr(e)}catch(e){if(e instanceof y)return;throw e}},ar=(e,t)=>{let n=e=>Y(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return`{x \\in ${n(e.base)} : ...}`;case`Union`:return Kt(e,t)}},or=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Y=(e,t=!1,n=!1)=>{let r=e=>Y(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return tr(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(q(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=ir(e,t);return n?r(n):ar(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{if(e.kind===`LazyFunction`&&!K(e.domain)){let t=e.source;return t?`[${t.parameters.map(e=>`${e.name} \\in ${Y(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}let i=bn(e),a=r=>Y(r,t,n&&e.kind===`Function`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:i.domain.every(e=>typeof e==`string`&&or(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):Le(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},sr=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${De(Y(n))}\n`).join(``)},cr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},lr=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Hn(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||nt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||nt(i[e],n))return i[e]}return n.kind===`Set`?cr(n.elements,t):(cr(n.domain,t),cr(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}},ur=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},X=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,dr=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),fr=(e,t)=>dr.has(e)?new y(t):new b(t),pr=e=>typeof e==`object`&&e.kind===`Operator`,Z=(e,t,n)=>{let r=e[t];if(r===void 0||pr(r))throw fr(n,`${n} expects a value as argument ${t+1}`);return r},mr=(e,t,n)=>{let r=Z(e,t,n);if(typeof r!=`number`)throw fr(n,`${n} expects an integer but received ${Y(r)}`);return r},hr=(e,t,n)=>{let r=Z(e,t,n);if(typeof r!=`boolean`)throw fr(n,`${n} expects a boolean but received ${Y(r)}`);return r},gr=(e,t,n)=>{let r=Z(e,t,n);if(!je(r))throw fr(n,`${n} expects a set but received ${Y(r)}`);return r},_r=(e,t,n)=>{let r=gr(e,t,n);if(!K(r))throw fr(n,`${n} cannot enumerate the non-enumerable set ${Y(r)}`);return r},vr=(e,t,n)=>q(_r(e,t,n)),yr=(e,t,n)=>vr(e,t,n).elements,br=(e,t,n)=>{let r=Z(e,t,n),i=mn(r);if(!i)throw fr(n,`${n} expects a sequence but received ${Y(r)}`);return i},xr=(e,t,n)=>{let r=Z(e,t,n);if(!Ne(r))throw fr(n,`${n} expects a function but received ${Y(r)}`);return bn(r)},Sr=(e,t,n)=>{let r=e[t];if(r===void 0||!pr(r))throw fr(n,`${n} expects an operator as argument ${t+1}`);return r},Cr=(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}),wr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Tr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Er=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(Z(n,0,e),Z(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Dr=e=>e>2147483647||e<-2147483648,Or=e=>new b(`Overflow when computing ${e}`),kr={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`},Ar={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},jr={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`},Mr=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Ar[e.operator];if(e.kind!==`Function`)return kr[e.kind];let t=e.domain;return t.every((e,t)=>e===t+1)?`TupleValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},Nr=e=>jr[Mr(e)],Pr=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Fr=(e,t)=>{let n=n=>(...r)=>{try{return n(...r)}catch(n){throw n instanceof y&&(e.isLazy===!0||!(n instanceof b))?Pr(t,n.message):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Ir=(e,t)=>{if(typeof e!=`number`)throw Pr(t,`Cannot cast tlc2.value.impl.${Mr(e)} to tlc2.value.impl.IntValue`);return e},Lr=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Rr=(e,t,n,r)=>{let i=Lr(e,n,`IntValue`,2);return Er(t,(e,n)=>{let a=Ir(e,i),o=Ir(n,i),s=r(a,o);if(Dr(s))throw Or(`${a}${t}${o}`);return s})},zr=(e,t,n)=>{if(typeof e!=`number`)throw new b(`The ${t} argument of ${n} should be an integer, but instead it is:\n${Y(e)}`);return e},Br=(e,t)=>Er(e,(n,r)=>t(zr(n,`first`,e),zr(r,`second`,e))),Vr=(e,t,n)=>({...Tr(e,t,n),isLazy:!0}),Hr=(e,t,n)=>{let r=Sr(e,t,n);return()=>r.call([])},Ur=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Wr=()=>({bool:Yo,condition:(e,t)=>{if(typeof e!=`boolean`)throw Io(t,e);return e},conjunct:(e,t,n)=>{if(typeof e!=`boolean`)throw Lo(t,n,e);return e},apply:An,tuple:Ut,set:Ot,record:$e,writtenRecord:I,equal:et,enumerate:es,unassigned:(e,t)=>{throw Pc(e,t)},primeOutsideAction:e=>{throw Fc(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)=>Ko(e,t,n[r]),e.scope),state:e.state,next:e.next})}),Gr={value:void 0},Kr=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),qr=e=>`local${e.counter++}`,Jr=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),ur(e).forEach(e=>Jr(e,t)),t),Yr=(e,t,n)=>{let r=Kr(e,ic(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(`, `)}]))`},Xr=(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(()=>qr(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Qr(e,t.set,s)}, ${Kr(e,t.set)});`),u=t.bounds.map(t=>{let n=qr(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Qr(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=qr(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})`},Zr=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Qr(e,r[0],n)}, "the left side of =>") ? bool(${Qr(e,r[1],n)}, "the right side of =>") : true)`;if(X(t))return Yr(e,t,n);let i=ms(t.operator,e.environment);if(i?.kind!==`Builtin`)return Yr(e,t,n);if(i.name===`DOMAIN`)return`${Kr(e,Vo(t))}(${Qr(e,r[0],n)})`;if(i.name===`TLCEval`)return Yr(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Kr(e,Ho(t,i))}(${Qr(e,r[0],n)}, ${Qr(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&fc(r[0],a))return`${Kr(e,i.evaluateUnary)}(${Qr(e,r[0],n)})`;let o=r.length===2&&fc(r[0],a)&&fc(r[1],a);return i.evaluateBinary&&o?`${Kr(e,i.evaluateBinary)}(${Qr(e,r[0],n)}, ${Qr(e,r[1],n)})`:Yr(e,t,n)},Qr=(e,t,n)=>{let r=(t,r=n)=>Qr(e,t,r);if(Ys(t)&&Ws(t,e.environment))return Yr(e,t,n);switch(t.kind){case`Number`:return Ms(t.value)?String(t.value):Yr(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(X(t))return Yr(e,t,n);let i=ws(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):Yr(e,t,n)}case`Apply`:return Zr(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`:{Oc(t.function);let n=r(t.function),i=Kr(e,zo(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,Ro(t))}, ${Kr(e,Bo(t))})`;case`Record`:{let i=Mc(t.fields);if(Nc(i))return Yr(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`)?Xr(e,t,n):Yr(e,t,n);default:return Yr(e,t,n)}},$r=(e,t)=>{if(!Ur.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=Qr(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
31
|
+
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;Gr.value??=Wr();let o=Gr.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ei={kind:`Local`},ti=/* @__PURE__ */ new WeakMap,ni=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ri=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2}])),ii=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,ai=e=>e.kind===`Operator`?e.params.length:0,oi=e=>e.name.includes(`!`),si=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},ci=(e,t,n=0)=>t.reduce((e,t)=>({name:t,arity:n,parent:e}),e),li=(e,t)=>t.reduce((e,t)=>({name:t.name,arity:t.arity,parent:e}),e),ui=e=>e.kind===`Name`?[e.name]:e.names,di=e=>e.flatMap(e=>ui(e.pattern)),fi=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||ii(n.location,t.location))?n:void 0},pi=(e,t)=>{let n=fi(e,t);return n?{key:t.getKey(n),arity:ai(n)}:t.imported.get(e)},mi=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),hi=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return ii(e.location,e.args[0].location)?`prefix`:`postfix`}},gi=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),_i=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),vi=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,yi=e=>e.kind===`Subexpression`?e.selectors:(e.kind===`Identifier`?e.name:e.operator).split(`!`).map(e=>({kind:`Name`,name:e,args:[]})),bi=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,xi=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Si=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Si(e.body,t):ur(e).reduce((e,n)=>e??Si(n,t),void 0)},Ci=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Ci(i,t,n||xi(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Si(e.set,t):Si(e,t)},wi=e=>typeof e==`number`?`argument selector ${e}`:e,Ti=`within the scope of a declaration
|
|
32
|
+
from outside that declaration's scope.`,Ei=(e,t,n,r,i)=>{let a=(t,n)=>{let i=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;i&&r.errors.push({location:g(i),message:n})},o=n.isSuffices===n.isInProof,s=n.statement,c=t[1];if(c.kind===`Name`){let e=(s.kind===`AssumeProve`?[...s.assumptions,s.conclusion]:[s]).map((e,t)=>({index:t,label:Ci(e,c.name,!1)})).find(e=>e.label!==void 0);if(!e)return a(1,`Cannot find label \`${c.name}'.`);if(s.kind===`AssumeProve`&&xi(s,e.index)&&o)return a(1,`Accessing subexpression labeled \`${c.name}' of ASSUME/PROVE clause ${Ti}`);t.slice(2).reduce((e,t,n)=>{if(!e||t.kind!==`Name`)return;let r=Si(e.body,t.name);return r||a(n+2,`Cannot find label \`${t.name}'.`),r},e.label);return}let l={node:s,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let r=e+1,i=l.node;if(n.kind!==`Operand`)return;if(l.isSufficesOpen){if(vi(n.operand,1)!==0)return a(r,i.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${wi(n.operand)}'.`);l.isSufficesOpen=!1;continue}if(i.kind!==`AssumeProve`)return;let s=[...i.assumptions,i.conclusion],c=vi(n.operand,s.length);if(c===-1)return a(r,`Nonexistent operand specified by \`${wi(n.operand)}'.`);if(xi(i,c)&&(!l.isGoal||o))return a(r,`Accessing ASSUME/PROVE clause ${Ti}`);let u=s[c];if(u.kind===`NewSymbol`&&r!==t.length-1)return a(r,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=u,l.isGoal=!1}i||(l.node.kind===`AssumeProve`&&a(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&a(void 0,`Selected a NEW declaration as an expression or operator.`))},Di=(e,t)=>{let n=t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`: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)},Oi=(e,t,n,r)=>{if(!bi(e))return!1;let i=yi(e),a=i[0],o=i.length>1&&a.kind===`Name`?si(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Ei(e,i,o,n,r),o!==void 0},ki=(e,t,n,r)=>{let i=e.location,a=ti.get(e);if(a!==void 0)return a;if(ni(t)||Oi(e,n,r,!1)||_i(t))return e.kind===`Apply`?e.args.length:0;let o=si(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=ei),o)return o.arity;let s=pi(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,ti.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(si(n,c)!==void 0||pi(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=g(mi(i,t===`-.`?`-`:t));if(!gi(t)){r.errors.push({location:l,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:l,message:`Could not find declaration or definition of symbol '${t}'.`});let u=hi(e);u&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${u} operator symbol \`${t}'.`})},Ai=(e,t,n)=>(e.forEach(e=>zi(e.set,t,n)),e.reduce((e,t)=>ci(e,ui(t.pattern)),t)),ji=(e,t)=>e.kind===`Identifier`&&e.name===t&&X(e)||ur(e).some(e=>ji(e,t)),Mi=(e,t)=>{e.kind===`FunctionConstruction`&&ji(e.body,t)&&(e.isRecursive=!0),ur(e).forEach(e=>Mi(e,t))},Ni=(e,t,n)=>{let r=n.hasLabelScope?n:{...n,hasLabelScope:!0},i=ci(t,e.kind===`Function`?[e.name]:[]);e.kind===`Function`?(zi(e.body,Ai(e.bounds,i,r),r),Mi(e.body,e.name)):zi(e.body,li(i,e.params),r)},Pi=(e,t,n)=>{let r=e.filter(e=>e.isRecursive).reduce((e,t)=>({name:t.name,arity:ai(t),parent:e}),t);return e.reduce((e,t)=>(oi(t)||Ni(t,e,n),{name:t.name,arity:ai(t),parent:e}),r)},Fi=(e,t,n,r,i)=>{let a=e.kind===`Operator`?e.params[t]:void 0,o=n.location;if(a?.arity===0&&r>0)throw new p(`Operator used in argument number ${t+1} has incorrect number of arguments at line ${o.line}, column ${o.column}`);let s=i?.kind===`Operator`&&i.params.some(e=>e.arity>0);if(a!==void 0&&a.arity>0&&(r!==a.arity||s))throw new p(`Argument number ${t+1} to operator '${e.name}' should be a ${a.arity}-parameter operator at line ${o.line}, column ${o.column}`)},Ii=e=>e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:void 0,Li=(e,t,n)=>{let r=e.operator,i=si(t,r)?void 0:fi(r,n),a=ki(e,r,t,n);a!==void 0&&(a===e.args.length?e.args.forEach((e,r)=>{if(e.kind===`Identifier`&&i?.kind===`Operator`&&i.params[r].arity===0){zi(e,t,n);return}let a=Ii(e),o=a===void 0||si(t,a)?void 0:fi(a,n),s=Ri(e,t,n);i&&s!==void 0&&Fi(i,r,e,s,o)}):n.errors.push({location:g(e.argumentsRange??mi(e.location,r)),message:`The operator ${r} requires ${a} arguments.`}))},Ri=(e,t,n)=>e.kind===`Identifier`?ki(e,e.name,t,n):e.kind===`OperatorReference`?ki(e,e.operator,t,n):(zi(e,t,n),e.kind===`Lambda`?e.params.length:0),zi=(e,t,n)=>{let r=e=>e.forEach(e=>zi(e,t,n));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=e.name,i=ki(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:g(mi(e.location,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:ki(e,e.operator,t,n);return;case`Apply`:Li(e,t,n);return;case`Lambda`:zi(e.body,ci(t,e.params),n);return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:zi(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&&zi(e.other,t,n);return;case`Let`:zi(e.body,Pi(e.definitions,t,n),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:zi(e.body,Ai(e.bounds,t,n),n);return;case`UnboundedQuantifier`:zi(e.body,ci(t,e.names),n);return;case`Choose`:e.set&&zi(e.set,t,n),zi(e.body,ci(t,ui(e.pattern)),n);return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:zi(e.predicate,Ai([e.bound],t,n),n);return;case`SetMap`:zi(e.expression,Ai(e.bounds,t,n),n);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??mi(r.location,r.name)),message:`Non-unique fields in constructor.`}),zi(r.value,t,n)});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`:zi(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`:Di(e,n)||zi(e.body,t,n);return;case`Subexpression`:e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Ri(e,t,n)),Oi(e,t,n,!1)}},Bi=(e,t,n)=>{let r=(e,n,i)=>{e.kind===`Label`&&Di(e,i)||(Oi(e,t,i,n),ur(e).forEach(t=>r(t,!1,e.kind===`Let`&&t!==e.body?{...i,hasLabelScope:!0}:i)))};e.forEach(e=>{e.kind!==`ModuleFact`&&r(e,!0,{...n,hasLabelScope:!1})})},Vi=(e,t,n)=>(e.set&&zi(e.set,t,n),{name:e.name,arity:e.arity,parent:t}),Hi=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Vi(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Hi(t,e.scope,e.unit,!0):zi(t,e.scope,e.unit),e),{scope:t,unit:n});return zi(e.conclusion,i.scope,i.unit),i.scope},Ui=(e,t,n)=>e.kind===`AssumeProve`?Hi(e,t,n):(zi(e,t,n),t),Wi=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Bi(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Gi(t,e,r),t)},Gi=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0};switch(r.kind){case`Assert`:{let a=Ui(r.statement,t,i),o=e.name;if(o===void 0)return Wi(e.proof,a,n),r.isSuffices?a:t;let s={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Wi(e.proof,{name:o,arity:0,parent:a,goal:s},n),s.isInProof=!1,{name:o,arity:0,parent:r.isSuffices?a:t,goal:s}}case`Use`:case`Hide`:return Bi(r.facts,t,n),t;case`Define`:return Pi(r.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),t,n);case`Have`:case`Case`:return zi(r.expression,t,i),Wi(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>zi(e,t,i)),t;case`Take`:return ci(Ai(r.bounds,t,i),r.names);case`Pick`:{let a=ci(Ai(r.bounds,t,i),r.names);return zi(r.body,a,i),Wi(e.proof,t,n),a}default:return Wi(e.proof,t,n),t}},Ki=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Ui(e.statement,void 0,t),r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Wi(e.proof,n,t),r&&(r.isInProof=!1)},qi=(e,t)=>new p(`Multiply-defined symbol '${e}' at line ${t.line}, column ${t.column}`),Ji=(e,t,n,r)=>t.reduce((e,t)=>{if(si(e,t)||n(t))throw qi(t,r);return{name:t,arity:0,parent:e}},e),Yi=(e,t,n,r)=>(e.forEach(e=>Zi(e.set,t,n)),e.reduce((e,t)=>Ji(e,ui(t.pattern),n,r),t)),Xi=(e,t,n)=>{if(e.kind===`Function`){let r=ci(t,[e.name]),i=Yi(e.bounds,r,n,e.location);Zi(e.body,i,n);return}let r=Ji(t,e.params.map(e=>e.name),n,e.location);Zi(e.body,r,n)},Zi=(e,t,n)=>{let r=e.location;switch(e.kind){case`Lambda`:Zi(e.body,Ji(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(si(e,t.name)||n(t.name))throw qi(t.name,t.location);return Xi(t,ci(e,i),n),ci(e,[t.name])},t);Zi(e.body,Ji(a,(e.instances??[]).flatMap(e=>e.name===void 0?[]:[e.name]),n,r),n);return}case`Forall`:case`Exists`:case`FunctionConstruction`:Zi(e.body,Yi(e.bounds,t,n,r),n);return;case`SetFilter`:Zi(e.predicate,Yi([e.bound],t,n,r),n);return;case`SetMap`:Zi(e.expression,Yi(e.bounds,t,n,r),n);return;case`UnboundedQuantifier`:Zi(e.body,Ji(t,e.names,n,r),n);return;case`Choose`:e.set&&Zi(e.set,t,n),Zi(e.body,Ji(t,ui(e.pattern),n,r),n);return;default:ur(e).forEach(e=>Zi(e,t,n))}},Qi=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}))],$i=(e,t)=>{let n=/* @__PURE__ */ new Map;Qi(e).sort((e,t)=>ii(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)&&!ri.has(e))return!1;let r=t.importedAt.get(e);return r===void 0||ii(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 qi(n.name,n.location)}));let i=e=>t=>(n.get(t)??[]).some(t=>t.isRecursive||ii(t.location,e))||r(t,e);e.definitions.forEach(e=>Xi(e,void 0,i(e.location))),e.assumptions.forEach(e=>Zi(e.expression,void 0,i(e.location))),e.instances.forEach(e=>{let t=i(e.location),n=Ji(void 0,e.params.map(e=>e.name),t,e.location);e.substitutions.forEach(e=>Zi(e.expression,n,t))})},ea=(e,t)=>{let n=new Map([...ri,...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},ta=(e,t,n,r)=>{let i=li(void 0,e.params),a={imported:ea(n,r.imported),definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,errors:[],hasLabelScope:!0,isLabelForbidden:!1},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}`;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}`)});let c=[...o.keys(),...t.map(e=>e.name)],l=new Map(t.toSorted((e,t)=>c.indexOf(e.name)-c.indexOf(t.name)).map(t=>{let n=t.name;if(!o.has(n)&&!si(i,n)&&!pi(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 zi(r,i,a),[n,r];let c=ki(r,r.name,i,a);if(c!==void 0&&c!==t.arity)throw new p(`An operator must be substituted for symbol '${n}', and it must have arity ${t.arity} ${s}`);return[n,r]}));if(a.errors.length>0)throw m(a.errors);return l},na=e=>{let t=[];if(e.toSorted((e,t)=>ii(e.location,t.location)?-1:1).forEach(e=>{let n=[];try{e.check(n)}catch(e){if(!(e instanceof p)||!e.sany&&n.length===0)throw e;n.push(...e.sany?.errors??[])}n.forEach(e=>{t.every(t=>t.location!==e.location||t.message!==e.message)&&t.push(e)})}),t.length>0)throw m(t)},ra=(e,t)=>{let n=ea(e,t.imported),r=new Set([...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=(e,a,o,s)=>({imported:n,definitions:t.definitions,getKey:t.getKey,location:e,self:a,facts:r,goals:i,errors:o,hasLabelScope:s,isLabelForbidden:!1});na([...e.definitions.map(e=>({location:e.location,check:t=>Ni(e,void 0,a(e.location,e,t,!0))})),...e.assumptions.map(e=>({location:e.location,check:t=>zi(e.expression,void 0,a(e.location,void 0,t,!0))})),...e.theorems.map(e=>({location:e.location,check:t=>Ki(e,a(e.location,void 0,t,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:t=>Bi(e.facts,void 0,a(e.location,void 0,t,!1))}))])},ia=/* @__PURE__ */ new WeakSet,aa=/* @__PURE__ */ new WeakSet,oa=(e,t,n=/* @__PURE__ */ new Set)=>{let r=fa(e,(e,r)=>oa(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&X(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&X(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},sa=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),ca=/* @__PURE__ */ new WeakMap,la=e=>ca.get(e)??e.name,ua=(e,t)=>(la(t)!==e.name&&ca.set(e,la(t)),e),da=(e,t)=>ua(e.kind===`Function`?{...e,bounds:sa(e.bounds,e=>t(e,[])),body:t(e.body,di(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),fa=(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=>da(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:sa(e.bounds,n),body:t(e.body,di(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,ui(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,ui(e.bound.pattern))};case`SetMap`:return{...e,bounds:sa(e.bounds,n),expression:t(e.expression,di(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},pa=`LAMBDA`,ma=(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 fa(e,(e,n)=>(r.push(...ma(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},ha=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}},ga=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),_a=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},va=(e,t)=>e.map(e=>({pattern:_a(e.pattern,t),set:e.set})),ya=(e,t)=>e.kind===`Function`?{...e,bounds:va(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},ba=(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=>ua({...ya(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:va(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:_a(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:_a(e.bound.pattern,n),set:e.bound.set}};default:return e}},xa=e=>`${e}@ENABLED`,Sa=(e,t)=>e.modes.get(t)??e,Ca=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!X(e)&&t.instantiation.variables.has(e.name),wa=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>wa(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Ca(e,t,n))return[e.name];let r=X(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?wa(r.body,t,/* @__PURE__ */ new Map):void 0},Ta=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Ca(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:xa(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Aa(e.expression,Sa(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Aa(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Aa(e.subscript,Sa(t,`Primed`),n),location:r},Aa(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=wa(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:xa(r),location:e.location},location:e.location},Aa({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Ea=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),Da=(e,t)=>e.map(e=>Ea(e.name,t)),Oa=(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:[...Da(t,r),...i.map(e=>Ea(e,r))],location:r},location:r}},ka=(e,t)=>e.instantiation.isParameterized(t)?Ma(e,t):void 0,Aa=(e,t,n)=>{let r=e=>Aa(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!X(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Aa(e.expression,Sa(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Aa(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Sa(t,`Enabled`),n)};let s=Ta(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return ia.add(n),n;let r=ka(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&&ai(o)>0?Oa(r,a,ai(o),e.location):{kind:`Apply`,operator:r,args:Da(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||aa.has(e),c=e=>(s&&aa.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:pa,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:pa,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=ka(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...Da(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=ka(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?Oa(n,a,ai(r),e.location):{...e,operator:n}}let c=ha(t),l=fa(e,(e,i)=>i.length===0?r(e):Aa(e,t,ga(n,i,c)));return ba(l,n,c)},ja=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:Ea(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ma=(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=ha(e),o=ya(da(i,(t,n)=>Aa(t,e,ga(/* @__PURE__ */ new Map,n,a))),a);return ja(o,r.params,i.location)}):t},Na=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ma(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=>ka(i,e)??e,getQualifiedKey:t=>{let n=ka(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>ja(r,e.params,r.location)):t}}},Pa=e=>e.kind===`Let`&&e.instances!==void 0||ur(e).some(Pa),Fa=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=fa(e,e=>Fa(e,t,r));return i.kind!==`Let`||!i.instances?i:{kind:`Let`,definitions:i.instances.reduce((e,n)=>{let i=e.findIndex(e=>ii(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}},Ia=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,La=(e,t)=>e.definitions.some(e=>Pa(e.body))||e.assumptions.some(e=>Pa(e.expression))||e.theorems.some(e=>{let t=Ia(e);return t!==void 0&&Pa(t)})?{...e,definitions:e.definitions.map(e=>da(e,e=>Fa(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Fa(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Ia(e);return n===void 0?e:{...e,statement:Fa(n,t,[])}})}:e,Ra=/* @__PURE__ */ new WeakMap,za=/* @__PURE__ */ new WeakMap,Ba=(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},Va=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Ha=(e,t,n)=>{if(typeof t==`boolean`)return t;throw new y(`In computing ${n?`initial`:`next`} states, TLC expected a boolean expression,\nbut instead found ${Y(t)}.\n${Fo(e)}`)},Ua=(t,r,i=sc(t,r))=>{if(r.next!==void 0&&t.kind===`Number`)throw n(new y(`The next state relation is not a boolean expression.\n${t.text??t.value}`),e.error);return Ha(t,i,r.next===void 0)},Wa=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Ga=/* @__PURE__ */ new WeakMap,Ka=(e,t)=>{if(!e.trace)return t?Ra:za;let n=Ga.get(e)??[/* @__PURE__ */ new WeakMap,/* @__PURE__ */ new WeakMap];return Ga.set(e,n),n[+!t]},qa=(e,t,n)=>{let r=Ka(t,n),i=r.get(e);if(i)return i;let a=wo(e,t,n),o=t.trace,s=o?(t,n,r,i,s,c)=>{let l=o.length;o.push(e),a(t,n,r,i,s,c),o.length=l}:a;return r.set(e,s),s},Ja=(e,t)=>{if(t.constants.has(e))return;let n=Xo(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Ya=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Ya(e.expression,t,!1,r);if(e.kind!==`Identifier`||X(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Ja(e.name,t);if(a&&!r.has(a))return r.add(a),Ya(a.body,t,n,r)},Xa=(e,t,n)=>Ya(e,t,!n),Za=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Za(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=As(e.definitions,Ba(r,t,n));return Za(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Go(t,e.name);if(a?.kind===`Thunk`)return Za(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=Ja(e.name,r.environment);if(s)return Za(s.body,void 0,n,r,i)},Qa=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||X(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=Ja(e.name,t);if(i)return n.add(e.name),$a(i.body,t,n)},eo=(e,t)=>{if(e.kind===`Tuple`)return[e,...e.elements.flatMap(e=>eo(e,t))];let n=e.kind===`Identifier`&&!t.variableIndex.has(e.name)?Ja(e.name,t):void 0;return n?[e,...eo(n.body,t)]:[e]},to=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),no=(e,t,n)=>to.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Wa(e.operator)&&(Qa(e.args[0],n)||Xa(e.args[0],t,n)!==void 0)||X(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,ro=/* @__PURE__ */ new Set,io=(e,t)=>{if(X(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return fa(e,(e,i)=>{let a=r.isReadOnly?io(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},ao=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||X(e)?void 0:Xo(r,t);return i&&!n.has(i)&&(n.add(i),ao(i.body,t,n))?!0:ur(e).some(e=>ao(e,t,n))},oo=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Xa(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=$a(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return no(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:qa(e,t,n)}},so=(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(Bc(e,t)===void 0||ao(e,t,/* @__PURE__ */ new Set))return!0;let n=io(e,ro);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)}},co=(e,t,n)=>{let r=e.map(e=>oo(e,t,n)),i=r.map(()=>void 0),a=t.trace,o=(e,n,s,c,l,u)=>{let d=c,f;for(let c=e;c<r.length;c++){if(c>0&&n.isInit&&Oo(d)){f??=Ba(n,s,d);for(let e=c;e<r.length;e++)if(!lo(r[e].expression,f))return;u(d,l);return}let e=r[c];if(a&&(a.push(e.expression),e.expression.kind===`Unchanged`&&a.push(...eo(e.expression.expression,t))),e.kind===`Guard`){f??=Ba(n,s,d);let r=i[c]??=oc(e.expression,t);if(!Ua(e.expression,f,r(f)))return;continue}if(e.kind===`Assign`){f??=Ba(n,s,d);let r=(i[c]??=oc(e.value,t))(f),a=d[e.index];if(a===void 0)d=Va(d,e.index,r),f=void 0;else if(!et(a,r))return;continue}if(e.kind===`Unchanged`){let t=n.current;if(!t)return;for(let n of e.indices){let e=d[n];if(e===void 0)d=Va(d,n,t[n]),f=void 0;else if(!et(e,t[n]))return}continue}let p=c+1;e.runner(n,s,d,l,!0,(e,t)=>o(p,n,s,e,t,u));return}u(d,l)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},lo=(e,t)=>Ha(e,sc(e,t),!0),uo=e=>(t,n,r,i,a,o)=>{Ua(e,Ba(t,n,r))&&o(r,i)},fo=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Ba(r,i,a);if(a[l]!==void 0){Ua(e,u)&&c(a,o);return}let d=sc(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!K(f))throw new y(`In computing ${r.isInit?`initial`:`next`} states, the right side of \\IN is not enumerable.\n${Fo(e)}`);let p=on(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Va(a,l,p[e]),o)}},po=/* @__PURE__ */ new WeakMap,mo=e=>{let t=po.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(mo),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return po.set(e,n),n},ho=(e,t)=>{let n=e.args[0],r=uo(e),i=(e,r,i)=>Za(n,r,i,e,!t)??-1,a=fo(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=sc(e.args[1],Ba(t,n,o));l(Va(o,u,d),s)}},go=(e,t,n,r)=>{if(e.kind===`FunctionConstruction`)return{bounds:e.bounds,body:e.body,scope:t};if(e.kind!==`Identifier`)return;let i=Go(t,e.name);if(i?.kind===`Thunk`)return go(i.expression,i.scope,n,r);let a=i?void 0:Xo(e.name,r.environment);if(a?.kind!==`Function`)return;let o=sc(e,Ba(r,void 0,n));return{bounds:a.bounds,body:a.body,scope:Ko(void 0,a.name,o)}},_o=(e,t,n)=>{let r=uo(e);return(i,a,o,s,c,l)=>{let u=go(e.function,a,o,i);if(!u){r(i,a,o,s,c,l);return}let d=Ba(i,a,o),f=e.args.map(e=>sc(e,d)),p=f.length===1?f[0]:Ut(f),m=ns(u.bounds,Ba(i,u.scope,o));if(!vn(p,m))throw new y(`Attempted to apply a function to ${Y(p)}, which is not in its domain at ${Po(e)}`);qa(u.body,t,n)(i,rs(u.bounds,u.scope,p),o,s,c,l)}},vo=(e,t)=>{if($a(e,t))return co([mo(e)],t,!1);if(e.kind===`Tuple`)return qa(mo(e),t,!1);let n=mo(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Go(i,e.name):void 0;l?.kind===`Thunk`?qa(mo(l.expression),t,!1)(r,l.scope,a,o,s,c):Ua(n,Ba(r,i,a))&&c(a,o)}},yo=(e,t,n)=>{let r=e.operator,i=uo(e),a=X(e)?void 0:ms(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=_c(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=qa(a.body,t,n),o.body(e,i(Ba(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Ba(a,o,s),f=gs(e,d);f?.kind===`Closure`?qa(f.body,t,n)(a,Os(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},bo=(e,t,n)=>{let r=uo(e),i=X(e)?void 0:Ja(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=Go(s,e.name);f?.kind===`Thunk`?qa(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=qa(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},xo=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||X(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!X(a))return;let o=Ya(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=>xo(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||X(e))return;let r=ms(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=xo(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(i&&o?.kind===`Identifier`&&X(o))return{variable:i.variable,argument:o.name,labels:i.labels}},So=(e,t,n)=>{let r=Go(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Co=(e,t,n)=>{let r=e.map(e=>qa(e,t,n)),i=n?[]:e.map(e=>xo(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&&So(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)}},wo=(e,t,n)=>{let r=e=>qa(e,t,n);switch(e.kind){case`And`:return co(e.operands,t,n);case`Or`:return Co(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=es(sc(a.set,Ba(t,n,r)),a.set);for(let a=0;a<l.length&&!t.isStopped;a++)i(t,Ko(n,e,l[a]),r,o,s,c)}}let o=n||t.trace?void 0:so(e,t);if(o){let r=co(o.rest,t,n);return(t,n,i,a,s,c)=>{let l=Ba(t,n,i),u=e.bounds.map(e=>es(sc(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=Ko(n,o.names[e],r);if(e===u.length-1){let e=Ba(t,a,i);if(!o.guards.every(t=>Ua(t,e)))continue}d(e-1,a)}};d(u.length-1,n)}}return(t,n,r,a,o,s)=>{ts(e.bounds,Ba(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Bc(e,t)!==void 0&&!ao(e.body,t,/* @__PURE__ */ new Set)?io(e,ro):void 0;return(t,n,r,o,s,c)=>{let l=[];ts(e.bounds,Ba(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Go(n,e)?.kind===`Value`)){u.every(n=>Ua(e.body,Ba(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Oo(r)?u.slice(n).every(n=>lo(e.body,Ba(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=sc(e.condition,Ba(r,i,a));(Yo(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=Ba(r,i,a),u=t.find(e=>Yo(sc(e.condition,l),`a CASE guard`))?.body??n;if(!u)throw new y(`In computing ${r.isInit?`initial`:`next`} states, TLC encountered a CASE with no conditions true.\n${Fo(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Bs(e.definitions,t);return(t,r,a,o,s,c)=>n(t,As(e.definitions,Ba(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new y(`UNCHANGED appears in an initial predicate at ${Po(e)}`)}:vo(e.expression,t);case`AngleAction`:{let t=r(e.action),n=mo(e.subscript);return(e,r,i,a,o,s)=>t(e,r,i,a,o,(t,i)=>{try{Ua(n,Ba(e,r,t))||s(t,i)}catch(t){throw!e.isEnabled||!(t instanceof ee)?t: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 ${t.variable} occurring in the state formula v.\n`)}})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,mo(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return bo(e,t,n);case`FunctionApplication`:return _o(e,t,n);case`Apply`:{let i=e.args;if(Wa(e.operator)){let r=Xa(i[0],t,n);if(r!==void 0)return e.operator===`=`?co([e],t,n):fo(e,()=>r);if(Qa(i[0],n))return ho(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=sc(i[0],Ba(t,n,r));(typeof c==`boolean`?c:Yo(c,`the left side of => at ${Po(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return yo(e,t,n)}default:return uo(e)}},To=/* @__PURE__ */ new WeakMap,Eo=e=>{let t=To.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return To.set(e,n),n},Do=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Oo=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},ko=(e,t)=>{let n=t.state;if(!n||!Oo(n))throw new y(`ENABLED needs a complete state at ${Po(e)}`);let r=t.environment,i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return qa(e,r,!1)(i,t.scope,Eo(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Ao=(t,r,i,a)=>{let o={environment:r,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};qa(t,r,!0)(o,a,Eo(r),void 0,!1,t=>{if(!o.isStopped){if(!Oo(t))throw n(new S(t),e.error);o.isStopped=i(t)}})},jo=(e,t,n)=>{let r=[];return Ao(e,t,e=>(r.push(e),!1),n),r},Mo=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return qa(e,n,!1)(a,i,Eo(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Oo(e))throw new x(e,t,Do(e,n).sort());o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},No=(e,t,n,r)=>{let i=[];return Mo(e,t,n,e=>(i.push(e),!1),r),i},Po=e=>`line ${e.location.line}, column ${e.location.column}`,Fo=e=>{let t=e.location.range;return t?g(t):Po(e)},Io=(e,t)=>new y(`A non-boolean expression (${Nr(t)}) was used as the condition of an IF.\n${Fo(e)}`),Lo=(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):Fo(r);return new y(`A non-boolean expression (${Nr(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 y(`Attempted to evaluate an expression of form P /\\ Q when ${t===0?`P`:`Q`} was\n${Nr(n)}.\n${Fo({...e,location:{...e.location,range:{...r,end:i}}})}`)},Ro=e=>t=>Dn(t)?`Attempted to select nonexistent field "${e.field}" from the record\n${Y(t)}\n${Fo(e)}`:En(t,e.field),zo=e=>t=>`A non-function (${Nr(t)}) was applied as a function.\n${Fo(e)}`,Bo=e=>t=>`Attempted to select field "${e.field}" from a non-record value ${Y(t)}\n${Fo(e)}`,Vo=e=>t=>{if(!Ne(t))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${Nr(t)})\n${Fo(e)}`);return Mn(t)},Ho=(e,t)=>(n,r)=>{if(!je(n)||We(n))throw new y(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Fo(e)}`);return t.evaluate([n,r])},Uo=t=>n(new y(`TLC can't handle real numbers: ${t.text} at ${Po(t)}`),e.configParseError),Wo=t=>n(new y(`TLC can't handle a number this big: ${t.text??t.value} at ${Po(t)}`),e.error),Go=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Ko=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),qo=(e,t,n)=>{if(t.kind===`Name`)return Ko(e,t.name,n);let r=mn(n);if(!r||r.length!==t.names.length)throw new y(`Cannot bind <<${t.names.join(`, `)}>> to ${Y(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>Ko(e,t,r[n]),e)},Jo=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next}),Yo=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Expected ${t} to be a boolean but found ${Y(e)}`);return e},Xo=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Zo=(e,t)=>{if(e.kind===`Prime`||e.kind===`Unchanged`||e.kind===`Enabled`)return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=Xo(n,t);if(e&&!t.constants.has(n)&&!Qo(e,t))return!0}return ur(e).some(e=>Zo(e,t))},Qo=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!Zo(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>Zo(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.`},es=(e,t)=>{if(!je(e)||We(e)){let n=Y(e),r=$o(e,n);throw new y(r===void 0?`TLC encountered a non-enumerable quantifier bound\n${n}.\n${Fo(t)}`:`TLC encountered the non-enumerable quantifier bound\n${n}\n${Fo(t)}\n${r}`)}return typeof e==`object`&&e.kind===`Interval`?zt(e):Qt(e)??q(e).elements},ts=(e,t,n)=>{let r=e.map(e=>es(sc(e.set,t),e.set)),i=(t,a)=>t<0?n(a):r[t].some(n=>i(t-1,qo(a,e[t].pattern,n)));return i(e.length-1,t.scope)},ns=(e,t)=>{let n=e.map(e=>sc(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},rs=(e,t,n)=>{if(e.length===1)return qo(t,e[0].pattern,n);let r=mn(n)??[];return e.reduce((e,t,n)=>qo(e,t.pattern,r[n]),t)},is=/* @__PURE__ */ new WeakMap,as=(e,t)=>{let n=is.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:g(r)};return is.set(t,i),i},os=(e,t,n)=>{let r=as(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}},ss=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Hn(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(nt(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},cs=(e,t)=>{let n=ns(e.bounds,t),r=ss(n,(n,r)=>sc(e.body,Jo(t,rs(e.bounds,Ko(void 0,e.name,r),n))),os(e.bounds,e.body,n));return e.bounds.length===1?Sn(r):r},ls=(e,t)=>e.kind===`Function`?cs(e,t):sc(e.body,t),us=(e,t)=>{let n=Qo(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=Jo(t,void 0);if(!n)return ls(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>ls(e,i));return t.environment.definitionValues.set(e,a),a},ds=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=sc(e.expression,Jo(t,e.scope));return n&&(e.cache=r),r},fs=/* @__PURE__ */ new WeakMap,ps=e=>{let t=fs.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return fs.set(e,n),n},ms=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return ms(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?ps(r):t.builtins.get(e)},hs=/* @__PURE__ */ new WeakMap,gs=(e,t)=>{if(X(e))return _s(e.operator,t);let n=hs.get(e),r=n===void 0?ms(e.operator,t.environment)??null:n;return n===void 0&&hs.set(e,r),r??_s(e.operator,t)},_s=(e,t)=>{let n=Go(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return ms(e,t.environment)},vs=e=>e.kind===`Closure`?e.params.length:e.arity,ys=(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:_s(n,t);if(!r)throw new y(`Expected an operator argument at ${Po(e)}`);return r},bs=(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)=>Ko(e,n.name,t[r]),e.scope);return sc(e.body,Jo(n,r))},xs=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:vs(e),call:n=>bs(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},Ss=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=_s(e.name,t);return n!==void 0&&vs(n)>0},Cs=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),ws=(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 ws(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([])}},Ts=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Ms(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=X(e)?void 0:ws(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=Go(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Cs(e,t)}}return t=>Cs(e,t)},Es=/* @__PURE__ */ new WeakMap,Ds=(e,t)=>{let n=Es.get(e);if(n)return n;let r=Ts(e,t);return Es.set(e,r),r},Os=(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:ys(t[i],n)}:Ds(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},ks=(e,t,n)=>e.kind===`Closure`?sc(e.body,Jo(n,Os(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>sc(e,n))):e.isLazy?e.evaluate(pc(t,n),n):e.evaluate(t.map(e=>Ss(e,n)?xs(ys(e,n),n):sc(e,n)),n),As=(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),js=(e,t,n)=>{let r=Go(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return ds(r,n);if(r?.kind===`Operator`){if(vs(r.operator)===0)return bs(r.operator,[],n);throw new y(`Operator ${e} is used without arguments`)}let i=ws(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Pc(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return us(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 ${Po(t)}`)},Ms=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Ns=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Ps=(e,t)=>Ns.has(e)||t.builtins.get(e)?.isStateLevel===!0,Fs={builtins:Ns,definitions:/* @__PURE__ */ new WeakMap},Is={builtins:new Set([...Ns].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},Ls=(e,t)=>e.kind===`Operator`&&e.params.length===0&&Qo(e,t),Rs=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!X(e)){let e=Xo(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!Ls(e,t)&&zs(e,t,n))return!0}return ur(e).some(e=>Rs(e,t,n))},zs=(e,t,n=Fs)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Rs(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Rs(e.set,t,n));return n.definitions.set(e,i),i},Bs=(e,t)=>new Set(e.filter(e=>zs(e,t))),Vs=e=>[...e.definitions.values()].some(t=>zs(t,e)),Hs=e=>[...e.definitions.values()].some(t=>zs(t,e,Is)),Us=/* @__PURE__ */ new WeakMap,Ws=(e,t)=>{let n=Us.get(e);if(n!==void 0)return n;let r=Js(e,t,Ks);return Us.set(e,r),r},Gs=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),Ks=/* @__PURE__ */ new Set,qs=(e,t,n)=>n.size===0?Ws(e,t):Js(e,t,n),Js=(e,t,n)=>{if(!Gs.has(e.kind))return!1;if(e.kind===`Identifier`&&X(e))return n.has(e.name);if(X(e))return!1;if(e.kind===`Identifier`){let n=ws(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&Ls(n.definition,t)}if(e.kind===`Apply`){if(Ps(e.operator,t)||e.operator===`~>`)return!1;let r=ms(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=Xo(e.operator,t);if(!n||!Qo(n,t)||zs(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`&&qs(e,t,n))}let r={value:!0};return fa(e,(e,i)=>(r.value&&=qs(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Ys=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Xs=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},Zs=(e,t)=>{if(e.kind===`Identifier`&&X(e))return!t.has(e.name);if(X(e))return!0;let n={value:!1};return fa(e,(e,r)=>(n.value||=Zs(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Qs=(e,t)=>ia.has(e)&&Ys(e)&&Bc(e,t)!==void 0&&!Zs(e,Ks),$s=/* @__PURE__ */ new WeakMap,ec=/* @__PURE__ */ new Set([`SetEnumeration`,`SetMap`,`SetFilter`,`Tuple`,`Record`,`RecordSet`,`FunctionSet`,`Product`]),tc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),nc=(e,t)=>ec.has(e.kind)||e.kind===`Apply`&&tc.has(e.operator)&&!X(e)&&ms(e.operator,t)?.kind===`Builtin`,rc=(e,t,n,r)=>{try{return e(t)}catch(e){throw n.length===r+1&&n.push(...ke(e)??[]),e}},ic=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Lc(e,t),i=Ys(e)&&Ws(e,t)?Xs(r):Qs(e,t)?uc(r):r,a=t.trace,o=a!==void 0&&nc(e,t),s=a?n=>{let r=a.length;a.push(e);let s=rc(i,n,a,r);a.length=r,o&&typeof s==`object`&&s.kind!==`FilteredSet`&&N.current?.set(s,e);let c=typeof s==`object`&&s.kind===`FilteredSet`?$s.get(s):void 0;return c?c(t):s}:i;return t.evaluators.set(e,s),s},ac=/* @__PURE__ */ new WeakMap,oc=(e,t)=>{if(t.trace)return ic(e,t);let n=ac.get(e);if(n)return n;let r=(Ys(e)&&Ws(e,t)?void 0:$r(e,t))??ic(e,t);return ac.set(e,r),r},sc=(e,t)=>oc(e,t.environment)(t),cc=(e,t)=>{let n=e.name,r=X(e)?void 0:ws(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Pc(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&&Qo(e,t))return t=>us(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=oc(e.body,t),n.body(Jo(r,void 0)));return lc(e,t)?uc(r):r}return t=>us(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>us(e,t);return Qo(e,t)||!lc(e,t)?n:uc(n)}return t=>js(n,e,t)},lc=(e,t)=>Bc(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Bc(e.set,t)!==void 0)),uc=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}},dc=(e,t)=>{let n=ms(e,t);return n!==void 0&&vs(n)>0},fc=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!X(e)&&dc(e.name,t)),pc=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>sc(e,t),expression:e})),mc=/* @__PURE__ */ new Set([`=`,`#`,`\\in`,`\\notin`,`\\cup`,`\\cap`,`\\`]),hc=(e,t,n)=>e===`\\in`||e===`\\notin`||(e===`\\cup`||e===`\\cap`)&&!Me(t)?n:t,gc=(e,t,n)=>{if(n.trace&&mc.has(e.name)&&t.length===2){let r=ic(t[0],n),i=ic(t[1],n);return t=>{let n=r(t),a=i(t);return Ae(hc(e.name,n,a),()=>e.evaluate([n,a],t))}}if(e.isLazy)return n=>e.evaluate(pc(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&fc(t[0],n)){let e=ic(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&fc(t[0],n)&&fc(t[1],n);if(i&&a){let e=ic(t[0],n),r=ic(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>Ss(e,n)?xs(ys(e,n),n):sc(e,n)),n)},_c=(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:Ds(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:ys(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},vc=/* @__PURE__ */ new WeakMap,yc=e=>{let t=vc.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return vc.set(e,n),n},bc=(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},xc=(e,t)=>e.every((e,n)=>nt(e,t[n])),Sc=(e,t)=>{let n=Xo(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&Qo(n,t)&&!zs(n,t)},Cc=(e,t,n,r)=>{let i=_c(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=oc(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=yc(e);return e=>{let n=i(e),r=bc(n,t.length);if(!r)return o(n,e);let a=r.length;for(let e of r)a=In(a,Hn(e));let c=s.calls.get(a),l=c?.find(e=>xc(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}},wc=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=ic(n[0],t),r=ic(n[1],t);return t=>!Yo(e(t),`the left side of =>`)||Yo(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=X(e)?void 0:ms(e.operator,t);if(r?.kind===`Closure`)return Cc(r,n,t,Sc(e,t));if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=ic(n[0],t),i=Vo(e);return t.trace?e=>{let t=i(r(e));return typeof t==`object`&&t.kind===`Interval`?{...t}:t}:e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=ic(n[0],t);return aa.has(e)||Zo(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=ic(n[0],t),a=ic(n[1],t),o=Ho(e,r);return t.trace?e=>{let t=i(e),n=a(e);return Ae(t,()=>o(t,n))}:e=>o(i(e),a(e))}return r?.kind===`Builtin`?gc(r,n,t):r=>{let i=_s(e.operator,r);if(i)return ks(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new y(`${e.operator} is a function; apply it with brackets`):e.operator===`\\cdot`?new y(`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 y(`Unknown operator ${e.operator} at ${Po(e)}`)}},Tc=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=ic(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=ic(a.set,t);return t=>{let s=es(o(t),a.set);for(let a=0;a<s.length;a++){let o=Yo(i(Jo(t,Ko(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=>ic(e.set,t));return t=>{let s=a.map((e,n)=>es(e(t),o[n].set)),c=(a,o)=>{if(a<0)return Yo(i(Jo(t,o)),r)!==n;let l=s[a];for(let t=0;t<l.length;t++)if(c(a-1,Ko(o,e[a],l[t])))return!0;return!1};return c(o.length-1,t.scope)?!n:n}}return e=>ts(o,e,t=>Yo(i(Jo(e,t)),r)!==n)?!n:n},Ec=(e,t)=>{if(e.kind===`Tuple`)return Ut(e.names.map(e=>{let n=Go(t,e);return n?.kind===`Value`&&n.value}));let n=Go(t,e.name);return n?.kind===`Value`?n.value:void 0},Dc=/* @__PURE__ */ new WeakSet,Oc=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Dc.add(e)},kc=(e,t)=>{let n=Dc.has(e),r=ic(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=ic(a.set,t);return t=>{let c=o?s(t):ns(i,t),l=typeof c==`object`&&c.kind===`ProductSet`&&i.length>1?c.factors:[c];if(e.isRecursive||n||!l.every(Me)){let n=ss(c,e=>r(Jo(t,rs(i,t.scope,e))),os(i,e.body,c));return i.length===1?Sn(n):n}if(o&&a.pattern.kind===`Name`){let e=a.pattern.name,n=Vt(c);return Sn($e(n,n.map(n=>r(Jo(t,Ko(t.scope,e,n))))))}let u=[];return ts(i,t,e=>{let n=i.length===1?Ec(a.pattern,e)??!1:Ut(i.map(t=>Ec(t.pattern,e)??!1));return u.push([n,r(Jo(t,e))]),!1}),Nt(u)}},Ac=(e,t)=>{let n=Dc.has(e);n&&Oc(e.function);let r=ic(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=>ic(e,t))}),value:ic(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Ut(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Jo(i,Ko(i.scope,`@`,e))):Nn(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}},jc=(e,t)=>{if(e.kind===`SetFilter`){let n=ic(e.predicate,t),r=ic(e.bound.set,t),i=e.bound.pattern;return t=>{let a=r(t),o=e=>n=>Yo(e(Jo(t,qo(t.scope,i,n))),`a set filter predicate`),s=o(n);if(!Me(a)){if(je(a)){let t={kind:`FilteredSet`,base:a,test:s};return $s.set(t,n=>({...t,test:o(ic(e.predicate,n))})),t}throw new y(`TLC encountered a non-enumerable quantifier bound ${Y(a)} at ${Po(e.bound.set)}`)}return Qe(q(a).elements.filter(s))}}if(e.kind===`SetMap`){let n=ic(e.expression,t);return t=>{let r=[];return ts(e.bounds,t,e=>(r.push(n(Jo(t,e))),!1)),Ot(r)}}let n=e.set;if(!n)return()=>{throw new y(`TLC cannot evaluate an unbounded CHOOSE at ${Po(e)}`)};let r=ic(e.body,t),i={pattern:e.pattern,set:n};return t=>{let n={value:void 0};if(ts([i],t,i=>Yo(r(Jo(t,i)),`the body of CHOOSE`)?(n.value=Ec(e.pattern,i),!0):!1),n.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${Fo(e)}`);return n.value}},Mc=e=>[...e].sort((e,t)=>Ye(e.name,t.name)),Nc=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Pc=(t,n)=>a(new ee(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${Fo(n)}`,t),e.configParseError),Fc=e=>new y(`A primed expression appears outside an action at ${Po(e)}`),Ic=(e,t)=>{let n=Mc(e),r=Nc(n),i=n.map(e=>ic(e.value,t));if(r)return e=>Nt(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>I(a,i.map(t=>t(e)),o):e=>$e(a,i.map(t=>t(e)))},Lc=(e,t)=>{let n=e=>ic(e,t);switch(e.kind){case`Number`:{let t=e.value;return Ms(t)?()=>t:()=>{throw Wo(e)}}case`Decimal`:return()=>{throw Uo(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return cc(e,t);case`Apply`:return wc(e,t);case`OperatorReference`:case`Lambda`:return()=>{throw new y(`An operator cannot be used as a value at ${Po(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 Lo(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(Yo(t[n](e),`a disjunct`))return!0;return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw Fc(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>et(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Io(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(Yo(e.condition(n),`a CASE guard`))return e.body(n);if(r)return r(n);throw new y(`Attempted to evaluate a CASE with no conditions true.\n${Fo(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Jo(n,As(e.definitions,n)))}case`Forall`:case`Exists`:return Tc(e,t);case`UnboundedQuantifier`:return()=>{throw new y(`TLC cannot evaluate an unbounded quantifier at ${Po(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return jc(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Ot(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Ut(t.map(t=>t(e)))}case`FunctionConstruction`:return kc(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 Ic(e.fields,t);case`RecordSet`:{let t=Mc(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 Ac(e,t);case`ExceptAt`:return t=>{let n=Go(t.scope,`@`);if(n?.kind!==`Value`)throw new y(`@ appears outside an EXCEPT at ${Po(e)}`);return n.value};case`FunctionApplication`:{Oc(e.function);let r=n(e.function),i=e.args.map(n),a=zo(e);if(i.length===1&&t.trace){let e=i[0];return t=>{let n=r(t),i=e(t),o=()=>An(n,i,void 0,a);return Ne(n)?Ae(n,o):o()}}if(i.length===1){let e=i[0];return t=>An(r(t),e(t),void 0,a)}return e=>An(r(e),Ut(i.map(t=>t(e))),void 0,a)}case`FieldAccess`:{let t=n(e.record),r=e.field,i=Ro(e),a=Bo(e);return e=>An(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?Yo(t(e),`an action`)||r(e):Yo(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>ko(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new y(`The subexpression reference at ${Po(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 ${Po(e)}`)}}},Rc=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),zc=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Bc=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Rc.has(e.kind))return!1;let a=zc(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&&Ps(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 ur(e).every(i)};return i(e)?[...n]:void 0},Vc=/* @__PURE__ */ new Map([[`Reals`,`-------------------------------- MODULE Reals -------------------------------
|
|
24
33
|
(***************************************************************************)
|
|
25
34
|
(* This module provides dummy definitions of the operators that are *)
|
|
26
35
|
(* defined by the real Reals module. It is expected that any tool that *)
|
|
@@ -89,8 +98,17 @@ _TEPosition ==
|
|
|
89
98
|
THEN _TETraceLength
|
|
90
99
|
ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
|
|
91
100
|
|
|
92
|
-
=============================================================================`]]),
|
|
93
|
-
`)},cc=(e,t)=>{let n=oe(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=[],p=[],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]),p[t]??={line:a.line,column:a.endColumn};let o={module:c[c.length-1].name,start:d[e],end:p[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),ee={index:0},b=e=>{let t=n.slice(ee.index,r.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},x=e=>t&&(e.kind===`Keyword`||ac.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)?`====`:Qs.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):x(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 f(`${e} at line ${t.line}, column ${t.column}`,void 0,C(e,t,a,r))},C=(e,r,i,a)=>{if(t&&i){let e=n[n.length-1];return{reason:`Unexpected EOF`,...b(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}},ie=(e,t=_())=>S(e,t,t),ae=e=>(e.kind===`Identifier`||e.kind===`Keyword`)&&!x(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 ie(`Expected ${JSON.stringify(e)} but found ${y(v())}`);return T()},O=()=>{let e=v();if(e.kind!==`Identifier`)throw ie(`Expected an identifier but found ${y(e)}`);if(x(e))throw ie(`Unexpected keyword ${e.text}`);return r.index++,e.text},se=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},ce=()=>{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},le=()=>{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)},ue=()=>{if(!E(`<<`))return{kind:`Name`,name:O()};let e=k(O);return D(`>>`),{kind:`Tuple`,names:e}},de=()=>k(()=>{let e=k(ue);D(`\\in`);let t=N();return e.map(e=>({pattern:e,set:t}))}).flat(),fe=()=>{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 Se();throw ie(`Expected a subscript but found ${y(e)}`)},pe=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(`==`,Bs.has(n.text)?3:4))},me=e=>{if(!Hs.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`&&Js.has(t.text)||pe(e)},he=()=>{let e=v(),n=e.kind===`Operator`&&(zs.has(e.text)||Vs.has(e.text))&&me(e);if(t&&e.kind!==`String`&&(Vs.has(e.text)||Ws.has(e.text)&&e.text!==`'`&&!Bs.has(e.text)||Us.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)&&me(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`&&Ws.has(e.text)&&me(e)){r.index++;let t=u(e);if(Bs.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:Ks(e.text,n,t),location:t}}if(w(`LAMBDA`)){let t=r.index;T();let n=k(O);D(`:`);let i=N();return g({kind:`Lambda`,params:n,body:i,location:u(e)},t)}return N()},A=()=>se(()=>{D(`(`);let e=k(he);return D(`)`),e}),j=()=>{let e=T();r.offsideColumns.push(e.column);let t=[N()];for(;_().text===e.text&&_().column===e.column;)r.index++,t.push(N());return r.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:u(e)}},M=e=>se(()=>{let t=u(e);if(v().kind===`Identifier`&&(w(`|->`,1)||w(`:`,1))){let e=w(`|->`,1)?`Record`:`RecordSet`,n=k(()=>{let t=O();return D(e===`Record`?`|->`:`:`),{name:t,value:N()}});return D(`]`),{kind:e,fields:n,location:t}}if(ce()){let e=de();D(`|->`);let n=N();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let n=N();if(E(`->`)){let e=N();return D(`]`),{kind:`FunctionSet`,domain:n,range:e,location:t}}if(E(`EXCEPT`)){let e=k(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!ae(v()))throw ie(`Expected a field name but found ${y(v())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:k(()=>N())}),D(`]`);return D(`=`),{path:e,value:N()}});return D(`]`),{kind:`Except`,function:n,updates:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:n,subscript:fe(),location:t}}),ge=e=>se(()=>{let t=u(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ce()&&(v(1).text===`\\in`||w(`<<`))){let e=r.index,n=ue();D(`\\in`);let i=N();if(E(`:`)){let e=N();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:i},predicate:e,location:t}}r.index=e}let n=N();if(E(`:`)){let e=de();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let i=[n];for(;E(`,`);)i.push(N());return D(`}`),{kind:`SetEnumeration`,elements:i,location:t}}),_e=e=>{let t=u(e),n=se(()=>w(`>>`)||w(`>>_`)?[]:k(()=>N()));if(E(`>>_`)){if(n.length!==1)throw S(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:fe(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},ve=e=>{let t=u(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ce()){let e=de();return D(`:`),{kind:n,bounds:e,body:N(),location:t}}let i=k(O);return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i,body:N(),isTemporal:r,location:t}},ye=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:N(),location:u(e)};let n=N();D(`->`),t.push({condition:n,body:N()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:u(e)}},be=()=>{let e=v(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||qs.has(e.text)||e.kind===`Operator`&&(zs.has(e.text)||Bs.has(e.text)||Vs.has(e.text)))},xe=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:re(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:A()}}return{kind:`Name`,name:e.text,args:w(`(`)?A():[]}},Se=()=>{let e=r.index===s.index,n=T(),a=u(n);if(t&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=k(O);return D(`:`),{kind:`Lambda`,params:e,body:N(),location:a}}if(n.kind===`Number`){if(t&&/^\\[BOH]/.test(n.text))throw S(`incomplete expression`,n);return{kind:`Number`,value:re(n.text),text:n.text,location:a}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:a};if(n.kind===`String`)return{kind:`String`,value:n.text,location:a};let o=n.kind===`Step`&&Ie(n);if(o&&Ne()<0&&F.length<=1)throw S(`Step number used outside proof`,n);if(o&&n.text[1]===`+`)throw S(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||o){let r=o?I(n)??n.text:n.text;if(le()){let e=E(`(`)?k(O):[];return e.length>0&&D(`)`),D(`::`),{kind:`Label`,name:r,params:e,body:N(),location:a}}let i=w(`(`),s=i?A():[];if(!be())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(;be();)T(),u.push(xe());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`&&Gs(n.text)&&w(`(`))return{kind:`Apply`,operator:n.text,args:A(),location:a};switch(n.text){case`(`:{let e=se(()=>N());return D(`)`),e}case`[`:return M(n);case`{`:return ge(n);case`<<`:return _e(n);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return ve(n);case`IF`:{let e=N();D(`THEN`);let t=N();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:N(),location:a}}case`CASE`:return ye(n);case`LET`:{let e=[],n=[];for(i.push(/* @__PURE__ */ new Set);!E(`IN`);){if(t&&w(`RECURSIVE`))throw S(`Unexpected keyword RECURSIVE`,b(_()));if(E(`RECURSIVE`)){Ae();continue}let r=P(!1);r.kind===`Instance`?n.push(r):e.push(r)}i.pop();let r=N();return n.length===0?{kind:`Let`,definitions:e,body:r,location:a}:{kind:`Let`,definitions:e,instances:n,body:r,location:a}}case`CHOOSE`:{let e=ue(),t=E(`\\in`)?N():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:N(),location:a}}case`WF_`:case`SF_`:{let e=fe(),t=se(()=>{D(`(`);let e=N();return D(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:a}}}throw ie(`Unexpected ${y(n)}`,n)},Ce=()=>{let e=v(),t=u(e);if(e.kind===`Operator`&&(e.text===`/\\`||e.text===`\\/`))return j();if(e.kind===`Operator`||e.kind===`Keyword`)switch(e.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[N(5)],location:t};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[N(13)],location:t};case`[]`:return T(),{kind:`Always`,expression:N(16),location:t};case`<>`:return T(),{kind:`Eventually`,expression:N(16),location:t};case`ENABLED`:return T(),{kind:`Enabled`,expression:N(16),location:t};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:N(16),location:t};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:e.text,args:[N(9)],location:t}}return Se()},N=(e=0)=>{let t=r.index,n=Ce(),i={left:n.location.range?n:g(n,t),previous:void 0};for(;;){let n=v();if(n.kind!==`Operator`)break;let r=u(n);if(n.text===`'`&&e<=15){T(),i.left=g({kind:`Prime`,expression:i.left,location:r},t);continue}if(Bs.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=se(()=>k(()=>N()));se(()=>D(`]`)),i.left=g({kind:`FunctionApplication`,function:i.left,args:e,location:r},t);continue}if(n.text===`.`&&ae(v(1))){T();let e=T().text;i.left=g({kind:`FieldAccess`,record:i.left,field:e,location:r},t);continue}let a=zs.get(n.text);if(!a||a.low<e)break;let o=i.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw S(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(T(),a.low>12&&w(`-`))throw S(`Precedence conflict between ${n.text} and -`,v());let s=N(a.high+1),c=i.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`;i.left=c.kind===e&&o?.text===n.text?{...c,operands:[...c.operands,s]}:{kind:e,operands:[c,s],location:r}}else i.left=n.text===`\\X`?c.kind===`Product`&&o?.text===`\\X`?{...c,factors:[...c.factors,s]}:{kind:`Product`,factors:[c,s],location:r}:{kind:`Apply`,operator:n.text,args:[c,s],location:r};i.left=g(i.left,t),i.previous={...a,text:n.text}}return i.left},we=()=>{if(!E(`(`))return[];let e=ke();return D(`)`),e},Te=()=>{let e=u(v()),t=N(),i=n[r.index-1],a={line:i.line,column:i.endColumn};return{body:t,bodyRange:{module:c[c.length-1].name,start:e,end:a}}},P=e=>{let t=r.index;return g(Ee(e),t)},Ee=e=>{let t=v(),n=u(t),i=(t,r)=>({kind:`Operator`,name:t,params:r,...Te(),isLocal:e,isRecursive:l(t),location:n});if(t.kind===`Identifier`&&v(1).kind===`Operator`&&zs.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`&&Bs.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=se(()=>de());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:N(),isLocal:e,isRecursive:l(s),location:n}}let c=r.index,d=we();return D(`==`),w(`INSTANCE`)?{...De(s,d,e,n),definitionRange:h(c)}:i(s,d)},De=(e,t,n,i)=>{let a=r.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:O(),substitutions:E(`WITH`)?k(()=>{let e=T().text;return D(`<-`),{name:e,expression:he()}}):[],isLocal:n,location:i,instanceRange:h(a)}},Oe=()=>{let e=u(v());if(w(`_`)&&v(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(v().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=O();if(!E(`(`))return{name:t,arity:0,location:e};let n=k(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},ke=()=>k(Oe),Ae=()=>{let e=ke();return e.forEach(e=>i[i.length-1].add(e.name)),e},je=e=>{let t={value:0,offset:e};do{let e=v(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&rc.has(e.text)&&t.value++,e.kind===`Operator`&&ic.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Me=()=>{let e=v(),t=v(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,je(1)):t.kind===`Operator`&&Bs.has(t.text)?w(`==`,2):t.kind===`Operator`&&zs.has(t.text)?v(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):w(`-.`)&&t.kind===`Identifier`&&w(`==`,2)},F=[],Ne=()=>F[F.length-1]??-1,Pe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Fe=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},Ie=e=>!e.text.endsWith(`.`)&&!$s.has(Fe(e)),I=e=>{let t=Fe(e);if($s.has(t))return;let n=Pe(e);if(n>=0)return`<${n}>${t}`;let r=Ne(),i=F[F.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Le=e=>{if(e.kind===`Keyword`)return Xs.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return F.length===0;if(e.text[1]===`+`||F.length===0)return!0;let t=Ne();return t>=0&&Pe(e)>t},Re=e=>{let t=Pe(e),n=F.length-1,r=F[n-1]??-1,i=F[n]<0;return i&&(F[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:F[n]===t},ze=e=>!a.has(e)&&c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),Be=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!ac.has(e.name)&&!ze(e.name):!1,Ve=()=>{let e=v();return e.kind===`Step`?Ie(e):e.kind===`Keyword`?ec.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Me()},He=()=>{let e=r.index;s.index=e;let t=v();return t.kind===`Operator`&&!Hs.has(t.text)&&Gs(t.text)?(r.index++,g({kind:`OperatorReference`,operator:t.text,location:u(t)},e)):E(`MODULE`)?g({kind:`ModuleFact`,name:O(),location:u(t)},e):N()},Ue=e=>o[o.length-1]?.add(e),We=e=>{o.push(/* @__PURE__ */ new Set);let t=e();return o.pop(),t},Ge=e=>o.some(t=>t.has(e))||c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),Ke=()=>{let e=r.index,t=v(),n=k(()=>{let e=v();if((e.kind!==`Identifier`||x(e))&&e.kind!==`Operator`)throw ie(`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)},qe=()=>{if(t)return k(Ke);let e=k(He),n=e.find(e=>e.kind===`Identifier`&&Ge(e.name));if(n)throw S(`DEF clause entry should describe a defined operator`,n.location);return e},Je=()=>({facts:Ve()?k(He):[],defs:E(`DEF`)||E(`DEFS`)?qe():[]}),Ye=()=>{let e=r.index,n=T(),i=n.text===`USE`&&E(`ONLY`),a=h(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:i,...Je(),keyword:a,location:u(n)},s=o.kind===`Hide`&&!t?o.facts.find(e=>!Be(e)):void 0;if(s)throw S(`The only expression allowed as a fact in a HIDE is the name of a theorem, assumption, or step`,s.location);return g(o,e)},Xe=()=>{let e=r.index,t=u(v()),n=E(`NEW`),i=v().kind===`Keyword`?tc.get(v().text):void 0;if(!n&&i===void 0)throw ie(`Expected a declaration but found ${y(v())}`);if(i!==void 0&&T(),i===`Variable`){let n=O();return Ue(n),g({kind:`NewSymbol`,name:n,arity:0,level:i,set:void 0,location:t},e)}let a=Oe();Ue(a.name);let o=(i??`Constant`)===`Constant`&&w(`\\in`);if(o&&a.arity>0)throw S(`declared symbol with arguments before \\in`);return o&&T(),g({kind:`NewSymbol`,name:a.name,arity:a.arity,level:i??`Constant`,set:o?N():void 0,location:t},e)},Ze=()=>{let e=r.index,t=u(D(`ASSUME`)),n=k(()=>w(`ASSUME`)?We(Ze):v().kind===`Keyword`&&nc.has(v().text)?Xe():N());return D(`PROVE`),g({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)},Qe=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)},$e=(e,t)=>{e.forEach(Ue),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(Ue))},et=()=>{let e=v();if(w(`USE`)||w(`HIDE`))return Ye();if(w(`INSTANCE`))return g(De(void 0,[],!1,u(e)),r.index);if(w(`DEFINE`)||Me()){let t=r.index;E(`DEFINE`);let n=[P(!1)];for(;Me();)n.push(P(!1));let i={kind:`Define`,definitions:n,location:u(e)};return g(i,t)}if(E(`HAVE`))return{kind:`Have`,expression:N()};if(E(`TAKE`)){let e=ce(),t=e?[]:k(O),n=e?de():[];return $e(t,n),{kind:`Take`,names:t,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:k(()=>N())};if(E(`PICK`)){let e=Qe(`:`),t=e?k(O):[],n=e?[]:de();return $e(t,n),D(`:`),{kind:`Pick`,names:t,bounds:n,body:N()}}return E(`CASE`)?{kind:`Case`,expression:N()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?Ze():N()}},tt=e=>{let t=v();if(t.kind!==`Step`)throw ie(`Expected a step number but found ${y(t)}`,t);if(!Re(t))throw S(`${e?`QED step`:`step`}'s number has bad level`,t);if(Pe(t)<0&&I(t)!==void 0)throw S(`<*> and <+> cannot be used for a named step`,t);return r.index++,{name:I(t),token:t.text,location:u(t)}},nt=()=>{let e=r.index,t=tt(w(`QED`,1)),n=/* @__PURE__ */ new Set;o.push(n);let i=E(`QED`)?{kind:`Qed`}:et(),a=h(e),s=Le(v());if(s&&!Zs.has(i.kind))throw S(`Proof of a step that does not take a proof`);let c=s?it():void 0;return o.pop(),(i.kind!==`Assert`||i.isSuffices)&&n.forEach(Ue),g({...t,body:i,head:a,proof:c},e)},rt=()=>{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`),...Je(),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=[nt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(nt());return{kind:`Steps`,level:Ne(),steps:n,location:e}},it=()=>{let e=r.index;F.push(-1);let t=We(rt);return F.pop(),g(t,e)},at=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=We(()=>({statement:w(`ASSUME`)?Ze():N(),proof:Le(v())?it():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))},ot=()=>{let e=r.index;return g(st(),e)},st=()=>{let e=T(),t=u(e),n=e.text===`AXIOM`;if(v().kind===`Identifier`&&w(`==`,1)){let e=O();return a.add(e),T(),{name:e,expression:N(),isAxiom:n,location:t}}return{name:void 0,expression:N(),isAxiom:n,location:t}},ct=()=>{let e=u(D(`----`));D(`MODULE`);let t=O();D(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(c.push(n),i.push(/* @__PURE__ */ new Set),E(`EXTENDS`)&&k(()=>{let e=r.index;n.extends.push(O()),n.extendsRanges.push(h(e))});;){let a=r.index;ee.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=ct();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(o.text){case`CONSTANT`:case`CONSTANTS`:{T();let e=ke();n.constants.push(...e),n.units.push({kind:`Constants`,declarations:e});continue}case`VARIABLE`:case`VARIABLES`:{T();let e=k(()=>{let e=r.index,t=u(v());return g({name:O(),arity:0,location:t},e)});n.variables.push(...e),n.units.push({kind:`Variables`,declarations:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=ot();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&n.definitions.push({kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{let e=Ye();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:Ae()});continue;case`INSTANCE`:lt(n,g(De(void 0,[],!1,u(o)),a));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){lt(n,g(De(void 0,[],!0,u(o)),a));continue}lt(n,P(!0));continue}o.kind===`Keyword`&&Ys.has(o.text)?at(n):lt(n,P(!1))}}},lt=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))};return ct()},lc=e=>cc(e,!1),uc=e=>cc(e,!0),dc=25214903917n,fc=(1n<<48n)-1n,pc=2147483647,mc=e=>{let t={value:(BigInt.asUintN(64,e)^dc)&fc},n=e=>(t.value=t.value*dc+11n&fc,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^dc)&fc},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}},hc=10454148508367108822n,gc=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:hc);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),_c=Int32Array.from(gc,e=>Number(BigInt.asIntN(32,e>>32n))),vc=Int32Array.from(gc,e=>Number(BigInt.asIntN(32,e))),yc=Number(BigInt.asIntN(32,hc>>32n)),bc=Number(BigInt.asIntN(32,hc));let xc=yc,Sc=bc;const Cc=e=>{let t=(e^Sc)&255;Sc=(Sc>>>8|xc<<24)^vc[t],xc=xc>>>8^_c[t]},wc=e=>{for(let t=0;t<32;t+=8)Cc(e>>>t)},Tc=e=>{if(typeof e==`boolean`)Cc(0),Cc(e?116:102);else if(typeof e==`number`)Cc(1),wc(e);else if(typeof e==`string`){Cc(3),wc(e.length);for(let t=0;t<e.length;t++)Cc(e.charCodeAt(t))}else if(M(e))Cc(21),wc(je(e.name)+1);else if(j(e)){let t=H(e);Cc(9),wc(t.domain.length);for(let e=0;e<t.domain.length;e++)Tc(t.domain[e]),Tc(t.range[e])}else{let t=z(e).elements;Cc(5),wc(t.length);for(let e of t)Tc(e)}},Ec=e=>{let t={high:xc,low:Sc};xc=yc,Sc=bc;for(let t of e)Tc(t);let n=BigInt(xc>>>0)<<32n|BigInt(Sc>>>0);return xc=t.high,Sc=t.low,n},Dc=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||M(e))return 5;if(typeof e==`string`)return 5+e.length;if(j(e)){let t=H(e);return t.domain.reduce((e,n,r)=>e+Dc(n)+Dc(t.range[r]),5)}return z(e).elements.reduce((e,t)=>e+Dc(t),5)},Oc=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){xc=n<32?0:1<<n-32,Sc=n<32?1<<n:0;for(let t=0;t<e;t++)Cc(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]^xc,t[n+1]=t[a+1]^Sc}}return t},kc=()=>{let e=/* @__PURE__ */ new Map,t=/* @__PURE__ */ new Map,n=[],r=e=>{let r=t.get(e);if(r!==void 0)return r;let i=Dc(e);return xc=0,Sc=0,Tc(e),t.set(e,n.length),n.push(i,xc,Sc),n.length-3},i=t=>{let n=e.get(t);if(n)return n;let r=Oc(t);return e.set(t,r),r};return e=>{let t={high:xc,low:Sc},a={high:yc,low:bc};for(let t of e){let e=r(t),o=i(n[e]),s={high:n[e+1],low:n[e+2]};for(let e=0;e<8;e++){let t=e<4?a.low:a.high,n=(e*256+(t>>>(e&3)*8&255))*2;s.high^=o[n],s.low^=o[n+1]}a.high=s.high,a.low=s.low}return xc=t.high,Sc=t.low,BigInt(a.high>>>0)<<32n|BigInt(a.low>>>0)}},Ac=[],jc=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Mc=()=>{for(let e=1277011;Ac.length<1341;e++)jc(e)&&Ac.push(e);return Ac},Nc=e=>{let t=Mc(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Pc=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},Fc=e=>{for(let t=Math.max(e,9);;t++){let e=Pc(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)}}},Ic=(e,t,n)=>{if(t<=0)return[];let r=Fc(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Nc(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Lc=(1n<<63n)-1n-24n,Rc=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Lc*BigInt(n)+i)%t;return r<0n?r+t:r})},zc=(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,Bc=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=At(e.domain),n=z(e.range).elements;return{lists:t.map(()=>n),create:e=>Be(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>z(e).elements),create:t=>Mt(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>z(e).elements),create:L}}},Vc=(e,t,n)=>{if(B(t))return[];if(typeof t==`object`&&t.kind===`Interval`)return Ic(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let r=Bc(t);if(r){let t=r.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(pc)?Rc(e,t,n):Ic(e,Number(t),n)).map(e=>r.create(zc(r.lists,e)))}let i=z(t).elements;return Ic(e,i.length,n).map(e=>i[Number(e)])},Hc=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new m(`RandomElement of the empty set`);return n},Uc=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...At(e.domain)];return Be(n,n.map(()=>Uc(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Mt(e.names.map((n,r)=>[n,Uc(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return L(e.factors.map(e=>Uc(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 m(`RandomElement of the empty set`);return e.low+r}return Hc(z(e).elements,t)},Wc=(e,t=0n)=>{let n=mc(t),r={random:mc(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Mt([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Ec,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,checkDeadlock:e,startedAt:Date.now()};return a},Gc=e=>St([...e.possibleCounts].map(([e,t])=>[e,t])),Kc=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Gc(e)]]),qc=(e,t,n)=>new h(`Applying ${e} to the following value,\nwhich is not ${t}:\n${U(n)}`),Jc=(e,t,n,r)=>new h(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${U(r)}`),Yc=e=>j(e)?H(e):void 0,Xc=(e,t,n)=>{let r=W(e,t,n),i=Yc(r);if(!i)throw qc(n,`a function with a finite domain`,r);return i},Zc=(e,t,n)=>{let r=W(e,t,n),i=Yc(r);if(!i)throw Jc(t===0?`first`:`second`,n,`bag`,r);return i},Qc=(e,t)=>{if(!A(e)||!R(e))throw t();return z(e).elements},$c=e=>e.range.every(e=>typeof e==`number`&&e>0),el=(e,t)=>{let n=e.domain.findIndex(e=>Ve(e,t));return n===-1?void 0:e.range[n]},tl=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,nl=tl(`BagDiff`,`tlc2.value.impl.Value`,2),rl=tl(`SqSubseteq`,`tlc2.value.IBoolValue`,2),il=tl(`BagUnion`,`tlc2.value.impl.Value`,1),al=tl(`BagOfAll`,`tlc2.value.impl.Value`,2),ol=tl(`BagCup`,`tlc2.value.impl.Value`,2),sl=tl(`BagCardinality`,`tlc2.value.impl.IntValue`,1),cl=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${nr(e)}`;throw ir(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')`)},ll=(e,t,n)=>{let r=cl(e,n)+cl(t,n);if(Zn(r))throw Qn(`${e}+${t}`);return r},ul=(e,t,n,r)=>{let i=el(n,e.domain[t]),a=cl(e.range[t],r);return i===void 0?a:a-cl(i,r)|0},dl=(e,t)=>St(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Ve(e[0],r));a?a[1]=ll(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),fl=Be([],[]),pl=[qn(`EmptyBag`,fl),G(`IsABag`,1,e=>{let t=Yc(W(e,0,`IsABag`));return t!==void 0&&$c(t)}),G(`BagCardinality`,1,e=>{let t=W(e,0,`BagCardinality`);return Xc(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw qc(`BagCardinality`,`a bag`,t);return ll(e,n,sl)},0)}),G(`BagIn`,2,e=>{let t=W(e,1,`BagIn`),n=el(Xc(e,1,`BagIn`),W(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Jc(`second`,`BagIn`,`bag`,t);return n>0}),G(`CopiesIn`,2,e=>{let t=W(e,1,`CopiesIn`),n=el(Xc(e,1,`CopiesIn`),W(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Jc(`second`,`CopiesIn`,`bag`,t);return n}),G(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Zc(e,t,`(+)`);if(!$c(n))throw Jc(t===0?`first`:`second`,`(+)`,`bag`,W(e,t,`(+)`));return n});return dl(t,ol)}),G(`\\ominus`,2,e=>{let t=Zc(e,0,`(-)`),n=Zc(e,1,`(-)`);return St(t.domain.flatMap((e,r)=>{let i=ul(t,r,n,nl);return i>0?[[e,i]]:[]}))}),G(`BagUnion`,1,e=>{let t=W(e,0,`BagUnion`),n=Qc(t,()=>qc(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??fl;let r=n.map(e=>{let n=Yc(e);if(!n)throw new h(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${U(t)}`);return n});return dl(r,il)}),G(`\\sqsubseteq`,2,e=>{let t=Xc(e,0,`\\sqsubseteq`),n=Xc(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>ul(t,r,n,rl)<=0)}),Jn(`BagOfAll`,2,e=>{let t=Kn(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new h(`The first argument of BagOfAll should be an operator, but instead it is:\n${U(t.literalBody)}`);let n=W(e,1,`BagOfAll`),r=Yc(n);if(!r)throw Jc(`second`,`BagOfAll`,`function with a finite domain`,n);return dl(r.domain.map((e,n)=>Be([t.call([e])],[r.range[n]])),al)}),G(`SubBag`,1,e=>{let t=W(e,0,`SubBag`);if(!j(t))throw new m(`DOMAIN expects a function but received ${U(t)}`);let n=H(t),r=gt(n.range).elements,i=r.find(e=>typeof e!=`number`);if(i!==void 0){let e=typeof r[0]!=`number`;throw new m(`The ${e?`first`:`second`} argument of >= should be an integer, but instead it is:\n${U(e?r[0]:i)}`)}let a=n.range.filter(e=>typeof e==`number`);if(a.some(e=>e<1))throw new m(`Attempted to apply a function to ${U(n)}, which is not in its domain`);return gt(n.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:a[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Be(e.map(e=>e[0]),e.map(e=>e[1]))))}),G(`BagToSet`,1,e=>sn(Xc(e,0,`BagToSet`))),G(`SetToBag`,1,e=>{let t=W(e,0,`SetToBag`),n=Qc(t,()=>qc(`BagToSet`,`a function with a finite domain`,t));return Be([...n],n.map(()=>1))})],ml=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,hl=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,gl=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,_l=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,vl=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,yl=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,bl=e=>{if(!j(e))return!1;let t=H(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},xl=(e,t)=>ir(e,`Cannot convert value: unsupported value type tlc2.value.impl.${nr(t)}`),Sl=(e,t)=>ir(e,`Cannot cast tlc2.value.impl.${nr(t)} to tlc2.value.impl.StringValue`),Cl=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),wl=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw xl(t,e);return`[${z(e).elements.map(e=>El(e,t)).join(`,`)}]`},Tl=(e,t)=>{let n=H(e),r=Xt(n);return r?`[${r.map(e=>El(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Cl(typeof e==`string`?e:U(e))}:${El(n.range[r],t)}`).join(`,`)}}`},El=(e,t)=>typeof e==`string`?Cl(e):typeof e==`object`?e.kind===`ModelValue`?Cl(e.name):A(e)?wl(e,t):Tl(e,t):String(e),Dl=e=>{if(A(e))return wl(e,ml);if(!j(e)||bl(e))throw xl(ml,e);return Tl(e,ml)},Ol=e=>{if(!j(e))throw xl(hl,e);return Tl(e,hl)},kl=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))},Al=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return ke(e);if(Array.isArray(e))return L(e.map(e=>Al(e,t)));if(typeof e==`object`&&e)return Mt(Object.entries(e).map(([e,n])=>[ke(e),Al(n,t)]));throw ir(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},jl=(e,t)=>{if(e.trim()===``)return Al(null,t);try{return Al(JSON.parse(e,(e,t,n)=>typeof t==`number`?kl(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?ir(t,e.message):e}},Ml=(e,t)=>{if(typeof e!=`string`)throw Sl(t,e);return e},Nl=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw ir(n,`${t} (No such file or directory)`);return r},Pl=e=>[Yn(`ToJson`,1,e=>ke(El(W(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Yn(`ToJsonArray`,1,e=>ke(Dl(W(e,0,`ToJsonArray`)))),Yn(`ToJsonObject`,1,e=>ke(Ol(W(e,0,`ToJsonObject`)))),Yn(`JsonSerialize`,2,t=>{let n=Ml(W(t,0,`JsonSerialize`),gl),r=W(t,1,`JsonSerialize`);if(!Xt(r)&&!bl(r))throw new h(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${U(r)}`);return e.writeFile?.(n,El(r,gl)),!0}),Yn(`ndJsonSerialize`,2,t=>{let n=Ml(W(t,0,`ndJsonSerialize`),_l),r=W(t,1,`ndJsonSerialize`),i=Xt(r);if(!i)throw new h(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${U(r)}`);return e.writeFile?.(n,i.map(e=>`${El(e,_l)}\n`).join(``)),!0}),Yn(`JsonDeserialize`,1,t=>{let n=Ml(W(t,0,`JsonDeserialize`),vl);return jl(Nl(e,n,vl),vl)}),Yn(`ndJsonDeserialize`,1,t=>{let n=Ml(W(t,0,`ndJsonDeserialize`),yl);return L(Nl(e,n,yl).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>jl(e,yl)))})],Fl=(e,t,n,r)=>new h(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),Il=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Fl(t,n,`nonnegative integer`,U(e));return e},Ll=(e,t,n,r)=>{if(!A(e)||!R(e))throw Fl(t,n,r,U(e));return z(e).elements},Rl=(e,t,n,r)=>gt(Array.from({length:t},()=>gt(e.filter(()=>r.nextDouble()<n)))),zl=(e,t)=>{let n=`RandomSetOfSubsets`,r=Il(W(e,0,n),`first`,n),i=Il(W(e,1,n),`second`,n),a=Ll(W(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw Fl(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw Fl(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Rl(a,r,a.length===0?0:i/a.length,t.getRandom())},Bl=e=>[Yn(`RandomSubset`,2,t=>{let n=W(t,0,`RandomSubset`);if(typeof n!=`number`)throw Fl(`first`,`RandomSubset`,`nonnegative integer`,U(n));if(n<0)throw new m(`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=W(t,1,`RandomSubset`);if(!A(r)||!B(r)&&!R(r))throw Fl(`second`,`RandomSubset`,`a finite set`,U(r));return gt(Vc(n,r,e.getRandom()))}),Yn(`RandomSetOfSubsets`,3,t=>zl(t,e)),Yn(`TestRandomSetOfSubsets`,3,t=>L(Array.from({length:5},()=>z(zl(t,e)).elements.length)))],Vl=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Hl=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Vl})`,Ul=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Vl}) throws java.io.IOException`,Wl=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Vl})`,Gl=()=>Mt([[`action`,gt([])],[`state`,gt([])]]),Kl=()=>Mt([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),ql=e=>Mt([[`name`,e??`UnnamedAction`],[`location`,Kl()]]),Jl=(e,t)=>{let n=e.map((e,t)=>L([t+1,Mt(Object.entries(e.state))])),r=n.slice(1).map((t,r)=>L([n[r],ql(e[r+1].action),t])),i=t?[L([n[n.length-1],ql(t.action),n[t.start]])]:[];return Mt([[`action`,gt([...r,...i])],[`state`,gt(n)]])},Yl=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Kc(e).get(t)},Xl=(e,t,n)=>{if(typeof t==`number`&&t>=0)e.registers.set(t,n);else if(typeof t==`string`&&t.startsWith(`s:`))e.namedRegisters.set(t,n);else throw new h(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${U(t)}`)},Zl=e=>e.every(e=>e!==void 0),Ql=(e,t)=>Mt(t.variables.map((t,n)=>[t,e[n]])),$l=(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&&!J(e)){if(t.variableIndex.has(r))return!0;let e=Za(r,t);if(e&&!n.has(e)&&(n.add(e),$l(e.body,t,n)))return!0}return Xa(e).some(e=>$l(e,t,n))},eu=(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[G(`AssertEq`,2,t=>{let n=W(t,0,`AssertEq`),r=W(t,1,`AssertEq`),i=Ve(n,r);return i||(e(U(`Assertion failed`,!0)),e(U(n,!0)),e(U(r,!0))),i}),dr(`AssertError`,2,e=>{let t=Kn(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw ir(Hl,`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=fr(e,0,`AssertError`)();try{fr(e,1,`AssertError`)()}catch(e){if(e instanceof m)return e.message===n;throw e}return!1}),Yn(`TLCGetOrDefault`,2,e=>{let n=W(e,0,`TLCGetOrDefault`);return Yl(t,n)??W(e,1,`TLCGetOrDefault`)}),{...Jn(`TLCGetAndSet`,4,e=>{let n=W(e,0,`TLCGetAndSet`),r=Yl(t,n)??W(e,3,`TLCGetAndSet`),i=Kn(e,1,`TLCGetAndSet`);return Xl(t,n,i.call([r,W(e,2,`TLCGetAndSet`)])),r}),isStateLevel:!0},Yn(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!Zl(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw ir(Ul,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return L(t.getBehavior(r).map(e=>Ql(e,n.environment)))}),Yn(`CounterExample`,0,()=>t.counterExample??Gl()),G(`ToTrace`,1,e=>{let t=W(e,0,`ToTrace`);if(!j(t)||!Ve(sn(t),gt([`action`,`state`])))throw new m(`The argument of ToTrace should be a CounterExample, but instead it is:\n${U(t)}`);let n=z(an(t,`state`)).elements.map(e=>Xt(e)??[]);return L(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),G(`TLCModelValue`,1,e=>{let t=W(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new h(`The argument of ModelValue should be a string, but instead it is:\n${U(t)}`);return Re(t)}),dr(`TLCDefer`,1,()=>!0),G(`TLCNoOp`,1,e=>W(e,0,`TLCNoOp`)),dr(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!Zl(r))throw ir(Wl,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||Ya(fr(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new v(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),dr(`TLCCache`,2,(e,t)=>{let r=Kn(e,0,`TLCCache`),a=Tn(fr(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=$l(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}),G(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Ec([W(e,0,`TLCFP`)])))),Yn(`TLCEvalDefinition`,1,(e,t)=>{let n=W(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?Za(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new h(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${U(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new h(`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)})]},tu=(e,t)=>[Yn(`_Track`,2,e=>{let n=String(W(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,W(e,0,`_Track`)===!0?r+1:r),!0}),Yn(`_Counts`,0,()=>Gc(t)),Yn(`_CheckName`,1,n=>{let r=String(W(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(U(Gc(t),!0)),!1)}),Yn(`_PrintCounts`,0,()=>(e(U(Gc(t),!0)),!0))],nu=e=>String(e).padStart(2,`0`),ru=e=>`${e.getUTCFullYear()}.${nu(e.getUTCMonth()+1)}.${nu(e.getUTCDate())}.${nu(e.getUTCHours())}${nu(e.getUTCMinutes())}${nu(e.getUTCSeconds())}`,iu=e=>St([...e].map(([e,t])=>[e,L([t])])),au=(e,t,n)=>{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 Mt([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Mt([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Mt([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,ke(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,ke(ru(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return ql(void 0);case`all`:return iu(e.registers);case`all:named`:return iu(Kc(e))}if(t.startsWith(`s:`)){let n=Kc(e).get(t);if(n===void 0)throw new h(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return ke(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])),su=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&z(e).elements.forEach(su),e.kind===`Function`&&e.range.forEach(su))},cu=(t,n)=>[G(`Print`,2,e=>(t(`${he(U(W(e,0,`Print`),!0,!0))} ${he(U(W(e,1,`Print`),!0,!0))}`),W(e,1,`Print`))),G(`PrintT`,1,e=>(t(he(U(W(e,0,`PrintT`),!0,!0))),!0)),G(`Assert`,2,t=>{if(W(t,0,`Assert`)!==!0)throw new h(`The first argument of Assert evaluated to FALSE; the second argument was:\n${he(U(W(t,1,`Assert`)))}`,e.assertViolation);return!0}),G(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),G(`:>`,2,e=>St([[W(e,0,`:>`),W(e,1,`:>`)]])),G(`@@`,2,e=>{let t=Gn(e,0,`@@`),n=Gn(e,1,`@@`);return Ct([...be(t),...be(n)])}),G(`ToString`,1,e=>ke(U(W(e,0,`ToString`),!0))),G(`TLCEval`,1,e=>{let t=W(e,0,`TLCEval`);return su(t),t}),G(`Permutations`,1,e=>{let t=Un(e,0,`Permutations`);return gt(ou(t).map(e=>St(t.map((t,n)=>[t,e[n]]))))}),Jn(`SortSeq`,2,e=>{let t=Kn(e,1,`SortSeq`);return L(Wn(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)]},[]))}),Yn(`TLCGet`,1,(e,t)=>{let r=W(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${U(r)}`);return au(n,r,t?.state)}),Yn(`TLCSet`,2,e=>{let r=W(e,0,`TLCSet`),i=W(e,1,`TLCSet`);if(typeof r==`number`&&r>=0)return n.registers.set(r,i),!0;if(r===`exit`)return i===!0&&(n.isStopped=!0),!0;if(r===`pause`)return i===!0&&(t(`Press enter to resume model checking.`),n.pause()),!0;if(typeof r==`string`&&r.startsWith(`s:`))return n.namedRegisters.set(r,i),!0;if(typeof r==`string`&&r.startsWith(`-D`))return n.properties.set(r.slice(2),U(i)),!0;throw new h(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${U(r)}`)}),qn(`Any`,Fe),G(`RandomElement`,1,e=>Uc(Vn(e,0,`RandomElement`),n.getRandom()))],lu=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),uu=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],du=/* @__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(`,`),fu=/* @__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(`.`),pu=/* @__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(`.`),mu=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
101
|
+
=============================================================================`]]),Hc=`tlc2/value/impl/`,Uc=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)}},Wc=e=>[...e.slice(1,e.indexOf(`)`)).matchAll(/\[*(?:L[^;]*;|[BCDFIJSZ])/g)].length,Gc=e=>{let t=Uc(e);if(t.readUint32()!==3405691582)throw new p(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===1?a.text=i.decode(t.readBytes(t.readUint16())):r===3?a.value=t.readInt32():r===4?t.readUint32():r===5||r===6?(t.readBytes(8),e++):r===7||r===8||r===16||r===19||r===20?a.first=t.readUint16():r===15?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16(),t.readUint16(),t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let a=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,o={name:r,arity:Wc(i),code:void 0};for(let e=t.readUint16();e>0;e--){let e=n[t.readUint16()].text,r=t.readBytes(t.readUint32());if(e===`Code`){let e=new DataView(r.buffer,r.byteOffset+4,4).getUint32(0);o.code=r.subarray(8,8+e)}}e&1&&e&8&&a.push(o)}return{pool:n,methods:a}},Kc=(e,t)=>e[e[t].first].text,qc=(e,t)=>{let n=e[t],r=e[n.second];return{className:Kc(e,n.first),name:e[r.first].text}},Jc=(e,t,n,r)=>{let i=()=>new T(`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=qc(t,l());if(n.className!==`${Hc}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=qc(t,l()),a=s();if(n.className!==`${Hc}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:Kc(t,l()),value:void 0}),e+=3;else if(n===183){let n=qc(t,l()),a=s(),o=s();if(!(n.className===`${Hc}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()},Yc=(e,t)=>{if(!t)return e;let n=Gc(t),r=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let r=n.methods.find(e=>e.name===t.name&&e.arity===t.params.length);return r?{...t,body:Jc(r,n.pool,e.name,t.location)}:t});return{...e,definitions:r}},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),Xc=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)]]),Zc=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Qc=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),$c=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),el=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),tl=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...Zc]),nl=e=>Xc.has(e)||Zc.has(e)||e===`-.`,rl=(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}}},il=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),al=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),ol=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),sl=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),cl=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),ll=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),ul=/* @__PURE__ */ new Set([``,`*`,`-`]),dl=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),fl=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),pl=/* @__PURE__ */ new Set([`NEW`,...fl.keys()]),ml=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),hl=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),gl=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),_l=e=>RegExp(`^-{4,}\\s*MODULE\\s+${e}\\s*-{3,}$`),vl=(e,t)=>{let n=e.split(/\r?\n/),r=n.findIndex(e=>_l(t).test(e));if(r===-1)return;let i=n.findIndex((e,t)=>t>r&&e.startsWith(`====`));return n.slice(r,i===-1?void 0:i+1).join(`
|
|
102
|
+
`)},yl=(e,t)=>{let n=de(e),r={index:0,offsideColumns:[]},i=[],a=/* @__PURE__ */ new Set,o=[],s={index:-1},c=[],l=e=>i[i.length-1].has(e),u=e=>({line:e.line,column:t&&e.kind===`String`?e.endColumn:e.column,range:void 0}),d=[],f=[],h=[],_=(e,t=r.index-1)=>{let i=e===t?h[e]:void 0;if(i)return i;let a=n[t];d[e]??=u(n[e]),f[t]??={line:a.line,column:a.endColumn};let o={module:c[c.length-1].name,start:d[e],end:f[t]};return e===t&&(h[e]=o),o},v=(e,t)=>(e.location.range=_(t),e),y=(e=0)=>n[Math.min(r.index+e,n.length-1)],b=(e=0)=>{let t=y(e),n=r.offsideColumns[r.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ee=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),x={index:0},S=e=>{let t=n.slice(x.index,r.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},C=e=>t&&(e.kind===`Keyword`||gl.has(e.text)),w=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},T=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:ll.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):C(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,te=(e,t=y(),r)=>{let i=n[n.length-1],a=t.line===i.line&&t.column===i.column;return new p(`${e} at line ${t.line}, column ${t.column}`,void 0,ne(e,t,a,r))},ne=(e,r,i,a)=>{if(t&&i){let e=n[n.length-1];return{reason:`Unexpected EOF`,...S(w(e)),isEnd:i}}return t&&a?{reason:`Unexpected ${T(a)}`,...w(a),isEnd:i}:{reason:e,line:r.line,column:r.column,isEnd:i}},E=(e,t=y())=>te(e,t,t),re=e=>(e.kind===`Identifier`||e.kind===`Keyword`)&&!C(e),D=(e,t=0)=>{let n=b(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},O=()=>{let e=b();if(e.kind===`End`)throw te(`Unexpected end of expression`);return r.index++,e},k=e=>D(e)?(r.index++,!0):!1,A=e=>{if(!D(e))throw E(`Expected ${JSON.stringify(e)} but found ${ee(b())}`);return O()},j=()=>{let e=b();if(e.kind!==`Identifier`)throw E(`Expected an identifier but found ${ee(e)}`);if(C(e))throw E(`Unexpected keyword ${e.text}`);return r.index++,e.text},ae=e=>{r.offsideColumns.push(-1);let t=e();return r.offsideColumns.pop(),t},oe=(e,t=`,`)=>{let n=[e()];for(;k(t);)n.push(e());return n},se=()=>{if(D(`<<`)){let e={value:1};for(;b(e.value).kind===`Identifier`||D(`,`,e.value);)e.value++;return D(`>>`,e.value)&&D(`\\in`,e.value+1)}let e={value:0};for(;b(e.value).kind===`Identifier`;){if(D(`\\in`,e.value+1))return!0;if(!D(`,`,e.value+1))return!1;e.value+=2}return!1},ce=()=>{if(D(`::`))return!0;if(!D(`(`))return!1;let e={value:1};for(;b(e.value).kind===`Identifier`&&D(`,`,e.value+1);)e.value+=2;return b(e.value).kind===`Identifier`&&D(`)`,e.value+1)&&D(`::`,e.value+2)},le=()=>{if(!k(`<<`))return{kind:`Name`,name:j()};let e=oe(j);return A(`>>`),{kind:`Tuple`,names:e}},ue=()=>oe(()=>{let e=oe(le);A(`\\in`);let t=N();return e.map(e=>({pattern:e,set:t}))}).flat(),fe=()=>{let e=b();if(e.kind===`Identifier`){let t=r.index,n=[O().text];for(;D(`!`)&&b(1).kind===`Identifier`;)O(),n.push(j());return v({kind:`Identifier`,name:n.join(`!`),location:u(e)},t)}if(D(`<<`)||D(`(`))return Ee();throw E(`Expected a subscript but found ${ee(e)}`)},pe=e=>{let t=b(1),n=b(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&D(`==`,Zc.has(n.text)?3:4))},M=e=>{if(!$c.has(e.text))return!0;let t=b(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||D(`,`,1)||D(`)`,1)||t.kind===`Keyword`&&al.has(t.text)||pe(e)},me=()=>{let e=b(),n=e.kind===`Operator`&&(Xc.has(e.text)||Qc.has(e.text))&&M(e);if(t&&e.kind!==`String`&&(Qc.has(e.text)||tl.has(e.text)&&e.text!==`'`&&!Zc.has(e.text)||el.has(e.text)&&b(-1).text===`(`&&b(-1).line===e.line&&b(-1).endColumn+1===e.column&&b(1).text===`)`&&b(1).line===e.line&&b(1).column===e.endColumn+1)&&M(e))throw te(`incomplete expression`,e);if(n)return r.index++,v({kind:`OperatorReference`,operator:e.text,location:u(e)},r.index-1);if(e.kind!==`String`&&tl.has(e.text)&&M(e)){r.index++;let t=u(e);if(Zc.has(e.text))return{kind:`OperatorReference`,operator:e.text,location:t};let n={kind:`Identifier`,name:`argument`,location:t};return{kind:`Lambda`,params:[n.name],body:rl(e.text,n,t),location:t}}if(D(`LAMBDA`)){let t=r.index;O();let n=oe(j);A(`:`);let i=N();return v({kind:`Lambda`,params:n,body:i,location:u(e)},t)}let i=N();return i.kind===`Identifier`&&he.delete(i),i},he=/* @__PURE__ */ new Map,ge={range:void 0},_e=()=>ae(()=>{let e=r.index;A(`(`);let t=oe(me);return A(`)`),ge.range=_(e),t}),ve=()=>{let e=O();r.offsideColumns.push(e.column);let t=[N()];for(;y().text===e.text&&y().column===e.column;)r.index++,t.push(N());return r.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:u(e)}},ye=e=>ae(()=>{let t=u(e);if(b().kind===`Identifier`&&(D(`|->`,1)||D(`:`,1))){let e=D(`|->`,1)?`Record`:`RecordSet`,n=oe(()=>{let t=r.index,n=u(b()),i=j();return n.range=_(t),A(e===`Record`?`|->`:`:`),{name:i,value:N(),location:n}});return A(`]`),{kind:e,fields:n,location:t}}if(se()){let e=ue();A(`|->`);let n=N();return A(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let n=N();if(k(`->`)){let e=N();return A(`]`),{kind:`FunctionSet`,domain:n,range:e,location:t}}if(k(`EXCEPT`)){let e=oe(()=>{A(`!`);let e=[];for(;D(`.`)||D(`[`);)if(k(`.`)){if(!re(b()))throw E(`Expected a field name but found ${ee(b())}`);e.push({kind:`Field`,name:O().text})}else A(`[`),e.push({kind:`Index`,args:oe(()=>N())}),A(`]`);return A(`=`),{path:e,value:N()}});return A(`]`),{kind:`Except`,function:n,updates:e,location:t}}return A(`]_`),{kind:`BoxAction`,action:n,subscript:fe(),location:t}}),be=e=>ae(()=>{let t=u(e);if(k(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(se()&&(b(1).text===`\\in`||D(`<<`))){let e=r.index,n=le();A(`\\in`);let i=N();if(k(`:`)){let e=N();return A(`}`),{kind:`SetFilter`,bound:{pattern:n,set:i},predicate:e,location:t}}r.index=e}let n=N();if(k(`:`)){let e=ue();return A(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let i=[n];for(;k(`,`);)i.push(N());return A(`}`),{kind:`SetEnumeration`,elements:i,location:t}}),xe=e=>{let t=u(e),n=ae(()=>D(`>>`)||D(`>>_`)?[]:oe(()=>N()));if(k(`>>_`)){if(n.length!==1)throw te(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:fe(),location:t}}return A(`>>`),{kind:`Tuple`,elements:n,location:t}},Se=e=>{let t=u(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&se()){let e=ue();return A(`:`),{kind:n,bounds:e,body:N(),location:t}}let i=oe(j);return A(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i,body:N(),isTemporal:r,location:t}},Ce=e=>{let t=[];do{if(k(`OTHER`))return A(`->`),{kind:`Case`,arms:t,other:N(),location:u(e)};let n=N();A(`->`),t.push({condition:n,body:N()})}while(k(`[]`));return{kind:`Case`,arms:t,other:void 0,location:u(e)}},we=()=>{let e=b(1);return D(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||il.has(e.text)||e.kind===`Operator`&&(Xc.has(e.text)||Zc.has(e.text)||Qc.has(e.text)))},Te=()=>{let e=O();if(e.kind===`Number`)return{kind:`Operand`,operand:ie(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return r.index--,{kind:`Bound`,args:_e()}}return{kind:`Name`,name:e.text,args:D(`(`)?_e():[]}},Ee=()=>{let e=r.index,n=e===s.index,a=O(),o=u(a);if(t&&a.kind===`Keyword`&&a.text===`LAMBDA`){let e=oe(j);return A(`:`),{kind:`Lambda`,params:e,body:N(),location:o}}if(a.kind===`Number`){if(t&&/^\\[BOH]/.test(a.text))throw te(`incomplete expression`,a);return{kind:`Number`,value:ie(a.text),text:a.text,location:o}}if(a.kind===`Decimal`)return{kind:`Decimal`,text:a.text,location:o};if(a.kind===`String`)return{kind:`String`,value:a.text,location:o};let l=a.kind===`Step`&&Re(a);if(l&&Le()<0&&Ie.length<=1)throw te(`Step number used outside proof`,a);if(l&&a.text[1]===`+`)throw te(`<+> step number used in an expression`,a);if(a.kind===`Identifier`||l){let i=l?R(a)??a.text:a.text;if(ce()){let e=k(`(`)?oe(j):[];return e.length>0&&A(`)`),A(`::`),{kind:`Label`,name:i,params:e,body:N(),location:o}}let s=D(`(`),u=s?_e():[];if(!we())return s?{kind:`Apply`,operator:i,args:u,argumentsRange:ge.range,location:o}:{kind:`Identifier`,name:i,location:o};let d=c.flatMap(e=>e.instances).find(e=>e.name===i),f=d!==void 0&&!n&&!t&&d.params.length!==u.length;if(f&&u.length>0)throw te(`The operator ${i} requires ${d.params.length} arguments`,a);let p=[{kind:`Name`,name:i,args:u}],m=[_(e,e)];for(;we();)O(),m.push(_(r.index,r.index)),p.push(Te());let h=p.flatMap(e=>e.kind===`Name`?[e.name]:[]),v=h.join(`!`),y=p.flatMap(e=>`args`in e?e.args:[]),b=p.map(e=>`args`in e?e.args.length:0),ee=ge.range,x=h.length<p.length?{kind:`Subexpression`,selectors:p,selectorRanges:m,location:o}:y.length===0?{kind:`Identifier`,name:v,selectorRanges:m,location:o}:b.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:v,args:y,argumentCounts:b,argumentsRange:ee,selectorRanges:m,location:o}:{kind:`Apply`,operator:v,args:y,argumentsRange:ee,selectorRanges:m,location:o};return f&&he.set(x,{location:g(_(e)),message:`The operator ${i} requires ${d.params.length} arguments.`}),x}if(a.kind===`Operator`&&nl(a.text)&&D(`(`))return{kind:`Apply`,operator:a.text,args:_e(),location:o};switch(a.text){case`(`:{let e=ae(()=>N());return A(`)`),e}case`[`:return ye(a);case`{`:return be(a);case`<<`:return xe(a);case`@`:return{kind:`ExceptAt`,location:o};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Se(a);case`IF`:{let e=N();A(`THEN`);let t=N();return A(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:N(),location:o}}case`CASE`:return Ce(a);case`LET`:{let e=[],n=[];for(i.push(/* @__PURE__ */ new Set);!k(`IN`);){if(t&&D(`RECURSIVE`))throw te(`Unexpected keyword RECURSIVE`,S(y()));if(k(`RECURSIVE`)){Pe();continue}let r=Ae(!1);r.kind===`Instance`?n.push(r):e.push(r)}i.pop();let r=N();return n.length===0?{kind:`Let`,definitions:e,body:r,location:o}:{kind:`Let`,definitions:e,instances:n,body:r,location:o}}case`CHOOSE`:{let e=le(),t=k(`\\in`)?N():void 0;return A(`:`),{kind:`Choose`,pattern:e,set:t,body:N(),location:o}}case`WF_`:case`SF_`:{let e=fe(),t=ae(()=>{A(`(`);let e=N();return A(`)`),e});return{kind:a.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:o}}}throw E(`Unexpected ${ee(a)}`,a)},De=()=>{let e=b(),t=u(e);if(e.kind===`Operator`&&(e.text===`/\\`||e.text===`\\/`))return ve();if(e.kind===`Operator`||e.kind===`Keyword`)switch(e.text){case`~`:return O(),{kind:`Apply`,operator:`~`,args:[N(5)],location:t};case`-`:return O(),{kind:`Apply`,operator:`-.`,args:[N(13)],location:t};case`[]`:return O(),{kind:`Always`,expression:N(16),location:t};case`<>`:return O(),{kind:`Eventually`,expression:N(16),location:t};case`ENABLED`:return O(),{kind:`Enabled`,expression:N(16),location:t};case`UNCHANGED`:return O(),{kind:`Unchanged`,expression:N(16),location:t};case`SUBSET`:case`UNION`:case`DOMAIN`:return O(),{kind:`Apply`,operator:e.text,args:[N(9)],location:t}}return Ee()},N=(e=0)=>{let t=r.index,n=De(),i={left:n.location.range?n:v(n,t),previous:void 0};for(;;){let n=b();if(n.kind!==`Operator`)break;let r=u(n);if(n.text===`'`&&e<=15){O(),i.left=v({kind:`Prime`,expression:i.left,location:r},t);continue}if(Zc.has(n.text)&&e<=15){O(),i.left=v({kind:`Apply`,operator:n.text,args:[i.left],location:r},t);continue}if(n.text===`[`){O();let e=ae(()=>oe(()=>N()));ae(()=>A(`]`)),i.left=v({kind:`FunctionApplication`,function:i.left,args:e,location:r},t);continue}if(n.text===`.`&&re(b(1))){O();let e=O().text;i.left=v({kind:`FieldAccess`,record:i.left,field:e,location:r},t);continue}let a=Xc.get(n.text);if(!a||a.low<e)break;let o=i.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw te(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(O(),a.low>12&&D(`-`))throw te(`Precedence conflict between ${n.text} and -`,b());let s=N(a.high+1),c=i.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`;i.left=c.kind===e&&o?.text===n.text?{...c,operands:[...c.operands,s]}:{kind:e,operands:[c,s],location:r}}else i.left=n.text===`\\X`?c.kind===`Product`&&o?.text===`\\X`?{...c,factors:[...c.factors,s]}:{kind:`Product`,factors:[c,s],location:r}:{kind:`Apply`,operator:n.text,args:[c,s],location:r};i.left=v(i.left,t),i.previous={...a,text:n.text}}return i.left},Oe=()=>{if(!k(`(`))return[];let e=P();return A(`)`),e},ke=()=>{let e=u(b()),t=N(),i=n[r.index-1],a={line:i.line,column:i.endColumn};return{body:t,bodyRange:{module:c[c.length-1].name,start:e,end:a}}},Ae=e=>{let t=r.index;return v(je(e),t)},je=e=>{let t=b(),n=u(t),i=(t,r)=>({kind:`Operator`,name:t,params:r,...ke(),isLocal:e,isRecursive:l(t),location:n});if(t.kind===`Identifier`&&b(1).kind===`Operator`&&Xc.has(b(1).text)&&b(2).kind===`Identifier`&&D(`==`,3)){let e=j(),t=O().text,n=j();return A(`==`),i(t,[{name:e,arity:0},{name:n,arity:0}])}let a=t.kind===`Operator`&&t.text===`-.`,o=t.kind===`Identifier`&&Zc.has(b(1).text)&&D(`==`,2);if(a||o){let e=a?t.text:b(1).text;r.index+=a?1:2;let n=a?j():t.text;return A(`==`),i(e,[{name:n,arity:0}])}let s=j();if(k(`[`)){let t=ae(()=>ue());return A(`]`),A(`==`),{kind:`Function`,name:s,bounds:t,body:N(),isLocal:e,isRecursive:l(s),location:n}}let c=r.index,d=Oe();return A(`==`),D(`INSTANCE`)?{...Me(s,d,e,n),definitionRange:_(c)}:i(s,d)},Me=(e,t,n,i)=>{let a=r.index;return A(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:j(),substitutions:k(`WITH`)?oe(()=>{let e=O().text;return A(`<-`),{name:e,expression:me()}}):[],isLocal:n,location:i,instanceRange:_(a)}},Ne=()=>{let e=u(b());if(D(`_`)&&b(1).kind===`Operator`)return O(),{name:O().text,arity:k(`_`)?2:1,location:e};if(b().kind===`Operator`&&D(`_`,1)){let t=O().text;return O(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=j();if(!k(`(`))return{name:t,arity:0,location:e};let n=oe(()=>A(`_`));return A(`)`),{name:t,arity:n.length,location:e}},P=()=>oe(Ne),Pe=()=>{let e=P();return e.forEach(e=>i[i.length-1].add(e.name)),e},Fe=e=>{let t={value:0,offset:e};do{let e=b(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&ml.has(e.text)&&t.value++,e.kind===`Operator`&&hl.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},F=()=>{let e=b(),t=b(1);return e.kind===`Identifier`?D(`(`,1)||D(`[`,1)?D(`==`,Fe(1)):t.kind===`Operator`&&Zc.has(t.text)?D(`==`,2):t.kind===`Operator`&&Xc.has(t.text)?b(2).kind===`Identifier`&&D(`==`,3):D(`==`,1):D(`-.`)&&t.kind===`Identifier`&&D(`==`,2)},Ie=[],Le=()=>Ie[Ie.length-1]??-1,I=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)},Re=e=>!e.text.endsWith(`.`)&&!ul.has(L(e)),R=e=>{let t=L(e);if(ul.has(t))return;let n=I(e);if(n>=0)return`<${n}>${t}`;let r=Le(),i=Ie[Ie.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},z=e=>{if(e.kind===`Keyword`)return sl.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Ie.length===0;if(e.text[1]===`+`||Ie.length===0)return!0;let t=Le();return t>=0&&I(e)>t},ze=e=>{let t=I(e),n=Ie.length-1,r=Ie[n-1]??-1,i=Ie[n]<0;return i&&(Ie[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Ie[n]===t},B=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)),V=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!gl.has(e.name)&&!B(e.name):!1,H=()=>{let e=b();return e.kind===`Step`?Re(e):e.kind===`Keyword`?dl.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!F()},U=()=>{let e=r.index;s.index=e;let t=b();return t.kind===`Operator`&&!$c.has(t.text)&&nl(t.text)?(r.index++,v({kind:`OperatorReference`,operator:t.text,location:u(t)},e)):k(`MODULE`)?v({kind:`ModuleFact`,name:j(),location:u(t)},e):N()},Be=e=>o[o.length-1]?.add(e),Ve=e=>{o.push(/* @__PURE__ */ new Set);let t=e();return o.pop(),t},He=e=>o.some(t=>t.has(e))||c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),Ue=()=>{let e=r.index,t=b(),n=oe(()=>{let e=b();if((e.kind!==`Identifier`||C(e))&&e.kind!==`Operator`)throw E(`Expected a definition name but found ${ee(e)}`,e);return r.index++,e.text},`!`),i=u(t);return v(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:i}:{kind:`Identifier`,name:n.join(`!`),location:i},e)},We=()=>{if(t)return oe(Ue);let e=oe(U),n=e.find(e=>e.kind===`Identifier`&&He(e.name));if(n)throw te(`DEF clause entry should describe a defined operator`,n.location);return e},Ge=()=>({facts:H()?oe(U):[],defs:k(`DEF`)||k(`DEFS`)?We():[]}),Ke=()=>{let e=r.index,n=O(),i=n.text===`USE`&&k(`ONLY`),a=_(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:i,...Ge(),keyword:a,location:u(n)},s=o.kind===`Hide`&&!t?o.facts.filter(e=>!V(e)):[];if(s.length>0)throw m(s.map(t=>({location:g(t.location.range??_(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
103
|
+
the name of a theorem, assumption, or step.`})));return v(o,e)},qe=()=>{let e=r.index,t=u(b()),n=k(`NEW`),i=b().kind===`Keyword`?fl.get(b().text):void 0;if(!n&&i===void 0)throw E(`Expected a declaration but found ${ee(b())}`);if(i!==void 0&&O(),i===`Variable`){let n=j();return Be(n),v({kind:`NewSymbol`,name:n,arity:0,level:i,set:void 0,location:t},e)}let a=Ne();Be(a.name);let o=(i??`Constant`)===`Constant`&&D(`\\in`);if(o&&a.arity>0)throw te(`declared symbol with arguments before \\in`);return o&&O(),v({kind:`NewSymbol`,name:a.name,arity:a.arity,level:i??`Constant`,set:o?N():void 0,location:t},e)},Je=()=>{let e=r.index,t=u(A(`ASSUME`)),n=oe(()=>D(`ASSUME`)?Ve(Je):b().kind===`Keyword`&&pl.has(b().text)?qe():N());return A(`PROVE`),v({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)},Ye=e=>{let t={value:0};for(;b(t.value).kind===`Identifier`&&D(`,`,t.value+1);)t.value+=2;return b(t.value).kind===`Identifier`&&D(e,t.value+1)},Xe=(e,t)=>{e.forEach(Be),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(Be))},Ze=()=>{let e=b();if(D(`USE`)||D(`HIDE`))return Ke();if(D(`INSTANCE`))return v(Me(void 0,[],!1,u(e)),r.index);if(D(`DEFINE`)||F()){let t=r.index;k(`DEFINE`);let n=[Ae(!1)];for(;F();)n.push(Ae(!1));let i={kind:`Define`,definitions:n,location:u(e)};return v(i,t)}if(k(`HAVE`))return{kind:`Have`,expression:N()};if(k(`TAKE`)){let e=se(),t=e?[]:oe(j),n=e?ue():[];return Xe(t,n),{kind:`Take`,names:t,bounds:n}}if(k(`WITNESS`))return{kind:`Witness`,expressions:oe(()=>N())};if(k(`PICK`)){let e=Ye(`:`),t=e?oe(j):[],n=e?[]:ue();return Xe(t,n),A(`:`),{kind:`Pick`,names:t,bounds:n,body:N()}}return k(`CASE`)?{kind:`Case`,expression:N()}:{kind:`Assert`,isSuffices:k(`SUFFICES`),statement:D(`ASSUME`)?Je():N()}},Qe=e=>{let t=b();if(t.kind!==`Step`)throw E(`Expected a step number but found ${ee(t)}`,t);if(!ze(t))throw te(`${e?`QED step`:`step`}'s number has bad level`,t);if(I(t)<0&&R(t)!==void 0)throw te(`<*> and <+> cannot be used for a named step`,t);return r.index++,{name:R(t),token:t.text,location:u(t)}},$e=()=>{let e=r.index,t=Qe(D(`QED`,1)),n=r.index,i=/* @__PURE__ */ new Set;o.push(i);let a=k(`QED`)?{kind:`Qed`}:Ze(),s=_(e),c=_(n),l=z(b());if(l&&!cl.has(a.kind))throw te(`Proof of a step that does not take a proof`);let u=l?tt():void 0;return o.pop(),(a.kind!==`Assert`||a.isSuffices)&&i.forEach(Be),v({...t,body:a,head:s,statement:c,proof:u},e)},et=()=>{let e=u(b());if(D(`BY`)||D(`PROOF`)&&D(`BY`,1)){k(`PROOF`),O();let t=_(r.index-1);return{kind:`By`,isOnly:k(`ONLY`),...Ge(),keyword:t,location:e}}let t=b(+!!D(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){k(`PROOF`),O();let n=_(r.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}k(`PROOF`);let n=[$e()];for(;n[n.length-1].body.kind!==`Qed`;)n.push($e());return{kind:`Steps`,level:Le(),steps:n,location:e}},tt=()=>{let e=r.index;Ie.push(-1);let t=Ve(et);return Ie.pop(),v(t,e)},nt=e=>{let t=r.index,n=O(),i=b().kind===`Identifier`&&D(`==`,1)?j():void 0;i!==void 0&&(a.add(i),O());let o=Ve(()=>({statement:D(`ASSUME`)?Je():N(),proof:z(b())?tt():void 0})),s=o.statement,c=v({name:i,statement:s,proof:o.proof,location:u(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&s.kind!==`AssumeProve`&&e.definitions.push(v({kind:`Operator`,name:i,params:[],body:s,isLocal:!1,isRecursive:!1,location:u(n)},t))},rt=()=>{let e=r.index;return v(it(),e)},it=()=>{let e=O(),t=u(e),n=e.text===`AXIOM`;if(b().kind===`Identifier`&&D(`==`,1)){let e=j();return a.add(e),O(),{name:e,expression:N(),isAxiom:n,location:t}}return{name:void 0,expression:N(),isAxiom:n,location:t}},W=()=>{let e=u(A(`----`));A(`MODULE`);let t=j();A(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(c.push(n),i.push(/* @__PURE__ */ new Set),k(`EXTENDS`)&&oe(()=>{let e=r.index;n.extends.push(j()),n.extendsRanges.push(_(e))});;){let a=r.index;x.index=a;let o=b();if(o.kind===`ModuleEnd`||o.kind===`End`){if(o.kind===`ModuleEnd`&&(e.range={module:t,start:{line:e.line,column:e.column},end:{line:o.line,column:o.endColumn}}),he.size>0)throw m([...he.values()]);return c.pop(),i.pop(),n}if(o.kind===`Separator`){if(D(`MODULE`,1)){let e=W();n.modules.push(e),n.units.push({kind:`Module`,module:e}),A(`====`);continue}O()}else{switch(o.text){case`CONSTANT`:case`CONSTANTS`:{O();let e=P();n.constants.push(...e),n.units.push({kind:`Constants`,declarations:e});continue}case`VARIABLE`:case`VARIABLES`:{O();let e=oe(()=>{let e=r.index,t=u(b());return v({name:j(),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=rt();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=Ke();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:O(),n.units.push({kind:`Recursive`,declarations:Pe()});continue;case`INSTANCE`:G(n,v(Me(void 0,[],!1,u(o)),a));continue;case`LOCAL`:if(O(),D(`INSTANCE`)){G(n,v(Me(void 0,[],!0,u(o)),a));continue}G(n,Ae(!0));continue}o.kind===`Keyword`&&ol.has(o.text)?nt(n):G(n,Ae(!1))}}},G=(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 W()},bl=e=>yl(e,!1),xl=e=>yl(e,!0),Sl=25214903917n,Cl=(1n<<48n)-1n,wl=2147483647,Tl=e=>{let t={value:(BigInt.asUintN(64,e)^Sl)&Cl},n=e=>(t.value=t.value*Sl+11n&Cl,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Sl)&Cl},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<=wl)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},El=10454148508367108822n,Dl=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:El);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Ol=Int32Array.from(Dl,e=>Number(BigInt.asIntN(32,e>>32n))),kl=Int32Array.from(Dl,e=>Number(BigInt.asIntN(32,e))),Al=Number(BigInt.asIntN(32,El>>32n)),jl=Number(BigInt.asIntN(32,El));let Ml=Al,Nl=jl;const Pl=e=>{let t=(e^Nl)&255;Nl=(Nl>>>8|Ml<<24)^kl[t],Ml=Ml>>>8^Ol[t]},Fl=e=>{for(let t=0;t<32;t+=8)Pl(e>>>t)},Il=e=>{if(typeof e==`boolean`)Pl(0),Pl(e?116:102);else if(typeof e==`number`)Pl(1),Fl(e);else if(typeof e==`string`){Pl(3),Fl(e.length);for(let t=0;t<e.length;t++)Pl(e.charCodeAt(t))}else if(P(e))Pl(21),Fl(He(e.name)+1);else if(Ne(e)){let t=bn(e);Pl(9),Fl(t.domain.length);for(let e=0;e<t.domain.length;e++)Il(t.domain[e]),Il(t.range[e])}else{let t=q(e).elements;Pl(5),Fl(t.length);for(let e of t)Il(e)}},Ll=e=>{let t={high:Ml,low:Nl};Ml=Al,Nl=jl;for(let t of e)Il(t);let n=BigInt(Ml>>>0)<<32n|BigInt(Nl>>>0);return Ml=t.high,Nl=t.low,n},Rl=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||P(e))return 5;if(typeof e==`string`)return 5+e.length;if(Ne(e)){let t=bn(e);return t.domain.reduce((e,n,r)=>e+Rl(n)+Rl(t.range[r]),5)}return q(e).elements.reduce((e,t)=>e+Rl(t),5)},zl=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Ml=n<32?0:1<<n-32,Nl=n<32?1<<n:0;for(let t=0;t<e;t++)Pl(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]^Ml,t[n+1]=t[a+1]^Nl}}return t},Bl=(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=Rl(e);return Ml=0,Nl=0,Il(e),r.set(e,i.length),i.push(n,Ml,Nl),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=zl(e);return n.set(e,r),r};return(n,r)=>{let s={high:Ml,low:Nl},c={high:Al,low:jl};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}Ml=s.high,Nl=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},Vl=[],Hl=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Ul=()=>{for(let e=1277011;Vl.length<1341;e++)Hl(e)&&Vl.push(e);return Vl},Wl=e=>{let t=Ul(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Gl=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},Kl=e=>{for(let t=Math.max(e,9);;t++){let e=Gl(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)}}},ql=(e,t,n)=>{if(t<=0)return[];let r=Kl(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Wl(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Jl=(1n<<63n)-1n-24n,Yl=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Jl*BigInt(n)+i)%t;return r<0n?r+t:r})},Xl=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,Zl=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Vt(e.domain),n=q(e.range).elements;return{lists:t.map(()=>n),create:e=>$e(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>q(e).elements),create:t=>Wt(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>q(e).elements),create:Ut}}},Ql=(e,t,n)=>{if(sn(t))return[];if(typeof t==`object`&&t.kind===`Interval`)return ql(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let r=Zl(t);if(r){let t=r.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(wl)?Yl(e,t,n):ql(e,Number(t),n)).map(e=>r.create(Xl(r.lists,e)))}let i=q(t).elements;return ql(e,i.length,n).map(e=>i[Number(e)])},$l=(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},eu=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Vt(e.domain)];return $e(n,n.map(()=>eu(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Wt(e.names.map((n,r)=>[n,eu(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Ut(e.factors.map(e=>eu(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 $l(q(e).elements,t)},tu=(e,t=0n)=>{let n=Tl(t),r={random:Tl(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Wt([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Ll,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},nu=e=>Nt([...e.possibleCounts].map(([e,t])=>[e,t])),ru=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,nu(e)]]),iu=[[38,[`ACTION`,`ACTIONS`]],[39,[`ASSUME`]],[40,[`[]ASSUME`]],[41,[`ASSUMPTION`,`AXIOM`]],[42,[`CASE`]],[43,[`CHOOSE`]],[44,[`CONSTANT`,`CONSTANTS`]],[45,[`ELSE`]],[46,[`EXCEPT`]],[47,[`\\E`,`\\exists`,`∃`]],[48,[`EXTENDS`]],[49,[`\\A`,`\\forall`,`∀`]],[50,[`IF`]],[51,[`INSTANCE`]],[52,[`LET`]],[53,[`IN`]],[54,[`LOCAL`]],[55,[`MODULE`]],[56,[`NEW`]],[57,[`OTHER`]],[58,[`PROPOSITION`,`LEMMA`,`COROLLARY`]],[59,[`SF_`]],[60,[`\\EE`]],[61,[`\\AA`]],[62,[`THEN`]],[63,[`BY`]],[64,[`ONLY`]],[65,[`DEFINE`]],[66,[`DEF`,`DEFS`]],[67,[`THEOREM`]],[68,[`USE`]],[69,[`HIDE`]],[70,[`HAVE`]],[71,[`OBVIOUS`]],[72,[`OMITTED`]],[73,[`LAMBDA`]],[74,[`TAKE`]],[75,[`PROOF`]],[76,[`PROVE`]],[77,[`[]PROVE`]],[78,[`QED`]],[79,[`RECURSIVE`]],[80,[`STATE`]],[81,[`TEMPORAL`,`TEMPORALS`]],[82,[`PICK`]],[83,[`WITNESS`]],[84,[`SUFFICES`]],[85,[`VARIABLE`,`VARIABLES`]],[86,[`WF_`]],[87,[`WITH`]],[88,[`,`]],[89,[`:`]],[90,[`::`,`∷`]],[91,[`.`]],[92,[`_`]],[93,[`==`,`≜`]],[94,[`(`]],[95,[`)`]],[96,[`-|-`]],[97,[`[`]],[98,[`]_`]],[99,[`]`]],[100,[`{`]],[101,[`}`]],[102,[`<<`,`⟨`]],[103,[`>>_`,`⟩_`]],[104,[`>>`,`⟩`]],[105,[`!`]],[106,[`->`,`→`]],[107,[`<-`,`←`]],[108,[`|->`,`↦`]],[113,[`'`]],[114,[`^+`,`⁺`]],[115,[`^*`]],[116,[`^#`]],[117,[`-.`]],[118,[`\\lnot`,`¬`]],[119,[`\\neg`]],[120,[`~`]],[121,[`[]`,`□`]],[122,[`<>`,`◇`]],[123,[`ENABLED`]],[124,[`UNCHANGED`]],[125,[`SUBSET`]],[126,[`UNION`]],[127,[`DOMAIN`]],...[`//`,`/\\`,`/=`,`/`,`\\/`,`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`,`\\in`,`\\intersect`,`\\union`,`\\land`,`\\leq`,`\\ll`,`\\lor`,`\\o`,`\\odot`,`\\ominus`,`\\oplus`,`\\oslash`,`\\otimes`,`\\prec`,`\\preceq`,`\\propto`,`\\sim`,`\\simeq`,`\\sqcap`,`\\sqcup`,`\\sqsubset`,`\\sqsupset`,`\\sqsubseteq`,`\\sqsupseteq`,`\\star`,`\\subset`,`\\subseteq`,`\\succ`,`\\succeq`,`\\supset`,`\\supseteq`,`\\uplus`,`\\wr`,`\\`,`~>`,`=>`,`=<`,`=|`,`=`,`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`,`-`,`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`,`\\X`].map((e,t)=>[128+t,[e]]),[129,[`∧`]],[132,[`∨`]],[147,[`∈`]]],au=(()=>{let e=/* @__PURE__ */ new Map;for(let t of iu)for(let n of t[1])e.set(n[0],[...e.get(n[0])??[],[t[0],n]]);return e})(),ou=/-{4,} *MODULE/y,su=[/[0-9][A-Za-z0-9]*\.\/\\/y,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*\.\/\\/y,/[a-zA-RT-VX-Z][A-Za-z0-9]*\.\/\\/y],cu=[/[0-9][A-Za-z0-9]*\.\\\//y,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*\.\\\//y,/[a-zA-RT-VX-Z][A-Za-z0-9]*\.\\\//y],lu=[/_[A-Za-z0-9_]*[A-Za-z][A-Za-z0-9_]*/y,/[0-9][A-Za-z0-9_]*[A-Za-z][A-Za-z0-9_]*/y,/[WS](?:[a-zA-EG-Z_0-9][A-Za-z0-9_]*)?/y,/[WS]F(?:[A-Za-z0-9][A-Za-z0-9_]*)?/y,/[a-zA-RT-VX-Z][A-Za-z0-9_]*/y,/[@ℕℤℝ]/y],uu=[[35,[ou]],[36,[/-{4,}/y]],[37,[/={4,}/y]],[109,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[110,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[111,su],[112,cu],[289,lu],[290,[/<[0-9]+>[A-Za-z0-9_]+/y]],[291,[/<[+*]>[A-Za-z0-9]+/y]],[292,[/<(?:[0-9]+|\+|\*)>[A-Za-z0-9_]+\.+/y]],[293,[/<(?:[0-9]+|\+|\*)>/y]],[294,[/<(?:[0-9]+|\+|\*)>(?:\*\.*|-\.*|\.+)/y]]],du=[[20,[/[0-9]+/y]],[21,[ou]],[111,su],[112,cu],[289,lu]],fu=(e,t,n)=>Math.max(0,...e.map(e=>(e.lastIndex=n,e.exec(t)?.[0].length??0))),pu=(e,t,n,r)=>{let i=n.map(([n,r])=>[n,fu(r,e,t)]);if(r)for(let[n,r]of au.get(e[t])??[])e.startsWith(r,t)&&i.push([n,r.length]);return i.reduce((e,t)=>t[1]>e[1]||t[1]===e[1]&&t[1]>0&&t[0]<e[0]?t:e,[0,0])},mu=(e,t)=>{if(e[t]===`?`)return 1;if(e[t]!==`"`)return 0;let n=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y;return n.lastIndex=t,n.exec(e)?.[0].length??0},hu=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
104
|
+
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`],[`\0`,``]]),gu=e=>e.split(``).map(e=>{let t=e.charCodeAt(0);return hu.get(e)??(t<32||t>126?`\\u${t.toString(16).padStart(4,`0`)}`:e)}).join(``),_u=e=>{let t=[],n=[],r={line:1,column:0,isAfterCarriageReturn:!1,isAfterLineFeed:!1};for(let i of e.split(``))r.column++,r.isAfterLineFeed?(r.isAfterLineFeed=!1,r.line++,r.column=1):r.isAfterCarriageReturn&&(r.isAfterCarriageReturn=!1,i===`
|
|
105
|
+
`?r.isAfterLineFeed=!0:(r.line++,r.column=1)),i===`\r`&&(r.isAfterCarriageReturn=!0),i===`
|
|
106
|
+
`&&(r.isAfterLineFeed=!0),i===` `&&(r.column=r.column-1+(8-(r.column-1)%8)),t.push(r.line),n.push(r.column);let i={state:0,index:0,commentDepth:0},a=(r,i,a)=>({kind:r,image:e.slice(i,a),beginLine:t[i],beginColumn:n[i],endLine:t[a-1],endColumn:n[a-1],next:void 0}),o=(r,i,a)=>{if(a!==void 0&&a+1<e.length)throw new h(`Lexical error at line ${t[a]}, column ${n[a]}. Encountered: "${gu(e[a])}" (${e.charCodeAt(a)}), after : "${gu(i)}"`);let o=e.length-1,s=e[o]===`
|
|
107
|
+
`||e[o]===`\r`,c=`Lexical error at line ${s?t[o]+1:t[o]}, column ${s?0:n[o]+1}. Encountered: <EOF> after : "${gu(i)}"`;throw new h(t[r]===t[o]?c:`Lexical {error: EOF reached, possibly open comment starting around line ${t[r]}`)},s=t=>{for(;;){if(i.index>=e.length)return o(t,``,void 0);let n=e.startsWith(`(*.`,i.index)?3:e.startsWith(`(*`,i.index)?2:0;if(i.state===5){let t=e.startsWith(`\r
|
|
108
|
+
`,i.index)?2:+(e[i.index]===`
|
|
109
|
+
`||e[i.index]===`\r`);if(t>0){i.index+=t,i.state=2;return}}else if(n>0){i.index+=n,i.commentDepth++,i.state=4;return}else if(e.startsWith(`*)`,i.index)){i.index+=2,i.state===3?i.state=2:(i.commentDepth--,i.commentDepth===0&&(i.state=3));return}i.index++}};return{getNextToken:()=>{for(;;){if(i.index>=e.length){let r=e.length-1;return{kind:0,image:``,beginLine:t[r]??0,beginColumn:n[r]??0,endLine:t[r]??0,endColumn:n[r]??0,next:void 0}}let r=i.index;if(i.state===0){let t=e.startsWith(`--->`,i.index)?4:0;ou.lastIndex=i.index;let n=ou.exec(e)?.[0].length??0;if(n>0&&n>=t)return i.index+=n,i.state=2,a(3,r,i.index);if(t>0)return i.index+=t,i.state=1,a(2,r,i.index);i.index++;continue}if(i.state===1){let[t,n]=pu(e,i.index,du,!1);if(n===0){i.index++;continue}return i.index+=n,t===21&&(i.state=2),a(t,r,i.index)}if(i.state!==2){s(r);continue}if(`
|
|
110
|
+
\r`.includes(e[i.index])){i.index++;continue}if(e.startsWith(`(*`,i.index)||e.startsWith(`\\*`,i.index)){i.state=e[i.index]===`(`?3:5,i.index+=e.startsWith(`(*.`,i.index)?3:2,s(r);continue}let[c,l]=pu(e,i.index,uu,!0);if(l===0){let t=mu(e,i.index),n=i.index+t;return n<e.length?o(r,n+1<e.length||t===0?e.slice(r,n):e.slice(r,n+1),n):o(r,t<=1?``:e.slice(r),void 0)}return i.index+=l,a(c,r,i.index)}}}},vu=2147483647,yu=-2147483648,bu=(e,t)=>Array.from({length:t-e+1},(t,n)=>e+n),xu=bu(118,127),Su=bu(117,127),Cu=bu(128,288),wu=bu(113,116),Tu=bu(290,294),Eu=[42,43,47,49,50,52,60,61],Du=new Set(bu(113,291)),Ou=/* @__PURE__ */ new Set([59,86,94,97,100,102]),ku=/* @__PURE__ */ new Set([38,44,56,80,81,85]),Au=/* @__PURE__ */ new Set([92,...Su]),ju=/* @__PURE__ */ new Set([`Tuple`,`ParenExpr`,`SetEnumerate`,`SubsetOf`,`SetOfAll`,`SetOfFcns`,`RcdConstructor`,`SetOfRcds`,`Except`,`FcnConst`,`ActionExpr`]),Mu=[[`[`,160,160,`left`,`postfix`],[`.`,170,170,`left`,`infix`],[`'`,150,150,`none`,`postfix`],[`^`,140,140,`none`,`infix`],[`/`,130,130,`none`,`infix`],[`*`,130,130,`left`,`infix`],[`-`,110,110,`left`,`infix`],[`-.`,120,120,`none`,`prefix`],[`+`,100,100,`left`,`infix`],[`=`,50,50,`none`,`infix`],[`\\lnot`,40,40,`left`,`prefix`],[`\\land`,30,30,`left`,`infix`],[`\\lor`,30,30,`left`,`infix`],[`~>`,20,20,`none`,`infix`],[`=>`,10,10,`none`,`infix`],[`[]`,40,150,`none`,`prefix`],[`<>`,40,150,`none`,`prefix`],[`ENABLED`,40,150,`none`,`prefix`],[`UNCHANGED`,40,150,`none`,`prefix`],[`SUBSET`,100,130,`none`,`prefix`],[`UNION`,100,130,`none`,`prefix`],[`DOMAIN`,100,130,`none`,`prefix`],[`^+`,150,150,`none`,`postfix`],[`^*`,150,150,`none`,`postfix`],[`^#`,150,150,`none`,`postfix`],[`\\cdot`,50,140,`left`,`infix`],[`\\equiv`,20,20,`none`,`infix`],[`-+->`,20,20,`none`,`infix`],[`/=`,50,50,`none`,`infix`],[`\\subseteq`,50,50,`none`,`infix`],[`\\in`,50,50,`none`,`infix`],[`\\notin`,50,50,`none`,`infix`],[`<`,50,50,`none`,`infix`],[`\\leq`,50,50,`none`,`infix`],[`>`,50,50,`none`,`infix`],[`\\geq`,50,50,`none`,`infix`],[`\\times`,100,130,`left`,`nfix`],[`\\`,80,80,`none`,`infix`],[`\\intersect`,80,80,`left`,`infix`],[`\\union`,80,80,`left`,`infix`],[`...`,90,90,`none`,`infix`],[`..`,90,90,`none`,`infix`],[`|`,100,110,`left`,`infix`],[`||`,100,110,`left`,`infix`],[`&&`,130,130,`left`,`infix`],[`&`,130,130,`left`,`infix`],[`$$`,90,130,`left`,`infix`],[`$`,90,130,`left`,`infix`],[`??`,90,130,`left`,`infix`],[`%%`,100,110,`left`,`infix`],[`%`,100,110,`none`,`infix`],[`##`,90,130,`left`,`infix`],[`++`,100,100,`left`,`infix`],[`--`,110,110,`left`,`infix`],[`**`,130,130,`left`,`infix`],[`//`,130,130,`none`,`infix`],[`^^`,140,140,`none`,`infix`],[`@@`,60,60,`left`,`infix`],[`!!`,90,130,`none`,`infix`],[`|-`,50,50,`none`,`infix`],[`|=`,50,50,`none`,`infix`],[`-|`,50,50,`none`,`infix`],[`=|`,50,50,`none`,`infix`],[`<:`,70,70,`none`,`infix`],[`:>`,70,70,`none`,`infix`],[`:=`,50,50,`none`,`infix`],[`::=`,50,50,`none`,`infix`],[`\\oplus`,100,100,`left`,`infix`],[`\\ominus`,110,110,`left`,`infix`],[`\\odot`,130,130,`left`,`infix`],[`\\oslash`,130,130,`none`,`infix`],[`\\otimes`,130,130,`left`,`infix`],[`\\uplus`,90,130,`left`,`infix`],[`\\sqcap`,90,130,`left`,`infix`],[`\\sqcup`,90,130,`left`,`infix`],[`\\div`,130,130,`none`,`infix`],[`\\wr`,90,140,`none`,`infix`],[`\\star`,130,130,`left`,`infix`],[`\\o`,130,130,`left`,`infix`],[`\\bigcirc`,130,130,`left`,`infix`],[`\\bullet`,130,130,`left`,`infix`],[`\\prec`,50,50,`none`,`infix`],[`\\succ`,50,50,`none`,`infix`],[`\\preceq`,50,50,`none`,`infix`],[`\\succeq`,50,50,`none`,`infix`],[`\\sim`,50,50,`none`,`infix`],[`\\simeq`,50,50,`none`,`infix`],[`\\ll`,50,50,`none`,`infix`],[`\\gg`,50,50,`none`,`infix`],[`\\asymp`,50,50,`none`,`infix`],[`\\subset`,50,50,`none`,`infix`],[`\\supset`,50,50,`none`,`infix`],[`\\supseteq`,50,50,`none`,`infix`],[`\\approx`,50,50,`none`,`infix`],[`\\cong`,50,50,`none`,`infix`],[`\\sqsubset`,50,50,`none`,`infix`],[`\\sqsubseteq`,50,50,`none`,`infix`],[`\\sqsupset`,50,50,`none`,`infix`],[`\\sqsupseteq`,50,50,`none`,`infix`],[`\\doteq`,50,50,`none`,`infix`],[`\\propto`,50,50,`none`,`infix`]].map(e=>({name:e[0],low:e[1],high:e[2],associativity:e[3],fix:e[4]})),Nu=[[`\\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`,`≀`],[`^+`,`⁺`]],Pu=(()=>{let e=new Map(Mu.map(e=>[e.name,e]));for(let t of Nu){let n=e.get(t[0]);if(n)for(let r of t.slice(1))e.set(r,n)}return e})(),Fu=Pu.get(`[`),Iu={name:`$$_void`,low:0,high:0,associativity:`none`,fix:`infix`},Lu=e=>e.fix===`prefix`?e:Pu.get(`${e.name}.`),Ru=e=>e.fix===`infix`||e.fix===`nfix`,zu=(e,t)=>e.low>t.high,Bu=(e,t)=>e.high<t.low,Vu=e=>e!==void 0&&e.kind>=113&&e.kind<=288,Hu=e=>e!==void 0&&e.kind>=128&&e.kind<=288,Uu=(e,t)=>{let n=e[t];if(n.kind===95||n.kind===99){let n={index:t,depth:1};for(;n.index>0;){n.index--;let t=e[n.index].kind,r=t===94||t===97;if(r&&n.depth===1)break;r&&n.depth--,(t===95||t===99)&&n.depth++}return n.index>0&&e[n.index-1].kind===289?n.index-1:n.index}if(n.kind===289){let n=e[t-1];return!Vu(n)||n.kind>=113&&n.kind<=116||Hu(n)&&e[t-2]?.kind!==289||e[t-2]?.kind===107?t:Hu(n)?t-2:t-1}return Vu(n)?t-1:t},Wu=e=>e.kind>=38&&e.kind<=46||e.kind===48||e.kind>=50&&e.kind<=59||e.kind===80||e.kind>=62&&e.kind<=87||e.kind===92||e.kind>=123&&e.kind<=127,Gu=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1,e.image.indexOf(`>`))),Ku=e=>{let t=_u(e),n=[],r={kind:0,image:``,beginLine:0,beginColumn:0,endLine:0,endColumn:0,next:void 0},i={token:r,nextKind:-1,generation:0,expectedGeneration:-1,moduleName:void 0,expecting:``,lastOperator:void 0,fairnessHook:void 0,proofDepth:-1,operatorStack:void 0},a={scanPosition:r,lastPosition:r,remaining:0,isSucceeded:!1,isLookingAhead:!1,isRescanning:!1,endPosition:0,longestExpected:0},o=[],s=[],c=[],l=[],u=[],d=e=>e.next??=t.getNextToken(),f=e=>Array.from({length:e}).reduce(e=>d(e),a.isLookingAhead?a.scanPosition:i.token),p=()=>i.nextKind===-1?i.nextKind=d(i.token).kind:i.nextKind,m=()=>(i.expectedGeneration=i.generation,!1),g=e=>p()===e||m(),_=e=>`line ${e.location[0]}, col ${e.location[1]} to line ${e.location[2]}, col ${e.location[3]} of module ${i.moduleName??`null`}`,v=e=>new h(`***Parse Error***\n${i.expecting===``?``:`Was expecting "${i.expecting}"\n`}${e}\n\nResidual stack trace follows:\n${s.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``)}`),y=e=>{e>=100||(e===a.endPosition+1?a.endPosition++:a.endPosition!==0&&(a.longestExpected=Math.max(a.longestExpected,a.endPosition),e!==0&&(a.endPosition=e)))},b=(e,t)=>e===void 0||t>=100?void 0:e===a.scanPosition?t:b(e.next,t+1),ee=e=>{a.scanPosition===a.lastPosition&&(a.remaining--,a.lastPosition=d(a.scanPosition)),a.scanPosition=d(a.scanPosition);let t=a.isRescanning?b(i.token,0):void 0;return t!==void 0&&y(t),e.has(a.scanPosition.kind)?(a.remaining===0&&a.scanPosition===a.lastPosition&&(a.isSucceeded=!0),!0):!1},x=e=>{if(typeof e!=`number`)return e;let t=/* @__PURE__ */ new Set([e]);return()=>ee(t)},S=(...e)=>{let t=new Set(e);return()=>ee(t)},C=(...e)=>{let t=e.map(x);return()=>{for(let e of t){if(!e())return!1;if(a.isSucceeded)return!0}return!0}},w=(...e)=>{let t=e.map(x);return()=>{let e=a.scanPosition;for(let n of t)if(a.scanPosition=e,n())return!0;return!1}},T=e=>{let t=x(e);return()=>{let e=a.scanPosition;return t()||(a.scanPosition=e),!0}},te=e=>{let t=x(e);return()=>{for(;;){let e=a.scanPosition;if(!t())return a.scanPosition=e,!0;if(a.isSucceeded)return!0}}},ne=(e,t)=>{let n=x(t);return()=>{a.isLookingAhead=!0;let t=e();return a.isLookingAhead=!1,t&&n()}},E=e=>l.length===0||l[l.length-1].column<e,re=()=>E(f(1).beginColumn),D=()=>{let e=f(1),t=l.at(-1);return t!==void 0&&(e.kind===129||e.kind===132)&&t.column===e.beginColumn&&t.isConjunction===(e.kind===129)},O=()=>f(1).kind===39||f(1).kind===40,k=()=>O()||f(2).kind===90&&(f(3).kind===39||f(3).kind===40),A=()=>{let e=i.operatorStack?.at(-1)?.operator;return i.operatorStack===void 0||i.operatorStack.length===0||e!==void 0&&e.fix!==`postfix`},ie=()=>{let e=d(a.isLookingAhead?a.scanPosition:i.token);if(e.kind===102){let t={token:e,depth:1};for(;t.depth!==0;)if(t.token=d(t.token),t.token.kind===102&&t.depth++,t.token.kind===104&&t.depth--,t.token.kind===0)return!1;return d(t.token).kind===147}if(e.kind!==289)return!1;let t={token:d(e)};for(;t.token.kind===88;){let e=d(t.token);if(e.kind!==289)return!1;t.token=d(e)}return t.token.kind===147},j=()=>Me(),ae=()=>Te(),oe=C(102,T(C(289,te(C(88,289)))),104),se=w(oe,289),ce=C(91,109),le=C(109,T(ce)),ue=C(94,j),de=w(ne(ie,se),j,j,j),fe=C(100,T(de),101),pe=C(97,w(ne(ie,se),289,ne(()=>f(2).kind===108&&Wu(f(1)),289),289,j)),M=C(102,T(j),S(104,103)),me=C(S(132,129),j),he=C(T(54),96,S(289,...Su)),ge=w(he,79),_e=C(289,T(94)),ve=S(92,...Su),ye=C(94,w(ne(re,S(...Su,...Cu,...wu)),ne(re,73),j)),be=C(56,44),xe=C(_e,T(147)),Se=C(w(be,56,44),w(xe,ve)),Ce=C(T(56),85,289),we=C(T(56),S(80,38,81),w(_e,ve)),Te=C(T(C(289,90,ae)),S(39,40),w(ne(k,ae),w(Se,Ce,we),j),te(88),S(76,77)),Ee=C(T(96),289,93),De=C(289,93),N=x(75),Oe=C(T(84),w(j,ne(O,ae))),ke=w(ne(re,110),ne(re,le),C(S(289,290,291,...Cu,...wu,...Su),T(ye),te(105))),Ae=w(ne(re,S(...wu)),ne(re,91),ne(re,pe)),je=w(ne(re,S(...Cu)),ne(re,90)),Me=C(te(S(...xu,...Cu)),w(ne(re,w(C(S(47,49),w(289,se)),C(S(60,61),289),C(50,j),C(42,j),C(52,ge,te(ge)),C(43,w(289,oe)))),ne(re,C(w(ne(A,w(me,me)),w(ue,fe,pe,M,C(S(86,59),w(289,ue,fe,pe,M))),ke),te(Ae),T(je))))),Ne={moduleUnit:[w(36,85,44,he,79,C(T(54),51,289),C(S(41,39),T(Ee),j),C(S(67,58),T(De),w(ne(O,ae),j)),S(35,3,21),ne(()=>f(1).kind===68&&f(2).kind!==64||f(1).kind===69,w(C(T(75),63),68,69))),1],unitDefinition:[he,2],unitInstance:[C(T(54),51,289),2],unitAssumption:[C(S(41,39),T(Ee),j),2],unitTheorem:[C(S(67,58),T(De),w(ne(O,ae),j)),2],constantArguments:[C(94,92),2],definitionBody:[j,1],functionDefinition:[C(289,97),vu],postfixDefinition:[C(289,S(...wu)),vu],infixDefinition:[C(289,S(...Cu)),vu],identifierDefinition:[C(289,S(94,93)),vu],nextSubstitution:[C(88,S(289,...Su,...Cu,...wu),107),3],assumptionName:[Ee,2],assumeExpression:[j,1],nextAssumeExpression:[j,1],newConstant:[be,2],constantDeclaration:[xe,2],constantSymbol:[Se,2],variableSymbol:[Ce,2],levelSymbol:[we,2],theoremName:[De,2],theoremAssumeProve:[ne(O,ae),3],theoremExpression:[j,1],proofKeyword:[N,2],terminalProof:[C(T(75),S(71,72)),2],stepProof:[C(T(N),te(S(...Tu)),S(...Tu)),1],usedExpression:[j,1],nextUsedExpression:[j,1],usedFacts:[w(55,j),1],definedExpression:[j,1],nextDefinedExpression:[j,1],assertStep:[Oe,1],nextDefinition:[he,2],takeBounds:[w(C(289,te(C(88,289)),147),102),vu],pickIdentifiers:[C(289,te(C(88,289)),89),vu],assertedExpression:[j,1],decimalPart:[ce,2],operatorArgument:[C(S(...Su,...Cu,...wu),S(88,95,96,54,51,67,39,37,36,35,41,44,85,79)),2],lambdaArgument:[x(73),vu],expressionArgument:[j,1],unboundQuantifier:[C(289,te(C(88,289)),89),vu],setEnumeration:[C(se,88),vu],setOfAll:[C(se,89),vu],setExpression:[j,1],setContents:[de,1],recordFields:[C(289,108),vu],recordSets:[C(289,89),vu],bracketExpression:[j,1],tupleContents:[j,1],identifierArguments:[ye,2],fairnessArguments:[C(94,j),2],disjunctionList:[x(132),vu],conjunctionList:[x(129),vu],leadingOperator:[S(...xu,193),vu],openExpression:[S(...Eu),vu],junctionList:[S(129,132),vu],primitiveExpression:[ke,1],expressionSuffix:[Ae,1],postfixSuffix:[S(...wu),vu],recordSuffix:[x(91),vu],applicationSuffix:[x(97),vu],nextLeadingOperator:[S(...xu,193),vu],nextOpenExpression:[S(...Eu),vu],infixContinuation:[S(...Cu),vu],labelContinuation:[x(90),vu],expressionContinuation:[je,1],negativeOperator:[x(117),vu],primitiveArguments:[ye,2],stringLiteral:[x(110),vu],numberLiteral:[x(109),vu],bangIdentifier:[x(289),vu],bangArguments:[ye,2],bangOperand:[w(ne(()=>f(1).image!==`@`,289),S(...Su),S(...Cu),S(...wu)),1],structureOperator:[w(102,104,89,le,ne(()=>f(1).image===`@`,289)),1]},P=Object.keys(Ne),Pe=P.map(()=>[{generation:0,first:void 0,amount:0}]),Fe=(e,t,n)=>(a.remaining=n,a.scanPosition=t,a.lastPosition=t,a.isSucceeded=!1,e()),F=e=>{let t=Ne[e][1],n=Fe(Ne[e][0],i.token,t),r=Pe[P.indexOf(e)],o=r.find(e=>e.generation<=i.generation)??r[r.push({generation:0,first:void 0,amount:0})-1];return o.generation=i.generation+t-a.remaining,o.first=i.token,o.amount=t,n},Ie=(e,t)=>t===0?[]:e.kind===0?[`<EOF>`]:[e.image,...Ie(d(e),t-1)],Le=(e=-1)=>{a.longestExpected=+(e>=0||i.expectedGeneration===i.generation),a.endPosition=0,a.isRescanning=!0,Object.values(Ne).forEach((e,t)=>{for(let n of Pe[t])if(!(n.generation<=i.generation||n.first===void 0)&&(Fe(e[0],n.first,n.amount),a.isSucceeded))break}),a.isRescanning=!1,y(0);let t=d(i.token);return v(`Encountered "${Ie(t,a.longestExpected).join(` `)}" at line ${t.beginLine}, column ${t.beginColumn} and token "${gu(i.token.image)}" `)},I=()=>(d(i.token),i.nextKind=-1,Le()),L=e=>{let t=i.token;if(i.token=d(i.token),i.nextKind=-1,i.token.kind===e)return i.generation++,i.token;throw i.token=t,Le(e)},Re=e=>{if(e.includes(p()))return L(p());throw m(),I()},R=(e,t=e.kind)=>({kind:t,image:e.image,location:[e.beginLine,e.beginColumn,e.endLine,e.endColumn],heirs:[]}),z=(e,...t)=>{let n=t.flatMap(e=>e??[]),r=[vu,vu,yu,yu];for(let e of n)(e.location[0]<r[0]||e.location[0]===r[0]&&e.location[1]<r[1])&&(r[0]=e.location[0],r[1]=e.location[1]),(e.location[2]>r[2]||e.location[2]===r[2]&&e.location[3]>r[3])&&(r[2]=e.location[2],r[3]=e.location[3]);return{kind:e,image:e,location:r,heirs:n}},ze=()=>z(`IdPrefix`),B=e=>c.push(e),V=()=>{let e=c.lastIndexOf(void 0)+1;if(e!==c.length)return c.splice(e).filter(e=>e!==void 0)},H=e=>{c.push(void 0),s.push({name:e,token:f(1)}),i.expecting=``},U=()=>{s.pop(),c.pop(),i.expecting=``},Be=(e,t)=>{H(e);let n=t();return U(),n},Ve=(e,t)=>Be(e,()=>{let e=t();return z(e,V())}),He=e=>{Wu(e)&&(e.kind=289)},Ue=()=>{let e=[i.token,d(i.token)];for(;;){let t=e[e.length-1],n=d(t);if([0,67,58,41,37].includes(n.kind)||t.kind===67||t.kind===58)return;if(t.kind===93)break;e.push(n)}let t=Uu(e,e.length-2);if(t<=0||e[t-1].kind===96)return;let n=e[t];e[t-1].next={kind:96,image:`Beginning of definition`,beginLine:n.beginLine,beginColumn:n.beginColumn,endLine:n.endLine,endColumn:n.endColumn,next:n}},We=(e,t)=>i.operatorStack?.push({node:e,operator:t}),Ge=()=>i.operatorStack??[],Ke=e=>Ge()[e].node??z(`Missing`),qe=e=>{let t=Ge(),n=t.length-1;if(n<3)return;let r=Ke(n-2),i=Ke(n-3),a=Ke(n-1);t.splice(n-2,2);let o=e.fix===`nfix`&&i.kind===`Times`?z(`Times`,i.heirs,[r,a]):z(e.fix===`nfix`?`Times`:`InfixExpr`,[i,r,a]);t[n-3]={node:o,operator:void 0}},Je=()=>{let e=Ge(),t=e.length-1;if(t<2)return;let n=z(`PrefixExpr`,[Ke(t-2),Ke(t-1)]);e.splice(t-1,1),e[t-2]={node:n,operator:void 0}},Ye=()=>{let e=Ge(),t=e.length-1;if(t<2)return;let n=Ke(t-1),r=e[t-1].operator===Fu?z(`FcnAppl`,[Ke(t-2)],n.heirs):z(`PostfixExpr`,[Ke(t-2),n]);e.splice(t-1,1),e[t-2]={node:r,operator:void 0}},Xe=()=>{let e=Ge();for(;;){let t=e.length-1,n=e[t],r=n.operator;if(r===void 0)return;let i=_(n.node??z(`Missing`));if(r.fix===`postfix`){if(t===0)throw v(`\n Encountered postfix op ${r.name} in block ${i} on empty stack`);let n=e[t-1];if(n.operator!==void 0){if(Ru(n.operator)||n.operator.fix===`prefix`)throw v(`\n Encountered postfix op ${r.name} in block ${i} following prefix or infix op ${n.operator.name}.`);Ye()}else{if(t<=1)return;let n=e[t-2].operator;if(n===void 0)throw v(`Expression at location ${_(Ke(t-2))} and expression at location ${_(Ke(t-1))} follow each other without any intervening operator.`);if(zu(n,r))Ru(n)?qe(n):Je();else if(Bu(n,r))return;else throw v(`Precedence conflict between ops ${n.name} in block ${i} and ${r.name}.`)}}else if(r.fix===`prefix`){if(t===0)return;let n=e[t-1];if(n.operator===void 0)throw v(`\n Encountered prefix op ${r.name} in block ${i} following an expression.`);if(n.operator.fix===`postfix`)throw v(`\n Encountered prefix op ${r.name} in block ${i} following postfix op ${n.operator.name}.`);return}else if(t===0){if(Lu(r)===void 0)throw v(`\n Encountered infix op ${r.name} in block ${i} on empty stack.`);return}else{let n=e[t-1];if(n.operator!==void 0){let e=n.operator;if(Ru(e)||e.fix===`prefix`){let n=Lu(r),i=_(Ke(t-1));if(n===void 0)throw v(r===Iu?`\n Missing expression in block ${i} following prefix or infix op ${e.name}.`:`\n Encountered infix op ${r.name} in block ${i} following prefix or infix op ${e.name}.`);if(zu(e,n)||e===n&&e.associativity===`left`)throw v(`\n Precedence conflict between ops ${e.name} in block ${i} and ${n.name}.`)}else Ye()}else{if(t<=1)return;let n=e[t-2];if(n.operator===void 0)throw v(`Expression at location ${_(Ke(t-2))} and expression at location ${_(Ke(t-1))} follow each other without any intervening operator.`);let i=Lu(n.operator),a=i!==void 0&&(t===2||e[t-3].operator!==void 0)?i:n.operator,o=_(Ke(t-2));if(zu(a,r)||a===r&&a.associativity===`left`){if(Ru(a))qe(a);else if(a.fix===`prefix`)Je();else if(Ke(t-2).location[0]<Ke(t-1).location[0]&&r.name===`=`)throw v(`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${a.name} in block ${o} and ${r.name}.`);else if(r===Iu)throw v(`\n Error following expression at ${o}, missing operator or separator.`);else throw v(`\n Illegal combination of operators ${a.name} in block ${o} and ${r.name}.`)}else if(Bu(a,r)||a===r&&a.associativity===`right`)return;else throw v(`\n Precedence conflict between ops ${a.name} in block ${o} and ${r.name}.`)}}if(t===e.length-1)return}},Ze=()=>{We(void 0,Iu),Xe();let e=Ge();if(e.length===2)return e[0].node;n.push(`Couldn't properly parse expression${e.slice(0,Math.max(e.length-1,1)).map((e,t)=>`-- incomplete expression at ${_(Ke(t))}.\n`).join(``)}`)},Qe=(e,t)=>{let n=Ge(),r=n.at(-1);if(r===void 0)throw v(`\n \`\`.'' has no left hand side at ${_(e)}.`);if(r.operator!==void 0){if(r.operator.fix!==`postfix`||n[n.length-2].operator!==void 0)throw v(`\n \`\`.'' follows operator ${_(r.node??z(`Missing`))}.`);n.push({node:void 0,operator:void 0}),Ye(),n.pop()}let i=n.length-1;n[i]={node:z(`RecordComponent`,[Ke(i),e,t]),operator:void 0}},$e=e=>{i.fairnessHook=e},et=e=>e===void 0?!1:e.kind===`GeneralId`?e.heirs[0].heirs.length===0:e.kind===`OpApplication`&&e.heirs[1].heirs.filter((e,t)=>t%2==1).every(e=>e.kind===`GeneralId`&&e.heirs[0].heirs.length===0),tt=(e,t)=>{for(let n of e.heirs)if(n.kind!==`ConjList`&&n.kind!==`DisjList`){if(!E(n.location[1]))throw v(`Item at ${_(n)} is not properly indented inside conjunction or disjunction list item at ${_(t)}`);tt(n,t)}},nt=()=>i.proofDepth<0?i.proofDepth:o[i.proofDepth],rt=e=>e.image.length<2?!1:e.image[1]===`*`?i.proofDepth<0:e.image[1]===`+`?!0:[290,293,294,292].includes(e.kind)?i.proofDepth<0||o[i.proofDepth]>=0&&Gu(e)>o[i.proofDepth]:[63,75,71,72].includes(e.kind),it=e=>{let t=Gu(e),n=i.proofDepth>0?o[i.proofDepth-1]:-1;return t===-1?(o[i.proofDepth]<0&&(o[i.proofDepth]=n+1),!0):o[i.proofDepth]>=0?t!==-2&&o[i.proofDepth]===t:(o[i.proofDepth]=t===-2?n+1:t,t===-2||t>n)},W=()=>R(L(289)),G=e=>B(R(L(e))),at=(e,t)=>{let n=Re(e);return i.lastOperator=Pu.get(n.image),R(n,t)},ot=()=>{H(`Infix Op`);let e=Re(Cu);return i.lastOperator=Pu.get(e.image),U(),R(e,`InfixOp`)},st=()=>{let e=Re(wu);return i.lastOperator=Pu.get(e.image),R(e,`PostfixOp`)},ct=()=>at(Su,`NonExpPrefixOp`),lt=()=>{H(`Module definition`),i.expecting=`---- MODULE`;let e=ut();i.expecting=`EXTENDS clause or module body`;let t=dt();i.expecting=`Module body`;let n=pt();i.expecting=`==== or more Module body`;let r=z(`EndModule`,[R(L(37))]);return U(),z(`Module`,[e,t,n,r])},ut=()=>{H(`Begin module`),i.expecting=`---- MODULE (beginning of module)`;let e=R(Re([35,3,21]));i.expecting=`Identifier`,He(f(1));let t=W();i.moduleName??=t.image,i.expecting=`----`;let n=R(L(36));return U(),z(`BeginModule`,[e,t,n])},dt=()=>{if(H(`Extends`),g(48))for(G(48),i.expecting=`Identifier`,He(f(1)),B(W()),i.expecting=`comma or module body`;g(88);)G(88),i.expecting=`Identifier`,He(f(1)),B(W());let e=V();return U(),z(`Extends`,e)},ft=()=>{let e=p();if(e===36)return R(L(36));if(e===85)return mt();if(e===44)return ht();if(m(),F(`unitDefinition`))return bt();if(p()===79)return gt();if(m(),F(`unitInstance`))return Et();if(F(`unitAssumption`))return kt();if(F(`unitTheorem`))return Nt();if([35,3,21].includes(p())){let e=lt();return Ue(),e}if(m(),f(1).kind===68&&f(2).kind!==64||f(1).kind===69)return It();throw I()},pt=()=>{for(H(`Module body`),i.expecting=`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`;F(`moduleUnit`);)B(ft());let e=V();return U(),z(`Body`,e)},mt=()=>{H(`variable declaration`);let e=R(L(85));for(i.expecting=`Identifier`,B(W()),i.expecting=`comma or module body`;g(88);)G(88),i.expecting=`Identifier`,B(W());let t=V();return U(),z(`VariableDeclaration`,e,t)},ht=()=>{H(`Parameter declaration`),i.expecting=`CONSTANT`,H(`Parameter declaration item`);let e=z(`ConsDecl`,[R(L(44))]);for(U(),B(e),i.expecting=`Identifier, operator or _`,B(vt()),i.expecting=`,`;g(88);)G(88),i.expecting=`Identifier, operator or _`,B(vt());let t=V();return U(),z(`ParamDeclaration`,t)},gt=()=>{for(H(`Recursive`),i.expecting=`RECURSIVE`,G(79),i.expecting=`Identifier, operator or _`,B(vt()),i.expecting=`,`;g(88);)G(88),i.expecting=`Identifier, operator or _`,B(vt()),i.expecting="`,' or `)'";let e=V();return U(),z(`Recursive`,e)},_t=()=>{for(G(94),i.expecting=`_`,G(92),i.expecting=`comma or )`;g(88);)G(88),i.expecting=`_`,G(92),i.expecting=`comma or )`;G(95)},vt=()=>Ve(`Constant declaration items`,()=>{i.expecting=`Identifier, _ or prefix op`;let e=p();if(e===289)return B(W()),i.expecting=`(, comma, or Module Body`,F(`constantArguments`)&&_t(),`IdentDecl`;if(Su.includes(e)){let e=ct();return i.expecting=`_`,B(e),G(92),`PrefixDecl`}if(e!==92)throw m(),I();let t=R(L(92));i.expecting=`prefix or postfix operator`;let n=p();if(Cu.includes(n)){let e=ot();return i.expecting=`_`,B(t),B(e),G(92),`InfixDecl`}if(wu.includes(n)){let e=st();return B(t),B(e),`PostfixDecl`}throw m(),I()}),yt=e=>{let t=R(L(93));Ue(),B(t),i.expecting=e},bt=()=>Ve(`Definition`,()=>{if(i.expecting=`LOCAL, Identifier or Operator Symbol`,g(54)&&G(54),L(96),i.expecting=`LOCAL, Identifier or Operator Symbol`,F(`functionDefinition`)){for(B(W()),i.expecting=`[`,G(97),i.expecting=`Identifier`,B(tn()),i.expecting=`COMMA or ]`;g(88);)G(88),i.expecting=`Identifier`,B(tn());let e=R(L(99));return i.expecting=`==`,B(e),yt(`Expression`),B(J()),`FunctionDefinition`}if(F(`postfixDefinition`)){H(`Postfix LHS`);let e=W(),t=R(Re(wu));return U(),B(z(`PostfixLHS`,[e,t])),i.expecting=`==`,yt(`Expression`),B(J()),`OperatorDefinition`}if(F(`infixDefinition`)){H(`Infix LHS`);let e=W(),t=R(Re(Cu)),n=W();return U(),B(z(`InfixLHS`,[e,t,n])),i.expecting=`==`,yt(`Expression`),B(J()),`OperatorDefinition`}if(F(`identifierDefinition`)){if(B(Ct()),i.expecting=`==`,yt(`Expression or Instance`),F(`definitionBody`))return B(J()),`OperatorDefinition`;if(p()===51)return B(Dt()),`ModuleDefinition`;throw m(),I()}if(!Su.includes(p()))throw m(),I();H(`Prefix LHS`);let e=R(Re(Su));i.expecting=`Identifier`;let t=W();return U(),B(z(`PrefixLHS`,[e,t])),i.expecting=`==`,yt(`Expression`),B(J()),`OperatorDefinition`}),xt=()=>{if(H(`Identifier tuple`),G(102),i.expecting=`Identifier or >>`,g(289))for(B(W()),i.expecting=`COMMA or >>`;g(88);)G(88),i.expecting=`COMMA or >>`,B(W()),i.expecting=`COMMA or >>`;G(104);let e=V();return U(),z(`IdentifierTuple`,e)},St=()=>{let e=p();if(e===289)return wt();if(Au.has(e))return Tt();throw m(),I()},Ct=()=>{if(H(`Identifier LHS`),B(W()),i.expecting=`( or ==`,g(94)){for(G(94),i.expecting=`Identifier Declaration, prefix op, _ or )`,B(St()),i.expecting=`COMMA or )`;g(88);)G(88),i.expecting=`Identifier Declaration, prefix op or _`,B(St()),i.expecting=`COMMA or )`;G(95)}let e=V();return U(),z(`IdentLHS`,e)},wt=()=>{if(H(`Identifier Declation`),B(W()),i.expecting=`( or ...`,g(94)){for(G(94),i.expecting=`_`,G(92),i.expecting=`COMMA or )`;g(88);)G(88),i.expecting=`_`,G(92),i.expecting=`COMMA or )`;G(95)}let e=V();return U(),z(`IdentDecl`,e)},Tt=()=>Ve(`Op. Symbol Declaration`,()=>{let e=p();if(Su.includes(e))return B(ct()),i.expecting=`_`,G(92),`PrefixDecl`;if(e!==92)throw m(),I();G(92),i.expecting=`infix or postfix operator`;let t=p();if(Cu.includes(t))return B(ot()),i.expecting=`_`,G(92),`InfixDecl`;if(wu.includes(t))return B(st()),`PostfixDecl`;throw m(),I()}),Et=()=>{H(`Instance`),i.expecting=`LOCAL or instance`;let e=g(54)?R(L(54)):void 0;B(Dt()),i.expecting=`COMMA or Module Body`;let t=V();return U(),z(`Instance`,e,t)},Dt=()=>{if(H(`NonLocalInstance`),G(51),i.expecting=`Module identifier`,He(f(1)),B(W()),i.expecting=`WITH or another definition.`,g(87))for(G(87),i.expecting=``,B(Ot()),i.expecting=``;F(`nextSubstitution`);)G(88),i.expecting=``,B(Ot()),i.expecting=``;let e=V();return U(),z(`NonLocalInstance`,e)},Ot=()=>{H(`Substitution`);let e=p(),t=e===289?W():Su.includes(e)?ct():Cu.includes(e)?ot():wu.includes(e)?st():void 0;if(t===void 0)throw m(),I();i.expecting=`<-`;let n=R(L(107));i.expecting=`Expression or Op. Symbol`;let r=Zt();return U(),z(`Substitution`,[t,n,r])},kt=()=>{H(`Assumption`),i.expecting=`ASSUM...`,B(R(Re([41,39]))),F(`assumptionName`)&&(g(96)&&L(96),B(W()),i.expecting=`==`,G(93)),Ue(),i.expecting=`Expression`,B(J());let e=V();return U(),z(`Assumption`,e)},At=e=>{if(k())return jt();if(ku.has(p()))return Mt();if(m(),F(e))return J();throw I()},jt=()=>{if(H(`Assume-Prove`),g(289)){B(z(`GeneralId`,[ze(),W()])),G(90),B(jt());let e=V();return U(),z(`Label`,e)}for(B(R(Re([39,40]))),i.expecting=`Expression, Declaration, or AssumeProve`,B(At(`assumeExpression`)),i.expecting="PROVE or `,'";g(88);)G(88),i.expecting=`Expression, Declaration, or AssumeProve`,B(At(`nextAssumeExpression`)),i.expecting="PROVE or `,'";B(R(Re([76,77]))),i.expecting=`Expression`,B(J());let e=V();return U(),z(`AssumeProve`,e)},Mt=()=>{if(H(`NEW symbol declaration`),i.expecting=`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`,F(`constantSymbol`)){if(F(`newConstant`)?(G(56),G(44)):B(R(Re([56,44]))),i.expecting=`Constant declaration`,F(`constantDeclaration`)){let e=wt();if(B(e),g(147)){let t=L(147);if(e.heirs.length>1)throw v(`declared symbol with arguments before \\in at ${_(e)}`);B(R(t)),i.expecting=`Expression`,B(J())}}else if(Au.has(p()))B(Tt());else throw m(),I()}else if(F(`variableSymbol`))g(56)&&G(56),G(85),i.expecting=`Identifier`,B(z(`IdentDecl`,[W()]));else if(F(`levelSymbol`))g(56)&&G(56),B(R(Re([80,38,81]))),i.expecting=`Declaration`,B(St());else throw I();let e=V();return U(),z(`NewSymb`,e)},Nt=()=>{if(H(`Theorem`),i.expecting=`THEOREM, PROPOSITION`,B(R(Re([67,58]))),i.expecting=`Identifier, Assume-Prove or Expression`,F(`theoremName`)&&(B(W()),i.expecting=`==`,G(93)),Ue(),F(`theoremAssumeProve`)){if(!O())throw I();B(jt())}else if(F(`theoremExpression`))B(J());else throw I();rt(f(1))&&B(Pt());let e=V();return U(),z(`Theorem`,e)},Pt=()=>{if(i.proofDepth++,i.proofDepth>=100)throw v(`Proofs nested more than 100deep.`);o[i.proofDepth]=-1;let e=Be(`Proof`,()=>{if(f(1).kind===63||f(2).kind===63)return It();if(F(`terminalProof`)){let e=g(75)?R(L(75)):void 0;return z(`TerminalProof`,e,[R(Re([71,72]))])}if(!F(`stepProof`))throw I();for(F(`proofKeyword`)&&G(75);f(2).kind!==78;)B(Bt()),i.expecting=`a proof step`;return B(Rt()),z(`Proof`,V())});if(i.proofDepth<0)throw v(`Parser bug: an extra QED step found.`);return i.proofDepth--,e},Ft=e=>{if(p()===55)G(55),i.expecting=`identifier`,B(W());else{if(m(),!F(e))throw I();B(J())}},It=()=>{H(`UseOrHideOrBy`);let e=p(),t=e===63||e===75?`TerminalProof`:`UseOrHide`;if(t===`TerminalProof`)g(75)&&G(75),G(63),g(64)&&G(64);else if(e===68)G(68),g(64)&&G(64);else if(e===69)G(69);else throw m(),I();if(i.expecting="an expression, `MODULE' or `DEF'",F(`usedFacts`))for(Ft(`usedExpression`);g(88);)G(88),i.expecting=`MODULE or expression`,Ft(`nextUsedExpression`),i.expecting=t===`TerminalProof`?`comma, DEF, or [.]`:`comma, DEF, or proof step`;if(g(66))for(G(66),i.expecting=`MODULE or expression`,Ft(`definedExpression`);g(88);)G(88),i.expecting=`MODULE or expression`,Ft(`nextDefinedExpression`),i.expecting=t===`TerminalProof`?`comma or [.]`:`comma or proof step`;let n=V();return U(),z(t,n)},Lt=e=>{i.expecting=`Step number`;let t=R(Re(Tu));if(!it(i.token))throw v(`${_(t)}: ${e}`);B(t)},Rt=()=>{H(`QED step`),Lt(`QED step's number has bad level.`),i.expecting=`QED`,B(z(`QEDStep`,[R(L(78))])),rt(f(1))&&B(Pt());let e=V();return U(),z(`ProofStep`,e)},zt=()=>{let e=f(1).kind;if(e===68||e===69)return[It(),!1];if(e===51)return[Dt(),!1];if(e===96||e===65)return[Vt(),!1];let t=p();if(t===70)return[Ht(`HaveStep`,70),!1];if(t===74)return[Wt(),!1];if(t===83)return[Gt(),!1];if(t===82)return[Kt(),!0];if(t===42)return[Ht(`CaseStep`,42),!0];if(m(),F(`assertStep`))return[qt(),!0];throw I()},Bt=()=>{H(`Step`),Lt(`step's number has bad level.`),i.expecting=`proof step`;let e=zt();if(B(e[0]),rt(f(1))){if(!e[1])throw v(`${_(e[0])}: proof of step that does not take a proof.`);B(Pt())}let t=V();return U(),z(`ProofStep`,t)},Vt=()=>{H(`DefStep`),g(65)&&G(65);do B(bt());while(F(`nextDefinition`));let e=V();return U(),z(`DefStep`,e)},Ht=(e,t)=>{H(e),G(t),i.expecting=`expression`,B(J());let n=V();return U(),z(e,n)},Ut=(e,t,n,r)=>{for(B(e()),i.expecting=t;g(88);)G(88),i.expecting=n,B(e()),i.expecting=r},Wt=()=>{if(H(`TakeStep`),G(74),i.expecting=`identifier`,F(`takeBounds`))Ut(tn,`comma or step`,`identifier or tuple of identifiers`,`comma or proof step`);else if(g(289))Ut(W,`comma or proof step`,`identifier`,`comma or proof step`);else throw I();let e=V();return U(),z(`TakeStep`,e)},Gt=()=>{for(H(`WitnessStep`),G(83),i.expecting=`expression`,B(J());g(88);)G(88),i.expecting=`expression`,B(J()),i.expecting=`comma or colon`;let e=V();return U(),z(`WitnessStep`,e)},Kt=()=>{if(H(`PickStep`),G(82),i.expecting=`identifier`,F(`pickIdentifiers`))Ut(W,`comma, or colon`,`identifier`,`comma or colon`);else if(p()===102||p()===289)Ut(tn,`comma or colon`,`identifier or tuple of identifiers`,`comma or colon`);else throw m(),I();G(89),i.expecting=`expression`,B(J());let e=V();return U(),z(`PickStep`,e)},qt=()=>{if(H(`AssertStep`),g(84)&&(G(84),i.expecting=`expression or ASSUME/PROVE`),F(`assertedExpression`))B(J());else if(O())B(jt());else throw I();let e=V();return U(),z(`AssertStep`,e)},Jt=()=>{let e=p();if(e===94)return Qt();if(e===100)return nn();if(e===97)return on();if(e===102)return ln();if(e===59||e===86)return fn();throw m(),I()},K=()=>{let e=p();if(e===47||e===49)return $t();if(e===60||e===61)return en();if(e===50)return pn();if(e===42)return gn();if(e===52)return _n();if(e===43)return xn();throw m(),I()},Yt=()=>{let e=R(L(109));if(!F(`decimalPart`))return z(`Number`,[e]);let t=R(L(91));return z(`Real`,[e,t,R(L(109))])},Xt=()=>{for(H(`Optional Arguments`),G(94),B(Zt());g(88);)G(88),B(Zt());G(95);let e=V();return U(),z(`OpArgs`,e)},Zt=()=>{if(F(`operatorArgument`)&&re()){let e=p();if(Su.includes(e))return z(`GenNonExpPrefixOp`,[ze(),ct()]);if(Cu.includes(e)){let e=ot();if(e.image===`\\X`||e.image===`\\times`)throw v(`${_(e)}: \\X may not be used as an infix operator.`);return z(`GenInfixOp`,[ze(),e])}if(wu.includes(e))return z(`GenPostfixOp`,[ze(),st()]);throw m(),I()}if(F(`lambdaArgument`)&&re())return Sn();if(F(`expressionArgument`))return J();throw I()},Qt=()=>z(`ParenExpr`,[R(L(94)),J(),R(L(95))]),$t=()=>{H(`Quantified form`),B(R(Re([47,49])));let e=F(`unboundQuantifier`);if(e)for(B(W());g(88);)G(88),B(W());else if(p()===102||p()===289)for(B(tn());g(88);)G(88),B(tn());else throw m(),I();G(89),B(J());let t=V();return U(),z(e?`UnboundQuant`:`BoundQuant`,t)},en=()=>{for(H(`Bound Quantified Expression`),B(R(Re([60,61]))),B(W());g(88);)G(88),B(W());G(89),B(J());let e=V();return U(),z(`UnboundQuant`,e)},tn=()=>{H(`Quant Bound`);let e=p();if(e===102)B(xt());else if(e===289)for(B(W());g(88);)G(88),B(W()),i.expecting=`, or \\in`;else throw m(),I();G(147),B(J());let t=V();return U(),z(`QuantBound`,t)},nn=()=>Ve(`Some { } form`,()=>{G(100);let e=F(`setContents`)?q():`SetEnumerate`;return G(101),e}),q=()=>{if(ie()){let e=p(),t=e===102?xt():e===289?W():void 0;if(t===void 0)throw m(),I();i.expecting=`\\in`;let n=R(L(147)),r=J();if(i.expecting=`':', ',' or '}'`,p()===89){let e=R(L(89));return B(t),B(n),B(r),B(e),B(J()),`SubsetOf`}if(B(z(`InfixExpr`,[z(`GeneralId`,[ze(),t]),z(`GenInfixOp`,[ze(),n]),r])),p()!==88)return m(),`SetEnumerate`;do G(88),B(J());while(g(88));return`SetEnumerate`}if(F(`setEnumeration`)){for(B(J());g(88);)G(88),B(J());return`SetEnumerate`}if(F(`setOfAll`)){for(B(J()),G(89),B(tn());g(88);)G(88),B(tn());return`SetOfAll`}if(!F(`setExpression`))throw I();let e=J();B(e);let t=p();if(t===89){let t=L(89);if(e.heirs.length>1&&e.kind===`InfixExpr`&&e.heirs[1].heirs[1].image===`\\in`)throw v(`Form {a \\in b : c \\in d }, at line ${t.beginLine}, is not allowed`);for(B(R(t)),B(tn());g(88);)G(88),B(tn());return`SetOfAll`}if(t!==88)return m(),`SetEnumerate`;do G(88),B(J());while(g(88));return`SetEnumerate`},rn=e=>{for(B(e());g(88);)G(88),B(e());G(99)},an=(e,t,n)=>()=>{H(e);let r=W(),i=R(L(n)),a=J();return U(),z(t,[r,i,a])},on=()=>Ve(`Some [] Form`,()=>{if(G(97),ie()){for(B(tn());g(88);)G(88),B(tn());return G(108),B(J()),G(99),`FcnConst`}if(F(`recordFields`))return rn(an(`Field Value`,`FieldVal`,108)),`RcdConstructor`;if(f(2).kind===108&&Wu(f(1)))return f(1).kind=289,rn(an(`Field Value`,`FieldVal`,108)),`RcdConstructor`;if(F(`recordSets`))return rn(an(`Field Set`,`FieldSet`,89)),`SetOfRcds`;if(!F(`bracketExpression`))throw I();B(J());let e=p();if(e===88||e===99){for(;g(88);)G(88),B(J());return G(99),i.lastOperator=Fu,`FcnAppl`}if(e===106)return G(106),B(J()),G(99),`SetOfFcns`;if(e===46){for(G(46),B(sn());g(88);)G(88),B(sn());return G(99),`Except`}if(e===98)return G(98),B(dn()),`ActionExpr`;throw m(),I()}),sn=()=>{H(`Except Spec`),G(105);do B(cn()),i.expecting=`= or ,`;while(p()===91||p()===97||m());G(185),B(J());let e=V();return U(),z(`ExceptSpec`,e)},cn=()=>{H(`Except Component`);let e=p();if(e===91){G(91),He(f(1));let e=W();e.image===`@`&&n.push(`@ used in !.@`),B(e)}else if(e===97){for(G(97),B(J());g(88);)G(88),B(J());G(99)}else throw m(),I();let t=V();return U(),z(`ExceptComponent`,t)},ln=()=>Ve(`Some << -- >> or >>_ Form`,()=>{if(G(102),F(`tupleContents`))for(B(J());g(88);)G(88),B(J());let e=p();if(e===104)return G(104),`Tuple`;if(e===103)return G(103),B(dn()),`ActionExpr`;throw m(),I()}),un=()=>{let e=W(),t=F(`identifierArguments`)?Xt():void 0;if(g(105)){let n=R(L(105));return B(z(`IdPrefixElement`,[e],t,[n])),un()}return $e(t),z(`GeneralId`,[z(`IdPrefix`,V()),e])},dn=()=>{H(`restricted form of expression`);let e=p(),t=e===289?un():e===94?Qt():e===100?nn():e===97?on():e===102?ln():void 0;if(t===void 0)throw m(),I();return U(),t},fn=()=>{$e(void 0),H(`Fairness Expression`);let e=R(Re([86,59])),t=dn(),r=`${e.location[0]}`;if(F(`fairnessArguments`)){let a=R(L(94)),o=J(),s=R(L(95));return U(),t.kind===`GeneralId`&&i.fairnessHook!==void 0?z(`FairnessExpr`,[e,z(`OpApplication`,[t,i.fairnessHook]),a,o,s]):ju.has(String(t.kind))?z(`FairnessExpr`,[e,t,a,o,s]):(n.push(`Error in fairness expression at ${r}: ${e.location[1]}: could not link arguments\n`),t)}if(U(),i.fairnessHook===void 0)throw v(`Ill-structured fairness expression at line ${r}, column ${e.location[1]}`);let a=i.fairnessHook.heirs;return a.length===3?z(`FairnessExpr`,[e,t,...a]):(n.push(`Error in fairness expression at ${r}: ${e.location[1]}\n`),t)},pn=()=>{H(`IF THEN ELSE`);let e=[R(L(50)),J(),R(L(62)),J(),R(L(45)),J()];return U(),z(`IfThenElse`,e)},mn=()=>{let e=f(1);return e.kind===121&&E(e.beginColumn)},hn=(e,t,n)=>{H(e);let r=[n(),R(L(106)),J()];return U(),z(t,r)},gn=()=>{for(H(`CASE Expression`),G(42),B(hn(`Case Arm`,`CaseArm`,J));mn()&&f(2).kind!==57;)G(121),B(hn(`Case Arm`,`CaseArm`,J));mn()&&(G(121),B(hn(`Case Other Arm`,`OtherArm`,()=>R(L(57)))));let e=V();return U(),z(`Case`,e)},_n=()=>{H(`Case Other Arm`);let e=[R(L(52)),vn(),R(L(53)),J()];return U(),z(`LetIn`,e)},vn=()=>{H(`Let Definitions`);do{let e=p();if(e===54||e===96)B(bt());else if(e===79)B(gt());else throw m(),I()}while([54,79,96].includes(p())||m());let e=V();return U(),z(`LetDefinitions`,e)},yn=e=>{H(`Junction Item`);let t=R(Re([132,129])),n=J();U();let r=z(e,[t,n]);return tt(n,r),r},bn=()=>{let e=f(1);return l.push({isConjunction:e.kind===129,column:e.beginColumn}),Ve(`AND-OR Junction`,()=>{let e=F(`disjunctionList`)?`DisjList`:F(`conjunctionList`)?`ConjList`:void 0;if(e===void 0)throw I();let t=e===`DisjList`?`DisjItem`:`ConjItem`;for(B(yn(t));D();)B(yn(t));return l.pop(),e})},xn=()=>{H(`(Un)Bounded Choose`);let e=R(L(43)),t=p(),n=t===289?W():t===102?xt():void 0;if(n===void 0)throw m(),I();H(`Domain binding`),g(147)&&(G(147),i.expecting=`Expression`,B(J()));let r=z(`MaybeBound`,V());U();let a=[e,n,r,R(L(89)),J()];return U(),z(`UnboundOrBoundChoose`,a)},Sn=()=>{H(`Lambda`),G(73),i.expecting=`Identifier`,Ut(W,"`,' or `:'",`Identifier`,"`,' or `:'"),G(89),i.expecting=`Expression`,B(J());let e=V();return U(),z(`Lambda`,e)},Cn=(e,t)=>{We(z(e,[ze(),t]),i.lastOperator),Ge().length!==1&&Xe()},wn=()=>{let e=p();if(xu.includes(e))return Cn(`GenPrefixOp`,at(xu,`PrefixOp`));if(Cu.includes(e))return Cn(`GenInfixOp`,ot());throw m(),I()},J=()=>{for(H(`Expression`),i.operatorStack=[],u.push(i.operatorStack);F(`leadingOperator`)&&re();)wn();if(F(`openExpression`)&&re())We(K());else if(re())Tn();else throw I();U();let e=Ze();if(e===void 0)throw v(` Couldn't reduce expression stack.`);return u.pop(),i.operatorStack=u.at(-1),e},Tn=()=>{if(H(`ExtendableExpr`),F(`junctionList`)&&A())We(bn());else if(Ou.has(p()))We(Jt());else{if(m(),!F(`primitiveExpression`))throw I();We(On())}for(;F(`expressionSuffix`);)if(F(`postfixSuffix`)&&re())Cn(`GenPostfixOp`,st());else if(F(`recordSuffix`)&&re()){let e=R(L(91));if(He(f(1)),!re())throw I();Qe(e,W())}else if(F(`applicationSuffix`)&&re()){i.expecting=`function argument`;let e=on();[`GenPrefixOp`,`GenNonExpPrefixOp`,`GenInfixOp`,`GenPostfixOp`,`FcnAppl`].includes(String(e.kind))?(We(e,i.lastOperator),Ge().length!==1&&Xe()):We(e)}else throw I();if(F(`expressionContinuation`)){if(F(`infixContinuation`)&&re()){for(Cn(`GenInfixOp`,ot());F(`nextLeadingOperator`)&&re();)wn();if(F(`nextOpenExpression`)&&re())We(K());else if(re())Tn();else throw I()}else if(F(`labelContinuation`)&&re()){let e=R(L(90)),t=Ge().at(-1)?.node;if(!et(t))throw v(`\`::' at ${_(e)} does not follow a label.`);Ge().pop();let n=J(),r=Ge().at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&Ge().length>0&&r!==void 0&&i.lastOperator!==void 0&&!Bu(r,i.lastOperator))throw v(`Removing label at ${_(t??z(`Missing`))} would change expression parsing.`);We(z(`Label`,[t??z(`Missing`),e,n]))}else throw I()}U()},En=()=>{let e=Re([290,291]),t=R(e);if(nt()<0&&i.proofDepth<=0)throw v(`${_(t)}: Step number used outside proof.`);if(e.image[1]===`+`)throw v(`${_(t)}: <+> step number used in an expression.`);return t},Dn=()=>{let e=p();if(e===289)return W();if(e===290||e===291)return En();if(Cu.includes(e))return ot();if(wu.includes(e))return st();if(m(),!F(`negativeOperator`))throw I();return ct()},On=()=>Be(`Primitive expression`,()=>{if(F(`stringLiteral`)&&re())return Be(`String`,()=>R(L(110),`String`));if(F(`numberLiteral`)&&re())return Yt();if(!Du.has(p()))throw m(),I();let e=Dn(),t=F(`primitiveArguments`)?Xt():void 0;for(;g(105);)B(kn());let n=V();if(n===void 0){let n=z(`GeneralId`,[z(`IdPrefix`,[]),e]);return t?z(`OpApplication`,[n,t]):n}let r=[z(`IdPrefixElement`,[e],t,[n[0].heirs[0]]),...n.slice(0,-1).map((e,t)=>z(`IdPrefixElement`,e.heirs.slice(1),[n[t+1].heirs[0]]))],i=n[n.length-1].heirs,a=z(`GeneralId`,[z(`IdPrefix`,r),i[1]]);return i.length===2?a:z(`OpApplication`,[a,i[2]])}),kn=()=>{if(H(`Bang Extension`),G(105),F(`bangOperand`)){if(F(`bangIdentifier`)&&f(1).image!==`@`)B(W());else{let e=p();if(Su.includes(e))B(ct());else if(Cu.includes(e))B(ot());else if(wu.includes(e))B(st());else throw m(),I()}F(`bangArguments`)&&B(Xt())}else if(p()===94)B(Xt());else{if(m(),!F(`structureOperator`))throw I();B(An())}let e=z(`IdPrefixElement`,V());return U(),e},An=()=>{let e=Be(`StructOp`,()=>{i.expecting="`<<' , `>>' , `:' , `@' , or number";let e=p();if(e===102||e===104||e===89)return R(L(e),`StructOp`);if(e===109)return Yt();if(m(),f(1).image!==`@`)throw I();return R(L(289),`StructOp`)});if(e.kind===`Real`)throw v(`Illegal structural term at ${_(e)}`);return e.kind===`Number`?z(`StructOp`,[e]):e},jn=()=>{if(Ue(),g(2))for(L(2);;){let e=p();if(e!==20&&e!==289){m();break}L(e)}lt()};try{jn()}catch(e){if(!(e instanceof h))throw e;n.push(e.message)}return n.length===0?void 0:n.join(`
|
|
111
|
+
`)},qu=(e,t)=>{try{return bl(e)}catch(n){if(!(n instanceof p))throw n;let r=Ku(e);throw r===void 0?n:m([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},Ju=(e,t,n)=>new b(`Applying ${e} to the following value,\nwhich is not ${t}:\n${Y(n)}`),Yu=(e,t,n,r)=>new b(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${Y(r)}`),Xu=e=>Ne(e)?bn(e):void 0,Zu=(e,t,n)=>{let r=Z(e,t,n),i=Xu(r);if(!i)throw Ju(n,`a function with a finite domain`,r);return i},Qu=(e,t,n)=>{let r=Z(e,t,n),i=Xu(r);if(!i)throw Yu(t===0?`first`:`second`,n,`bag`,r);return i},$u=(e,t)=>{if(!je(e)||!K(e))throw t();return q(e).elements},ed=e=>e.range.every(e=>typeof e==`number`&&e>0),td=(e,t)=>{let n=e.domain.findIndex(e=>et(e,t));return n===-1?void 0:e.range[n]},nd=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,rd=nd(`BagDiff`,`tlc2.value.impl.Value`,2),id=nd(`SqSubseteq`,`tlc2.value.IBoolValue`,2),ad=nd(`BagUnion`,`tlc2.value.impl.Value`,1),od=nd(`BagOfAll`,`tlc2.value.impl.Value`,2),sd=nd(`BagCup`,`tlc2.value.impl.Value`,2),cd=nd(`BagCardinality`,`tlc2.value.impl.IntValue`,1),ld=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Mr(e)}`;throw Pr(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')`)},ud=(e,t,n)=>{let r=ld(e,n)+ld(t,n);if(Dr(r))throw Or(`${e}+${t}`);return r},dd=(e,t,n,r)=>{let i=td(n,e.domain[t]),a=ld(e.range[t],r);return i===void 0?a:a-ld(i,r)|0},fd=(e,t)=>Nt(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>et(e[0],r));a?a[1]=ud(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),pd=$e([],[]),md=[Cr(`EmptyBag`,pd),Q(`IsABag`,1,e=>{let t=Xu(Z(e,0,`IsABag`));return t!==void 0&&ed(t)}),Q(`BagCardinality`,1,e=>{let t=Z(e,0,`BagCardinality`);return Zu(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Ju(`BagCardinality`,`a bag`,t);return ud(e,n,cd)},0)}),Q(`BagIn`,2,e=>{let t=Z(e,1,`BagIn`),n=td(Zu(e,1,`BagIn`),Z(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Yu(`second`,`BagIn`,`bag`,t);return n>0}),Q(`CopiesIn`,2,e=>{let t=Z(e,1,`CopiesIn`),n=td(Zu(e,1,`CopiesIn`),Z(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Yu(`second`,`CopiesIn`,`bag`,t);return n}),Q(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Qu(e,t,`(+)`);if(!ed(n))throw Yu(t===0?`first`:`second`,`(+)`,`bag`,Z(e,t,`(+)`));return n});return fd(t,sd)}),Q(`\\ominus`,2,e=>{let t=Qu(e,0,`(-)`),n=Qu(e,1,`(-)`);return Nt(t.domain.flatMap((e,r)=>{let i=dd(t,r,n,rd);return i>0?[[e,i]]:[]}))}),Q(`BagUnion`,1,e=>{let t=Z(e,0,`BagUnion`),n=$u(t,()=>Ju(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??pd;let r=n.map(e=>{let n=Xu(e);if(!n)throw new b(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${Y(t)}`);return n});return fd(r,ad)}),Q(`\\sqsubseteq`,2,e=>{let t=Zu(e,0,`\\sqsubseteq`),n=Zu(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>dd(t,r,n,id)<=0)}),wr(`BagOfAll`,2,e=>{let t=Sr(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new b(`The first argument of BagOfAll should be an operator, but instead it is:\n${Y(t.literalBody)}`);let n=Z(e,1,`BagOfAll`),r=Xu(n);if(!r)throw Yu(`second`,`BagOfAll`,`function with a finite domain`,n);return fd(r.domain.map((e,n)=>$e([t.call([e])],[r.range[n]])),od)}),Q(`SubBag`,1,e=>{let t=Z(e,0,`SubBag`);if(!Ne(t))throw new y(`DOMAIN expects a function but received ${Y(t)}`);let n=bn(t),r=Dt(n.range).elements,i=r.find(e=>typeof e!=`number`);if(i!==void 0){let e=typeof r[0]!=`number`;throw new y(`The ${e?`first`:`second`} argument of >= should be an integer, but instead it is:\n${Y(e?r[0]:i)}`)}let a=n.range.filter(e=>typeof e==`number`);if(a.some(e=>e<1))throw new y(`Attempted to apply a function to ${Y(n)}, which is not in its domain`);return Dt(n.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:a[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>$e(e.map(e=>e[0]),e.map(e=>e[1]))))}),Q(`BagToSet`,1,e=>Mn(Zu(e,0,`BagToSet`))),Q(`SetToBag`,1,e=>{let t=Z(e,0,`SetToBag`),n=$u(t,()=>Ju(`BagToSet`,`a function with a finite domain`,t));return $e([...n],n.map(()=>1))})],hd=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,gd=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,_d=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,vd=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,yd=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,bd=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,xd=e=>{if(!Ne(e))return!1;let t=bn(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Sd=(e,t)=>Pr(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Mr(t)}`),Cd=(e,t)=>Pr(e,`Cannot cast tlc2.value.impl.${Mr(t)} to tlc2.value.impl.StringValue`),wd=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Td=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Sd(t,e);return`[${q(e).elements.map(e=>Dd(e,t)).join(`,`)}]`},Ed=(e,t)=>{let n=bn(e),r=mn(n);return r?`[${r.map(e=>Dd(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${wd(typeof e==`string`?e:Y(e))}:${Dd(n.range[r],t)}`).join(`,`)}}`},Dd=(e,t)=>typeof e==`string`?wd(e):typeof e==`object`?e.kind===`ModelValue`?wd(e.name):je(e)?Td(e,t):Ed(e,t):String(e),Od=e=>{if(je(e))return Td(e,hd);if(!Ne(e)||xd(e))throw Sd(hd,e);return Ed(e,hd)},kd=e=>{if(!Ne(e))throw Sd(gd,e);return Ed(e,gd)},Ad=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))},jd=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Be(e);if(Array.isArray(e))return Ut(e.map(e=>jd(e,t)));if(typeof e==`object`&&e)return Wt(Object.entries(e).map(([e,n])=>[Be(e),jd(n,t)]));throw Pr(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Md=(e,t)=>{if(e.trim()===``)return jd(null,t);try{return jd(JSON.parse(e,(e,t,n)=>typeof t==`number`?Ad(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Pr(t,e.message):e}},Nd=(e,t)=>{if(typeof e!=`string`)throw Cd(t,e);return e},Pd=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Pr(n,`${t} (No such file or directory)`);return r},Fd=e=>[Tr(`ToJson`,1,e=>Be(Dd(Z(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Tr(`ToJsonArray`,1,e=>Be(Od(Z(e,0,`ToJsonArray`)))),Tr(`ToJsonObject`,1,e=>Be(kd(Z(e,0,`ToJsonObject`)))),Tr(`JsonSerialize`,2,t=>{let n=Nd(Z(t,0,`JsonSerialize`),_d),r=Z(t,1,`JsonSerialize`);if(!mn(r)&&!xd(r))throw new b(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${Y(r)}`);return e.writeFile?.(n,Dd(r,_d)),!0}),Tr(`ndJsonSerialize`,2,t=>{let n=Nd(Z(t,0,`ndJsonSerialize`),vd),r=Z(t,1,`ndJsonSerialize`),i=mn(r);if(!i)throw new b(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${Y(r)}`);return e.writeFile?.(n,i.map(e=>`${Dd(e,vd)}\n`).join(``)),!0}),Tr(`JsonDeserialize`,1,t=>{let n=Nd(Z(t,0,`JsonDeserialize`),yd);return Md(Pd(e,n,yd),yd)}),Tr(`ndJsonDeserialize`,1,t=>{let n=Nd(Z(t,0,`ndJsonDeserialize`),bd);return Ut(Pd(e,n,bd).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Md(e,bd)))})],Id=(e,t,n,r)=>new b(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),Ld=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Id(t,n,`nonnegative integer`,Y(e));return e},Rd=(e,t,n,r)=>{if(!je(e)||!K(e))throw Id(t,n,r,Y(e));return q(e).elements},zd=(e,t,n,r)=>Dt(Array.from({length:t},()=>Dt(e.filter(()=>r.nextDouble()<n)))),Bd=(e,t)=>{let n=`RandomSetOfSubsets`,r=Ld(Z(e,0,n),`first`,n),i=Ld(Z(e,1,n),`second`,n),a=Rd(Z(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw Id(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw Id(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return zd(a,r,a.length===0?0:i/a.length,t.getRandom())},Vd=e=>[Tr(`RandomSubset`,2,t=>{let n=Z(t,0,`RandomSubset`);if(typeof n!=`number`)throw Id(`first`,`RandomSubset`,`nonnegative integer`,Y(n));if(n<0)throw new y(`Attempted to apply the operator overridden by the Java method\npublic static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value),\nbut it produced the following error:\n${n}`);let r=Z(t,1,`RandomSubset`);if(!je(r)||!sn(r)&&!K(r))throw Id(`second`,`RandomSubset`,`a finite set`,Y(r));return Dt(Ql(n,r,e.getRandom()))}),Tr(`RandomSetOfSubsets`,3,t=>Bd(t,e)),Tr(`TestRandomSetOfSubsets`,3,t=>Ut(Array.from({length:5},()=>q(Bd(t,e)).elements.length)))],Hd=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Ud=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Hd})`,Wd=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Hd}) throws java.io.IOException`,Gd=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Hd})`,Kd=()=>Wt([[`action`,Dt([])],[`state`,Dt([])]]),qd=()=>Wt([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Jd=e=>Wt([[`name`,e??`UnnamedAction`],[`location`,qd()]]),Yd=(e,t)=>{let n=e.map((e,t)=>Ut([t+1,Wt(Object.entries(e.state))])),r=n.slice(1).map((t,r)=>Ut([n[r],Jd(e[r+1].action),t])),i=t?[Ut([n[n.length-1],Jd(t.action),n[t.start]])]:[];return Wt([[`action`,Dt([...r,...i])],[`state`,Dt(n)]])},Xd=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return ru(e).get(t)},Zd=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),Y(r));else throw new b(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${Y(n)}`)},Qd=e=>e.every(e=>e!==void 0),$d=(e,t)=>Wt(t.variables.map((t,n)=>[t,e[n]])),ef=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!X(e)){if(t.variableIndex.has(r))return!0;let e=Xo(r,t);if(e&&!n.has(e)&&(n.add(e),ef(e.body,t,n)))return!0}return ur(e).some(e=>ef(e,t,n))},tf=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[Q(`AssertEq`,2,t=>{let n=Z(t,0,`AssertEq`),r=Z(t,1,`AssertEq`),i=et(n,r);return i||(e(Y(`Assertion failed`,!0)),e(Y(n,!0)),e(Y(r,!0))),i}),Vr(`AssertError`,2,e=>{let t=Sr(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw Pr(Ud,`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=Hr(e,0,`AssertError`)();try{Hr(e,1,`AssertError`)()}catch(e){if(e instanceof y)return e.message===n;throw e}return!1}),Tr(`TLCGetOrDefault`,2,e=>{let n=Z(e,0,`TLCGetOrDefault`);return Xd(t,n)??Z(e,1,`TLCGetOrDefault`)}),{...wr(`TLCGetAndSet`,4,n=>{let r=Z(n,0,`TLCGetAndSet`),i=Xd(t,r)??Z(n,3,`TLCGetAndSet`),a=Sr(n,1,`TLCGetAndSet`);return Zd(t,e,r,a.call([i,Z(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Tr(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!Qd(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Pr(Wd,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Ut(t.getBehavior(r).map(e=>$d(e,n.environment)))}),Tr(`CounterExample`,0,()=>t.counterExample??Kd()),Q(`ToTrace`,1,e=>{let t=Z(e,0,`ToTrace`);if(!Ne(t)||!et(Mn(t),Dt([`action`,`state`])))throw new y(`The argument of ToTrace should be a CounterExample, but instead it is:\n${Y(t)}`);let n=q(An(t,`state`)).elements.map(e=>mn(e)??[]);return Ut(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),Q(`TLCModelValue`,1,e=>{let t=Z(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new b(`The argument of ModelValue should be a string, but instead it is:\n${Y(t)}`);return Ze(t)}),Vr(`TLCDefer`,1,()=>!0),Q(`TLCNoOp`,1,e=>Z(e,0,`TLCNoOp`)),Vr(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!Qd(r))throw Pr(Gd,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||Yo(Hr(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new T(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Vr(`TLCCache`,2,(e,t)=>{let r=Sr(e,0,`TLCCache`),a=$n(Hr(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=ef(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,Ll([Z(e,0,`TLCFP`)])))),Tr(`TLCEvalDefinition`,1,(e,t)=>{let n=Z(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?Xo(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new b(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${Y(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new b(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return sc({kind:`Identifier`,name:n,location:r.location},t)})]},nf=(e,t)=>[Tr(`_Track`,2,e=>{let n=String(Z(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,Z(e,0,`_Track`)===!0?r+1:r),!0}),Tr(`_Counts`,0,()=>nu(t)),Tr(`_CheckName`,1,n=>{let r=String(Z(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(Y(nu(t),!0)),!1)}),Tr(`_PrintCounts`,0,()=>(e(Y(nu(t),!0)),!0))],rf=e=>String(e).padStart(2,`0`),af=e=>`${e.getUTCFullYear()}.${rf(e.getUTCMonth()+1)}.${rf(e.getUTCDate())}.${rf(e.getUTCHours())}${rf(e.getUTCMinutes())}${rf(e.getUTCSeconds())}`,of=e=>Nt([...e].map(([e,t])=>[e,Ut([t])])),sf=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),cf=(e,t,n)=>{if(!e.isStarted&&sf.has(t))throw new y(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return Wt([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Wt([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Wt([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Be(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Be(af(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Jd(void 0);case`all`:return of(e.registers);case`all:named`:return of(ru(e))}if(t.startsWith(`s:`)){let n=ru(e).get(t);if(n===void 0)throw new y(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Be(e.properties.get(t.slice(2))??t);throw new y(`TLCGet(${t}) was undefined.`)},lf=e=>e.length===0?[[]]:e.flatMap((t,n)=>lf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),uf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&q(e).elements.forEach(uf),e.kind===`Function`&&e.range.forEach(uf))},df=(t,n)=>[Q(`Print`,2,e=>(t(`${De(Y(Z(e,0,`Print`),!0,!0))} ${De(Y(Z(e,1,`Print`),!0,!0))}`),Z(e,1,`Print`))),Q(`PrintT`,1,e=>(t(De(Y(Z(e,0,`PrintT`),!0,!0))),!0)),Q(`Assert`,2,t=>{if(Z(t,0,`Assert`)!==!0)throw new b(`The first argument of Assert evaluated to FALSE; the second argument was:\n${De(Y(Z(t,1,`Assert`)))}`,e.assertViolation);return!0}),Q(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),Q(`:>`,2,e=>Nt([[Z(e,0,`:>`),Z(e,1,`:>`)]])),Q(`@@`,2,e=>{let t=xr(e,0,`@@`),n=xr(e,1,`@@`);return Pt([...Le(t),...Le(n)])}),Q(`ToString`,1,e=>Be(Y(Z(e,0,`ToString`),!0))),Q(`TLCEval`,1,e=>{let t=Z(e,0,`TLCEval`);return uf(t),t}),Q(`Permutations`,1,e=>{let t=yr(e,0,`Permutations`);return Dt(lf(t).map(e=>Nt(t.map((t,n)=>[t,e[n]]))))}),wr(`SortSeq`,2,e=>{let t=Sr(e,1,`SortSeq`);return Ut(br(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)]},[]))}),Tr(`TLCGet`,1,(e,t)=>{let r=Z(e,0,`TLCGet`);if(typeof r==`number`&&r>=0){let e=n.registers.get(r);if(e===void 0)throw new y(`TLCGet(${r}) was undefined.`);return e}if(typeof r!=`string`)throw new y(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${Y(r)}`);return cf(n,r,t?.state)}),Tr(`TLCSet`,2,e=>{let r=Z(e,0,`TLCSet`);return Zd(n,t,r,Z(e,1,`TLCSet`)),!0}),Cr(`Any`,qe),Q(`RandomElement`,1,e=>eu(_r(e,0,`RandomElement`),n.getRandom()))],ff=/* @__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(`,`),pf=[[`\\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`,`≀`],[`^+`,`⁺`]],mf=/* @__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(`,`),hf=/* @__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(`.`),gf=/* @__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(`.`),_f=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
94
112
|
Nat == { }
|
|
95
113
|
a+b == {a, b}
|
|
96
114
|
a-b == CHOOSE n : b + n = a
|
|
@@ -406,8 +424,15 @@ _CheckName(name) ==
|
|
|
406
424
|
=> (PrintT(counts) /\\ FALSE)
|
|
407
425
|
_PrintCounts == PrintT(_Counts)
|
|
408
426
|
=============================================================================
|
|
409
|
-
`]]),hu=/* @__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)`]])]]),gu=(e,t)=>e.every(e=>V(e,t)),_u=gt([!1,!0]),vu=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return xt(vu(e,t,r),vu(e,r,n))},yu=[`\\cup`,`\\cap`,`\\`],bu=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),xu=e=>typeof e==`object`&&e.kind===`MixedSet`,Su=e=>e.kind===`Interval`?z(e).elements:e.elements,Cu=(e,t,n)=>{let r=Su(t);if(e!==`\\cup`){let t=e===`\\cap`;return _t(r.filter(e=>V(e,n)===t))}if(r.length===0)return n;if(!bu(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=z(n).elements.filter(e=>!V(e,t));return _t([...r,...i])},wu=[qn(`TRUE`,!0),qn(`FALSE`,!1),qn(`BOOLEAN`,_u),qn(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Xn(`=`,mt),Xn(`#`,(e,t)=>!mt(e,t)),G(`~`,1,e=>!zn(e,0,`~`)),G(`<=>`,2,e=>zn(e,0,`<=>`)===zn(e,1,`<=>`)),G(`/\\`,2,e=>zn(e,0,`/\\`)&&zn(e,1,`/\\`)),G(`\\/`,2,e=>zn(e,0,`\\/`)||zn(e,1,`\\/`)),G(`=>`,2,e=>!zn(e,0,`=>`)||zn(e,1,`=>`)),G(`\\in`,2,e=>V(W(e,0,`\\in`),W(e,1,`\\in`))),G(`\\notin`,2,e=>!V(W(e,0,`\\notin`),W(e,1,`\\notin`))),G(`\\subseteq`,2,e=>{let t=Bn(e,0,`\\subseteq`),n=Bn(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&R(t.base)?gu(z(t.base).elements,n.base):gu(z(t).elements,n)}),...yu.map(e=>G(e,2,t=>{let n=Bn(t,0,e),r=Bn(t,1,e);return bu(n)&&bu(r)&&!xu(n)&&!xu(r)?e===`\\cup`&&B(n)?r:(e===`\\cup`?xt:e===`\\cap`?bt:yt)(z(n),z(r)):bu(n)?Cu(e,n,r):e!==`\\`&&bu(r)?Cu(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),G(`SUBSET`,1,e=>({kind:`Subset`,base:Bn(e,0,`SUBSET`)})),G(`UNION`,1,e=>{let t=Bn(e,0,`UNION`),n=nt(t)?t.elements.filter(nt):[];if(!nt(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(xu(t)||n.some(xu)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{V(t,e)||e.elements.push(t)})),_t(e.elements)}return n.length===0?vt:vu(n.map(z),0,n.length)}),G(`DOMAIN`,1,e=>{let t=W(e,0,`DOMAIN`);if(!j(t))throw new m(`DOMAIN expects a function but received ${U(t)}`);return sn(t)})],Tu=sr(`DotDot`,`IntervalValue`,2),Eu=sr(`Neg`,`IntValue`,1),Du=[qn(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),cr(`+`,`Plus`,(e,t)=>e+t),cr(`-`,`Minus`,(e,t)=>e-t),cr(`*`,`Times`,(e,t)=>e*t),cr(`^`,`Expt`,(e,t)=>{if(t<0)throw new h(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new h(`0^0 is undefined.`);return e**t}),cr(`\\div`,`Divide`,(e,t)=>{if(t===0)throw new h(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(Zn(n))throw Qn(`${e} \\div ${t}`);return n}),cr(`%`,`Mod`,(e,t)=>{if(t<=0)throw new h(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),ur(`<`,(e,t)=>e<t),ur(`>`,(e,t)=>e>t),ur(`<=`,(e,t)=>e<=t),ur(`>=`,(e,t)=>e>=t),G(`..`,2,e=>({kind:`Interval`,low:or(W(e,0,`..`),Tu),high:or(W(e,1,`..`),Tu)}))],Ou=[qn(`Int`,{kind:`InfiniteSet`,name:`Int`}),G(`-.`,1,e=>{let t=or(W(e,0,`-`),Eu);if(Zn(-t))throw Qn(`-${t}`);return-t})],ku=(e,t,n)=>{let r=W(e,t,n),i=Xt(r);if(!i)throw new h(`${n}\n${U(r)}`);return i},Au=(e,t,n)=>{let r=W(e,t,n);return typeof r==`string`?r:ku(e,t,n)},ju=(e,t,n)=>typeof e==`string`?ke(e.slice(t,n)):L(e.slice(t,n)),Mu=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Nu=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Pu=(e,t)=>{let n=hu.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?ar(e,t):e}):t},Fu=Pu(`Sequences`,[G(`Seq`,1,e=>({kind:`SequenceSet`,base:W(e,0,`Seq`)})),G(`Len`,1,e=>Au(e,0,Mu(``,`Len`)).length),G(`\\o`,2,e=>{let t=Au(e,0,Nu(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=ku(e,1,Nu(`t \\o s`,`sequence`));return L([...t,...n])}let n=W(e,1,`\\o`);if(typeof n!=`string`)throw new h(`${Nu(`t \\o s`,`string`)}\n${U(n)}`);return ke(t+n)}),G(`Append`,2,e=>L([...ku(e,0,Nu(`Append(s, v)`,`sequence`)),W(e,1,`Append`)])),G(`Head`,1,e=>{let t=ku(e,0,Mu(``,`Head`));if(t.length===0)throw new h(`Attempted to apply Head to the empty sequence.`);return t[0]}),G(`Tail`,1,e=>{let t=Au(e,0,Mu(``,`Tail`));if(t.length===0)throw new h(`Attempted to apply Tail to the empty sequence.`);return ju(t,1)}),G(`SubSeq`,3,e=>{let t=Au(e,0,Mu(`first `,`SubSeq`)),n=Rn(e,1,`SubSeq`),r=Rn(e,2,`SubSeq`);if(n>r)return ju(t,0,0);let i=n<1?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new h(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${U(W(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return ju(t,n-1,r)}),Jn(`SelectSeq`,2,e=>{let t=Kn(e,1,`SelectSeq`);return L(ku(e,0,Mu(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new h(`The second argument of SelectSeq should be a operator, but instead it is:\n${U(n)}`);return n}))})]),Iu=Pu(`FiniteSets`,[G(`IsFiniteSet`,1,e=>{let t=W(e,0,`IsFiniteSet`);if(A(t))return Jt(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new m(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${U(t)}\nis a finite set.`:`Attempted to check if the ${ge(t)} ${U(t)} is a finite set.`)}),G(`Cardinality`,1,e=>{let t=W(e,0,`Cardinality`);if(!A(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new h(`Attempted to compute cardinality of the value\n${U(t)}`);return Kt(t)})]),Lu=/* @__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`]]]),Ru=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:Du};case`Integers`:return{extends:[`Naturals`],operators:Ou};case`Sequences`:return{extends:[],operators:Fu};case`FiniteSets`:return{extends:[],operators:Iu};case`TLC`:return{extends:[],operators:Pu(`TLC`,cu(t,n))};case`Randomization`:return{extends:[],operators:Bl(n)};case`_Possible`:return{extends:[],operators:tu(t,n)};case`Json`:return{extends:[],operators:Pl(r)};case`Bags`:return{extends:[],operators:pl};case`TLCExt`:return{extends:[],operators:eu(t,n)};default:return}},zu=`$subexpression`,Bu=(e,t)=>new f(`${e} at line ${t.line}, column ${t.column}`),Vu=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Hu=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Uu=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}},Wu=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Fr(e.bounds),body:e.body,sets:Vu(e.bounds)};case`SetMap`:return{names:Fr(e.bounds),body:e.expression,sets:Vu(e.bounds)};case`SetFilter`:return{names:Pr(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Pr(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}},Gu=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Gu(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Xa(e)){let e=Gu(r,t,n);if(e)return e}},Ku=(e,t,n)=>e.length===0&&n.length>0?n.splice(0,t):e,qu=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Ju=(e,t)=>{let n=e.location,r=qu(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 Bu(`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 Bu(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:zu,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:zu,args:e.args,location:n,resolution:wr},location:n}},Yu=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:wr})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:wr}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:wr};return Ju({...t,params:[...t.params,...r]},a)},Xu=(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 Bu(`Expected an operator name`,n);o.push(c.name),s.push(...c.args);let l=o.join(`!`),u=i?i.find(e=>_i(e)===l):t(l);if(u)return{definition:u,args:Ku(s,kr(u),r)};a.index++}throw Bu(`Unknown operator ${o.join(`!`)}`,n)},s=t=>{let r=o(t),s=r.definition,c=kr(s),l=a.index===e.length-1;if(r.args.length!==c&&r.args.length!==0)throw Bu(`The operator ${s.name} requires ${c} arguments`,n);if(l)return{definition:s,args:r.args};if(s.kind!==`Operator`)throw Bu(`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&&Gu(a.current,t.name,[]);if(!o)throw Bu(`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(...Ku(t.args,o.label.params.length,r)),a.current=o.label.body,a.index++}},l=t=>{let o=a.current;if(!o)throw Bu(`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`||Hu(t.operand,1)!==0)throw Bu(`A LET/IN expression has only one operand`,n);i.lets.push(o.definitions),a.current=o.body;return}let s=Wu(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(...Ku(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[Hu(t.operand,r.length)],s=e[a.index+1];if(!i||s?.kind!==`Operand`)throw Bu(`A subexpression of CASE must have the form !i!j`,n);a.index++;let c=Hu(s.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw Bu(`Nonexistent CASE operand`,n);a.current=l;return}if(t.kind!==`Operand`)throw Bu(`Unexpected subexpression selector`,n);let c=s?s.sets:Uu(o),u=c?.[Hu(t.operand,c.length)];if(!u)throw Bu(`Nonexistent operand specified by the selector`,n);a.current=u},u=s(void 0);if(u)return Yu(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 Bu(`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 Yu(e.definition,{...i,args:[...i.args,...e.args]});c()}else l(t),a.index++}if(!a.current)throw Bu(`Subexpression selection failed`,n);return Ju(i,a.current)},Zu=(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:[]}))]},Qu=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Xa(e).some(Qu),$u=(e,t)=>{if(!Qu(e))return e;if(e.kind===`Let`){let n=n=>e.definitions.find(e=>e.name===n)??t(n);return bi(e,e=>$u(e,n))}let n=bi(e,e=>$u(e,t));if(n.kind===`Subexpression`)return Xu(n.selectors,t,n.location,[]);let r=n.kind===`Identifier`?n.name:n.kind===`Apply`?n.operator:``,i=Zu(r,t);if(!i)return n;let a=n.kind===`Apply`?[...n.args]:[],o=Xu(i,t,n.location,a);if(a.length>0)throw Bu(`Too many arguments for ${r}`,n.location);return o},ed=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},td=(e,t)=>{let n=ed(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({name:e.name,expression:$u(e.expression,n)}))}},nd=(e,t)=>{let n=ed([...t,...e.definitions]);return e.definitions.some(e=>Qu(e.body))||e.assumptions.some(e=>Qu(e.expression))?{...e,definitions:e.definitions.map(e=>yi(e,e=>$u(e,n))),assumptions:e.assumptions.map(e=>({...e,expression:$u(e.expression,n)}))}:e},rd=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}])),id=(e,t)=>`${e}${t}`,ad=(e,t,n)=>`${e}${t}${n}`,od=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},sd=(e,t,n)=>`${e},${t},${n}`,cd=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),ld=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),ud=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),dd=(e,t,n,r)=>({...cd(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),fd=(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,md=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,{...dd(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),hd=dd(`$Set`,0,[2],[1]),gd=dd(`$Junction`,0,[3],[1]),_d=dd(`$Choose`,0,[2],[1]),vd=dd(`$Function`,0,[3],[1]),yd=dd(`$FcnApply`,0,[2,2],[1,1]),bd=dd(`$RcdSelect`,0,[2,0],[1,1]),xd=dd(`'`,2,[1],[0]),Sd=dd(`ENABLED`,1,[2],[0]),Cd=dd(`[]`,3,[3],[0]),wd=dd(`$SquareAct`,2,[2,1],[0,0]),Td=dd(`$WF`,3,[1,2],[0,0]),Ed=dd(`$TemporalExists`,3,[3],[0]),Dd=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Od=e=>e.map(e=>({name:e,arity:0})),kd=(e,t)=>new f(`${e} at line ${t.line}, column ${t.column}`),Ad=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),jd=e=>e.kind!==`Let`&&e.kind!==`Label`,Md=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=md.get(t)??rd.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=cd(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(ad(e,n,t))}),t.data.constraints.forEach((e,t)=>ld(r.constraints,t,e)),ud(r.argConstraints,id(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>ud(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>fd(e,n))throw new f(`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 f(`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(sd(t,n,r)),s=cd(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)=>ld(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||ld(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>ld(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||ld(s.constraints,t,fd(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=>ld(s.constraints,e,fd(r,a)))}))}),e.argParams.forEach(e=>{let t=od(e),n=a(t.operator)?.operator;n&&ld(s.constraints,t.param,fd(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>ud(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>ud(s.argConstraints,id(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&ud(s.argConstraints,id(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=od(e),n=a(t.operator);n&&ud(s.argConstraints,id(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(od(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=od(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(ad(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(ad(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(ad(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=g(`LAMBDA`,Od(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=cd();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=Dd(n,Od(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 kd(`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 kd(`Action used where only temporal formula or state predicate allowed`,e.location);Ad.has(e.operator)&&l(t,e.location)},d=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&jd(n)&&n.kind!==r)throw kd(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e.location)},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=_(e,n);t.constraints.forEach((e,t)=>ld(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>ud(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 cd();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(gd,n)}case`Prime`:case`Unchanged`:return s(xd,[e.expression],t);case`Enabled`:return s(Sd,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return d(e,n.data.level),i(Cd,[n])}case`If`:return s(gd,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(gd,[...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(gd,[e.body],t,e.bounds.map(e=>e.set),Fr(e.bounds));if(n.level===3&&e.bounds.some(e=>m(e.set,t).level===2))throw kd(`Action-level bound of quantified temporal formula`,e.location);return n}case`UnboundedQuantifier`:return s(e.isTemporal?Ed:gd,[e.body],t,[],e.names);case`Choose`:return s(_d,[e.body],t,e.set?[e.set]:[],Pr(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(hd,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(hd,[e.predicate],t,[e.bound.set],Pr(e.bound.pattern));case`SetMap`:return s(hd,[e.expression],t,e.bounds.map(e=>e.set),Fr(e.bounds));case`FunctionConstruction`:return s(vd,[e.body],t,e.bounds.map(e=>e.set),Fr(e.bounds));case`Record`:return s(vd,e.fields.map(e=>e.value),t);case`RecordSet`:return s(hd,e.fields.map(e=>e.value),t);case`Except`:return s(hd,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(yd,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(hd,e.args,t)}]);case`FieldAccess`:return i(bd,[a(e.record,t),{data:cd()}]);case`BoxAction`:case`AngleAction`:return s(wd,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(Td,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return cd()}},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 Xa(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Dd(t,Od(e.names))),i;default:return bi(e,(e,n)=>(a(e,r,Dd(t,Od(n))),e)),i}},g=(e,t,n,r)=>{let i=Dd(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=h(n,i),c={...cd(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(id(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(ad(e.name,n,t.name))).map(e=>sd(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(od(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=od(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,{...cd(),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}},Nd=(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`?Nd(e,r,n):n.analyze(e,r)}),n.analyze(e.conclusion,r)},Pd=(e,t)=>{let n=Md(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`?Nd(e.statement,/* @__PURE__ */ new Map,n):n.analyze(e.statement,/* @__PURE__ */ new Map))},Fd=(e,t)=>e.maxLevels[t]??3,Id=(e,t)=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Md({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=>ld(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>ld(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>ud(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=od(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(id(t.name,a));o!==void 0&&Fd(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=od(t),r=d.find(e=>e.name===n.operator)?.operator,a=d.find(e=>e.name===n.param);if(!r||!a)return;let o=Fd(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 f([...o].join(`
|
|
410
|
-
`))},Ld=t=>{switch(t.kind){case`Number`:try{return _e(t.value)}catch(t){throw a(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Re(t.name);case`Set`:return gt(t.elements.map(Ld))}},Rd=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],zd=e=>new f(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Bd=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:wr},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),Vd=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>U(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new m(`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`)&&Ve(t,r)})});if(t)return t[1];throw new m(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:U(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Hd=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Xa(e).some(e=>Hd(e,t)),Ud=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ki(e),n.get(e)??n.size)),n},Wd=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Gd=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Ua(e);if(e.kind===`Number`&&!Po(e.value))throw Wa(e);Gd(e.kind===`Let`?[...Xa(e),...Wd(e.instances??[])]:Xa(e))}),Kd=(e,t)=>{let n=lc(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=new Map(wu.map(e=>[e.name,e])),o=/* @__PURE__ */ new Map,s=Wc(e.checkDeadlock,t.seed),c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=[],d=/* @__PURE__ */ new Map,m=[],h=[],g=(e,t)=>m.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),_={value:0},v=e=>`${e}#${_.value++}`,y=[],ee=/* @__PURE__ */ new Map,b=e=>{let n=o.get(e);if(n)return n;let r=Ru(e,t.print,s,t.files);if(!r)return;let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>b(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(e=>{a.set(e.name,e),i.set(e.name,{key:e.name,arity:e.arity})}),o.set(e,i),i},x=e=>{let t=b(e);return t&&g(e,Lu.get(e)??[]),t},te=e=>(Gd([...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]),...Wd(e.instances)]),e.modules.forEach(te),e);te(n);let ne=(e,n)=>{let r=t.loadModule?.(e)??As.get(e)??sc(t.source,e);if(r===void 0)throw new f(`Cannot find source file for module ${e} imported in module ${n}.`);let i=lc(r);if(i.name!==e)throw new f(`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`);return te(i)},S=e=>{let t=h.indexOf(e.name);if(t!==-1)throw new f(`Circular dependency among .tla files; dependency cycle is: ${[...h.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];h.push(e.name),m.push(n);let i=O(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});m.pop(),h.pop();let a=r.find(e=>n.has(e.name));if(a)throw zd(a);return{linked:i,closure:n}},C=(e,t)=>{let n=c.get(e);if(n)return g(e,d.get(e)??[]),n;let r=S(ne(e,t));return c.set(e,r.linked),d.set(e,r.closure),g(e,r.closure),r.linked},re=(e,t,n,a,o)=>{let s=o?void 0:x(e.module);if(s)return e.name===void 0?s:new Map([...s].map(([t,n])=>[`${e.name}!${t}`,n]));let c=o??C(e.module,t.name),l=Rd(c),u=`#${_.value++}`,d=new Map(e.params.map(e=>[e.name,`${e.name}${u}`])),f=ui(td(e,t),l,t,n);y.push({module:e.module,instancer:t.name,lets:[],substitutions:f,location:e.location});let p=Vi({params:e.params.map(e=>({...e,name:`${e.name}${u}`})),substitutions:new Map([...f].map(([e,t])=>[e,mi(t,d)])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(e,n)=>{let o=v(`${e}@${t.name}`);return r.set(o,n(o)),i.set(o,!a),o},createName:v}),m=new Set(l.map(e=>e.name)),h=/* @__PURE__ */ new Map;return c.exported.forEach((t,n)=>{if(m.has(n))return;if(e.name===void 0){let r=p.getKey(t.key);l.length>0&&ee.set(r,{name:n,location:e.location}),h.set(n,{key:r,arity:t.arity});return}let r=p.getQualifiedKey(t.key);l.length>0&&ee.set(r,{name:`${e.name}!${n}`,location:e.location}),h.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length})}),h},ie=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:wr})),ae=(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:ie(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),w=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),T=(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=w(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:ie(r,n),location:n}}},E=(e,t,n,a)=>{let o=e.location,s=a?void 0:x(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=w(n.arity);return ae(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??C(e.module,n),l=`#${_.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Rd(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};y.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=>Hd(f(e),p),h=d.map(t=>{let n=T(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=[],ee=Vi({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:ie(e.params,o),location:o,resolution:wr}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:wr}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n)=>{let r=`${t}@${e.module}${l}.${g.length}`,i=n(r);return g.push(i.kind===`Operator`?{...i,name:r}:Bd(i,r)),r},createName:v}),b=new Set(d.map(e=>e.name)),te=[...c.exported].filter(([e])=>!b.has(e)).map(([t,n])=>{let r=ee.getKey(n.key),i=w(n.arity),a=[...e.params,...i];return ae(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...te]},D=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),O=(e,a)=>{let o=Rs(e,t.loadClass?.(e.name)),s=new Map([...wu.map(e=>[e.name,{key:e.name,arity:e.arity}]),...a.symbols]),c=/* @__PURE__ */ new Map,d=/* @__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:x(e);if(n){g(n,!0);return}let r=t??C(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)=>d.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,ee=e=>({imported:s,importedAt:y,definitions:new Map(e.definitions.map(e=>[e.name,e])),getKey:v}),b=()=>new Map([...a.modules,...d]),te=e=>new Map([...s,...[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))].filter(t=>Or(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>Or(t.location,e)).map(e=>[e.name,{key:v(e),arity:kr(e)}])]),ne=e=>{let t=b();if(t.has(e.name))throw zd(e);a.nested.push(e);let n=O(e,{id:`${a.id}/${e.name}`,symbols:te(e.location),modules:t,nested:a.nested});d.set(e.name,n),l.has(e.name)||l.set(e.name,n)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=re(e,o,ee(o),_,b().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:()=>ne(e)}))].sort((e,t)=>Or(e.location,t.location)?-1:1).forEach(e=>e.link()),ci(o,ee(o));let S=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&Or(e.location,t.location)},ie=e=>{let t=o.modules.find(t=>t.name===e.module);return t?S(t)?d.get(t.name):void 0:b().get(e.module)},ae=nd(Gi(o,(e,t)=>E(e,t,o.name,ie(e))),D(s));di(ae,ee(ae)),ae.definitions.forEach(e=>{let t=v(e);r.set(t,e),i.set(t,!_);let n={key:t,arity:kr(e)};s.set(e.name,n),e.isLocal||c.set(e.name,n)}),Pd(ae,{constants:new Set(p.map(e=>e.name)),variables:new Set(m),getDefinition:e=>r.get(s.get(e)?.key??e)});let w={module:ae,constants:p,variables:m,variableLocations:h,visible:s,exported:c,modules:d,extended:f};return u.push(w),w},oe=S(n).linked,se=e=>oe.visible.get(e)?.key??e;oe.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let k=[],ce=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ce(e,t)),k.push(...e.module.assumptions))};ce(oe,/* @__PURE__ */ new Set);let le=oe.constants.map(e=>e.name),ue=oe.variables,de=e=>e.module===void 0?[e.name,se(e.name)]:e.module===n.name||le.includes(e.name)?[]:[(c.get(e.module)??l.get(e.module))?.visible.get(e.name)?.key??e.name],fe=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:oe.constants.find(t=>t.name===e)?.arity??0},pe=/* @__PURE__ */ new Map,me=/* @__PURE__ */ new Set,he=(e,t)=>{a.set(e,t),r.delete(e),pe.delete(e),me.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Ld(e.value);de(e).forEach(e=>{let n=fe(e);n===0?pe.set(e,t):he(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let A=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=A.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new p(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(Ld),Ld(e.value)]),A.set(t,n)}),A.forEach(e=>de(e).forEach(t=>he(t,Vd(e.name,fe(t)||e.rows[0][0].length,e.rows))));let j=new Map(e.substitutions.flatMap(e=>de(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(!le.includes(n)&&!oe.visible.has(n))throw new p(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new p(`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 o=se(i),s=r.get(o);if(!(s!==void 0||a.has(o)||pe.has(o)||le.includes(i)||ue.includes(i)))throw new p(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(oe.constants.find(e=>e.name===n)?.arity??oe.visible.get(n)?.arity))throw new p(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)}),le.forEach(e=>{if(!pe.has(e)&&!j.has(e)&&!me.has(e))throw new p(`The constant ${e} is not assigned a value by the configuration`)});let M={runtime:s,definitions:r,builtins:a,constants:pe,substitutions:j,variables:ue,variableIndex:Ud(ue,u.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap};return Id(y,e=>{let t=c.get(e)??l.get(e)??oe;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)}}),j.forEach((e,t)=>{let n=r.get(e);if(le.includes(t)&&n&&!$a(n,M))throw new p(`The configuration file substitutes constant ${t} with non-constant ${e}`)}),{environment:M,assumptions:k,variableLocations:oe.variableLocations,instanceActions:ee}},qd={kind:`Boolean`,value:!0},Jd={kind:`Boolean`,value:!1},Yd=e=>e?qd:Jd,Xd=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Zd=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Q=(e,t)=>({kind:e,body:t}),Qd=(e,t,n)=>({kind:e,operands:[t,n]}),$d=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?$d(e,t.operands).operands:[t])}),ef=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return ef(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,ef(t)),0)}},tf=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 tf(e.body);case`And`:case`Or`:return e.operands.some(tf)}},nf=(e,t)=>e.kind===t.kind?e.kind===`Boolean`&&t.kind===`Boolean`?e.value===t.value:Xd(e)?e===t:`body`in e&&`body`in t?nf(e.body,t.body):`operands`in e&&`operands`in t&&e.operands.length===t.operands.length&&e.operands.every((e,n)=>nf(e,t.operands[n])):!1,rf=(e,t)=>e.some(e=>nf(e,t)),af=e=>e===`And`?`Or`:`And`,of=(e,t)=>{switch(e.kind){case`Boolean`:return t?Yd(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Q(`Not`,e):e;case`Not`:return of(e.body,!t);case`And`:case`Or`:return $d(t?af(e.kind):e.kind,e.operands.map(e=>of(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Q(n,of(e.body,t))}}},sf=e=>{switch(e.kind){case`Boolean`:return Yd(!e.value);case`Not`:return e.body;case`And`:case`Or`:return $d(af(e.kind),e.operands.map(sf));case`Always`:return Q(`Eventually`,sf(e.body));case`Eventually`:return Q(`Always`,sf(e.body));default:return Q(`Not`,e)}},cf=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=cf(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Yd(t)}return n.length===0?Yd(!t):n.length===1?n[0]:$d(e.kind,n)}case`Not`:{let t=cf(e.body);return t.kind===`Boolean`?Yd(!t.value):Q(`Not`,t)}case`Always`:case`Eventually`:{let t=cf(e.body);return Q(e.kind,t.kind===e.kind?t.body:t)}default:return e}},lf=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,uf=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=uf(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new m(`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=>$d(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=uf(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=lf(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:$d(`Or`,t);n.push(Q(`Always`,Q(`Eventually`,e)))}return $d(`Or`,n)}case`Not`:return Xd(e.body)?e:uf(sf(e.body));default:return e}},df=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?df(e.operands[0]):$d(e.kind,e.operands.map(df));case`Not`:return e.body.kind===`Not`?df(e.body.body):Q(`Not`,df(e.body));case`Always`:case`Eventually`:case`Next`:return Q(e.kind,df(e.body));default:return e}},ff=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return ff(e.operands[0]);let t=Math.floor(e.operands.length/2);return Qd(e.kind,ff($d(e.kind,e.operands.slice(0,t))),ff($d(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Q(e.kind,ff(e.body));default:return e}},pf=(e,t)=>{e.kind===`Eventually`&&!rf(t,e)&&t.push(e),`body`in e&&pf(e.body,t),`operands`in e&&e.operands.forEach(e=>pf(e,t))},mf=e=>{let t=e.filter(Zd),n=e.flatMap(e=>e.kind===`Not`&&Zd(e.body)?[e.body]:[]);return!t.some(e=>rf(n,e))},hf=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 m(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},gf=(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]}},_f=(e,t,n)=>e.flatMap(e=>{let r=gf(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),vf=(e,t)=>e.every(e=>rf(t,e))&&t.every(t=>rf(e,t)),yf=(e,t)=>[...e.filter(e=>!t.some(t=>vf(e,t))),...t],bf=e=>{let t=hf(e),n=_f(t,`Always`,`And`),r=_f(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=gf(t,`Eventually`,`Or`);if(n&&!(rf(e,n.first)||rf(e,n.second)))return yf(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(rf(e,t.first)||rf(e,t.second))&&!rf(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!mf(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=gf(t[e],`Always`,`And`);n&&(rf(t,n.first)||t.push(n.first),rf(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)rf(t,e.first)&&rf(t,e.second)&&!rf(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!mf(t)?[]:i(t)};return a(e)},xf=e=>({particle:e,successors:[],statePredicates:e.filter(e=>ef(e)<=1)}),Sf=e=>{let t=bf([e]).map(xf),n=t.length;for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let r of bf(n)){let n=t.findIndex(e=>vf(e.particle,r));n===-1&&t.push(xf(r)),t[e].successors.push(n===-1?t.length-1:n)}}return{nodes:t,initialCount:n}},Cf=(e,t)=>!rf(e,t)||rf(e,t.body),wf=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&ef(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=lf(e);if(n){let e=ef(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(tf(e))throw new m(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},Tf=(e,t)=>{let n=e.findIndex(e=>nf(e,t));return n===-1?(e.push(t),e.length-1):n},Ef=e=>{let t=uf(cf(of(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=df(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])wf(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:$d(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:nf(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&ff(e.formula),n=[];t&&pf(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Tf(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Tf(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Tf(i,e))}));return{tableau:t&&Sf(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Df=/* @__PURE__ */ new Set([`~>`,`-+->`]),Of=/* @__PURE__ */ new WeakMap,kf=/* @__PURE__ */ new WeakSet,Af=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),jf=e=>new m(`TLC cannot handle the temporal formula at ${q(e)}`),$=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Ga(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=Za(e,n);if(t)return Mf(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:J(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return bi(e,(e,a)=>(i.value=Math.max(i.value,$(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 Df.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Mf=(e,t)=>{let n=Of.get(e);if(n!==void 0)return n;Of.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 Of.set(e,i),i},Nf=(e,t,n,r,i=/* @__PURE__ */ new Set)=>{let a=(e,t,a=i)=>Nf(e,t,n,r,a);if(e.kind===`And`)return e.operands.flatMap(e=>a(e,t));if(e.kind===`Label`)return a(e.body,t);if(e.kind===`Let`)return a(e.body,Pf(e,t,n));if(e.kind===`Identifier`){let r=J(e)?Ga(t,e.name):void 0;if(r?.kind===`Thunk`)return a(r.expression,r.scope);let o=n.constants.has(e.name)?void 0:Za(e.name,n);if(!r&&o?.kind===`Operator`&&o.params.length===0&&Mf(o,n)>0){if(i.has(o))throw new p(`The definition of ${e.name} refers to itself`);return a(o.body,void 0,/* @__PURE__ */ new Set([...i,o]))}}let o=Af(n,t);if(e.kind===`Apply`&&$(e,t,n)===3){let t=vo(e,o),r=J(e)?void 0:Za(e.operator,n);if(t?.kind===`Closure`&&!r?.isRecursive)return a(t.body,Ao(t,e.args,o))}if(r&&e.kind===`Forall`&&$(e.body,t,n)===3&&e.bounds.every(e=>$(e.set,t,n)===0)){let t=[];return no(e.bounds,o,n=>(t.push(...a(e.body,n)),!1)),t}return[{expression:e,scope:t}]},Pf=(e,t,n)=>{let r=Mo(e.definitions,Af(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&kf.add(e.binding);return r},Ff=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),If=(e,t,n)=>{let r=(e,t,r)=>{let i=r===0?$(e,t,n):r;if(i===0){let r=X(e,Af(n,t));if(typeof r!=`boolean`)throw new m(`TLC expected a boolean in the temporal formula at ${q(e)}`);return Yd(r)}return i===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},i={depth:0},a=(e,t,n,a)=>{if(i.depth>=100)throw new m(`TLC overflowed the stack while expanding the temporal formula at ${q(n)}`);i.depth++;let o=c(e,t);i.depth--;let s=ef(o);return s>2?o:r(n,a,s)},o=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,i=Af(n,t),o=J(e)||Za(r,n)===void 0?Ga(t,r):void 0;if(o?.kind===`Thunk`&&kf.has(o))return a(o.expression,o.scope,e,t);let s=o?.kind===`Operator`?o.operator:o?void 0:J(e)?yo(r,i):go(r,n);if(s?.kind!==`Closure`)throw jf(e);let c=e.kind===`Apply`?e.args:[];return a(s.body,Ao(s,c,i),e,t)},s=(e,t)=>{if(!e.bounds.every(e=>$(e.set,t,n)===0))throw jf(e);let i=[];no(e.bounds,Af(n,t),t=>(i.push(c(e.body,t)),!1));let a=e.kind===`Forall`;if(i.length===0)return Yd(a);let o=$d(a?`And`:`Or`,i),s=ef(o);return s>2?o:r(e,t,s)},c=(e,t)=>{let i=$(e,t,n);if(i<=2)return r(e,t,i);switch(e.kind){case`Label`:return c(e.body,t);case`Let`:return c(e.body,Pf(e,t,n));case`Identifier`:return o(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Q(`Always`,Qd(`Or`,Q(`Not`,c(n[0],t)),Q(`Eventually`,c(n[1],t)))):e.operator===`~`&&!J(e)?Q(`Not`,c(n[0],t)):e.operator===`=>`?Qd(`Or`,Q(`Not`,c(n[0],t)),c(n[1],t)):o(e,t)}case`And`:case`Or`:return $d(e.kind,e.operands.map(e=>c(e,t)));case`Forall`:case`Exists`:return s(e,t);case`If`:{if($(e.condition,t,n)===0){let r=X(e.condition,Af(n,t));if(typeof r==`boolean`)return c(r?e.consequent:e.alternative,t)}let r=c(e.condition,t);return Qd(`Or`,Qd(`And`,r,c(e.consequent,t)),Qd(`And`,Q(`Not`,r),c(e.alternative,t)))}case`Always`:case`Eventually`:return Q(e.kind,c(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=Ff(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`,Qd(`Or`,i,a))):Qd(`Or`,Q(`Eventually`,Q(`Always`,i)),Q(`Always`,Q(`Eventually`,a)))}default:throw jf(e)}};return c(e,t)},Lf=(e,t,n,r,i)=>{let a=e=>Lf(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`?Ya(X(e.expression,a),`a temporal property predicate`):ja(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&&Ya(X(e.unchanged,a),`a subscript`)?!1:Ya(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 Lf(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new m(`TLC cannot evaluate a temporal formula in a single step`)}},Rf=(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)=>Rf(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 Lf(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},zf=/* @__PURE__ */ new WeakMap,Bf={value:0},Vf=e=>{let t=zf.get(e);if(t!==void 0)return t;let n=e.kind===`Boolean`?String(e.value):`body`in e?`${e.kind}(${Vf(e.body)})`:`operands`in e?`${e.kind}(${e.operands.map(Vf).join(`,`)})`:`${e.kind}#${Bf.value++}`;return zf.set(e,n),n},Hf=(e,t)=>e.every((e,n)=>Ue(e,t[n])),Uf=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Wf=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.successors.push([]),e.actions.push(/* @__PURE__ */ new Uint8Array),e.stateResults.push(/* @__PURE__ */ new Uint8Array),e.isWritten.push(!1),e.nodeStates.length-1),Gf=2**53-1,Kf=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>If(e.expression,e.scope,n)),a=e.map(e=>Q(`Not`,If(e.expression,e.scope,n))),o=a.length===1?a[0]:$d(`Or`,a),s=i.length===0?o:$d(`And`,[...i,o]),c=Ef(s);if(c.length===0)throw new m(`Temporal formula is a tautology (its negation is unsatisfiable)`);let l=/* @__PURE__ */ new Map,u=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=Vf(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],successors:[],actions:[],stateResults:[],isWritten:[],initial:[],nodeIds:/* @__PURE__ */ new Map,nodesByState:/* @__PURE__ */ new Map,isDone:[],errorNode:void 0})),d={multiplier:1},f=!Wo(n),p={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=p.states.get(e)??/* @__PURE__ */ new Map;return p.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>Lf(e,t,void 0,n,f?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),y=(e,t,r,i)=>g(t,()=>{let t=e.solution.actionChecks;if(!f)return Uint8Array.from(t,e=>+!!Lf(e,r,i,n,/* @__PURE__ */ new Map));let a=h(r),o=p.actions.get(r)??/* @__PURE__ */ new Map;p.actions.set(r,o);let s=o.get(i)??new Int8Array(l.size).fill(-1);return o.set(i,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!Lf(t[o],r,i,n,a)),s[e]))}),ee=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),b=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},x=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),te=(e,t,n)=>e.solution.tableau?e.nodeIds.get(t*e.solution.tableau.nodes.length+n):t,ne=(e,t,n)=>{let r=Wf(e,t,n);e.nodeIds.set(t*(e.solution.tableau?.nodes.length??1)+n,r);let i=e.nodesByState.get(t);return i?i.push(r):e.nodesByState.set(t,[r]),r},S=(e,t,n,r)=>{let i=e.solution.actionChecks.length,a=new Uint8Array(n.length*i);n.forEach((e,t)=>a.set(e,t*i)),e.actions[t]=a,e.stateResults[t]=r,e.isWritten[t]=!0},C=(e,t,n)=>{let i={slots:Array.from({length:16*d.multiplier}),count:0},a=(e,t)=>{for(let n=(r.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&&Hf(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)},re=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=e.successors[a],u=s.successors.length>0?y(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!ee(t,r,i,n))continue;if(b(t,r)&&e.errorNode===void 0&&x(e)){e.errorNode=a;return}let o=te(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&re(e,t,n,i,s)}for(let a of r.getSuccessors(n)){let r=y(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!ee(t,n,i,a.state))continue;let s=te(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&re(e,t,a.state,a.index,u)}}l.length>0&&S(e,a,c,o)},ie=(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(e.nodesByState.get(a)??[]).slice()){let a=e.successors[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=te(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&re(e,t,n.state,n.index,d)}}),S(e,s,c,i)}if(e.errorNode!==void 0)return Uf(w(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},ae=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Wf(e,e.nodeStates.length,-1);let a=e.successors[i],o=[];t.forEach((t,r)=>{e.isWritten[t.index]&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),S(e,i,o,r)},w=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)e.isWritten[t]&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of e.successors[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}e.isWritten[i]&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new m(`Couldn't re-create liveness trace (path) starting at: ${t}`)},T=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.actions[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=>e.isWritten[t]),c=[],l=t=>{let n=e.successors[t].indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&Cf(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=Gf;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]=Gf,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>e.stateResults[n][t]===1)),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>e.successors[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=Uf(w(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),h=t.infinitelyOftenActions.map(()=>!1),g=n.promises.map(()=>!1),_={count:f.length+h.length+g.length},v={node:r},y=e=>o.has(e),ee=e=>{l.push(v.node),v.node=e};for(;_.count>0;){let r=_.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&e.stateResults[v.node][t]===1&&(f[n]=!0,_.count--)}),n.promises.forEach((e,t)=>{!g[t]&&u(v.node,e)&&(g[t]=!0,_.count--)}),!(_.count<=0);){let n={last:-1,unvisited:-1},o=_.count;if(e.successors[v.node].some((r,c)=>{if(s.has(e.nodeStates[r])){if(!y(r)||!a(v.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!h[t]&&i(v.node,c,e)&&(h[t]=!0,_.count--)})}return _.count<o?(ee(r),d.clear(),!0):(y(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(_.count<r){ee(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new m(`TLC failed to build the counterexample of a liveness property`);v.node=t,n.unvisited=e.successors[t].find(e=>y(e)&&!d.has(e))??-1}ee(n.unvisited),d.add(n.unvisited)}}let b=p(r,v.node,s,a);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];b[b.length-1]!==n&&b.push(n)}let x=c[c.length-1];return b[b.length-1]===x&&b.pop(),{prefix:c.slice(0,-1),cycle:[x,...b.reverse()]}},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 e.successors[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 m(`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++};e.successors[l].forEach((t,r)=>{e.isWritten[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{addInitialState:(e,t)=>{p.states.clear(),p.actions.clear();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(te(n,e,i)??ne(n,e,i))}},addState:(e,t,n)=>{p.states.clear(),p.actions.clear();let r=C(e,t,n);for(let n of u){let i=r.map(r=>y(n,e,t,r.state)),a=v(n,e,t),o=n.solution.tableau,s=o?ie(n,o,r,i,a,e):ae(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of u)for(let t of e.solution.models){let n=T(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!Rf(a[i].body,t,r,0,n)).map(e=>e.name))]}},qf=`UnnamedAction`,Jf={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Yf=e=>{let t=e.range??Jf;return Mt([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Xf=e=>{let t=[[`name`,e.name],[`location`,Yf(e.location)]];return e.parameters.length===0?Mt(t):Mt([...t,[`context`,Mt(e.parameters)],[`parameters`,L(e.parameters.map(e=>e[0]))]])},Zf=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),Qf=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),$f=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,ep=e=>e.kind===`Apply`?e.args:[],tp=(e,t,n)=>{let r=$f(e);if(r===void 0)return;if(J(e)){let e=Ga(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=go(r,n);return i?.kind===`Closure`?i:void 0},np=(e,t)=>{try{return X(e,Qf(t,void 0)),!0}catch(e){if(e instanceof d)return!1;throw e}},rp=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&$a(e,t)&&np(e.body,t),ip=(e,t)=>{let n=Za(e.name,t);return n?.body===e.body&&rp(n,t)},ap=(e,t)=>{if(e.kind!==`Identifier`||!J(e))return;let n=Ga(t,e.name);return n?.kind===`Thunk`?n:void 0},op=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Ga(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),sp=(e,t)=>{try{return e()}catch(e){if(e instanceof d)return t();throw e}},cp=(e,t,n,r,i)=>{let a=ep(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():sp(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),X(e,Qf(i,n))]),expression:t,scope:n}],o)},lp=(e,t,n,r,i)=>{let a=()=>({name:n?.name??qf,location:e.location,parameters:op(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return lp(e.body,Mo(e.definitions,Qf(r,t)),n,r,i);case`Label`:return lp(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>lp(e,t,n,r,i));case`Exists`:return sp(()=>{let o=[];return no(e.bounds,Qf(r,t),t=>(o.push(...lp(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=J(e)?void 0:i.get($f(e)??``),s=tp(e,t,r);if(o)return cp(o,e,t,s,r);if(!s)return[a()];let c=ep(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return ip(s,r)||c.some(e=>$(e,t,r)!==0)?l():sp(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:X(n,Qf(r,t))},parent:e}),s.scope);return lp(s.body,e,s,r,i)},l)},up=(e,t,n,r,i)=>{let a=(e,t)=>up(e,t,n,r,i);if(e.kind===`Let`){a(e.body,Mo(e.definitions,Qf(n,t)));return}let o=ap(e,t);if(o){a(o.expression,o.scope);return}let s=tp(e,t,n);if(s&&ip(s,n))return;if(s&&s.params.length===0){if($(s.body,s.scope,n)===1){r.inits.push(Zf(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,Ao(s,e.args,Qf(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(Zf(qf,e));return}let c=$(e,t,n);c<=1?r.inits.push(Zf(qf,e)):c===3&&r.temporals.push(Zf(qf,e))},dp=(e,t,n,r,i)=>{let a=(t,n)=>dp(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Mo(t.definitions,Qf(r,n)));return}let o=ap(t,n);if(o){a(o.expression,o.scope);return}let s=tp(t,n,r);if(s&&ip(s,r))return;if(s&&s.params.length===ep(t).length){a(s.body,t.kind===`Apply`?Ao(s,t.args,Qf(r,n)):s.scope);return}if(t.kind===`Forall`&&sp(()=>(no(t.bounds,Qf(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(Zf(e,a)):$(a,n,r)<2?i.invariants.push(Zf(e,a)):i.impliedTemporals.push(Zf(e,t));return}let c=$(t,n,r);c<=1?i.impliedInits.push(Zf(e,t)):c===3&&i.impliedTemporals.push(Zf(e,t))},fp=(e,t)=>{let n=Za(e,t);return n?.kind===`Operator`&&!rp(n,t)?n:void 0},pp=e=>Mt([[`name`,e.name],[`location`,Yf(e.location)]]),mp=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:fp(e.specification,t);a&&(up(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...lp(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:go(e.init,t);o?.kind===`Closure`&&r.inits.push(Zf(e.init??``,o.body));let s=e.next===void 0?void 0:go(e.next,t);return s?.kind===`Closure`&&r.actions.push(...lp(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=fp(e,t);n&&r.invariants.push(Zf(e,n.body))}),e.properties.forEach(e=>{let n=fp(e,t);n&&dp(e,n.body,void 0,t,r)}),r},hp=(e,t,n)=>mp(e,t,n).actions,gp=e=>{let t=e.parameters.map(e=>U(e[1]));return`${e.name===qf?`Action`:e.name}${t.length===0?``:`(${t.join(`,`)})`} ${Ia(e.location.range??Jf)}`},_p=(e,t,n,r)=>{let i=mp(e,t,r),a=e=>gt(e.map(Xf)),o=e=>gt(e.flatMap(e=>{let n=fp(e,t);return n?[pp(n)]:[]}));return Mt([[`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`,gt(t.variables.map((e,t)=>Mt([[`name`,e],[`location`,Yf(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},vp=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),yp=(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},bp=(e,t)=>{if(!j(e))throw new p(`The symmetry values of ${t} must be functions`);let n=H(e),r=/* @__PURE__ */ new Map;return n.domain.forEach((e,t)=>{let i=n.range[t];if(!M(e)||!M(i))throw new p(`Symmetry function must have model values as domain and range`);e.name!==i.name&&r.set(e.name,i)}),r},xp=(e,t)=>{let n=t.definitions.get(e);if(n?.kind!==`Operator`||n.params.length>0)throw new p(`The symmetry function ${e} must specify a set of permutations`);let r=X(n.body,{environment:t,scope:void 0,state:void 0,next:void 0});if(!A(r)||!R(r))throw new p(`The symmetry operator must specify a set of functions`);let i=z(r).elements.map(t=>bp(t,e));if(n.body.kind===`Apply`&&n.body.args.length>=i.length)return[];let a=/* @__PURE__ */ new Map;i.forEach(e=>{e.size>0&&a.set(vp(e),e)});let o=[...a.values()],s={start:0};for(;s.start<a.size;){let e=[...a.values()],t=e.length;o.forEach(n=>e.slice(s.start,t).forEach(e=>{let t=yp(n,e),r=vp(t);t.size>0&&!a.has(r)&&a.set(r,t)})),s.start=t}let c=Math.max(256,Math.floor(4194304/a.size));return[...a.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:c}))},Sp=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Tp(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(Tp(e[r],t));return a}},Cp=(e,t)=>{let n=[],r=[];for(let i of e){let e=Tp(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(I);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(I(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},wp=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,Tp=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=wp(e);if(n===0||n>64)return Ep(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=Ep(e,t),a=i!==e&&Ue(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},Ep=(e,t)=>{let n=e.kind;if(n===`Set`){let n=Cp(e.elements,t);return n?ze(n):e}if(n===`Function`||n===`LazyFunction`&&R(e.domain)){let n=H(e),r=Sp(n.domain,t),i=Sp(n.range,t)??n.range;if(r){let e=St(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Be(n.domain,e.range):e}return i===n.range?n:Be(n.domain,i)}if(n===`Interval`||!A(e)||!R(e))return e;let r=z(e),i=Sp(r.elements,t);return i?gt(i):r},Dp=(e,t,n)=>{for(let r=t.length;r<e.length;r++)t.push(Tp(e[r],n));return t},Op=(e,t,n,r)=>{let i=[];for(let a=0;a<e.length;a++){let o=r?r[a]:a,s=Tp(e[o],n),c=I(s,t[o]);if(c>0)return;if(r||i.push(s),c<0)return r?e.map(e=>Tp(e,n)):Dp(e,i,n)}},kp=(e,t,n)=>t.reduce((t,r)=>Op(e,t,r,n)??t,e),Ap=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],jp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Mp=new Map(uu.flatMap(e=>e.map(t=>[t,e[0]]))),Np=e=>Mp.get(e)??e,Pp=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Fp=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(Pp(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()}},Ip=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),Lp=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Np(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Np(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}},Rp=(e,t)=>{let n=[];for(let r=t;;){let t=Lp(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},zp=e=>({line:e.line,column:e.column}),Bp=(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=Rp(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},Vp=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,Hp={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},Up=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&Vp(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&Vp(e[n+1],e[n+2])?n+=Vp(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=>Hp[e])}"`:r.text)}return t},Wp=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},Gp=(e,t)=>e.find(e=>e.name===t)??e.map(e=>Gp(e.modules,t)).find(Boolean),Kp=(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:mu.get(i)??t?.(i)??sc(e,i),s=o===void 0?[]:oe(o),c=Wp(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=lc(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>Gp(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},qp=(e,t)=>{let n=Kp(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],o=(e,n)=>{let i=Rp(t,e+1);r.push({location:zp(t[e]),apply:e=>i.forEach(t=>e.put(Ip(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,a)=>{let l=e.start+a,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:zp(u),apply:t=>t.put(Ip(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&Rp(t,l+1).every(e=>s.has(e))&&o(l,`definition`),jp.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(zp(u)),r.push({location:zp(u),apply:e=>e.put(Ip(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(Ip(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=Np(e.name);r.push({location:e.location,apply:n=>n.put(Ip(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=a(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...i,...o].forEach(n=>{n.isLocal||t.put(Ip(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(Ip(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Or(e.location,t.location)?-1:+!!Or(t.location,e.location))},i=/* @__PURE__ */ new Map,a=e=>{let t=i.get(e??``);if(t)return t;let o=Fp();i.set(e??``,o),lu.toReversed().forEach(e=>o.put(Ip(e,`builtin`,!1)));let s=n(e);return s.getModule().extends.forEach(e=>a(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),r(s).forEach(e=>e.apply(o)),o};return a(void 0).enumerate().filter(e=>e.kind===`variable`).map(e=>e.name).reverse()},Jp=(e,t,n)=>{let r=Kp(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)}),du.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=Bp(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;Up(s(void 0)).forEach((e,t)=>{t===3&&pu.forEach(a),a(e)});let ee=u(void 0);for(;;){let e=g(ee,/* @__PURE__ */ new Set)??_(ee,/* @__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),Up(s(n)).forEach(a))}Ap.forEach(a);let b=/* @__PURE__ */ new Set,x=e=>{if(b.has(e))return;b.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(x),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return x(void 0),fu.forEach(a),[...i]},Yp=(e,t)=>e*((t-e)/2**64),Xp=e=>e.includes(`.`)?e:`${e}.0`,Zp=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Xp(String(e));let[n,r]=e.toExponential().split(`e`);return`${Xp(n)}E${r.replace(`+`,``)}`},Qp=e=>e!==void 0&&e>=`0`&&e<=`9`,$p=e=>{if(e===0)return`0.0`;let t=Zp(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Qp(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(;Qp(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Qp(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Qp(t[n.next])&&Number(t[n.next])>=5&&(n.result=em(n.result));Qp(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},em=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${em(r)}.`:n===`9`?`${em(r)}0`:`${r}${Number(n)+1}`},tm=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}`)},nm=(e,t,n)=>{if(Yp(e,t)<1e-10)return;let r=n().sort();return r.reduce((e,t,n)=>{let i=r[n-1];return n>0&&i<0n==t<0n&&t-i<e?t-i:e},9223372036854775807n)},rm=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}).`},im={line:0,column:0},am=`Failed to recover the initial state from its fingerprint.`,om=`Failed to recover the next state from its fingerprint.`,sm=e=>({kind:`Identifier`,name:e,location:im}),cm=/* @__PURE__ */ new Set([`name`,`property`]),lm=(e,t,n)=>{let r=Za(t,n);if(!r)throw new p(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new p(cm.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},um=(e,t,n)=>{let r=lm(e,t,n);if($a(r,n))throw new p(`The ${e} ${t} cannot be a constant.`);return r},dm=(e,t,n)=>{if($a(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return X(sm(e),Am(n,void 0,void 0))}catch(e){if(e instanceof m)return;throw e}},fm=(e,t,n)=>{let r=lm(e,t,n),i=dm(t,r,n);if(i!==void 0&&i!==!0)throw new p(`The ${e} of ${t} is equal to ${U(i)}`);return i===void 0?r:void 0},pm=(e,t)=>{let n=Md({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>Za(e,t)});return e.flatMap(e=>{let r=fm(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2)throw new p(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${i.params.size===0?``:`
|
|
427
|
+
`]]),vf=/* @__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)`]])]]),yf=(e,t)=>e.every(e=>vn(e,t)),bf=Dt([!1,!0]),xf=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Mt(xf(e,t,r),xf(e,r,n))},Sf=[`\\cup`,`\\cap`,`\\`],Cf=e=>typeof e==`object`&&e.kind===`MixedSet`,wf=e=>e.kind===`Interval`?q(e).elements:e.elements,Tf=(e,t,n)=>{let r=wf(t);if(e!==`\\cup`){let t=e===`\\cap`;return Ot(r.filter(e=>vn(e,n)===t))}if(r.length===0)return n;if(!Me(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=q(n).elements.filter(e=>!vn(e,t));return Ot([...r,...i])},Ef=[Cr(`TRUE`,!0),Cr(`FALSE`,!1),Cr(`BOOLEAN`,bf),Cr(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Er(`=`,Tt),Er(`#`,(e,t)=>!Tt(e,t)),Q(`~`,1,e=>!hr(e,0,`~`)),Q(`<=>`,2,e=>hr(e,0,`<=>`)===hr(e,1,`<=>`)),Q(`/\\`,2,e=>hr(e,0,`/\\`)&&hr(e,1,`/\\`)),Q(`\\/`,2,e=>hr(e,0,`\\/`)||hr(e,1,`\\/`)),Q(`=>`,2,e=>!hr(e,0,`=>`)||hr(e,1,`=>`)),Q(`\\in`,2,e=>vn(Z(e,0,`\\in`),Z(e,1,`\\in`))),Q(`\\notin`,2,e=>!vn(Z(e,0,`\\notin`),Z(e,1,`\\notin`))),Q(`\\subseteq`,2,e=>{let t=gr(e,0,`\\subseteq`),n=Z(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&K(t.base)?yf(q(t.base).elements,n.base):yf(q(t).elements,n)}),...Sf.map(e=>Q(e,2,t=>{let n=Z(t,0,e),r=Z(t,1,e);if(Me(n)&&Me(r)&&!Cf(n)&&!Cf(r)){if(e===`\\cup`&&sn(n))return r;let t=e===`\\cup`?Mt:e===`\\cap`?jt:At;try{return t(q(n),q(r))}catch(e){if(!(e instanceof y))throw e}}return Me(n)?Tf(e,n,r):e!==`\\`&&Me(r)?Tf(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),Q(`SUBSET`,1,e=>({kind:`Subset`,base:gr(e,0,`SUBSET`)})),Q(`UNION`,1,e=>{let t=gr(e,0,`UNION`),n=pt(t)?t.elements.filter(pt):[];if(!pt(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(Cf(t)||n.some(Cf)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{vn(t,e)||e.elements.push(t)})),Ot(e.elements)}return n.length===0?kt:xf(n.map(q),0,n.length)}),Q(`DOMAIN`,1,e=>{let t=Z(e,0,`DOMAIN`);if(!Ne(t))throw new y(`DOMAIN expects a function but received ${Y(t)}`);return Mn(t)})],Df=Lr(`Integers`,`Neg`,`IntValue`,1),Of=e=>{let t=Lr(e,`DotDot`,`IntervalValue`,2);return[Rr(e,`+`,`Plus`,(e,t)=>e+t),Rr(e,`-`,`Minus`,(e,t)=>e-t),Rr(e,`*`,`Times`,(e,t)=>e*t),Rr(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new b(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new b(`0^0 is undefined.`);return e**t}),Rr(e,`\\div`,`Divide`,(e,t)=>{if(t===0)throw new b(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(Dr(n))throw Or(`${e} \\div ${t}`);return n}),Rr(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new b(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),Q(`..`,2,e=>({kind:`Interval`,low:Ir(Z(e,0,`..`),t),high:Ir(Z(e,1,`..`),t)}))]},kf=[Cr(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Of(`Naturals`),Br(`<`,(e,t)=>e<t),Br(`>`,(e,t)=>e>t),Br(`<=`,(e,t)=>e<=t),Br(`>=`,(e,t)=>e>=t)],Af=[Cr(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Of(`Integers`),Q(`-.`,1,e=>{let t=Ir(Z(e,0,`-`),Df);if(Dr(-t))throw Or(`-${t}`);return-t})],jf=(e,t,n)=>{let r=Z(e,t,n),i=mn(r);if(!i)throw new b(`${n}\n${Y(r)}`);return i},Mf=(e,t,n)=>{let r=Z(e,t,n);return typeof r==`string`?r:jf(e,t,n)},Nf=(e,t,n)=>typeof e==`string`?Be(e.slice(t,n)):Ut(e.slice(t,n)),Pf=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Ff=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,If=(e,t)=>{let n=vf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Fr(e,t):e}):t},Lf=If(`Sequences`,[Q(`Seq`,1,e=>({kind:`SequenceSet`,base:Z(e,0,`Seq`)})),Q(`Len`,1,e=>Mf(e,0,Pf(``,`Len`)).length),Q(`\\o`,2,e=>{let t=Mf(e,0,Ff(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=jf(e,1,Ff(`t \\o s`,`sequence`));return Ut([...t,...n])}let n=Z(e,1,`\\o`);if(typeof n!=`string`)throw new b(`${Ff(`t \\o s`,`string`)}\n${Y(n)}`);return Be(t+n)}),Q(`Append`,2,e=>Ut([...jf(e,0,Ff(`Append(s, v)`,`sequence`)),Z(e,1,`Append`)])),Q(`Head`,1,e=>{let t=jf(e,0,Pf(``,`Head`));if(t.length===0)throw new b(`Attempted to apply Head to the empty sequence.`);return t[0]}),Q(`Tail`,1,e=>{let t=Mf(e,0,Pf(``,`Tail`));if(t.length===0)throw new b(`Attempted to apply Tail to the empty sequence.`);return Nf(t,1)}),Q(`SubSeq`,3,e=>{let t=Mf(e,0,Pf(`first `,`SubSeq`)),n=mr(e,1,`SubSeq`),r=mr(e,2,`SubSeq`);if(n>r)return Nf(t,0,0);let i=n<1?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new b(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${Y(Z(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Nf(t,n-1,r)}),wr(`SelectSeq`,2,e=>{let t=Sr(e,1,`SelectSeq`);return Ut(jf(e,0,Pf(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new b(`The second argument of SelectSeq should be a operator, but instead it is:\n${Y(n)}`);return n}))})]),Rf=If(`FiniteSets`,[Q(`IsFiniteSet`,1,e=>{let t=Z(e,0,`IsFiniteSet`);if(je(t))return fn(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${Y(t)}\nis a finite set.`:`Attempted to check if the ${Pe(t)} ${Y(t)} is a finite set.`)}),Q(`Cardinality`,1,e=>{let t=Z(e,0,`Cardinality`);if(!je(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new b(`Attempted to compute cardinality of the value\n${Y(t)}`);return un(t)})]),zf=/* @__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`]]]),Bf=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:kf};case`Integers`:return{extends:[`Naturals`],operators:Af};case`Sequences`:return{extends:[],operators:Lf};case`FiniteSets`:return{extends:[],operators:Rf};case`TLC`:return{extends:[],operators:If(`TLC`,df(t,n))};case`Randomization`:return{extends:[],operators:Vd(n)};case`_Possible`:return{extends:[],operators:nf(t,n)};case`Json`:return{extends:[],operators:Fd(r)};case`Bags`:return{extends:[],operators:md};case`TLCExt`:return{extends:[],operators:tf(t,n)};default:return}},Vf=`$subexpression`,Hf=(e,t)=>new p(`${e} at line ${t.line}, column ${t.column}`),Uf=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Wf=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}},Gf=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:di(e.bounds),body:e.body,sets:Uf(e.bounds)};case`SetMap`:return{names:di(e.bounds),body:e.expression,sets:Uf(e.bounds)};case`SetFilter`:return{names:ui(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:ui(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}},Kf=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Kf(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of ur(e)){let e=Kf(r,t,n);if(e)return e}},qf=(e,t,n)=>e.length===0&&n.length>0?n.splice(0,t):e,Jf=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Yf=(e,t)=>{let n=e.location,r=Jf(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 Hf(`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 Hf(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Vf,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Vf,args:e.args,location:n,resolution:ei},location:n}},Xf=(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:ei})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ei}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ei};return Yf({...t,params:[...t.params,...r]},a)},Zf=(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 Hf(`Expected an operator name`,n);o.push(c.name),s.push(...c.args);let l=o.join(`!`),u=i?i.find(e=>la(e)===l):t(l);if(u)return{definition:u,args:qf(s,ai(u),r)};a.index++}throw Hf(`Unknown operator ${o.join(`!`)}`,n)},s=t=>{let r=o(t),s=r.definition,c=ai(s),l=a.index===e.length-1;if(r.args.length!==c&&r.args.length!==0)throw Hf(`The operator ${s.name} requires ${c} arguments`,n);if(l)return{definition:s,args:r.args};if(s.kind!==`Operator`)throw Hf(`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&&Kf(a.current,t.name,[]);if(!o)throw Hf(`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(...qf(t.args,o.label.params.length,r)),a.current=o.label.body,a.index++}},l=t=>{let o=a.current;if(!o)throw Hf(`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`||vi(t.operand,1)!==0)throw Hf(`A LET/IN expression has only one operand`,n);i.lets.push(o.definitions),a.current=o.body;return}let s=Gf(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(...qf(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[vi(t.operand,r.length)],s=e[a.index+1];if(!i||s?.kind!==`Operand`)throw Hf(`A subexpression of CASE must have the form !i!j`,n);a.index++;let c=vi(s.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw Hf(`Nonexistent CASE operand`,n);a.current=l;return}if(t.kind!==`Operand`)throw Hf(`Unexpected subexpression selector`,n);let c=s?s.sets:Wf(o),u=c?.[vi(t.operand,c.length)];if(!u)throw Hf(`Nonexistent operand specified by the selector`,n);a.current=u},u=s(void 0);if(u)return Xf(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 Hf(`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 Xf(e.definition,{...i,args:[...i.args,...e.args]});c()}else l(t),a.index++}if(!a.current)throw Hf(`Subexpression selection failed`,n);return Yf(i,a.current)},Qf=(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:[]}))]},$f=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||ur(e).some($f),ep=(e,t,n)=>{if(!$f(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n);return fa(e,e=>ep(e,r,n))}let r=fa(e,e=>ep(e,t,n));if(r.kind===`Subexpression`){let e=r.selectors[0];return e.kind===`Name`&&n.has(e.name)?r:Zf(r.selectors,t,r.location,[])}let i=r.kind===`Identifier`?r.name:r.kind===`Apply`?r.operator:``,a=Qf(i,t);if(!a)return r;let o=r.kind===`Apply`?[...r.args]:[],s=Zf(a,t,r.location,o);if(o.length>0)throw Hf(`Too many arguments for ${i}`,r.location);return s},tp=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},np=(e,t)=>{let n=tp(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({name:e.name,expression:ep(e.expression,n,/* @__PURE__ */ new Set)}))}},rp=(e,t)=>{let n=tp([...t,...e.definitions]);if(!(e.definitions.some(e=>$f(e.body))||e.assumptions.some(e=>$f(e.expression))))return e;let r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[]));return{...e,definitions:e.definitions.map(e=>da(e,e=>ep(e,n,r))),assumptions:e.assumptions.map(e=>({...e,expression:ep(e.expression,n,r)}))}},ip=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}])),ap=(e,t)=>`${e}${t}`,op=(e,t,n)=>`${e}${t}${n}`,sp=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},cp=(e,t,n)=>`${e},${t},${n}`,lp=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),up=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),dp=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),fp=(e,t,n,r)=>({...lp(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),pp=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,mp=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,hp=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,{...fp(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),gp=fp(`$Set`,0,[2],[1]),_p=fp(`$Junction`,0,[3],[1]),vp=fp(`$Choose`,0,[2],[1]),yp=fp(`$Function`,0,[3],[1]),bp=fp(`$FcnApply`,0,[2,2],[1,1]),xp=fp(`$RcdSelect`,0,[2,0],[1,1]),Sp=fp(`'`,2,[1],[0]),Cp=fp(`ENABLED`,1,[2],[0]),wp=fp(`[]`,3,[3],[0]),Tp=fp(`$SquareAct`,2,[2,1],[0,0]),Ep=fp(`$WF`,3,[1,2],[0,0]),Dp=fp(`$TemporalExists`,3,[3],[0]),Op=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),kp=e=>e.map(e=>({name:e,arity:0})),Ap=(e,t)=>t.location.range?_(`${e}.`,t.location.range):new p(`${e} at line ${t.location.line}, column ${t.location.column}`),jp=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Mp=e=>e.kind!==`Let`&&e.kind!==`Label`,Np=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=hp.get(t)??ip.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=lp(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(op(e,n,t))}),t.data.constraints.forEach((e,t)=>up(r.constraints,t,e)),dp(r.argConstraints,ap(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>dp(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>pp(e,n))throw new p(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new p(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(cp(t,n,r)),s=lp(Math.max(e.level,...t.filter((t,n)=>mp(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)=>{mp(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)=>up(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||up(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>up(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||up(s.constraints,t,pp(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=>up(s.constraints,e,pp(r,a)))}))}),e.argParams.forEach(e=>{let t=sp(e),n=a(t.operator)?.operator;n&&up(s.constraints,t.param,pp(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>dp(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>dp(s.argConstraints,ap(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&dp(s.argConstraints,ap(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=sp(e),n=a(t.operator);n&&dp(s.argConstraints,ap(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(sp(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=sp(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(op(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(op(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(op(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,kp(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=lp();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=Op(n,kp(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 Ap(`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 Ap(`Action used where only temporal formula or state predicate allowed`,e);jp.has(e.operator)&&l(t,e)},d=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Mp(n)&&n.kind!==r)throw Ap(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},f=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=v(e,n);t.constraints.forEach((e,t)=>up(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>dp(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof p)||t.sany?t:Ap(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return lp();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return u(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return l(n,e),i(_p,n)}case`Prime`:case`Unchanged`:return s(Sp,[e.expression],t);case`Enabled`:return s(Cp,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return d(e,n.data.level),i(wp,[n])}case`If`:return s(_p,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(_p,[...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(_p,[e.body],t,e.bounds.map(e=>e.set),di(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Ap(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?Dp:_p,[e.body],t,[],e.names);case`Choose`:return s(vp,[e.body],t,e.set?[e.set]:[],ui(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(gp,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(gp,[e.predicate],t,[e.bound.set],ui(e.bound.pattern));case`SetMap`:return s(gp,[e.expression],t,e.bounds.map(e=>e.set),di(e.bounds));case`FunctionConstruction`:return s(yp,[e.body],t,e.bounds.map(e=>e.set),di(e.bounds));case`Record`:return s(yp,e.fields.map(e=>e.value),t);case`RecordSet`:return s(gp,e.fields.map(e=>e.value),t);case`Except`:return s(gp,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(bp,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(gp,e.args,t)}]);case`FieldAccess`:return i(xp,[a(e.record,t),{data:lp()}]);case`BoxAction`:case`AngleAction`:return s(Tp,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(Ep,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return lp()}},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 ur(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Op(t,kp(e.names))),i;default:return fa(e,(e,n)=>(a(e,r,Op(t,kp(n))),e)),i}},_=(e,t,n,r)=>{let i=Op(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...lp(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(ap(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(op(e.name,n,t.name))).map(e=>cp(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(sp(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=sp(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,{...lp(),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}},Pp=(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`?Pp(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=lp(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>up(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>dp(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},Fp=(e,t,n)=>{let r=Np(t),i=e=>Math.max(0,...e.map(e=>r.analyze(e,/* @__PURE__ */ new Map).level)),a=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?i([t.expression]):t.kind===`Witness`?i(t.expressions):t.kind===`Take`?i(t.bounds.map(e=>e.set)):t.kind===`Pick`?i([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Pp(t.statement,/* @__PURE__ */ new Map,r).level:i([t.statement]):0},o=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(e.statement),n=()=>a(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.`}],...o(e.proof)]:e.body.kind===`Qed`?o(e.proof):[]}):[],s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>a(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>i([e.set])!==0).flatMap(e=>e.set.location.range?[{location:g(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...s(e.proof),...r,...e.proof?.kind===`Steps`&&n()?o(e.proof):[]]}):[];na([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>r.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>r.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?Pp(e.statement,/* @__PURE__ */ new Map,r):r.analyze(e.statement,/* @__PURE__ */ new Map),n=[...s(e.proof),...t.level===3?o(e.proof):[]];if(n.length>0)throw m(n)}})),...n])},Ip=(e,t)=>e.maxLevels[t]??3,Lp=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Np({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=>up(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>up(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>dp(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=sp(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)&&up(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(Pp(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(ap(e.name,i));a!==void 0&&Ip(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=sp(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=Ip(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw m([...r.values()])}},Rp=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],zp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Bp=new Map(pf.flatMap(e=>e.map(t=>[t,e[0]]))),Vp=e=>Bp.get(e)??e,Hp=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Up=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(Hp(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()}},Wp=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),Gp=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Vp(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Vp(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}},Kp=(e,t)=>{let n=[];for(let r=t;;){let t=Gp(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},qp=e=>({line:e.line,column:e.column}),Jp=(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=Kp(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},Yp=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,Xp={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},Zp=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&Yp(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&Yp(e[n+1],e[n+2])?n+=Yp(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=>Xp[e])}"`:r.text)}return t},Qp=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},$p=(e,t)=>e.find(e=>e.name===t)??e.map(e=>$p(e.modules,t)).find(Boolean),em=(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:_f.get(i)??t?.(i)??vl(e,i),s=o===void 0?[]:de(o),c=Qp(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=bl(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>$p(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},tm=(e,t,n)=>{let r=em(e,t),i=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=Kp(t,e+1);r.push({location:qp(t[e]),apply:e=>i.forEach(t=>e.put(Wp(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:qp(u),apply:t=>t.put(Wp(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`&&Kp(t,l+1).every(e=>s.has(e))&&a(l,`definition`),zp.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(qp(u)),r.push({location:qp(u),apply:e=>e.put(Wp(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(Wp(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=Vp(e.name);r.push({location:e.location,apply:n=>n.put(Wp(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(Wp(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(Wp(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>ii(e.location,t.location)?-1:+!!ii(t.location,e.location))},a=/* @__PURE__ */ new Map,o=e=>{let t=a.get(e??``);if(t)return t;let n=Up();a.set(e??``,n),ff.toReversed().forEach(e=>n.put(Wp(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()},nm=(e,t,n)=>{let r=em(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)}),mf.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=Jp(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;Zp(s(void 0)).forEach((e,t)=>{t===3&&gf.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),Zp(s(n)).forEach(a))}Rp.forEach(a);let ee=/* @__PURE__ */ new Set,x=e=>{if(ee.has(e))return;ee.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(x),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return x(void 0),hf.forEach(a),[...i]},rm=t=>{switch(t.kind){case`Number`:try{return Fe(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Ze(t.name);case`Set`:return Dt(t.elements.map(rm))}},im=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],am=e=>new p(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),om=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:ei},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),sm=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>Y(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new 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`)&&et(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:Y(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},cm=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||ur(e).some(e=>cm(e,t)),lm=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(xa(e),n.get(e)??n.size)),n},um=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),dm=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Uo(e);if(e.kind===`Number`&&!Ms(e.value))throw Wo(e);dm(e.kind===`Let`?[...ur(e),...um(e.instances??[])]:ur(e))}),fm=(e,t)=>{let n=bl(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(Ef.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,c=tu(e.checkDeadlock,t.seed),l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Map,f=[],h=/* @__PURE__ */ new Map,g=[],_=[],ee=(e,t)=>g.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),x={value:0},S=e=>`${e}#${x.value++}`,C=[],w=Lp(e=>{let t=d.get(e)??k(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)}}),T=/* @__PURE__ */ new Map,te=/* @__PURE__ */ new Map,ne=e=>{let n=s.get(e);if(n)return n;let r=Bf(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},E=e=>{let t=ne(e),n=zf.get(e)??[];return t&&ee(e,n),t&&n.includes(`Integers`)&&ne(`Integers`),t},re=e=>(dm([...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]),...um(e.instances)]),e.modules.forEach(re),e);re(n);let D=(e,n)=>{let r=t.loadModule?.(e)??Vc.get(e)??vl(t.source,e);if(r===void 0)throw m([{location:`In module ${n}`,message:`Cannot find source file for module ${e} imported in module ${n}.`}],!0);let i=qu(r,e);if(i.name!==e)throw m([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return re(i)},O=e=>{let t=_.indexOf(e.name);if(t!==-1)throw new p(`Circular dependency among .tla files; dependency cycle is: ${[..._.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];_.push(e.name),g.push(n);let i=le(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});g.pop(),_.pop();let a=r.find(e=>n.has(e.name));if(a)throw am(a);return{linked:i,closure:n}},k=(e,t)=>{let n=l.get(e);if(n)return ee(e,h.get(e)??[]),n;let r=O(D(e,t));return l.set(e,r.linked),h.set(e,r.closure),ee(e,r.closure),r.linked},A=(e,t,n,o,s)=>{let c=s?void 0:E(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,n]));let l=s??k(e.module,t.name),u=im(l),d=`#${x.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=ta(np(e,t),u,t,n);C.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=Na({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,oa(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=S(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:S}),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&&T.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&&T.set(r,{name:`${e.name}!${n}`,location:e.location}),te.set(r,`${e.name}!${n}`),g.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length})}),g},ie=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:ei})),j=(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:ie(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ae=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),oe=(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=ae(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:ie(r,n),location:n}}},se=(e,t,n,a)=>{let o=e.location,s=a?void 0:E(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=ae(n.arity);return j(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??k(e.module,n),l=`#${x.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=im(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};C.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=>cm(f(e),p),h=d.map(t=>{let n=oe(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=[],_=Na({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:ie(e.params,o),location:o,resolution:ei}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:ei}])),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}:om(a,i)),i},createName:S}),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=ae(n.arity),a=[...e.params,...i];return j(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ce=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),le=(e,a)=>{let o=Yc(e,t.loadClass?.(e.name)),s=C.length,c=new Map([...Ef.map(e=>[e.name,{key:e.name,arity:e.arity}]),...a.symbols]),l=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=[],h=[...o.constants],g=o.variables.map(e=>e.name),_=o.variables.map(e=>e.location),v=(e,t)=>e.forEach((e,n)=>{c.set(n,e),t&&l.set(n,e)});o.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:E(e);if(n){v(n,!0);return}let r=t??k(e,o.name);h.push(...r.constants.filter(e=>h.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{g.includes(e)||(g.push(e),_.push(r.variableLocations[t]))}),v(r.exported,!0),r.modules.forEach((e,t)=>p.set(t,e)),m.push(r)}),o.constants.forEach(e=>l.set(e.name,{key:e.name,arity:e.arity,declaration:`Constant`})),o.variables.forEach(e=>l.set(e.name,{key:e.name,arity:0,declaration:`Variable`}));let y=h.length===0&&g.length===0,b=e=>o===n?e.name:`${e.name}@${a.id}`,ee=/* @__PURE__ */ new Map,x=e=>({imported:c,importedAt:ee,definitions:new Map(e.definitions.map(e=>[e.name,e])),getKey:b}),S=()=>new Map([...a.modules,...p]),T=e=>new Map([...c,...[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))].filter(t=>ii(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>ii(t.location,e)).map(e=>[e.name,{key:b(e),arity:ai(e)}])]),ne=e=>{let t=S();if(t.has(e.name))throw am(e);a.nested.push(e);let n=le(e,{id:`${a.id}/${e.name}`,symbols:T(e.location),modules:t,nested:a.nested});p.set(e.name,n),u.has(e.name)||u.set(e.name,n)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=A(e,o,x(o),y,S().get(e.module));t.forEach((t,n)=>{c.has(n)||ee.set(n,e.location)}),v(t,!e.isLocal)}})),...o.modules.map(e=>({location:e.location,link:()=>ne(e)}))].sort((e,t)=>ii(e.location,t.location)?-1:1).forEach(e=>e.link()),$i(o,x(o));let re=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&ii(e.location,t.location)},D=e=>{let t=o.modules.find(t=>t.name===e.module);return t?re(t)?p.get(t.name):void 0:S().get(e.module)},O=rp(La(o,(e,t)=>se(e,t,o.name,D(e))),ce(c));ra(O,x(O)),O.definitions.forEach(e=>{let t=b(e);r.set(t,e),i.set(t,!y);let n={key:t,arity:ai(e)};c.set(e.name,n),e.isLocal||l.set(e.name,n)});let ie={module:O,constants:h,variables:g,variableLocations:_,visible:c,exported:l,modules:p,extended:m};return d.has(o.name)||d.set(o.name,ie),Fp(O,{constants:new Set(h.map(e=>e.name)),variables:new Set(g),getDefinition:e=>r.get(c.get(e)?.key??e),getQualifiedName:e=>te.get(c.get(e)?.key??e)},C.splice(s).map(e=>({location:e.location,check:()=>w(e)}))),f.push(ie),ie},ue=O(n).linked,de=e=>ue.visible.get(e)?.key??e;ue.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let fe=[],pe=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>pe(e,t)),fe.push(...e.module.assumptions))};pe(ue,/* @__PURE__ */ new Set);let M=ue.constants.map(e=>e.name),me=ue.variables,he=e=>e.module===void 0?[e.name,de(e.name)]:e.module===n.name||M.includes(e.name)?[]:[(l.get(e.module)??u.get(e.module))?.visible.get(e.name)?.key??e.name],ge=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:ue.constants.find(t=>t.name===e)?.arity??0},_e=/* @__PURE__ */ new Map,ve=/* @__PURE__ */ new Set,ye=(e,t)=>{o.set(e,t),r.delete(e),_e.delete(e),ve.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=rm(e.value);he(e).forEach(e=>{let n=ge(e);n===0?_e.set(e,t):ye(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let be=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=be.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(rm),rm(e.value)]),be.set(t,n)}),be.forEach(e=>he(e).forEach(t=>ye(t,sm(e.name,ge(t)||e.rows[0][0].length,e.rows))));let xe=new Map(e.substitutions.flatMap(e=>he(e).map(t=>[t,de(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!M.includes(n)&&!ue.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=de(i),s=r.get(a);if(!(s!==void 0||o.has(a)||_e.has(a)||M.includes(i)||me.includes(i)))throw new v(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(ue.constants.find(e=>e.name===n)?.arity??ue.visible.get(n)?.arity))throw new v(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let Se=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(he)),Ce=(e,t)=>{if(Se.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&Ce(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=Ce(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=j(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),ue.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let we=M.filter(e=>!_e.has(e)&&!xe.has(e)&&!ve.has(e));if(we.length>0)throw new v(`The constant parameter ${tm(t.source,t.loadModule,`constant`).find(e=>we.includes(e))??we[0]} is not assigned a value by the configuration file.`);let Te={runtime:c,definitions:r,builtins:o,constants:_e,substitutions:xe,variables:me,variableIndex:lm(me,f.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap},Ee=Np({constants:new Set(_e.keys()),variables:/* @__PURE__ */ new Set([...me,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>Xo(e,Te)}),De=e=>{try{sc(e,{environment:Te,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};return xe.forEach((e,t)=>{let n=r.get(e),i=M.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ee.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?De(n.body):void 0;if(i)throw new v(`The configuration file substitutes constant ${t} with non-constant ${e}${i instanceof b?``:` - specifically: ${i.message}`}`)}),c.isStarted=!0,{environment:Te,assumptions:fe,variableLocations:ue.variableLocations,instanceActions:T}},pm={kind:`Boolean`,value:!0},mm={kind:`Boolean`,value:!1},hm=e=>e?pm:mm,gm=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,_m=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,vm=(e,t)=>({kind:e,body:t}),ym=(e,t,n)=>({kind:e,operands:[t,n]}),bm=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?bm(e,t.operands).operands:[t])}),xm=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return xm(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,xm(t)),0)}},Sm=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 Sm(e.body);case`And`:case`Or`:return e.operands.some(Sm)}},Cm=/* @__PURE__ */ new WeakMap,wm={count:0},Tm=e=>{let t=Cm.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`#${wm.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Tm).join(`,`)})`;default:return`${e.kind}(${Tm(e.body)})`}})();return Cm.set(e,n),n},Em=(e,t)=>e===t||Tm(e)===Tm(t),Dm=(e,t)=>{let n=Tm(t);return e.some(e=>e===t||Tm(e)===n)},Om=e=>e===`And`?`Or`:`And`,km=(e,t)=>{switch(e.kind){case`Boolean`:return t?hm(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?vm(`Not`,e):e;case`Not`:return km(e.body,!t);case`And`:case`Or`:return bm(t?Om(e.kind):e.kind,e.operands.map(e=>km(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return vm(n,km(e.body,t))}}},Am=e=>{switch(e.kind){case`Boolean`:return hm(!e.value);case`Not`:return e.body;case`And`:case`Or`:return bm(Om(e.kind),e.operands.map(Am));case`Always`:return vm(`Eventually`,Am(e.body));case`Eventually`:return vm(`Always`,Am(e.body));default:return vm(`Not`,e)}},jm=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=jm(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return hm(t)}return n.length===0?hm(!t):n.length===1?n[0]:bm(e.kind,n)}case`Not`:{let t=jm(e.body);return t.kind===`Boolean`?hm(!t.value):vm(`Not`,t)}case`Always`:case`Eventually`:{let t=jm(e.body);return vm(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Mm=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Nm=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Nm(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=>bm(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Nm(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Mm(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:bm(`Or`,t);n.push(vm(`Always`,vm(`Eventually`,e)))}return bm(`Or`,n)}case`Not`:return gm(e.body)?e:Nm(Am(e.body));default:return e}},Pm=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Pm(e.operands[0]):bm(e.kind,e.operands.map(Pm));case`Not`:return e.body.kind===`Not`?Pm(e.body.body):vm(`Not`,Pm(e.body));case`Always`:case`Eventually`:case`Next`:return vm(e.kind,Pm(e.body));default:return e}},Fm=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Fm(e.operands[0]);let t=Math.floor(e.operands.length/2);return ym(e.kind,Fm(bm(e.kind,e.operands.slice(0,t))),Fm(bm(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return vm(e.kind,Fm(e.body));default:return e}},Im=(e,t)=>{e.kind===`Eventually`&&!Dm(t,e)&&t.push(e),`body`in e&&Im(e.body,t),`operands`in e&&e.operands.forEach(e=>Im(e,t))},Lm=e=>{let t=e.filter(_m),n=e.flatMap(e=>e.kind===`Not`&&_m(e.body)?[e.body]:[]);return!t.some(e=>Dm(n,e))},Rm=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,vm(`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},zm=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:vm(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Bm=(e,t,n)=>e.flatMap(e=>{let r=zm(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Vm=e=>[...new Set(e.map(Tm))].sort().join(`|`),Hm=(e,t)=>{let n=new Set(t.map(Vm));return[...e.filter(e=>!n.has(Vm(e))),...t]},Um=e=>{let t=Rm(e),n=Bm(t,`Always`,`And`),r=Bm(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=zm(t,`Eventually`,`Or`);if(n&&!(Dm(e,n.first)||Dm(e,n.second)))return Hm(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Dm(e,t.first)||Dm(e,t.second))&&!Dm(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Lm(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=zm(t[e],`Always`,`And`);n&&(Dm(t,n.first)||t.push(n.first),Dm(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)Dm(t,e.first)&&Dm(t,e.second)&&!Dm(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Lm(t)?[]:i(t)};return a(e)},Wm=e=>({particle:e,successors:[],statePredicates:e.filter(e=>xm(e)<=1)}),Gm=e=>{let t=Um([e]).map(Wm),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Vm(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 Um(n)){let n=Vm(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Wm(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Km=(e,t)=>!Dm(e,t)||Dm(e,t.body),qm=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&xm(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Mm(e);if(n){let e=xm(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Sm(e))throw new y(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},Jm=(e,t)=>{let n=e.findIndex(e=>Em(e,t));return n===-1?(e.push(t),e.length-1):n},Ym=e=>{let t=Nm(jm(km(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Pm(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])qm(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:bm(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Em(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Fm(e.formula),n=[];t&&Im(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Jm(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Jm(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Jm(i,e))}));return{tableau:t&&Gm(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Xm=/* @__PURE__ */ new Set([`~>`,`-+->`]),Zm=/* @__PURE__ */ new WeakMap,Qm=/* @__PURE__ */ new WeakSet,$m=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),eh=(t,r)=>{try{return sc(t,r)}catch(t){if(!(t instanceof y)||t instanceof b)throw t;let r=o(t);throw r===void 0?n(new y(`${l}${t.message}`,t),e.error):n(t,r)}},th=e=>new y(`TLC cannot handle the temporal formula at ${Po(e)}`),nh=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Go(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return nh(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?nh(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Xo(e,n);if(t)return rh(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?+!!r.isStateLevel:void 0},o=(e,t)=>r.has(e)?0:X(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return fa(e,(e,a)=>(i.value=Math.max(i.value,nh(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 Xm.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},rh=(e,t)=>{let n=Zm.get(e);if(n!==void 0)return n;Zm.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(nh(e.body,void 0,t),...r.map(e=>nh(e.set,void 0,t)));return Zm.set(e,i),i},ih=`Temporal formula is a tautology (its negation is unsatisfiable).`,ah=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>ah(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,Fo(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,oh(t,r,i));if(t.kind===`Identifier`){let o=X(t)?Go(r,t.name):void 0;if(o?.kind===`Thunk`)return c(o.expression,o.scope);let l=i.constants.has(t.name)?void 0:Xo(t.name,i);if(!o&&l?.kind===`Operator`&&l.params.length===0&&rh(l,i)>0){if(s.has(l))throw n(new y(u),e.error);let r=c(l.body,void 0,t.name,/* @__PURE__ */ new Set([...s,l]));return!a&&rh(l,i)<2?[{expression:l.body,scope:void 0,name:t.name}]:r}}let l=$m(i,r);if(t.kind===`Apply`&&(e=>a||nh(e,r,i)===3)(t)){let e=gs(t,l),n=X(t)?void 0:Xo(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,Os(e,t.args,l),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>nh(e.set,r,i)===0)){let r=[],i={count:0};if(ts(t.bounds,l,e=>(i.count++,r.push(...c(t.body,e,Fo(t.body))),!1)),i.count===0)throw n(new y(ih),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},oh=(e,t,n)=>{let r=As(e.definitions,$m(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Qm.add(e.binding);return r},sh=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),ch=(t,r,i)=>{let a=(e,t,n)=>{let r=n===0?nh(e,t,i):n;if(r===0){let n=eh(e,$m(i,t));if(typeof n!=`boolean`)throw new y(`TLC expected a boolean in the temporal formula at ${Po(e)}`);return hm(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 y(u),e.error);o.depth++;let c=f(t,r);o.depth--;let l=xm(c);return l>2?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,r=$m(i,t),a=X(e)||Xo(n,i)===void 0?Go(t,n):void 0;if(a?.kind===`Thunk`&&Qm.has(a))return s(a.expression,a.scope,e,t);let o=a?.kind===`Operator`?a.operator:a?void 0:X(e)?_s(n,r):ms(n,i);if(o?.kind!==`Closure`)throw th(e);let c=e.kind===`Apply`?e.args:[];return s(o.body,Os(o,c,r),e,t)},l=(e,t)=>{if(!e.bounds.every(e=>nh(e.set,t,i)===0))throw th(e);let n=[];ts(e.bounds,$m(i,t),t=>(n.push(f(e.body,t)),!1));let r=e.kind===`Forall`;if(n.length===0)return hm(r);let o=bm(r?`And`:`Or`,n),s=xm(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,oh(e,t,i));return;case`And`:case`Or`:for(let n of e.operands)f(n,t);return;case`Apply`:if(e.operator===`=>`||e.operator===`~`&&!X(e))for(let n of e.args)f(n,t);return;case`If`:{let n=f(e.condition,t),r=n.kind===`Boolean`?[n.value?e.consequent:e.alternative]:[e.consequent,e.alternative];for(let e of r)f(e,t)}}},f=(e,t)=>{let n=nh(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,oh(e,t,i));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?vm(`Always`,ym(`Or`,vm(`Not`,f(n[0],t)),vm(`Eventually`,f(n[1],t)))):e.operator===`~`&&!X(e)?vm(`Not`,f(n[0],t)):e.operator===`=>`?ym(`Or`,vm(`Not`,f(n[0],t)),f(n[1],t)):c(e,t)}case`And`:case`Or`:return bm(e.kind,e.operands.map(e=>f(e,t)));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(nh(e.condition,t,i)===0){let n=eh(e.condition,$m(i,t));if(typeof n==`boolean`)return f(n?e.consequent:e.alternative,t)}let n=f(e.condition,t);return ym(`Or`,ym(`And`,n,f(e.consequent,t)),ym(`And`,vm(`Not`,n),f(e.alternative,t)))}case`Always`:case`Eventually`:return vm(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=sh(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=vm(`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`?vm(`Always`,vm(`Eventually`,ym(`Or`,i,a))):ym(`Or`,vm(`Eventually`,vm(`Always`,i)),vm(`Always`,vm(`Eventually`,a)))}default:throw th(e)}};return f(t,r)},lh=(e,t,n,r,i)=>{let a=e=>lh(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`?Yo(sc(e.expression,a),`a temporal property predicate`):ko(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&&Yo(sc(e.unchanged,a),`a subscript`)?!1:Yo(sc(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 lh(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`)}},uh=(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)=>uh(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 lh(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},dh=(e,t)=>e.every((e,n)=>nt(e,t[n])),fh=e=>e.filter((t,n)=>n===0||e[n-1]!==t),ph=(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),mh=(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}},hh=(e,t)=>(e.offsets[t]??-1)!==-1,gh=(e,t)=>e.pending[t]??=[],_h=(e,t)=>{let n=e.edgeOffsets[t];return e.edges.ids.subarray(n+1,n+1+e.edges.ids[n])},vh=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,yh=2**53-1,bh=(t,r,i,a)=>{if(t.length===0)return;let o=r.map(e=>ch(e.expression,e.scope,i)),s=t.map(e=>vm(`Not`,ch(e.expression,e.scope,i))),c=s.length===1?s[0]:bm(`Or`,s),l=o.length===0?c:bm(`And`,[...o,c]),u=Ym(l);if(u.length===0)throw n(new y(ih),e.livenessEvaluationFailure);let d=/* @__PURE__ */ new Map,f=u.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=Tm(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=!Hs(i),h={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},g=e=>{let t=h.states.get(e)??/* @__PURE__ */ new Map;return h.states.set(e,t),t},_=(e,t)=>{i.runtime.setLivenessSource(e);let n=t();return i.runtime.setLivenessSource(void 0),n},v=(e,t)=>lh(e,t,void 0,i,m?g(t):/* @__PURE__ */ new Map),b=(e,t,n)=>_(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!v(e,n))),ee=(e,t,n,r)=>_(t,()=>{let t=e.solution.actionChecks;if(!m)return Uint8Array.from(t,e=>+!!lh(e,n,r,i,/* @__PURE__ */ new Map));let a=g(n),o=h.actions.get(n)??/* @__PURE__ */ new Map;h.actions.set(n,o);let s=o.get(r)??new Int8Array(d.size).fill(-1);return o.set(r,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!lh(t[o],n,r,i,a)),s[e]))}),x=(e,t,n,r)=>_(n,()=>e.nodes[t].statePredicates.every(e=>v(e,r))),S=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},C=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),w=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=mh(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},T=(e,t,n)=>{let r=ph(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),mh(i,e[t]-1,e[t+1]))}return i.slots.set([t+1,n,r],mh(i,t,n)),r},te=(e,t,n)=>t.nodes.flatMap((t,r)=>w(e,n,r)??[]).sort((e,t)=>e-t),ne=(e,t,n,r)=>{let i=e.solution.actionChecks.length,a=e.results,o=a.length;if(a.length+=r.length+n.length*i,a.length>a.bytes.length){let e=new Uint8Array(Math.max(2*a.bytes.length,a.length));e.set(a.bytes),a.bytes=e}a.bytes.set(r,o),n.forEach((e,t)=>a.bytes.set(e,o+r.length+t*i)),e.offsets[t]=o;let s=e.pending[t]??[],c=e.edges,l=c.length;if(c.length+=s.length+1,c.length>c.ids.length){let e=new Int32Array(Math.max(2*c.ids.length,c.length));e.set(c.ids),c.ids=e}c.ids[l]=s.length,c.ids.set(s,l+1),e.edgeOffsets[t]=l,e.pending[t]=void 0},E=(e,t,n)=>{let r={slots:Array.from({length:16*p.multiplier}),count:0},i=(e,t)=>{for(let n=(a.getFingerprint(t.index)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&dh(r.state,t.state))return!1}},o=e=>{if(r.count>=r.slots.length>>1){let e=r.slots;r.slots=Array.from({length:2*e.length+1});for(let t of e)t&&i(r.slots,t)}i(r.slots,e)&&r.count++};return n.forEach(o),o({index:e,state:t}),r.slots.length>16*p.multiplier&&p.multiplier++,r.slots.filter(e=>e!==void 0)},re=(e,t,n,r,i)=>{let o=b(e,r,n),s=t.nodes[e.nodeTableaux[i]],c=[],l=gh(e,i),u=s.successors.length>0?ee(e,r,n,n):/* @__PURE__ */ new Uint8Array;for(let a of s.successors){if(!x(t,a,r,n))continue;if(S(t,a)&&e.errorNode===void 0&&C(e)){e.errorNode=i;return}let o=w(e,r,a);if(o!==void 0&&l.includes(o))continue;let s=o??T(e,r,a);l.push(s),c.push(u),o===void 0&&re(e,t,n,r,s)}for(let i of a.getSuccessors(n)){let a=ee(e,r,n,i.state),o=e.isDone[i.index]===!0;for(let n of s.successors){if(!x(t,n,r,i.state))continue;let s=w(e,i.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??T(e,i.index,n);l.push(u),c.push(a),s===void 0&&o&&re(e,t,i.state,i.index,u)}}l.length>0&&ne(e,i,c,o)},D=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>x(t,r,a,e.state)));e.isDone[a]=!0;for(let s of te(e,t,a)){let a=gh(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=w(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??T(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&re(e,t,n.state,n.index,d)}}),ne(e,s,c,i)}if(e.errorNode!==void 0)return fh(k(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},O=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)ph(e,e.nodeStates.length,-1);let a=gh(e,i),o=[];t.forEach((t,r)=>{hh(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),ne(e,i,o,r)},k=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)hh(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 _h(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}hh(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}`)},A=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=n.stateChecks.length,a=(t,n,a)=>e.results.bytes[e.offsets[t]+i+n*r+a]===1,o=(e,n)=>t.eventuallyAlways.every(t=>a(e,n,t)),s=new Float64Array(e.nodeStates.length).fill(-1),c=e.initial.filter(t=>hh(e,t)),l=[],u=t=>{let n=_h(e,t).indexOf(t);return n!==-1&&o(t,n)},d=(t,r)=>n.tableau!==void 0&&Km(n.tableau.nodes[e.nodeTableaux[t]].particle,r),f=r=>{let i=l.pop()??r;if(i===r&&!u(i)){s[i]=yh;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]=yh,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...c].some(n=>vh(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>_h(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=fh(k(e,r).reverse().map(t=>e.nodeStates[t])),l=[],u=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),p=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+p.length+h.length},_={node:r},v=e=>i.has(e),b=e=>{l.push(_.node),_.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&vh(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&d(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},i=g.count;if(_h(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!v(r)||!o(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!p[t]&&a(_.node,c,e)&&(p[t]=!0,g.count--)})}return g.count<i?(b(r),u.clear(),!0):(v(r)&&!u.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){b(n.last),u.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=_h(e,t).find(e=>v(e)&&!u.has(e))??-1}b(n.unvisited),u.add(n.unvisited)}}let ee=m(r,_.node,s,o);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()]}},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 _h(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<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++};_h(e,a).forEach((t,r)=>{hh(e,t)&&(o(a,r)?s[t]===-1?n.push(t,-1):u.value=Math.min(u.value,s[t]):s[t]===-1&&c.push(t))}),n.push(u.value)}}};return{addInitialState:(e,t)=>{h.states.clear(),h.actions.clear();for(let n of f){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)x(r,i,void 0,t)&&n.initial.push(w(n,e,i)??T(n,e,i))}},addState:(e,t,n)=>{h.states.clear(),h.actions.clear();let r=E(e,t,n);for(let n of f){let i=r.map(r=>ee(n,e,t,r.state)),a=b(n,e,t),o=n.solution.tableau,s=o?D(n,o,r,i,a,e):O(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of f)for(let t of e.solution.models){let n=A(e,t);if(n)return n}},getViolatedProperties:(e,n)=>[...new Set(t.filter((t,r)=>!uh(s[r].body,e,n,0,i)).map(e=>e.name))]}},xh=`UnnamedAction`,Sh={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Ch=e=>{let t=e.range??Sh;return Wt([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},wh=e=>{let t=[[`name`,e.name],[`location`,Ch(e.location)]];return e.parameters.length===0?Wt(t):Wt([...t,[`context`,Wt(e.parameters)],[`parameters`,Ut(e.parameters.map(e=>e[0]))]])},Th=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),Eh=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Dh=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Oh=e=>e.kind===`Apply`?e.args:[],kh=(e,t,n)=>{let r=Dh(e);if(r===void 0)return;if(X(e)){let e=Go(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=ms(r,n);return i?.kind===`Closure`?i:void 0},Ah=(e,t)=>{try{return sc(e,Eh(t,void 0)),!0}catch(e){if(e instanceof f)return!1;throw e}},jh=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Qo(e,t)&&Ah(e.body,t),Mh=(e,t)=>{let n=Xo(e.name,t);return n?.body===e.body&&jh(n,t)},Nh=(e,t)=>{if(e.kind!==`Identifier`||!X(e))return;let n=Go(t,e.name);return n?.kind===`Thunk`?n:void 0},Ph=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Go(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Fh=(e,t)=>{try{return e()}catch(e){if(e instanceof f)return t();throw e}},Ih=(e,t,n,r,i)=>{let a=Oh(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=>nh(e,n,i)!==0)?o():Fh(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),sc(e,Eh(i,n))]),expression:t,scope:n}],o)},Lh=(e,t,n,r,i)=>{let a=()=>({name:n?.name??xh,location:e.location,parameters:Ph(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Lh(e.body,As(e.definitions,Eh(r,t)),n,r,i);case`Label`:return Lh(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Lh(e,t,n,r,i));case`Exists`:return Fh(()=>{let o=[];return ts(e.bounds,Eh(r,t),t=>(o.push(...Lh(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=X(e)?void 0:i.get(Dh(e)??``),s=kh(e,t,r);if(o)return Ih(o,e,t,s,r);if(!s)return[a()];let c=Oh(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return Mh(s,r)||c.some(e=>nh(e,t,r)!==0)?l():Fh(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:sc(n,Eh(r,t))},parent:e}),s.scope);return Lh(s.body,e,s,r,i)},l)},Rh=(e,t,n,r,i)=>{let a=(e,t)=>Rh(e,t,n,r,i);if(e.kind===`Let`){a(e.body,As(e.definitions,Eh(n,t)));return}let o=Nh(e,t);if(o){a(o.expression,o.scope);return}let s=kh(e,t,n);if(s&&Mh(s,n))return;if(s&&s.params.length===0){if(nh(s.body,s.scope,n)===1){r.inits.push(Th(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,Os(s,e.args,Eh(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(Th(xh,e));return}let c=nh(e,t,n);c<=1?r.inits.push(Th(xh,e)):c===3&&r.temporals.push(Th(xh,e))},zh=(e,t,n,r,i)=>{let a=(t,n)=>zh(e,t,n,r,i);if(t.kind===`Let`){a(t.body,As(t.definitions,Eh(r,n)));return}let o=Nh(t,n);if(o){a(o.expression,o.scope);return}let s=kh(t,n,r);if(s&&Mh(s,r))return;if(s&&s.params.length===Oh(t).length){a(s.body,t.kind===`Apply`?Os(s,t.args,Eh(r,n)):s.scope);return}if(t.kind===`Forall`&&Fh(()=>(ts(t.bounds,Eh(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(Th(e,a)):nh(a,n,r)<2?i.invariants.push(Th(e,a)):i.impliedTemporals.push(Th(e,t));return}let c=nh(t,n,r);c<=1?i.impliedInits.push(Th(e,t)):c===3&&i.impliedTemporals.push(Th(e,t))},Bh=(e,t)=>{let n=Xo(e,t);return n?.kind===`Operator`&&!jh(n,t)?n:void 0},Vh=e=>Wt([[`name`,e.name],[`location`,Ch(e.location)]]),Hh=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Bh(e.specification,t);a&&(Rh(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Lh(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:ms(e.init,t);o?.kind===`Closure`&&r.inits.push(Th(e.init??``,o.body));let s=e.next===void 0?void 0:ms(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Lh(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Bh(e,t);n&&r.invariants.push(Th(e,n.body))}),e.properties.forEach(e=>{let n=Bh(e,t);n&&zh(e,n.body,void 0,t,r)}),r},Uh=(e,t,n)=>Hh(e,t,n).actions,Wh=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>Y(e[1])).join(`,`)})`,Gh=e=>`${e.name===xh?`Action`:e.name}${Wh(e)} ${g(e.location.range??Sh)}`,Kh=e=>`${e.name}${Wh(e)}`,qh=(e,t,n,r)=>{let i=Hh(e,t,r),a=e=>Dt(e.map(wh)),o=e=>Dt(e.flatMap(e=>{let n=Bh(e,t);return n?[Vh(n)]:[]}));return Wt([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,Dt(t.variables.map((e,t)=>Wt([[`name`,e],[`location`,Ch(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},Jh=`paired12`,Yh=(e,t=16)=>e<=t*.75?t:Yh(e,t*2),Xh=(e,t)=>{let n=Yh(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)},Zh=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Qh=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),$h=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),eg=e=>$h(e).replaceAll(`
|
|
428
|
+
`,`\\n`),tg=(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(``))}},ng=(e,t)=>{let n=[`strict digraph DiskGraph {
|
|
429
|
+
`,`node [shape=box,style=rounded]
|
|
430
|
+
`,e.colorize?`edge [colorscheme="${Jh}"]\n`:``,`nodesep=0.35;
|
|
431
|
+
`,`subgraph cluster_graph {
|
|
432
|
+
`,`color="white";
|
|
433
|
+
`],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=r.get(e.level)??/* @__PURE__ */ new Set;r.set(e.level,t.add(e.fingerprint))},o=e=>{if(!e)return 1;let t=i.get(e.name)??i.size+2;return i.set(e.name,t),t},s=()=>[`subgraph cluster_legend {graph[style=bold];label = "Next State Actions" style="solid"
|
|
434
|
+
`,`node [ labeljust="l",colorscheme="${Jh}",style=filled,shape=record ]\n`,...Xh([...i.keys()],Qh).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${i.get(e)}]\n`),`}`].join(``),c=()=>[...Xh([...r],e=>e[0]).map(e=>`{rank = same; ${Xh([...e[1]],Zh).map(e=>`${e};`).join(``)}}\n`),`}
|
|
435
|
+
`,e.colorize&&i.size>1?s():``,`}`].join(``),l=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),n.join(``)+c())};return{writeInitialState:e=>{n.push(`${e.fingerprint} [label="${eg(e.getLabel())}",style = filled]\n`),a(e),l()},writeSuccessor:(t,r,i,s)=>{let c=e.colorize?String(o(s)):`black`,u=e.actionLabels&&s?$h(s.signature):``;n.push(`${t.fingerprint} -> ${r.fingerprint} [label="${u}",color="${c}",fontcolor="${c}"];\n`),i||n.push(`${r.fingerprint} [label="${eg(r.getLabel())}",tooltip="${eg(r.getText())}"];\n`),a(t),l()},close:()=>t?.(e.path,n.join(``)+c())}},rg=(e,t)=>e.dot?ng(e,t):tg(e,t),ig=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),ag=(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},og=t=>n(new y(`${l}${t}`),e.error),sg=e=>{if(!Ne(e))throw og(`The symmetry values must be function records.`);let t=bn(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!P(e)||!P(i))throw new v(`Symmetry function must have model values as domain and range`);e.name!==i.name&&n.set(e.name,i)}),n},cg=(e,t)=>{let n=t.definitions.get(e);if(n===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(n?.kind!==`Operator`||n.params.length>0)throw og(`The symmetry function ${e} must specify a set of permutations.`);let r=sc(n.body,{environment:t,scope:void 0,state:void 0,next:void 0});if(!je(r)||!K(r))throw og(`The symmetry operator must specify a set of functions.`);let i=q(r).elements.map(sg);if(n.body.kind===`Apply`&&n.body.args.length>=i.length)return[];let a=/* @__PURE__ */ new Map;i.forEach(e=>{e.size>0&&a.set(ig(e),e)});let o=[...a.values()],s={start:0};for(;s.start<a.size;){let e=[...a.values()],t=e.length;o.forEach(n=>e.slice(s.start,t).forEach(e=>{let t=ag(n,e),r=ig(t);t.size>0&&!a.has(r)&&a.set(r,t)})),s.start=t}let c=Math.max(256,Math.floor(4194304/a.size));return[...a.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:c}))},lg=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=fg(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(fg(e[r],t));return a}},ug=(e,t)=>{let n=[],r=[];for(let i of e){let e=fg(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Ye);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Ye(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},dg=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,fg=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=dg(e);if(n===0||n>64)return pg(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=pg(e,t),a=i!==e&&nt(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},pg=(e,t)=>{let n=e.kind;if(n===`Set`){let n=ug(e.elements,t);return n?Qe(n):e}if(n===`Function`||n===`LazyFunction`&&K(e.domain)){let n=bn(e),r=lg(n.domain,t),i=lg(n.range,t)??n.range;if(r){let e=Nt(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?$e(n.domain,e.range):e}return i===n.range?n:$e(n.domain,i)}if(n===`Interval`||!je(e)||!K(e))return e;let r=q(e),i=lg(r.elements,t);return i?Dt(i):r},mg=(e,t,n)=>{for(let r=t.length;r<e.length;r++)t.push(fg(e[r],n));return t},hg=(e,t,n,r)=>{let i=[];for(let a=0;a<e.length;a++){let o=r?r[a]:a,s=fg(e[o],n),c=Ye(s,t[o]);if(c>0)return;if(r||i.push(s),c<0)return r?e.map(e=>fg(e,n)):mg(e,i,n)}},gg=(e,t,n)=>t.reduce((t,r)=>hg(e,t,r,n)??t,e),_g=(e,t)=>e*((t-e)/2**64),vg=e=>e.includes(`.`)?e:`${e}.0`,yg=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return vg(String(e));let[n,r]=e.toExponential().split(`e`);return`${vg(n)}E${r.replace(`+`,``)}`},bg=e=>e!==void 0&&e>=`0`&&e<=`9`,xg=e=>{if(e===0)return`0.0`;let t=yg(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;bg(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(;bg(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;bg(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(bg(t[n.next])&&Number(t[n.next])>=5&&(n.result=Sg(n.result));bg(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Sg=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Sg(r)}.`:n===`9`?`${Sg(r)}0`:`${r}${Number(n)+1}`},Cg=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}`)},wg=(e,t,n)=>{if(_g(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},Tg=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}).`},Eg={line:0,column:0},Dg=`Failed to recover the initial state from its fingerprint.`,Og=`Failed to recover the next state from its fingerprint.`,kg=e=>({kind:`Identifier`,name:e,location:Eg}),Ag=/* @__PURE__ */ new Set([`name`,`property`]),jg=(e,t,n)=>{let r=Xo(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(Ag.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},Mg=(e,t,n)=>{let r=jg(e,t,n);if(Qo(r,n))throw new v(`The ${e} ${t} cannot be a constant.`);return r},Ng=(e,t,n)=>{if(Qo(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return sc(kg(e),Qg(n,void 0,void 0))}catch(e){if(e instanceof y||d(e))return;throw e}},Pg=(e,t,n)=>{let r=jg(e,t,n),i=Ng(t,r,n);if(i!==void 0&&i!==!0)throw new v(`The ${e} of ${t} is equal to ${Y(i)}`);return i===void 0?r:void 0},Fg=(t,r)=>{let i=Np({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>Xo(e,r)});return t.flatMap(t=>{let a=Pg(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
|
|
411
436
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
412
437
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
413
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`}`);return[{name:e,expression:sm(e),scope:void 0}]})},mm=(e,t)=>{if(!j(e))return;let n=H(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},hm=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>hm(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Za(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return hm(n.body,t)}return[e]},gm=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||$(r,e.scope,t)>0)return!1;let i=X(r,Am(t,void 0,void 0,e.scope));if(i===!1)throw new p(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new p(`The operator ${r.name}, which equals ${U(i)},\ncannot be used as a ${n}`);return!0},_m=(t,n)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let r=lm(t,e,n).body,i=sm(e);if(r.kind!==`Number`&&r.kind!==`String`&&$(i,void 0,n)===0)throw new p(`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 r=[],i=[],o=[],s=lm(`name`,t.specification,n),c=dm(t.specification,s,n);if(c!==void 0)throw new p(`The value of ${t.specification} is equal to ${U(c)}`);if(Nf(s.body,void 0,n,!1).forEach(s=>{let c=s.expression;if(gm(s,n,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw a(new p(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){i.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&$(c.expression,s.scope,n)<2)throw new p(`TLC cannot handle []P in the specification ${t.specification} when P is a state predicate`);let l=$(c,s.scope,n);if(l===3)o.push(s);else{if(l===2)throw new p(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);r.push(s)}}),i.length>1)throw new p(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...r,...i],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:r.length===0?void 0:{kind:`And`,operands:r.map(f),location:im},next:i.length===0?void 0:f(i[0],r.length),scope:d,temporals:o}},vm=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=fm(`property`,e,t);r&&Nf(r.body,void 0,t,!0).forEach(r=>{let i=r.expression;if(gm(r,t,`property`))return;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){n.actionProperties.push({name:e,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){n.invariants.push({name:e,expression:i.expression,scope:r.scope});return}let a=$(i,r.scope,t);if(a<2)n.initialPredicates.push({name:e,expression:i,scope:r.scope});else{if(a===2)throw new p(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},ym=(e,t,n)=>t.flatMap(t=>fm(e,t,n)?[{name:t,expression:sm(t),scope:void 0}]:[]),bm=(e,t)=>{let n=Za(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},xm=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new p(`_POSSIBLE lists ${n} more than once`);um(`possible`,n,t);let i=sm(n);if($(i,void 0,t)===3)throw new p(`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}}),Sm=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||J(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Cm=(e,t)=>e.flatMap(e=>hm(e.expression,t).map(n=>{let r=ks(n,t);return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Sm(n,r,t)}})),wm=(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},Tm=/[\u0100-\uffff]/,Em=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Dm=e=>e.kind===`String`?Tm.test(e.value):e.kind===`Set`&&e.elements.some(Dm),Om=e=>e.kind===`String`&&Tm.test(e.value)||e.kind===`Apply`&&Em.has(e.operator)||Xa(e).some(Om),km=(e,t)=>e.constants.some(e=>Dm(e.value)||(e.args??[]).some(Dm))||[...t.definitions.values()].some(e=>Om(e.body)||e.kind===`Function`&&e.bounds.some(e=>Om(e.set))),Am=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),jm=(e,t,n)=>Ya(X(e,t),n),Mm=(e,t,n=Nm)=>{let r=X(e,t);if(typeof r!=`boolean`)throw new m(n(e,t.environment));return r},Nm=(e,t)=>{let n=e.kind===`Identifier`?Za(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?Ia(i):La(r)}`},Pm=()=>{},Fm=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=jm(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Im=(e,t,n)=>{try{return jm(e,Am(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof m)return{message:e.message};throw e}},Lm=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Im(n.expression,t,`an assumption`);if(e)return{name:La(n.expression),trace:[],message:e.message}}},Rm=(t,n,r)=>{let i=pm(t.invariants,n),o=_m(t,n),s=vm(t,n),c=Cm([...i,...s.invariants],n),l=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(l||s.initialPredicates.length>0||n.variables.length>0))throw new p(`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&l)throw new p(`The configuration file did not specify the next state predicate.`);let d=Cm(ym(`constraint`,t.constraints,n),n),f=ym(`action constraint`,t.actionConstraints,n);t.rlReward!==void 0&&lm(`rlreward`,t.rlReward,n),t.periodic!==void 0&&lm(`periodic`,t.periodic,n);let m=xm(t.possible,n);if(n.variables.length===0)return;let h=t.symmetry===void 0?[]:xp(t.symmetry,n);t.view!==void 0&&lm(`view function`,t.view,n);let g=t.view===void 0?void 0:{name:t.view,expression:sm(t.view),scope:void 0},_=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:im};return{...e,unchanged:t}}),v=e=>$(e.expression,void 0,n)>=2,y=m.filter(e=>!v(e)),ee=m.filter(v),b=n.runtime,x={indices:void 0},te=()=>{if(x.indices)return x.indices;let e=r(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return x.indices=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),x.indices},ne=h.length>0?te():void 0,S=(e,t)=>X(e,Am(n,t,void 0)),C=e=>{let t=te(),n=h.length===0?e:kp(e,h,t);return Ec(g===void 0?t.map(e=>n[e]):[S(g.expression,n)])},re=km(t,n);b.getFingerprint=C;let ie=()=>{let e=m.find(e=>!b.possibleCounts.get(e.name));if(!e)return;let t=bm(e.name,n),r=t?` at ${Ia(t)}`:``;return{name:e.name,message:`The _POSSIBLE predicate ${e.name}${r} 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(U(Gc(b),!0))}};return{properties:s,spec:o,isSymmetric:h.length>0,getTlcOrder:te,getStoredFingerprints:(e,t)=>{if(g!==void 0||re)return BigInt64Array.from(e,C);let n=te(),r=kc();return BigInt64Array.from(t,e=>r(n.map(t=>e[t])))},getFingerprintState:e=>{if(re)return[String(C(e))];let t=h.length===0?e:kp(e,h,ne);return g===void 0?t:[S(g.expression,t)]},findViolatedInvariant:(t,r)=>c.find(i=>{if(wm(i,t,r))return!1;try{let e=Am(n,t,void 0,i.scope),a=i.membership;return r&&a?!$t(t[a.variable],r[a.variable],X(a.set,e)):!Mm(i.expression,e)}catch(t){throw r?zm(a(t,e.safetyEvaluationFailure),`Evaluating invariant ${i.name} failed.`):t}}),satisfiesConstraints:(e,t)=>d.every(r=>wm(r,e,t)||Mm(r.expression,Am(n,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!Mm(t.expression,Am(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>_.find(r=>{try{return!Mm(r.action,Am(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${La(r.box)}`)&&!jm(r.unchanged,Am(n,e,t,r.scope),`a subscript`)}catch(e){throw zm(e,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>f.every(r=>Mm(r.expression,Am(n,e,t),e=>`${u}${Nm(e,n)}`)),trackStatePossible:y.length===0?Pm:e=>Fm(y,b,Am(n,e,void 0)),trackActionPossible:ee.length===0?Pm:(e,t)=>Fm(ee,b,Am(n,e,t)),findUnwitnessedPossible:ie,findPostconditionViolation:()=>{let e=ie();if(e)return e;for(let e of t.postconditions){let t=Im(sm(e),n,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},zm=(e,t)=>e instanceof m?a(new m(`${t}\n${e.message}`,e),y(e)):e,Bm=e=>{i(!1);let t=typeof e.config==`string`?le(e.config):e.config,n=e.onPrint??console.log,r={isMuted:!1},a=e=>{r.isMuted||n(e)},o=e=>{r.isMuted=!0;let t=e();return r.isMuted=!1,t};Oe(Jp(e.source,t,e.loadModule));let s=Kd(t,{source:e.source,loadModule:e.loadModule,loadClass:e.loadClass,print:a,files:{readFile:e.readFile,writeFile:e.writeFile},seed:e.seed}),c=s.environment,u=c.runtime;u.pause=e.onPause??(()=>{}),u.getSpecification=()=>_p(t,c,s.variableLocations,s.instanceActions);let d={depth:0},f=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:u.generatedStates,distinctStates:u.distinctStates,queuedStates:u.queueSize,depth:u.generatedStates===0?0:Math.max(d.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),g=Array.from({length:32},()=>0),_={newStates:0},v=()=>Math.min(_.newStates,31),ee=()=>g.map((e,t)=>t===v()?e+1:e),b=()=>({...f(`success`),outDegrees:[...g],fingerprintDistance:nm(u.distinctStates,u.generatedStates,()=>x?x.getStoredFingerprints(D,O):BigInt64Array.from(D,u.getFingerprint))}),x=Rm(t,c,()=>qp(e.source,e.loadModule)),te=Lm(s.assumptions,c);if(te)return f(`assumption-violation`,te);if(!x)return b();let ne=t.postconditions.length>0||t.possible.length>0,S=(e,t,n)=>{if(ne){let e=t.loopStart;u.counterExample=Jl(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=x.findUnwitnessedPossible();return r||x.findPostconditionViolation(),f(e,r?{...t,unwitnessed:r}:t)},C=x.spec,re=x.getFingerprintState,ie={value:void 0},ae=t.view!==void 0||t.symmetry!==void 0,w=[],T=l(()=>Kf(x.properties.liveness,C.temporals,c,{getFingerprint:e=>w[e]??=Number(BigInt.asIntN(32,u.getFingerprint(D[e]))),getSuccessors:e=>{let t=[];return C.next===void 0||Pa(C.next,e,c,n=>{if(ue(n.state),!(x.satisfiesConstraints(n.state,e)&&x.satisfiesActionConstraints(e,n.state)))return!1;let r=re(n.state),i=Ce(xe(r),r);return t.push({index:i,state:n.state}),!1},C.scope),t}})),E=x.isSymmetric||T!==void 0,D=[],O=[],oe=[],se=[],k=[],ce=/* @__PURE__ */ new Map,ue=Pn(),de=e=>Object.fromEntries(x.getTlcOrder().map(t=>[c.variables[t],e[t]])),fe=(e,t,n,r)=>{let i=t[n].state,a=(t[n+1]??t[r??n]).state;u.getLevel=()=>n+1,u.getBehavior=()=>t.slice(0,n+1).map(e=>e.state);try{let t=um(`alias`,e,c).body,n=X(sm(e),Am(c,i,a)),r=t.kind===`Record`?t.fields.map(e=>e.name):[];return mm(n,r)??de(i)}catch(e){if(!(e instanceof p||e instanceof m))throw e;return{...de(i),_ALIASEvalError:e.message}}},pe=(e,n,r)=>{ie.value??=hp(t,c,s.instanceActions);let i={...P};Object.assign(P,{index:e,isExpanding:!0,candidate:void 0});let a=re(r),o=ie.value.find(e=>Fa(e.expression,n,c,e.scope).some(e=>Se(re(e.state),a)));return Object.assign(P,i),o&&gp(o)},me=(e,n,r)=>{let i=t.alias,a=o(()=>(e.length>1&&Uo(c)&&he(),e.map((t,r)=>r===0||t.action===`Stuttering`?void 0:pe(n[r-1],e[r-1].state,t.state))));return e.map((t,n)=>({action:t.action,label:a[n],state:i===void 0?de(t.state):fe(i,e,n,r)}))},he=()=>C.init===void 0?[]:Na(C.init,c,C.scope),A=e=>C.next===void 0?[]:Fa(C.next,e,c,C.scope),j=(e,t)=>Se(re(e),O[t]),M=(e,t)=>A(e).find(e=>j(e.state,t)),ge=(e,t)=>{let n=ae||Uo(c)?he().find(t=>j(t,e[0])):D[e[0]];if(!n)throw new m(am);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=M(i,e[n]);if(!a)throw new m(t);r.push(a)}return r},_e=(e,t)=>{let n=[];for(let t=e;t!==-1;t=oe[t])n.unshift(t);let r=ae&&n.length>1?ge(n,am):n.map(e=>({state:D[e],action:se[e]}));if(!t)return me(r,n);let i=ae?A(D[e]).find(e=>Se(e.state,t.state))?.action:t.action;return me([...r,{state:t.state,action:i}],n)},ve=e=>oe[e]===-1?[{action:void 0,label:void 0,state:de(D[e])}]:_e(e),ye=(e,t,n,r)=>{if(!(e instanceof m))throw e;return{...f(`error`,void 0,{message:e.message,trace:t,initialState:n&&!(e instanceof h)?de(n):void 0,exitCode:y(e)}),outDegrees:r}},be=(e,t)=>{let n=ge(e,om),r=n[n.length-1].state;if(ae&&t!==void 0&&t!==e.length-1&&M(r,e[t])===void 0)throw new m(om);return n},xe=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=dn(t,gn(e[n]));return t&1073741823},Se=(e,t)=>{for(let n=0;n<t.length;n++)if(!Ue(e[n],t[n]))return!1;return!0},Ce=(e,t)=>{let n=ce.get(e);return n===void 0?-1:typeof n==`number`?Se(O[n],t)?n:-1:n.find(e=>Se(O[e],t))??-1},N=(e,t)=>{let n=ce.get(e);n===void 0?ce.set(e,t):typeof n==`number`?ce.set(e,[n,t]):n.push(t)},we=e=>{u.distinctStates=D.length+1,d.depth=Math.max(d.depth,e),u.diameter=Math.max(u.diameter,e)},Te=(e,t,n,r)=>{let i=n===-1?1:k[n]+1;D.push(e),O.push(t),oe.push(n),se.push(r),k.push(i)},P={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},Ee=e=>e===-1?[]:[...Ee(oe[e]),D[e]];u.isSeen=e=>{let t=re(e);return Ce(xe(t),t)!==-1},u.getBehavior=e=>{let t=e===P.candidate?-1:D.indexOf(e);return t===-1?[...Ee(P.index),e]:Ee(t)},u.getCurrentState=()=>P.index===-1?void 0:D[P.index],u.setLivenessSource=e=>{P.livenessSource=e??-1},u.getLevel=e=>{let t=P.livenessSource;return t===-1?e===P.candidate?P.candidateLevel:P.index===-1?0:e===D[P.index]?k[P.index]:P.isExpanding?k[P.index]+1:0:e===D[t]?k[t]:k[t]+1};let De=e=>{ue(e),u.generatedStates++,u.initialStates++,P.candidate=e,P.candidateLevel=1;let t=re(e),n=xe(t),r=x.satisfiesConstraints(e);if(r&&x.trackStatePossible(e),r&&Ce(n,t)!==-1)return;r&&(we(1),u.queueSize++,T?.addInitialState(D.length,e));let i=x.findViolatedInvariant(e);if(i)return S(`invariant-violation`,{name:i.name,trace:me([{action:void 0,state:e}],[])});let a=x.findFailedInitialPredicate(e);if(a)return S(`liveness-violation`,{name:a.name,trace:me([{action:void 0,state:e}],[])});r&&(N(n,D.length),Te(e,t,-1,void 0))},ke=(e,t,n)=>{let r=D[e];u.generatedStates++,P.candidate=t.state,P.candidateLevel=k[e]+1,E&&ue(t.state);let i=re(t.state),a=xe(i),o=Ce(a,i),s=x.satisfiesConstraints(t.state,r);s&&x.trackStatePossible(t.state);let c=s&&x.satisfiesActionConstraints(r,t.state);c&&x.trackActionPossible(r,t.state);let l=c?o:-1;if(l!==-1&&T){let e=D[l],r=e.every((e,n)=>e===t.state[n]);n.push({index:l,state:r?e:t.state})}let d=c&&l===-1;if(d&&(we(k[e]+1),_.newStates++),l===-1)try{let n=x.findViolatedInvariant(t.state,r);if(n)return S(`invariant-violation`,{name:n.name,trace:_e(e,t)})}catch(n){return ye(n,_e(e,t),void 0,ee())}let f=x.findViolatedActionProperty(r,t.state);if(f)return S(`liveness-violation`,{name:f.name,trace:_e(e,t)});d&&(E||ue(t.state),N(a,D.length),T&&n.push({index:D.length,state:t.state}),Te(t.state,i,e,t.action),u.queueSize++)},Ae={result:void 0};if(C.init!==void 0)try{Ma(C.init,c,e=>{try{Ae.result=De(e)}catch(t){Ae.result=ye(t,[],e)}return Ae.result!==void 0},C.scope)}catch(e){return ye(e,[])}if(Ae.result)return Ae.result;let je=C.next;if(je===void 0){if(D.length>0)throw new m(`No next state actions defined to generate successor states from.`);return b()}let Me=e=>{let n=D[e],r=[],i=Pa(je,n,c,t=>{try{Ae.result=ke(e,t,r)}catch(n){Ae.result=ye(n,_e(e,t))}return Ae.result!==void 0},C.scope);if(P.isExpanding=!1,Ae.result)return Ae.result;if(i===0&&t.checkDeadlock)return S(`deadlock`,{name:`deadlock`,trace:ve(e)});try{let t=T?.addState(e,n,r);if(!T||!t)return;let i=be(t),a=T.getViolatedProperties(i.map(e=>e.state),i.length-1);return S(`property-violation`,{name:a[0],properties:a,trace:me(i,t)})}catch(t){return ye(t,ve(e),void 0,ee())}},F=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=be(n,r),a=me(i,n,r),s=e.getViolatedProperties(i.map(e=>e.state),r),c=n[r],l=n[n.length-1],u=i[i.length-1].state,d=c===l?void 0:o(()=>pe(l,u,D[c]));return S(`liveness-violation`,{name:s[0],properties:s,trace:a,loopStart:r,loopLabel:d},()=>c===l?a[a.length-1].action:M(u,c)?.action)},Ne=T!==void 0&&e.livenessCheck!==`final`,Pe=performance.now(),Fe={at:Pe+3e3,size:1,time:0},Ie=e=>{let t=performance.now();if(Fe.at=t+6e4,!((e-Fe.size)/Fe.size>.1)||Fe.time>(t-Pe)*.2)return;Fe.size=e;let n=T?.findViolation();return Fe.time+=performance.now()-t,n};i(!0);for(let e=0;e<D.length&&!u.isStopped;e++){P.index=e,P.candidate=void 0,u.queueSize=D.length-e-1,P.isExpanding=!0;try{Ae.result=Me(e)}catch(t){Ae.result=ye(t,ve(e))}if(Ae.result)return Ae.result;if(g[v()]++,_.newStates=0,Ne&&performance.now()>=Fe.at){let t=Ie(e+1);if(T&&t)return F(T,t)}}P.index=-1,P.candidate=void 0;let I=T?.findViolation();if(T&&I)return F(T,I);let Le=x.findPostconditionViolation();return Le?f(`postcondition-violation`,{...Le,trace:[]}):b()},Vm=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Hm=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^gn(e[t]),16777619),r=Math.imul(r^Cn(e[t]),1540483477);t[0]=Vm(n)||1,t[1]=Vm(r)},Um=()=>{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)}}},Wm=(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}},Gm=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Km=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Wm(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},qm=e=>Atomics.load(e.used,0)*2>=e.slots.length,Jm=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Wm(t,n);return{slots:t,used:e.used}},Ym=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=on(e.domain);return t?(r(7),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},Xm=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 Re(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=At({kind:`Interval`,low:e,high:e+t-1});return Be(a,i(t))}let a=n[r.index++];if(e===5)return ze(i(a));let o=i(a);return Be(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return le}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Na}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return Ae}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return U}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return g}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return v}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return d}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return Oe}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return m}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return _}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return Uo}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Pn}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return Jp}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Jm}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return lc}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Hm}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return Lm}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return $p}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return rm}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return Yp}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Gm}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return oe}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return he}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return Bm}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return nm}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Ym}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return Km}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return tm}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return Um}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return qm}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return Xm}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return Rm}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return qp}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Fa}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return uc}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return Kd}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return y}});
|
|
438
|
+
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:kg(t),scope:void 0}]})},Ig=(e,t)=>{if(!Ne(e))return;let n=bn(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])))},Lg=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Lg(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Xo(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Lg(n.body,t)}return[e]},Rg=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||nh(r,e.scope,t)>0)return!1;let i=sc(r,Qg(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 ${Y(i)},\ncannot be used as a ${n}`);return!0},zg=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=jg(t,e,r).body,i=kg(e);if(n.kind!==`Number`&&n.kind!==`String`&&nh(i,void 0,r)===0)throw new v(`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=jg(`name`,t.specification,r),c=Ng(t.specification,s,r);if(c!==void 0)throw new v(`The value of ${t.specification} is equal to ${Y(c)}`);if(ah(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Rg(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`&&nh(c.expression,s.scope,r)<2)throw n(new v(`TLC cannot handle the temporal formula ${Fo(c.expression)}`),e.error);let l=nh(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:Eg},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},Bg=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=Pg(`property`,e,t);r&&ah(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(Rg(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`&&nh(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=nh(i,r.scope,t);if(a<2)n.initialPredicates.push({name:r.name,expression:i,scope:r.scope});else{if(a===2)throw new v(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},Vg=(e,t,n)=>t.flatMap(t=>Pg(e,t,n)?[{name:t,expression:kg(t),scope:void 0}]:[]),Hg=(e,t)=>{let n=Xo(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Ug=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);Mg(`possible`,n,t);let i=kg(n);if(nh(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}}),Wg=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||X(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Gg=(e,t)=>e.flatMap(e=>Lg(e.expression,t).map(n=>{let r=e.scope===void 0?Bc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Wg(n,r,t)}})),Kg=(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},qg=/[\u0100-\uffff]/,Jg=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Yg=e=>e.kind===`String`?qg.test(e.value):e.kind===`Set`&&e.elements.some(Yg),Xg=e=>e.kind===`String`&&qg.test(e.value)||e.kind===`Apply`&&Jg.has(e.operator)||ur(e).some(Xg),Zg=(e,t)=>e.constants.some(e=>Yg(e.value)||(e.args??[]).some(Yg))||[...t.definitions.values()].some(e=>Xg(e.body)||e.kind===`Function`&&e.bounds.some(e=>Xg(e.set))),Qg=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),$g=(e,t,n)=>Yo(sc(e,t),n),e_=(e,t,n=t_)=>{let r=sc(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},t_=(e,t)=>{let n=e.kind===`Identifier`?Xo(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${r.kind===`Number`?r.text??String(r.value):i?g(i):Fo(r)}`},n_=()=>{},r_=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=$g(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),i_=(e,t,n)=>{try{return $g(e,Qg(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},a_=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=i_(n.expression,t,`an assumption`);if(e)return{name:Fo(n.expression),trace:[],message:e.message}}},o_=(t,r,i)=>{let a=Fg(t.invariants,r),o=zg(t,r),s=Bg(t,r),c=Gg([...a,...s.invariants],r),l=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(l||s.initialPredicates.length>0||r.variables.length>0))throw new v(`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&l)throw new v(`The configuration file did not specify the next state predicate.`);let u=Gg(Vg(`constraint`,t.constraints,r),r),d=Vg(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&jg(`rlreward`,t.rlReward,r),t.periodic!==void 0&&jg(`periodic`,t.periodic,r);let f=Ug(t.possible,r);if(r.variables.length===0)return;let p=t.symmetry===void 0?[]:cg(t.symmetry,r);t.view!==void 0&&jg(`view function`,t.view,r);let m=t.view===void 0?void 0:{name:t.view,expression:kg(t.view),scope:void 0},h=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Eg};return{...e,unchanged:t}}),_=e=>nh(e.expression,void 0,r)>=2,y=f.filter(e=>!_(e)),b=f.filter(_),ee=r.runtime,x={indices:void 0},S=()=>{if(x.indices)return x.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return x.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),x.indices},C=p.length>0?S():void 0,w=(e,t)=>sc(e,Qg(r,t,void 0)),T=e=>{let t=S(),n=p.length===0?e:gg(e,p,t);return Ll(m===void 0?t.map(e=>n[e]):[w(m.expression,n)])},te=Zg(t,r);ee.getFingerprint=T;let ne=()=>{let e=f.find(e=>!ee.possibleCounts.get(e.name));if(!e)return;let t=Hg(e.name,r),n=t?` at ${g(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:De(Y(nu(ee),!0))}};return{properties:s,spec:o,isSymmetric:p.length>0,getTlcOrder:S,getStoredFingerprints:(e,t)=>{if(m!==void 0||te)return BigInt64Array.from(e,T);let n=new BigInt64Array(t.length),r=Bl(S(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(te)return[String(T(e))];let t=p.length===0?e:gg(e,p,C);return m===void 0?t:[w(m.expression,t)]},findViolatedInvariant:(t,i)=>c.find(a=>{if(Kg(a,t,i))return!1;try{let e=Qg(r,t,void 0,a.scope),n=a.membership;return i&&n?!yn(t[n.variable],i[n.variable],sc(n.set,e)):!e_(a.expression,e)}catch(t){throw i?f_(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>u.every(n=>{try{return Kg(n,e,t)||e_(n.expression,Qg(r,e,void 0))}catch(e){throw t?c_(e):e}}),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!e_(t.expression,Qg(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>h.find(n=>{try{return!e_(n.action,Qg(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Fo(n.box)}`)&&!$g(n.unchanged,Qg(r,e,t,n.scope),`a subscript`)}catch(e){throw f_(s_(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>d.every(n=>{try{return e_(n.expression,Qg(r,e,t))}catch(e){throw c_(e)}}),trackStatePossible:y.length===0?n_:e=>r_(y,ee,Qg(r,e,void 0)),trackActionPossible:b.length===0?n_:(e,t)=>r_(b,ee,Qg(r,e,t)),findUnwitnessedPossible:ne,findPostconditionViolation:()=>{let e=ne();if(e)return e;for(let e of t.postconditions){let t=i_(kg(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},s_=e=>e instanceof b?n(e,e.exitCode):e,c_=e=>e instanceof y&&!(e instanceof b)&&!(e instanceof x)?n(new y(`${l}${e.message}`,e),te(e)):s_(e),l_=(e,t,n)=>t>0&&n[t-1]===e,u_=e=>e.flatMap(e=>e.location.range?[g(e.location.range)]:[]).filter((e,t,n)=>!l_(e,t,n)).map((e,t)=>`${t}) ${e}`).reverse(),d_=(e,t)=>{try{return e(),{callStack:void 0}}catch(e){if(!(e instanceof y))return{callStack:[]};let n=t.flatMap(e=>{let t=e.location.range;return t?[`Line ${t.start.line}, column ${t.start.column} to line ${t.end.line}, column ${t.end.column} in ${t.module}`]:[]}).filter((e,t,n)=>!l_(e,t,n)),r=ke(e);return{callStack:n,fingerprint:r&&{sources:u_(r),reason:e.message}}}},f_=(e,t)=>e instanceof y?n(new y(`${t}\n${e.message}`,e),te(e)):e,p_=t=>{let r=t.dump&&rg(t.dump,t.writeFile);try{return m_(t,r)}catch(t){throw d(t)?n(new y(u),e.error):t}finally{r?.close()}},m_=(t,r)=>{let i=typeof t.config==`string`?xe(t.config):t.config,a=t.onPrint??console.log,o={isMuted:!1,replayed:void 0},s=e=>{o.replayed?o.replayed.push(e):o.isMuted||a(e)},l=e=>{o.isMuted=!0;let t=e();return o.isMuted=!1,t};U(nm(t.source,i,t.loadModule));let f=fm(i,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:s,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed}),p=f.environment,m=p.runtime;m.pause=t.onPause??(()=>{}),m.getSpecification=()=>qh(i,p,f.variableLocations,f.instanceActions);let h={depth:0},g=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:m.generatedStates,distinctStates:m.distinctStates,queuedStates:m.queueSize,depth:m.generatedStates===0?0:Math.max(h.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),_=Array.from({length:32},()=>0),ee={newStates:0},C=()=>Math.min(ee.newStates,31),w=()=>_.map((e,t)=>t===C()?e+1:e),T=()=>({...g(`success`),outDegrees:[..._],fingerprintDistance:wg(m.distinctStates,m.generatedStates,()=>E?E.getStoredFingerprints(M,me):BigInt64Array.from(M,m.getFingerprint))}),ne=()=>tm(t.source,t.loadModule,`variable`),E=o_(i,p,ne),re=a_(f.assumptions,p);if(re)return g(`assumption-violation`,re);if(!E)return T();let D=i.postconditions.length>0||i.possible.length>0,O=(e,t,n)=>{if(D){let e=t.loopStart;m.counterExample=Yd(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=E.findUnwitnessedPossible();return r||E.findPostconditionViolation(),g(e,r?{...t,unwitnessed:r}:t)},k=E.spec,A=E.getFingerprintState,ie={value:void 0},j=(e,t,n=!1)=>{if(!e.failure)return e;let r=[],a={...p,evaluators:/* @__PURE__ */ new WeakMap,trace:r},s=o_(i,a,ne);if(!s)return e;let c=[];o.replayed=c,N.current=/* @__PURE__ */ new WeakMap;let l=d_(()=>t(s,a),r);return N.current=void 0,o.replayed=void 0,{...e,failure:{...e.failure,replay:{output:c,...l,isBeforeError:n}}}},ae=(e,t)=>{try{Fe(A(e))}catch(e){throw t.trace&&ke(e)&&(t.trace.length=0),e}},oe=e=>j(e,(e,t)=>{k.init!==void 0&&Ao(k.init,t,n=>(e.satisfiesConstraints(n)&&ae(n,t),e.findViolatedInvariant(n)!==void 0||e.findFailedInitialPredicate(n)!==void 0),k.scope)}),se=e=>{let t=he[e];t===-1?Ee():(se(t),we(t,M[t],M[e]))},ce=(e,t)=>j(e,(e,n)=>{se(t);let r=M[t];ie.value??=Uh(i,p,f.instanceActions),ie.value.find(t=>No(t.expression,r,n,t.scope).some(t=>{let i=e.satisfiesConstraints(t.state)&&e.satisfiesActionConstraints(r,t.state);return i&&ae(t.state,n),!i&&e.findViolatedInvariant(t.state)!==void 0||e.findViolatedActionProperty(r,t.state)!==void 0}))}),le=i.view!==void 0||i.symmetry!==void 0,ue=[],de={getFingerprint:e=>ue[e]??=Number(BigInt.asIntN(32,m.getFingerprint(M[e]))),getSuccessors:e=>{let t=[];return k.next===void 0||Mo(k.next,e,p,n=>{if(ye(n.state),!(E.satisfiesConstraints(n.state,e)&&E.satisfiesActionConstraints(e,n.state)))return!1;let r=A(n.state),i=Le(Fe(r),r);return t.push({index:i,state:n.state}),!1},k.scope),t}},fe=c(()=>bh(E.properties.liveness,k.temporals,p,de)),pe=E.isSymmetric||fe!==void 0,M=[],me=[],he=[],ge=[],_e=[],ve={slots:new Int32Array(1<<17),size:0,shift:16},ye=lr(),be=e=>Object.fromEntries(E.getTlcOrder().map(t=>[p.variables[t],e[t]])),Se=(e,t,n,r)=>(m.getLevel=()=>n+1,m.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Ce(e,t[n].state,(t[n+1]??t[r??n]).state)),Ce=(e,t,n)=>{try{let r=Mg(`alias`,e,p).body,i=sc(kg(e),Qg(p,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return Ig(i,a)??be(t)}catch(e){if(!(e instanceof v||e instanceof y))throw e;return{...be(t),_ALIASEvalError:e.message}}},we=(e,t,n)=>{ie.value??=Uh(i,p,f.instanceActions);let r={...z};Object.assign(z,{index:e,isExpanding:!0,candidate:void 0});let a=A(n),o=ie.value.find(e=>No(e.expression,t,p,e.scope).some(e=>F(A(e.state),a)));return Object.assign(z,r),o&&Gh(o)},Te=(e,t,n)=>{let r=i.alias,a=l(()=>(e.length>1&&Vs(p)&&Ee(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:we(t[r-1],e[r-1].state,n.state))));return e.map((t,i)=>({action:t.action,label:a[i],state:r===void 0?be(t.state):Se(r,e,i,n)}))},Ee=()=>k.init===void 0?[]:jo(k.init,p,k.scope),De=e=>k.next===void 0?[]:No(k.next,e,p,k.scope),Oe=(e,t)=>F(A(e),me[t]),Ae=(e,t)=>De(e).find(e=>Oe(e.state,t)),je=(e,t)=>{let n=le||Vs(p)?Ee().find(t=>Oe(t,e[0])):M[e[0]];if(!n)throw new y(Dg);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=Ae(i,e[n]);if(!a)throw new y(t);r.push(a)}return r},Me=(e,t)=>{let n=[];for(let t=e;t!==-1;t=he[t])n.unshift(t);let r=le&&n.length>1?je(n,Dg):n.map(e=>({state:M[e],action:ge[e]}));if(!t)return Te(r,n);let i=le?De(M[e]).find(e=>F(e.state,t.state))?.action:t.action;return Te([...r,{state:t.state,action:i}],n)},Ne=e=>he[e]===-1?[{action:void 0,label:void 0,state:be(M[e])}]:Me(e),P=(t,r,i,a)=>{if(d(t))return z.isExpanding?P(n(new y(u),e.error),Ne(z.index)):P(new y(u),r,i);if(!(t instanceof y))throw t;return{...g(`error`,void 0,{message:t.message,trace:r,initialState:i&&!(t instanceof b)?be(i):void 0,exitCode:te(t)}),outDegrees:a}},Pe=(e,t)=>{let n=je(e,Og),r=n[n.length-1].state;if(le&&t!==void 0&&t!==e.length-1&&Ae(r,e[t])===void 0)throw new y(Og);return n},Fe=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=In(t,Hn(e[n]));return Wn(e),t&1073741823},F=(e,t)=>{for(let n=0;n<t.length;n++)if(!nt(e[n],t[n]))return!1;return!0},Ie=e=>Math.imul(e,2654435761)>>>ve.shift<<1,Le=(e,t)=>{let n=ve.slots.length-1;for(let r=Ie(e);;r=r+2&n){let n=ve.slots[r+1];if(n===0)return-1;if(ve.slots[r]===e&&F(me[n-1],t))return n-1}},I=(e,t)=>{let n=ve.slots.length-1,r=Ie(e);for(;ve.slots[r+1]!==0;)r=r+2&n;ve.slots[r]=e,ve.slots[r+1]=t},L=(e,t)=>{if(ve.size++,ve.size*4>ve.slots.length){let e=ve.slots;ve.slots=new Int32Array(e.length*2),ve.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&I(e[t],e[t+1])}I(e,t+1)},Re=e=>{m.distinctStates=M.length+1,h.depth=Math.max(h.depth,e),m.diameter=Math.max(m.diameter,e)},R=(e,t,n,r)=>{let i=n===-1?1:_e[n]+1;M.push(e),me.push(t),he.push(n),ge.push(r),_e.push(i)},z={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,isFingerprinting:!1,livenessSource:-1},ze=e=>e===-1?[]:[...ze(he[e]),M[e]];m.isSeen=e=>{let t=A(e);return Le(Fe(t),t)!==-1},m.getBehavior=e=>{let t=e===z.candidate?-1:M.indexOf(e);return t===-1?[...ze(z.index),e]:ze(t)},m.getCurrentState=()=>z.index===-1?void 0:M[z.index],m.setLivenessSource=e=>{z.livenessSource=e??-1},m.getLevel=e=>{let t=z.livenessSource;return t===-1?e===z.candidate?z.candidateLevel:z.index===-1?0:e===M[z.index]?_e[z.index]:z.isExpanding?_e[z.index]+1:0:e===M[t]?_e[t]:_e[t]+1};let B=(e,t)=>({fingerprint:BigInt.asIntN(64,m.getFingerprint(e)),level:t,getLabel:()=>sr(i.alias===void 0?be(e):Ce(i.alias,e,void 0)),getText:()=>sr(be(e))}),V=e=>{ye(e),m.generatedStates++,m.initialStates++,z.candidate=e,z.candidateLevel=1;let t=A(e),n=Fe(t),i=E.satisfiesConstraints(e);if(i&&E.trackStatePossible(e),i&&Le(n,t)!==-1)return;i&&(Re(1),m.queueSize++,fe?.addInitialState(M.length,e),r?.writeInitialState(B(e,1)));let a=E.findViolatedInvariant(e);if(a)return O(`invariant-violation`,{name:a.name,trace:Te([{action:void 0,state:e}],[])});let o=E.findFailedInitialPredicate(e);if(o)return O(`liveness-violation`,{name:o.name,trace:Te([{action:void 0,state:e}],[])});i&&(L(n,M.length),R(e,t,-1,void 0))},H=(e,t,n,i,a)=>{let o=M[e];m.generatedStates++,z.candidate=t.state,z.candidateLevel=_e[e]+1,pe&&ye(t.state),z.isFingerprinting=!0;let s=A(t.state),c=Fe(s);z.isFingerprinting=!1;let l=Le(c,s),u=E.satisfiesConstraints(t.state,o);u&&E.trackStatePossible(t.state);let d=u&&E.satisfiesActionConstraints(o,t.state);d&&E.trackActionPossible(o,t.state);let f=d?l:-1;if(i&&d&&r?.writeSuccessor(i,B(t.state,_e[e]+1),f!==-1,a&&{name:a.name,signature:Kh(a)}),f!==-1&&fe){let e=M[f],r=e.every((e,n)=>e===t.state[n]);n.push({index:f,state:r?e:t.state})}let p=d&&f===-1;if(p&&(Re(_e[e]+1),ee.newStates++),f===-1)try{let n=E.findViolatedInvariant(t.state,o);if(n)return O(`invariant-violation`,{name:n.name,trace:Me(e,t)})}catch(n){return P(n,Me(e,t),void 0,w())}let h=E.findViolatedActionProperty(o,t.state);if(h)return O(`liveness-violation`,{name:h.name,trace:Me(e,t)});p&&(pe||ye(t.state),L(c,M.length),fe&&n.push({index:M.length,state:t.state}),R(t.state,s,e,t.action),m.queueSize++)},Be={result:void 0};if(k.init!==void 0)try{Ao(k.init,p,e=>{try{Be.result=V(e)}catch(t){Be.result=P(t,[],e)}return Be.result!==void 0},k.scope)}catch(e){if(!(e instanceof S))return oe(P(e,[]));let t=P(e,[],e.state.map(e=>e??Ze(`null`)));return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}if(Be.result)return oe(Be.result);let Ve=k.next;if(Ve===void 0){if(M.length>0)throw new y(`No next state actions defined to generate successor states from.`);return T()}let He=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),Ue=(e,t)=>{if(!He)return Mo(Ve,e,p,e=>t(e,void 0),k.scope);ie.value??=Uh(i,p,f.instanceActions);let n={isStopped:!1};return ie.value.reduce((r,i)=>n.isStopped?r:r+Mo(i.expression,e,p,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},We=e=>{let t=M[e],n=[],a=r&&B(t,_e[e]),o=Ue(t,(t,r)=>{try{Be.result=H(e,t,n,a,r)}catch(n){if(z.isFingerprinting)throw n;let r=P(n,Me(e,t));Be.result=d(n)?r:ce(r,e)}return Be.result!==void 0});if(z.isExpanding=!1,Be.result)return Be.result;if(o===0&&i.checkDeadlock)return O(`deadlock`,{name:`deadlock`,trace:Ne(e)});try{let r=fe?.addState(e,t,n);if(!fe||!r)return;let i=Pe(r),a=fe.getViolatedProperties(i.map(e=>e.state),i.length-1);return O(`property-violation`,{name:a[0],properties:a,trace:Te(i,r)})}catch(r){return j(P(c_(r),Ne(e),void 0,w()),(r,i)=>bh(E.properties.liveness,k.temporals,i,de)?.addState(e,t,n),!0)}},Ge=(e,t)=>{ie.value??=Uh(i,p,f.instanceActions);let n=ie.value,r=n.length===1?n[0]:n.find(t=>t.name===e.action),a=`variable${e.missing.length>1?`s are`:` is`} not defined: ${e.missing.join(`, `)}.\n`;return m.generatedStates++,P(n.length===1?e:new y(`Successor state is not completely specified by action ${e.action} of the next-state relation. The following ${a}`),[...Ne(t),{action:e.action,label:r&&Gh(r),state:be(e.state.map(e=>e??Ze(`null`)))}])},Ke=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=Pe(n,r),a=Te(i,n,r),o=e.getViolatedProperties(i.map(e=>e.state),r),s=n[r],c=n[n.length-1],u=i[i.length-1].state,d=s===c?void 0:l(()=>we(c,u,M[s]));return O(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:d},()=>s===c?a[a.length-1].action:Ae(u,s)?.action)},qe=fe!==void 0&&t.livenessCheck!==`final`,Je=performance.now(),Ye={at:Je+3e3,size:1,time:0},Xe=e=>{let t=performance.now();if(Ye.at=t+6e4,!((e-Ye.size)/Ye.size>.1)||Ye.time>(t-Je)*.2)return;Ye.size=e;let n=fe?.findViolation();return Ye.time+=performance.now()-t,n};for(let e=0;e<M.length&&!m.isStopped;e++){z.index=e,z.candidate=void 0,m.queueSize=M.length-e-1,z.isExpanding=!0;try{Be.result=We(e)}catch(t){let n=t instanceof x?Ge(t,e):P(c_(t),Ne(e));Be.result=t instanceof x||d(t)?n:ce(n,e)}if(Be.result)return Be.result;if(_[C()]++,ee.newStates=0,qe&&performance.now()>=Ye.at){let t=Xe(e+1);if(fe&&t)return Ke(fe,t)}}z.index=-1,z.candidate=void 0;let Qe=fe?.findViolation();if(fe&&Qe)return Ke(fe,Qe);let $e=E.findPostconditionViolation();return $e?g(`postcondition-violation`,{...$e,trace:[]}):T()},h_=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},g_=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Hn(e[t]),16777619),r=Math.imul(r^Zn(e[t]),1540483477);Wn(e),t[0]=h_(n)||1,t[1]=h_(r)},__=()=>{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)}}},v_=(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}},y_=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),b_=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return v_(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},x_=e=>Atomics.load(e.used,0)*2>=e.slots.length,S_=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&v_(t,n);return{slots:t,used:e.used}},C_=()=>{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=jn(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})}},w_=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Ze(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=Vt({kind:`Interval`,low:e,high:e+t-1});return $e(a,i(t))}let a=n[r.index++];if(e===5)return Qe(i(a));let o=i(a);return $e(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return U}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return m}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Vs}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return sr}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return lr}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return y}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return C}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return de}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return v}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return Y}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return T}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return xl}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return No}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return te}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return fm}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return S_}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return qu}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return g_}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return a_}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return xg}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Tg}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return _g}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return y_}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return xe}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return Ve}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return p_}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return wg}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return C_}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return b_}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Cg}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return __}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return x_}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return w_}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return o_}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return tm}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return jo}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return bl}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return nm}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return w}});
|