tla-ts 0.0.3-dev.f362080 → 0.0.3-dev.fac17cc

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.
Files changed (81) hide show
  1. package/dist/cli.cjs +1 -1
  2. package/dist/cli.js +1 -1
  3. package/dist/index.cjs +1 -1
  4. package/dist/index.d.cts +149 -8
  5. package/dist/index.d.ts +149 -8
  6. package/dist/index.js +1 -1
  7. package/dist/parallel-worker.cjs +1 -1
  8. package/dist/parallel-worker.js +2 -2
  9. package/dist/parallel.cjs +1 -1
  10. package/dist/parallel.js +2 -2
  11. package/dist/run-cli.cjs +1351 -20
  12. package/dist/run-cli.js +1351 -20
  13. package/dist/transfer.cjs +86 -28
  14. package/dist/transfer.js +86 -28
  15. package/package.json +5 -1
  16. package/src/ast.ts +56 -6
  17. package/src/bags.ts +4 -7
  18. package/src/builtins.ts +29 -11
  19. package/src/bundled-modules.ts +3 -3
  20. package/src/canonical.ts +4 -3
  21. package/src/check.ts +1348 -227
  22. package/src/cli.ts +8 -1
  23. package/src/codegen.ts +68 -21
  24. package/src/config.ts +252 -179
  25. package/src/environment.ts +431 -120
  26. package/src/errors.ts +210 -5
  27. package/src/evaluate.ts +716 -136
  28. package/src/exit-codes.ts +5 -4
  29. package/src/index.ts +1 -0
  30. package/src/instances.ts +4 -2
  31. package/src/java-overrides.ts +104 -25
  32. package/src/levels.ts +183 -37
  33. package/src/lexer.ts +32 -4
  34. package/src/live-check.ts +204 -146
  35. package/src/liveness.ts +192 -65
  36. package/src/obligation-expression.ts +2 -2
  37. package/src/obligation-source.ts +2 -0
  38. package/src/parallel-worker.ts +6 -1
  39. package/src/parallel.ts +57 -6
  40. package/src/parser.ts +425 -144
  41. package/src/pcal-ast.ts +770 -0
  42. package/src/pcal-parse.ts +1523 -0
  43. package/src/pcal-tokenize.ts +516 -0
  44. package/src/pcal-translate.ts +1230 -0
  45. package/src/pcal-validate.ts +454 -0
  46. package/src/randomization.ts +24 -7
  47. package/src/resolve.ts +1408 -400
  48. package/src/run-cli.ts +1167 -155
  49. package/src/runtime.ts +16 -0
  50. package/src/sany-builtins.ts +147 -0
  51. package/src/sany-generator.ts +3112 -0
  52. package/src/sany-levels.ts +1208 -0
  53. package/src/sany-lexer.ts +545 -0
  54. package/src/sany-linter.ts +122 -0
  55. package/src/sany-modules.ts +1398 -0
  56. package/src/sany-nodes.ts +463 -0
  57. package/src/sany-parse-error.ts +2161 -0
  58. package/src/sany-report.ts +354 -0
  59. package/src/sany-selectors.ts +738 -0
  60. package/src/sany-source.ts +248 -0
  61. package/src/sany-xml.ts +1017 -0
  62. package/src/spec-description.ts +26 -7
  63. package/src/standard-modules.ts +203 -146
  64. package/src/standard-ranges.ts +116 -0
  65. package/src/state-graph.ts +29 -6
  66. package/src/subexpressions.ts +221 -161
  67. package/src/substitution-levels.ts +38 -17
  68. package/src/successors.ts +162 -114
  69. package/src/symmetry.ts +168 -50
  70. package/src/tableau.ts +3 -1
  71. package/src/tlc-ext.ts +13 -17
  72. package/src/tlc-messages.ts +329 -0
  73. package/src/tlc-module.ts +49 -21
  74. package/src/tlc-modules.ts +0 -4
  75. package/src/tlc-order.ts +55 -9
  76. package/src/tlc-random.ts +28 -3
  77. package/src/tlc-replay.ts +655 -0
  78. package/src/tlc-version.ts +18 -0
  79. package/src/transfer.ts +15 -3
  80. package/src/value-sources.ts +29 -0
  81. package/src/values.ts +683 -256
package/dist/transfer.cjs CHANGED
@@ -6,21 +6,78 @@
6
6
  * This source code is licensed under the MIT license found in the
7
7
  * LICENSE file in the root directory of this source tree.
8
8
  */
9
- const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenessViolation:13,assertViolation:14,specEvaluationFailure:75,safetyEvaluationFailure:76,livenessEvaluationFailure:77,specParseError:150,configParseError:151,error:255},t=/* @__PURE__ */ new WeakMap,n=(e,n)=>(e instanceof Error&&!t.has(e)&&t.set(e,n),e),r=e=>t.get(e),i=t=>{try{return t()}catch(t){throw n(t,e.error)}},a=e=>{let t=i(e);return t&&{addInitialState:(e,n)=>i(()=>t.addInitialState(e,n)),addState:(e,n,r)=>i(()=>t.addState(e,n,r)),findViolation:()=>i(()=>t.findViolation()),getViolatedProperties:(e,n)=>i(()=>t.getViolatedProperties(e,n))}},o=`TLC threw an unexpected exception.
10
- This was probably caused by an error in the spec or model.
11
- See the User Output or TLC Console for clues to what happened.
12
- The exception was a java.lang.RuntimeException
13
- : `;var s=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},c=class extends s{failure;constructor(e,t,n){super(e,t),this.name=`TlaSyntaxError`,this.failure=n}},l=class extends s{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},u=class extends s{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}},d=class extends u{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},f=class extends u{constructor(e){super(e),this.name=`TlaEvaluationError`}},p=class extends s{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)})`}},m=class extends p{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},h=class extends s{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}};const g=t=>r(t)??(t instanceof c?e.specParseError:t instanceof l?e.configParseError:t instanceof u?e.specEvaluationFailure:e.error),_=/* @__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(`.`)),v=/* @__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`]]),y=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),ee=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),b=/* @__PURE__ */ new Map([[`∧`,`/\\`],[`∨`,`\\/`],[`¬`,`~`],[`⇒`,`=>`],[`⟹`,`=>`],[`≡`,`<=>`],[`⇔`,`<=>`],[`∈`,`\\in`],[`∉`,`\\notin`],[`⊆`,`\\subseteq`],[`⊂`,`\\subset`],[`⊇`,`\\supseteq`],[`⊃`,`\\supset`],[`∪`,`\\cup`],[`∩`,`\\cap`],[`×`,`\\X`],[`∀`,`\\A`],[`∃`,`\\E`],[`≠`,`#`],[`≤`,`<=`],[`≥`,`>=`],[`↦`,`|->`],[`→`,`->`],[`⟨`,`<<`],[`⟩`,`>>`],[`□`,`[]`],[`◇`,`<>`],[`≜`,`==`],[`′`,`'`],[`∘`,`\\o`],[`⋅`,`\\cdot`]]),x=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,te=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),ne=e=>e.startsWith(`\\`)?parseInt(e.slice(2),te.get(e[1].toLowerCase())):Number(e),re=/-{4,}[ \t]*MODULE\b/,S=e=>/[A-Za-z0-9_]/.test(e),ie=(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&&!v.has(n.slice(0,r.value));)r.value--;let i=v.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=b.get(n);if(r)return{text:r,length:n.length};let i=ee.find(n=>e.startsWith(n,t));return i?{text:y.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},ae=e=>e!==void 0&&e>=`0`&&e<=`9`,oe=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},C=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:oe(e,t+1,ae);if(n===t+1||e[n]!==`>`)return 0;let r=oe(e,n+1,S),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return oe(e,i?r+1:r,e=>e===`.`)-t},w=(e,t)=>t===` `?e+8-e%8:e+1,se=e=>{let t=re.exec(e);if(!t)throw new c(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
14
- `),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=w(o.width,e[o.position]);return w(o.width,e[a.index])},l=(e,t,r)=>{let i=s();n.push({kind:e,text:t,line:a.line,column:i,endColumn:i+r-1}),a.index+=r},u=t=>{for(let n=0;n<t;n++)e[a.index]===`
15
- `&&(a.line++,a.lineStart=a.index+1),a.index++},d=t=>new c(`${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
- `||t===` `||t===` `||t===`\r`){u(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
17
- `,a.index);u((t===-1?e.length:t)-a.index);continue}if(e.startsWith(`(*`,a.index)){let t={value:0};do{if(a.index>=e.length)throw d(`Unterminated comment`);e.startsWith(`(*`,a.index)?(t.value++,u(2)):e.startsWith(`*)`,a.index)?(t.value--,u(2)):u(1)}while(t.value>0);continue}if(e.startsWith(`----`,a.index)){let t=oe(e,a.index,e=>e===`-`)-a.index;e.slice(a.index+t).trimStart().startsWith(`MODULE`)&&a.moduleDepth++,l(`Separator`,`----`,t);continue}if(e.startsWith(`====`,a.index)){if(l(`ModuleEnd`,`====`,oe(e,a.index,e=>e===`=`)-a.index),a.moduleDepth--,a.moduleDepth<=0)break;continue}if(t===`"`){let t=a.line,r=s(),i=[];for(u(1);e[a.index]!==`"`;){if(a.index>=e.length||e[a.index]===`
18
- `)throw d(`Unterminated string`);if(e[a.index]===`\\`){let t=e[a.index+1];i.push({n:`
19
- `,t:` `,r:`\r`,f:`\f`}[t]??t),u(2)}else i.push(e[a.index]),u(1)}u(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=x.exec(e.slice(a.index,a.index+64));if(i){l(`Number`,i[0],i[0].length);continue}if(S(t)){let t=e.slice(a.index,oe(e,a.index,S));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(a.index))?.[0]??t;l(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){l(`Keyword`,t.slice(0,3),3);continue}let n=r.get(t)??t;r.set(n,n),l(_.has(t)?`Keyword`:`Identifier`,n,t.length);continue}let o=C(e,a.index);if(o>0){l(`Step`,e.slice(a.index,a.index+o),o);continue}let c=ie(e,a.index);if(c)l(`Operator`,c.text,c.length);else throw d(`Unexpected character ${JSON.stringify(t)}`)}let f=s();return n.push({kind:`End`,text:``,line:a.line,column:f,endColumn:f}),n},T=/* @__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`]),E=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`],D=e=>{let t=[],n={index:0,line:1};for(;n.index<e.length;){let r=e.slice(n.index),i=/^\s+/.exec(r)?.[0];if(i){n.line+=i.split(`
20
- `).length-1,n.index+=i.length;continue}if(r.startsWith(`\\*`)){let e=r.indexOf(`
21
- `);n.index+=e===-1?r.length:e;continue}if(r.startsWith(`(*`)){let e=r.indexOf(`*)`);if(e===-1)throw new l(`Unterminated comment at line ${n.line}`);n.line+=r.slice(0,e).split(`
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=E.find(e=>r.startsWith(e));if(c){t.push({kind:`Symbol`,text:c,line:n.line}),n.index+=c.length;continue}let u=ie(e,n.index);if(!u)throw new l(`Unexpected character ${JSON.stringify(r[0])} at line ${n.line}`);t.push({kind:`Word`,text:u.text,line:n.line}),n.index+=u.length}return t.push({kind:`End`,text:``,line:n.line}),t},ce=e=>{let t=D(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`&&T.has(e.text),c=e=>{let t=o();if(t.text!==e)throw new l(`Expected ${JSON.stringify(e)} but found ${JSON.stringify(t.text)} at line ${t.line}`)},u=()=>{let e=o();if(e.kind!==`Word`||s(e))throw new l(`Expected a name but found ${JSON.stringify(e.text)} at line ${e.line}`);return e.text},d=()=>a().kind===`Word`&&!s(a()),f=()=>{let e=[];for(;d();)e.push(o().text);return e},p=(e,t)=>{if(r[e]!==void 0)throw new l(`The keyword ${t} appears twice`);r[e]=u()},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 l(`Expected a value but found ${JSON.stringify(e.text)} at line ${e.line}`)},h=()=>{if(a().text!==`[`)return;o();let e=u();return c(`]`),e},g=()=>{for(;d();){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:u(),...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`:p(`init`,e.text);break;case`NEXT`:p(`next`,e.text);break;case`SPECIFICATION`:p(`specification`,e.text);break;case`SYMMETRY`:p(`symmetry`,e.text);break;case`VIEW`:p(`view`,e.text);break;case`INVARIANT`:case`INVARIANTS`:r.invariants.push(...f());break;case`PROPERTY`:case`PROPERTIES`:r.properties.push(...f());break;case`CONSTRAINT`:case`CONSTRAINTS`:r.constraints.push(...f());break;case`ACTION_CONSTRAINT`:case`ACTION_CONSTRAINTS`:r.actionConstraints.push(...f());break;case`ALIAS`:p(`alias`,e.text);break;case`POSTCONDITION`:case`POSTCONDITIONS`:r.postconditions.push(...f());break;case`_POSSIBLE`:r.possible.push(...f());break;case`_PERIODIC`:p(`periodic`,e.text);break;case`_RL_REWARD`:p(`rlReward`,e.text);break;case`CHECK_DEADLOCK`:{if(i.isSet)throw new l(`The keyword CHECK_DEADLOCK appears twice`);i.isSet=!0;let e=o().text;if(e!==`TRUE`&&e!==`FALSE`)throw new l(`CHECK_DEADLOCK expects TRUE or FALSE but found ${JSON.stringify(e)}`);r.checkDeadlock=e===`TRUE`;break}default:throw new l(`Unexpected ${JSON.stringify(e.text)} at line ${e.line}`)}}if(r.specification!==void 0&&(r.init!==void 0||r.next!==void 0))throw new l(`SPECIFICATION cannot be combined with INIT or NEXT`);return r},O={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:` `}},k=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},le=e=>e!==void 0&&/^\p{Nd}$/u.test(e),ue=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),de=e=>{let t=t=>{let n=oe(e,t,k);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=oe(e,t,le);if(e.startsWith(`..`,n)&&le(e[n+2]))return{kind:`Constant`,first:t,last:oe(e,n+2,le)-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=le(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:oe(e,t+1,le)-1,children:[]};if(ue(n))return{kind:`Constant`,first:t,last:oe(e,t,ue)-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)},fe=e=>{let t=e.length===0?void 0:de(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=O[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`,pe=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),j=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),M=e=>typeof e==`object`&&e.kind===`ModelValue`,me=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:A(e)?`set`:`function`,he=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new d(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ge={isUsed:!1},_e=(e,t)=>(ge.isUsed=!0,e.writtenKeys=t,e),ve=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Yt(e.domain,t)]]),ye=(e,t,n)=>_e(Le(e,t),n),be=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(be);e.writtenKeys=void 0,e.range.forEach(be)}},xe=e=>e.every(e=>typeof e==`string`),Se=(e,t)=>e.length>0&&t.length>0&&xe(e)!==xe(t),Ce=(e,t)=>{ge.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Se(n,r)?rt(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=L(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=L(i[e],a[e]);if(t!==0)return t}return 0},N=(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=L(n[e],r[e]);if(t!==0)return t}return 0},we=e=>M(e)?e.type:void 0,Te=(e,t,n)=>{let r=we(e),i=we(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 u(`Attempted to ${a} the differently-typed model values ${U(e)} and ${U(t)}`)}throw r===void 0?new u(`Attempted to ${a} the typed model value ${U(t)} and the non-model value\n${U(e)}`):new u(`Attempted to ${a}${n?``:` the`} typed model value ${U(e)} and non-model value\n${U(t)}`)},Ee={ranks:Object.create(null),size:0},De=e=>{Ee.ranks=Object.create(null),Ee.size=0,Pe.clear();for(let t of e)Oe(t)},Oe=e=>(Ee.ranks[e]===void 0&&(Ee.ranks[e]=Ee.size++),e),ke=()=>Ee.size,P=e=>Ee.ranks[Oe(e)],Ae=(e,t)=>{if(e===t)return 0;let n=Ee.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`),je=(e,t)=>(F(e)||F(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Me=(e,t,n)=>{if(!F(e))throw new u(`Attempted to ${n} the set ${U(z(e)?B(e):e,!0)} with the value:\n${U(t,!0)}`);if(!F(t))throw new u(`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 u(`Attempted to compare ${U(e,!0)} with the value\n${U(t,!0)}`)},I={kind:`InfiniteSet`,name:`Any`},Ne=e=>{throw new u(`Attempted to compare ANY with the value\n${U(e)}`)},L=(e,t)=>{if(e===t)return ge.isUsed&&be(e),e===I?Ne(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Ce(e,t);if(n===`Set`&&r===`Set`)return N(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&&Te(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Te(e,t,!1),n===`ModelValue`?-1:1;if(e===I||t===I)return Ne(e===I?t:e);if(A(e)&&A(t)&&je(e,t))return Me(e,t,`compare`);let i=A(e);if(i!==A(t))throw new u(`Attempted to compare ${me(e)} ${U(e)} with ${me(t)} ${U(t)}`);return i?N(B(e),Ht(t)):Ce(H(e),H(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Ae(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Te(e,t,!1),M(e))return-1;if(M(t))return 1;throw new u(`Attempted to compare ${me(e)} ${U(e)} with ${me(t)} ${U(t)}`)},Pe=/* @__PURE__ */ new Map,Fe=e=>{let t=Pe.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:P(e)};return Pe.set(e,n),n},Ie=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),Le=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0}),Re=(e,t)=>{if(e===t)return ge.isUsed&&be(e),e!==I||Ne(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Te(e,t,!0),L(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 Ce(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return N(e,t)===0;if(M(e)||M(t))return Te(e,t,!0),M(e)&&M(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Re(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=V(e.domain),r=V(t.domain);if(n||r)return n===r;let i=V(e.range),a=V(t.range);return i||a?i===a:Re(e.domain,t.domain)&&Re(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(V(e))return V(t);if(V(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]&&Re(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return V(e)?V(t):!V(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Re(e,t.factors[n]));let n=A(e)&&A(t)&&!(z(e)&&z(t));if(n&&je(e,t))return Me(e,t,`check equality of`)===0;if(n){if(!F(e)){let n=B(e);if(!F(t))return N(n,B(t))===0}return Mn(e)===Mn(t)}return L(e,t)===0},ze=(e,t)=>e===t||e.length===t.length&&e.every((e,n)=>Be(e,t[n])),Be=(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)&&ze(e.elements,t.elements):e.kind===`Function`&&t.kind===`Function`?(e.hash===0||t.hash===0||e.hash===t.hash)&&ze(e.domain,t.domain)&&ze(e.range,t.range):Mn(e)===Mn(t),Ve=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},He=e=>{if(!j(e))return;let t=H(e);return{domain:t.domain,range:t.range,low:Ve(t.domain)}},Ue=e=>{if(!j(e))return;let t=H(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},We=(e,t)=>{if(we(e)!==void 0)throw new u(`Attempted to compare the typed model value ${U(e)} and the non-model value\n${U(t)}`);return 1},Ge=(e,t)=>{if(we(e)!==void 0)throw new u(`Attempted to check equality of the typed model value ${U(e)} and the non-model value\n${U(t)}`);return!1},Ke=(e,t)=>{let n=we(e);if(n===void 0)return M(t)?e.rank-t.rank:-1;if(!M(t))throw new u(`Attempted to compare the typed model value ${U(e)} and non-model value\n${U(t)}`);let r=we(t);if(r!==void 0&&r!==n)throw new u(`Attempted to compare the differently-typed model values ${U(e)} and ${U(t)}`);return e.rank-t.rank},qe=(e,t)=>{let n=we(e);if(n===void 0)return M(t)&&e.name===t.name;if(!M(t))throw new u(`Attempted to check equality of typed model value ${U(e)} and non-model value\n${U(t)}`);let r=we(t);if(r!==void 0&&r!==n)throw new u(`Attempted to check equality of the differently-typed model values ${U(e)} and ${U(t)}`);return e.name===t.name},Je={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`}},Ye=(e,t,n)=>{let r=Je[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)}`},Xe=(e,t,n)=>{let r=He(n);if(!r){if(M(n))return We(n,t);throw new u(`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=()=>Ze(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 Ze(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 u(`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()},Ze=(e,t)=>{for(let n=0;n<e.length;n++){let r=rt(e[n],t[n]);if(r!==0)return r}return 0},Qe=(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||Ze(n.range,r):Xe({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=Ue(t);if(!r){if(M(t))return We(t,e);throw new u(`Attempted to compare record:\n${U(e)}\nwith non-record\n${U(t)}`)}return n.domain.length-r.domain.length||Ze(n.domain,r.domain)||Ze(n.range,r.range)}return Xe({...n,low:Ve(n.domain)},e,t)},$e=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),et=(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`),tt=(e,t)=>{let n=$e(t)?t:B(t);return{elements:B(e).elements,otherElements:B(n).elements}},nt=(e,t)=>{if(et(e,t))return L(e,t);if(!$e(e))return nt(B(e),t);if(!A(t)){if(M(t))return We(t,e);throw new u(`Attempted to compare the set ${U(e)} with the value:\n${U(t)}`)}let n=tt(e,t);return n.elements.length-n.otherElements.length||Ze(n.elements,n.otherElements)},rt=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return L(e,t);if(M(t))return We(t,e);throw new u(Ye(e,t,!1))}return e.kind===`ModelValue`?Ke(e,t):j(e)?Qe(e,t):nt(e,t)},it=(e,t)=>e.every((e,n)=>ct(e,t[n])),at=(e,t,n)=>{let r=He(n);if(!r){if(M(n))return Ge(n,t);throw new u(`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)&&it(e.range,r.range);let i=e.low??r.low;return i===void 0?it(e.domain,r.domain)&&it(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new u(`Attempted to compare an integer with non-integer:\n${U(e)}.`);return e===i+t})&&it(e.range,r.range)},ot=(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&&it(n.range,r):at({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=Ue(t);if(!r){if(M(t))return Ge(t,e);throw new u(`Attempted to check equality of record:\n${U(e)}\nwith non-record\n${U(t)}`)}return n.domain.length===r.domain.length&&it(n.domain,r.domain)&&it(n.range,r.range)}return at({...n,low:Ve(n.domain)},e,t)},st=(e,t)=>{if(et(e,t))return Re(e,t);if(!$e(e))return st(B(e),t);if(!A(t)){if(M(t))return Ge(t,e);throw new u(`Attempted to check equality of the set ${U(e)} with the value:\n${U(t)}`)}let n=tt(e,t);return n.elements.length===n.otherElements.length&&it(n.elements,n.otherElements)},ct=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(M(t))return Ge(t,e);throw new u(Ye(e,t,!0))}return e.kind===`ModelValue`?qe(e,t):j(e)?ot(e,t):st(e,t)},lt=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=rt(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},ut=(e,t)=>t.some(t=>ct(t,e)),dt=(e,t)=>{try{return Re(e,t)}catch(n){if(!(n instanceof u))throw n;return ct(e,t)}},ft=e=>{for(let t=1;t<e.length;t++)if(L(e[t],e[t-1])<=0)return!1;return!0},pt=e=>{if(e.length<2||ft(e))return Ie(e);let t=[...e].sort(L),n=[t[0]];for(let e=1;e<t.length;e++)L(n[n.length-1],t[e])!==0&&n.push(t[e]);return Ie(n)},mt=e=>{try{return pt(e)}catch(t){if(!(t instanceof u))throw t;return{kind:`MixedSet`,elements:e}}},ht=Ie([]),gt=(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&&L(r[a],t)<0;)a++;a<r.length&&L(r[a],t)===0||i.push(t)}return i.length===n.length?e:Ie(i)},_t=(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&&L(r[a],t)<0;)a++;a<r.length&&L(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Ie(i)},vt=(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=L(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=Ie(i);if(e.hash!==0){let t=e.hash;for(let e=0;e<a.length;e++)t=t+bn(a[e])|0;c.hash=t}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Dn(a[e])|0;c.fingerprint=t}return c},yt=e=>{let t=e.length<2?e:[...e].sort((e,t)=>L(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&L(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Le(n,r)},bt=e=>{let t=yt(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:_e(t,e.map(e=>e[0]))},xt=[],St=[],Ct=/* @__PURE__ */ new WeakMap,wt=e=>{let t=xt[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return xt[e]=n,n},Tt=e=>{if(Kt(e),e.low===1&&e.high>=1)return wt(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Et=e=>e.length>0&&(e===xt[e.length]||Ct.has(e)),Dt=e=>{let t=B(e).elements;return Et(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Ot=e=>{let t=St[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return St[e]=n,n},R=e=>Le(wt(e.length),e),kt=e=>yt(e),At=e=>A(e)&&!F(e),jt=(e,t=!1)=>`UNION(${U(e.base,t)})`,Mt=(e,t=e=>B(e).elements)=>{if(!At(e.base))throw new u(`Attempted to enumerate the nonenumerable set:\n${jt(e)}`);return t(e.base)},Nt=(e,t,n)=>{if(At(e))return e;throw new u(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${jt(n)}`)},z=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 z(e.base);case`FunctionSet`:return z(e.domain)&&z(e.range)||Pt(e.domain)===!0||Pt(e)===!0;case`RecordSet`:return e.sets.every(z)||Pt(e)===!0;case`ProductSet`:return e.factors.every(z)||Pt(e)===!0;case`Union`:return z(e.base)&&Ut(e.base).every(z);case`SetOperation`:return e.operator===`\\cup`?z(e.left)&&z(e.right):e.operator===`\\cap`?z(e.left)||z(e.right):z(e.left);default:return!1}},Pt=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=Pt(e.domain);return t===void 0?void 0:!t&&Pt(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Pt(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return z(e)?B(e).elements.length===0:void 0;default:return}},Ft=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},It=(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},Lt=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Ie(r.map(t=>e[t])));while(It(r,e.length))}return t},Rt=e=>{if(typeof e!=`object`)throw new u(`Expected a set but found ${U(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return lt(e.elements);case`Interval`:{let t=Tt(e);return t!==xt[t.length]&&Ct.set(t,e),t}case`Subset`:{F(e.base)&&Kt(e.base);let t=B(e.base).elements;if(t.length>30)throw new u(Gt(e));return Lt(t)}case`FunctionSet`:{if(V(e))return[];if(F(e.domain))throw new u(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${U(e.domain)}\ncannot be enumerated.`);let t=Dt(e.domain);if(t.length>0&&F(e.range))throw new u(`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?[]:B(e.range).elements;return Ft(t.map(()=>n)).map(e=>Le(t,e))}case`RecordSet`:{if(V(e))return[];let t=e.sets.map((t,n)=>{if(F(t))throw new u(`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 B(t).elements});return Ft(t).map(t=>kt(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(V(e))return[];let t=e.factors.map((e,t)=>{if(F(e))throw new u(`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${U(e)}`);return B(e).elements});return Ft(t).map(R)}case`FilteredSet`:if(F(e.base))throw new u(`Attempted to enumerate { x \\in S : p(x) } when S:\n${U(e.base)}\nis not enumerable`);return B(e.base).elements.filter(e.test);case`Union`:{let t=Mt(e).flatMap((t,n)=>B(Nt(t,n,e)).elements);return B(mt(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(F(e.left)||F(e.right)))throw new u(`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 u(`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 u(`Attempted to enumerate S \\ T when S:\n${U(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return vt(B(e.left),B(e.right)).elements;let t=e.operator===`\\`||z(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return B(n).elements.filter(t=>$t(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new u(`Attempted to enumerate the non-enumerable set ${U(e)}`);default:throw new u(`Expected a set but found ${U(e)}`)}},zt=/* @__PURE__ */ new WeakMap,Bt=/* @__PURE__ */ new WeakMap,B=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Ie(Rt(e));let t=typeof e==`object`?zt.get(e):void 0;if(t)return t;let n=(typeof e==`object`?Bt.get(e):void 0)??Vt(e);return typeof e==`object`&&zt.set(e,n),n},Vt=e=>{let t=Rt(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`)?Ie(t):pt(t)},Ht=e=>{if(typeof e!=`object`||e.kind!==`Union`&&e.kind!==`SetOperation`&&e.kind!==`FilteredSet`||zt.has(e))return B(e);let t=Bt.get(e);if(t)return t;let n=Vt(e);return Bt.set(e,n),n},Ut=e=>{if(typeof e!=`object`||zt.has(e))return B(e).elements;if(e.kind===`Union`)return Mt(e,Ut).flatMap((t,n)=>Ut(Nt(t,n,e)));if(e.kind===`FilteredSet`&&!F(e.base))return Ut(e.base).filter(e.test);if(e.kind!==`SetOperation`)return B(e).elements;if(e.operator===`\\cup`)return F(e.left)||F(e.right)?B(e).elements:[...Ut(e.left),...Ut(e.right)];let t=e.operator===`\\`||z(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return F(n)?B(e).elements:Ut(n).filter(t=>$t(t,r)===(e.operator===`\\cap`))},V=e=>{if(typeof e!=`object`||!A(e))throw new u(`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 u(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(V);case`RecordSet`:return e.sets.some(V);case`FunctionSet`:return!V(e.domain)&&V(e.range);case`Union`:return Mt(e).every((t,n)=>V(Nt(t,n,e)));default:return B(e).elements.length===0}},Wt=(e,t)=>e.reduce((e,n)=>{let r=e*Kt(n);if(r>2147483647)throw new u(t());return r},1),Gt=e=>`Overflow when computing the number of elements in:\n${U(e)}`,Kt=e=>{if(typeof e!=`object`)return B(e).elements.length;switch(e.kind){case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new u(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new u(`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 u(Gt(e));return 2**t}case`FunctionSet`:{if(V(e.domain))return 1;if(V(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 u(Gt(e));return r.value}case`RecordSet`:return V(e)?0:Wt(e.sets,()=>Gt(e));case`ProductSet`:return V(e)?0:Wt(e.factors,()=>`Overflow when computing the number of elements in ${U(e)}`);default:return B(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 u(`Attempted to check if the ${me(e)} ${U(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new u(`Attempted to check if the function:\n${U(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Jt(e.base)&&V(e.base);case`Subset`:return Jt(e.base);case`FunctionSet`:{let t=Jt(e.domain);if(t&&V(e.domain))return!0;let n=Jt(e.range);return n&&V(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(V(e))return!0;return n.isAllFinite}case`Union`:if(!At(e.base))throw new u(`Attempted to check if the nonenumerable set:\n${jt(e)}\nis a finite set.`);return B(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 u(qt(e));return!0}if(Jt(e.left))return!0;if(!Jt(e.right))throw new u(qt(e));return!1;case`FilteredSet`:if(!Jt(e.base))throw new u(`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=L(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} ${me(t)} ${U(t)}`;let r=t.kind===`Function`||z(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)}`},$t=(e,t)=>{if(!A(t))throw new u(Qt(e,t));switch(t.kind){case`Set`:try{return Yt(t.elements,e)!==-1}catch(n){if(!(n instanceof u))throw n;return ut(e,t.elements)}case`MixedSet`:return ut(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 u(`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 u(`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 u(Zt(e,t));return B(e).elements.every(e=>$t(e,t.base));case`FunctionSet`:{if(!j(e)){if(M(e))return!1;throw new u(Zt(e,t))}let n=H(e),r=Ve(n.domain);return(r===void 0?dt(t.domain,Ie(n.domain)):dt({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>$t(e,t.range))}case`RecordSet`:{let n=j(e)?H(e):void 0;if(!n||!xe(n.domain)){if(M(e))return!1;throw new u(`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&&$t(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 u(`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)=>$t(e,t.factors[n]))}case`FilteredSet`:return $t(e,t.base)&&t.test(e);case`Union`:if(!At(t.base))throw new u(`Attempted to check if:\n ${U(e)}\nis an element of the non-enumerable set:\n ${jt(t)}`);return B(t.base).elements.some(t=>$t(e,t));case`SetOperation`:return t.operator===`\\cup`?$t(e,t.left)||$t(e,t.right):$t(e,t.left)&&$t(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Xt(e);if(n===void 0){if(M(e))return!1;throw new u(Zt(e,t))}return n.every(e=>$t(e,t.base))}default:throw new u(Qt(e,t))}},en=(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?$t(e,n):e.range.every((e,r)=>en(e,t.range[r],n.range)),H=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){z(e.domain)||Kt(e.domain);let t=Dt(e.domain);return Le(t,t.map(t=>e.apply(t)))}throw new u(`Expected a function but found ${U(e)}`)},tn=/* @__PURE__ */ new WeakSet,nn=e=>(tn.add(e),e),rn=e=>{let t=e.domain;return t.length===0?tn.has(e)?`FcnRcdValue`:`TupleValue`:t===xt[t.length]?`TupleValue`:Ct.has(t)?`IntervalFcnRcdValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},an=(e,t)=>`Attempted to apply function:\n${fe(U(e))}\nto argument ${fe(U(t))}, which is not in the domain of the function.`,on=e=>`Attempted to apply function with integer domain to the non-integer argument ${fe(U(e))}`,sn=(e,t)=>{if(tn.has(e)||e.kind===`LazyFunction`)return`In applying the function\n${fe(U(e))},\nthe first argument is:\n${fe(U(t))}\nwhich is not in its domain.\n`;let n=rn(e);return n===`TupleValue`?typeof t==`number`?`Attempted to access index ${t} of tuple\n${fe(U(e))}\nwhich is out of bounds.`:`Attempted to access tuple at a non integral index: ${fe(U(t))}`:n===`RecordValue`?typeof t==`string`?`Attempted to access nonexistent field '${t}' of record\n${fe(U(e))}`:`Attempted to access record by a non-string argument: ${fe(U(t))}`:n===`IntervalFcnRcdValue`&&typeof t!=`number`?on(t):an(e,t)},cn=(e,t)=>rn(e)===`FcnRcdValue`?an(e,t):on(t),ln=e=>rn(e)===`RecordValue`,un=(e,t)=>{let n=e[0];return typeof n==`number`?typeof t!=`number`&&(e===xt[e.length]||Ct.has(e)):typeof n==`string`&&typeof t!=`string`},dn=(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)},fn=(e,t,n,r)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!$t(t,e.domain))throw new u(tn.has(e)?sn(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 u(r?.(e)??`Attempted to apply ${U(e)}, which is not a function`);let i=un(e.domain,t)?-1:dn(e.domain,t);if(i===-1)throw new u(n?.(e)??sn(e,t));return e.range[i]},pn=e=>Et(e)?Ct.get(e)??Ot(e.length):void 0,mn=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=H(e).domain;return pn(t)??Ie(t)},hn=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!z(e.domain))){if(!$t(t,e.domain))return e;let r=n(e.apply(t));return{kind:`LazyFunction`,domain:e.domain,apply:n=>dt(t,n)?r:e.apply(n),source:e.source}}let i=H(e),a=dn(i.domain,t);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Le(i.domain,o);if(l.writtenKeys=i.writtenKeys,i.hash!==0){let e=i.domain[a];l.hash=s===c?i.hash:i.hash-xn(e,s)+xn(e,c)|0}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-On(e,s)+On(e,c)|0}return l},gn=/* @__PURE__ */ new WeakMap,_n=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},vn=(e,t)=>Math.imul(e^t,16777619),yn=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return _n(t)},bn=e=>_n(Cn(e)+2654435769|0),xn=(e,t)=>_n(Math.imul(Cn(e),668265261)+Cn(t)|0),Sn=e=>{if(e.kind===`ModelValue`)return _n(vn(yn(e.name),109));if(A(e)){if(!z(e))return yn(Mn(e));let t=B(e).elements,n=1940243425;for(let e=0;e<t.length;e++)n=n+bn(t[e])|0;return n}let t=H(e),n=1725019383;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 _n(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return yn(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Sn(e)),e.hash;let t=gn.get(e);if(t!==void 0)return t;let n=Sn(e);return gn.set(e,n),n},wn=/* @__PURE__ */ new WeakMap,Tn=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},En=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Tn(t)},Dn=e=>Tn(An(e)+2135587861|0),On=(e,t)=>Tn(Math.imul(An(e),374761393)+An(t)|0),kn=e=>{if(e.kind===`ModelValue`)return Tn(En(e.name)^60);if(A(e)){if(!z(e))return En(Mn(e));let t=B(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Dn(t[e])|0;return n}let t=H(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+On(t.domain[e],t.range[e])|0;return n},An=e=>{if(typeof e==`number`)return Tn(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return En(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=kn(e)),e.fingerprint;let t=wn.get(e);if(t!==void 0)return t;let n=kn(e);return wn.set(e,n),n},jn=/* @__PURE__ */ new WeakMap,Mn=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=jn.get(e);if(t!==void 0)return t;let n=Nn(e);return jn.set(e,n),n},Nn=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${Mn(e.base)}>`;if(e.kind===`FilteredSet`&&!z(e))throw new u(`Attempted to compare the non-enumerable set ${U(e)} with another value`);if(A(e))return z(e)?`{${B(e).elements.map(Mn).join(`,`)}}`:`<${e.kind} ${U(e)}>`;let t=H(e);return`(${t.domain.map((e,n)=>`${Mn(e)}:${Mn(t.range[n])}`).join(`,`)})`},Pn=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,Fn=e=>e.reduce((e,t)=>e===0?0:e*Kt(t),1),In=e=>{if(e.kind===`Subset`)return Kt(e.base)<=6?B(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return B(e);if(e.kind===`FunctionSet`&&z(e.domain)&&Kt(e.domain)===0)return Ie([Le([],[])]);let t=e.kind===`FunctionSet`?Kt(e.range)**Kt(e.domain):Fn(e.kind===`RecordSet`?e.sets:e.factors);return t===0?ht:t<=1999?B(e):void 0},Ln=(e,t)=>{if(t)return In(e);if(z(e))try{return In(e)}catch(e){if(e instanceof u)return;throw e}},Rn=(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 jt(e,t)}},zn=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 Pn(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(B(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=Ln(e,t);return n?r(n):Rn(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{if(e.kind===`LazyFunction`&&!z(e.domain)){let t=e.source;return t?`[${t.parameters.map(e=>`${e.name} \\in ${U(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}let i=H(e),a=r=>U(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`&&zn(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):ve(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},Bn=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${fe(U(n))}\n`).join(``)},Vn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Hn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Cn(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Be(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Be(i[e],n))return i[e]}return n.kind===`Set`?Vn(n.elements,t):(Vn(n.domain,t),Vn(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}},Un=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:[])}},W=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Wn=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),Gn=(e,t)=>Wn.has(e)?new u(t):new d(t),Kn=e=>typeof e==`object`&&e.kind===`Operator`,G=(e,t,n)=>{let r=e[t];if(r===void 0||Kn(r))throw Gn(n,`${n} expects a value as argument ${t+1}`);return r},qn=(e,t,n)=>{let r=G(e,t,n);if(typeof r!=`number`)throw Gn(n,`${n} expects an integer but received ${U(r)}`);return r},Jn=(e,t,n)=>{let r=G(e,t,n);if(typeof r!=`boolean`)throw Gn(n,`${n} expects a boolean but received ${U(r)}`);return r},Yn=(e,t,n)=>{let r=G(e,t,n);if(!A(r))throw Gn(n,`${n} expects a set but received ${U(r)}`);return r},Xn=(e,t,n)=>{let r=Yn(e,t,n);if(!z(r))throw Gn(n,`${n} cannot enumerate the non-enumerable set ${U(r)}`);return r},Zn=(e,t,n)=>B(Xn(e,t,n)),Qn=(e,t,n)=>Zn(e,t,n).elements,$n=(e,t,n)=>{let r=G(e,t,n),i=Xt(r);if(!i)throw Gn(n,`${n} expects a sequence but received ${U(r)}`);return i},er=(e,t,n)=>{let r=G(e,t,n);if(!j(r))throw Gn(n,`${n} expects a function but received ${U(r)}`);return H(r)},tr=(e,t,n)=>{let r=e[t];if(r===void 0||!Kn(r))throw Gn(n,`${n} expects an operator as argument ${t+1}`);return r},nr=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),K=(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}),rr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ir=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ar=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(G(n,0,e),G(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),or=e=>e>2147483647||e<-2147483648,sr=e=>new d(`Overflow when computing ${e}`),cr={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`},lr={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},ur={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`},dr=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return lr[e.operator];if(e.kind!==`Function`)return cr[e.kind];let t=e.domain;return t.every((e,t)=>e===t+1)?`TupleValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},fr=e=>ur[dr(e)],pr=(e,t)=>new u(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),mr=(e,t)=>{let n=n=>(...r)=>{try{return n(...r)}catch(n){throw n instanceof u&&(e.isLazy===!0||!(n instanceof d))?pr(t,n.message):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},hr=(e,t)=>{if(typeof e!=`number`)throw pr(t,`Cannot cast tlc2.value.impl.${dr(e)} to tlc2.value.impl.IntValue`);return e},gr=(e,t,n)=>`public static tlc2.value.impl.${t} tlc2.module.Integers.${e}(${Array.from({length:n},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,_r=(e,t,n)=>{let r=gr(t,`IntValue`,2);return ar(e,(t,i)=>{let a=hr(t,r),o=hr(i,r),s=n(a,o);if(or(s))throw sr(`${a}${e}${o}`);return s})},vr=(e,t,n)=>{if(typeof e!=`number`)throw new d(`The ${t} argument of ${n} should be an integer, but instead it is:\n${U(e)}`);return e},yr=(e,t)=>ar(e,(n,r)=>t(vr(n,`first`,e),vr(r,`second`,e))),br=(e,t,n)=>({...ir(e,t,n),isLazy:!0}),xr=(e,t,n)=>{let r=tr(e,t,n);return()=>r.call([])},Sr=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Cr=()=>({bool:so,condition:(e,t)=>{if(typeof e!=`boolean`)throw Ja(t,e);return e},conjunct:(e,t,n)=>{if(typeof e!=`boolean`)throw Ya(t,n,e);return e},apply:fn,tuple:R,set:mt,record:Le,writtenRecord:ye,equal:Re,enumerate:po,unassigned:(e,t)=>{throw Rs(e,t)},primeOutsideAction:e=>{throw zs(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0}),extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>io(e,t,n[r]),e.scope),state:e.state,next:e.next})}),wr={value:void 0},Tr=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Er=e=>`local${e.counter++}`,Dr=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Un(e).forEach(e=>Dr(e,t)),t),Or=(e,t,n)=>{let r=Tr(e,Y(t,e.environment)),i=Dr(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Tr(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},kr=(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(()=>Er(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${jr(e,t.set,s)}, ${Tr(e,t.set)});`),u=t.bounds.map(t=>{let n=Er(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${jr(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Er(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})`},Ar=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${jr(e,r[0],n)}, "the left side of =>") ? bool(${jr(e,r[1],n)}, "the right side of =>") : true)`;if(W(t))return Or(e,t,n);let i=Do(t.operator,e.environment);if(i?.kind!==`Builtin`)return Or(e,t,n);if(i.name===`DOMAIN`)return`${Tr(e,$a(t))}(${jr(e,r[0],n)})`;if(i.name===`TLCEval`)return Or(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Tr(e,eo(t,i))}(${jr(e,r[0],n)}, ${jr(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&vs(r[0],a))return`${Tr(e,i.evaluateUnary)}(${jr(e,r[0],n)})`;let o=r.length===2&&vs(r[0],a)&&vs(r[1],a);return i.evaluateBinary&&o?`${Tr(e,i.evaluateBinary)}(${jr(e,r[0],n)}, ${jr(e,r[1],n)})`:Or(e,t,n)},jr=(e,t,n)=>{let r=(t,r=n)=>jr(e,t,r);if(cs(t)&&rs(t,e.environment))return Or(e,t,n);switch(t.kind){case`Number`:return Go(t.value)?String(t.value):Or(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(W(t))return Or(e,t,n);let i=Lo(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Tr(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Tr(e,i.value):Or(e,t,n)}case`Apply`:return Ar(e,t,n);case`And`:{let n=Tr(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)}, ${Tr(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Ms(t.function);let n=r(t.function),i=Tr(e,Za(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)}, ${Tr(e,Xa(t))}, ${Tr(e,Qa(t))})`;case`Record`:{let i=Is(t.fields);if(Ls(i))return Or(e,t,n);let a=Tr(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}, ${Tr(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=Tr(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`)?kr(e,t,n):Or(e,t,n);default:return Or(e,t,n)}},Mr=(e,t)=>{if(!Sr.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=jr(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}; };`;wr.value??=Cr();let o=wr.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Nr={kind:`Local`},Pr=/* @__PURE__ */ new WeakMap,Fr=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Ir=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2}])),Lr=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Rr=e=>e.kind===`Operator`?e.params.length:0,zr=e=>e.name.includes(`!`),Br=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Vr=(e,t,n=0)=>t.reduce((e,t)=>({name:t,arity:n,parent:e}),e),Hr=(e,t)=>t.reduce((e,t)=>({name:t.name,arity:t.arity,parent:e}),e),Ur=e=>e.kind===`Name`?[e.name]:e.names,Wr=e=>e.flatMap(e=>Ur(e.pattern)),Gr=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Lr(n.location,t.location))?n:void 0},Kr=(e,t)=>{let n=Gr(e,t);return n?{key:t.getKey(n),arity:Rr(n)}:t.imported.get(e)},qr=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),Jr=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Yr=(e,t,n,r)=>{let i=e.location,a=Pr.get(e);if(a!==void 0)return a;if(Fr(t))return e.kind===`Apply`?e.args.length:0;if(Jr(t))return 0;let o=Br(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=Nr),o)return o.arity;let s=Kr(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Pr.set(e,s.arity),s.arity;let l=t.slice(0,t.indexOf(`!`));if(l!==``&&(Br(n,l)!==void 0||Kr(l,r)!==void 0||r.facts.has(l)))return e.kind===`Apply`?e.args.length:0;let u=`at line ${i.line}, column ${i.column}`;throw new c(qr(t)?`Could not find declaration or definition of symbol '${t}' ${u}`:`Unknown operator: \`${t}' ${u}`)},Xr=(e,t,n)=>(e.forEach(e=>q(e.set,t,n)),e.reduce((e,t)=>Vr(e,Ur(t.pattern)),t)),Zr=(e,t)=>e.kind===`Identifier`&&e.name===t&&W(e)||Un(e).some(e=>Zr(e,t)),Qr=(e,t)=>{e.kind===`FunctionConstruction`&&Zr(e.body,t)&&(e.isRecursive=!0),Un(e).forEach(e=>Qr(e,t))},$r=(e,t,n)=>{let r=Vr(t,e.kind===`Function`?[e.name]:[]);e.kind===`Function`?(q(e.body,Xr(e.bounds,r,n),n),Qr(e.body,e.name)):q(e.body,Hr(r,e.params),n)},ei=(e,t,n)=>{let r=e.filter(e=>e.isRecursive).reduce((e,t)=>({name:t.name,arity:Rr(t),parent:e}),t);return e.reduce((e,t)=>(zr(t)||$r(t,e,n),{name:t.name,arity:Rr(t),parent:e}),r)},ti=(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 c(`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 c(`Argument number ${t+1} to operator '${e.name}' should be a ${a.arity}-parameter operator at line ${o.line}, column ${o.column}`)},ni=e=>e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:void 0,ri=(e,t,n)=>{let r=Br(t,e.operator)?void 0:Gr(e.operator,n),i=Yr(e,e.operator,t,n);if(i!==e.args.length)throw new c(`The operator ${e.operator} requires ${i} arguments at line ${e.location.line}, column ${e.location.column}`);e.args.forEach((e,i)=>{let a=ni(e),o=a===void 0||Br(t,a)?void 0:Gr(a,n),s=ii(e,t,n);r&&ti(r,i,e,s,o)})},ii=(e,t,n)=>e.kind===`Identifier`?Yr(e,e.name,t,n):e.kind===`OperatorReference`?Yr(e,e.operator,t,n):(q(e,t,n),e.kind===`Lambda`?e.params.length:0),q=(e,t,n)=>{let r=e=>e.forEach(e=>q(e,t,n));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=Yr(e,e.name,t,n);if(r>0)throw new c(`The operator ${e.name} requires ${r} arguments at line ${e.location.line}, column ${e.location.column}`);return}case`OperatorReference`:Yr(e,e.operator,t,n);return;case`Apply`:ri(e,t,n);return;case`Lambda`:q(e.body,Vr(t,e.params),n);return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:q(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&&q(e.other,t,n);return;case`Let`:q(e.body,ei(e.definitions,t,n),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:q(e.body,Xr(e.bounds,t,n),n);return;case`UnboundedQuantifier`:q(e.body,Vr(t,e.names),n);return;case`Choose`:e.set&&q(e.set,t,n),q(e.body,Vr(t,Ur(e.pattern)),n);return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:q(e.predicate,Xr([e.bound],t,n),n);return;case`SetMap`:q(e.expression,Xr(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 c(`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`:q(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`:q(e.body,t,n);return;case`Subexpression`:e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>ii(e,t,n))}},ai=(e,t,n)=>(e.set&&q(e.set,t,n),{name:e.name,arity:e.arity,parent:t}),oi=(e,t,n)=>{let r=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?ai(t,e,n):(t.kind===`AssumeProve`?oi(t,e,n):q(t,e,n),e),t);return q(e.conclusion,r,n),r},si=(e,t,n)=>e.kind===`AssumeProve`?oi(e,t,n):(q(e,t,n),t),ci=(e,t,n)=>{e?.kind===`Steps`&&e.steps.reduce((e,t)=>li(t,e,n),t)},li=(e,t,n)=>{let r=e.body;switch(r.kind){case`Assert`:{let i=si(r.statement,t,n);return ci(e.proof,i,n),r.isSuffices?i:t}case`Define`:return ei(r.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),t,n);case`Have`:case`Case`:return q(r.expression,t,n),ci(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>q(e,t,n)),t;case`Take`:return Vr(Xr(r.bounds,t,n),r.names);case`Pick`:{let i=Vr(Xr(r.bounds,t,n),r.names);return q(r.body,i,n),ci(e.proof,t,n),i}default:return ci(e.proof,t,n),t}},ui=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:si(e.statement,void 0,t);ci(e.proof,n,t)},di=(e,t)=>new c(`Multiply-defined symbol '${e}' at line ${t.line}, column ${t.column}`),fi=(e,t,n,r)=>t.reduce((e,t)=>{if(Br(e,t)||n(t))throw di(t,r);return{name:t,arity:0,parent:e}},e),pi=(e,t,n,r)=>(e.forEach(e=>hi(e.set,t,n)),e.reduce((e,t)=>fi(e,Ur(t.pattern),n,r),t)),mi=(e,t,n)=>{if(e.kind===`Function`){let r=Vr(t,[e.name]),i=pi(e.bounds,r,n,e.location);hi(e.body,i,n);return}let r=fi(t,e.params.map(e=>e.name),n,e.location);hi(e.body,r,n)},hi=(e,t,n)=>{let r=e.location;switch(e.kind){case`Lambda`:hi(e.body,fi(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(Br(e,t.name)||n(t.name))throw di(t.name,t.location);return mi(t,Vr(e,i),n),Vr(e,[t.name])},t);hi(e.body,fi(a,(e.instances??[]).flatMap(e=>e.name===void 0?[]:[e.name]),n,r),n);return}case`Forall`:case`Exists`:case`FunctionConstruction`:hi(e.body,pi(e.bounds,t,n,r),n);return;case`SetFilter`:hi(e.predicate,pi([e.bound],t,n,r),n);return;case`SetMap`:hi(e.expression,pi(e.bounds,t,n,r),n);return;case`UnboundedQuantifier`:hi(e.body,fi(t,e.names,n,r),n);return;case`Choose`:e.set&&hi(e.set,t,n),hi(e.body,fi(t,Ur(e.pattern),n,r),n);return;default:Un(e).forEach(e=>hi(e,t,n))}},gi=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;gi(e).sort((e,t)=>Lr(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)&&!Ir.has(e))return!1;let r=t.importedAt.get(e);return r===void 0||Lr(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 di(n.name,n.location)}));let i=e=>t=>(n.get(t)??[]).some(t=>t.isRecursive||Lr(t.location,e))||r(t,e);e.definitions.forEach(e=>mi(e,void 0,i(e.location))),e.assumptions.forEach(e=>hi(e.expression,void 0,i(e.location))),e.instances.forEach(e=>{let t=i(e.location),n=fi(void 0,e.params.map(e=>e.name),t,e.location);e.substitutions.forEach(e=>hi(e.expression,n,t))})},vi=(e,t)=>{let n=new Map([...Ir,...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},yi=(e,t,n,r)=>{let i=Hr(void 0,e.params),a={imported:vi(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 c(`Identifier '${n}' is not a legal target of a substitution ${s}`)}),new Map(t.map(t=>{let n=t.name;if(!o.has(n)&&!Br(i,n)&&!Kr(n,a))throw new c(`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 q(r,i,a),[n,r];if(Yr(r,r.name,i,a)!==t.arity)throw new c(`An operator must be substituted for symbol '${n}', and it must have arity ${t.arity} ${s}`);return[n,r]}))},bi=(e,t)=>{let n=vi(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=>$r(e,void 0,i(e.location,e))),e.assumptions.forEach(e=>q(e.expression,void 0,i(e.location,void 0))),e.theorems.forEach(e=>ui(e,i(e.location,void 0)))},xi=/* @__PURE__ */ new WeakSet,Si=/* @__PURE__ */ new WeakSet,Ci=(e,t,n=/* @__PURE__ */ new Set)=>{let r=ki(e,(e,r)=>Ci(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&W(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&W(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},wi=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Ti=/* @__PURE__ */ new WeakMap,Ei=e=>Ti.get(e)??e.name,Di=(e,t)=>(Ei(t)!==e.name&&Ti.set(e,Ei(t)),e),Oi=(e,t)=>Di(e.kind===`Function`?{...e,bounds:wi(e.bounds,e=>t(e,[])),body:t(e.body,Wr(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),ki=(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=>Oi(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:wi(e.bounds,n),body:t(e.body,Wr(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,Ur(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,Ur(e.bound.pattern))};case`SetMap`:return{...e,bounds:wi(e.bounds,n),expression:t(e.expression,Wr(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)}}},Ai=`LAMBDA`,ji=(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 ki(e,(e,n)=>(r.push(...ji(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Mi=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}},Ni=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Pi=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Fi=(e,t)=>e.map(e=>({pattern:Pi(e.pattern,t),set:e.set})),Ii=(e,t)=>e.kind===`Function`?{...e,bounds:Fi(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Li=(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=>Di({...Ii(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Fi(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Pi(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Pi(e.bound.pattern,n),set:e.bound.set}};default:return e}},Ri=e=>`${e}@ENABLED`,zi=(e,t)=>e.modes.get(t)??e,Bi=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!W(e)&&t.instantiation.variables.has(e.name),Vi=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Vi(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Bi(e,t,n))return[e.name];let r=W(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Vi(r.body,t,/* @__PURE__ */ new Map):void 0},Hi=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Bi(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Ri(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:qi(e.expression,zi(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[qi(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:qi(e.subscript,zi(t,`Primed`),n),location:r},qi(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Vi(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:Ri(r),location:e.location},location:e.location},qi({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Ui=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),Wi=(e,t)=>e.map(e=>Ui(e.name,t)),Gi=(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:[...Wi(t,r),...i.map(e=>Ui(e,r))],location:r},location:r}},Ki=(e,t)=>e.instantiation.isParameterized(t)?Yi(e,t):void 0,qi=(e,t,n)=>{let r=e=>qi(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!W(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:qi(e.expression,zi(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:qi(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},zi(t,`Enabled`),n)};let s=Hi(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return xi.add(n),n;let r=Ki(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&&Rr(o)>0?Gi(r,a,Rr(o),e.location):{kind:`Apply`,operator:r,args:Wi(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||Si.has(e),l=e=>(s&&Si.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return l({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return l({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Ai,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:Ai,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new c(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Ki(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...Wi(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=Ki(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?Gi(n,a,Rr(r),e.location):{...e,operator:n}}let l=Mi(t),u=ki(e,(e,i)=>i.length===0?r(e):qi(e,t,Ni(n,i,l)));return Li(u,n,l)},Ji=(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:Ui(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Yi=(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=Mi(e),o=Ii(Oi(i,(t,n)=>qi(t,e,Ni(/* @__PURE__ */ new Map,n,a))),a);return Ji(o,r.params,i.location)}):t},Xi=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ji(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=>Ki(i,e)??e,getQualifiedKey:t=>{let n=Ki(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Ji(r,e.params,r.location)):t}}},Zi=e=>e.kind===`Let`&&e.instances!==void 0||Un(e).some(Zi),Qi=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=ki(e,e=>Qi(e,t,r));return i.kind!==`Let`||!i.instances?i:{kind:`Let`,definitions:i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Lr(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}},$i=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ea=(e,t)=>e.definitions.some(e=>Zi(e.body))||e.assumptions.some(e=>Zi(e.expression))||e.theorems.some(e=>{let t=$i(e);return t!==void 0&&Zi(t)})?{...e,definitions:e.definitions.map(e=>Oi(e,e=>Qi(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Qi(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=$i(e);return n===void 0?e:{...e,statement:Qi(n,t,[])}})}:e,ta=/* @__PURE__ */ new WeakMap,na=/* @__PURE__ */ new WeakMap,J=(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},ra=(e,t,n)=>{let r=e.slice();return r[t]=n,r},ia=(t,r,i=X(t,r))=>{if(typeof i==`boolean`)return i;try{return so(i,`the action at ${Ga(t)}`)}catch(t){throw r.next===void 0?t:n(t,e.error)}},aa=e=>e===`=`||e===`\\in`||e===`\\subseteq`,oa=(e,t,n)=>{let r=n?ta:na,i=r.get(e);if(i)return i;let a=Fa(e,t,n);return r.set(e,a),a},sa=(e,t)=>{if(t.constants.has(e))return;let n=co(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},ca=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return ca(e.expression,t,!1,r);if(e.kind!==`Identifier`||W(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=sa(e.name,t);if(a&&!r.has(a))return r.add(a),ca(a.body,t,n,r)},la=(e,t,n)=>ca(e,t,!n),ua=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return ua(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Uo(e.definitions,J(r,t,n));return ua(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ro(t,e.name);if(a?.kind===`Thunk`)return ua(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=sa(e.name,r.environment);if(s)return ua(s.body,void 0,n,r,i)},da=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||W(e))||!t&&e.kind===`Prime`,fa=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>fa(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=sa(e.name,t);if(i)return n.add(e.name),fa(i.body,t,n)},pa=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),ma=(e,t,n)=>pa.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||aa(e.operator)&&(da(e.args[0],n)||la(e.args[0],t,n)!==void 0)||W(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,ha=/* @__PURE__ */ new Set,ga=(e,t)=>{if(W(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return ki(e,(e,i)=>{let a=r.isReadOnly?ga(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},_a=(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||W(e)?void 0:co(r,t);return i&&!n.has(i)&&(n.add(i),_a(i.body,t,n))?!0:Un(e).some(e=>_a(e,t,n))},va=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=la(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=fa(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return ma(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:oa(e,t,n)}},ya=(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(Ws(e,t)===void 0||_a(e,t,/* @__PURE__ */ new Set))return!0;let n=ga(e,ha);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)}},ba=(e,t,n)=>{let r=e.map(e=>va(e,t,n)),i=r.map(()=>void 0),a=(e,n,o,s,c,l)=>{let u=s,d;for(let s=e;s<r.length;s++){if(s>0&&n.isInit&&za(u)){d??=J(n,o,u);for(let e=s;e<r.length;e++)if(!xa(r[e].expression,d))return;l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=J(n,o,u);let r=i[s]??=ps(e.expression,t);if(!ia(e.expression,d,r(d)))return;continue}if(e.kind===`Assign`){d??=J(n,o,u);let r=(i[s]??=ps(e.value,t))(d),a=u[e.index];if(a===void 0)u=ra(u,e.index,r),d=void 0;else if(!Re(a,r))return;continue}if(e.kind===`Unchanged`){let t=n.current;if(!t)return;for(let n of e.indices){let e=u[n];if(e===void 0)u=ra(u,n,t[n]),d=void 0;else if(!Re(e,t[n]))return}continue}let f=s+1;e.runner(n,o,u,c,!0,(e,t)=>a(f,n,o,e,t,l));return}l(u,c)};return(e,t,n,r,i,o)=>a(0,e,t,n,r,o)},xa=(e,t)=>so(X(e,t),`the initial predicate at ${Ga(e)}`),Sa=e=>(t,n,r,i,a,o)=>{ia(e,J(t,n,r))&&o(r,i)},Ca=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),d=J(r,i,a);if(a[l]!==void 0){ia(e,d)&&c(a,o);return}let f=X(n,d),p=e.operator===`\\subseteq`?{kind:`Subset`,base:f}:f;if(!z(p))throw new u(`In computing ${r.isInit?`initial`:`next`} states, the right side of \\IN is not enumerable.\n${qa(e)}`);let m=Ut(p);for(let e=0;e<m.length&&!r.isStopped;e++)c(ra(a,l,m[e]),o)}},wa=/* @__PURE__ */ new WeakMap,Ta=e=>{let t=wa.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Ta),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return wa.set(e,n),n},Ea=(e,t)=>{let n=e.args[0],r=Sa(e),i=(e,r,i)=>ua(n,r,i,e,!t)??-1,a=Ca(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],J(t,n,o));l(ra(o,u,d),s)}},Da=(e,t,n,r)=>{if(e.kind===`FunctionConstruction`)return{bounds:e.bounds,body:e.body,scope:t};if(e.kind!==`Identifier`)return;let i=ro(t,e.name);if(i?.kind===`Thunk`)return Da(i.expression,i.scope,n,r);let a=i?void 0:co(e.name,r.environment);if(a?.kind!==`Function`)return;let o=X(e,J(r,void 0,n));return{bounds:a.bounds,body:a.body,scope:io(void 0,a.name,o)}},Oa=(e,t,n)=>{let r=Sa(e);return(i,a,o,s,c,l)=>{let d=Da(e.function,a,o,i);if(!d){r(i,a,o,s,c,l);return}let f=J(i,a,o),p=e.args.map(e=>X(e,f)),m=p.length===1?p[0]:R(p),h=ho(d.bounds,J(i,d.scope,o));if(!$t(m,h))throw new u(`Attempted to apply a function to ${U(m)}, which is not in its domain at ${Ga(e)}`);oa(d.body,t,n)(i,go(d.bounds,d.scope,m),o,s,c,l)}},ka=(e,t)=>{if(fa(e,t))return ba([Ta(e)],t,!1);if(e.kind===`Tuple`)return oa(Ta(e),t,!1);let n=Ta(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ro(i,e.name):void 0;l?.kind===`Thunk`?oa(Ta(l.expression),t,!1)(r,l.scope,a,o,s,c):ia(n,J(r,i,a))&&c(a,o)}},Aa=(e,t,n)=>{let r=e.operator,i=Sa(e),a=W(e)?void 0:Do(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=xs(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=oa(a.body,t,n),o.body(e,i(J(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=J(a,o,s),f=ko(e,d);f?.kind===`Closure`?oa(f.body,t,n)(a,Vo(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},ja=(e,t,n)=>{let r=Sa(e),i=W(e)?void 0:sa(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ro(s,e.name);f?.kind===`Thunk`?oa(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=oa(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Ma=(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!==`=`||W(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`||!W(a))return;let o=ca(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=>Ma(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`||W(e))return;let r=Do(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Ma(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`&&W(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Na=(e,t,n)=>{let r=ro(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},Pa=(e,t,n)=>{let r=e.map(e=>oa(e,t,n)),i=n?[]:e.map(e=>Ma(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&&Na(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)}},Fa=(e,t,n)=>{let r=e=>oa(e,t,n);switch(e.kind){case`And`:return ba(e.operands,t,n);case`Or`:return Pa(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=po(X(a.set,J(t,n,r)),a.set);for(let a=0;a<l.length&&!t.isStopped;a++)i(t,io(n,e,l[a]),r,o,s,c)}}let o=n?void 0:ya(e,t);if(o){let r=ba(o.rest,t,n);return(t,n,i,a,s,c)=>{let l=J(t,n,i),u=e.bounds.map(e=>po(X(e.set,l),e.set));if(u.some(e=>e.length===0))return;let d=(e,n)=>{if(e<0)r(t,n,i,a,s,c);else for(let r of u[e]){if(t.isStopped)return;let a=io(n,o.names[e],r);if(e===u.length-1){let e=J(t,a,i);if(!o.guards.every(t=>ia(t,e)))continue}d(e-1,a)}};d(u.length-1,n)}}return(t,n,r,a,o,s)=>{mo(e.bounds,J(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Ws(e,t)!==void 0&&!_a(e.body,t,/* @__PURE__ */ new Set)?ga(e,ha):void 0;return(t,n,r,o,s,c)=>{let l=[];mo(e.bounds,J(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ro(n,e)?.kind===`Value`)){u.every(n=>ia(e.body,J(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&za(r)?u.slice(n).every(n=>xa(e.body,J(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,J(r,i,a));(so(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=J(r,i,a),d=t.find(e=>so(X(e.condition,l),`a CASE guard`))?.body??n;if(!d)throw new u(`In computing ${r.isInit?`initial`:`next`} states, TLC encountered a CASE with no conditions true.\n${qa(e)}`);d(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=$o(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Uo(e.definitions,J(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new u(`UNCHANGED appears in an initial predicate at ${Ga(e)}`)}:ka(e.expression,t);case`AngleAction`:{let t=r(e.action),n=Ta(e.subscript);return(e,r,i,a,o,s)=>t(e,r,i,a,o,(t,i)=>{ia(n,J(e,r,t))||s(t,i)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,Ta(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return ja(e,t,n);case`FunctionApplication`:return Oa(e,t,n);case`Apply`:{let i=e.args;if(aa(e.operator)){let r=la(i[0],t,n);if(r!==void 0)return e.operator===`=`?ba([e],t,n):Ca(e,()=>r);if(da(i[0],n))return Ea(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=X(i[0],J(t,n,r));(typeof c==`boolean`?c:so(c,`the left side of => at ${Ga(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Aa(e,t,n)}default:return Sa(e)}},Ia=/* @__PURE__ */ new WeakMap,La=e=>{let t=Ia.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Ia.set(e,n),n},Ra=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),za=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Ba=(e,t)=>{let n=t.state;if(!n||!za(n))throw new u(`ENABLED needs a complete state at ${Ga(e)}`);let r=t.environment,i={environment:r,isInit:!1,current:n,isStopped:!1};return oa(e,r,!1)(i,t.scope,La(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Va=(t,r,i,a)=>{let o={environment:r,isInit:!0,current:void 0,isStopped:!1};oa(t,r,!0)(o,a,La(r),void 0,!1,t=>{if(!o.isStopped){if(!za(t))throw n(new u(`The initial predicate does not assign ${Ra(t,r).join(`, `)}`),e.error);o.isStopped=i(t)}})},Ha=(e,t,n)=>{let r=[];return Va(e,t,e=>(r.push(e),!1),n),r},Ua=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,current:t,isStopped:!1},o={successors:0};return oa(e,n,!1)(a,i,La(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!za(e))throw new f(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${Ra(e,n).join(`, `)}`);o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Wa=(e,t,n,r)=>{let i=[];return Ua(e,t,n,e=>(i.push(e),!1),r),i},Ga=e=>`line ${e.location.line}, column ${e.location.column}`,Ka=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,qa=e=>{let t=e.location.range;return t?Ka(t):Ga(e)},Ja=(e,t)=>new u(`A non-boolean expression (${fr(t)}) was used as the condition of an IF.\n${qa(e)}`),Ya=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r){let r=e.operands[t],i=r.kind===`Number`?String(r.value):qa(r);return new u(`A non-boolean expression (${fr(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 u(`Attempted to evaluate an expression of form P /\\ Q when ${t===0?`P`:`Q`} was\n${fr(n)}.\n${qa({...e,location:{...e.location,range:{...r,end:i}}})}`)},Xa=e=>t=>ln(t)?`Attempted to select nonexistent field "${e.field}" from the record\n${U(t)}\n${qa(e)}`:cn(t,e.field),Za=e=>t=>`A non-function (${fr(t)}) was applied as a function.\n${qa(e)}`,Qa=e=>t=>`Attempted to select field "${e.field}" from a non-record value ${U(t)}\n${qa(e)}`,$a=e=>t=>{if(!j(t))throw new u(`Attempted to apply the operator DOMAIN to a non-function\n(${fr(t)})\n${qa(e)}`);return mn(t)},eo=(e,t)=>(n,r)=>{if(!A(n)||F(n))throw new u(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${qa(e)}`);return t.evaluate([n,r])},to=t=>n(new u(`TLC can't handle real numbers: ${t.text} at ${Ga(t)}`),e.configParseError),no=t=>n(new u(`TLC can't handle a number this big: ${t.text??t.value} at ${Ga(t)}`),e.error),ro=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},io=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),ao=(e,t,n)=>{if(t.kind===`Name`)return io(e,t.name,n);let r=Xt(n);if(!r||r.length!==t.names.length)throw new u(`Cannot bind <<${t.names.join(`, `)}>> to ${U(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>io(e,t,r[n]),e)},oo=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next}),so=(e,t)=>{if(typeof e!=`boolean`)throw new u(`Expected ${t} to be a boolean but found ${U(e)}`);return e},co=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),lo=(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=co(n,t);if(e&&!t.constants.has(n)&&!uo(e,t))return!0}return Un(e).some(e=>lo(e,t))},uo=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!lo(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>lo(e.set,t)));return t.constantLevels.set(e,r),r},fo=(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.`},po=(e,t)=>{if(!A(e)||F(e)){let n=U(e),r=fo(e,n);throw new u(r===void 0?`TLC encountered a non-enumerable quantifier bound\n${n}.\n${qa(t)}`:`TLC encountered the non-enumerable quantifier bound\n${n}\n${qa(t)}\n${r}`)}return typeof e==`object`&&e.kind===`Interval`?Tt(e):B(e).elements},mo=(e,t,n)=>{let r=e.map(e=>po(X(e.set,t),e.set)),i=(t,a)=>t<0?n(a):r[t].some(n=>i(t-1,ao(a,e[t].pattern,n)));return i(e.length-1,t.scope)},ho=(e,t)=>{let n=e.map(e=>X(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},go=(e,t,n)=>{if(e.length===1)return ao(t,e[0].pattern,n);let r=Xt(n)??[];return e.reduce((e,t,n)=>ao(e,t.pattern,r[n]),t)},_o=/* @__PURE__ */ new WeakMap,vo=(e,t)=>{let n=_o.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:Ka(r)};return _o.set(t,i),i},yo=(e,t,n)=>{let r=vo(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}},bo=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Cn(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(Be(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},xo=(e,t)=>{let n=ho(e.bounds,t),r=bo(n,(n,r)=>X(e.body,oo(t,go(e.bounds,io(void 0,e.name,r),n))),yo(e.bounds,e.body,n));return e.bounds.length===1?nn(r):r},So=(e,t)=>e.kind===`Function`?xo(e,t):X(e.body,t),Co=(e,t)=>{let n=uo(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 u(`Operator ${e.name} requires ${e.params.length} arguments`);let i=oo(t,void 0);if(!n)return So(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>So(e,i));return t.environment.definitionValues.set(e,a),a},wo=(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,oo(t,e.scope));return n&&(e.cache=r),r},To=/* @__PURE__ */ new WeakMap,Eo=e=>{let t=To.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return To.set(e,n),n},Do=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Do(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Eo(r):t.builtins.get(e)},Oo=/* @__PURE__ */ new WeakMap,ko=(e,t)=>{if(W(e))return Ao(e.operator,t);let n=Oo.get(e),r=n===void 0?Do(e.operator,t.environment)??null:n;return n===void 0&&Oo.set(e,r),r??Ao(e.operator,t)},Ao=(e,t)=>{let n=ro(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Do(e,t.environment)},jo=e=>e.kind===`Closure`?e.params.length:e.arity,Mo=(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:Ao(n,t);if(!r)throw new u(`Expected an operator argument at ${Ga(e)}`);return r},No=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>io(e,n.name,t[r]),e.scope);return X(e.body,oo(n,r))},Po=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:jo(e),call:n=>No(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},Fo=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Ao(e.name,t);return n!==void 0&&jo(n)>0},Io=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),Lo=(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 Lo(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([])}},Ro=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Go(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=W(e)?void 0:Lo(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ro(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Io(e,t)}}return t=>Io(e,t)},zo=/* @__PURE__ */ new WeakMap,Bo=(e,t)=>{let n=zo.get(e);if(n)return n;let r=Ro(e,t);return zo.set(e,r),r},Vo=(e,t,n)=>{if(t.length!==e.params.length)throw new u(`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:Mo(t[i],n)}:Bo(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},Ho=(e,t,n)=>e.kind===`Closure`?X(e.body,oo(n,Vo(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>X(e,n))):e.isLazy?e.evaluate(ys(t,n),n):e.evaluate(t.map(e=>Fo(e,n)?Po(Mo(e,n),n):X(e,n)),n),Uo=(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),Wo=(e,t,n)=>{let r=ro(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return wo(r,n);if(r?.kind===`Operator`){if(jo(r.operator)===0)return No(r.operator,[],n);throw new u(`Operator ${e} is used without arguments`)}let i=Lo(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Rs(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Co(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new u(`Unknown identifier ${e} at ${Ga(t)}`)},Go=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Ko=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),qo=(e,t)=>Ko.has(e)||t.builtins.get(e)?.isStateLevel===!0,Jo={builtins:Ko,definitions:/* @__PURE__ */ new WeakMap},Yo={builtins:new Set([...Ko].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},Xo=(e,t)=>e.kind===`Operator`&&e.params.length===0&&uo(e,t),Zo=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!W(e)){let e=co(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!Xo(e,t)&&Qo(e,t,n))return!0}return Un(e).some(e=>Zo(e,t,n))},Qo=(e,t,n=Jo)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Zo(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Zo(e.set,t,n));return n.definitions.set(e,i),i},$o=(e,t)=>new Set(e.filter(e=>Qo(e,t))),es=e=>[...e.definitions.values()].some(t=>Qo(t,e)),ts=e=>[...e.definitions.values()].some(t=>Qo(t,e,Yo)),ns=/* @__PURE__ */ new WeakMap,rs=(e,t)=>{let n=ns.get(e);if(n!==void 0)return n;let r=ss(e,t,as);return ns.set(e,r),r},is=/* @__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`]),as=/* @__PURE__ */ new Set,os=(e,t,n)=>n.size===0?rs(e,t):ss(e,t,n),ss=(e,t,n)=>{if(!is.has(e.kind))return!1;if(e.kind===`Identifier`&&W(e))return n.has(e.name);if(W(e))return!1;if(e.kind===`Identifier`){let n=Lo(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&Xo(n.definition,t)}if(e.kind===`Apply`){if(qo(e.operator,t)||e.operator===`~>`)return!1;let r=Do(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=co(e.operator,t);if(!n||!uo(n,t)||Qo(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`&&os(e,t,n))}let r={value:!0};return ki(e,(e,i)=>(r.value&&=os(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},cs=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,ls=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}},us=(e,t)=>{if(e.kind===`Identifier`&&W(e))return!t.has(e.name);if(W(e))return!0;let n={value:!1};return ki(e,(e,r)=>(n.value||=us(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},ds=(e,t)=>xi.has(e)&&cs(e)&&Ws(e,t)!==void 0&&!us(e,as),Y=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Vs(e,t),i=cs(e)&&rs(e,t)?ls(r):ds(e,t)?gs(r):r;return t.evaluators.set(e,i),i},fs=/* @__PURE__ */ new WeakMap,ps=(e,t)=>{let n=fs.get(e);if(n)return n;let r=(cs(e)&&rs(e,t)?void 0:Mr(e,t))??Y(e,t);return fs.set(e,r),r},X=(e,t)=>ps(e,t.environment)(t),ms=(e,t)=>{let n=e.name,r=W(e)?void 0:Lo(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Rs(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&&uo(e,t))return t=>Co(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=ps(e.body,t),n.body(oo(r,void 0)));return hs(e,t)?gs(r):r}return t=>Co(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Co(e,t);return uo(e,t)||!hs(e,t)?n:gs(n)}return t=>Wo(n,e,t)},hs=(e,t)=>Ws(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Ws(e.set,t)!==void 0)),gs=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},_s=(e,t)=>{let n=Do(e,t);return n!==void 0&&jo(n)>0},vs=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!W(e)&&_s(e.name,t)),ys=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>X(e,t),expression:e})),bs=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(ys(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&vs(t[0],n)){let e=Y(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&vs(t[0],n)&&vs(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=>Fo(e,n)?Po(Mo(e,n),n):X(e,n)),n)},xs=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new u(`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:Bo(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:Mo(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Ss=/* @__PURE__ */ new WeakMap,Cs=e=>{let t=Ss.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return Ss.set(e,n),n},ws=(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},Ts=(e,t)=>e.every((e,n)=>Be(e,t[n])),Es=(e,t)=>{let n=co(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&uo(n,t)&&!Qo(n,t)},Ds=(e,t,n,r)=>{let i=xs(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=ps(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=Cs(e);return e=>{let n=i(e),r=ws(n,t.length);if(!r)return o(n,e);let a=r.length;for(let e of r)a=vn(a,Cn(e));let c=s.calls.get(a),l=c?.find(e=>Ts(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}},Os=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Y(n[0],t),r=Y(n[1],t);return t=>!so(e(t),`the left side of =>`)||so(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new u(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=W(e)?void 0:Do(e.operator,t);if(r?.kind===`Closure`)return Ds(r,n,t,Es(e,t));if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Y(n[0],t),i=$a(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Y(n[0],t);return Si.has(e)||lo(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=eo(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?bs(r,n,t):r=>{let i=Ao(e.operator,r);if(i)return Ho(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new u(`${e.operator} is a function; apply it with brackets`):new u(`Unknown operator ${e.operator} at ${Ga(e)}`)}},ks=(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=po(o(t),a.set);for(let a=0;a<s.length;a++){let o=so(i(oo(t,io(t.scope,e,s[a]))),r);if(o!==n)return o}return n}}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>Y(e.set,t));return t=>{let s=a.map((e,n)=>po(e(t),o[n].set)),c=(a,o)=>{if(a<0)return so(i(oo(t,o)),r)!==n;let l=s[a];for(let t=0;t<l.length;t++)if(c(a-1,io(o,e[a],l[t])))return!0;return!1};return c(o.length-1,t.scope)?!n:n}}return e=>mo(o,e,t=>so(i(oo(e,t)),r)!==n)?!n:n},As=(e,t)=>{if(e.kind===`Tuple`)return R(e.names.map(e=>{let n=ro(t,e);return n?.kind===`Value`&&n.value}));let n=ro(t,e.name);return n?.kind===`Value`?n.value:void 0},js=/* @__PURE__ */ new WeakSet,Ms=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&js.add(e)},Ns=(e,t)=>{let n=js.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):ho(i,t),l=typeof c==`object`&&c.kind===`ProductSet`&&i.length>1?c.factors:[c];if(e.isRecursive||n||!l.every(pe)){let n=bo(c,e=>r(oo(t,go(i,t.scope,e))),yo(i,e.body,c));return i.length===1?nn(n):n}if(o&&a.pattern.kind===`Name`){let e=a.pattern.name,n=Dt(c);return nn(Le(n,n.map(n=>r(oo(t,io(t.scope,e,n))))))}let u=[];return mo(i,t,e=>{let n=i.length===1?As(a.pattern,e)??!1:R(i.map(t=>As(t.pattern,e)??!1));return u.push([n,r(oo(t,e))]),!1}),yt(u)}},Ps=(e,t)=>{let n=js.has(e);n&&Ms(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):R(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(oo(i,io(i.scope,`@`,e))):hn(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}},Fs=(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=>so(n(oo(t,ao(t.scope,i,e))),`a set filter predicate`);if(!pe(a)){if(A(a))return{kind:`FilteredSet`,base:a,test:o};throw new u(`TLC encountered a non-enumerable quantifier bound ${U(a)} at ${Ga(e.bound.set)}`)}return Ie(B(a).elements.filter(o))}}if(e.kind===`SetMap`){let n=Y(e.expression,t);return t=>{let r=[];return mo(e.bounds,t,e=>(r.push(n(oo(t,e))),!1)),mt(r)}}let n=e.set;if(!n)return()=>{throw new u(`TLC cannot evaluate an unbounded CHOOSE at ${Ga(e)}`)};let r=Y(e.body,t),i={pattern:e.pattern,set:n};return t=>{let n={value:void 0};if(mo([i],t,i=>so(r(oo(t,i)),`the body of CHOOSE`)?(n.value=As(e.pattern,i),!0):!1),n.value===void 0)throw new u(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${qa(e)}`);return n.value}},Is=e=>[...e].sort((e,t)=>L(e.name,t.name)),Ls=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Rs=(e,t)=>new u(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${qa(t)}`),zs=e=>new u(`A primed expression appears outside an action at ${Ga(e)}`),Bs=(e,t)=>{let n=Is(e),r=Ls(n),i=n.map(e=>Y(e.value,t));if(r)return e=>yt(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=>ye(a,i.map(t=>t(e)),o):e=>Le(a,i.map(t=>t(e)))},Vs=(e,t)=>{let n=e=>Y(e,t);switch(e.kind){case`Number`:{let t=e.value;return Go(t)?()=>t:()=>{throw no(e)}}case`Decimal`:return()=>{throw to(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return ms(e,t);case`Apply`:return Os(e,t);case`OperatorReference`:case`Lambda`:return()=>{throw new u(`An operator cannot be used as a value at ${Ga(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 Ya(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(so(t[n](e),`a disjunct`))return!0;return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw zs(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>Re(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 Ja(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(so(e.condition(n),`a CASE guard`))return e.body(n);if(r)return r(n);throw new u(`Attempted to evaluate a CASE with no conditions true.\n${qa(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(oo(n,Uo(e.definitions,n)))}case`Forall`:case`Exists`:return ks(e,t);case`UnboundedQuantifier`:return()=>{throw new u(`TLC cannot evaluate an unbounded quantifier at ${Ga(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Fs(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>mt(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>R(t.map(t=>t(e)))}case`FunctionConstruction`:return Ns(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 Bs(e.fields,t);case`RecordSet`:{let t=Is(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 Ps(e,t);case`ExceptAt`:return t=>{let n=ro(t.scope,`@`);if(n?.kind!==`Value`)throw new u(`@ appears outside an EXCEPT at ${Ga(e)}`);return n.value};case`FunctionApplication`:{Ms(e.function);let t=n(e.function),r=e.args.map(n),i=Za(e);if(r.length===1){let e=r[0];return n=>fn(t(n),e(n),void 0,i)}return e=>fn(t(e),R(r.map(t=>t(e))),void 0,i)}case`FieldAccess`:{let t=n(e.record),r=e.field,i=Xa(e),a=Qa(e);return e=>fn(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?so(t(e),`an action`)||r(e):so(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Ba(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new u(`The subexpression reference at ${Ga(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new u(`TLC cannot evaluate a temporal formula in a state at ${Ga(e)}`)}}},Hs=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Us=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Ws=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Hs.has(e.kind))return!1;let a=Us(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&qo(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return Un(e).every(i)};return i(e)?[...n]:void 0},Gs=/* @__PURE__ */ new Map([[`Reals`,`-------------------------------- MODULE Reals -------------------------------
9
+ const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenessViolation:13,assertViolation:14,specEvaluationFailure:75,safetyEvaluationFailure:76,livenessEvaluationFailure:77,specParseError:150,configParseError:151,error:255},t=/* @__PURE__ */ new WeakMap,n=(e,n)=>(e instanceof Error&&!t.has(e)&&t.set(e,n),e),r=e=>t.get(e),i=t=>{try{return t()}catch(t){throw n(t,e.error)}},a=e=>{let t=i(e);return t&&{branches:t.branches,addInitialState:(e,n,r)=>i(()=>t.addInitialState(e,n,r)),addState:(e,n,r,a)=>i(()=>t.addState(e,n,r,a)),findViolation:()=>i(()=>t.findViolation()),getViolatedProperties:(e,n)=>i(()=>t.getViolatedProperties(e,n))}},o=e=>`TLC threw an unexpected exception.\nThis was probably caused by an error in the spec or model.\nSee the User Output or TLC Console for clues to what happened.\nThe exception was a ${e}\n: `,s=o(`java.lang.RuntimeException`),c=e=>e instanceof RangeError&&e.message===`Maximum call stack size exceeded`;var l=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},u=class extends l{failure;sany;constructor(e,t,n,r){super(e,t),this.name=`TlaSyntaxError`,this.failure=n,this.sany=r}},d=class extends u{location;parseError;constructor(e,t,n){super(e),this.location=t,this.parseError=n}},f=class extends d{constructor(e,t,n=!0){super(`Cannot find source file for module ${e} imported in module ${t}.`,n?t:void 0)}};const p=(e,t=!1,n,r=[])=>new u(e.map(e=>`${e.location}\n\n${e.message}`).join(`
10
+
11
+ `),void 0,void 0,{errors:e,warnings:r,isFatal:t,parseError:n}),m=(e,t)=>p([{location:`In module ${t}`,message:`Cannot find source file for module ${e} imported in module ${t}.`}],!0),h=e=>`*** Warnings: ${e.length}\n\n${e.map(e=>`${e.location}\n\n${e.message}\n\n\n`).join(`
12
+ `)}`,g=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,_=(e,t)=>p([{location:g(t),message:e}]);var v=class extends l{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},y=class extends l{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}};const b=`This was a Java StackOverflowError. It was probably the result
13
+ of an incorrect recursive function definition that caused TLC to enter
14
+ an infinite loop when trying to compute the function or its application
15
+ to an element in its putative domain.`;var x=class extends y{constructor(){super(b)}},ee=class extends y{state;action;variables;constructor(e,t,n,r){super(e),this.state=t,this.action=n,this.variables=r}},te=class extends y{variable;constructor(e,t){super(e),this.variable=t}},S=class extends y{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},ne=class extends y{state;constructor(e){super(`current state is not a legal state`),this.name=`TlaEvaluationError`,this.state=e}},re=class extends l{failure;exception;constructor(e,t={}){super(e),this.name=`TlaProofError`,this.failure=t.exception===void 0?t.failure??e:void 0,this.exception=t.exception??`Failure(${JSON.stringify(this.failure)})`}},ie=class extends re{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},C=class extends l{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}},ae=class extends C{unwound;constructor(e,t){super(e),this.name=`TlaJavaException`,this.unwound=t}};const oe=t=>r(t)??(t instanceof u?e.specParseError:t instanceof v?e.configParseError:t instanceof y?e.specEvaluationFailure:e.error);var se=class extends l{node;constructor(e,t){super(e),this.name=`PcalError`,this.node=t}},w=class extends l{constructor(e){super(e),this.name=`PcalRuntimeError`}},T=class extends l{constructor(e){super(`You have discovered a bug in pcal.trans.\nSend the following information and the\ninput file to the current maintainer(s).\n\n -- ${e}.`),this.name=`PcalBugError`}};const E=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),D=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),ce=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),le=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),ue=/* @__PURE__ */ new Map([[`∧`,`/\\`],[`∨`,`\\/`],[`¬`,`~`],[`⇒`,`=>`],[`⟹`,`=>`],[`≡`,`<=>`],[`⇔`,`<=>`],[`∈`,`\\in`],[`∉`,`\\notin`],[`⊆`,`\\subseteq`],[`⊂`,`\\subset`],[`⊇`,`\\supseteq`],[`⊃`,`\\supset`],[`∪`,`\\cup`],[`∩`,`\\cap`],[`×`,`\\X`],[`∀`,`\\A`],[`∃`,`\\E`],[`≠`,`#`],[`≤`,`<=`],[`≥`,`>=`],[`↦`,`|->`],[`→`,`->`],[`⟨`,`<<`],[`⟩`,`>>`],[`□`,`[]`],[`◇`,`<>`],[`≜`,`==`],[`′`,`'`],[`∘`,`\\o`],[`⋅`,`\\cdot`]]),de=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,fe=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),pe=e=>e.startsWith(`\\`)?parseInt(e.slice(2),fe.get(e[1].toLowerCase())):Number(e),me=/-{4,}[ \t]*MODULE\b/,he=e=>/[A-Za-z0-9_]/.test(e),O=(e,t)=>{let n=e[t];if(n===`\\`&&/[A-Za-z]/.test(e[t+1]??``)){let n=/^[A-Za-z]+/.exec(e.slice(t+1))?.[0]??``,r={value:n.length};for(;r.value>0&&!D.has(n.slice(0,r.value));)r.value--;let i=D.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=ue.get(n);if(r)return{text:r,length:n.length};let i=le.find(n=>e.startsWith(n,t));return i?{text:ce.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},ge=e=>e!==void 0&&e>=`0`&&e<=`9`,_e=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},ve=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:_e(e,t+1,ge);if(n===t+1||e[n]!==`>`)return 0;let r=_e(e,n+1,he),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return _e(e,i?r+1:r,e=>e===`.`)-t},ye=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,be=(e,t)=>t===` `?e+8-e%8:e+1,xe=e=>{let t=me.exec(e);if(!t)throw new u(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
16
+ `),a={index:t.index,line:i.length,lineStart:t.index-i[i.length-1].length,moduleDepth:0},o={lineStart:-1,position:0,width:0},s=()=>{for((o.lineStart!==a.lineStart||o.position>a.index)&&(o.lineStart=a.lineStart,o.position=a.lineStart,o.width=0);o.position<a.index;o.position++)o.width=be(o.width,e[o.position]);return be(o.width,e[a.index])},c=(e,t,r,i)=>{let o=s();n.push({kind:e,text:t,spelling:i,line:a.line,column:o,endColumn:o+r-1}),a.index+=r},l=t=>{for(let n=0;n<t;n++)e[a.index]===`
17
+ `&&(a.line++,a.lineStart=a.index+1),a.index++},d=t=>new u(`${t} at line ${a.line}, column ${s()}`,void 0,{reason:t,line:a.line,column:s(),isEnd:a.index>=e.length});for(;a.index<e.length;){let t=e[a.index];if(t===`
18
+ `||t===` `||t===` `||t===`\r`){l(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
19
+ `,a.index);l((t===-1?e.length:t)-a.index);continue}if(e.startsWith(`(*`,a.index)){let t={value:0};do{if(a.index>=e.length)throw d(`Unterminated comment`);e.startsWith(`(*`,a.index)?(t.value++,l(2)):e.startsWith(`*)`,a.index)?(t.value--,l(2)):l(1)}while(t.value>0);continue}if(e.startsWith(`----`,a.index)){let t=_e(e,a.index,e=>e===`-`)-a.index;e.slice(a.index+t).trimStart().startsWith(`MODULE`)&&a.moduleDepth++,c(`Separator`,`----`,t);continue}if(e.startsWith(`====`,a.index)){if(c(`ModuleEnd`,`====`,_e(e,a.index,e=>e===`=`)-a.index),a.moduleDepth--,a.moduleDepth<=0)break;continue}if(t===`"`){let t=a.line,r=s(),i=[];for(l(1);e[a.index]!==`"`;){if(a.index>=e.length||`
20
+ \r`.includes(e[a.index]))throw d(`Unterminated string`);if(e[a.index]===`\\`){let t=e[a.index+1];if(t===void 0||!`ntrf\\"`.includes(t))throw d(`Invalid escape in string`);i.push({n:`
21
+ `,t:` `,r:`\r`,f:`\f`}[t]??t),l(2)}else i.push(e[a.index]),l(1)}l(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=de.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(he(t)){let t=e.slice(a.index,_e(e,a.index,he));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(a.index))?.[0]??t;c(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}let n=/^(_|\d+)/.exec(t)?.[0];if(n!==void 0&&!/[A-Za-z]/.test(t)){c(n===`_`?`Operator`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){c(`Keyword`,t.slice(0,3),3);continue}let i=r.get(t)??t;r.set(i,i),c(E.has(t)?`Keyword`:`Identifier`,i,t.length);continue}let o=ve(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let u=O(e,a.index);if(u){let t=e.slice(a.index,a.index+u.length);c(`Operator`,u.text,u.length,t===u.text?void 0:t)}else throw d(`Unexpected character ${JSON.stringify(t)}`)}let f=s();return n.push({kind:`End`,text:``,line:a.line,column:f,endColumn:f}),n},Se=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],Ce=Se.map(e=>e[0]),we=new Map(Ce.map((e,t)=>[e,t]).reverse()),k=e=>{let t=we.get(e);if(t===void 0)throw new l(`Unknown SANY token kind ${e}`);return t},Te=new Map(Se.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),A=Math.max(...[...Te.keys()].map(e=>e.length)),Ee=Array.from({length:A},(e,t)=>A-t),De=/----+ *MODULE/y,Oe=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],ke=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),Ae=ke(String.raw`\.\/\\`),je=ke(String.raw`\.\\\/`),Me=String.raw`<(?:[0-9]+|\+|\*)>`,Ne=[[`_BM0`,[De]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,Ae],[`BOR`,je],[`IDENTIFIER`,Oe],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Me}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Me,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Me}(?:\*\.*|-\.*|\.+)`,`y`)]]],Pe=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[De]]],Fe=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[De]],[`BAND`,Ae],[`BOR`,je],[`IDENTIFIER`,Oe]],Ie=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Le=(e,t,n)=>e.map(([e,r])=>({kind:k(e),length:Math.max(...r.map(e=>Ie(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),j=(e,t)=>{let n=Ee.find(n=>Te.has(e.slice(t,t+n))),r=Le(Ne,e,t);if(n===void 0)return r;let i={kind:Te.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},Re=e=>e+8-e%8,ze=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
22
+ `?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
23
+ `?r.isAfterLf=!0:i===` `&&(r.column=Re(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},Be=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Ve=new Set([...Te.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),He=(e,t)=>{let n=0;for(;Ve.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,Ie(Be,e,t)))},Ue=e=>{let t=ze(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(k(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?Ke(o,s,e[a],i):t.lines[n]===o?e[a]===`
24
+ `||e[a]===`\r`?Ke(o+1,0,void 0,i):Ke(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=Le(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,Ce[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),Ce[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(Pe);if(n.mode===`PRAGMA`)return s(Fe);for(;n.offset<e.length;){let t=n.offset;if(`
25
+ \r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=j(e,t);if(i.length===0){let n=He(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},We=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
26
+ `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Ge=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>We.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Ke=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Ge(n)}" (${n.charCodeAt(0)}), `}after : "${Ge(r)}"`,qe=e=>{let t=Ue(e);for(let e=t();typeof e!=`string`&&e.kind!==k(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?Re(e):e+1,e.beginColumn);return Ke(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Je=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],Ye=/* @__PURE__ */ new Set([...Je,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),Xe=[`TYPE`,`TYPE_CONSTRAINT`],Ze=/* @__PURE__ */ new Set([...Je,...Xe]),Qe=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],$e=e=>{let t=[],n={index:0,line:1,lineStart:0},r=(r,i)=>{t.push({kind:`Error`,text:Ke(n.line,r-n.lineStart+1,e[r],i),line:n.line})},i=e=>{t.push({kind:`Error`,text:Ke(n.line+1,0,void 0,e),line:n.line})},a=e=>{let t=e.split(`
27
+ `);t.length>1&&(n.line+=t.length-1,n.lineStart=n.index+e.length-t[t.length-1].length),n.index+=e.length};for(;n.index<e.length;){let o=e.slice(n.index),s=/^\s+/.exec(o)?.[0];if(s){a(s);continue}if(o.startsWith(`\\*`)){let e=o.indexOf(`
28
+ `);a(e===-1?o:o.slice(0,e));continue}if(o.startsWith(`(*`)){let e=o.indexOf(`*)`);if(e===-1)return a(o),i(``),t;a(o.slice(0,e+2));continue}let c=n.line,l=/^\d+(?![A-Za-z_])/.exec(o)?.[0];if(l){t.push({kind:`Number`,text:l,line:c}),a(l);continue}let u=/^[A-Za-z0-9_]+/.exec(o)?.[0];if(u){t.push({kind:`Word`,text:u,line:c}),a(u);continue}if(o.startsWith(`"`)){let s=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(o),l=s?.[0]??`"`;if(s?.[2]!==`"`)return a(l),n.index===e.length?i(`${l}\n`):r(n.index,l),t;t.push({kind:`String`,text:s[1],line:c}),a(l);continue}let d=Qe.find(e=>o.startsWith(e));if(d){t.push({kind:`Symbol`,text:d,line:c}),a(d);continue}let f=O(e,n.index);if(!f)return r(n.index,``),t;t.push({kind:`Word`,text:f.text,line:c}),a(e.slice(n.index,n.index+f.length))}return t.push({kind:`End`,text:``,line:n.line}),t},et=(e,t)=>new v(`TLC found an error in the configuration file at line ${e}\n${t}`),tt=(e,t)=>et(e,`The keyword ${t} appeared twice.`),nt=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),rt=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),it=(e,t=`master`)=>{let n=t===`1.7.4`?Ze:Ye,r=$e(e),i={index:0},a={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},o={isSet:!1},s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i.index++,r.length-1)];if(e.kind===`Error`)throw new v(`TLC found an error in the configuration file:\n${e.text}`);return e},l=e=>{if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t={token:c()};if(t.token.text!==`}`)for(;e.push(l(t.token)),t.token=c(),t.token.text===`,`;)t.token=c();if(t.token.text!==`}`)throw et(t.token.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw et(e.line,`It was expecting a value, but did not find it.`)},u=e=>{let t=c();if(t.kind===`End`)throw et(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw et(n.line,`It was expecting ], but did not find it.`);return t.text},d=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let r={token:c(),name:t.text};for(;r.token.text===`!`;)r.name=`${r.name}!${c().text}`,r.token=c();let i=r.name;if(r.token.text===`<-`){if(r.token=c(),r.token.text===`[`){let e=u(`<-`),t=c();if(t.kind===`End`)throw et(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:i,target:t.text,module:e});continue}if(r.token.kind===`End`)throw et(r.token.line,`Expected an identifier after <-.`);a.substitutions.push({name:i,target:r.token.text});continue}let o=[],s=r.token.text===`(`;if(s){for(;o.push(l(c())),r.token=c(),r.token.text===`,`;);if(r.token.text!==`)`)throw et(e,``);r.token=c()}if(r.token.text!==`=`)throw et(r.token.line,`It was expecting = or <-, but did not find it.`);r.token=c();let d=r.token.text===`[`?u(`=`):void 0,f=l(d===void 0?r.token:c());a.constants.push({name:i,value:f,...s&&{args:o},...d!==void 0&&{module:d}})}},f=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},p={token:c()};for(;p.token.kind!==`End`;){let e=p.token.text,t=p.token.line,r=n.has(e)?nt.get(e):void 0,i=n.has(e)?rt.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw et(t,`The keyword ${e} was not followed by an identifier.`);return n};if(r!==void 0){let n=l();if(a[r]!==void 0)throw tt(t,e);a[r]=n.text,p.token=c()}else if(i!==void 0)p.token=f(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)p.token=d(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw et(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o.isSet)throw tt(t,e);o.isSet=!0,a.checkDeadlock=n.text===`TRUE`,p.token=c()}else{if(!n.has(e)||!Xe.includes(e))throw et(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw tt(t,e);s.add(e),p.token=c()}}return a},M={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},at=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},ot=e=>e!==void 0&&/^\p{Nd}$/u.test(e),st=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),ct=e=>{let t=t=>{let n=_e(e,t,at);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=_e(e,t,ot);if(e.startsWith(`..`,n)&&ot(e[n+2]))return{kind:`Constant`,first:t,last:_e(e,n+2,ot)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=ot(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:_e(e,t+1,ot)-1,children:[]};if(st(n))return{kind:`Constant`,first:t,last:_e(e,t,st)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},N=e=>{let t=e.length===0?void 0:ct(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=M[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},P=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,lt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),F=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),I=e=>typeof e==`object`&&e.kind===`ModelValue`,ut=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:P(e)?`set`:`function`,dt=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new S(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ft={isUsed:!1},pt=(e,t)=>(ft.isUsed=!0,e.writtenKeys=t,e),mt=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[yr(e.domain,t)]]),ht=(e,t,n)=>pt(Zt(e,t),n),gt=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(gt);e.writtenKeys=void 0,e.range.forEach(gt)}},_t=e=>e.every(e=>typeof e==`string`),vt=(e,t)=>e.length>0&&t.length>0&&_t(e)!==_t(t),yt=(e,t)=>{ft.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return vt(n,r)?yn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=It(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=It(i[e],a[e]);if(t!==0)return t}return 0},bt=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=It(n[e],r[e]);if(t!==0)return t}return 0},xt=e=>I(e)?e.type:void 0,St=(e,t,n)=>{let r=xt(e),i=xt(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(I(e)&&I(t)){if(r===void 0||i===void 0||r===i)return;throw new y(`Attempted to ${a} the differently-typed model values ${z(e)} and ${z(t)}`)}throw r===void 0?new y(`Attempted to ${a} the typed model value ${z(t)} and the non-model value\n${z(e)}`):new y(`Attempted to ${a}${n?``:` the`} typed model value ${z(e)} and non-model value\n${z(t)}`)},Ct={ranks:Object.create(null),size:0},wt=e=>{Ct.ranks=Object.create(null),Ct.size=0,Lt.clear();for(let t of e)Dt(t)},Tt={is174:!1},Et=e=>{Tt.is174=e===`1.7.4`},Dt=e=>(Ct.ranks[e]===void 0&&(Ct.ranks[e]=Ct.size++),e),Ot=()=>Ct.size,kt=e=>Ct.ranks[Dt(e)],At=(e,t)=>{if(e===t)return 0;let n=Ct.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},jt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Mt=(e,t)=>(jt(e)||jt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Nt=(e,t,n)=>{if(!jt(e))throw new y(`Attempted to ${n} the set ${z(L(e)?R(e):e,!0)} with the value:\n${z(t,!0)}`);if(!jt(t))throw new y(`Attempted to compare overridden value ${z(e,!0)} with non-overridden value:\n${z(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new y(`Attempted to compare ${z(e,!0)} with the value\n${z(t,!0)}`)},Pt={kind:`InfiniteSet`,name:`Any`},Ft=e=>{throw new y(`Attempted to compare ANY with the value\n${z(e)}`)},It=(e,t)=>{if(e===t)return ft.isUsed&&gt(e),e===Pt?Ft(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return yt(e,t);if(n===`Set`&&r===`Set`)return bt(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&St(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return St(e,t,!1),n===`ModelValue`?-1:1;if(e===Pt||t===Pt)return Ft(e===Pt?t:e);if(P(e)&&P(t)&&Mt(e,t))return Nt(e,t,`compare`);let i=P(e);if(i!==P(t))throw new y(`Attempted to compare ${ut(e)} ${z(e)} with ${ut(t)} ${z(t)}`);return i?bt(R(e),R(t)):yt(Dr(e),Dr(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return At(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(St(e,t,!1),I(e))return-1;if(I(t))return 1;throw new y(`Attempted to compare ${ut(e)} ${z(e)} with ${ut(t)} ${z(t)}`)},Lt=/* @__PURE__ */ new Map,Rt=e=>{let t=Lt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:kt(e)};return Lt.set(e,n),n},zt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),Bt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0}),Vt={isPresent:!1},Ht=(e,t)=>(t===`lambda`&&(Vt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Ut=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Wt=e=>Ht(e,`lambda`),Gt=/* @__PURE__ */ new WeakSet,Kt=/* @__PURE__ */ new WeakSet,qt={isPresent:!1},Jt=e=>(qt.isPresent=!0,e),Yt=e=>{qt.isPresent&&typeof e==`object`&&Kt.add(e)},Xt=e=>{!Vt.isPresent&&!qt.isPresent||typeof e!=`object`||Gt.has(e)||(Gt.add(e),e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Xt),e.range.forEach(Xt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Xt):P(e)&&L(e)&&(Yt(e),R(e).elements.forEach(Xt)))},Zt=(e,t)=>Ht(Bt(e,t),`record`),Qt=(e,t)=>{if(Yt(e),e===t)return ft.isUsed&&gt(e),e!==Pt||Ft(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&St(e,t,!0),It(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return yt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return bt(e,t)===0;if(I(e)||I(t))return St(e,t,!0),I(e)&&I(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Qt(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=pr(e.domain),r=pr(t.domain);if(n||r)return n===r;let i=pr(e.range),a=pr(t.range);return i||a?i===a:Qt(e.domain,t.domain)&&Qt(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(pr(e))return pr(t);if(pr(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&Qt(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return pr(e)?pr(t):!pr(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Qt(e,t.factors[n]));let n=P(e)&&P(t)&&!(L(e)&&L(t));if(n&&Mt(e,t))return Nt(e,t,`check equality of`)===0;if(n){if(!jt(e)){let n=R(e);if(!jt(t))return bt(n,R(t))===0}return ri(e)===ri(t)}return It(e,t)===0},$t=e=>{let t=(e,t)=>e===t||e.length===t.length&&e.every((e,r)=>n(e,t[r])),n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):ri(n)===ri(r);return n},en=$t(!1),tn=$t(!0),nn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},rn=e=>{if(!F(e))return;let t=Dr(e);return{domain:t.domain,range:t.range,low:nn(t.domain)}},an=e=>{if(!F(e))return;let t=Dr(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},on=(e,t)=>{if(xt(e)!==void 0)throw new y(`Attempted to compare the typed model value ${z(e)} and the non-model value\n${z(t)}`);return 1},sn=(e,t)=>{if(xt(e)!==void 0)throw new y(`Attempted to check equality of the typed model value ${z(e)} and the non-model value\n${z(t)}`);return!1},cn=(e,t)=>{let n=xt(e);if(n===void 0)return I(t)?e.rank-t.rank:-1;if(!I(t))throw new y(`Attempted to compare the typed model value ${z(e)} and non-model value\n${z(t)}`);let r=xt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to compare the differently-typed model values ${z(e)} and ${z(t)}`);return e.rank-t.rank},ln=(e,t)=>{let n=xt(e);if(n===void 0)return I(t)&&e.name===t.name;if(!I(t))throw new y(`Attempted to check equality of typed model value ${z(e)} and non-model value\n${z(t)}`);let r=xt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to check equality of the differently-typed model values ${z(e)} and ${z(t)}`);return e.name===t.name},un={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},dn=(e,t,n)=>{let r=un[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${z(e)} with ${r.other}:\n${z(t)}`},fn=(e,t,n)=>{let r=rn(n);if(!r){if(I(n))return on(n,t);throw new y(`Attempted to compare the function ${z(t)} with the value:\n${z(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>pn(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return pn(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new y(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${z(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},pn=(e,t)=>{for(let n=0;n<e.length;n++){let r=yn(e[n],t[n]);if(r!==0)return r}return 0},mn=(e,t)=>{let n=Dr(e);if(e.kind===`Function`&&br(n)!==void 0){let r=F(t)?br(t):void 0;return r?n.range.length-r.length||pn(n.range,r):fn({...n,low:1},e,t)}if(Ut(e)===`record`){let r=an(t);if(!r){if(I(t))return on(t,e);throw new y(`Attempted to compare record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length-r.domain.length||pn(n.domain,r.domain)||pn(n.range,r.range)}return fn({...n,low:nn(n.domain)},e,t)},hn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),gn=(e,t)=>jt(e)||jt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),_n=(e,t)=>{let n=hn(t)?t:R(t);return{elements:R(e).elements,otherElements:R(n).elements}},vn=(e,t)=>{if(gn(e,t))return It(e,t);if(!hn(e))return vn(R(e),t);if(!P(t)){if(I(t))return on(t,e);throw new y(`Attempted to compare the set ${z(e)} with the value:\n${z(t)}`)}let n=_n(e,t);return n.elements.length-n.otherElements.length||pn(n.elements,n.otherElements)},yn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return It(e,t);if(I(t))return on(t,e);throw new y(dn(e,t,!1))}return e.kind===`ModelValue`?cn(e,t):F(e)?mn(e,t):vn(e,t)},bn=(e,t)=>e.every((e,n)=>wn(e,t[n])),xn=(e,t,n)=>{let r=rn(n);if(!r){if(I(n))return sn(n,t);throw new y(`Attempted to check equality of the function ${z(t)} with the value:\n${z(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&bn(e.range,r.range);let i=e.low??r.low;return i===void 0?bn(e.domain,r.domain)&&bn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new y(`Attempted to compare an integer with non-integer:\n${z(e)}.`);return e===i+t})&&bn(e.range,r.range)},Sn=(e,t)=>{let n=Dr(e);if(e.kind===`Function`&&br(n)!==void 0){let r=F(t)?br(t):void 0;return r?n.range.length===r.length&&bn(n.range,r):xn({...n,low:1},e,t)}if(Ut(e)===`record`){let r=an(t);if(!r){if(I(t))return sn(t,e);throw new y(`Attempted to check equality of record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length===r.domain.length&&bn(n.domain,r.domain)&&bn(n.range,r.range)}return xn({...n,low:nn(n.domain)},e,t)},Cn=(e,t)=>{if(gn(e,t))return Qt(e,t);if(!hn(e))return Cn(R(e),t);if(!P(t)){if(I(t))return sn(t,e);throw new y(`Attempted to check equality of the set ${z(e)} with the value:\n${z(t)}`)}let n=_n(e,t);return n.elements.length===n.otherElements.length&&bn(n.elements,n.otherElements)},wn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(I(t))return sn(t,e);throw new y(dn(e,t,!0))}return e.kind===`ModelValue`?ln(e,t):F(e)?Sn(e,t):Cn(e,t)},Tn=e=>{let t=[];for(let n of e){let e=Dn(n,t);e.isFound||t.splice(e.index,0,n)}return t},En=(e,t)=>{let n=Sr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Dn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=En(e,()=>yn(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},On=(e,t)=>t.some(t=>En(t,()=>wn(t,e))),kn=/* @__PURE__ */ new WeakSet,An=e=>{typeof e==`object`&&(e.kind===`Set`&&(kn.add(e),e.elements.forEach(An)),e.kind===`Function`&&(e.domain.forEach(An),e.range.forEach(An)))},jn=(e,t)=>Cr(()=>Qt(e,t),()=>wn(e,t)),Mn=e=>{for(let t=1;t<e.length;t++)if(It(e[t-1],e[t])>=0)return!1;return!0},Nn=e=>{for(let t=1;t<e.length;t++)Yt(e[t]);if(e.length<2||Mn(e))return zt(e);let t=[...e].sort(It),n=[t[0]];for(let e=1;e<t.length;e++)It(n[n.length-1],t[e])!==0&&n.push(t[e]);return zt(n)},Pn=e=>Cr(()=>Nn(e),()=>({kind:`MixedSet`,elements:e})),Fn=zt([]),In=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&It(r[a],t)<0;)a++;a<r.length&&It(r[a],t)===0||i.push(t)}return i.length===n.length?e:zt(i)},Ln=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&It(r[a],t)<0;)a++;a<r.length&&It(r[a],t)===0&&i.push(t)}return i.length===n.length?e:zt(i)},Rn=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=It(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=zt(i);if(e.hash!==0&&e.hash!==Ur){let t=e.hash,n=0;for(;n<a.length;n++){let e=Jr(a[n]);if(e===Ur)break;t=t+Vr(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Qr(a[e])|0;c.fingerprint=t}return c},zn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>It(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&It(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Bt(n,r)},Bn=e=>{let t=zn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:pt(t,e.map(e=>e[0]))},Vn=[],Hn=[],Un=/* @__PURE__ */ new WeakMap,Wn=e=>{let t=Vn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Vn[e]=n,n},Gn=e=>{if(gr(e),e.low===1&&e.high>=1)return Wn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Kn=e=>e.length>0&&(e===Vn[e.length]||Un.has(e)),qn=e=>{let t=R(e).elements;return Kn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Jn=e=>{let t=Hn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Hn[e]=n,n},Yn=e=>Ht(Bt(Wn(e.length),e),`tuple`),Xn=e=>Ht(zn(e),`record`),Zn=e=>P(e)&&!jt(e),Qn=(e,t=!1)=>`UNION(${z(e.base,t)})`,$n=(e,t=e=>R(e).elements)=>{if(!Zn(e.base))throw new y(`Attempted to enumerate the nonenumerable set:\n${Qn(e)}`);return t(e.base)},er=(e,t,n)=>{if(Zn(e))return e;throw new y(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${z(e)}\nwhen enumerating:\n${Qn(n)}`)},L=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return L(e.base);case`FunctionSet`:return L(e.domain)&&L(e.range)||tr(e.domain)===!0||tr(e)===!0;case`RecordSet`:return e.sets.every(L)||tr(e)===!0;case`ProductSet`:return e.factors.every(L)||tr(e)===!0;case`Union`:return L(e.base)&&lr(e.base).every(L);case`SetOperation`:return e.operator===`\\cup`?L(e.left)&&L(e.right):e.operator===`\\cap`?L(e.left)||L(e.right):L(e.left);default:return!1}},tr=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=tr(e.domain);return t===void 0?void 0:!t&&tr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=tr(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return L(e)?R(e).elements.length===0:void 0;default:return}},nr=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},rr=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},ir=e=>{if(typeof e!=`object`||e.kind!==`Subset`||jt(e.base))return;let t=R(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:rr(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return zt(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},ar=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(zt(r.map(t=>e[t])));while(rr(r,e.length))}return t},or=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(jt(a))throw new y(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},sr=(e,t=e=>R(e).elements)=>{if(typeof e!=`object`)throw new y(`Expected a set but found ${z(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Tn(e.elements);case`Interval`:{let t=Gn(e);return t!==Vn[t.length]&&Un.set(t,e),t}case`Subset`:{if(gr(e.base)===0)return ar([]);if(!P(e.base))throw new y(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${N(z(e.base))}`);let t=R(e.base).elements;if(t.length>30)throw new y(hr(e));return ar(t)}case`FunctionSet`:{if(!Tt.is174&&pr(e))return[];if(jt(e.domain))throw new y(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${z(e.domain)}\ncannot be enumerated.`);let n=qn(e.domain);if((n.length>0||Tt.is174)&&jt(e.range))throw new y(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${z(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return nr(n.map(()=>r)).map(e=>Bt(n,e))}case`RecordSet`:{if(!Tt.is174&&pr(e))return[];let n=or(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${z(t)}`);return nr(n).map(t=>Xn(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Tt.is174&&pr(e))return[];let n=or(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${z(e)}`);return nr(n).map(Yn)}case`FilteredSet`:if(!P(e.base)||jt(e.base))throw new y(`Attempted to enumerate { x \\in S : p(x) } when S:\n${z(e.base)}\nis not enumerable`);return R(e.base).elements.filter(e.test);case`Union`:{let t=$n(e).flatMap((t,n)=>R(er(t,n,e)).elements);return R(Pn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Zn(e.left)||!Zn(e.right)))throw new y(`Attempted to enumerate S \\cup T when S:\n${z(e.left)}\nand T:\n${z(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Zn(e.left)&&!Zn(e.right))throw new y(`Attempted to enumerate S \\cap T when neither S:\n${z(e.left)}\nnor T:\n${z(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Zn(e.left))throw new y(`Attempted to enumerate S \\ T when S:\n${z(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Rn(R(e.left),R(e.right)).elements;let t=e.operator===`\\`||Zn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return R(n).elements.filter(t=>wr(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to enumerate the non-enumerable set ${z(e)}`);default:throw new y(`Expected a set but found ${z(e)}`)}},cr=/* @__PURE__ */ new WeakMap,R=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return zt(sr(e));let t=typeof e==`object`?cr.get(e):void 0;if(t)return t;let n=Sr.sets;n?.push(e);let r=sr(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?zt(r):Nn(r);return typeof e==`object`&&cr.set(e,i),i},lr=e=>{if(typeof e!=`object`||Kt.has(e))return R(e).elements;let t=Sr.sets;t?.push(e);let n=fr(e);return t?.pop(),n},ur=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,dr=e=>typeof e!=`object`||Kt.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?dr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||dr(e.left)||dr(e.right):ur(e)?.some(dr)??!1,fr=e=>{if(e.kind===`Union`)return $n(e,lr).flatMap((t,n)=>lr(er(t,n,e)));if(e.kind===`FilteredSet`&&!jt(e.base))return lr(e.base).filter(e.test);if(ur(e)?.some(dr))return sr(e,lr);if(e.kind!==`SetOperation`)return R(e).elements;if(e.operator===`\\cup`)return!Zn(e.left)||!Zn(e.right)?R(e).elements:[...lr(e.left),...lr(e.right)];let t=e.operator===`\\`||Zn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Zn(n)?lr(n).filter(t=>wr(t,r)===(e.operator===`\\cap`)):R(e).elements},pr=e=>{if(typeof e!=`object`||!P(e))throw new y(`Shouldn't call isEmpty() on value ${z(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new y(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(pr);case`RecordSet`:return e.sets.some(pr);case`FunctionSet`:return!pr(e.domain)&&pr(e.range);case`Union`:return $n(e).every((t,n)=>pr(er(t,n,e)));default:return R(e).elements.length===0}},mr=(e,t,n)=>e.reduce((e,r)=>{let i=e*gr(r,t);if(i>2147483647)throw new y(n());return i},1),hr=e=>`Overflow when computing the number of elements in:\n${z(e)}`,gr=(e,t)=>{if(typeof e!=`object`)throw new y(`Attempted to compute the number of elements in the ${typeof e==`number`?`integer`:typeof e==`string`?`string`:`boolean`} ${z(e)}.`);switch(e.kind){case`ModelValue`:throw new y(`Attempted to compute the number of elements in the model value ${z(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return gr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new y(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to compute the number of elements in the overridden value ${z(e)}.`);case`Subset`:{let n=gr(e.base,t);if(n>=31)throw new y(hr(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(pr(e.domain))return 1;if(pr(e.range))return 0;if(gr(e.range,t)===1)return 1}let n=gr(e.domain,t),r=gr(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new y(hr(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&pr(e)?0:mr(e.sets,t,()=>hr(e));case`ProductSet`:return t!==`1.7.4`&&pr(e)?0:mr(e.factors,t,()=>`Overflow when computing the number of elements in ${z(e)}`);default:return Yt(e),R(e).elements.length}},_r=e=>`Attempted to check if the set ${z(e)}is finite.`,vr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new y(`Attempted to check if the ${ut(e)} ${z(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new y(`Attempted to check if the function:\n${z(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return vr(e.base)&&pr(e.base);case`Subset`:return vr(e.base);case`FunctionSet`:{let t=vr(e.domain);if(t&&pr(e.domain))return!0;let n=vr(e.range);return n&&pr(e.range)?!0:n&&(t||gr(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!vr(e))n.isAllFinite=!1;else if(pr(e))return!0;return n.isAllFinite}case`Union`:if(!Zn(e.base))throw new y(`Attempted to check if the nonenumerable set:\n${Qn(e)}\nis a finite set.`);return R(e.base).elements.every(vr);case`SetOperation`:if(e.operator===`\\cup`)return vr(e.left)&&vr(e.right);if(e.operator===`\\cap`){if(!vr(e.left)&&!vr(e.right))throw new y(_r(e));return!0}if(vr(e.left))return!0;if(!vr(e.right))throw new y(_r(e));return!1;case`FilteredSet`:if(!vr(e.base))throw new y(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${z(e.base)}\nis finite.`);return!0}},yr=(e,t,n=It)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},br=e=>{if(typeof e!=`object`||!F(e))return;let t=Dr(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},xr=(e,t)=>{let n=`Attempted to check if the value:\n${z(e)}\nis an element of the`;if(!F(t))return`${n} ${ut(t)} ${z(t)}`;let r=Ut(t);return r===`record`?`Attempted to check if element:\n${z(e)}\nis in the record:\n${z(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${z(t)}`},Sr={sets:void 0},Cr=(e,t)=>{let n=Sr.sets,r=Sr.callStack,i=n?.length??0,a=r&&{...r,length:r.expressions.length};try{return e()}catch(e){if(!(e instanceof y))throw e;return n&&(n.length=i),r&&a&&(r.expressions.length=a.length,r.isFrozen=a.isFrozen,r.fingerprint=a.fingerprint),t(e)}},wr=(e,t)=>{let n=Sr.sets;if(n===void 0)return Tr(e,t);n.push(t);let r=Tr(e,t);return n.pop(),r},Tr=(e,t)=>{if(!P(t))throw new y(xr(e,t));switch(t.kind){case`Set`:return Yt(e),Cr(()=>yr(t.elements,e)!==-1,()=>kn.has(t)?Dn(e,t.elements).isFound:On(e,t.elements));case`MixedSet`:return On(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!I(e))throw new y(`Attempted to check if the value:\n${z(e)}\nis in the integer interval ${z(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(I(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new y(`Attempted to check if the value:\n${z(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!P(e)||jt(e))throw new y(`Attempted to check if the non-enumerable value\n${N(z(e))}\nis element of\n${N(z(t))}`);return R(e).elements.every(e=>wr(e,t.base));case`FunctionSet`:{if(!F(e)){if(I(e))return!1;throw new y(`Attempted to check if \n${z(e)}\nwhich is not a TLC function value, is in the set of functions:\n${N(z(t))}`)}let n=Dr(e),r=nn(n.domain);return(r===void 0?jn(t.domain,zt(n.domain)):jn({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>wr(e,t.range))}case`RecordSet`:{let n=F(e)?Dr(e):void 0;if(!n||!_t(n.domain)){if(I(e))return!1;throw new y(`Attempted to check if non-record\n${z(e)}\nis in the set of records:\n${z(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=yr(n.domain,e);return i!==-1&&wr(n.range[i],t.sets[r])})}case`ProductSet`:{let n=F(e)?br(e):void 0;if(n===void 0){if(F(e)&&Dr(e).domain.every(e=>typeof e==`number`)||I(e))return!1;throw new y(`Attempted to check if non-tuple\n${z(e)}\nis in the set of tuples:\n${z(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>wr(e,t.factors[n]))}case`FilteredSet`:return wr(e,t.base)&&t.test(e);case`Union`:if(!Zn(t.base))throw new y(`Attempted to check if:\n ${z(e)}\nis an element of the non-enumerable set:\n ${Qn(t)}`);return R(t.base).elements.some(t=>wr(e,t));case`SetOperation`:return t.operator===`\\cup`?wr(e,t.left)||wr(e,t.right):wr(e,t.left)&&wr(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=br(e);if(n===void 0){if(I(e))return!1;throw new y(`Attempted to check if the value:\n${N(z(e))}\nis an element of ${N(z(t))}.`)}return n.every(e=>wr(e,t.base))}default:throw new y(xr(e,t))}},Er=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?wr(e,n):e.range.every((e,r)=>Er(e,t.range[r],n.range)),Dr=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){L(e.domain)||gr(e.domain);let t=qn(e.domain);return Ht(Bt(t,t.map(t=>e.apply(t))),Ut(e))}throw new y(`Expected a function but found ${z(e)}`)},Or=(e,t,n)=>{let r=N(z(e)),i=N(z(t)),a=n===`1.7.4`;switch(Ut(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},kr=(e,t)=>{if(!Tt.is174)return Or(e,t);let n=N(z(t));return Ut(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Ar=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}if(e.length<=8){for(let n=0;n<e.length;n++)if(e[n]===t)return n}return yr(e,t)},jr=e=>new y(`Attempted to apply function with integer domain to the non-integer argument ${N(z(e))}`),Mr=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Ut(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new y(n(e,t));if(a===void 0&&!Tt.is174&&Kn(r))throw jr(t)}return Cr(()=>Ar(r,t),e=>{throw Tt.is174||r.length<32?r.forEach(e=>wn(e,t)):yr(r,t,yn),e})},Nr=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!wr(t,e.domain))throw new y(Ut(e)===`lambda`?Or(e,t):`Attempted to apply a function to ${z(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new y(`Attempted to apply ${z(e)}, which is not a function`);let r=n??Or,i=Mr(e,t,r);if(i===-1)throw new y(r(e,t));return e.range[i]},Pr=e=>Kn(e)?Un.get(e)??Jn(e.length):void 0,Fr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=Dr(e).domain;return Pr(t)??zt(t)},Ir=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!L(e.domain))){if(!wr(t,e.domain))return e;let r=n(e.apply(t));return Ht({kind:`LazyFunction`,domain:e.domain,apply:n=>jn(t,n)?r:e.apply(n),source:e.source},Ut(e))}if(!F(e))throw new y(`Attempted to apply EXCEPT construct to the value ${N(z(e))}.`);let i=Dr(e),a=Mr(i,t,kr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Ht(Bt(i.domain,o),Ut(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Ur){let e=Jr(c);if(e!==Ur){let t=Jr(i.domain[a]);l.hash=s===c?i.hash:i.hash-Hr(t,Jr(s))+Hr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-$r(e,s)+$r(e,c)|0}return l},Lr=/* @__PURE__ */ new WeakMap,Rr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},zr=(e,t)=>Math.imul(e^t,16777619),Br=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Rr(t)},Vr=e=>Rr(e+2654435769|0),Hr=(e,t)=>Rr(Math.imul(e,668265261)+t|0),Ur=795548749,Wr=e=>{if(e.kind===`ModelValue`)return Rr(zr(Br(e.name),109));if(P(e)){if(!L(e))return Ur;let t=R(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Jr(t[e]);if(r===Ur)return Ur;n=n+Vr(r)|0}return n}if(e.kind===`LazyFunction`&&!L(e.domain))return Ur;let t=Dr(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=Jr(t.domain[e]),i=Jr(t.range[e]);if(r===Ur||i===Ur)return Ur;n=n+Hr(r,i)|0}return n},Gr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new y(`TLC has found a state in which the value of a variable contains ${z(e)}`);if(P(e)){R(e).elements.forEach(Gr);return}let t=Dr(e);t.domain.forEach(Gr),t.range.forEach(Gr)},Kr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Jr(e)===Ur&&Gr(e);return}catch(e){if(!(e instanceof y))throw e;return e}},qr=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Jr=e=>{if(typeof e==`number`)return Rr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Br(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Wr(e)),e.hash;let t=Lr.get(e);if(t!==void 0)return t;let n=Wr(e);return Lr.set(e,n),n},Yr=/* @__PURE__ */ new WeakMap,Xr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Zr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Xr(t)},Qr=e=>Xr(ti(e)+2135587861|0),$r=(e,t)=>Xr(Math.imul(ti(e),374761393)+ti(t)|0),ei=e=>{if(e.kind===`ModelValue`)return Xr(Zr(e.name)^60);if(P(e)){if(!L(e))return Zr(ri(e));let t=R(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Qr(t[e])|0;return n}let t=Dr(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+$r(t.domain[e],t.range[e])|0;return n},ti=e=>{if(typeof e==`number`)return Xr(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return Zr(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=ei(e)),e.fingerprint;let t=Yr.get(e);if(t!==void 0)return t;let n=ei(e);return Yr.set(e,n),n},ni=/* @__PURE__ */ new WeakMap,ri=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=ni.get(e);if(t!==void 0)return t;let n=ii(e);return ni.set(e,n),n},ii=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ri(e.base)}>`;if(e.kind===`FilteredSet`&&!L(e))throw new y(`Attempted to compare the non-enumerable set ${z(e)} with another value`);if(P(e))return L(e)?`{${R(e).elements.map(ri).join(`,`)}}`:`<${e.kind} ${z(e)}>`;let t=Dr(e);return`(${t.domain.map((e,n)=>`${ri(e)}:${ri(t.range[n])}`).join(`,`)})`},ai=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,oi=e=>e.reduce((e,t)=>e===0?0:e*gr(t),1),si=e=>{if(e.kind===`Subset`)return gr(e.base)<=6?R(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return R(e);if(e.kind===`FunctionSet`&&L(e.domain)&&gr(e.domain)===0)return zt([Bt([],[])]);let t=e.kind===`FunctionSet`?gr(e.range)**gr(e.domain):oi(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Fn:t<=1999?R(e):void 0},ci=(e,t)=>{if(t)return si(e);if(L(e))try{return si(e)}catch(e){if(e instanceof y)return;throw e}},li=(e,t)=>{let n=e=>z(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return Qn(e,t)}},ui=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),di=e=>{if(L(e.domain))try{return Dr(e)}catch(e){if(e instanceof y)return;throw e}},z=(e,t=!1,n=!1)=>{let r=e=>z(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return ai(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(R(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=ci(e,t);return n?r(n):li(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?di(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${z(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Tt.is174&&Ut(e)!==`tuple`)return`<< >>`;let a=r=>z(r,t,n&&Ut(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Ut(e)===`record`||i.domain.every(e=>typeof e==`string`&&ui(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):mt(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},fi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${N(z(n))}\n`).join(``)},pi=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},mi=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Jr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||tn(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||tn(i[e],n))return i[e]}return n.kind===`Set`?pi(n.elements,t):(pi(n.domain,t),pi(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},hi=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},B=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,gi=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),_i=(e,t)=>gi.has(e)?new y(t):new S(t),vi=e=>typeof e==`object`&&e.kind===`Operator`,V=(e,t,n)=>{let r=e[t];if(r===void 0||vi(r))throw _i(n,`${n} expects a value as argument ${t+1}`);return r},yi=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`number`)throw _i(n,`${n} expects an integer but received ${z(r)}`);return r},bi=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`boolean`)throw _i(n,`${n} expects a boolean but received ${z(r)}`);return r},xi=(e,t,n)=>{let r=V(e,t,n);if(!P(r))throw _i(n,`${n} expects a set but received ${z(r)}`);return r},Si=(e,t,n)=>{let r=xi(e,t,n);if(!L(r))throw _i(n,`${n} cannot enumerate the non-enumerable set ${z(r)}`);return r},Ci=(e,t,n)=>R(Si(e,t,n)),wi=(e,t,n)=>Ci(e,t,n).elements,Ti=(e,t,n)=>{let r=V(e,t,n),i=br(r);if(!i)throw _i(n,`${n} expects a sequence but received ${z(r)}`);return i},Ei=(e,t,n)=>{let r=V(e,t,n);if(!F(r))throw _i(n,`${n} expects a function but received ${z(r)}`);return Dr(r)},Di=(e,t,n)=>{let r=e[t];if(r===void 0||!vi(r))throw _i(n,`${n} expects an operator as argument ${t+1}`);return r},Oi=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),H=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),ki=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Ai=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ji=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(V(n,0,e),V(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Mi=e=>e>2147483647||e<-2147483648,Ni=e=>new S(`Overflow when computing ${e}`),Pi={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},Fi={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Ii={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},Li={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ri=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Fi[e.operator];if(e.kind!==`Function`)return Pi[e.kind];let t=Ut(e);return t===void 0?`FcnRcdValue`:Li[t]},zi=e=>Ii[Ri(e)],Bi=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Vi=(e,t)=>{let n=n=>(...r)=>{let i=Sr.sets?.length??0;try{return n(...r)}catch(n){throw n instanceof y&&(e.isLazy===!0||!(n instanceof S))?(Sr.sets&&(Sr.sets.length=i),Bi(t,n.message)):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Hi=(e,t)=>{if(typeof e!=`number`)throw Bi(t,`Cannot cast tlc2.value.impl.${Ri(e)} to tlc2.value.impl.IntValue`);return e},Ui=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Wi=(e,t,n,r)=>{let i=Ui(e,n,`IntValue`,2);return ji(t,(e,n)=>{let a=Hi(e,i),o=Hi(n,i),s=r(a,o);if(Mi(s))throw Ni(`${a}${t}${o}`);return s})},Gi=(e,t,n)=>{if(typeof e!=`number`)throw new S(`The ${t} argument of ${n} should be an integer, but instead it is:\n${z(e)}`);return e},Ki=(e,t,n=e)=>ji(e,(e,r)=>t(Gi(e,`first`,n),Gi(r,`second`,n))),qi=(e,t,n)=>({...Ai(e,t,n),isLazy:!0}),Ji=(e,t,n)=>{let r=Di(e,t,n);return()=>r.call([])},Yi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Xi=()=>({bool:fl,condition:(e,t)=>{if(typeof e!=`boolean`)throw Qc(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw $c(t,n,e);return e},apply:Nr,expectFunction:ll,tuple:Yn,set:Pn,record:Zt,writtenRecord:ht,equal:Qt,enumerate:Cl,unassigned:(e,t)=>{throw pd(e,t)},primeOutsideAction:e=>{throw hd(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:ul,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>sl(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Zi={value:void 0},Qi=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),$i=e=>`local${e.counter++}`,ea=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),hi(e).forEach(e=>ea(e,t)),t),ta=(e,t,n)=>{let r=Qi(e,Bu(t,e.environment)),i=ea(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Qi(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},na=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>$i(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${aa(e,t.set,s)}, ${Qi(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=$i(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${aa(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=$i(e),a=$i(e),o=$i(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},ra=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${aa(e,r[0],n)}, "the left side of =>") ? bool(${aa(e,r[1],n)}, "the right side of =>") : true)`;if(B(t))return ta(e,t,n);let i=Yl(t.operator,e.environment);if(i?.kind!==`Builtin`)return ta(e,t,n);if(i.name===`DOMAIN`)return`${Qi(e,nl(t))}(${aa(e,r[0],n)})`;if(i.name===`TLCEval`)return ta(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Qi(e,rl(t,i))}(${aa(e,r[0],n)}, ${aa(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&qu(r[0],a))return`${Qi(e,i.evaluateUnary)}(${aa(e,r[0],n)})`;let o=r.length===2&&qu(r[0],a)&&qu(r[1],a);return i.evaluateBinary&&o?`${Qi(e,i.evaluateBinary)}(${aa(e,r[0],n)}, ${aa(e,r[1],n)})`:ta(e,t,n)},ia=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(B(e))return!1;let r=au(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ia(e.expression,t,n);case`FieldAccess`:return ia(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ia(e,t,n));default:return!1}},aa=(e,t,n)=>{let r=(t,r=n)=>aa(e,t,r);if(ju(t)&&Eu(t,e.environment))return ta(e,t,n);switch(t.kind){case`Number`:return pu(t.value)?String(t.value):ta(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(B(t))return ta(e,t,n);let i=au(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Qi(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Qi(e,i.value):ta(e,t,n)}case`Apply`:return ra(e,t,n);case`And`:case`Or`:{let n=Qi(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Qi(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{sd(t.function);let i=`expectFunction(${ia(t.function,n,e.environment)?r(t.function):ta(e,t.function,{...n,context:`keepLazyContext(${n.context})`})}, ${Qi(e,t)})`,a=tl(e.environment.runtime.version),o=a?`, ${Qi(e,a)}`:``;return t.args.length===1?`apply(${i}, ${r(t.args[0])}${o})`:`apply(${i}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${o})`}case`FieldAccess`:return`${Qi(e,el(t))}(${r(t.record)})`;case`Record`:{let i=dd(t.fields);if(fd(i))return ta(e,t,n);let a=Qi(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Qi(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=Qi(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?na(e,t,n):ta(e,t,n);default:return ta(e,t,n)}},oa=(e,t)=>{if(!Yi.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=aa(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
29
+ `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;Zi.value??=Xi();let o=Zi.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},sa={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},ca={none:0,error:1,warning:3,state:4},la={0:``,1:`Error: `,3:`Warning: `,4:`State `},ua=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===ca.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
30
+ (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${la[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},da=`The configuration file did not specify the initial state predicate.
31
+ Can also be caused by trying to run TLC on a specification from
32
+ a module imported with a parameterized INSTANCE statement.`,fa=[[1005,b,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
33
+ %1%`,!0],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
34
+ %1%,
35
+ but it produced the following error:
36
+ %2%`,!1],[2148,`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable %1% occurring in the state formula v.
37
+ `,!1],[2155,`Attempted to compare %1% with the value
38
+ %2%`,!0],[2158,`Attempted to check if the value:
39
+ %1%
40
+ is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
41
+ the following value:
42
+ %1%`,!0],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
43
+ %4%`,!0],[2176,`Applying %1% to the following value,
44
+ which is not %2%:
45
+ %3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
46
+ element is not a bag:
47
+ %1%`,!0],[2178,`Overflow when computing %1%`,!1],[2179,`The second argument of \\div is 0.`,!0],[2180,`0^0 is undefined.`,!0],[2181,`Attempted to compute cardinality of the value
48
+ %1%`,!0],[2182,`Evaluating an expression of the form %1% when s is not a %2%:
49
+ %3%`,!0],[2183,`The %1% argument of %2% must be in the domain of its %3% argument:
50
+ %4%
51
+ , but instead it is
52
+ %5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
53
+ on the right-hand side of a <- after already appearing on the
54
+ left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
55
+ is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,da,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
56
+ %1%`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
57
+ %1%`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
58
+ but instead found %3%.
59
+ %4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
60
+ but didn't find one.
61
+ %3%`,!1],[2260,`In computing ENABLED, TLC encountered a temporal formula (%1%).
62
+ %2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
63
+ %2%`,!1],[2265,`TLC can't handle a number this big.
64
+ %1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
65
+ %4%`,!0],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
66
+ %2%`,!1],[2281,`The configuration file substitutes constant %1% with non-constant %2%%3%`,!1],[2283,`The argument of %1% should be a %2%, but instead it is:
67
+ %3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
68
+ The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
69
+ The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configuration file at line %1%
70
+ Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
71
+ It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
72
+ %1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
73
+ `,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]],pa={value:void 0},ma=()=>pa.value??=fa.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),ha=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,ga=e=>ha.test(e)?void 0:ma().find(t=>t.pattern.test(e))?.message,_a=e=>e instanceof S||ga(e.message)?.isEvalException===!0,va=/* @__PURE__ */ new Map([[1e3,`
74
+ : `],[2105,`failed.
75
+ `],[2154,`but it produced the following error:
76
+ `],[2213,`:
77
+ `],[2281,` - specifically: `]]),ya=(e,t,n)=>{let r=n?va.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${ba(t.slice(a),n)}`},ba=(e,t)=>{let n=t?ga(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${ca.none} @!@!@\n${ya(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},xa=e=>String(e).padStart(2,`0`),Sa=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${xa(r%24)}h`:e>36e5?`${xa(r%24)}h ${xa(n)}min`:e>6e4?`${xa(n)}min ${xa(t)}s`:`${xa(t)}s`},Ca=e=>`${e.getFullYear()}-${xa(e.getMonth()+1)}-${xa(e.getDate())} ${xa(e.getHours())}:${xa(e.getMinutes())}:${xa(e.getSeconds())}`,wa={kind:`Local`},Ta=/* @__PURE__ */ new WeakSet,Ea=/* @__PURE__ */ new WeakMap,Da=/* @__PURE__ */ new WeakMap,Oa=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ka=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),Aa=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,ja=e=>e.kind===`Operator`?e.params.length:0,Ma=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Na=e=>e.name.includes(`!`),Pa=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Fa=(e,t,n)=>{let r=t.bindings.get(e);return r&&Aa(r.position,t.location)&&(!n||Aa(r.position,n.start))?r:void 0},Ia=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),La=(e,t,n,r)=>{if(t===void 0)return!0;if(Ia(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=g(i),o=t.range&&g(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},Ra=(e,t,n,r)=>La(t,Pa(e,t)??Fa(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,za=(e,t,n)=>{La(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ba=(e,t,n,r)=>t.reduce((e,t,i)=>Ra(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Va=(e,t,n)=>t.reduce((e,t)=>Ra(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ha=e=>e.kind===`Name`?[e.name]:e.names,Ua=e=>e.flatMap(e=>Ha(e.pattern)),Wa=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Aa(n.location,t.location))?n:void 0},Ga=(e,t)=>{let n=Wa(e,t);return n?{key:t.getKey(n),arity:ja(n),params:Ma(n),kind:`Definition`}:t.imported.get(e)},Ka=(e,t,n)=>Pa(t,e)??Ga(e,n),qa=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Ja=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return Aa(e.location,e.args[0].location)?`prefix`:`postfix`}},Ya=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),Xa=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Za=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Qa=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},$a=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Qa(e.name,[],void 0):Qa(e.operator,e.args,e.argumentCounts),eo=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),to=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Ua(e.bounds),body:e.body,sets:eo(e.bounds)};case`SetMap`:return{names:Ua(e.bounds),body:e.expression,sets:eo(e.bounds)};case`SetFilter`:return{names:Ha(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ha(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},no=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},ro=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,io=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),ao=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?ao(e.body,t):hi(e).reduce((e,n)=>e??ao(n,t),void 0)},oo=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??oo(i,t,n||io(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&ao(e.set,t):ao(e,t)},so=e=>e.kind===`Label`?so(e.body):e,co=e=>typeof e==`number`?`argument selector ${e}`:e,lo=`within the scope of a declaration
78
+ from outside that declaration's scope.`,uo=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:g(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&so(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:oo(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?ao(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&io(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${lo}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=co(n.operand);if(l.isSufficesOpen){if(Za(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=so(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Ka(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=to(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:no(e);if(!c)return;let f=Za(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=Za(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(io(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${lo}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},fo=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:g(e.location.range),message:n}),!0)},po=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=g(r),a=e.params.filter((r,i)=>{let a=Pa(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:g(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},mo=(e,t,n,r)=>{if(!ro(e))return!1;let i=$a(e),a=i[0],o=i.length>1&&a.kind===`Name`?Pa(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&uo(e,i,o,t,n,r),o!==void 0},ho=(e,t,n,r)=>{let i=e.location;if(To(e,n,r))return;let a=Da.get(e);if(a!==void 0)return a;if(Oa(t)||mo(e,n,r,!1)||Xa(t))return e.kind===`Apply`?e.args.length:0;let o=Pa(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=wa),o)return o.arity;let s=Ga(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Da.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(Pa(n,c)!==void 0||Ga(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=g(qa(i,e.kind===`Apply`&&l===`-.`?`-`:l));if(!Ya(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=Ja(e);d&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},go=(e,t,n)=>(e.forEach(e=>U(e.set,t,n)),e.reduce((e,t)=>Ba(e,Ha(t.pattern),t.pattern.ranges,n),t)),_o=(e,t)=>e.kind===`Identifier`&&e.name===t&&B(e)||hi(e).some(e=>_o(e,t)),vo=(e,t)=>{e.kind===`FunctionConstruction`&&_o(e.body,t)&&(e.isRecursive=!0),hi(e).forEach(e=>vo(e,t))},yo=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Ua(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:g(o),message:e})},c=e.kind===`Function`?go(e.bounds,t,i):Va(t,e.params,i),l=Pa(c,a)??Fa(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(U(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),vo(e.body,a),e.isSelfReferential=_o(e.body,a)):U(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:La(a,Pa(t,a)??Fa(a,i,o),{kind:`Definition`,arity:ja(e),range:o},i)},bo=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Pa(e,t.name)?.isPending)return e;let n={name:t.name,arity:ja(t),params:Ma(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>jo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Oa(t.name)?e:s(e,e=>!Aa(t.location,e.location)),o={name:t.name,arity:ja(t),kind:`Definition`,range:t.location.range,parent:a};if(Na(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Oa(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return yo(t,a,u,i)?{...o,params:Ma(t)}:a},a),()=>!0)},xo=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Pa(t,r)??Fa(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},So=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=xo(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:g(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},Co=(e,t,n)=>{if(So(e,t,n))return;let r=e.operator,i=Ka(r,t,n),a=ho(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:g(e.argumentsRange??qa(e.location,r)),message:`The operator ${r} requires ${a-(xo(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>wo(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:g(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=ho(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else U(i,t,n);return!0}if(i.kind===`Lambda`){U(i,t,n);let o=i.params.length===c;return!o&&Ta.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??qa(e.location,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return U(i,t,n),!0;if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=Ka(u,t,n)?.params??[],f=ho(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(qa(i.location,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},wo=(e,t,n)=>{e.kind===`Identifier`?ho(e,e.name,t,n):U(e,t,n)},To=(e,t,n)=>{let r=Ea.get(e);return r?(r.args.forEach(e=>wo(e,t,n)),n.errors.push(r.error),!0):!1},U=(e,t,n)=>{if(Ta.has(e)&&!n.isGenerated){U(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>U(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(So(e,t,n))return;let r=e.name,i=ho(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:g(qa(e.location,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:ho(e,e.operator,t,n);return;case`Apply`:Co(e,t,n);return;case`Lambda`:U(e.body,Ba(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:U(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&U(e.other,t,n);return;case`Let`:U(e.body,bo(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:U(e.body,go(e.bounds,t,n),i(Ua(e.bounds)));return;case`UnboundedQuantifier`:U(e.body,Ba(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&U(e.set,t,n),U(e.body,Ba(t,Ha(e.pattern),e.pattern.ranges,n),i(Ha(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:U(e.predicate,go([e.bound],t,n),i(Ha(e.bound.pattern)));return;case`SetMap`:U(e.expression,go(e.bounds,t,n),i(Ua(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:g(r.location.range??qa(r.location,r.name)),message:`Non-unique fields in constructor.`}),U(r.value,t,n)});return;case`Except`:U(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),U(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:U(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(fo(e,n))return;U(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),po(e,t,n);return;case`Subexpression`:if(To(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>wo(e,t,n)),mo(e,t,n,!1)}},Eo=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||So(e,t,n)||mo(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;n.facts.has(r)||U(e,t,n)}),Do=(e,t,n)=>(e.set&&U(e.set,t,n),Ra(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Oo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Do(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Oo(t,e.scope,e.unit,!0):U(t,e.scope,e.unit),e),{scope:t,unit:n});return U(e.conclusion,i.scope,i.unit),i.scope},ko=(e,t,n)=>e.kind===`AssumeProve`?Oo(e,t,n):(U(e,t,n),t),Ao=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Eo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Mo(t,e,r),t)},jo=(e,t,n)=>{let r=Ro(e,t,n);return e.name===void 0?r:Ra(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Mo=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set};switch(r.kind){case`Assert`:{let a=ko(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Ao(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Ao(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return Eo(r.facts,t,n),t;case`Instance`:return jo(r,t,i);case`Define`:return r.definitions.reduce((e,t)=>t.kind===`Instance`?jo(t,e,i):bo([t],e,n),t);case`Have`:case`Case`:return U(r.expression,t,i),Ao(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>U(e,t,i)),t;case`Take`:return Ba(go(r.bounds,t,i),r.names,r.nameRanges,i);case`Pick`:{let a=Ba(go(r.bounds,t,i),r.names,r.nameRanges,i);return U(r.body,a,{...i,labelParams:[...i.labelParams,...Ua(r.bounds),...r.names]}),Ao(e.proof,t,n),a}default:return Ao(e.proof,t,n),t}},No=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:ko(e.statement,void 0,t);e.name!==void 0&&za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Ao(e.proof,n,t),r&&(r.isInProof=!1)},Po={line:0,column:0},Fo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Io=(e,t)=>{let n=new Map([...ka,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},Lo=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){U(n,a,i);return}let r=ho(n,n.name,a,i);if(r!==void 0&&r!==t.arity)throw new u(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},s=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:g(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;o(r,a);let c=a.location.range;s.has(n)?c&&i.errors.push({location:g(c),message:`Multiple substitutions for symbol '${n}' in substitution.`}):s.set(n,a)});let c=t.filter(e=>!s.has(e.name)),l=e=>!Pa(a,e.name)&&!Ga(e.name,i);return c.filter(e=>!l(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};o(t,n),s.set(t.name,n)}),c.filter(l).forEach(t=>{let r=e.location.range,a=t.location.range;r&&a&&i.errors.push({location:g(r),message:`Substitution missing for symbol ${t.name} declared at ${g(a)} \nand instantiated in module ${n}.`})}),s},Ro=(e,t,n)=>{let r=n.getInstance(e);return Lo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ra(e,t,r,n),t)},zo=(e,t,n,r)=>{let i=Io(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Lo(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:Po}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Bo=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>Aa(e.location,t.location)?-1:+!!Aa(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof u)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},Vo=(e,t)=>{let n=Io(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...ka,...t.bound].map(([e,t])=>[e,{...t,position:Po}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>za(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return Bo([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=La(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);Fo(e,t)?U(t.body,void 0,i):yo(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:ja(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);Va(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>za(t,e,i)),e.name!==void 0&&za(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);U(e.expression,void 0,r),e.name!==void 0&&za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>No(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Eo(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:g(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Ho=/* @__PURE__ */ new WeakSet,Uo=/* @__PURE__ */ new WeakSet,Wo=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Xo(e,(e,r)=>Wo(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&B(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&B(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Go=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Ko=/* @__PURE__ */ new WeakMap,qo=e=>Ko.get(e)??e.name,Jo=(e,t)=>(qo(t)!==e.name&&Ko.set(e,qo(t)),e),Yo=(e,t)=>Jo(e.kind===`Function`?{...e,bounds:Go(e.bounds,e=>t(e,[])),body:t(e.body,Ua(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Xo=(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=>Yo(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Go(e.bounds,n),body:t(e.body,Ua(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,Ha(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,Ha(e.bound.pattern))};case`SetMap`:return{...e,bounds:Go(e.bounds,n),expression:t(e.expression,Ua(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Zo=`LAMBDA`,Qo=(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 Xo(e,(e,n)=>(r.push(...Qo(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},$o=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}},es=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),ts=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},ns=(e,t)=>e.map(e=>({pattern:ts(e.pattern,t),set:e.set})),rs=(e,t)=>e.kind===`Function`?{...e,bounds:ns(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},is=(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=>Jo({...rs(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:ns(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:ts(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:ts(e.bound.pattern,n),set:e.bound.set}};default:return e}},as=e=>`${e}@ENABLED`,os=(e,t)=>e.modes.get(t)??e,ss=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!B(e)&&t.instantiation.variables.has(e.name),cs=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>cs(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(ss(e,t,n))return[e.name];let r=B(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?cs(r.body,t,/* @__PURE__ */ new Map):void 0},ls=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return ss(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:as(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:ms(e.expression,os(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[ms(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:ms(e.subscript,os(t,`Primed`),n),location:r},ms(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=cs(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:as(r),location:e.location},location:e.location},ms({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},us=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),ds=(e,t)=>e.map(e=>us(e.name,t)),fs=(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:[...ds(t,r),...i.map(e=>us(e,r))],location:r},location:r}},ps=(e,t)=>e.instantiation.isParameterized(t)?gs(e,t):void 0,ms=(e,t,n)=>{let r=e=>ms(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!B(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:ms(e.expression,os(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:ms(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},os(t,`Enabled`),n)};let s=ls(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Ho.add(n),n;let r=ps(t,e.name);if(r===void 0)return e;if(a.length===0)return{...e,name:r};let o=i.getDefinition(e.name);return o&&ja(o)>0?fs(r,a,ja(o),e.location):{kind:`Apply`,operator:r,args:ds(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||Uo.has(e),c=e=>(s&&Uo.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:Zo,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:Zo,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new u(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=ps(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...ds(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=ps(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?fs(n,a,ja(r),e.location):{...e,operator:n}}let c=$o(t),l=Xo(e,(e,i)=>i.length===0?r(e):ms(e,t,es(n,i,c)));return is(l,n,c)},hs=(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:us(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},gs=(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=$o(e),o=rs(Yo(i,(t,n)=>ms(t,e,es(/* @__PURE__ */ new Map,n,a))),a);return hs(o,r.params,i.location)}):t},_s=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Qo(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=>ps(i,e)??e,getQualifiedKey:t=>{let n=ps(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>hs(r,e.params,r.location)):t}}},vs=e=>e.kind===`Let`&&e.instances!==void 0||hi(e).some(vs),ys=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Xo(e,e=>ys(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Aa(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},bs=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,xs=(e,t)=>e.definitions.some(e=>vs(e.body))||e.assumptions.some(e=>vs(e.expression))||e.theorems.some(e=>{let t=bs(e);return t!==void 0&&vs(t)})?{...e,definitions:e.definitions.map(e=>Yo(e,e=>ys(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:ys(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=bs(e);return n===void 0?e:{...e,statement:ys(n,t,[])}})}:e,Ss=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=Sr.sets,a=i??[],o=a.length;Sr.sets=a;try{return n()}catch(e){throw Lu(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,Sr.sets=i}},Cs=(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},ws=e=>!e.includes(void 0),Ts=e=>e.variables.map(()=>void 0),Es=(e,t,n)=>{let r=[...e];return r[t]=n,r},Ds=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Os=e=>e.kind===`Identifier`?e.name:void 0,ks=(e,t,n)=>{if(t.kind===`Label`)return ks(e,t.body,n);let r=Os(t);if(r===void 0)return;let i=ol(n,r);if(i?.kind===`Thunk`)return ks(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=Yl(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?ks(e,o.body,o.scope):void 0},As=(e,t,n)=>{if(t.kind===`Prime`)return ks(e,t.expression,n);if(t.kind===`Label`)return As(e,t.body,n);let r=Os(t);if(r===void 0)return;let i=ol(n,r);if(i?.kind===`Thunk`)return As(e,i.expression,i.scope);if(i)return;let a=Yl(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?As(e,a.body,a.scope):void 0},js=e=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean expression.`);return e},Ms=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Ns=(e,t,n)=>{t===void 0?ws(n)&&e.onState(n):ws(n)&&Ms(e)?Fs(e,t,n):t.kind===`Predicate`?Is(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?Gs(e,t.expression,t.rest,t.scope,n):Ps(e,t,n)&&Ns(e,t.rest,n)},Ps=(e,t,n)=>{let r=e.environment,i=W(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return W(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?md(t,r.runtime.version):t}})();return!Qt(i,a)},Fs=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){Gs(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Ps(e,r,n):!js(W(r.expression,Cs(e,r.scope,n))))return}e.onState(n)},Is=(e,t,n,r,i)=>Ss(e,t,()=>{switch(t.kind){case`Let`:Is(e,t.body,n,du(t.definitions,Cs(e,r,i)),i);return;case`Label`:Is(e,t.body,n,r,i);return;default:if(Us.has(t.kind))throw new y(`The state relation is not a boolean expression.`);Ss(e,t,()=>Ws(e,t,n,r,i))}}),Ls=(e,t,n,r)=>{js(t)&&Ns(e,n,r)},Rs=(e,t,n,r,i)=>{let a=Cs(e,r,i);if(t.kind===`Identifier`){let o=ol(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Is(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Is(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:Yl(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&_l(s,e.environment))){Is(e,c.body,n,c.scope,i);return}Ls(e,W(t,a),n,i);return}let o=Zl(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Is(e,o.body,n,lu(o,t.args,a),i):Ls(e,W(t,a),n,i)},zs=(e,t,n,r,i)=>{let a=n[r];a===void 0?Ns(e,t,Es(n,r,i)):Qt(a,i)&&Ns(e,t,n)},Bs=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Vs=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?ks(e,a,r):As(e,a,r),c=Cs(e,r,i);if(s===void 0){W(t,c)===!0&&Ns(e,n,i);return}let l=W(o,c),u=i[s];if(t.operator===`=`){zs(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)W(t,c)===!0&&Ns(e,n,i);else{if(!Zn(d))throw new y(`The right side of \\IN is not enumerable.`);for(let t of lr(d))Ns(e,n,Es(i,s,t))}},Hs=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Us=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Ws=(e,t,n,r,i)=>{let a=Cs(e,r,i);switch(t.kind){case`Identifier`:Rs(e,t,n,r,i);return;case`Apply`:if(Hs.has(t.operator)&&t.args.length===2){Vs(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(js(W(t.args[0],a))){Is(e,t.args[1],n,r,i);return}Ns(e,n,i);return}Rs(e,t,n,r,i);return;case`And`:{let a=t.operands;if(t.isBulleted||a.length===2){let t=a.slice(1).reduceRight((e,t)=>Bs(`Predicate`,t,r,e),n);Is(e,a[0],t,r,i);return}let o=a[a.length-1];Is(e,Ds(t,a.length-1),Bs(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>Is(e,t,n,r,i));return}Is(e,Ds(t,a.length-1),n,r,i),Is(e,a[a.length-1],n,r,i);return}case`Exists`:Ol(t.bounds,a,r=>(Is(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(Ol(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Ns(e,n,i);return}let o=r.slice(1).reduce((e,n)=>Bs(`Predicate`,t.body,n,e),n);Is(e,t.body,o,r[0],i);return}case`If`:Is(e,js(W(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>js(W(e.condition,a)))?.body??t.other;if(o===void 0)throw new y(`TLC encountered a CASE with no conditions true.`);Is(e,o,n,r,i);return}case`FunctionApplication`:{let r=Nl(W(t.function,e.isInit?a:ul(a)));if(r){Is(e,r.body,n,Pl(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){Gs(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){Is(e,t.action,n,r,i),Gs(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){Is(e,t.action,Bs(`Changed`,t.subscript,r,n),r,i);return}}Ls(e,W(t,a),n,i)},Gs=(e,t,n,r,i)=>Ss(e,t,()=>{let a=ks(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&zs(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Ns(e,n,i);return}let s=o.reduceRight((e,t)=>Bs(`Unchanged`,t,r,e),n);Gs(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=ol(r,t.name);if(a?.kind===`Thunk`){Gs(e,a.expression,n,a.scope,i);return}let o=a?void 0:Yl(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){Gs(e,o.body,n,o.scope,i);return}}let o=e.environment,s=W(t,{environment:o,scope:r,state:e.current,next:void 0}),c=W(t,{environment:o,scope:r,state:i,next:void 0});Qt(s,c)&&Ns(e,n,i)}),Ks=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},qs=/* @__PURE__ */ Error(`The replay found a successor`),Js=(e,t,n,r)=>{let i=Ks(r,!1,n,()=>{throw qs},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Bs(`Changed`,e.subscript,t,void 0);Is(i,e.action,n,t,Ts(r))}else Is(i,e,void 0,t,Ts(r));return!1}catch(e){if(e!==qs)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},Ys=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Ks(t,!0,void 0,n),o=i.reduceRight((e,t)=>Bs(`Predicate`,t.expression,t.scope,e),void 0);Is(a,r.expression,o,r.scope,Ts(t))},Xs=(e,t,n,r)=>{e.some(e=>Us.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Ks(n,!1,t,e=>i.push(e));Is(a,e.expression,void 0,e.scope,Ts(n)),i.forEach(t=>r(t,e))})},Zs=/* @__PURE__ */ new WeakMap,Qs=/* @__PURE__ */ new WeakMap,$s=(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},ec=(e,t,n)=>{let r=e.slice();return r[t]=n,r},tc=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,nc=(t,r)=>{let i=new y(r);return t.isInit?i:n(i,e.error)},rc=(e,t,n,r)=>{let i=Zc(n);return r&&Us.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${tc(e)}, TLC expected a boolean expression,\nbut instead found ${z(t)}.\n${i}`},ic=(e,t,n)=>{let r=zi(t),i=Xc(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${tc(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
79
+ `:``}${i}`},ac=(e,t,n,r=!0)=>{let i=W(t,n);if(typeof i==`boolean`)return i;throw nc(e,rc(e,i,t,r))},oc=e=>e===`=`||e===`\\in`||e===`\\subseteq`,sc=(e,t,n)=>{let r=n?Zs:Qs,i=r.get(e);if(i)return i;let a=Pc(e,t,n);return r.set(e,a),a},cc=(e,t)=>{if(t.constants.has(e))return;let n=pl(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},lc=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return lc(e.expression,t,!1,r);if(e.kind!==`Identifier`||B(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=cc(e.name,t);if(a&&!r.has(a))return r.add(a),lc(a.body,t,n,r)},uc=(e,t,n)=>lc(e,t,!n),dc=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return dc(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=du(e.definitions,$s(r,t,n));return dc(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ol(t,e.name);if(a?.kind===`Thunk`)return dc(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=cc(e.name,r.environment);if(s)return dc(s.body,void 0,n,r,i)},fc=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||B(e))||!t&&e.kind===`Prime`,pc=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>pc(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=cc(e.name,t);if(i)return n.add(e.name),pc(i.body,t,n)},mc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),hc=(e,t,n)=>mc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||oc(e.operator)&&(fc(e.args[0],n)||uc(e.args[0],t,n)!==void 0)||B(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,gc=/* @__PURE__ */ new Set,_c=(e,t)=>{if(B(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Xo(e,(e,i)=>{let a=r.isReadOnly?_c(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},vc=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||B(e)?void 0:pl(r,t);return i&&!n.has(i)&&(n.add(i),vc(i.body,t,n))?!0:hi(e).some(e=>vc(e,t,n))},yc=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=uc(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=pc(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return hc(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:sc(e,t,n)}},bc=(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(bd(e,t)===void 0||vc(e,t,/* @__PURE__ */ new Set))return!0;let n=_c(e,gc);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)}},xc=(e,t,n)=>{let r=e.map(e=>yc(e,t,n)),i=(e,t,n,a,o,s)=>{let c=a,l,u=Ms(t);for(let a=e;a<r.length;a++){if(a>0&&u&&Rc(c)){l??=$s(t,n,c);for(let e=a;e<r.length;e++)if(!ac(t,r[e].expression,l,!1))return;s(c,o);return}let e=r[a];if(e.kind===`Guard`){if(l??=$s(t,n,c),!ac(t,e.expression,l))return;continue}if(e.kind===`Assign`){l??=$s(t,n,c);let r=W(e.value,l),i=c[e.index];if(i===void 0)c=ec(c,e.index,r),l=void 0;else if(!Qt(i,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=c[t];if(e===void 0)c=ec(c,t,n[t]),l=void 0;else if(!Qt(e,n[t]))return}continue}let d=a+1;e.runner(t,n,c,o,!0,(e,r)=>i(d,t,n,e,r,s));return}s(c,o)};return(e,t,n,r,a,o)=>i(0,e,t,n,r,o)},Sc=e=>(t,n,r,i,a,o)=>{ac(t,e,$s(t,n,r))&&o(r,i)},Cc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=$s(r,i,a);if(a[l]!==void 0){ac(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Zn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${tc(r)}, the right side of \\IN is not enumerable.`;throw nc(r,`${t}\n${Xc(e)}`)}let p=lr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(ec(a,l,p[e]),o)}},wc=/* @__PURE__ */ new WeakMap,Tc=e=>{let t=wc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Tc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return wc.set(e,n),n},Ec=(e,t)=>{let n=e.args[0],r=Sc(e),i=(e,r,i)=>dc(n,r,i,e,!t)??-1,a=Cc(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],$s(t,n,o));l(ec(o,u,d),s)}},Dc=(e,t,n)=>{let r=Xc(e);return(i,a,o,s,c,l)=>{let u=$s(i,a,o),d=W(e.function,n?u:ul(u)),f=Nl(d);if(f!==void 0){sc(f.body,t,n)(i,Pl(f,e,u),o,s,c,l);return}if(!F(d))throw nc(i,`In computing ${tc(i)}, a non-function (${zi(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw nc(i,`In computing ${tc(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Oc=(e,t)=>{if(pc(e,t))return xc([Tc(e)],t,!1);if(e.kind===`Tuple`)return sc(Tc(e),t,!1);let n=Tc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ol(i,e.name):void 0;l?.kind===`Thunk`?sc(Tc(l.expression),t,!1)(r,l.scope,a,o,s,c):ac(r,n,$s(r,i,a))&&c(a,o)}},kc=(e,t,n)=>{let r=e.operator,i=Sc(e),a=B(e)?void 0:Yl(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Xu(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=sc(a.body,t,n),o.body(e,i($s(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=$s(a,o,s),f=Zl(e,d);f?.kind===`Closure`?sc(f.body,t,n)(a,lu(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Ac=(e,t,n)=>{let r=Sc(e),i=B(e)?void 0:cc(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ol(s,e.name);f?.kind===`Thunk`?sc(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=sc(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},jc=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||B(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!B(a))return;let o=lc(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=>jc(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||B(e))return;let r=Yl(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=jc(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(i&&o?.kind===`Identifier`&&B(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Mc=(e,t,n)=>{let r=ol(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},Nc=(e,t,n)=>{let r=e.map(e=>sc(e,t,n)),i=n?[]:e.map(e=>jc(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&&Mc(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)}},Pc=(e,t,n)=>{let r=e=>sc(e,t,n);switch(e.kind){case`And`:return xc(e.operands,t,n);case`Or`:return Nc(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=xl(W(a.set,$s(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,sl(r,e,u[t]),o,s,c,l)}}let o=n?void 0:bc(e,t);if(o){let r=xc(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=$s(n,i,a),d=e.bounds.map(e=>xl(W(e.set,u),e.set,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=sl(t,o.names[e],r);if(e===d.length-1){let e=$s(n,i,a);if(!o.guards.every(t=>ac(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Ol(e.bounds,$s(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&bd(e,t)!==void 0&&!vc(e.body,t,/* @__PURE__ */ new Set)?_c(e,gc):void 0;return(t,n,r,o,s,c)=>{let l=[];Ol(e.bounds,$s(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ol(n,e)?.kind===`Value`)){u.every(n=>ac(t,e.body,$s(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Rc(r)?u.slice(n).every(n=>ac(t,e.body,$s(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=W(e.condition,$s(r,i,a));if(typeof l!=`boolean`)throw nc(r,ic(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=$s(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw nc(r,`In computing ${tc(r)}, a non-boolean expression${r.isEnabled?``:` `}(${zi(t)}) was used as a guard condition of a CASE.\n${Zc(e.source)}`)})?.body??n;if(!u)throw nc(r,`In computing ${tc(r)}, TLC encountered a CASE with no conditions true.\n${Xc(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Su(e.definitions,t);return(t,r,a,o,s,c)=>n(t,du(e.definitions,$s(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new y(`UNCHANGED appears in an initial predicate at ${Jc(e)}`)}:Oc(e.expression,t);case`AngleAction`:{let n=r(e.action),i=Tc(e.subscript),a=(e,n,r)=>{try{return ac(e,i,$s(e,n,r))}catch(n){throw e.isEnabled?md(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,Tc(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Ac(e,t,n);case`FunctionApplication`:return Dc(e,t,n);case`Apply`:{let i=e.args;if(oc(e.operator)){let r=uc(i[0],t,n);if(r!==void 0)return e.operator===`=`?xc([e],t,n):Cc(e,()=>r);if(fc(i[0],n))return Ec(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=W(i[0],$s(t,n,r));(typeof c==`boolean`?c:fl(c,`the left side of => at ${Jc(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return kc(e,t,n)}default:return Sc(e)}},Fc=/* @__PURE__ */ new WeakMap,Ic=e=>{let t=Fc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Fc.set(e,n),n},Lc=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Rc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},zc=(e,t)=>{let n=t.state;if(!n||!Rc(n))throw new y(`ENABLED needs a complete state at ${Jc(e)}`);let r=t.environment;if(r.callStack)return Js(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return sc(e,r,!1)(i,t.scope,Ic(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Bc=(t,r,i,a)=>{let o={environment:r,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};sc(t,r,!0)(o,a,Ic(r),void 0,!1,t=>{if(!o.isStopped){if(!Rc(t))throw n(new ne([...t]),e.error);o.isStopped=i(t)}})},Vc=(e,t,n)=>{let r=[];return Bc(e,t,e=>(r.push(e),!1),n),r},Hc=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return sc(e,n,!1)(a,i,Ic(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Rc(e)){let r=Lc(e,n);throw new ee(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Uc=(e,t,n,r)=>{let i=[];return Hc(e,t,n,e=>(i.push(e),!1),r),i},Wc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Gc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Kc=e=>Gc.has(e.kind)||e.kind===`Apply`&&Wc.has(e.operator),qc=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&lt(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Jc=e=>`line ${e.location.line}, column ${e.location.column}`,Yc=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,Xc=e=>{let t=e.location.range;return t?Yc(t):Jc(e)},Zc=e=>e.kind===`Number`?e.text??String(e.value):Xc(e),Qc=(e,t)=>new y(`A non-boolean expression (${zi(t)}) was used as the condition of an IF.\n${Xc(e)}`),$c=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new y(`A non-boolean expression (${zi(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Zc(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new y(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${zi(n)}.\n${Xc({...e,location:{...e.location,range:{...r,end:i}}})}`)},el=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${z(n)}\n${Xc(e)}`,r=e=>`Attempted to apply function:\n${N(z(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!F(i))throw new y(`Attempted to select field "${t}" from a non-record value ${N(z(i))}\n${Xc(e)}`);let a=Ut(i);if(a===`tuple`)throw jr(t);return Nr(i,t,a===`record`?n:r)}},tl=e=>e===`1.7.4`?(t,n)=>Or(t,n,e):void 0,nl=e=>t=>{if(!F(t))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${zi(t)})\n${Xc(e)}`);return Fr(t)},rl=(e,t)=>(n,r)=>{if(!P(n)||jt(n))throw new y(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Xc(e)}`);return t.evaluate([n,r])},il=t=>n(new y(`TLC can't handle real numbers: ${t.text} at ${Jc(t)}`),e.configParseError),al=t=>n(new y(`TLC can't handle a number this big: ${t.text??t.value} at ${Jc(t)}`),e.error),ol=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},sl=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),cl=(e,t,n)=>{if(t.kind===`Name`)return sl(e,t.name,n);let r=br(n);if(!r||r.length!==t.names.length)throw new y(`Cannot bind <<${t.names.join(`, `)}>> to ${z(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>sl(e,t,r[n]),e)},ll=(e,t)=>{if(F(e))return e;throw new y(`A non-function (${zi(e)}) was applied as a function.\n${Xc(t)}`)},ul=e=>e.isKeepLazy?e:{...e,isKeepLazy:!0},dl=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),fl=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Expected ${t} to be a boolean but found ${z(e)}`);return e},pl=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),ml=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),hl=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),gl=(e,t)=>{if(ml.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&hl.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=pl(n,t);if(e&&!t.constants.has(n)&&!_l(e,t))return!0}return hi(e).some(e=>gl(e,t))},_l=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!gl(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>gl(e.set,t)));return t.constantLevels.set(e,r),r},vl=(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.`},yl=(e,t,n)=>{if(!P(e)||jt(e)){let r=z(e),i=n===`1.7.4`?void 0:vl(e,r);throw new y(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Zc(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Zc(t)}\n${i}`)}},bl=(e,t,n)=>(yl(e,t,n),typeof e==`object`&&e.kind===`Interval`?Gn(e):ir(e)??R(e).elements),xl=(e,t,n)=>n===`1.7.4`?(yl(e,t,n),ir(e)??lr(e)):bl(e,t,n),Sl=e=>{if(typeof e==`object`&&e.kind===`Interval`)return gr(e),e},Cl=(e,t,n)=>Sl(e)??xl(e,t,n),wl=(e,t,n)=>Sl(e)??bl(e,t,n),Tl=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},El=(e,t)=>e.map(e=>Cl(W(e.set,t),e.set,t.environment.runtime.version)),Dl=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Tl(t[n],t=>i(n-1,cl(a,e[n].pattern,t)));return i(e.length-1,n)},Ol=(e,t,n)=>Dl(e,El(e,t),t.scope,n),kl=(e,t)=>{let n=e.map(e=>W(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Al=(e,t,n)=>{if(e.length===1)return cl(t,e[0].pattern,n);let r=br(n)??[];return e.reduce((e,t,n)=>cl(e,t.pattern,r[n]),t)},jl=/* @__PURE__ */ new WeakMap,Ml=e=>(jl.set(e.value,e),e.value),Nl=e=>typeof e==`object`&&e.kind===`LazyFunction`?jl.get(e):void 0,Pl=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:Yn(i),o=(e,n,i)=>`In applying the function\n${N(z(r))},\nthe ${e} is:\n${N(z(n))}${i}.\n${Xc(t.function)}`,s=e.bounds;if(s.length===1){if(!wr(a,r.domain))throw new y(o(`first argument`,a,`which is not in its domain`));return Al(s,e.scope,a)}let c=br(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new y(`Attempted to apply a function to an argument not in its domain.\n${Xc(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!wr(n,l[t]))throw new y(o(r,n,`${e.pattern.kind===`Name`?``:`
80
+ `}which is not in its domain`));if(e.pattern.kind===`Tuple`&&br(n)?.length!==e.pattern.names.length)throw new y(o(r,n,`which does not match its formal parameter`))}),Al(s,e.scope,Yn(c.slice(0,s.length)))},Fl=/* @__PURE__ */ new WeakMap,Il=(e,t)=>{let n=Fl.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:Yc(r)};return Fl.set(t,i),i},Ll=(e,t,n)=>{let r=Il(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}},Rl=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Jr(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(en(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},zl=/* @__PURE__ */ new WeakMap,Bl=e=>{let t=zl.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return zl.set(e,n),n},Vl=(e,t)=>{let n=kl(e.bounds,t),r=Rl(n,(n,r)=>W(e.body,dl(t,Al(e.bounds,sl(void 0,e.name,r),n))),Ll(e.bounds,e.body,n));return Ml({value:r,bounds:e.bounds,body:e.body,scope:sl(void 0,e.name,r)}),e.bounds.length===1?Wt(r):r},Hl=(e,t)=>{if(typeof t!=`object`||Ut(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!lt(t.domain))return t;try{let e=Dr(t);return Bt(e.domain,e.range)}catch(e){if(e instanceof y)return t;throw e}},Ul=(e,t)=>e.kind===`Function`?e.isSelfReferential?Vl(e,t):W(Bl(e),t):W(e.body,t),Wl=(e,t)=>{let n=_l(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=dl(t,void 0);if(!n)return Ul(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>Hl(e,Ul(e,i)));return t.environment.definitionValues.set(e,a),a},Gl=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(!(t.constants.has(n)||t.substitutions.has(n))&&_l(e,t))try{An(Wl(e,{environment:t,scope:void 0,state:void 0,next:void 0}))}catch(e){if(!(e instanceof y)&&!c(e))throw e}}),Kl=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=W(e.expression,dl(t,e.scope));return n&&(e.cache=r),r},ql=/* @__PURE__ */ new WeakMap,Jl=e=>{let t=ql.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return ql.set(e,n),n},Yl=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Yl(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Jl(r):t.builtins.get(e)},Xl=/* @__PURE__ */ new WeakMap,Zl=(e,t)=>{if(B(e))return Ql(e.operator,t);let n=Xl.get(e),r=n===void 0?Yl(e.operator,t.environment)??null:n;return n===void 0&&Xl.set(e,r),r??Ql(e.operator,t)},Ql=(e,t)=>{let n=ol(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Yl(e,t.environment)},$l=e=>e.kind===`Closure`?e.params.length:e.arity,eu=(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:Ql(n,t);if(!r)throw new y(`Expected an operator argument at ${Jc(e)}`);return r},tu=(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)=>sl(e,n.name,t[r]),e.scope);return W(e.body,dl(n,r))},nu=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:$l(e),call:n=>tu(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},ru=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Ql(e.name,t);return n!==void 0&&$l(n)>0},iu=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),au=(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 au(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([])}},ou=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&pu(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=B(e)?void 0:au(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ol(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:iu(e,t)}}return t=>iu(e,t)},su=/* @__PURE__ */ new WeakMap,cu=(e,t)=>{let n=su.get(e);if(n)return n;let r=ou(e,t);return su.set(e,r),r},lu=(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:eu(t[i],n)}:cu(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},uu=(e,t,n)=>e.kind===`Closure`?W(e.body,dl(n,lu(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Ju(t,n),n):e.evaluate(t.map(e=>ru(e,n)?nu(eu(e,n),n):W(e,n)),n),du=(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),fu=(e,t,n)=>{let r=ol(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Kl(r,n);if(r?.kind===`Operator`){if($l(r.operator)===0)return tu(r.operator,[],n);throw new y(`Operator ${e} is used without arguments`)}let i=au(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw pd(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Wl(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 ${Jc(t)}`)},pu=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,mu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),hu=(e,t)=>mu.has(e)||t.builtins.get(e)?.isStateLevel===!0,gu={builtins:mu,definitions:/* @__PURE__ */ new WeakMap},_u={builtins:new Set([...mu].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},vu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&_l(e,t),yu=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!B(e)){let e=pl(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!vu(e,t)&&bu(e,t,n))return!0}return hi(e).some(e=>yu(e,t,n))},bu=(e,t,n=gu)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=yu(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>yu(e.set,t,n));return n.definitions.set(e,i),i},xu={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},Su=(e,t)=>new Set(e.filter(e=>bu(e,t)||bu(e,t,xu))),Cu=e=>[...e.definitions.values()].some(t=>bu(t,e)),wu=e=>[...e.definitions.values()].some(t=>bu(t,e,_u)),Tu=/* @__PURE__ */ new WeakMap,Eu=(e,t)=>{let n=Tu.get(e);if(n!==void 0)return n;let r=Au(e,t,Ou);return Tu.set(e,r),r},Du=/* @__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`]),Ou=/* @__PURE__ */ new Set,ku=(e,t,n)=>n.size===0?Eu(e,t):Au(e,t,n),Au=(e,t,n)=>{if(!Du.has(e.kind))return!1;if(e.kind===`Identifier`&&B(e))return n.has(e.name);if(B(e))return!1;if(e.kind===`Identifier`){let n=au(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&vu(n.definition,t)}if(e.kind===`Apply`){if(hu(e.operator,t)||xu.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=Yl(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=pl(e.operator,t);if(!n||!_l(n,t)||bu(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`&&ku(e,t,n))}let r={value:!0};return Xo(e,(e,i)=>(r.value&&=ku(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},ju=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Mu=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}},Nu=(e,t)=>{if(e.kind===`Identifier`&&B(e))return!t.has(e.name);if(B(e))return!0;let n={value:!1};return Xo(e,(e,r)=>(n.value||=Nu(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Pu=(e,t)=>Ho.has(e)&&ju(e)&&bd(e,t)!==void 0&&!Nu(e,Ou),Fu=/* @__PURE__ */ new WeakMap,Iu=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Sr.sets,o=Sr.callStack,s=a??[],c=s.length;Sr.sets=s,Sr.callStack=r;try{let a=t(i),o=typeof a==`object`&&a.kind===`FilteredSet`?Fu.get(a):void 0,s=o?o(n):a;return r.values.set(e,s),typeof s==`object`&&s.kind!==`FilteredSet`&&Kc(e)&&r.sources.set(s,e),s}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=qc(e,r.values),a=i&&!hi(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!F(a)?void 0:a;throw Lu(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Sr.sets=a,Sr.callStack=o}},Lu=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof y){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},Ru=(e,t,n)=>{if(!(n instanceof y))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},zu=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Bu=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=_d(e,t),i=t.callStack,a=i?Iu(e,r,t,i):ju(e)&&Eu(e,t)?Mu(r):Pu(e,t)?Gu(r):r;return t.evaluators.set(e,a),a},Vu=/* @__PURE__ */ new WeakMap,Hu=(e,t)=>{if(t.callStack)return Bu(e,t);let n=Vu.get(e);if(n)return n;let r=(ju(e)&&Eu(e,t)?void 0:oa(e,t))??Bu(e,t);return Vu.set(e,r),r},W=(e,t)=>Hu(e,t.environment)(t),Uu=(e,t)=>{let n=e.name,r=B(e)?void 0:au(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw pd(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&&_l(e,t))return t=>Wl(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Hu(e.body,t),n.body(dl(r,void 0)));return Wu(e,t)?Gu(r):r}return t=>Wl(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Wl(e,t);return _l(e,t)||!Wu(e,t)?n:Gu(n)}return t=>fu(n,e,t)},Wu=(e,t)=>bd(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>bd(e.set,t)!==void 0)),Gu=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}},Ku=(e,t)=>{let n=Yl(e,t);return n!==void 0&&$l(n)>0},qu=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!B(e)&&Ku(e.name,t)),Ju=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),Yu=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Ju(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&qu(t[0],n)){let e=Bu(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&qu(t[0],n)&&qu(t[1],n);if(i&&a){let e=Bu(t[0],n),r=Bu(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>ru(e,n)?nu(eu(e,n),n):W(e,n)),n)},Xu=(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:cu(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:eu(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Zu=/* @__PURE__ */ new WeakMap,Qu=e=>{let t=Zu.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return Zu.set(e,n),n},$u=(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},ed=(e,t)=>e.every((e,n)=>en(e,t[n])),td=(e,t)=>{let n=pl(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&_l(n,t)&&!bu(n,t)},nd=(e,t,n,r)=>{let i=Xu(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Hu(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r)return e=>o(i(e),e);let s=Qu(e);return e=>{let n=i(e),r=$u(n,t.length);if(!r||e.isKeepLazy)return o(n,e);let a=r.length;for(let e of r)a=zr(a,Jr(e));let c=s.calls.get(a),l=c?.find(e=>ed(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}},rd=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Bu(n[0],t),r=Bu(n[1],t);return t=>!fl(e(t),`the left side of =>`)||fl(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new y(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=B(e)?void 0:Yl(e.operator,t);if(r?.kind===`Closure`){let i=!t.callStack&&td(e,t);return nd(r,n,t,i)}if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Bu(n[0],t),i=nl(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Bu(n[0],t);return Uo.has(e)||gl(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=Bu(n[0],t),a=Bu(n[1],t),o=rl(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?Yu(r,n,t):e.operator===`\\cdot`&&n.length===2?()=>{throw new y(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)}:r=>{let i=Ql(e.operator,r);if(i)return uu(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new y(`${e.operator} is a function; apply it with brackets`):new y(`Unknown operator ${e.operator} at ${Jc(e)}`)}},id=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Bu(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Bu(a.set,t);return s=>Tl(Cl(o(s),a.set,t.runtime.version),t=>fl(i(dl(s,sl(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>Bu(e.set,t));return s=>{let c=a.map((e,n)=>Cl(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?fl(i(dl(s,a)),r)!==n:Tl(c[t],n=>l(t-1,sl(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Ol(o,e,t=>fl(i(dl(e,t)),r)!==n)?!n:n},ad=(e,t)=>{if(e.kind===`Tuple`)return Yn(e.names.map(e=>{let n=ol(t,e);return n?.kind===`Value`&&n.value}));let n=ol(t,e.name);return n?.kind===`Value`?n.value:void 0},od=/* @__PURE__ */ new WeakSet,sd=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&od.add(e)},cd=(e,t)=>{let n=od.has(e),r=Bu(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Bu(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=qn(e),o=Bt(i,i.map(e=>r(dl(t,sl(t.scope,n,e)))));return lt(e)?o:Wt(o)}let n=[],s=i.map(e=>wl(W(e.set,t),e.set,t.environment.runtime.version));return Dl(i,s,t.scope,e=>{let o=i.length===1?ad(a.pattern,e)??!1:Yn(i.map(t=>ad(t.pattern,e)??!1));return n.push([o,r(dl(t,e))]),!1}),zn(n)},l=(t,n)=>{let a=Ml({value:Rl(t,e=>r(dl(n,Al(i,n.scope,e))),Ll(i,e.body,t)),bounds:i,body:e.body,scope:n.scope});return i.length===1?Wt(a):a},u=t.callStack;return t=>{let r=o?s(t):kl(i,t);if(e.isRecursive||n||t.isKeepLazy||!L(r))return l(r,t);if(!lt(r)){if(u)return l(r,t);try{return c(r,t)}catch(e){if(!(e instanceof y))throw e;return l(r,t)}}if(!u)return c(r,t);try{return c(r,t)}catch(t){throw Ru(u,e,t),t}}},ld=(e,t)=>{let n=od.has(e);n&&sd(e.function);let r=Bu(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=>Bu(e,t))}),value:Bu(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Yn(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(dl(i,sl(i.scope,`@`,e))):Ir(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(sa.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Xc(e.function)}`)}return n}},ud=(e,t)=>{if(e.kind===`SetFilter`){let n=Bu(e.predicate,t),r=Bu(e.bound.set,t),i=e.bound.pattern,a=e.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:Yc(a)},s=(e,t)=>n=>fl(e(dl(t,cl(t.scope,i,n))),`a set filter predicate`),c=(t,n,r)=>{let i={kind:`FilteredSet`,base:t,test:s(r,n),source:o};return Fu.set(i,r=>c(t,{...n,environment:r},Bu(e.predicate,r))),i};return e=>{let t=r(e);return lt(t)?zt(R(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=Bu(e.expression,t);return t=>{let r=[];return Ol(e.bounds,t,e=>(r.push(n(dl(t,e))),!1)),Pn(r)}}let n=e.set;if(!n)return()=>{throw new y(`TLC cannot evaluate an unbounded CHOOSE at ${Jc(e)}`)};let r=Bu(e.body,t),i=Bu(n,t);return t=>{let a=i(t);if(!P(a)||jt(a))throw new y(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${Xc(e)}`);let o={value:void 0},s=wl(a,n,t.environment.runtime.version);if(Tl(s,n=>{let i=cl(t.scope,e.pattern,n);return fl(r(dl(t,i)),`the body of CHOOSE`)?(o.value=ad(e.pattern,i),!0):!1}),o.value===void 0)throw new y(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Xc(e)}`);return o.value}},dd=e=>[...e].sort((e,t)=>It(e.name,t.name)),fd=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),pd=(e,t)=>new te(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${Xc(t)}`,e),md=(e,t)=>e instanceof te&&t!==`1.7.4`?new y(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,hd=e=>new y(`A primed expression appears outside an action at ${Jc(e)}`),gd=(e,t)=>{let n=dd(e),r=fd(n),i=n.map(e=>Bu(e.value,t));if(r)return e=>Xn(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>ht(a,i.map(t=>t(e)),o):e=>Zt(a,i.map(t=>t(e)))},_d=(e,t)=>{let n=e=>Bu(e,t);switch(e.kind){case`Number`:{let t=e.value;return pu(t)?()=>t:()=>{throw al(e)}}case`Decimal`:return()=>{throw il(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Uu(e,t);case`Apply`:return rd(e,t);case`Bracket`:return()=>{throw new y(`A bracket without a function or subscript is not an expression at ${Jc(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new y(`An operator cannot be used as a value at ${Jc(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 $c(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw $c(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw hd(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>Qt(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Qc(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new y(`A non-boolean expression (${zi(t)}) was used as a condition of a CASE. ${Zc(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new y(`Attempted to evaluate a CASE with no conditions true.\n${Xc(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(dl(n,du(e.definitions,n)))}case`Forall`:case`Exists`:return id(e,t);case`UnboundedQuantifier`:return()=>{throw new y(`TLC cannot evaluate an unbounded quantifier at ${Jc(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return ud(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Pn(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Yn(t.map(t=>t(e)))}case`FunctionConstruction`:return cd(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 gd(e.fields,t);case`RecordSet`:{let t=dd(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 ld(e,t);case`ExceptAt`:return t=>{let n=ol(t.scope,`@`);if(n?.kind!==`Value`)throw new y(`@ appears outside an EXCEPT at ${Jc(e)}`);return n.value};case`FunctionApplication`:{sd(e.function);let r=n(e.function),i=t=>ll(r(ul(t)),e),a=e.args.map(n),o=tl(t.runtime.version);if(a.length===1){let e=a[0];return t=>Nr(i(t),e(t),o)}return e=>Nr(i(e),Yn(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=el(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?fl(t(e),`an action`)||r(e):fl(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>zc(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new y(`The subexpression reference at ${Jc(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 ${Jc(e)}`)}}},vd=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),yd=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},bd=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(vd.has(e.kind))return!1;let a=yd(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&&hu(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return hi(e).every(i)};return i(e)?[...n]:void 0},xd=`-------------------------------- MODULE Reals -------------------------------
24
81
  (***************************************************************************)
25
82
  (* This module provides dummy definitions of the operators that are *)
26
83
  (* defined by the real Reals module. It is expected that any tool that *)
@@ -37,7 +94,7 @@ EXTENDS Integers
37
94
  Real == "Reals"
38
95
  a / b == CHOOSE m \\in Real : m * b = a
39
96
  Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
40
- =============================================================================`],[`RealTime`,`----------------------------- MODULE RealTime -------------------------------
97
+ =============================================================================`,Sd=`----------------------------- MODULE RealTime -------------------------------
41
98
  (***************************************************************************)
42
99
  (* This standard module is described in Chapter 9 of the book "Specifying *)
43
100
  (* Systems". The type of specification described there cannot be handled *)
@@ -63,7 +120,7 @@ RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
63
120
  IN /\\ now \\in Real
64
121
  /\\ [][NowNext]_now
65
122
  /\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
66
- =============================================================================`],[`Toolbox`,`----------------------------- MODULE Toolbox --------------------------------
123
+ =============================================================================`,Cd=`----------------------------- MODULE Toolbox --------------------------------
67
124
  (***************************************************************************)
68
125
  (* *)
69
126
  (***************************************************************************)
@@ -89,8 +146,7 @@ _TEPosition ==
89
146
  THEN _TETraceLength
90
147
  ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
91
148
 
92
- =============================================================================`]]),Ks=`tlc2/value/impl/`,qs=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)}},Js=e=>[...e.slice(1,e.indexOf(`)`)).matchAll(/\[*(?:L[^;]*;|[BCDFIJSZ])/g)].length,Ys=e=>{let t=qs(e);if(t.readUint32()!==3405691582)throw new c(`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:Js(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}},Xs=(e,t)=>e[e[t].first].text,Zs=(e,t)=>{let n=e[t],r=e[n.second];return{className:Xs(e,n.first),name:e[r.first].text}},Qs=(e,t,n,r)=>{let i=()=>new h(`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=Zs(t,l());if(n.className!==`${Ks}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=Zs(t,l()),a=s();if(n.className!==`${Ks}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:Xs(t,l()),value:void 0}),e+=3;else if(n===183){let n=Zs(t,l()),a=s(),o=s();if(!(n.className===`${Ks}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()},$s=(e,t)=>{if(!t)return e;let n=Ys(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:Qs(r,n.pool,e.name,t.location)}:t});return{...e,definitions:r}},Z=(e,t,n)=>({low:e,high:t,isAssociative:n}),ec=new Map([[`=>`,Z(1,1,!1)],[`<=>`,Z(2,2,!1)],[`~>`,Z(2,2,!1)],[`-+->`,Z(2,2,!1)],[`/\\`,Z(3,3,!0)],[`\\/`,Z(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,Z(5,5,!1)]),[`\\cdot`,Z(5,14,!0)],[`@@`,Z(6,6,!0)],[`:>`,Z(7,7,!1)],[`<:`,Z(7,7,!1)],[`\\cup`,Z(8,8,!0)],[`\\cap`,Z(8,8,!0)],[`\\`,Z(8,8,!1)],[`..`,Z(9,9,!1)],[`...`,Z(9,9,!1)],[`##`,Z(9,13,!0)],[`$`,Z(9,13,!0)],[`$$`,Z(9,13,!0)],[`??`,Z(9,13,!0)],[`!!`,Z(9,13,!1)],[`\\sqcap`,Z(9,13,!0)],[`\\sqcup`,Z(9,13,!0)],[`\\uplus`,Z(9,13,!0)],[`\\wr`,Z(9,14,!1)],[`+`,Z(10,10,!0)],[`++`,Z(10,10,!0)],[`(+)`,Z(10,10,!0)],[`\\oplus`,Z(10,10,!0)],[`%`,Z(10,11,!1)],[`%%`,Z(10,11,!0)],[`|`,Z(10,11,!0)],[`||`,Z(10,11,!0)],[`\\X`,Z(10,13,!1)],[`-`,Z(11,11,!0)],[`--`,Z(11,11,!0)],[`(-)`,Z(11,11,!0)],[`\\ominus`,Z(11,11,!0)],[`*`,Z(13,13,!0)],[`**`,Z(13,13,!0)],[`/`,Z(13,13,!1)],[`//`,Z(13,13,!1)],[`\\div`,Z(13,13,!1)],[`\\o`,Z(13,13,!0)],[`(.)`,Z(13,13,!0)],[`\\odot`,Z(13,13,!0)],[`(/)`,Z(13,13,!1)],[`\\oslash`,Z(13,13,!1)],[`(\\X)`,Z(13,13,!0)],[`\\otimes`,Z(13,13,!0)],[`&`,Z(13,13,!0)],[`&&`,Z(13,13,!0)],[`\\star`,Z(13,13,!0)],[`\\bullet`,Z(13,13,!0)],[`\\bigcirc`,Z(13,13,!0)],[`^`,Z(14,14,!1)],[`^^`,Z(14,14,!1)]]),tc=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),nc=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),rc=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),ic=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),ac=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...tc]),oc=e=>ec.has(e)||tc.has(e)||e===`-.`,sc=(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}}},cc=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),lc=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),uc=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),dc=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),fc=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),pc=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),mc=/* @__PURE__ */ new Set([``,`*`,`-`]),hc=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),gc=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),_c=/* @__PURE__ */ new Set([`NEW`,...gc.keys()]),vc=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),yc=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),bc=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),xc=e=>RegExp(`^-{4,}\\s*MODULE\\s+${e}\\s*-{3,}$`),Sc=(e,t)=>{let n=e.split(/\r?\n/),r=n.findIndex(e=>xc(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(`
93
- `)},Cc=(e,t)=>{let n=se(e),r={index:0,offsideColumns:[]},i=[],a=/* @__PURE__ */ new Set,o=[],s={index:-1},l=[],u=e=>i[i.length-1].has(e),d=e=>({line:e.line,column:t&&e.kind===`String`?e.endColumn:e.column,range:void 0}),f=[],p=[],m=[],h=e=>{let t=r.index-1,i=e===t?m[e]:void 0;if(i)return i;let a=n[t];f[e]??=d(n[e]),p[t]??={line:a.line,column:a.endColumn};let o={module:l[l.length-1].name,start:f[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`||bc.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},re=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:pc.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 c(`${e} at line ${t.line}, column ${t.column}`,void 0,ie(e,t,a,r))},ie=(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 ${re(a)}`,...te(a),isEnd:i}:{reason:e,line:r.line,column:r.column,isEnd:i}},ae=(e,t=_())=>S(e,t,t),oe=e=>(e.kind===`Identifier`||e.kind===`Keyword`)&&!x(e),C=(e,t=0)=>{let n=v(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},w=()=>{let e=v();if(e.kind===`End`)throw S(`Unexpected end of expression`);return r.index++,e},T=e=>C(e)?(r.index++,!0):!1,E=e=>{if(!C(e))throw ae(`Expected ${JSON.stringify(e)} but found ${y(v())}`);return w()},D=()=>{let e=v();if(e.kind!==`Identifier`)throw ae(`Expected an identifier but found ${y(e)}`);if(x(e))throw ae(`Unexpected keyword ${e.text}`);return r.index++,e.text},ce=e=>{r.offsideColumns.push(-1);let t=e();return r.offsideColumns.pop(),t},O=(e,t=`,`)=>{let n=[e()];for(;T(t);)n.push(e());return n},k=()=>{if(C(`<<`)){let e={value:1};for(;v(e.value).kind===`Identifier`||C(`,`,e.value);)e.value++;return C(`>>`,e.value)&&C(`\\in`,e.value+1)}let e={value:0};for(;v(e.value).kind===`Identifier`;){if(C(`\\in`,e.value+1))return!0;if(!C(`,`,e.value+1))return!1;e.value+=2}return!1},le=()=>{if(C(`::`))return!0;if(!C(`(`))return!1;let e={value:1};for(;v(e.value).kind===`Identifier`&&C(`,`,e.value+1);)e.value+=2;return v(e.value).kind===`Identifier`&&C(`)`,e.value+1)&&C(`::`,e.value+2)},ue=()=>{if(!T(`<<`))return{kind:`Name`,name:D()};let e=O(D);return E(`>>`),{kind:`Tuple`,names:e}},de=()=>O(()=>{let e=O(ue);E(`\\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=[w().text];for(;C(`!`)&&v(1).kind===`Identifier`;)w(),n.push(D());return g({kind:`Identifier`,name:n.join(`!`),location:d(e)},t)}if(C(`<<`)||C(`(`))return Se();throw ae(`Expected a subscript but found ${y(e)}`)},A=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`&&C(`==`,tc.has(n.text)?3:4))},pe=e=>{if(!rc.has(e.text))return!0;let t=v(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||C(`,`,1)||C(`)`,1)||t.kind===`Keyword`&&lc.has(t.text)||A(e)},j=()=>{let e=v(),n=e.kind===`Operator`&&(ec.has(e.text)||nc.has(e.text))&&pe(e);if(t&&e.kind!==`String`&&(nc.has(e.text)||ac.has(e.text)&&e.text!==`'`&&!tc.has(e.text)||ic.has(e.text)&&v(-1).text===`(`&&v(-1).line===e.line&&v(-1).endColumn+1===e.column&&v(1).text===`)`&&v(1).line===e.line&&v(1).column===e.endColumn+1)&&pe(e))throw S(`incomplete expression`,e);if(n)return r.index++,g({kind:`OperatorReference`,operator:e.text,location:d(e)},r.index-1);if(e.kind!==`String`&&ac.has(e.text)&&pe(e)){r.index++;let t=d(e);if(tc.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:sc(e.text,n,t),location:t}}if(C(`LAMBDA`)){let t=r.index;w();let n=O(D);E(`:`);let i=N();return g({kind:`Lambda`,params:n,body:i,location:d(e)},t)}return N()},M=()=>ce(()=>{E(`(`);let e=O(j);return E(`)`),e}),me=()=>{let e=w();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:d(e)}},he=e=>ce(()=>{let t=d(e);if(v().kind===`Identifier`&&(C(`|->`,1)||C(`:`,1))){let e=C(`|->`,1)?`Record`:`RecordSet`,n=O(()=>{let t=D();return E(e===`Record`?`|->`:`:`),{name:t,value:N()}});return E(`]`),{kind:e,fields:n,location:t}}if(k()){let e=de();E(`|->`);let n=N();return E(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let n=N();if(T(`->`)){let e=N();return E(`]`),{kind:`FunctionSet`,domain:n,range:e,location:t}}if(T(`EXCEPT`)){let e=O(()=>{E(`!`);let e=[];for(;C(`.`)||C(`[`);)if(T(`.`)){if(!oe(v()))throw ae(`Expected a field name but found ${y(v())}`);e.push({kind:`Field`,name:w().text})}else E(`[`),e.push({kind:`Index`,args:O(()=>N())}),E(`]`);return E(`=`),{path:e,value:N()}});return E(`]`),{kind:`Except`,function:n,updates:e,location:t}}return E(`]_`),{kind:`BoxAction`,action:n,subscript:fe(),location:t}}),ge=e=>ce(()=>{let t=d(e);if(T(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(k()&&(v(1).text===`\\in`||C(`<<`))){let e=r.index,n=ue();E(`\\in`);let i=N();if(T(`:`)){let e=N();return E(`}`),{kind:`SetFilter`,bound:{pattern:n,set:i},predicate:e,location:t}}r.index=e}let n=N();if(T(`:`)){let e=de();return E(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let i=[n];for(;T(`,`);)i.push(N());return E(`}`),{kind:`SetEnumeration`,elements:i,location:t}}),_e=e=>{let t=d(e),n=ce(()=>C(`>>`)||C(`>>_`)?[]:O(()=>N()));if(T(`>>_`)){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 E(`>>`),{kind:`Tuple`,elements:n,location:t}},ve=e=>{let t=d(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&k()){let e=de();return E(`:`),{kind:n,bounds:e,body:N(),location:t}}let i=O(D);return E(`:`),{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(T(`OTHER`))return E(`->`),{kind:`Case`,arms:t,other:N(),location:d(e)};let n=N();E(`->`),t.push({condition:n,body:N()})}while(T(`[]`));return{kind:`Case`,arms:t,other:void 0,location:d(e)}},be=()=>{let e=v(1);return C(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||cc.has(e.text)||e.kind===`Operator`&&(ec.has(e.text)||tc.has(e.text)||nc.has(e.text)))},xe=()=>{let e=w();if(e.kind===`Number`)return{kind:`Operand`,operand:ne(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:M()}}return{kind:`Name`,name:e.text,args:C(`(`)?M():[]}},Se=()=>{let e=r.index===s.index,n=w(),a=d(n);if(t&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=O(D);return E(`:`),{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:ne(n.text),text:n.text,location:a}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:a};if(n.kind===`String`)return{kind:`String`,value:n.text,location:a};let o=n.kind===`Step`&&Pe(n);if(o&&I()<0&&Me.length<=1)throw S(`Step number used outside proof`,n);if(o&&n.text[1]===`+`)throw S(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||o){let r=o?Fe(n)??n.text:n.text;if(le()){let e=T(`(`)?O(D):[];return e.length>0&&E(`)`),E(`::`),{kind:`Label`,name:r,params:e,body:N(),location:a}}let i=C(`(`),s=i?M():[];if(!be())return i?{kind:`Apply`,operator:r,args:s,location:a}:{kind:`Identifier`,name:r,location:a};let c=l.flatMap(e=>e.instances).find(e=>e.name===r);if(c&&!e&&!t&&c.params.length!==s.length)throw S(`The operator ${r} requires ${c.params.length} arguments`,n);let u=[{kind:`Name`,name:r,args:s}];for(;be();)w(),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`&&oc(n.text)&&C(`(`))return{kind:`Apply`,operator:n.text,args:M(),location:a};switch(n.text){case`(`:{let e=ce(()=>N());return E(`)`),e}case`[`:return he(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();E(`THEN`);let t=N();return E(`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);!T(`IN`);){if(t&&C(`RECURSIVE`))throw S(`Unexpected keyword RECURSIVE`,b(_()));if(T(`RECURSIVE`)){Ae();continue}let r=Ee(!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=T(`\\in`)?N():void 0;return E(`:`),{kind:`Choose`,pattern:e,set:t,body:N(),location:a}}case`WF_`:case`SF_`:{let e=fe(),t=ce(()=>{E(`(`);let e=N();return E(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:a}}}throw ae(`Unexpected ${y(n)}`,n)},Ce=()=>{let e=v(),t=d(e);if(e.kind===`Operator`&&(e.text===`/\\`||e.text===`\\/`))return me();if(e.kind===`Operator`||e.kind===`Keyword`)switch(e.text){case`~`:return w(),{kind:`Apply`,operator:`~`,args:[N(5)],location:t};case`-`:return w(),{kind:`Apply`,operator:`-.`,args:[N(13)],location:t};case`[]`:return w(),{kind:`Always`,expression:N(16),location:t};case`<>`:return w(),{kind:`Eventually`,expression:N(16),location:t};case`ENABLED`:return w(),{kind:`Enabled`,expression:N(16),location:t};case`UNCHANGED`:return w(),{kind:`Unchanged`,expression:N(16),location:t};case`SUBSET`:case`UNION`:case`DOMAIN`:return w(),{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=d(n);if(n.text===`'`&&e<=15){w(),i.left=g({kind:`Prime`,expression:i.left,location:r},t);continue}if(tc.has(n.text)&&e<=15){w(),i.left=g({kind:`Apply`,operator:n.text,args:[i.left],location:r},t);continue}if(n.text===`[`){w();let e=ce(()=>O(()=>N()));ce(()=>E(`]`)),i.left=g({kind:`FunctionApplication`,function:i.left,args:e,location:r},t);continue}if(n.text===`.`&&oe(v(1))){w();let e=w().text;i.left=g({kind:`FieldAccess`,record:i.left,field:e,location:r},t);continue}let a=ec.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(w(),a.low>12&&C(`-`))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(!T(`(`))return[];let e=P();return E(`)`),e},Te=()=>{let e=d(v()),t=N(),i=n[r.index-1],a={line:i.line,column:i.endColumn};return{body:t,bodyRange:{module:l[l.length-1].name,start:e,end:a}}},Ee=e=>{let t=r.index;return g(De(e),t)},De=e=>{let t=v(),n=d(t),i=(t,r)=>({kind:`Operator`,name:t,params:r,...Te(),isLocal:e,isRecursive:u(t),location:n});if(t.kind===`Identifier`&&v(1).kind===`Operator`&&ec.has(v(1).text)&&v(2).kind===`Identifier`&&C(`==`,3)){let e=D(),t=w().text,n=D();return E(`==`),i(t,[{name:e,arity:0},{name:n,arity:0}])}let a=t.kind===`Operator`&&t.text===`-.`,o=t.kind===`Identifier`&&tc.has(v(1).text)&&C(`==`,2);if(a||o){let e=a?t.text:v(1).text;r.index+=a?1:2;let n=a?D():t.text;return E(`==`),i(e,[{name:n,arity:0}])}let s=D();if(T(`[`)){let t=ce(()=>de());return E(`]`),E(`==`),{kind:`Function`,name:s,bounds:t,body:N(),isLocal:e,isRecursive:u(s),location:n}}let c=r.index,l=we();return E(`==`),C(`INSTANCE`)?{...Oe(s,l,e,n),definitionRange:h(c)}:i(s,l)},Oe=(e,t,n,i)=>{let a=r.index;return E(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:D(),substitutions:T(`WITH`)?O(()=>{let e=w().text;return E(`<-`),{name:e,expression:j()}}):[],isLocal:n,location:i,instanceRange:h(a)}},ke=()=>{let e=d(v());if(C(`_`)&&v(1).kind===`Operator`)return w(),{name:w().text,arity:T(`_`)?2:1,location:e};if(v().kind===`Operator`&&C(`_`,1)){let t=w().text;return w(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=D();if(!T(`(`))return{name:t,arity:0,location:e};let n=O(()=>E(`_`));return E(`)`),{name:t,arity:n.length,location:e}},P=()=>O(ke),Ae=()=>{let e=P();return e.forEach(e=>i[i.length-1].add(e.name)),e},F=e=>{let t={value:0,offset:e};do{let e=v(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&vc.has(e.text)&&t.value++,e.kind===`Operator`&&yc.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},je=()=>{let e=v(),t=v(1);return e.kind===`Identifier`?C(`(`,1)||C(`[`,1)?C(`==`,F(1)):t.kind===`Operator`&&tc.has(t.text)?C(`==`,2):t.kind===`Operator`&&ec.has(t.text)?v(2).kind===`Identifier`&&C(`==`,3):C(`==`,1):C(`-.`)&&t.kind===`Identifier`&&C(`==`,2)},Me=[],I=()=>Me[Me.length-1]??-1,Ne=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),L=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},Pe=e=>!e.text.endsWith(`.`)&&!mc.has(L(e)),Fe=e=>{let t=L(e);if(mc.has(t))return;let n=Ne(e);if(n>=0)return`<${n}>${t}`;let r=I(),i=Me[Me.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Ie=e=>{if(e.kind===`Keyword`)return dc.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Me.length===0;if(e.text[1]===`+`||Me.length===0)return!0;let t=I();return t>=0&&Ne(e)>t},Le=e=>{let t=Ne(e),n=Me.length-1,r=Me[n-1]??-1,i=Me[n]<0;return i&&(Me[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Me[n]===t},Re=e=>!a.has(e)&&l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),ze=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!bc.has(e.name)&&!Re(e.name):!1,Be=()=>{let e=v();return e.kind===`Step`?Pe(e):e.kind===`Keyword`?hc.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!je()},Ve=()=>{let e=r.index;s.index=e;let t=v();return t.kind===`Operator`&&!rc.has(t.text)&&oc(t.text)?(r.index++,g({kind:`OperatorReference`,operator:t.text,location:d(t)},e)):T(`MODULE`)?g({kind:`ModuleFact`,name:D(),location:d(t)},e):N()},He=e=>o[o.length-1]?.add(e),Ue=e=>{o.push(/* @__PURE__ */ new Set);let t=e();return o.pop(),t},We=e=>o.some(t=>t.has(e))||l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),Ge=()=>{let e=r.index,t=v(),n=O(()=>{let e=v();if((e.kind!==`Identifier`||x(e))&&e.kind!==`Operator`)throw ae(`Expected a definition name but found ${y(e)}`,e);return r.index++,e.text},`!`),i=d(t);return g(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:i}:{kind:`Identifier`,name:n.join(`!`),location:i},e)},Ke=()=>{if(t)return O(Ge);let e=O(Ve),n=e.find(e=>e.kind===`Identifier`&&We(e.name));if(n)throw S(`DEF clause entry should describe a defined operator`,n.location);return e},qe=()=>({facts:Be()?O(Ve):[],defs:T(`DEF`)||T(`DEFS`)?Ke():[]}),Je=()=>{let e=r.index,n=w(),i=n.text===`USE`&&T(`ONLY`),a=h(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:i,...qe(),keyword:a,location:d(n)},s=o.kind===`Hide`&&!t?o.facts.find(e=>!ze(e)):void 0;if(s)throw S(`The only expression allowed as a fact in a HIDE is the name of a theorem, assumption, or step`,s.location);return g(o,e)},Ye=()=>{let e=r.index,t=d(v()),n=T(`NEW`),i=v().kind===`Keyword`?gc.get(v().text):void 0;if(!n&&i===void 0)throw ae(`Expected a declaration but found ${y(v())}`);if(i!==void 0&&w(),i===`Variable`){let n=D();return He(n),g({kind:`NewSymbol`,name:n,arity:0,level:i,set:void 0,location:t},e)}let a=ke();He(a.name);let o=(i??`Constant`)===`Constant`&&C(`\\in`);if(o&&a.arity>0)throw S(`declared symbol with arguments before \\in`);return o&&w(),g({kind:`NewSymbol`,name:a.name,arity:a.arity,level:i??`Constant`,set:o?N():void 0,location:t},e)},Xe=()=>{let e=r.index,t=d(E(`ASSUME`)),n=O(()=>C(`ASSUME`)?Ue(Xe):v().kind===`Keyword`&&_c.has(v().text)?Ye():N());return E(`PROVE`),g({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)},Ze=e=>{let t={value:0};for(;v(t.value).kind===`Identifier`&&C(`,`,t.value+1);)t.value+=2;return v(t.value).kind===`Identifier`&&C(e,t.value+1)},Qe=(e,t)=>{e.forEach(He),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(He))},$e=()=>{let e=v();if(C(`USE`)||C(`HIDE`))return Je();if(C(`INSTANCE`))return g(Oe(void 0,[],!1,d(e)),r.index);if(C(`DEFINE`)||je()){let t=r.index;T(`DEFINE`);let n=[Ee(!1)];for(;je();)n.push(Ee(!1));let i={kind:`Define`,definitions:n,location:d(e)};return g(i,t)}if(T(`HAVE`))return{kind:`Have`,expression:N()};if(T(`TAKE`)){let e=k(),t=e?[]:O(D),n=e?de():[];return Qe(t,n),{kind:`Take`,names:t,bounds:n}}if(T(`WITNESS`))return{kind:`Witness`,expressions:O(()=>N())};if(T(`PICK`)){let e=Ze(`:`),t=e?O(D):[],n=e?[]:de();return Qe(t,n),E(`:`),{kind:`Pick`,names:t,bounds:n,body:N()}}return T(`CASE`)?{kind:`Case`,expression:N()}:{kind:`Assert`,isSuffices:T(`SUFFICES`),statement:C(`ASSUME`)?Xe():N()}},et=e=>{let t=v();if(t.kind!==`Step`)throw ae(`Expected a step number but found ${y(t)}`,t);if(!Le(t))throw S(`${e?`QED step`:`step`}'s number has bad level`,t);if(Ne(t)<0&&Fe(t)!==void 0)throw S(`<*> and <+> cannot be used for a named step`,t);return r.index++,{name:Fe(t),token:t.text,location:d(t)}},tt=()=>{let e=r.index,t=et(C(`QED`,1)),n=/* @__PURE__ */ new Set;o.push(n);let i=T(`QED`)?{kind:`Qed`}:$e(),a=h(e),s=Ie(v());if(s&&!fc.has(i.kind))throw S(`Proof of a step that does not take a proof`);let c=s?rt():void 0;return o.pop(),(i.kind!==`Assert`||i.isSuffices)&&n.forEach(He),g({...t,body:i,head:a,proof:c},e)},nt=()=>{let e=d(v());if(C(`BY`)||C(`PROOF`)&&C(`BY`,1)){T(`PROOF`),w();let t=h(r.index-1);return{kind:`By`,isOnly:T(`ONLY`),...qe(),keyword:t,location:e}}let t=v(+!!C(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){T(`PROOF`),w();let n=h(r.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}T(`PROOF`);let n=[tt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(tt());return{kind:`Steps`,level:I(),steps:n,location:e}},rt=()=>{let e=r.index;Me.push(-1);let t=Ue(nt);return Me.pop(),g(t,e)},it=e=>{let t=r.index,n=w(),i=v().kind===`Identifier`&&C(`==`,1)?D():void 0;i!==void 0&&(a.add(i),w());let o=Ue(()=>({statement:C(`ASSUME`)?Xe():N(),proof:Ie(v())?rt():void 0})),s=o.statement,c=g({name:i,statement:s,proof:o.proof,location:d(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:d(n)},t))},at=()=>{let e=r.index;return g(ot(),e)},ot=()=>{let e=w(),t=d(e),n=e.text===`AXIOM`;if(v().kind===`Identifier`&&C(`==`,1)){let e=D();return a.add(e),w(),{name:e,expression:N(),isAxiom:n,location:t}}return{name:void 0,expression:N(),isAxiom:n,location:t}},st=()=>{let e=d(E(`----`));E(`MODULE`);let t=D();E(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(l.push(n),i.push(/* @__PURE__ */ new Set),T(`EXTENDS`)&&O(()=>{let e=r.index;n.extends.push(D()),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}}),l.pop(),i.pop(),n;if(o.kind===`Separator`){if(C(`MODULE`,1)){let e=st();n.modules.push(e),n.units.push({kind:`Module`,module:e}),E(`====`);continue}w()}else{switch(o.text){case`CONSTANT`:case`CONSTANTS`:{w();let e=P();n.constants.push(...e),n.units.push({kind:`Constants`,declarations:e});continue}case`VARIABLE`:case`VARIABLES`:{w();let e=O(()=>{let e=r.index,t=d(v());return g({name:D(),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=at();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=Je();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:w(),n.units.push({kind:`Recursive`,declarations:Ae()});continue;case`INSTANCE`:ct(n,g(Oe(void 0,[],!1,d(o)),a));continue;case`LOCAL`:if(w(),C(`INSTANCE`)){ct(n,g(Oe(void 0,[],!0,d(o)),a));continue}ct(n,Ee(!0));continue}o.kind===`Keyword`&&uc.has(o.text)?it(n):ct(n,Ee(!1))}}},ct=(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 st()},wc=e=>Cc(e,!1),Tc=e=>Cc(e,!0),Ec=25214903917n,Dc=(1n<<48n)-1n,Oc=2147483647,kc=e=>{let t={value:(BigInt.asUintN(64,e)^Ec)&Dc},n=e=>(t.value=t.value*Ec+11n&Dc,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Ec)&Dc},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<=Oc)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Ac=10454148508367108822n,jc=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Ac);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Mc=Int32Array.from(jc,e=>Number(BigInt.asIntN(32,e>>32n))),Nc=Int32Array.from(jc,e=>Number(BigInt.asIntN(32,e))),Pc=Number(BigInt.asIntN(32,Ac>>32n)),Fc=Number(BigInt.asIntN(32,Ac));let Ic=Pc,Lc=Fc;const Rc=e=>{let t=(e^Lc)&255;Lc=(Lc>>>8|Ic<<24)^Nc[t],Ic=Ic>>>8^Mc[t]},zc=e=>{for(let t=0;t<32;t+=8)Rc(e>>>t)},Bc=e=>{if(typeof e==`boolean`)Rc(0),Rc(e?116:102);else if(typeof e==`number`)Rc(1),zc(e);else if(typeof e==`string`){Rc(3),zc(e.length);for(let t=0;t<e.length;t++)Rc(e.charCodeAt(t))}else if(M(e))Rc(21),zc(P(e.name)+1);else if(j(e)){let t=H(e);Rc(9),zc(t.domain.length);for(let e=0;e<t.domain.length;e++)Bc(t.domain[e]),Bc(t.range[e])}else{let t=B(e).elements;Rc(5),zc(t.length);for(let e of t)Bc(e)}},Vc=e=>{let t={high:Ic,low:Lc};Ic=Pc,Lc=Fc;for(let t of e)Bc(t);let n=BigInt(Ic>>>0)<<32n|BigInt(Lc>>>0);return Ic=t.high,Lc=t.low,n},Hc=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+Hc(n)+Hc(t.range[r]),5)}return B(e).elements.reduce((e,t)=>e+Hc(t),5)},Uc=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Ic=n<32?0:1<<n-32,Lc=n<32?1<<n:0;for(let t=0;t<e;t++)Rc(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]^Ic,t[n+1]=t[a+1]^Lc}}return t},Wc=(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=Hc(e);return Ic=0,Lc=0,Bc(e),r.set(e,i.length),i.push(n,Ic,Lc),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=Uc(e);return n.set(e,r),r};return(n,r)=>{let s={high:Ic,low:Lc},c={high:Pc,low:Fc};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}Ic=s.high,Lc=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},Gc=[],Kc=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},qc=()=>{for(let e=1277011;Gc.length<1341;e++)Kc(e)&&Gc.push(e);return Gc},Jc=e=>{let t=qc(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Yc=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},Xc=e=>{for(let t=Math.max(e,9);;t++){let e=Yc(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)}}},Zc=(e,t,n)=>{if(t<=0)return[];let r=Xc(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Jc(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Qc=(1n<<63n)-1n-24n,$c=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Qc*BigInt(n)+i)%t;return r<0n?r+t:r})},el=(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,tl=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Dt(e.domain),n=B(e.range).elements;return{lists:t.map(()=>n),create:e=>Le(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>B(e).elements),create:t=>kt(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>B(e).elements),create:R}}},nl=(e,t,n)=>{if(V(t))return[];if(typeof t==`object`&&t.kind===`Interval`)return Zc(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let r=tl(t);if(r){let t=r.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Oc)?$c(e,t,n):Zc(e,Number(t),n)).map(e=>r.create(el(r.lists,e)))}let i=B(t).elements;return Zc(e,i.length,n).map(e=>i[Number(e)])},rl=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new u(`RandomElement of the empty set`);return n},il=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Dt(e.domain)];return Le(n,n.map(()=>il(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return kt(e.names.map((n,r)=>[n,il(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return R(e.factors.map(e=>il(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 u(`RandomElement of the empty set`);return e.low+r}return rl(B(e).elements,t)},al=(e,t=0n)=>{let n=kc(t),r={random:kc(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>kt([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Vc,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},ol=e=>yt([...e.possibleCounts].map(([e,t])=>[e,t])),sl=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,ol(e)]]),cl=(e,t,n)=>new d(`Applying ${e} to the following value,\nwhich is not ${t}:\n${U(n)}`),ll=(e,t,n,r)=>new d(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${U(r)}`),ul=e=>j(e)?H(e):void 0,dl=(e,t,n)=>{let r=G(e,t,n),i=ul(r);if(!i)throw cl(n,`a function with a finite domain`,r);return i},fl=(e,t,n)=>{let r=G(e,t,n),i=ul(r);if(!i)throw ll(t===0?`first`:`second`,n,`bag`,r);return i},pl=(e,t)=>{if(!A(e)||!z(e))throw t();return B(e).elements},ml=e=>e.range.every(e=>typeof e==`number`&&e>0),hl=(e,t)=>{let n=e.domain.findIndex(e=>Re(e,t));return n===-1?void 0:e.range[n]},gl=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,_l=gl(`BagDiff`,`tlc2.value.impl.Value`,2),vl=gl(`SqSubseteq`,`tlc2.value.IBoolValue`,2),yl=gl(`BagUnion`,`tlc2.value.impl.Value`,1),bl=gl(`BagOfAll`,`tlc2.value.impl.Value`,2),xl=gl(`BagCup`,`tlc2.value.impl.Value`,2),Sl=gl(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Cl=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${dr(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')`)},wl=(e,t,n)=>{let r=Cl(e,n)+Cl(t,n);if(or(r))throw sr(`${e}+${t}`);return r},Tl=(e,t,n,r)=>{let i=hl(n,e.domain[t]),a=Cl(e.range[t],r);return i===void 0?a:a-Cl(i,r)|0},El=(e,t)=>yt(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Re(e[0],r));a?a[1]=wl(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Dl=Le([],[]),Ol=[nr(`EmptyBag`,Dl),K(`IsABag`,1,e=>{let t=ul(G(e,0,`IsABag`));return t!==void 0&&ml(t)}),K(`BagCardinality`,1,e=>{let t=G(e,0,`BagCardinality`);return dl(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw cl(`BagCardinality`,`a bag`,t);return wl(e,n,Sl)},0)}),K(`BagIn`,2,e=>{let t=G(e,1,`BagIn`),n=hl(dl(e,1,`BagIn`),G(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw ll(`second`,`BagIn`,`bag`,t);return n>0}),K(`CopiesIn`,2,e=>{let t=G(e,1,`CopiesIn`),n=hl(dl(e,1,`CopiesIn`),G(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw ll(`second`,`CopiesIn`,`bag`,t);return n}),K(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=fl(e,t,`(+)`);if(!ml(n))throw ll(t===0?`first`:`second`,`(+)`,`bag`,G(e,t,`(+)`));return n});return El(t,xl)}),K(`\\ominus`,2,e=>{let t=fl(e,0,`(-)`),n=fl(e,1,`(-)`);return yt(t.domain.flatMap((e,r)=>{let i=Tl(t,r,n,_l);return i>0?[[e,i]]:[]}))}),K(`BagUnion`,1,e=>{let t=G(e,0,`BagUnion`),n=pl(t,()=>cl(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??Dl;let r=n.map(e=>{let n=ul(e);if(!n)throw new d(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${U(t)}`);return n});return El(r,yl)}),K(`\\sqsubseteq`,2,e=>{let t=dl(e,0,`\\sqsubseteq`),n=dl(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Tl(t,r,n,vl)<=0)}),rr(`BagOfAll`,2,e=>{let t=tr(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new d(`The first argument of BagOfAll should be an operator, but instead it is:\n${U(t.literalBody)}`);let n=G(e,1,`BagOfAll`),r=ul(n);if(!r)throw ll(`second`,`BagOfAll`,`function with a finite domain`,n);return El(r.domain.map((e,n)=>Le([t.call([e])],[r.range[n]])),bl)}),K(`SubBag`,1,e=>{let t=G(e,0,`SubBag`);if(!j(t))throw new u(`DOMAIN expects a function but received ${U(t)}`);let n=H(t),r=pt(n.range).elements,i=r.find(e=>typeof e!=`number`);if(i!==void 0){let e=typeof r[0]!=`number`;throw new u(`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 u(`Attempted to apply a function to ${U(n)}, which is not in its domain`);return pt(n.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:a[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Le(e.map(e=>e[0]),e.map(e=>e[1]))))}),K(`BagToSet`,1,e=>mn(dl(e,0,`BagToSet`))),K(`SetToBag`,1,e=>{let t=G(e,0,`SetToBag`),n=pl(t,()=>cl(`BagToSet`,`a function with a finite domain`,t));return Le([...n],n.map(()=>1))})],kl=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Al=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,jl=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Ml=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Nl=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Pl=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Fl=e=>{if(!j(e))return!1;let t=H(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Il=(e,t)=>pr(e,`Cannot convert value: unsupported value type tlc2.value.impl.${dr(t)}`),Ll=(e,t)=>pr(e,`Cannot cast tlc2.value.impl.${dr(t)} to tlc2.value.impl.StringValue`),Rl=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),zl=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Il(t,e);return`[${B(e).elements.map(e=>Vl(e,t)).join(`,`)}]`},Bl=(e,t)=>{let n=H(e),r=Xt(n);return r?`[${r.map(e=>Vl(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Rl(typeof e==`string`?e:U(e))}:${Vl(n.range[r],t)}`).join(`,`)}}`},Vl=(e,t)=>typeof e==`string`?Rl(e):typeof e==`object`?e.kind===`ModelValue`?Rl(e.name):A(e)?zl(e,t):Bl(e,t):String(e),Hl=e=>{if(A(e))return zl(e,kl);if(!j(e)||Fl(e))throw Il(kl,e);return Bl(e,kl)},Ul=e=>{if(!j(e))throw Il(Al,e);return Bl(e,Al)},Wl=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))},Gl=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Oe(e);if(Array.isArray(e))return R(e.map(e=>Gl(e,t)));if(typeof e==`object`&&e)return kt(Object.entries(e).map(([e,n])=>[Oe(e),Gl(n,t)]));throw pr(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Kl=(e,t)=>{if(e.trim()===``)return Gl(null,t);try{return Gl(JSON.parse(e,(e,t,n)=>typeof t==`number`?Wl(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?pr(t,e.message):e}},ql=(e,t)=>{if(typeof e!=`string`)throw Ll(t,e);return e},Jl=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw pr(n,`${t} (No such file or directory)`);return r},Yl=e=>[ir(`ToJson`,1,e=>Oe(Vl(G(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),ir(`ToJsonArray`,1,e=>Oe(Hl(G(e,0,`ToJsonArray`)))),ir(`ToJsonObject`,1,e=>Oe(Ul(G(e,0,`ToJsonObject`)))),ir(`JsonSerialize`,2,t=>{let n=ql(G(t,0,`JsonSerialize`),jl),r=G(t,1,`JsonSerialize`);if(!Xt(r)&&!Fl(r))throw new d(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${U(r)}`);return e.writeFile?.(n,Vl(r,jl)),!0}),ir(`ndJsonSerialize`,2,t=>{let n=ql(G(t,0,`ndJsonSerialize`),Ml),r=G(t,1,`ndJsonSerialize`),i=Xt(r);if(!i)throw new d(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${U(r)}`);return e.writeFile?.(n,i.map(e=>`${Vl(e,Ml)}\n`).join(``)),!0}),ir(`JsonDeserialize`,1,t=>{let n=ql(G(t,0,`JsonDeserialize`),Nl);return Kl(Jl(e,n,Nl),Nl)}),ir(`ndJsonDeserialize`,1,t=>{let n=ql(G(t,0,`ndJsonDeserialize`),Pl);return R(Jl(e,n,Pl).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Kl(e,Pl)))})],Xl=(e,t,n,r)=>new d(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),Zl=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Xl(t,n,`nonnegative integer`,U(e));return e},Ql=(e,t,n,r)=>{if(!A(e)||!z(e))throw Xl(t,n,r,U(e));return B(e).elements},$l=(e,t,n,r)=>pt(Array.from({length:t},()=>pt(e.filter(()=>r.nextDouble()<n)))),eu=(e,t)=>{let n=`RandomSetOfSubsets`,r=Zl(G(e,0,n),`first`,n),i=Zl(G(e,1,n),`second`,n),a=Ql(G(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw Xl(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw Xl(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return $l(a,r,a.length===0?0:i/a.length,t.getRandom())},tu=e=>[ir(`RandomSubset`,2,t=>{let n=G(t,0,`RandomSubset`);if(typeof n!=`number`)throw Xl(`first`,`RandomSubset`,`nonnegative integer`,U(n));if(n<0)throw new u(`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=G(t,1,`RandomSubset`);if(!A(r)||!V(r)&&!z(r))throw Xl(`second`,`RandomSubset`,`a finite set`,U(r));return pt(nl(n,r,e.getRandom()))}),ir(`RandomSetOfSubsets`,3,t=>eu(t,e)),ir(`TestRandomSetOfSubsets`,3,t=>R(Array.from({length:5},()=>B(eu(t,e)).elements.length)))],nu=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,ru=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${nu})`,iu=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${nu}) throws java.io.IOException`,au=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${nu})`,ou=()=>kt([[`action`,pt([])],[`state`,pt([])]]),su=()=>kt([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),cu=e=>kt([[`name`,e??`UnnamedAction`],[`location`,su()]]),lu=(e,t)=>{let n=e.map((e,t)=>R([t+1,kt(Object.entries(e.state))])),r=n.slice(1).map((t,r)=>R([n[r],cu(e[r+1].action),t])),i=t?[R([n[n.length-1],cu(t.action),n[t.start]])]:[];return kt([[`action`,pt([...r,...i])],[`state`,pt(n)]])},uu=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return sl(e).get(t)},du=(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),U(r));else throw new d(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${U(n)}`)},fu=e=>e.every(e=>e!==void 0),pu=(e,t)=>kt(t.variables.map((t,n)=>[t,e[n]])),mu=(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&&!W(e)){if(t.variableIndex.has(r))return!0;let e=co(r,t);if(e&&!n.has(e)&&(n.add(e),mu(e.body,t,n)))return!0}return Un(e).some(e=>mu(e,t,n))},hu=(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[K(`AssertEq`,2,t=>{let n=G(t,0,`AssertEq`),r=G(t,1,`AssertEq`),i=Re(n,r);return i||(e(U(`Assertion failed`,!0)),e(U(n,!0)),e(U(r,!0))),i}),br(`AssertError`,2,e=>{let t=tr(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw pr(ru,`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=xr(e,0,`AssertError`)();try{xr(e,1,`AssertError`)()}catch(e){if(e instanceof u)return e.message===n;throw e}return!1}),ir(`TLCGetOrDefault`,2,e=>{let n=G(e,0,`TLCGetOrDefault`);return uu(t,n)??G(e,1,`TLCGetOrDefault`)}),{...rr(`TLCGetAndSet`,4,n=>{let r=G(n,0,`TLCGetAndSet`),i=uu(t,r)??G(n,3,`TLCGetAndSet`),a=tr(n,1,`TLCGetAndSet`);return du(t,e,r,a.call([i,G(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},ir(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!fu(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw pr(iu,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return R(t.getBehavior(r).map(e=>pu(e,n.environment)))}),ir(`CounterExample`,0,()=>t.counterExample??ou()),K(`ToTrace`,1,e=>{let t=G(e,0,`ToTrace`);if(!j(t)||!Re(mn(t),pt([`action`,`state`])))throw new u(`The argument of ToTrace should be a CounterExample, but instead it is:\n${U(t)}`);let n=B(fn(t,`state`)).elements.map(e=>Xt(e)??[]);return R(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),K(`TLCModelValue`,1,e=>{let t=G(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new d(`The argument of ModelValue should be a string, but instead it is:\n${U(t)}`);return Fe(t)}),br(`TLCDefer`,1,()=>!0),K(`TLCNoOp`,1,e=>G(e,0,`TLCNoOp`)),br(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!fu(r))throw pr(au,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||so(xr(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new h(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),br(`TLCCache`,2,(e,t)=>{let r=tr(e,0,`TLCCache`),a=Mn(xr(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=mu(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}),K(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Vc([G(e,0,`TLCFP`)])))),ir(`TLCEvalDefinition`,1,(e,t)=>{let n=G(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?co(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new d(`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 d(`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)})]},gu=(e,t)=>[ir(`_Track`,2,e=>{let n=String(G(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,G(e,0,`_Track`)===!0?r+1:r),!0}),ir(`_Counts`,0,()=>ol(t)),ir(`_CheckName`,1,n=>{let r=String(G(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(U(ol(t),!0)),!1)}),ir(`_PrintCounts`,0,()=>(e(U(ol(t),!0)),!0))],_u=e=>String(e).padStart(2,`0`),vu=e=>`${e.getUTCFullYear()}.${_u(e.getUTCMonth()+1)}.${_u(e.getUTCDate())}.${_u(e.getUTCHours())}${_u(e.getUTCMinutes())}${_u(e.getUTCSeconds())}`,yu=e=>yt([...e].map(([e,t])=>[e,R([t])])),bu=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),xu=(e,t,n)=>{if(!e.isStarted&&bu.has(t))throw new u(`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 kt([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return kt([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return kt([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Oe(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Oe(vu(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return cu(void 0);case`all`:return yu(e.registers);case`all:named`:return yu(sl(e))}if(t.startsWith(`s:`)){let n=sl(e).get(t);if(n===void 0)throw new u(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Oe(e.properties.get(t.slice(2))??t);throw new u(`TLCGet(${t}) was undefined.`)},Su=e=>e.length===0?[[]]:e.flatMap((t,n)=>Su([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Cu=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&B(e).elements.forEach(Cu),e.kind===`Function`&&e.range.forEach(Cu))},wu=(t,n)=>[K(`Print`,2,e=>(t(`${fe(U(G(e,0,`Print`),!0,!0))} ${fe(U(G(e,1,`Print`),!0,!0))}`),G(e,1,`Print`))),K(`PrintT`,1,e=>(t(fe(U(G(e,0,`PrintT`),!0,!0))),!0)),K(`Assert`,2,t=>{if(G(t,0,`Assert`)!==!0)throw new d(`The first argument of Assert evaluated to FALSE; the second argument was:\n${fe(U(G(t,1,`Assert`)))}`,e.assertViolation);return!0}),K(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),K(`:>`,2,e=>yt([[G(e,0,`:>`),G(e,1,`:>`)]])),K(`@@`,2,e=>{let t=er(e,0,`@@`),n=er(e,1,`@@`);return bt([...ve(t),...ve(n)])}),K(`ToString`,1,e=>Oe(U(G(e,0,`ToString`),!0))),K(`TLCEval`,1,e=>{let t=G(e,0,`TLCEval`);return Cu(t),t}),K(`Permutations`,1,e=>{let t=Qn(e,0,`Permutations`);return pt(Su(t).map(e=>yt(t.map((t,n)=>[t,e[n]]))))}),rr(`SortSeq`,2,e=>{let t=tr(e,1,`SortSeq`);return R($n(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)]},[]))}),ir(`TLCGet`,1,(e,t)=>{let r=G(e,0,`TLCGet`);if(typeof r==`number`&&r>=0){let e=n.registers.get(r);if(e===void 0)throw new u(`TLCGet(${r}) was undefined.`);return e}if(typeof r!=`string`)throw new u(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${U(r)}`);return xu(n,r,t?.state)}),ir(`TLCSet`,2,e=>{let r=G(e,0,`TLCSet`);return du(n,t,r,G(e,1,`TLCSet`)),!0}),nr(`Any`,I),K(`RandomElement`,1,e=>il(Xn(e,0,`RandomElement`),n.getRandom()))],Tu=/* @__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(`,`),Eu=[[`\\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(`,`),Ou=/* @__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(`.`),ku=/* @__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(`.`),Au=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
149
+ =============================================================================`,wd=/* @__PURE__ */ new Map([[`Reals`,xd],[`RealTime`,Sd],[`Toolbox`,Cd]]),Td=`tlc2/value/impl/`,Ed=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)}},Dd=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Od=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],kd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Dd.get(e[3])}${`[]`.repeat(e[1].length)}`),Ad=(e,t)=>e[e[t].first].text,jd=(e,t)=>Ad(e,t).replaceAll(`/`,`.`),Md=e=>{let t=Ed(e);if(t.readUint32()!==3405691582)throw new u(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===1?a.text=i.decode(t.readBytes(t.readUint16())):r===3?a.value=t.readInt32():r===4?t.readUint32():r===5||r===6?(t.readBytes(8),e++):r===7||r===8||r===16||r===19||r===20?a.first=t.readUint16():r===15?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=jd(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=kd(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:Ed(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>jd(n,d.readUint16())):[],p=Od.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=kd(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},Nd=(e,t)=>{let n=e[t],r=e[n.second];return{className:Ad(e,n.first),name:e[r.first].text}},Pd=(e,t,n,r)=>{let i=()=>new C(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===3)return n.value;if(n.tag===8)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=2&&n<=8)o.push(n-3),e+=1;else if(n===16)o.push(a[e+1]<<24>>24),e+=2;else if(n===17)o.push(l()<<16>>16),e+=3;else if(n===18)o.push(c(a[e+1])),e+=2;else if(n===19)o.push(c(l())),e+=3;else if(n===89){let t=s();o.push(t,t),e+=1}else if(n===178){let n=Nd(t,l());if(n.className!==`${Td}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=Nd(t,l()),a=s();if(n.className!==`${Td}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:Ad(t,l()),value:void 0}),e+=3;else if(n===183){let n=Nd(t,l()),a=s(),o=s();if(!(n.className===`${Td}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()},Fd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Md(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:Pd(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},Id=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),Ld=[[`\\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`,`≀`],[`^+`,`⁺`]],Rd=/* @__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(`,`),zd=/* @__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(`.`),Bd=/* @__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(`.`),Vd=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
94
150
  Nat == { }
95
151
  a+b == {a, b}
96
152
  a-b == CHOOSE n : b + n = a
@@ -406,16 +462,18 @@ _CheckName(name) ==
406
462
  => (PrintT(counts) /\\ FALSE)
407
463
  _PrintCounts == PrintT(_Counts)
408
464
  =============================================================================
409
- `]]),ju=/* @__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)`]])]]),Mu=(e,t)=>e.every(e=>$t(e,t)),Nu=pt([!1,!0]),Pu=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return vt(Pu(e,t,r),Pu(e,r,n))},Fu=[`\\cup`,`\\cap`,`\\`],Iu=e=>typeof e==`object`&&e.kind===`MixedSet`,Lu=e=>e.kind===`Interval`?B(e).elements:e.elements,Ru=(e,t,n)=>{let r=Lu(t);if(e!==`\\cup`){let t=e===`\\cap`;return mt(r.filter(e=>$t(e,n)===t))}if(r.length===0)return n;if(!pe(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=B(n).elements.filter(e=>!$t(e,t));return mt([...r,...i])},zu=[nr(`TRUE`,!0),nr(`FALSE`,!1),nr(`BOOLEAN`,Nu),nr(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ar(`=`,dt),ar(`#`,(e,t)=>!dt(e,t)),K(`~`,1,e=>!Jn(e,0,`~`)),K(`<=>`,2,e=>Jn(e,0,`<=>`)===Jn(e,1,`<=>`)),K(`/\\`,2,e=>Jn(e,0,`/\\`)&&Jn(e,1,`/\\`)),K(`\\/`,2,e=>Jn(e,0,`\\/`)||Jn(e,1,`\\/`)),K(`=>`,2,e=>!Jn(e,0,`=>`)||Jn(e,1,`=>`)),K(`\\in`,2,e=>$t(G(e,0,`\\in`),G(e,1,`\\in`))),K(`\\notin`,2,e=>!$t(G(e,0,`\\notin`),G(e,1,`\\notin`))),K(`\\subseteq`,2,e=>{let t=Yn(e,0,`\\subseteq`),n=Yn(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&z(t.base)?Mu(B(t.base).elements,n.base):Mu(B(t).elements,n)}),...Fu.map(e=>K(e,2,t=>{let n=Yn(t,0,e),r=Yn(t,1,e);return pe(n)&&pe(r)&&!Iu(n)&&!Iu(r)?e===`\\cup`&&V(n)?r:(e===`\\cup`?vt:e===`\\cap`?_t:gt)(B(n),B(r)):pe(n)?Ru(e,n,r):e!==`\\`&&pe(r)?Ru(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),K(`SUBSET`,1,e=>({kind:`Subset`,base:Yn(e,0,`SUBSET`)})),K(`UNION`,1,e=>{let t=Yn(e,0,`UNION`),n=$e(t)?t.elements.filter($e):[];if(!$e(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(Iu(t)||n.some(Iu)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{$t(t,e)||e.elements.push(t)})),mt(e.elements)}return n.length===0?ht:Pu(n.map(B),0,n.length)}),K(`DOMAIN`,1,e=>{let t=G(e,0,`DOMAIN`);if(!j(t))throw new u(`DOMAIN expects a function but received ${U(t)}`);return mn(t)})],Bu=gr(`DotDot`,`IntervalValue`,2),Vu=gr(`Neg`,`IntValue`,1),Hu=[nr(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),_r(`+`,`Plus`,(e,t)=>e+t),_r(`-`,`Minus`,(e,t)=>e-t),_r(`*`,`Times`,(e,t)=>e*t),_r(`^`,`Expt`,(e,t)=>{if(t<0)throw new d(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new d(`0^0 is undefined.`);return e**t}),_r(`\\div`,`Divide`,(e,t)=>{if(t===0)throw new d(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(or(n))throw sr(`${e} \\div ${t}`);return n}),_r(`%`,`Mod`,(e,t)=>{if(t<=0)throw new d(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),yr(`<`,(e,t)=>e<t),yr(`>`,(e,t)=>e>t),yr(`<=`,(e,t)=>e<=t),yr(`>=`,(e,t)=>e>=t),K(`..`,2,e=>({kind:`Interval`,low:hr(G(e,0,`..`),Bu),high:hr(G(e,1,`..`),Bu)}))],Uu=[nr(`Int`,{kind:`InfiniteSet`,name:`Int`}),K(`-.`,1,e=>{let t=hr(G(e,0,`-`),Vu);if(or(-t))throw sr(`-${t}`);return-t})],Wu=(e,t,n)=>{let r=G(e,t,n),i=Xt(r);if(!i)throw new d(`${n}\n${U(r)}`);return i},Gu=(e,t,n)=>{let r=G(e,t,n);return typeof r==`string`?r:Wu(e,t,n)},Ku=(e,t,n)=>typeof e==`string`?Oe(e.slice(t,n)):R(e.slice(t,n)),qu=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Ju=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Yu=(e,t)=>{let n=ju.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?mr(e,t):e}):t},Xu=Yu(`Sequences`,[K(`Seq`,1,e=>({kind:`SequenceSet`,base:G(e,0,`Seq`)})),K(`Len`,1,e=>Gu(e,0,qu(``,`Len`)).length),K(`\\o`,2,e=>{let t=Gu(e,0,Ju(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Wu(e,1,Ju(`t \\o s`,`sequence`));return R([...t,...n])}let n=G(e,1,`\\o`);if(typeof n!=`string`)throw new d(`${Ju(`t \\o s`,`string`)}\n${U(n)}`);return Oe(t+n)}),K(`Append`,2,e=>R([...Wu(e,0,Ju(`Append(s, v)`,`sequence`)),G(e,1,`Append`)])),K(`Head`,1,e=>{let t=Wu(e,0,qu(``,`Head`));if(t.length===0)throw new d(`Attempted to apply Head to the empty sequence.`);return t[0]}),K(`Tail`,1,e=>{let t=Gu(e,0,qu(``,`Tail`));if(t.length===0)throw new d(`Attempted to apply Tail to the empty sequence.`);return Ku(t,1)}),K(`SubSeq`,3,e=>{let t=Gu(e,0,qu(`first `,`SubSeq`)),n=qn(e,1,`SubSeq`),r=qn(e,2,`SubSeq`);if(n>r)return Ku(t,0,0);let i=n<1?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new d(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${U(G(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Ku(t,n-1,r)}),rr(`SelectSeq`,2,e=>{let t=tr(e,1,`SelectSeq`);return R(Wu(e,0,qu(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new d(`The second argument of SelectSeq should be a operator, but instead it is:\n${U(n)}`);return n}))})]),Zu=Yu(`FiniteSets`,[K(`IsFiniteSet`,1,e=>{let t=G(e,0,`IsFiniteSet`);if(A(t))return Jt(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new u(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${U(t)}\nis a finite set.`:`Attempted to check if the ${me(t)} ${U(t)} is a finite set.`)}),K(`Cardinality`,1,e=>{let t=G(e,0,`Cardinality`);if(!A(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new d(`Attempted to compute cardinality of the value\n${U(t)}`);return Kt(t)})]),Qu=/* @__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`]]]),$u=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:Hu};case`Integers`:return{extends:[`Naturals`],operators:Uu};case`Sequences`:return{extends:[],operators:Xu};case`FiniteSets`:return{extends:[],operators:Zu};case`TLC`:return{extends:[],operators:Yu(`TLC`,wu(t,n))};case`Randomization`:return{extends:[],operators:tu(n)};case`_Possible`:return{extends:[],operators:gu(t,n)};case`Json`:return{extends:[],operators:Yl(r)};case`Bags`:return{extends:[],operators:Ol};case`TLCExt`:return{extends:[],operators:hu(t,n)};default:return}},ed=`$subexpression`,td=(e,t)=>new c(`${e} at line ${t.line}, column ${t.column}`),nd=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),rd=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,id=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}},ad=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Wr(e.bounds),body:e.body,sets:nd(e.bounds)};case`SetMap`:return{names:Wr(e.bounds),body:e.expression,sets:nd(e.bounds)};case`SetFilter`:return{names:Ur(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ur(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}},od=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return od(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Un(e)){let e=od(r,t,n);if(e)return e}},sd=(e,t,n)=>e.length===0&&n.length>0?n.splice(0,t):e,cd=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),ld=(e,t)=>{let n=e.location,r=cd(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 td(`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 td(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:ed,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:ed,args:e.args,location:n,resolution:Nr},location:n}},ud=(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:Nr})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Nr}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Nr};return ld({...t,params:[...t.params,...r]},a)},dd=(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 td(`Expected an operator name`,n);o.push(c.name),s.push(...c.args);let l=o.join(`!`),u=i?i.find(e=>Ei(e)===l):t(l);if(u)return{definition:u,args:sd(s,Rr(u),r)};a.index++}throw td(`Unknown operator ${o.join(`!`)}`,n)},s=t=>{let r=o(t),s=r.definition,c=Rr(s),l=a.index===e.length-1;if(r.args.length!==c&&r.args.length!==0)throw td(`The operator ${s.name} requires ${c} arguments`,n);if(l)return{definition:s,args:r.args};if(s.kind!==`Operator`)throw td(`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&&od(a.current,t.name,[]);if(!o)throw td(`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(...sd(t.args,o.label.params.length,r)),a.current=o.label.body,a.index++}},l=t=>{let o=a.current;if(!o)throw td(`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`||rd(t.operand,1)!==0)throw td(`A LET/IN expression has only one operand`,n);i.lets.push(o.definitions),a.current=o.body;return}let s=ad(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(...sd(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[rd(t.operand,r.length)],s=e[a.index+1];if(!i||s?.kind!==`Operand`)throw td(`A subexpression of CASE must have the form !i!j`,n);a.index++;let c=rd(s.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw td(`Nonexistent CASE operand`,n);a.current=l;return}if(t.kind!==`Operand`)throw td(`Unexpected subexpression selector`,n);let c=s?s.sets:id(o),u=c?.[rd(t.operand,c.length)];if(!u)throw td(`Nonexistent operand specified by the selector`,n);a.current=u},u=s(void 0);if(u)return ud(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 td(`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 ud(e.definition,{...i,args:[...i.args,...e.args]});c()}else l(t),a.index++}if(!a.current)throw td(`Subexpression selection failed`,n);return ld(i,a.current)},fd=(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:[]}))]},pd=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Un(e).some(pd),md=(e,t)=>{if(!pd(e))return e;if(e.kind===`Let`){let n=n=>e.definitions.find(e=>e.name===n)??t(n);return ki(e,e=>md(e,n))}let n=ki(e,e=>md(e,t));if(n.kind===`Subexpression`)return dd(n.selectors,t,n.location,[]);let r=n.kind===`Identifier`?n.name:n.kind===`Apply`?n.operator:``,i=fd(r,t);if(!i)return n;let a=n.kind===`Apply`?[...n.args]:[],o=dd(i,t,n.location,a);if(a.length>0)throw td(`Too many arguments for ${r}`,n.location);return o},hd=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},gd=(e,t)=>{let n=hd(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({name:e.name,expression:md(e.expression,n)}))}},_d=(e,t)=>{let n=hd([...t,...e.definitions]);return e.definitions.some(e=>pd(e.body))||e.assumptions.some(e=>pd(e.expression))?{...e,definitions:e.definitions.map(e=>Oi(e,e=>md(e,n))),assumptions:e.assumptions.map(e=>({...e,expression:md(e.expression,n)}))}:e},vd=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}])),yd=(e,t)=>`${e}${t}`,bd=(e,t,n)=>`${e}${t}${n}`,xd=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}),wd=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Td=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Ed=(e,t,n,r)=>({...Cd(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Dd=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Od=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,kd=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,{...Ed(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Ad=Ed(`$Set`,0,[2],[1]),jd=Ed(`$Junction`,0,[3],[1]),Md=Ed(`$Choose`,0,[2],[1]),Nd=Ed(`$Function`,0,[3],[1]),Pd=Ed(`$FcnApply`,0,[2,2],[1,1]),Fd=Ed(`$RcdSelect`,0,[2,0],[1,1]),Id=Ed(`'`,2,[1],[0]),Ld=Ed(`ENABLED`,1,[2],[0]),Rd=Ed(`[]`,3,[3],[0]),zd=Ed(`$SquareAct`,2,[2,1],[0,0]),Bd=Ed(`$WF`,3,[1,2],[0,0]),Vd=Ed(`$TemporalExists`,3,[3],[0]),Hd=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Ud=e=>e.map(e=>({name:e,arity:0})),Wd=(e,t)=>new c(`${e} at line ${t.line}, column ${t.column}`),Gd=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Kd=e=>e.kind!==`Let`&&e.kind!==`Label`,qd=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=kd.get(t)??vd.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(bd(e,n,t))}),t.data.constraints.forEach((e,t)=>wd(r.constraints,t,e)),Td(r.argConstraints,yd(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Td(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>Dd(e,n))throw new c(`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 c(`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)=>Od(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)=>{Od(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)=>wd(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||wd(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>wd(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||wd(s.constraints,t,Dd(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=>wd(s.constraints,e,Dd(r,a)))}))}),e.argParams.forEach(e=>{let t=xd(e),n=a(t.operator)?.operator;n&&wd(s.constraints,t.param,Dd(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Td(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Td(s.argConstraints,yd(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Td(s.argConstraints,yd(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=xd(e),n=a(t.operator);n&&Td(s.argConstraints,yd(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(xd(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=xd(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(bd(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(bd(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(bd(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=g(`LAMBDA`,Ud(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=Hd(n,Ud(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},l=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Wd(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Wd(`Action used where only temporal formula or state predicate allowed`,e.location);Gd.has(e.operator)&&u(t,e.location)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Kd(n)&&n.kind!==r)throw Wd(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)=>wd(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Td(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 l(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),l(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 u(n,e.location),i(jd,n)}case`Prime`:case`Unchanged`:return s(Id,[e.expression],t);case`Enabled`:return s(Ld,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(Rd,[n])}case`If`:return s(jd,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(jd,[...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(jd,[e.body],t,e.bounds.map(e=>e.set),Wr(e.bounds));if(n.level===3&&e.bounds.some(e=>m(e.set,t).level===2))throw Wd(`Action-level bound of quantified temporal formula`,e.location);return n}case`UnboundedQuantifier`:return s(e.isTemporal?Vd:jd,[e.body],t,[],e.names);case`Choose`:return s(Md,[e.body],t,e.set?[e.set]:[],Ur(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(Ad,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(Ad,[e.predicate],t,[e.bound.set],Ur(e.bound.pattern));case`SetMap`:return s(Ad,[e.expression],t,e.bounds.map(e=>e.set),Wr(e.bounds));case`FunctionConstruction`:return s(Nd,[e.body],t,e.bounds.map(e=>e.set),Wr(e.bounds));case`Record`:return s(Nd,e.fields.map(e=>e.value),t);case`RecordSet`:return s(Ad,e.fields.map(e=>e.value),t);case`Except`:return s(Ad,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Pd,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(Ad,e.args,t)}]);case`FieldAccess`:return i(Fd,[a(e.record,t),{data:Cd()}]);case`BoxAction`:case`AngleAction`:return s(zd,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(Bd,[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 Un(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Hd(t,Ud(e.names))),i;default:return ki(e,(e,n)=>(a(e,r,Hd(t,Ud(n))),e)),i}},g=(e,t,n,r)=>{let i=Hd(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(yd(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(bd(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(xd(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=xd(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}},Jd=(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`?Jd(e,r,n):n.analyze(e,r)}),n.analyze(e.conclusion,r)},Yd=(e,t)=>{let n=qd(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`?Jd(e.statement,/* @__PURE__ */ new Map,n):n.analyze(e.statement,/* @__PURE__ */ new Map))},Xd=(e,t)=>e.maxLevels[t]??3,Zd=(e,t)=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=qd({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=>wd(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>wd(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Td(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=xd(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(yd(t.name,a));o!==void 0&&Xd(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=xd(t),r=d.find(e=>e.name===n.operator)?.operator,a=d.find(e=>e.name===n.param);if(!r||!a)return;let o=Xd(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 c([...o].join(`
410
- `))},Qd=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],$d=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),ef=new Map(Eu.flatMap(e=>e.map(t=>[t,e[0]]))),tf=e=>ef.get(e)??e,nf=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},rf=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(nf(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()}},af=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),of=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:tf(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:tf(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}},sf=(e,t)=>{let n=[];for(let r=t;;){let t=of(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},cf=e=>({line:e.line,column:e.column}),lf=(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=sf(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},uf=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,df={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},ff=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&uf(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&uf(e[n+1],e[n+2])?n+=uf(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=>df[e])}"`:r.text)}return t},pf=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},mf=(e,t)=>e.find(e=>e.name===t)??e.map(e=>mf(e.modules,t)).find(Boolean),hf=(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:Au.get(i)??t?.(i)??Sc(e,i),s=o===void 0?[]:se(o),c=pf(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=wc(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>mf(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},gf=(e,t,n)=>{let r=hf(e,t),i=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=sf(t,e+1);r.push({location:cf(t[e]),apply:e=>i.forEach(t=>e.put(af(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:cf(u),apply:t=>t.put(af(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`&&sf(t,l+1).every(e=>s.has(e))&&a(l,`definition`),$d.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(cf(u)),r.push({location:cf(u),apply:e=>e.put(af(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(af(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=tf(e.name);r.push({location:e.location,apply:n=>n.put(af(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(af(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(af(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Lr(e.location,t.location)?-1:+!!Lr(t.location,e.location))},a=/* @__PURE__ */ new Map,o=e=>{let t=a.get(e??``);if(t)return t;let n=rf();a.set(e??``,n),Tu.toReversed().forEach(e=>n.put(af(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()},_f=(e,t,n)=>{let r=hf(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=lf(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;ff(s(void 0)).forEach((e,t)=>{t===3&&ku.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),ff(s(n)).forEach(a))}Qd.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),Ou.forEach(a),[...i]},vf=t=>{switch(t.kind){case`Number`:try{return he(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Fe(t.name);case`Set`:return pt(t.elements.map(vf))}},yf=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],bf=e=>new c(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),xf=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Nr},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),Sf=(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 u(`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`)&&Re(t,r)})});if(t)return t[1];throw new u(`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}},Cf=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Un(e).some(e=>Cf(e,t)),wf=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Ri(e),n.get(e)??n.size)),n},Tf=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Ef=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw to(e);if(e.kind===`Number`&&!Go(e.value))throw no(e);Ef(e.kind===`Let`?[...Un(e),...Tf(e.instances??[])]:Un(e))}),Df=(e,t)=>{let n=wc(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(zu.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,f=al(e.checkDeadlock,t.seed),p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=[],g=/* @__PURE__ */ new Map,_=[],v=[],y=(e,t)=>_.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ee={value:0},b=e=>`${e}#${ee.value++}`,x=[],te=/* @__PURE__ */ new Map,ne=e=>{let n=s.get(e);if(n)return n;let r=$u(e,t.print,f,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},re=e=>{let t=ne(e);return t&&y(e,Qu.get(e)??[]),t},S=e=>(Ef([...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]),...Tf(e.instances)]),e.modules.forEach(S),e);S(n);let ie=(e,n)=>{let r=t.loadModule?.(e)??Gs.get(e)??Sc(t.source,e);if(r===void 0)throw new c(`Cannot find source file for module ${e} imported in module ${n}.`);let i=wc(r);if(i.name!==e)throw new c(`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`);return S(i)},ae=e=>{let t=v.indexOf(e.name);if(t!==-1)throw new c(`Circular dependency among .tla files; dependency cycle is: ${[...v.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];v.push(e.name),_.push(n);let i=O(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});_.pop(),v.pop();let a=r.find(e=>n.has(e.name));if(a)throw bf(a);return{linked:i,closure:n}},oe=(e,t)=>{let n=p.get(e);if(n)return y(e,g.get(e)??[]),n;let r=ae(ie(e,t));return p.set(e,r.linked),g.set(e,r.closure),y(e,r.closure),r.linked},C=(e,t,n,o,s)=>{let c=s?void 0:re(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,n]));let l=s??oe(e.module,t.name),u=yf(l),d=`#${ee.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=yi(gd(e,t),u,t,n);x.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=Xi({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,Ci(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=b(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:b}),h=new Set(u.map(e=>e.name)),g=/* @__PURE__ */ new Map;return l.exported.forEach((t,n)=>{if(h.has(n))return;if(e.name===void 0){let r=m.getKey(t.key);u.length>0&&te.set(r,{name:n,location:e.location}),g.set(n,{key:r,arity:t.arity});return}let r=m.getQualifiedKey(t.key);u.length>0&&te.set(r,{name:`${e.name}!${n}`,location:e.location}),g.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length})}),g},w=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Nr})),se=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:w(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),T=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),E=(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=T(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:w(r,n),location:n}}},D=(e,t,n,a)=>{let o=e.location,s=a?void 0:re(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=T(n.arity);return se(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??oe(e.module,n),l=`#${ee.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=yf(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};x.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=>Cf(f(e),p),h=d.map(t=>{let n=E(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=[],_=Xi({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:w(e.params,o),location:o,resolution:Nr}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Nr}])),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}:xf(a,i)),i},createName:b}),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=T(n.arity),a=[...e.params,...i];return se(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ce=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),O=(e,a)=>{let o=$s(e,t.loadClass?.(e.name)),s=new Map([...zu.map(e=>[e.name,{key:e.name,arity:e.arity}]),...a.symbols]),c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=[],d=[...o.constants],f=o.variables.map(e=>e.name),p=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:re(e);if(n){g(n,!0);return}let r=t??oe(e,o.name);d.push(...r.constants.filter(e=>d.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{f.includes(e)||(f.push(e),p.push(r.variableLocations[t]))}),g(r.exported,!0),r.modules.forEach((e,t)=>l.set(t,e)),u.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 _=d.length===0&&f.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,...l]),x=e=>new Map([...s,...[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))].filter(t=>Lr(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>Lr(t.location,e)).map(e=>[e.name,{key:v(e),arity:Rr(e)}])]),te=e=>{let t=b();if(t.has(e.name))throw bf(e);a.nested.push(e);let n=O(e,{id:`${a.id}/${e.name}`,symbols:x(e.location),modules:t,nested:a.nested});l.set(e.name,n),m.has(e.name)||m.set(e.name,n)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=C(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:()=>te(e)}))].sort((e,t)=>Lr(e.location,t.location)?-1:1).forEach(e=>e.link()),_i(o,ee(o));let ne=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&Lr(e.location,t.location)},S=e=>{let t=o.modules.find(t=>t.name===e.module);return t?ne(t)?l.get(t.name):void 0:b().get(e.module)},ie=_d(ea(o,(e,t)=>D(e,t,o.name,S(e))),ce(s));bi(ie,ee(ie)),ie.definitions.forEach(e=>{let t=v(e);r.set(t,e),i.set(t,!_);let n={key:t,arity:Rr(e)};s.set(e.name,n),e.isLocal||c.set(e.name,n)}),Yd(ie,{constants:new Set(d.map(e=>e.name)),variables:new Set(f),getDefinition:e=>r.get(s.get(e)?.key??e)});let ae={module:ie,constants:d,variables:f,variableLocations:p,visible:s,exported:c,modules:l,extended:u};return h.push(ae),ae},k=ae(n).linked,le=e=>k.visible.get(e)?.key??e;k.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let ue=[],de=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>de(e,t)),ue.push(...e.module.assumptions))};de(k,/* @__PURE__ */ new Set);let fe=k.constants.map(e=>e.name),A=k.variables,pe=e=>e.module===void 0?[e.name,le(e.name)]:e.module===n.name||fe.includes(e.name)?[]:[(p.get(e.module)??m.get(e.module))?.visible.get(e.name)?.key??e.name],j=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:k.constants.find(t=>t.name===e)?.arity??0},M=/* @__PURE__ */ new Map,me=/* @__PURE__ */ new Set,he=(e,t)=>{o.set(e,t),r.delete(e),M.delete(e),me.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=vf(e.value);pe(e).forEach(e=>{let n=j(e);n===0?M.set(e,t):he(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let ge=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=ge.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new l(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(vf),vf(e.value)]),ge.set(t,n)}),ge.forEach(e=>pe(e).forEach(t=>he(t,Sf(e.name,j(t)||e.rows[0][0].length,e.rows))));let _e=new Map(e.substitutions.flatMap(e=>pe(e).map(t=>[t,le(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!fe.includes(n)&&!k.visible.has(n))throw new l(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new l(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=le(i),s=r.get(a);if(!(s!==void 0||o.has(a)||M.has(a)||fe.includes(i)||A.includes(i)))throw new l(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(k.constants.find(e=>e.name===n)?.arity??k.visible.get(n)?.arity))throw new l(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let ve=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(pe)),ye=(e,t)=>{if(ve.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&ye(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=ye(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=se(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),k.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let be=fe.filter(e=>!M.has(e)&&!_e.has(e)&&!me.has(e));if(be.length>0)throw new l(`The constant parameter ${gf(t.source,t.loadModule,`constant`).find(e=>be.includes(e))??be[0]} is not assigned a value by the configuration file.`);let xe={runtime:f,definitions:r,builtins:o,constants:M,substitutions:_e,variables:A,variableIndex:wf(A,h.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap};Zd(x,e=>{let t=p.get(e)??m.get(e)??k;return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),getDefinition:e=>r.get(t.visible.get(e)?.key??e)}});let Se=qd({constants:new Set(M.keys()),variables:/* @__PURE__ */ new Set([...A,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>co(e,xe)}),Ce=e=>{try{X(e,{environment:xe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof u)return e;throw e}};return _e.forEach((e,t)=>{let n=r.get(e),i=fe.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Se.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Ce(n.body):void 0;if(i)throw new l(`The configuration file substitutes constant ${t} with non-constant ${e}${i instanceof d?``:` - specifically: ${i.message}`}`)}),f.isStarted=!0,{environment:xe,assumptions:ue,variableLocations:k.variableLocations,instanceActions:te}},Of={kind:`Boolean`,value:!0},kf={kind:`Boolean`,value:!1},Af=e=>e?Of:kf,jf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Mf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Q=(e,t)=>({kind:e,body:t}),Nf=(e,t,n)=>({kind:e,operands:[t,n]}),Pf=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Pf(e,t.operands).operands:[t])}),Ff=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Ff(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Ff(t)),0)}},If=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 If(e.body);case`And`:case`Or`:return e.operands.some(If)}},Lf=/* @__PURE__ */ new WeakMap,Rf={count:0},zf=e=>{let t=Lf.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`#${Rf.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(zf).join(`,`)})`;default:return`${e.kind}(${zf(e.body)})`}})();return Lf.set(e,n),n},Bf=(e,t)=>e===t||zf(e)===zf(t),Vf=(e,t)=>{let n=zf(t);return e.some(e=>e===t||zf(e)===n)},Hf=e=>e===`And`?`Or`:`And`,Uf=(e,t)=>{switch(e.kind){case`Boolean`:return t?Af(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Q(`Not`,e):e;case`Not`:return Uf(e.body,!t);case`And`:case`Or`:return Pf(t?Hf(e.kind):e.kind,e.operands.map(e=>Uf(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Q(n,Uf(e.body,t))}}},Wf=e=>{switch(e.kind){case`Boolean`:return Af(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Pf(Hf(e.kind),e.operands.map(Wf));case`Always`:return Q(`Eventually`,Wf(e.body));case`Eventually`:return Q(`Always`,Wf(e.body));default:return Q(`Not`,e)}},Gf=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Gf(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Af(t)}return n.length===0?Af(!t):n.length===1?n[0]:Pf(e.kind,n)}case`Not`:{let t=Gf(e.body);return t.kind===`Boolean`?Af(!t.value):Q(`Not`,t)}case`Always`:case`Eventually`:{let t=Gf(e.body);return Q(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Kf=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,qf=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=qf(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new u(`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=>Pf(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=qf(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Kf(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:Pf(`Or`,t);n.push(Q(`Always`,Q(`Eventually`,e)))}return Pf(`Or`,n)}case`Not`:return jf(e.body)?e:qf(Wf(e.body));default:return e}},Jf=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Jf(e.operands[0]):Pf(e.kind,e.operands.map(Jf));case`Not`:return e.body.kind===`Not`?Jf(e.body.body):Q(`Not`,Jf(e.body));case`Always`:case`Eventually`:case`Next`:return Q(e.kind,Jf(e.body));default:return e}},Yf=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Yf(e.operands[0]);let t=Math.floor(e.operands.length/2);return Nf(e.kind,Yf(Pf(e.kind,e.operands.slice(0,t))),Yf(Pf(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Q(e.kind,Yf(e.body));default:return e}},Xf=(e,t)=>{e.kind===`Eventually`&&!Vf(t,e)&&t.push(e),`body`in e&&Xf(e.body,t),`operands`in e&&e.operands.forEach(e=>Xf(e,t))},Zf=e=>{let t=e.filter(Mf),n=e.flatMap(e=>e.kind===`Not`&&Mf(e.body)?[e.body]:[]);return!t.some(e=>Vf(n,e))},Qf=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 u(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},$f=(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]}},ep=(e,t,n)=>e.flatMap(e=>{let r=$f(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),tp=e=>[...new Set(e.map(zf))].sort().join(`|`),np=(e,t)=>{let n=new Set(t.map(tp));return[...e.filter(e=>!n.has(tp(e))),...t]},rp=e=>{let t=Qf(e),n=ep(t,`Always`,`And`),r=ep(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=$f(t,`Eventually`,`Or`);if(n&&!(Vf(e,n.first)||Vf(e,n.second)))return np(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Vf(e,t.first)||Vf(e,t.second))&&!Vf(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Zf(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=$f(t[e],`Always`,`And`);n&&(Vf(t,n.first)||t.push(n.first),Vf(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)Vf(t,e.first)&&Vf(t,e.second)&&!Vf(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Zf(t)?[]:i(t)};return a(e)},ip=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Ff(e)<=1)}),ap=e=>{let t=rp([e]).map(ip),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=tp(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 rp(n)){let n=tp(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(ip(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},op=(e,t)=>!Vf(e,t)||Vf(e,t.body),sp=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&Ff(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Kf(e);if(n){let e=Ff(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(If(e))throw new u(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},cp=(e,t)=>{let n=e.findIndex(e=>Bf(e,t));return n===-1?(e.push(t),e.length-1):n},lp=e=>{let t=qf(Gf(Uf(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Jf(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])sp(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Pf(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Bf(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Yf(e.formula),n=[];t&&Xf(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>cp(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>cp(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>cp(i,e))}));return{tableau:t&&ap(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},up=/* @__PURE__ */ new Set([`~>`,`-+->`]),dp=/* @__PURE__ */ new WeakMap,fp=/* @__PURE__ */ new WeakSet,pp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),mp=e=>new u(`TLC cannot handle the temporal formula at ${Ga(e)}`),$=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ro(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=co(e,n);if(t)return hp(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:W(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return ki(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 up.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},hp=(e,t)=>{let n=dp.get(e);if(n!==void 0)return n;dp.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 dp.set(e,i),i},gp=`Temporal formula is a tautology (its negation is unsatisfiable).`,_p=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>_p(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,qa(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,vp(t,r,i));if(t.kind===`Identifier`){let e=W(t)?ro(r,t.name):void 0;if(e?.kind===`Thunk`)return c(e.expression,e.scope);let n=i.constants.has(t.name)?void 0:co(t.name,i);if(!e&&n?.kind===`Operator`&&n.params.length===0&&hp(n,i)>0){if(s.has(n))throw new l(`The definition of ${t.name} refers to itself`);return c(n.body,void 0,t.name,/* @__PURE__ */ new Set([...s,n]))}}let d=pp(i,r);if(t.kind===`Apply`&&(e=>a||$(e,r,i)===3)(t)){let e=ko(t,d),n=W(t)?void 0:co(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,Vo(e,t.args,d),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>$(e.set,r,i)===0)){let r=[],i={count:0};if(mo(t.bounds,d,e=>(i.count++,r.push(...c(t.body,e,qa(t.body))),!1)),i.count===0)throw n(new u(gp),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},vp=(e,t,n)=>{let r=Uo(e.definitions,pp(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&fp.add(e.binding);return r},yp=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),bp=(e,t,n)=>{let r=(e,t,r)=>{let i=r===0?$(e,t,n):r;if(i===0){let r=X(e,pp(n,t));if(typeof r!=`boolean`)throw new u(`TLC expected a boolean in the temporal formula at ${Ga(e)}`);return Af(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 u(`TLC overflowed the stack while expanding the temporal formula at ${Ga(n)}`);i.depth++;let o=c(e,t);i.depth--;let s=Ff(o);return s>2?o:r(n,a,s)},o=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,i=pp(n,t),o=W(e)||co(r,n)===void 0?ro(t,r):void 0;if(o?.kind===`Thunk`&&fp.has(o))return a(o.expression,o.scope,e,t);let s=o?.kind===`Operator`?o.operator:o?void 0:W(e)?Ao(r,i):Do(r,n);if(s?.kind!==`Closure`)throw mp(e);let c=e.kind===`Apply`?e.args:[];return a(s.body,Vo(s,c,i),e,t)},s=(e,t)=>{if(!e.bounds.every(e=>$(e.set,t,n)===0))throw mp(e);let i=[];mo(e.bounds,pp(n,t),t=>(i.push(c(e.body,t)),!1));let a=e.kind===`Forall`;if(i.length===0)return Af(a);let o=Pf(a?`And`:`Or`,i),s=Ff(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,vp(e,t,n));case`Identifier`:return o(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Q(`Always`,Nf(`Or`,Q(`Not`,c(n[0],t)),Q(`Eventually`,c(n[1],t)))):e.operator===`~`&&!W(e)?Q(`Not`,c(n[0],t)):e.operator===`=>`?Nf(`Or`,Q(`Not`,c(n[0],t)),c(n[1],t)):o(e,t)}case`And`:case`Or`:return Pf(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,pp(n,t));if(typeof r==`boolean`)return c(r?e.consequent:e.alternative,t)}let r=c(e.condition,t);return Nf(`Or`,Nf(`And`,r,c(e.consequent,t)),Nf(`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=yp(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`,Nf(`Or`,i,a))):Nf(`Or`,Q(`Eventually`,Q(`Always`,i)),Q(`Always`,Q(`Eventually`,a)))}default:throw mp(e)}};return c(e,t)},xp=(e,t,n,r,i)=>{let a=e=>xp(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`?so(X(e.expression,a),`a temporal property predicate`):Ba(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&&so(X(e.unchanged,a),`a subscript`)?!1:so(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 xp(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new u(`TLC cannot evaluate a temporal formula in a single step`)}},Sp=(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)=>Sp(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 xp(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Cp=(e,t)=>e.every((e,n)=>Be(e,t[n])),wp=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Tp=(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),Ep=(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}},Dp=(e,t)=>e.offsets[t]!==-1,Op=(e,t)=>e.pending[t]??=[],kp=(e,t)=>{let n=e.edgeOffsets[t];return e.edges.ids.subarray(n+1,n+1+e.edges.ids[n])},Ap=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,jp=2**53-1,Mp=(t,r,i,a)=>{if(t.length===0)return;let o=r.map(e=>bp(e.expression,e.scope,i)),s=t.map(e=>Q(`Not`,bp(e.expression,e.scope,i))),c=s.length===1?s[0]:Pf(`Or`,s),l=o.length===0?c:Pf(`And`,[...o,c]),d=lp(l);if(d.length===0)throw n(new u(gp),e.livenessEvaluationFailure);let f=/* @__PURE__ */ new Map,p=d.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=zf(e),n=f.get(t)??f.size;return f.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})),m={multiplier:1},h=!ts(i),g={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},_=e=>{let t=g.states.get(e)??/* @__PURE__ */ new Map;return g.states.set(e,t),t},v=(e,t)=>{i.runtime.setLivenessSource(e);let n=t();return i.runtime.setLivenessSource(void 0),n},y=(e,t)=>xp(e,t,void 0,i,h?_(t):/* @__PURE__ */ new Map),ee=(e,t,n)=>v(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!y(e,n))),b=(e,t,n,r)=>v(t,()=>{let t=e.solution.actionChecks;if(!h)return Uint8Array.from(t,e=>+!!xp(e,n,r,i,/* @__PURE__ */ new Map));let a=_(n),o=g.actions.get(n)??/* @__PURE__ */ new Map;g.actions.set(n,o);let s=o.get(r)??new Int8Array(f.size).fill(-1);return o.set(r,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!xp(t[o],n,r,i,a)),s[e]))}),x=(e,t,n,r)=>v(n,()=>e.nodes[t].statePredicates.every(e=>y(e,r))),te=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},ne=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),re=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Ep(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},S=(e,t,n)=>{let r=Tp(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),Ep(i,e[t]-1,e[t+1]))}return i.slots.set([t+1,n,r],Ep(i,t,n)),r},ie=(e,t,n)=>t.nodes.flatMap((t,r)=>re(e,n,r)??[]).sort((e,t)=>e-t),ae=(e,t,n,r)=>{let i=e.solution.actionChecks.length,a=e.results,o=a.length;if(a.length+=r.length+n.length*i,a.length>a.bytes.length){let e=new Uint8Array(Math.max(2*a.bytes.length,a.length));e.set(a.bytes),a.bytes=e}a.bytes.set(r,o),n.forEach((e,t)=>a.bytes.set(e,o+r.length+t*i)),e.offsets[t]=o;let s=e.pending[t]??[],c=e.edges,l=c.length;if(c.length+=s.length+1,c.length>c.ids.length){let e=new Int32Array(Math.max(2*c.ids.length,c.length));e.set(c.ids),c.ids=e}c.ids[l]=s.length,c.ids.set(s,l+1),e.edgeOffsets[t]=l,e.pending[t]=void 0},oe=(e,t,n)=>{let r={slots:Array.from({length:16*m.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&&Cp(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*m.multiplier&&m.multiplier++,r.slots.filter(e=>e!==void 0)},C=(e,t,n,r,i)=>{let o=ee(e,r,n),s=t.nodes[e.nodeTableaux[i]],c=[],l=Op(e,i),u=s.successors.length>0?b(e,r,n,n):/* @__PURE__ */ new Uint8Array;for(let a of s.successors){if(!x(t,a,r,n))continue;if(te(t,a)&&e.errorNode===void 0&&ne(e)){e.errorNode=i;return}let o=re(e,r,a);if(o!==void 0&&l.includes(o))continue;let s=o??S(e,r,a);l.push(s),c.push(u),o===void 0&&C(e,t,n,r,s)}for(let i of a.getSuccessors(n)){let a=b(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=re(e,i.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??S(e,i.index,n);l.push(u),c.push(a),s===void 0&&o&&C(e,t,i.state,i.index,u)}}l.length>0&&ae(e,i,c,o)},w=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>x(t,r,a,e.state)));e.isDone[a]=!0;for(let s of ie(e,t,a)){let a=Op(e,s),c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=re(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??S(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&C(e,t,n.state,n.index,d)}}),ae(e,s,c,i)}if(e.errorNode!==void 0)return wp(T(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},se=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Tp(e,e.nodeStates.length,-1);let a=Op(e,i),o=[];t.forEach((t,r)=>{Dp(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),ae(e,i,o,r)},T=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Dp(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 kp(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}Dp(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new u(`Couldn't re-create liveness trace (path) starting at: ${t}`)},E=(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=>Dp(e,t)),l=[],d=t=>{let n=kp(e,t).indexOf(t);return n!==-1&&o(t,n)},f=(t,r)=>n.tableau!==void 0&&op(n.tableau.nodes[e.nodeTableaux[t]].particle,r),p=r=>{let i=l.pop()??r;if(i===r&&!d(i)){s[i]=jp;return}let c=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Map;for(let t=i;;t=l.pop()??r){c.add(t);let n=u.get(e.nodeStates[t]);if(n?n.push(t):u.set(e.nodeStates[t],[t]),s[t]=jp,t===r)break}let p=t.infinitelyOftenStates.every(t=>[...c].some(n=>Ap(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>kp(e,n).some((e,r)=>c.has(e)&&o(n,r)&&a(n,r,t)))),g=n.promises.every(e=>[...c].some(t=>f(t,e)));if(p&&h&&g)return m(r,c,u)},m=(r,i,s)=>{let c=wp(T(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),p=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),g=n.promises.map(()=>!1),_={count:p.length+m.length+g.length},v={node:r},y=e=>i.has(e),ee=e=>{l.push(v.node),v.node=e};for(;_.count>0;){let r=_.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!p[n]&&Ap(e,v.node,t)&&(p[n]=!0,_.count--)}),n.promises.forEach((e,t)=>{!g[t]&&f(v.node,e)&&(g[t]=!0,_.count--)}),!(_.count<=0);){let n={last:-1,unvisited:-1},i=_.count;if(kp(e,v.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!y(r)||!o(v.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&a(v.node,c,e)&&(m[t]=!0,_.count--)})}return _.count<i?(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 u(`TLC failed to build the counterexample of a liveness property`);v.node=t,n.unvisited=kp(e,t).find(e=>y(e)&&!d.has(e))??-1}ee(n.unvisited),d.add(n.unvisited)}}let b=h(r,v.node,s,o);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()]}},h=(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,d=0;;d++){for(let u of r.get(n)??[])for(let[d,f]of kp(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 f=c[d];if(f===void 0)throw new u(`TLC failed to build the counterexample of a liveness property`);n=f[0],l=f[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=p(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++};kp(e,a).forEach((t,r)=>{Dp(e,t)&&(o(a,r)?s[t]===-1?n.push(t,-1):u.value=Math.min(u.value,s[t]):s[t]===-1&&c.push(t))}),n.push(u.value)}}};return{addInitialState:(e,t)=>{g.states.clear(),g.actions.clear();for(let n of p){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(re(n,e,i)??S(n,e,i))}},addState:(e,t,n)=>{g.states.clear(),g.actions.clear();let r=oe(e,t,n);for(let n of p){let i=r.map(r=>b(n,e,t,r.state)),a=ee(n,e,t),o=n.solution.tableau,s=o?w(n,o,r,i,a,e):se(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of p)for(let t of e.solution.models){let n=E(e,t);if(n)return n}},getViolatedProperties:(e,n)=>[...new Set(t.filter((t,r)=>!Sp(s[r].body,e,n,0,i)).map(e=>e.name))]}},Np=`UnnamedAction`,Pp={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Fp=e=>{let t=e.range??Pp;return kt([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Ip=e=>{let t=[[`name`,e.name],[`location`,Fp(e.location)]];return e.parameters.length===0?kt(t):kt([...t,[`context`,kt(e.parameters)],[`parameters`,R(e.parameters.map(e=>e[0]))]])},Lp=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),Rp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),zp=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Bp=e=>e.kind===`Apply`?e.args:[],Vp=(e,t,n)=>{let r=zp(e);if(r===void 0)return;if(W(e)){let e=ro(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=Do(r,n);return i?.kind===`Closure`?i:void 0},Hp=(e,t)=>{try{return X(e,Rp(t,void 0)),!0}catch(e){if(e instanceof s)return!1;throw e}},Up=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&uo(e,t)&&Hp(e.body,t),Wp=(e,t)=>{let n=co(e.name,t);return n?.body===e.body&&Up(n,t)},Gp=(e,t)=>{if(e.kind!==`Identifier`||!W(e))return;let n=ro(t,e.name);return n?.kind===`Thunk`?n:void 0},Kp=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ro(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),qp=(e,t)=>{try{return e()}catch(e){if(e instanceof s)return t();throw e}},Jp=(e,t,n,r,i)=>{let a=Bp(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():qp(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),X(e,Rp(i,n))]),expression:t,scope:n}],o)},Yp=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Np,location:e.location,parameters:Kp(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Yp(e.body,Uo(e.definitions,Rp(r,t)),n,r,i);case`Label`:return Yp(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Yp(e,t,n,r,i));case`Exists`:return qp(()=>{let o=[];return mo(e.bounds,Rp(r,t),t=>(o.push(...Yp(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=W(e)?void 0:i.get(zp(e)??``),s=Vp(e,t,r);if(o)return Jp(o,e,t,s,r);if(!s)return[a()];let c=Bp(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return Wp(s,r)||c.some(e=>$(e,t,r)!==0)?l():qp(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:X(n,Rp(r,t))},parent:e}),s.scope);return Yp(s.body,e,s,r,i)},l)},Xp=(e,t,n,r,i)=>{let a=(e,t)=>Xp(e,t,n,r,i);if(e.kind===`Let`){a(e.body,Uo(e.definitions,Rp(n,t)));return}let o=Gp(e,t);if(o){a(o.expression,o.scope);return}let s=Vp(e,t,n);if(s&&Wp(s,n))return;if(s&&s.params.length===0){if($(s.body,s.scope,n)===1){r.inits.push(Lp(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,Vo(s,e.args,Rp(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(Lp(Np,e));return}let c=$(e,t,n);c<=1?r.inits.push(Lp(Np,e)):c===3&&r.temporals.push(Lp(Np,e))},Zp=(e,t,n,r,i)=>{let a=(t,n)=>Zp(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Uo(t.definitions,Rp(r,n)));return}let o=Gp(t,n);if(o){a(o.expression,o.scope);return}let s=Vp(t,n,r);if(s&&Wp(s,r))return;if(s&&s.params.length===Bp(t).length){a(s.body,t.kind===`Apply`?Vo(s,t.args,Rp(r,n)):s.scope);return}if(t.kind===`Forall`&&qp(()=>(mo(t.bounds,Rp(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(Lp(e,a)):$(a,n,r)<2?i.invariants.push(Lp(e,a)):i.impliedTemporals.push(Lp(e,t));return}let c=$(t,n,r);c<=1?i.impliedInits.push(Lp(e,t)):c===3&&i.impliedTemporals.push(Lp(e,t))},Qp=(e,t)=>{let n=co(e,t);return n?.kind===`Operator`&&!Up(n,t)?n:void 0},$p=e=>kt([[`name`,e.name],[`location`,Fp(e.location)]]),em=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Qp(e.specification,t);a&&(Xp(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Yp(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Do(e.init,t);o?.kind===`Closure`&&r.inits.push(Lp(e.init??``,o.body));let s=e.next===void 0?void 0:Do(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Yp(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Qp(e,t);n&&r.invariants.push(Lp(e,n.body))}),e.properties.forEach(e=>{let n=Qp(e,t);n&&Zp(e,n.body,void 0,t,r)}),r},tm=(e,t,n)=>em(e,t,n).actions,nm=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>U(e[1])).join(`,`)})`,rm=e=>`${e.name===Np?`Action`:e.name}${nm(e)} ${Ka(e.location.range??Pp)}`,im=e=>`${e.name}${nm(e)}`,am=(e,t,n,r)=>{let i=em(e,t,r),a=e=>pt(e.map(Ip)),o=e=>pt(e.flatMap(e=>{let n=Qp(e,t);return n?[$p(n)]:[]}));return kt([[`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`,pt(t.variables.map((e,t)=>kt([[`name`,e],[`location`,Fp(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},om=`paired12`,sm=(e,t=16)=>e<=t*.75?t:sm(e,t*2),cm=(e,t)=>{let n=sm(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)},lm=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),um=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),dm=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),fm=e=>dm(e).replaceAll(`
411
- `,`\\n`),pm=(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(``))}},mm=(e,t)=>{let n=[`strict digraph DiskGraph {
412
- `,`node [shape=box,style=rounded]
413
- `,e.colorize?`edge [colorscheme="${om}"]\n`:``,`nodesep=0.35;
465
+ `]]),Hd=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`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)`]])]]),Ud=k(`EOF`),Wd=k(`IDENTIFIER`),Gd=k(`DEFBREAK`),Kd=(e,t)=>Array.from({length:k(t)-k(e)+1},(t,n)=>k(e)+n),qd=new Set(Kd(`op_57`,`op_119`)),Jd=new Set(Kd(`op_1`,`op_119`)),Yd=new Set(Kd(`op_57`,`op_70`)),Xd=/* @__PURE__ */ new Set([...Kd(`ACTION`,`EXCEPT`),k(`EXTENDS`),...Kd(`IF`,`SF`),k(`STATE`),...Kd(`THEN`,`WITH`),k(`US`),...Kd(`op_112`,`op_116`)]),Zd=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),Qd=new Map([...Zd(`postfix`,160,160,!0,`[`),...Zd(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Zd(`prefix`,120,120,!1,`-.`),...Zd(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Zd(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Zd(`prefix`,40,40,!0,`\\lnot`),...Zd(`nfix`,100,130,!0,`\\times`),...Zd(`infix`,140,140,!1,`^`,`^^`),...Zd(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Zd(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Zd(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Zd(`infix`,100,110,!0,`|`,`||`,`%%`),...Zd(`infix`,100,110,!1,`%`),...Zd(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Zd(`infix`,90,140,!1,`\\wr`),...Zd(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Zd(`infix`,90,130,!1,`!!`),...Zd(`infix`,90,90,!1,`...`,`..`),...Zd(`infix`,80,80,!0,`\\intersect`,`\\union`),...Zd(`infix`,80,80,!1,`\\`),...Zd(`infix`,70,70,!1,`<:`,`:>`),...Zd(`infix`,60,60,!0,`@@`),...Zd(`infix`,50,140,!0,`\\cdot`),...Zd(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Zd(`infix`,30,30,!0,`\\land`,`\\lor`),...Zd(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Zd(`infix`,10,10,!1,`=>`)]),$d=new Map([...Qd,...Ld.flatMap(e=>e.slice(1).map(t=>[t,Qd.get(e[0])]))]),ef=$d.get(`[`),tf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},nf=e=>({type:`tokens`,kinds:new Set(e)}),rf=e=>typeof e==`string`?e.startsWith(`<`)?nf([k(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(rf)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),af=e=>(...t)=>({type:e,body:G(...t)}),q=af(`zeroOrMore`),of=af(`oneOrMore`),J=af(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),sf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),cf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=sf(e,n);return n},lf=(...e)=>{let t=e.map(k);return e=>t.includes(cf(e,1).kind)},uf=(e,t=cf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},df=e=>{let t=cf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},ff=e=>lf(`CASESEP`)(e)&&uf(e),pf=e=>{let t=cf(e,1);Xd.has(t.kind)&&(t.kind=Wd)},mf=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,hf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),gf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},_f=e=>e.operatorStacks[e.operatorStacks.length-1],vf=(e,t)=>e.low>t.high,yf=(e,t)=>e.high<t.low,bf=e=>e.fix===`prefix`?e:$d.get(`${e.name}.`),xf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===ef?hf(`FcnAppl`,[n,...r.node.heirs]):hf(`PostfixExpr`,[n,r.node]),operator:void 0})},Sf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:hf(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:hf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Cf=e=>{let t=_f(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return xf(t,n),Cf(e);if(i.operator!==void 0){let t=bf(r.operator);return t!==void 0&&vf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${mf(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${mf(e,a.node.first,a.node.last)} and expression at location ${mf(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return yf(a.operator,r.operator)?void 0:vf(a.operator,r.operator)?(Sf(t,a.operator),Cf(e)):`Precedence conflict between ops ${a.operator.name} in block ${mf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=bf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(yf(s,r.operator))return;if(!vf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${mf(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Sf(t,s),Cf(e);let c=mf(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===tf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},wf=e=>Y(t=>{let n=_f(t),r=gf(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:Cf(t)}),Tf=wf(()=>!1),Ef=wf(()=>!0),Df=Y(e=>{e.lastOperator=$d.get(e.token.image)}),Of=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},kf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Of(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Af=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!uf(e,n.first.beginColumn))return n;let t=Af(e,n);if(t!==void 0)return t}},jf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(k),n=(e,...t)=>t.some(t=>e.kind===k(t)),r=e=>e!==void 0&&qd.has(e.kind),i=e.token,a=sf(e,i);i.next=void 0;let o=sf(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===Wd&&(e=e.next)}else if(e.kind===Wd){let t=e.next;!r(t)||Yd.has(t.kind)||Jd.has(t.kind)&&t.next?.kind!==Wd||(e=t.next?.kind===k(`SUBSTITUTE`)?i:Jd.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Gd&&(e.next={kind:Gd,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=sf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Mf=e=>{let t=cf(e,1);if(t.kind===k(`LAB`)){let n=1;for(;n!==0;)if(t=sf(e,t),t.kind===k(`LAB`)&&n++,t.kind===k(`RAB`)&&n--,t.kind===Ud)return!1;return sf(e,t).kind===k(`IN`)}if(t.kind!==Wd)return!1;for(t=sf(e,t);t.kind===k(`COMMA`);){if(t=sf(e,t),t.kind!==Wd)return!1;t=sf(e,t)}return t.kind===k(`IN`)},Nf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Pf=e=>e.proofLevels.at(-1)??-1,Ff=e=>{let t=cf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:lf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Pf(e)>=0&&Nf(t)>Pf(e):lf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},If=(e,t)=>{let n=Nf(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},Lf=e=>Y(t=>If(t,t.token)?void 0:`${mf(t,t.token)}: ${e}`),Rf=nf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(k)),zf=nf([...Rf.kinds,k(`op_76`)]),Bf=nf(Jd),Vf=nf(Yd),Hf=nf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(k)),Uf=()=>q(Z({expansion:[K(Rf,`<op_77>`)],semantic:uf}),K(`PrefixOp`,`InfixOp`),Ef),Wf=()=>K(G(Z({expansion:[`OpenStart`],semantic:uf}),`OpenExpression`,Tf),G(Z({semantic:uf}),`ExtendableExpr`)),Gf=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),Kf=()=>K(G(Z({semantic:e=>lf(`ASSUME`,`BOXASSUME`)(e)||cf(e,2).kind===k(`COLONCOLON`)&&[k(`ASSUME`),k(`BOXASSUME`)].includes(cf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),qf=()=>[`JuncItem`,q(Z({semantic:df}),`JuncItem`)],Jf=e=>Y(t=>{t.expecting=e,pf(t)}),Yf=e=>Y(t=>{t.isTerminalProof=e}),Xf=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{jf(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),Zf={CompilationUnit:Q(void 0,[Y(jf),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),Jf(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,Jf(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,Jf(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(jf)),G(Z({semantic:e=>lf(`USE`)(e)&&cf(e,2).kind!==k(`ONLY`)||lf(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(Xf(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Xf(`Expression`,Z({expansion:[`<IDENTIFIER>`,Vf]}),`PostfixLHS`,`Expression`),Xf(`Expression`,Z({expansion:[`<IDENTIFIER>`,Bf]}),`InfixLHS`,`Expression`),Xf(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),Xf(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[zf,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,Bf,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,Vf]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,Jf(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[Rf,Df]),NonExpPrefixOp:Q(void 0,[zf,Df]),InfixOp:Q(`Infix Op`,[Bf,Df]),PostfixOp:Q(void 0,[Vf,Df]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{jf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),Kf(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),Kf(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=gf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${mf(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(jf),K(G(Z({amount:3}),Z({semantic:lf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:Ff}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>lf(`BY`)(e)||cf(e,2).kind===k(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>cf(e,2).kind!==k(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,Yf(!0),J(`<ONLY>`)),G(`<USE>`,Yf(!1),J(`<ONLY>`)),G(`<HIDE>`,Yf(!1))),X("an expression, `MODULE' or `DEF'"),J(Gf(),q(`<COMMA>`,X(`MODULE or expression`),Gf(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Gf(),q(`<COMMA>`,X(`MODULE or expression`),Gf(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),Hf,Lf(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:Ff}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),Hf,Lf(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:lf(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:lf(`INSTANCE`)}),`Instantiation`),G(Z({semantic:lf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:Ff}),Y(e=>{let t=gf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${mf(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),of(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:lf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(zf,Bf,Vf),nf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(k))],semantic:uf}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${mf(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:uf}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:Mf}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),of(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=gf(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),of(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:Mf}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>cf(e,2).kind===k(`MAPTO`)&&Xd.has(cf(e,1).kind)}),Y(e=>{cf(e,1).kind=Wd}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=hf(`FcnAppl`,t.heirs),e.lastOperator=ef})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,of(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(pf),`Identifier`),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===k(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>ff(e)&&cf(e,2).kind!==k(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:ff}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[of(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=cf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...qf()),G(Z({expansion:[`<AND>`]}),...qf())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Af(t,e.heirs[1]);return n&&`Item at ${mf(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${mf(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),Uf(),Wf()],(e,t)=>{let n=_f(t);n.push({node:e.heirs[0],operator:tf});let r=Cf(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Tf,q(K(G(Z({expansion:[`PostfixOp`],semantic:uf}),`PostfixOp`,Ef),G(Z({expansion:[`<DOT>`],semantic:uf}),`<DOT>`,Y(pf),Z({semantic:uf}),`Identifier`,Y(e=>{let t=_f(e);t[t.length-1].operator!==void 0&&xf(t,t.length),t[t.length-1]={node:hf(`RecordComponent`,[t[t.length-1].node,gf(e,2),gf(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:uf}),X(`function argument`),`SBracketCases`,wf(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:uf}),`InfixOp`,Ef,Uf(),Wf()),G(Z({expansion:[`<COLONCOLON>`],semantic:uf}),`<COLONCOLON>`,Y(e=>{let t=_f(e);if(!kf(t[t.length-1].node))return`\`::' at ${mf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=_f(e),n=gf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!yf(r,e.lastOperator)){let t=gf(e,3);return`Removing label at ${mf(e,t.first,t.last)} would change expression parsing.`}t.push({node:hf(`Label`,[gf(e,3),gf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:uf}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:uf}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>Pf(e)<0&&e.proofLevels.length<=1?`${mf(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${mf(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Of(e.heirs)===void 0?e.heirs.length===1?hf(`GeneralId`,e.heirs):void 0:hf(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>cf(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>cf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${mf(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Qf=/* @__PURE__ */ new Map,$f=e=>{let t=Qf.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=$f(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,$f(Zf[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return Qf.set(e,n),n},ep=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},tp=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=sf(e,e.scanPosition)),e.scanPosition=sf(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},np=(e,t)=>{if(t.type===`tokens`)return tp(e,t.kinds);if(t.type===`call`)return np(e,Zf[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||ep(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=np(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||ep(e,t.semantic)?np(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=np(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=np(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},rp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=np(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},ip=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||$f(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!$f(a).hasSemanticStart?$f(a).first.has(cf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):rp(e,i,a)&&(o===void 0||o(e))}),ap=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,np(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=sf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Ud){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=sf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ge(e.token.image)}" `},op=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??ap(e)}\n\nResidual stack trace follows:\n${r}`,!1},sp=(e,t)=>{let n=sf(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,op(e))},cp=(e,t)=>{let n=Zf[t];n.message!==void 0&&(e.messages.push({name:n.message,token:cf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!lp(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return op(e,i);let a=r.node??(r.heirs.length===0?void 0:hf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},lp=(e,t)=>{if(t.type===`tokens`)return sp(e,t.kinds);if(t.type===`call`)return cp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||op(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||op(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||lp(e,t));if(t.type===`choice`){let n=ip(e,t.alternatives);return n===-1?op(e):lp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!lp(e,t.body))return!1;if(t.type===`optional`)return ip(e,[t.body])===-1||lp(e,t.body);for(;ip(e,[t.body])===0;)if(!lp(e,t.body))return!1;return!0},up=e=>{let t=Ue(e),n={kind:Ud,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=lp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},dp={low:15,high:15},fp={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),pp=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)]]),mp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),hp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),gp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),_p=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),vp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),yp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...mp]),bp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?pp.has(e.operator):mp.has(e.operator)),xp=e=>pp.has(e)||mp.has(e)||e===`-.`,Sp=(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}}},Cp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),wp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Tp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Ep=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Dp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Op=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),kp=/* @__PURE__ */ new Set([``,`*`,`-`]),Ap=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),jp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Mp=/* @__PURE__ */ new Set([`NEW`,...jp.keys()]),Np=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Pp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Fp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Ip=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
466
+ `)}\n`},Lp=(e,t)=>{let n=t===`tlapm`,r=n?xe(e):xe(e).map(ye),i={index:0,offsideColumns:[]},a={},o=[],s=/* @__PURE__ */ new Set,c=[],l=[],d=e=>o[o.length-1].has(e),f=e=>({line:e.line,column:n&&e.kind===`String`?e.endColumn:e.column,range:void 0}),m=[],h=[],_=[],v=(e,t=i.index-1)=>{let n=e===t?_[e]:void 0;if(n)return n;let a=r[t];m[e]??=f(r[e]),h[t]??={line:a.line,column:a.endColumn};let o={module:l[0].name,start:m[e],end:h[t]};return e===t&&(_[e]=o),o},y=(e,t)=>(e.location.range=v(t),e),b=(e=0)=>r[Math.min(i.index+e,r.length-1)],x=(e=0)=>{let t=b(e),n=i.offsideColumns[i.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ee=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),te={index:0},S=e=>{let t=r.slice(te.index,i.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ne=e=>n&&(e.kind===`Keyword`||Fp.has(e.text)),re=e=>{let t=r.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},ie=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Op.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ne(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,C=(e,t=b(),n)=>{let i=r[r.length-1],a=t.line===i.line&&t.column===i.column;return new u(`${e} at line ${t.line}, column ${t.column}`,void 0,ae(e,t,a,n))},ae=(e,t,i,a)=>{if(n&&i){let e=r[r.length-1];return{reason:`Unexpected EOF`,...S(re(e)),isEnd:i}}return n&&a?{reason:`Unexpected ${ie(a)}`,...re(a),isEnd:i}:{reason:e,line:t.line,column:t.column,isEnd:i}},oe=(e,t=b())=>C(e,t,t),se=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ne(e),w=(e,t=0)=>{let n=x(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=x();if(e.kind===`End`)throw C(`Unexpected end of expression`);return i.index++,e},E=e=>w(e)?(i.index++,!0):!1,D=e=>{if(!w(e))throw oe(`Expected ${JSON.stringify(e)} but found ${ee(x())}`);return T()},ce=()=>{let e=x();if(e.kind!==`Identifier`)throw oe(`Expected an identifier but found ${ee(e)}`);if(ne(e))throw oe(`Unexpected keyword ${e.text}`);return i.index++,e.text},le=()=>{let e=i.index;return{name:ce(),range:v(e)}},ue=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),de=()=>{let e=x();return e.kind!==`String`&&(gp.has(e.text)||pp.has(e.text)||mp.has(e.text)||e.text===`'`)?(i.index++,e.text):ce()},fe={isUsed:!1},me=()=>x().kind===`Identifier`||!se(x())?ce():(fe.isUsed=!0,T().text),he=e=>{if(!n)return e();i.offsideColumns.push(-1);let t=e();return i.offsideColumns.pop(),t},O=(e,t=`,`)=>{let n=[e()];for(;E(t);)n.push(e());return n},ge=()=>{if(w(`<<`)){let e={value:1};for(;x(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;x(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},_e=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;x(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return x(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},ve=()=>{if(!E(`<<`)){let e=le();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ue(O(le));return D(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},be=()=>O(()=>{let e=O(ve);D(`\\in`);let t=j();return e.map(e=>({pattern:e,set:t}))}).flat(),Se=()=>{let e=x();if(e.kind===`Identifier`){let t=i.index,n=[T().text];for(;w(`!`)&&x(1).kind===`Identifier`;)T(),n.push(ce());return y({kind:`Identifier`,name:n.join(`!`),location:f(e)},t)}if(w(`<<`)||w(`(`))return Fe();throw oe(`Expected a subscript but found ${ee(e)}`)},Ce=e=>{let t=x(1),n=x(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&w(`==`,mp.has(n.text)?3:4))},we=e=>{let t=x(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&wp.has(t.text)||Ce(e)},k=()=>{let e=x(),t=e.kind===`Operator`&&(pp.has(e.text)||hp.has(e.text))&&we(e);if(n&&e.kind!==`String`&&(hp.has(e.text)||yp.has(e.text)&&e.text!==`'`&&!mp.has(e.text)||vp.has(e.text)&&x(-1).text===`(`&&x(-1).line===e.line&&x(-1).endColumn+1===e.column&&x(1).text===`)`&&x(1).line===e.line&&x(1).column===e.endColumn+1)&&we(e))throw C(`incomplete expression`,e);if(t)return i.index++,y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:f(e)},i.index-1);if(e.kind!==`String`&&yp.has(e.text)&&we(e)){i.index++;let t=f(e);if(mp.has(e.text))return y({kind:`OperatorReference`,operator:e.text,location:t},i.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return y({kind:`Lambda`,params:[n.name],body:Sp(e.text,n,t),operator:e.text,location:f(e)},i.index-1)}if(w(`LAMBDA`)){let t=i.index;T();let n=ue(O(le));D(`:`);let r=j();return y({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:f(e)},t)}return j()},Te={range:void 0},A=()=>he(()=>{let e=i.index;D(`(`);let t=O(k);return D(`)`),Te.range=v(e),t}),Ee=()=>{let e=T();i.offsideColumns.push(e.column);let t=[j()];for(;b().text===e.text&&b().column===e.column;)i.index++,t.push(j());return i.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:f(e)}},De=e=>he(()=>{let t=f(e),r=x().kind===`Identifier`,a=w(`|->`,1)&&(r||se(x()));if(a||r&&w(`:`,1)){let e=a?`Record`:`RecordSet`,n=e=>{let t=i.index,n=f(x()),r=e();return n.range=v(t),D(a?`|->`:`:`),{name:r,value:j(),location:n}},o=[n(()=>r?ce():T().text),...E(`,`)?O(()=>n(ce)):[]];return D(`]`),{kind:e,fields:o,location:t}}if(ge()){let e=be();D(`|->`);let n=j();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let o=j();if(E(`->`)){let e=j();return D(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(E(`EXCEPT`)){let e=O(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!se(x()))throw oe(`Expected a field name but found ${ee(x())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:O(()=>j())}),D(`]`);return D(`=`),{path:e,value:j()}});return D(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!n&&!w(`]_`)){let e=[o];for(;E(`,`);)e.push(j());return D(`]`),{kind:`Bracket`,args:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:o,subscript:Se(),location:t}}),Oe=()=>{let e=i.index,t=y(Le(),e),n=f(T());return y({kind:`Apply`,operator:`\\in`,args:[t,j()],location:n},e)},ke=e=>he(()=>{let t=f(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ge()&&(x(1).text===`\\in`||w(`<<`))){let e=i.index,n=ve();D(`\\in`);let r=j();if(E(`:`)){let e=j();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}i.index=e}let n=x().kind===`Identifier`&&w(`\\in`,1)?Oe():j();if(E(`:`)){let e=be();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;E(`,`);)r.push(j());return D(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ae=e=>{let t=f(e),n=he(()=>w(`>>`)||w(`>>_`)?[]:O(()=>j()));if(E(`>>_`)){if(n.length!==1)throw C(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:Se(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},je=e=>{let t=f(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ge()){let e=be();return D(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=ue(O(le));return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Me=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:j(),location:f(e)};let n=j();D(`->`),t.push({condition:n,body:j()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:f(e)}},Ne=()=>{let e=x(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Cp.has(e.text)||e.kind===`Operator`&&(pp.has(e.text)||mp.has(e.text)||hp.has(e.text)))},Pe=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:pe(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return i.index--,{kind:`Bound`,args:A()}}return{kind:`Name`,name:e.text,args:w(`(`)?A():[]}},Fe=e=>{let t=i.index,r=T(),s=f(r);if(n&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=O(ce);return D(`:`),{kind:`Lambda`,params:e,body:j(),location:s}}if(r.kind===`Number`){if(n&&/^\\[BOH]/.test(r.text))throw C(`incomplete expression`,r);return{kind:`Number`,value:pe(r.text),text:r.text,location:s}}if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:s};if(r.kind===`String`)return{kind:`String`,value:r.text,location:s};let c=r.kind===`Step`&&et(r);if(c&&Ze()<0&&Xe.length<=1)throw C(`Step number used outside proof`,r);if(c&&r.text[1]===`+`)throw C(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||c){let o=c?tt(r)??r.text:r.text;if(_e()){let t=ue(E(`(`)?O(le):[]);t.names.length>0&&D(`)`),D(`::`);let i=j();if(!n&&e!==void 0&&a.last!==void 0&&bp(i)&&e.high>=a.last.low)throw C(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:o,params:t.names,paramRanges:t.ranges,body:i,location:s}}let l=w(`(`);if(o===`@`&&!l&&!Ne())return{kind:`ExceptAt`,location:s};let u=l?A():[],d=[l?Te.range:void 0];if(!Ne())return l?{kind:`Apply`,operator:o,args:u,argumentsRange:Te.range,location:s}:{kind:`Identifier`,name:o,location:s};let f=[{kind:`Name`,name:o,args:u}],p=[v(t,t)];for(;Ne();)T(),p.push(v(i.index,i.index)),Te.range=void 0,f.push(Pe()),d.push(Te.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),y=d.at(-1)??v(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:s}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:s}:_.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:h,args:g,argumentCounts:_,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:s}:{kind:`Apply`,operator:h,args:g,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:s}}if(r.kind===`Operator`&&xp(r.text)&&w(`(`))return{kind:`Apply`,operator:r.text,args:A(),location:s};if(r.kind===`Operator`&&xp(r.text)&&!n)return{kind:`Identifier`,name:r.text,location:s};switch(r.text){case`(`:{let e=he(()=>j());return D(`)`),e}case`[`:return De(r);case`{`:return ke(r);case`<<`:return Ae(r);case`@`:return{kind:`ExceptAt`,location:s};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return je(r);case`IF`:{let e=j();D(`THEN`);let t=j();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:s}}case`CASE`:return Me(r);case`LET`:{let e=[],t=[];for(o.push(/* @__PURE__ */ new Set);!E(`IN`);){if(n&&w(`RECURSIVE`))throw C(`Unexpected keyword RECURSIVE`,S(b()));if(E(`RECURSIVE`)){qe();continue}let r=Be(!1);r.kind===`Instance`?t.push(r):e.push(r)}o.pop();let r=j();return t.length===0?{kind:`Let`,definitions:e,body:r,location:s}:{kind:`Let`,definitions:e,instances:t,body:r,location:s}}case`CHOOSE`:{let e=ve(),t=E(`\\in`)?j():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:s}}case`WF_`:case`SF_`:{let e=Se(),t=he(()=>{D(`(`);let e=j();return D(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:s}}}throw oe(`Unexpected ${ee(r)}`,r)},Ie=(e,t,r)=>{a.last=a.preceding={low:t,high:r};let i=j(r+1),o=x(),s=o.text===`'`||mp.has(o.text)?dp.high:pp.get(o.text)?.high;if(!n&&o.kind===`Operator`&&s!==void 0&&s>=t)throw C(`Precedence conflict between ${e.text} and ${o.text}`,o);return i},Le=()=>{let e=a.preceding;a.preceding=void 0;let t=x(),r=f(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return Ee();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[Ie(t,4,4)],location:r};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[Ie(t,12,12)],location:r};case`[]`:return T(),{kind:`Always`,expression:Ie(t,4,15),location:r};case`<>`:return T(),{kind:`Eventually`,expression:Ie(t,4,15),location:r};case`ENABLED`:return T(),{kind:`Enabled`,expression:Ie(t,4,15),location:r};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:Ie(t,4,15),location:r};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:t.text,args:[n?j(9):Ie(t,10,13)],location:r}}return Fe(e)},j=(e=0)=>{let t=i.index,n=Le(),r={left:n.location.range?n:y(n,t),previous:void 0};for(;;){let n=x();if(n.kind!==`Operator`)break;let i=f(n);if(n.text===`'`&&e<=15){T(),a.last=dp,r.left=y({kind:`Prime`,expression:r.left,location:i},t);continue}if(mp.has(n.text)&&e<=15){T(),a.last=dp,r.left=y({kind:`Apply`,operator:n.text,args:[r.left],location:i},t);continue}if(n.text===`[`){T();let e=he(()=>O(()=>j()));he(()=>D(`]`)),a.last=fp,r.left=y({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&se(x(1))){T();let e=T().text;r.left=y({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let o=pp.get(n.text);if(!o||o.low<e)break;let s=r.previous;if(s){let e=!(s.low>o.high||s.high<o.low),t=s.text===n.text&&o.isAssociative;if(e&&!t&&(s.text!==`\\X`||n.text!==`\\X`))throw C(`Precedence conflict between ${s.text} and ${n.text}`,n)}if(T(),o.low>12&&w(`-`))throw C(`Precedence conflict between ${n.text} and -`,x());a.last=a.preceding=o;let c=j(o.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[v(t).end];r.left=l.kind===e&&s?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&s?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=y(r.left,t),r.previous={...o,text:n.text}}return r.left},Re=()=>{if(!E(`(`))return[];let e=Ke();return D(`)`),e},ze=()=>{let e=f(x()),t=j(),n=r[i.index-1],a={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:l[0].name,start:e,end:a}}},Be=e=>{let t=i.index;return y(He(e),t)},Ve=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),He=e=>{let t=x(),n=f(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...ze(),isLocal:e,isRecursive:d(t),location:n});if(t.kind===`Identifier`&&x(1).kind===`Operator`&&pp.has(x(1).text)&&x(2).kind===`Identifier`&&w(`==`,3)){let e=le(),t=T().text,n=le();return D(`==`),r(t,[Ve(e),Ve(n)])}let a=t.kind!==`String`&&gp.has(t.text),o=t.kind===`Identifier`&&mp.has(x(1).text)&&w(`==`,2);if(a||o){let e=a?t.text:x(1).text;a&&T();let n=le();return o&&T(),D(`==`),r(e,[Ve(n)])}let s=ce();if(E(`[`)){let t=he(()=>be());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:j(),isLocal:e,isRecursive:d(s),location:n}}let c=i.index,l=Re();return D(`==`),w(`INSTANCE`)?{...Ue(s,l,e,n),definitionRange:v(c)}:r(s,l)},Ue=(e,t,n,r)=>{let a=i.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:me(),substitutions:E(`WITH`)?O(()=>{let e=i.index,t=de(),n=v(e);return D(`<-`),{name:t,nameRange:n,expression:k()}}):[],isLocal:n,location:r,instanceRange:v(a)}},We=()=>{let e=i.index;return y(Ge(),e)},Ge=()=>{let e=f(x());if(w(`_`)&&x(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(x().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=ce();if(!E(`(`))return{name:t,arity:0,location:e};let n=O(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},Ke=()=>O(We),qe=()=>{let e=Ke();return e.forEach(e=>o[o.length-1].add(e.name)),e},Je=e=>{let t={value:0,offset:e};do{let e=x(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Np.has(e.text)&&t.value++,e.kind===`Operator`&&Pp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ye=()=>{let e=x(),t=x(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,Je(1)):t.kind===`Operator`&&mp.has(t.text)?w(`==`,2):t.kind===`Operator`&&pp.has(t.text)?x(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):e.kind!==`String`&&gp.has(e.text)&&t.kind===`Identifier`&&w(`==`,2)},Xe=[],Ze=()=>Xe[Xe.length-1]??-1,Qe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),$e=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},et=e=>!e.text.endsWith(`.`)&&!kp.has($e(e)),tt=e=>{let t=$e(e);if(kp.has(t))return;let n=Qe(e);if(n>=0)return`<${n}>${t}`;let r=Ze(),i=Xe[Xe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},nt=e=>{if(e.kind===`Keyword`)return Ep.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Xe.length===0;if(e.text[1]===`+`||Xe.length===0)return!0;let t=Ze();return t>=0&&Qe(e)>t},rt=e=>{let t=Qe(e),n=Xe.length-1,r=Xe[n-1]??-1,i=Xe[n]<0;return i&&(Xe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Xe[n]===t},it=e=>!s.has(e)&&l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),M=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Fp.has(e.name)&&!it(e.name):!1,at=()=>{let e=x();return e.kind===`Step`?et(e):e.kind===`Keyword`?Ap.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ye()},ot=()=>{let e=i.index,t=x();return t.kind===`Operator`&&!_p.has(t.text)&&xp(t.text)?(i.index++,y({kind:`OperatorReference`,operator:t.text,location:f(t)},e)):E(`MODULE`)?y({kind:`ModuleFact`,name:ce(),location:f(t)},e):j()},st=e=>c[c.length-1]?.add(e),ct=e=>{c.push(/* @__PURE__ */ new Set);let t=e();return c.pop(),t},N=e=>c.some(t=>t.has(e))||l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),P=()=>{let e=i.index,t=x(),n=O(()=>{let e=x();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw oe(`Expected a definition name but found ${ee(e)}`,e);return i.index++,e.text},`!`),r=f(t);return y(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},lt=()=>{if(n)return O(P);let e=O(ot),r=t===`tlc`?e.find(e=>e.kind===`Identifier`&&N(e.name)):void 0;if(r)throw C(`DEF clause entry should describe a defined operator`,r.location);return e},F=()=>({facts:at()?O(ot):[],defs:E(`DEF`)||E(`DEFS`)?lt():[]}),I=()=>{let e=i.index,n=T(),r=n.text===`USE`&&E(`ONLY`),a=v(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...F(),keyword:a,location:f(n)},s=o.kind===`Hide`&&t===`tlc`?o.facts.filter(e=>!M(e)):[];if(s.length>0)throw p(s.map(t=>({location:g(t.location.range??v(e)),message:`The only expression allowed as a fact in a HIDE is
467
+ the name of a theorem, assumption, or step.`})));return y(o,e)},ut=()=>{let e=i.index,t=f(x()),n=E(`NEW`),r=x().kind===`Keyword`?jp.get(x().text):void 0;if(!n&&r===void 0)throw oe(`Expected a declaration but found ${ee(x())}`);if(r!==void 0&&T(),r===`Variable`){let n=le();return st(n.name),y({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let a=We();st(a.name);let o=(r??`Constant`)===`Constant`&&w(`\\in`);if(o&&a.arity>0)throw C(`declared symbol with arguments before \\in`);return o&&T(),y({kind:`NewSymbol`,name:a.name,arity:a.arity,level:r??`Constant`,set:o?j():void 0,nameRange:a.location.range,location:t},e)},dt=()=>{let e=i.index,t=f(D(`ASSUME`)),n=O(()=>w(`ASSUME`)?ct(dt):x().kind===`Keyword`&&Mp.has(x().text)?ut():j());return D(`PROVE`),y({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)},ft=e=>{let t={value:0};for(;x(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return x(t.value).kind===`Identifier`&&w(e,t.value+1)},pt=(e,t)=>{e.forEach(st),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(st))},mt=()=>{let e=x();if(w(`USE`)||w(`HIDE`))return I();if(w(`INSTANCE`)){let t=i.index;return y(Ue(void 0,[],!1,f(e)),t)}if(w(`DEFINE`)||Ye()){let t=i.index;E(`DEFINE`);let n=[Be(!1)];for(;Ye();)n.push(Be(!1));let r={kind:`Define`,definitions:n,location:f(e)};return y(r,t)}if(E(`HAVE`))return{kind:`Have`,expression:j()};if(E(`TAKE`)){let e=ge(),t=ue(e?[]:O(le)),n=e?be():[];return pt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:O(()=>j())};if(E(`PICK`)){let e=ft(`:`),t=ue(e?O(le):[]),n=e?[]:be();return pt(t.names,n),D(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return E(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?dt():j()}},ht=e=>{let t=x();if(t.kind!==`Step`)throw oe(`Expected a step number but found ${ee(t)}`,t);if(!rt(t))throw C(`${e?`QED step`:`step`}'s number has bad level`,t);if(Qe(t)<0&&tt(t)!==void 0)throw C(`<*> and <+> cannot be used for a named step`,t);return i.index++,{name:tt(t),token:t.text,location:f(t)}},gt=()=>{let e=i.index,t=ht(w(`QED`,1)),n=i.index,r=/* @__PURE__ */ new Set;c.push(r);let a=E(`QED`)?{kind:`Qed`}:mt(),o=v(e),s=v(n),l=nt(x());if(l&&!Dp.has(a.kind))throw C(`Proof of a step that does not take a proof`);let u=l?vt():void 0;return c.pop(),(a.kind!==`Assert`||a.isSuffices)&&r.forEach(st),y({...t,body:a,head:o,statement:s,proof:u},e)},_t=()=>{let e=f(x());if(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=v(i.index-1);return{kind:`By`,isOnly:E(`ONLY`),...F(),keyword:t,location:e}}let t=x(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=v(i.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`PROOF`);let n=[gt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(gt());return{kind:`Steps`,level:Ze(),steps:n,location:e}},vt=()=>{let e=i.index;Xe.push(-1);let t=ct(_t);return Xe.pop(),y(t,e)},yt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},bt=e=>{let t=i.index,n=T(),r=x().kind===`Identifier`&&w(`==`,1)?ce():void 0;r!==void 0&&(s.add(r),T());let a=ct(()=>({statement:w(`ASSUME`)?dt():j(),proof:nt(x())?vt():void 0})),o=a.statement,c=y({name:r,statement:o,proof:a.proof,location:f(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&o.kind!==`AssumeProve`&&yt(e,y({kind:`Operator`,name:r,params:[],body:o,isLocal:!1,isRecursive:!1,location:f(n)},t))},xt=()=>{let e=i.index;return y(St(),e)},St=()=>{let e=T(),t=f(e),n=e.text===`AXIOM`;if(x().kind===`Identifier`&&w(`==`,1)){let e=ce();return s.add(e),T(),{name:e,expression:j(),isAxiom:n,location:t}}return{name:void 0,expression:j(),isAxiom:n,location:t}},Ct=()=>{let e=f(D(`----`));D(`MODULE`);let t=me();D(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(l.push(n),o.push(/* @__PURE__ */ new Set),E(`EXTENDS`)&&O(()=>{let e=i.index;n.extends.push(me()),n.extendsRanges.push(v(e))});;){let t=i.index;te.index=t;let r=x();if(r.kind===`ModuleEnd`)return e.range={module:l[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},l.pop(),o.pop(),n;if(r.kind===`Separator`){if(w(`MODULE`,1)){let e=Ct();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=f(T()),r=Ke();n.constants.push(...r),e.range=v(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=f(T()),r=O(()=>{let e=i.index,t=f(x());return y({name:ce(),arity:0,location:t},e)});n.variables.push(...r),e.range=v(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=xt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&yt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(w(`USE`)&&w(`ONLY`,1))throw oe(`Expected a module unit but found ${ee(r)}`);let e=I();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:qe()});continue;case`INSTANCE`:wt(n,y(Ue(void 0,[],!1,f(r)),t));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){wt(n,y(Ue(void 0,[],!0,f(r)),t));continue}wt(n,y(He(!0),t));continue}r.kind===`Keyword`&&Tp.has(r.text)?bt(n):wt(n,Be(!1))}}},wt=(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}))},Tt=Ct(),Et=fe.isUsed?up(e):void 0;if(Et!==void 0)throw new u(Et);return Tt},Rp=e=>Lp(e,`tlc`),zp=e=>Lp(e,`tlapm`),Bp=e=>Lp(e,`sany`),Vp=25214903917n,Hp=(1n<<48n)-1n,Up=2147483647,Wp=e=>{let t={value:(BigInt.asUintN(64,e)^Vp)&Hp},n=e=>(t.value=t.value*Vp+11n&Hp,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Vp)&Hp},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<=Up)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Gp=10454148508367108822n,Kp=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Gp);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),qp=Int32Array.from(Kp,e=>Number(BigInt.asIntN(32,e>>32n))),Jp=Int32Array.from(Kp,e=>Number(BigInt.asIntN(32,e))),Yp=Number(BigInt.asIntN(32,Gp>>32n)),Xp=Number(BigInt.asIntN(32,Gp));let Zp=Yp,Qp=Xp;const $p=e=>{let t=(e^Qp)&255;Qp=(Qp>>>8|Zp<<24)^Jp[t],Zp=Zp>>>8^qp[t]},em=e=>{for(let t=0;t<32;t+=8)$p(e>>>t)},tm=e=>{if(typeof e==`boolean`)$p(0),$p(e?116:102);else if(typeof e==`number`)$p(1),em(e);else if(typeof e==`string`){$p(3),em(e.length);for(let t=0;t<e.length;t++)$p(e.charCodeAt(t))}else if(I(e))$p(21),em(kt(e.name)+1);else if(F(e)){let t=Dr(e);$p(9),em(t.domain.length);for(let e=0;e<t.domain.length;e++)tm(t.domain[e]),tm(t.range[e])}else{let t=R(e).elements;$p(5),em(t.length);for(let e of t)tm(e)}},nm=e=>{let t={high:Zp,low:Qp};Zp=Yp,Qp=Xp;for(let t of e)tm(t);let n=BigInt(Zp>>>0)<<32n|BigInt(Qp>>>0);return Zp=t.high,Qp=t.low,n},rm=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||I(e))return 5;if(typeof e==`string`)return 5+e.length;if(F(e)){let t=Dr(e);return t.domain.reduce((e,n,r)=>e+rm(n)+rm(t.range[r]),5)}return R(e).elements.reduce((e,t)=>e+rm(t),5)},im=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Zp=n<32?0:1<<n-32,Qp=n<32?1<<n:0;for(let t=0;t<e;t++)$p(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]^Zp,t[n+1]=t[a+1]^Qp}}return t},am=(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=rm(e);return Zp=0,Qp=0,tm(e),r.set(e,i.length),i.push(n,Zp,Qp),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=im(e);return n.set(e,r),r};return(n,r)=>{let s={high:Zp,low:Qp},c={high:Yp,low:Xp};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}Zp=s.high,Qp=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},om=[],sm=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},cm=()=>{for(let e=1277011;om.length<1341;e++)sm(e)&&om.push(e);return om},lm=e=>{let t=cm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},um=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},dm=e=>{for(let t=Math.max(e,9);;t++){let e=um(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)}}},fm=(e,t,n)=>{if(t<=0)return[];let r=dm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(lm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},pm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Up),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},mm=(1n<<63n)-1n-24n,hm=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(mm*BigInt(n)+i)%t;return r<0n?r+t:r})},gm=(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,_m=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=qn(e.domain),n=R(e.range).elements;return{lists:t.map(()=>n),create:e=>Bt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>R(e).elements),create:t=>Xn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>R(e).elements),create:Yn}}},vm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,ym=(e,t,n,r)=>{if(pr(t))return[];let i=r===`1.7.4`?pm:fm;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=vm(t,r)?void 0:_m(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Up)?hm(e,t,n):i(e,Number(t),n)).map(e=>a.create(gm(a.lists,e)))}let o=R(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},bm=(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},xm=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...qn(e.domain)];return Bt(n,n.map(()=>xm(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Xn(e.names.map((n,r)=>[n,xm(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Yn(e.factors.map(e=>xm(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 bm(R(e).elements,t)},Sm=(e,t=0n)=>{let n=Wp(t),r={random:Wp(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Xn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:nm,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},Cm=e=>zn([...e.possibleCounts].map(([e,t])=>[e,t])),wm=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Cm(e)]]),Tm=(e,t,n)=>new S(`Applying ${e} to the following value,\nwhich is not ${t}:\n${z(n)}`),Em=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${z(r)}`),Dm=e=>F(e)?Dr(e):void 0,Om=(e,t,n)=>{let r=V(e,t,n),i=Dm(r);if(!i)throw Tm(n,`a function with a finite domain`,r);return i},km=(e,t,n)=>{let r=V(e,t,n),i=Dm(r);if(!i)throw Em(t===0?`first`:`second`,n,`bag`,r);return i},Am=(e,t)=>{if(!P(e)||!L(e))throw t();return R(e).elements},jm=e=>e.range.every(e=>typeof e==`number`&&e>0),Mm=(e,t)=>{let n=e.domain.findIndex(e=>Qt(e,t));return n===-1?void 0:e.range[n]},Nm=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Pm=Nm(`BagDiff`,`tlc2.value.impl.Value`,2),Fm=Nm(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Im=Nm(`BagUnion`,`tlc2.value.impl.Value`,1),Lm=Nm(`BagOfAll`,`tlc2.value.impl.Value`,2),Rm=Nm(`BagCup`,`tlc2.value.impl.Value`,2),zm=Nm(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Bm=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Ri(e)}`;throw Bi(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Vm=(e,t,n)=>{let r=Bm(e,n)+Bm(t,n);if(Mi(r))throw Ni(`${e}+${t}`);return r},Hm=(e,t,n,r)=>{let i=Mm(n,e.domain[t]),a=Bm(e.range[t],r);return i===void 0?a:a-Bm(i,r)|0},Um=(e,t)=>zn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Qt(e[0],r));a?a[1]=Vm(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Wm=Bt([],[]),Gm=e=>[Oi(`EmptyBag`,Wm),H(`IsABag`,1,e=>{let t=Dm(V(e,0,`IsABag`));return t!==void 0&&jm(t)}),H(`BagCardinality`,1,e=>{let t=V(e,0,`BagCardinality`);return Om(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Tm(`BagCardinality`,`a bag`,t);return Vm(e,n,zm)},0)}),H(`BagIn`,2,e=>{let t=V(e,1,`BagIn`),n=Mm(Om(e,1,`BagIn`),V(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Em(`second`,`BagIn`,`bag`,t);return n>0}),H(`CopiesIn`,2,e=>{let t=V(e,1,`CopiesIn`),n=Mm(Om(e,1,`CopiesIn`),V(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Em(`second`,`CopiesIn`,`bag`,t);return n}),H(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=km(e,t,`(+)`);if(!jm(n))throw Em(t===0?`first`:`second`,`(+)`,`bag`,V(e,t,`(+)`));return n});return Um(t,Rm)}),H(`\\ominus`,2,e=>{let t=km(e,0,`(-)`),n=km(e,1,`(-)`);return zn(t.domain.flatMap((e,r)=>{let i=Hm(t,r,n,Pm);return i>0?[[e,i]]:[]}))}),H(`BagUnion`,1,e=>{let t=V(e,0,`BagUnion`),n=Am(t,()=>Tm(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??Wm;let r=n.map(e=>{let n=Dm(e);if(!n)throw new S(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${z(t)}`);return n});return Um(r,Im)}),H(`\\sqsubseteq`,2,e=>{let t=Om(e,0,`\\sqsubseteq`),n=Om(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Hm(t,r,n,Fm)<=0)}),ki(`BagOfAll`,2,e=>{let t=Di(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new S(`The first argument of BagOfAll should be an operator, but instead it is:\n${z(t.literalBody)}`);let n=V(e,1,`BagOfAll`),r=Dm(n);if(!r)throw Em(`second`,`BagOfAll`,`function with a finite domain`,n);return Um(r.domain.map((e,n)=>Bt([t.call([e])],[r.range[n]])),Lm)}),H(`SubBag`,1,t=>{let n=V(t,0,`SubBag`);if(!F(n))throw new y(`DOMAIN expects a function but received ${z(n)}`);let r=Dr(n),i=Nn(r.range).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new y(`Attempted to apply a function to ${z(r)}, which is not in its domain`);return Nn(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Bt(e.map(e=>e[0]),e.map(e=>e[1]))))}),H(`BagToSet`,1,e=>Fr(Om(e,0,`BagToSet`))),H(`SetToBag`,1,e=>{let t=V(e,0,`SetToBag`),n=Am(t,()=>Tm(`BagToSet`,`a function with a finite domain`,t));return Bt([...n],n.map(()=>1))})],Km=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,qm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Jm=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Ym=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Xm=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Zm=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Qm=e=>{if(!F(e))return!1;let t=Dr(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},$m=(e,t)=>Bi(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Ri(t)}`),eh=(e,t)=>Bi(e,`Cannot cast tlc2.value.impl.${Ri(t)} to tlc2.value.impl.StringValue`),th=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),nh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw $m(t,e);return`[${R(e).elements.map(e=>ih(e,t)).join(`,`)}]`},rh=(e,t)=>{let n=Dr(e),r=br(n);return r?`[${r.map(e=>ih(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${th(typeof e==`string`?e:z(e))}:${ih(n.range[r],t)}`).join(`,`)}}`},ih=(e,t)=>typeof e==`string`?th(e):typeof e==`object`?e.kind===`ModelValue`?th(e.name):P(e)?nh(e,t):rh(e,t):String(e),ah=e=>{if(P(e))return nh(e,Km);if(!F(e)||Qm(e))throw $m(Km,e);return rh(e,Km)},oh=e=>{if(!F(e))throw $m(qm,e);return rh(e,qm)},sh=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))},ch=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Dt(e);if(Array.isArray(e))return Yn(e.map(e=>ch(e,t)));if(typeof e==`object`&&e)return Xn(Object.entries(e).map(([e,n])=>[Dt(e),ch(n,t)]));throw Bi(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},lh=(e,t)=>{if(e.trim()===``)return ch(null,t);try{return ch(JSON.parse(e,(e,t,n)=>typeof t==`number`?sh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Bi(t,e.message):e}},uh=(e,t)=>{if(typeof e!=`string`)throw eh(t,e);return e},dh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Bi(n,`${t} (No such file or directory)`);return r},fh=e=>[Ai(`ToJson`,1,e=>Dt(ih(V(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Ai(`ToJsonArray`,1,e=>Dt(ah(V(e,0,`ToJsonArray`)))),Ai(`ToJsonObject`,1,e=>Dt(oh(V(e,0,`ToJsonObject`)))),Ai(`JsonSerialize`,2,t=>{let n=uh(V(t,0,`JsonSerialize`),Jm),r=V(t,1,`JsonSerialize`);if(!br(r)&&!Qm(r))throw new S(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${z(r)}`);return e.writeFile?.(n,ih(r,Jm)),!0}),Ai(`ndJsonSerialize`,2,t=>{let n=uh(V(t,0,`ndJsonSerialize`),Ym),r=V(t,1,`ndJsonSerialize`),i=br(r);if(!i)throw new S(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${z(r)}`);return e.writeFile?.(n,i.map(e=>`${ih(e,Ym)}\n`).join(``)),!0}),Ai(`JsonDeserialize`,1,t=>{let n=uh(V(t,0,`JsonDeserialize`),Xm);return lh(dh(e,n,Xm),Xm)}),Ai(`ndJsonDeserialize`,1,t=>{let n=uh(V(t,0,`ndJsonDeserialize`),Zm);return Yn(dh(e,n,Zm).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>lh(e,Zm)))})],ph=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,mh=1e6,hh=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),gh=(e,t,n)=>{if(typeof e!=`number`||e<0)throw hh(t,n,`nonnegative integer`,z(e));return e},_h=(e,t,n,r)=>{if(!P(e)||!L(e))throw hh(t,n,r,z(e));return R(e).elements},vh=(e,t,n,r)=>Nn(Array.from({length:t},()=>Nn(e.filter(()=>r.nextDouble()<n)))),yh=(e,t)=>{let n=`RandomSetOfSubsets`,r=gh(V(e,0,n),`first`,n),i=gh(V(e,1,n),`second`,n),a=_h(V(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw hh(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw hh(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return vh(a,r,a.length===0?0:i/a.length,t.getRandom())},bh=e=>[Ai(`RandomSubset`,2,t=>{let n=V(t,0,`RandomSubset`);if(typeof n!=`number`)throw hh(`first`,`RandomSubset`,`nonnegative integer`,z(n));if(n<0)throw Bi(ph,String(n));let r=V(t,1,`RandomSubset`);if(!P(r)||!pr(r)&&!L(r))throw hh(`second`,`RandomSubset`,`a finite set`,z(r));let i=vm(r,e.version);if(i&&i.reduce((e,t)=>e*R(t).elements.length,1)>mh)throw Bi(ph,`Attempted to construct a set with too many elements (>${mh}).`);return Nn(ym(n,r,e.getRandom(),e.version))}),Ai(`RandomSetOfSubsets`,3,t=>yh(t,e)),Ai(`TestRandomSetOfSubsets`,3,t=>Yn(Array.from({length:5},()=>R(yh(t,e)).elements.length)))],xh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Sh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${xh})`,Ch=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${xh}) throws java.io.IOException`,wh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${xh})`,Th=()=>Xn([[`action`,Nn([])],[`state`,Nn([])]]),Eh=()=>Xn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Dh=e=>Xn([[`name`,e??`UnnamedAction`],[`location`,Eh()]]),Oh=(e,t,n)=>{let r=e.map((e,t)=>Yn([t+1,Xn(Object.entries(e))])),i=r.slice(1).map((e,n)=>Yn([r[n],t[n],e])),a=n?[Yn([r[r.length-1],n.action,r[n.start]])]:[];return Xn([[`action`,Nn([...i,...a])],[`state`,Nn(r)]])},kh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return wm(e).get(t)},Ah=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),z(r));else throw new S(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${z(n)}`)},jh=e=>e.every(e=>e!==void 0),Mh=(e,t)=>Xn(t.variables.map((t,n)=>[t,e[n]])),Nh=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!B(e)){if(t.variableIndex.has(r))return!0;let e=pl(r,t);if(e&&!n.has(e)&&(n.add(e),Nh(e.body,t,n)))return!0}return hi(e).some(e=>Nh(e,t,n))},Ph=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[H(`AssertEq`,2,t=>{let n=V(t,0,`AssertEq`),r=V(t,1,`AssertEq`),i=Qt(n,r);return i||(e(z(`Assertion failed`,!0)),e(z(n,!0)),e(z(r,!0))),i}),qi(`AssertError`,2,e=>{let n=Di(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Bi(Sh,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=Ji(e,0,`AssertError`)();try{Ji(e,1,`AssertError`)()}catch(e){if(e instanceof y)return ba(e.message,t.isTool)===r;throw e}return!1}),Ai(`TLCGetOrDefault`,2,e=>{let n=V(e,0,`TLCGetOrDefault`);return kh(t,n)??V(e,1,`TLCGetOrDefault`)}),{...ki(`TLCGetAndSet`,4,n=>{let r=V(n,0,`TLCGetAndSet`),i=kh(t,r)??V(n,3,`TLCGetAndSet`),a=Di(n,1,`TLCGetAndSet`);return Ah(t,e,r,a.call([i,V(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Ai(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!jh(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Bi(Ch,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Yn(t.getBehavior(r).map(e=>Mh(e,n.environment)))}),Ai(`CounterExample`,0,()=>t.counterExample??Th()),H(`ToTrace`,1,e=>{let t=V(e,0,`ToTrace`);if(!F(t)||!Qt(Fr(t),Nn([`action`,`state`])))throw new y(`The argument of ToTrace should be a CounterExample, but instead it is:\n${z(t)}`);let n=R(Nr(t,`state`)).elements.map(e=>br(e)??[]);return Yn(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),H(`TLCModelValue`,1,e=>{let t=V(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new S(`The argument of ModelValue should be a string, but instead it is:\n${z(t)}`);return Rt(t)}),qi(`TLCDefer`,1,()=>!0),H(`TLCNoOp`,1,e=>V(e,0,`TLCNoOp`)),qi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!jh(r))throw Bi(wh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||fl(Ji(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new C(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),qi(`TLCCache`,2,(e,t)=>{let r=Di(e,0,`TLCCache`),a=ri(Ji(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Nh(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),H(`TLCFP`,1,e=>Number(BigInt.asIntN(32,nm([V(e,0,`TLCFP`)])))),Ai(`TLCEvalDefinition`,1,(e,t)=>{let n=V(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?pl(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new S(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${z(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new S(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return W({kind:`Identifier`,name:n,location:r.location},t)})]},Fh=(e,t)=>[Ai(`_Track`,2,e=>{let n=String(V(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,V(e,0,`_Track`)===!0?r+1:r),!0}),Ai(`_Counts`,0,()=>Cm(t)),Ai(`_CheckName`,1,n=>{let r=String(V(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(z(Cm(t),!0)),!1)}),Ai(`_PrintCounts`,0,()=>(e(z(Cm(t),!0)),!0))],Ih=e=>String(e).padStart(2,`0`),Lh=e=>`${e.getUTCFullYear()}.${Ih(e.getUTCMonth()+1)}.${Ih(e.getUTCDate())}.${Ih(e.getUTCHours())}${Ih(e.getUTCMinutes())}${Ih(e.getUTCSeconds())}`,Rh=e=>zn([...e].map(([e,t])=>[e,Yn([t])])),zh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Bh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Vh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Hh=(e,t,n)=>{if(e.version===`1.7.4`?!Bh.has(t)||!e.isStarted&&Vh.has(t):!e.isStarted&&zh.has(t))throw new S(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return Xn([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Xn([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Xn([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Dt(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Dt(Lh(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Dh(void 0);case`all`:return Rh(e.registers);case`all:named`:return Rh(wm(e))}if(t.startsWith(`s:`)){let n=wm(e).get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Dt(e.properties.get(t.slice(2))??t);throw new S(`TLCGet(${t}) was undefined.`)},Uh=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new S(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${z(t)}`);return Hh(e,t,n?.state)},Wh=e=>e.length===0?[[]]:e.flatMap((t,n)=>Wh([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Gh=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&R(e).elements.forEach(Gh),e.kind===`Function`&&e.range.forEach(Gh))},Kh=(t,n)=>[H(`Print`,2,e=>(t(`${N(z(V(e,0,`Print`),!0,!0))} ${N(z(V(e,1,`Print`),!0,!0))}`),V(e,1,`Print`))),H(`PrintT`,1,e=>(t(N(z(V(e,0,`PrintT`),!0,!0))),!0)),H(`Assert`,2,t=>{if(V(t,0,`Assert`)!==!0)throw new S(`The first argument of Assert evaluated to FALSE; the second argument was:\n${N(z(V(t,1,`Assert`)))}`,e.assertViolation);return!0}),H(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),H(`:>`,2,e=>zn([[V(e,0,`:>`),V(e,1,`:>`)]])),H(`@@`,2,e=>{let t=Ei(e,0,`@@`),n=Ei(e,1,`@@`);return Bn([...mt(t),...mt(n)])}),H(`ToString`,1,e=>Dt(z(V(e,0,`ToString`),!0))),H(`TLCEval`,1,e=>{let t=V(e,0,`TLCEval`);return Gh(t),t}),H(`Permutations`,1,e=>{let t=wi(e,0,`Permutations`);return Nn(Wh(t).map(e=>zn(t.map((t,n)=>[t,e[n]]))))}),ki(`SortSeq`,2,e=>{let t=Di(e,1,`SortSeq`);return Yn(Ti(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),n.version===`1.7.4`?Vi({...Ai(`TLCGet`,1,(e,t)=>Uh(n,V(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Vi(qi(`TLCGet`,1,(e,t)=>Uh(n,Ji(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Ai(`TLCSet`,2,e=>{let r=V(e,0,`TLCSet`);return Ah(n,t,r,V(e,1,`TLCSet`)),!0}),Oi(`Any`,Pt),H(`RandomElement`,1,e=>xm(Si(e,0,`RandomElement`),n.getRandom()))],qh=(e,t)=>e.every(e=>wr(e,t)),Jh=Nn([!1,!0]),Yh=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Rn(Yh(e,t,r),Yh(e,r,n))},Xh=[`\\cup`,`\\cap`,`\\`],Zh=e=>typeof e==`object`&&e.kind===`MixedSet`,Qh=e=>e.kind===`Interval`?R(e).elements:e.elements,$h=(e,t,n)=>{let r=Qh(t);if(e!==`\\cup`){let t=e===`\\cap`;return Pn(r.filter(e=>wr(e,n)===t))}if(r.length===0)return n;if(!lt(n))return Jt({kind:`SetOperation`,operator:e,left:t,right:n});let i=R(n).elements.filter(e=>!wr(e,t));return Pn([...r,...i])},eg=[Oi(`TRUE`,!0),Oi(`FALSE`,!1),Oi(`BOOLEAN`,Jh),Oi(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ji(`=`,jn),ji(`#`,(e,t)=>!jn(e,t)),H(`~`,1,e=>!bi(e,0,`~`)),H(`<=>`,2,e=>bi(e,0,`<=>`)===bi(e,1,`<=>`)),H(`/\\`,2,e=>bi(e,0,`/\\`)&&bi(e,1,`/\\`)),H(`\\/`,2,e=>bi(e,0,`\\/`)||bi(e,1,`\\/`)),H(`=>`,2,e=>!bi(e,0,`=>`)||bi(e,1,`=>`)),H(`\\in`,2,e=>wr(V(e,0,`\\in`),V(e,1,`\\in`))),H(`\\notin`,2,e=>!wr(V(e,0,`\\notin`),V(e,1,`\\notin`))),H(`\\subseteq`,2,e=>{let t=xi(e,0,`\\subseteq`),n=V(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&L(t.base)?qh(R(t.base).elements,n.base):qh(R(t).elements,n)}),...Xh.map(e=>H(e,2,t=>{let n=V(t,0,e),r=V(t,1,e);if(lt(n)&&lt(r)&&!Zh(n)&&!Zh(r)){if(e===`\\cup`&&pr(n))return r;let t=e===`\\cup`?Rn:e===`\\cap`?Ln:In;return Cr(()=>t(R(n),R(r)),()=>$h(e,n,r))}return lt(n)?$h(e,n,r):e!==`\\`&&lt(r)?$h(e,r,n):Jt({kind:`SetOperation`,operator:e,left:n,right:r})})),H(`SUBSET`,1,e=>({kind:`Subset`,base:V(e,0,`SUBSET`)})),H(`UNION`,1,e=>{let t=xi(e,0,`UNION`),n=hn(t)?t.elements.filter(hn):[];if(!hn(t)||n.length!==t.elements.length)return Jt({kind:`Union`,base:t});if(Zh(t)||n.some(Zh)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{wr(t,e)||e.elements.push(t)})),Pn(e.elements)}return n.length===0?Fn:Yh(n.map(R),0,n.length)}),H(`DOMAIN`,1,e=>{let t=V(e,0,`DOMAIN`);if(!F(t))throw new y(`DOMAIN expects a function but received ${z(t)}`);return Fr(t)})],tg=Ui(`Integers`,`Neg`,`IntValue`,1),ng=e=>{let t=Ui(e,`DotDot`,`IntervalValue`,2);return[Wi(e,`+`,`Plus`,(e,t)=>e+t),Wi(e,`-`,`Minus`,(e,t)=>e-t),Wi(e,`*`,`Times`,(e,t)=>e*t),Wi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new S(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new S(`0^0 is undefined.`);return e**t}),Wi(e,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new S(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/n)|0;return e<0&&Math.imul(e,n)!==t?e-1:e}let r=Math.floor(t/n);if(Mi(r))throw Ni(`${t} \\div ${n}`);return r}),Wi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new S(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),H(`..`,2,e=>({kind:`Interval`,low:Hi(V(e,0,`..`),t),high:Hi(V(e,1,`..`),t)}))]},rg=ng(`Naturals`),ig=ng(`Integers`),ag=e=>{let t=rg.indexOf(e);return t===-1?void 0:ig[t]},og=[Oi(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...rg,Ki(`<`,(e,t)=>e<t),Ki(`>`,(e,t)=>e>t),Ki(`<=`,(e,t)=>e<=t),Ki(`>=`,(e,t)=>e>=t,`>`)],sg=[Oi(`Int`,{kind:`InfiniteSet`,name:`Int`}),...ig,Ki(`>=`,(e,t)=>e>=t),H(`-.`,1,e=>{let t=Hi(V(e,0,`-`),tg);if(Mi(-t))throw Ni(`-${t}`);return-t})],cg=(e,t,n)=>{let r=V(e,t,n),i=br(r);if(!i)throw new S(`${n}\n${z(r)}`);return i},lg=(e,t,n)=>{let r=V(e,t,n);return typeof r==`string`?r:cg(e,t,n)},ug=(e,t,n)=>typeof e==`string`?Dt(e.slice(t,n)):Yn(e.slice(t,n)),dg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,fg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,pg=(e,t)=>{let n=Hd.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Vi(e,t):e}):t},mg=e=>pg(`Sequences`,[H(`Seq`,1,e=>({kind:`SequenceSet`,base:V(e,0,`Seq`)})),H(`Len`,1,e=>lg(e,0,dg(``,`Len`)).length),H(`\\o`,2,e=>{let t=lg(e,0,fg(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=cg(e,1,fg(`t \\o s`,`sequence`));return Yn([...t,...n])}let n=V(e,1,`\\o`);if(typeof n!=`string`)throw new S(`${fg(`t \\o s`,`string`)}\n${z(n)}`);return Dt(t+n)}),H(`Append`,2,t=>Yn([...cg(t,0,fg(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),V(t,1,`Append`)])),H(`Head`,1,e=>{let t=cg(e,0,dg(``,`Head`));if(t.length===0)throw new S(`Attempted to apply Head to the empty sequence.`);return t[0]}),H(`Tail`,1,e=>{let t=lg(e,0,dg(``,`Tail`));if(t.length===0)throw new S(`Attempted to apply Tail to the empty sequence.`);return ug(t,1)}),H(`SubSeq`,3,e=>{let t=lg(e,0,dg(`first `,`SubSeq`)),n=yi(e,1,`SubSeq`),r=yi(e,2,`SubSeq`);if(n>r)return ug(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new S(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${z(V(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return ug(t,n-1,r)}),ki(`SelectSeq`,2,e=>{let t=Di(e,1,`SelectSeq`);return Yn(cg(e,0,dg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new S(`The second argument of SelectSeq should be a operator, but instead it is:\n${z(n)}`);return n}))})]),hg=e=>pg(`FiniteSets`,[H(`IsFiniteSet`,1,e=>{let t=V(e,0,`IsFiniteSet`);if(P(t))return vr(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new y(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${z(t)}\nis a finite set.`:`Attempted to check if the ${ut(t)} ${z(t)} is a finite set.`)}),H(`Cardinality`,1,t=>{let n=V(t,0,`Cardinality`);if(!P(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new S(`Attempted to compute cardinality of the value\n${z(n)}`);return gr(n,e)})]),gg=/* @__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`]]]),_g=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:og};case`Integers`:return{extends:[`Naturals`],operators:sg};case`Sequences`:return{extends:[],operators:mg(n.version)};case`FiniteSets`:return{extends:[],operators:hg(n.version)};case`TLC`:return{extends:[],operators:pg(`TLC`,Kh(t,n))};case`Randomization`:return{extends:[],operators:bh(n)};case`_Possible`:return{extends:[],operators:Fh(t,n)};case`Json`:return{extends:[],operators:fh(r)};case`Bags`:return{extends:[],operators:Gm(i)};case`TLCExt`:return{extends:[],operators:Ph(t,n)};default:return}},vg=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),yg={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},bg=(e,t)=>{let n=yg[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},xg=`$subexpression`,Sg=(e,t)=>new u(`${e} at line ${t.line}, column ${t.column}`),Cg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Cg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of hi(e)){let e=Cg(r,t,n);if(e)return e}},wg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Tg=(e,t)=>{let n=e.location,r=wg(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 Sg(`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 Sg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:xg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:xg,args:e.args,location:n,resolution:wa},location:n}},Eg=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:wa})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:wa}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:wa};return Tg({...t,params:[...t.params,...r]},a)},Dg=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw Sg(r,i);Ea.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:g(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw Sg(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>qo(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw Sg(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=ja(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw Sg(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&Cg(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw Sg(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||Za(t.operand,1)!==0)throw Sg(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=to(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[Za(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw Sg(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=Za(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw Sg(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw Sg(`Unexpected subexpression selector`,i);let s=r?r.sets:no(n),c=s?.[Za(t.operand,s.length)];if(!c)throw Sg(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return Eg(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw Sg(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return Eg(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw Sg(`Subexpression selection failed`,i);return Tg(a,o.current)},Og=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return Qa(e,t,n)},kg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||hi(e).some(kg),Ag=(e,t,n,r=!1)=>{if(!kg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Xo(e,e=>Ag(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>jg(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>Ag(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Xo(e,e=>Ag(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Og(a.name,[],void 0,t):a.kind===`Apply`?Og(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Dg(o,t,a,r);return c!==a&&Ta.add(c),c},jg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Ag(e.expression,t,n,!0)}))}),Mg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Ng=(e,t)=>jg(e,Mg(t.definitions),()=>!1),Pg=(e,t)=>{let n=Mg([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>Ag(e,n,i),o=e=>i(e)||!n(e),s=e=>Ag(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return jg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?jg(e,n,o):Yo(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>kg(e.body))||e.assumptions.some(e=>kg(e.expression))?{...p,definitions:e.definitions.map(e=>Yo(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Fg=(e,t)=>`${e}${t}`,Ig=(e,t,n)=>`${e}${t}${n}`,Lg=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Rg=(e,t,n)=>`${e},${t},${n}`,zg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Bg=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Vg=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Hg=(e,t,n,r)=>({...zg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Ug=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Wg=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Gg=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,{...Hg(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Kg=Hg(`$Set`,0,[2],[1]),qg=Hg(`$Junction`,0,[3],[1]),Jg=Hg(`$Choose`,0,[2],[1]),Yg=Hg(`$Function`,0,[3],[1]),Xg=Hg(`$FcnApply`,0,[2,2],[1,1]),Zg=Hg(`$RcdSelect`,0,[2,0],[1,1]),Qg=Hg(`'`,2,[1],[0]),$g=Hg(`ENABLED`,1,[2],[0]),e_=Hg(`[]`,3,[3],[0]),t_=Hg(`$SquareAct`,2,[2,1],[0,0]),n_=Hg(`$WF`,3,[1,2],[0,0]),r_=Hg(`$TemporalExists`,3,[3],[0]),i_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),a_=e=>e.map(e=>({name:e,arity:0})),o_=(e,t)=>t.location.range?_(`${e}.`,t.location.range):new u(`${e} at line ${t.location.line}, column ${t.location.column}`),s_=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),c_=e=>e.kind!==`Let`&&e.kind!==`Label`,l_=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=Gg.get(t)??vg.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=zg(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(Ig(e,n,t))}),t.data.constraints.forEach((e,t)=>Bg(r.constraints,t,e)),Vg(r.argConstraints,Fg(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Vg(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>Ug(e,n))throw new u(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new u(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(Rg(t,n,r)),s=zg(Math.max(e.level,...t.filter((t,n)=>Wg(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)=>{Wg(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)=>Bg(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Bg(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Bg(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Bg(s.constraints,t,Ug(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=>Bg(s.constraints,e,Ug(r,a)))}))}),e.argParams.forEach(e=>{let t=Lg(e),n=a(t.operator)?.operator;n&&Bg(s.constraints,t.param,Ug(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Vg(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Vg(s.argConstraints,Fg(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Vg(s.argConstraints,Fg(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Lg(e),n=a(t.operator);n&&Vg(s.argConstraints,Fg(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Lg(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Lg(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(Ig(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(Ig(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(Ig(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,a_(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=zg();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=i_(n,a_(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 o_(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw o_(`Action used where only temporal formula or state predicate allowed`,e);s_.has(e.operator)&&l(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&c_(n)&&n.kind!==r)throw o_(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=v(e,n);t.constraints.forEach((e,t)=>Bg(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Vg(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof u)||t.sany?t:o_(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return zg();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return l(n,e),i(qg,n)}case`Prime`:case`Unchanged`:return s(Qg,[e.expression],t);case`Enabled`:return s($g,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(e_,[n])}case`If`:return s(qg,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(qg,[...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(qg,[e.body],t,e.bounds.map(e=>e.set),Ua(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw o_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?r_:qg,[e.body],t,[],e.names);case`Choose`:return s(Jg,[e.body],t,e.set?[e.set]:[],Ha(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(Kg,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(Kg,[e.predicate],t,[e.bound.set],Ha(e.bound.pattern));case`SetMap`:return s(Kg,[e.expression],t,e.bounds.map(e=>e.set),Ua(e.bounds));case`FunctionConstruction`:return s(Yg,[e.body],t,e.bounds.map(e=>e.set),Ua(e.bounds));case`Record`:return s(Yg,e.fields.map(e=>e.value),t);case`RecordSet`:return s(Kg,e.fields.map(e=>e.value),t);case`Except`:return s(Kg,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Xg,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(Kg,e.args,t)}]);case`Bracket`:return zg();case`FieldAccess`:return i(Zg,[a(e.record,t),{data:zg()}]);case`BoxAction`:case`AngleAction`:return s(t_,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(n_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return zg()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return hi(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,i_(t,a_(e.names))),i;default:return Xo(e,(e,n)=>(a(e,r,i_(t,a_(n))),e)),i}},_=(e,t,n,r)=>{let i=i_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...zg(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(Fg(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(Ig(e.name,n,t.name))).map(e=>Rg(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(Lg(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Lg(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,{...zg(),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}},u_=(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`?u_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=zg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Bg(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Vg(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},d_=(e,t,n,r)=>{let i=l_(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?u_(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:g(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=Bo([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?u_(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw p(n)}})),...n],r);if(l.length>0)throw p(l,!1,void 0,r)},f_=(e,t)=>e.maxLevels[t]??3,p_=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=l_({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=>Bg(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Bg(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Vg(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Lg(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)&&Bg(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(u_(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(Fg(e.name,i));a!==void 0&&f_(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=Lg(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=f_(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw p([...r.values()])}},m_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],h_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),g_=new Map(Ld.flatMap(e=>e.map(t=>[t,e[0]]))),__=e=>g_.get(e)??e,v_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},y_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(v_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},b_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),x_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:__(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:__(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}},S_=(e,t)=>{let n=[];for(let r=t;;){let t=x_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},C_=e=>({line:e.line,column:e.column}),w_=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=S_(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},T_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,E_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},D_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&T_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&T_(e[n+1],e[n+2])?n+=T_(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=>E_[e])}"`:r.text)}return t},O_=e=>e[2]?.text,k_=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},A_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>A_(e.modules,t)).find(Boolean),j_=(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:Vd.get(i)??t?.(i)??Ip(e,i),s=o===void 0?[]:xe(o),c=k_(s),l=c.get(O_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Rp(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>A_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},M_=(e,t)=>{let n=j_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=S_(t,e+1);r.push({location:C_(t[e]),apply:e=>i.forEach(t=>e.put(b_(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:C_(u),apply:t=>t.put(b_(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`&&S_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),h_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(C_(u)),r.push({location:C_(u),apply:e=>e.put(b_(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(b_(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=__(e.name);r.push({location:e.location,apply:n=>n.put(b_(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(b_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(b_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Aa(e.location,t.location)?-1:+!!Aa(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=y_();i.set(e??``,s),Id.toReversed().forEach(e=>s.put(b_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},N_=(e,t,n)=>M_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),P_=(e,t)=>{let n=M_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},F_=(e,t)=>N_(e,t,`variable`),I_=(e,t,n)=>{let r=j_(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)}),Rd.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=w_(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),h=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},g=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?h(n,r,t):[n,i]};return t},_=g(e=>e.extends),v=g(e=>e.instances),y=/* @__PURE__ */ new Set([void 0]),b=/* @__PURE__ */ new Map;D_(s(void 0)).forEach((e,t)=>{t===3&&Bd.forEach(a),a(e)});let x=u(void 0);for(;;){let e=_(x,/* @__PURE__ */ new Set)??v(x,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;if(f.add(`${t.key}>${n}`),b.set(t.unit,[...b.get(t.unit)??[],n]),!y.has(n)){if(y.add(n),r(n).tokens.length===0){let e=t.unit??O_(r(void 0).tokens);throw m(n,e)}D_(s(n)).forEach(a)}}m_.forEach(a);let ee=/* @__PURE__ */ new Set,te=e=>{if(ee.has(e))return;ee.add(e);let t=b.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(te),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return te(void 0),zd.forEach(a),[...i]},L_=t=>{switch(t.kind){case`Number`:try{return dt(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Rt(t.name);case`Set`:return Nn(t.elements.map(L_))}},R_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],z_=(e,t)=>{try{return Rp(e)}catch(n){if(!(n instanceof u))throw n;let r=up(e);throw r===void 0?n:p([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},B_=e=>new u(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),V_=(e,t)=>e.location.range&&t.location.range&&{location:g(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${g(t.location.range)}.`},H_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,U_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:H_(e),W_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:wa},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),G_=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>z(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new y(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Qt(t,r)})});if(t)return t[1];throw new y(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:z(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},K_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||hi(e).some(e=>K_(e,t)),q_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(as(e),n.get(e)??n.size)),n},J_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Y_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw il(e);if(e.kind===`Number`&&!pu(e.value))throw al(e);Y_(e.kind===`Let`?[...hi(e),...J_(e.instances??[])]:hi(e))}),X_=(e,t)=>{let n=Rp(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Set,s=new Map(eg.map(e=>[e.name,e])),c=/* @__PURE__ */ new Map,l=Sm(e.checkDeadlock,t.seed);l.isWarningEnabled=t.isWarningEnabled??!0,l.isTool=t.isTool??!1,l.version=t.version??`master`;let d=/* @__PURE__ */ new Map,f=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,b=[],x=/* @__PURE__ */ new Map,ee=[],te=[],S=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne={value:0},re=e=>`${e}#${ne.value++}`,ie=[],C=[],ae=p_(e=>{let t=_.get(e)??ue(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>r.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,w=/* @__PURE__ */ new Map,T=e=>{let n=c.get(e);if(n)return n;let r=_g(e,t.print,l,t.files,s);if(!r)return;gg.get(e)?.forEach(T);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>T(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{s.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:vg.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:bg(e,t.name)??i.get(t.name)?.range})}),c.set(e,i),i},E=e=>{let t=T(e),n=gg.get(e)??[];return t&&S(e,n),t&&n.includes(`Integers`)&&T(`Integers`),t},D=e=>(Y_([...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]),...J_(e.instances)]),e.modules.forEach(D),e);D(n);let ce=(e,n)=>{let r=t.loadModule?.(e)??wd.get(e)??Ip(t.source,e);if(r===void 0)throw m(e,n);let i=z_(r,e);if(i.name!==e)throw p([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return D(i)},le=e=>{let t=te.indexOf(e.name);if(t!==-1)throw new u(`Circular dependency among .tla files; dependency cycle is: ${[...te.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];te.push(e.name),ee.push(n);let o=be(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:C,levelChecks:a});if(ee.pop(),te.pop(),i.length>0)throw p(i,!1,void 0,C);let s=r.find(e=>n.has(e.name)),c=s&&d.get(s.name),l=c&&V_(s,c.module);if(l)throw p([l],!1,void 0,C);if(s)throw B_(s);return a.forEach(e=>e()),{linked:o,closure:n}},ue=(e,t)=>{let n=d.get(e);if(n)return S(e,x.get(e)??[]),n;let r=le(ce(e,t));return d.set(e,r.linked),x.set(e,r.closure),S(e,r.closure),r.linked},de=(e,t,n,s,c)=>{let l=c?void 0:E(e.module);if(l)return fe(e,l);let u=c??ue(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=R_(u),f=`#${ne.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=zo(Ng(e,t),d,t,n);ie.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=_s({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Wo(t,p)])),variables:new Set(u.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,c,l)=>{let u=re(`${c}@${t.name}`),f=l(u);return r.set(u,f),d.length>0&&o.add(f),e.name!==void 0&&se.set(u,`${e.name}!${se.get(n)??c}`),i.set(u,!s),a.set(u,{source:n,prefix:e.params.length}),u},createName:re});return pe(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&w.set(r,n),r})},fe=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),pe=(e,t,n,r)=>{let a=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!a.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:i.get(n.key)===!0?e.location.range:n.range}];let a=`${e.name}!${t}`;return[a,{key:r(n.key,a),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},me=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:wa})),he=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:me(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),O=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ge=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=O(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:me(r,n),location:n}}},_e=(e,t,n,a)=>{let o=e.location,s=a?void 0:E(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=O(n.arity);return he(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??ue(e.module,n),l=`#${ne.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=R_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};ie.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>K_(f(e),p),h=d.map(t=>{let n=ge(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=_s({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:me(e.params,o),location:o,resolution:wa}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:wa}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:W_(a,i)),i},createName:re}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=O(n.arity),a=[...e.params,...i];return he(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ve=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),ye=/* @__PURE__ */ new Map,be=(e,a)=>{let o=Fd(e,t.loadClass?.(e.name),e===n);ye.set(e.name,o.overrides);let s=o.module,c=ie.length,l=new Map([...eg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...a.symbols]),u=/* @__PURE__ */ new Map,d={location:Po,errors:[],warnings:[]},p=[d],m=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);U_(n.kind)===U_(e.kind)?d.warnings.push({location:r,message:`Warning: the ${H_(n.kind)} of '${t}' conflicts with \nits ${H_(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${H_(e.kind)} of '${t}' conflicts with \nits ${H_(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,x=[],ee=[...s.constants],te=s.variables.map(e=>e.name),S=s.variables.map(e=>e.location);s.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:E(e);if(n){m(n);return}let r=t??ue(e,s.name);ee.push(...r.constants.filter(e=>ee.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{te.includes(e)||(te.push(e),S.push(r.variableLocations[t]))}),m(r.exported),r.facts.forEach(e=>v.add(e)),r.modules.forEach((e,t)=>y.set(t,e)),x.push(r)});let ne=new Map(l),re=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});re.forEach(e=>h.set(e.name,oe(e)));let se=e=>({key:D(e),arity:ja(e),params:Ma(e),kind:Fo(s,e)?`Theorem`:`Definition`,range:e.location.range}),T=ee.length===0&&te.length===0,D=e=>s===n?e.name:`${e.name}@${a.id}`,ce=/* @__PURE__ */ new Map,le=()=>new Map([...a.modules,...y]),me=e=>{let t=s.instances.find(t=>t.module===e.name);return t!==void 0&&Aa(e.location,t.location)},he=e=>{let t=s.modules.find(t=>t.name===e.module);return t?me(t)?y.get(t.name):void 0:le().get(e.module)},O=e=>({imported:l,getInstance:e=>{let t=he(e),n=t?void 0:E(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:s.name};let r=t??ue(e.module,s.name),i=R_(r);return{declarations:i,symbols:pe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:D,instanced:ce,facts:v,reports:p,warnings:a.warnings}),ge=e=>new Map([...l,...re.filter(t=>Aa(t.location,e)).map(e=>[e.name,oe(e)]),...s.definitions.filter(t=>Aa(t.location,e)).map(e=>[e.name,se(e)])]),xe=e=>{let t=le(),n=t.get(e.name),r=n&&V_(e,n.module);if(n&&!r)throw B_(e);a.nested.push(e);let i={location:e.location,errors:[],warnings:[]};p.push(i);let o=be(e,{id:`${a.id}/${e.name}`,symbols:ge(e.location),modules:t,nested:a.nested,errors:i.errors,warnings:i.warnings,levelChecks:a.levelChecks});r&&i.errors.push(r),n||y.set(e.name,o),f.has(e.name)||f.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=de(e,s,O(s),T,le().get(e.module));ce.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>xe(e)}))].sort((e,t)=>Aa(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=Pg(xs(s,(e,t)=>_e(e,t,s.name,he(e))),ve(l));a.errors.push(...Vo(Se,O(Se))),Se.definitions.forEach(e=>{let t=D(e);r.set(t,e),i.set(t,!T);let n=se(e),a=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||a!==void 0&&!Aa(a,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ce={module:Se,constants:ee,variables:te,variableLocations:S,visible:l,exported:h,modules:y,extended:x,facts:/* @__PURE__ */ new Set([...v,...[...Se.theorems,...Se.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,Ce);let we=ie.splice(c).map(e=>({location:e.location,check:()=>ae(e)}));return a.levelChecks.push(()=>d_(Se,{constants:new Set(ee.map(e=>e.name)),variables:new Set(te),getDefinition:e=>r.get(l.get(e)?.key??e),getQualifiedName:e=>w.get(l.get(e)?.key??e)},we,C)),b.push(Ce),Ce},xe=le(n).linked;C.length>0&&!t.isSanyReported&&t.print(h(C));let Se=e=>xe.visible.get(e)?.key??e;xe.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(xe,/* @__PURE__ */ new Set);let k=xe.constants.map(e=>e.name),Te=xe.variables,A=e=>e.module===void 0?[e.name,Se(e.name)]:e.module===n.name||k.includes(e.name)?[]:[(d.get(e.module)??f.get(e.module))?.visible.get(e.name)?.key??e.name],Ee=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:xe.constants.find(t=>t.name===e)?.arity??0},De=/* @__PURE__ */ new Map,Oe=/* @__PURE__ */ new Set,ke=(e,t)=>{s.set(e,t),r.delete(e),De.delete(e),Oe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=L_(e.value);An(t),A(e).forEach(e=>{let n=Ee(e);n===0?De.set(e,t):ke(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ae=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ae.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new v(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(L_),L_(e.value)]),Ae.set(t,n)}),Ae.forEach(e=>A(e).forEach(t=>ke(t,G_(e.name,Ee(t)||e.rows[0][0].length,e.rows))));let je=new Map(e.substitutions.flatMap(e=>A(e).map(t=>[t,Se(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!k.includes(n)&&!xe.visible.has(n))throw new v(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new v(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=Se(i),o=r.get(a);if(!(o!==void 0||s.has(a)||De.has(a)||k.includes(i)||Te.includes(i)))throw new v(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(o?.kind===`Operator`&&o.params.length!==(xe.constants.find(e=>e.name===n)?.arity??xe.visible.get(n)?.arity))throw new v(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let Me=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(A)),Ne=(e,t)=>{if(Me.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&Ne(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=Ne(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=he(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),xe.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let Pe=k.filter(e=>!De.has(e)&&!je.has(e)&&!Oe.has(e));if(Pe.length>0&&!t.isUnconfigured)throw new v(`The constant parameter ${N_(t.source,t.loadModule,`constant`).find(e=>Pe.includes(e))??Pe[0]} is not assigned a value by the configuration file.`);t.isTraceRecorded&&s.forEach((e,t)=>{let n=ag(e);n&&s.set(t,n)});let Fe={runtime:l,definitions:r,builtins:s,constants:De,substitutions:je,instanceNames:se,variables:Te,variableIndex:q_(Te,b.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:o,evaluators:/* @__PURE__ */ new WeakMap},Ie=l_({constants:new Set(De.keys()),variables:/* @__PURE__ */ new Set([...Te,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>s.has(e))]),getDefinition:e=>pl(e,Fe)}),Le=e=>{try{W(e,{environment:Fe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};je.forEach((e,t)=>{let n=r.get(e),i=k.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ie.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Le(n.body):void 0;if(i)throw new v(`The configuration file substitutes constant ${t} with non-constant ${e}${_a(i)?``:` - specifically: ${i.message}`}`)}),l.version!==`1.7.4`&&(l.isStarted=!0);let j=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),Re=P_(t.source,t.loadModule);return{environment:Fe,assumptions:Ce,variableLocations:xe.variableLocations,instanceActions:oe,startupDefinitions:b.filter(e=>!j.has(e.module.name)||R_(e).length===0).flatMap(e=>Re(e===xe?void 0:e.module.name).flatMap(t=>{let n=r.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:xe.constants,rootSymbols:xe.visible,javaOverrides:b.flatMap(e=>ye.get(e.module.name)??[])}},Z_={kind:`Boolean`,value:!0},Q_={kind:`Boolean`,value:!1},$_=e=>e?Z_:Q_,ev=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,tv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,nv=(e,t)=>({kind:e,body:t}),rv=(e,t,n)=>({kind:e,operands:[t,n]}),iv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?iv(e,t.operands).operands:[t])}),av=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return av(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,av(t)),0)}},ov=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 ov(e.body);case`And`:case`Or`:return e.operands.some(ov)}},sv=/* @__PURE__ */ new WeakMap,cv={count:0},lv=e=>{let t=sv.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`#${cv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(lv).join(`,`)})`;default:return`${e.kind}(${lv(e.body)})`}})();return sv.set(e,n),n},uv=(e,t)=>e===t||lv(e)===lv(t),dv=(e,t)=>{let n=lv(t);return e.some(e=>e===t||lv(e)===n)},fv=e=>e===`And`?`Or`:`And`,pv=(e,t)=>{switch(e.kind){case`Boolean`:return t?$_(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?nv(`Not`,e):e;case`Not`:return pv(e.body,!t);case`And`:case`Or`:return iv(t?fv(e.kind):e.kind,e.operands.map(e=>pv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return nv(n,pv(e.body,t))}}},mv=e=>{switch(e.kind){case`Boolean`:return $_(!e.value);case`Not`:return e.body;case`And`:case`Or`:return iv(fv(e.kind),e.operands.map(mv));case`Always`:return nv(`Eventually`,mv(e.body));case`Eventually`:return nv(`Always`,mv(e.body));default:return nv(`Not`,e)}},hv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=hv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return $_(t)}return n.length===0?$_(!t):n.length===1?n[0]:iv(e.kind,n)}case`Not`:{let t=hv(e.body);return t.kind===`Boolean`?$_(!t.value):nv(`Not`,t)}case`Always`:case`Eventually`:{let t=hv(e.body);return nv(e.kind,t.kind===e.kind?t.body:t)}default:return e}},gv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,_v=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=_v(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=>iv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=_v(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=gv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:iv(`Or`,t);n.push(nv(`Always`,nv(`Eventually`,e)))}return iv(`Or`,n)}case`Not`:return ev(e.body)?e:_v(mv(e.body));default:return e}},vv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?vv(e.operands[0]):iv(e.kind,e.operands.map(vv));case`Not`:return e.body.kind===`Not`?vv(e.body.body):nv(`Not`,vv(e.body));case`Always`:case`Eventually`:case`Next`:return nv(e.kind,vv(e.body));default:return e}},yv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return yv(e.operands[0]);let t=Math.floor(e.operands.length/2);return rv(e.kind,yv(iv(e.kind,e.operands.slice(0,t))),yv(iv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return nv(e.kind,yv(e.body));default:return e}},bv=(e,t)=>{e.kind===`Eventually`&&!dv(t,e)&&t.push(e),`body`in e&&bv(e.body,t),`operands`in e&&e.operands.forEach(e=>bv(e,t))},xv=e=>{let t=e.filter(tv),n=e.flatMap(e=>e.kind===`Not`&&tv(e.body)?[e.body]:[]);return!t.some(e=>dv(n,e))},Sv=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,nv(`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},Cv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:nv(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},wv=(e,t,n)=>e.flatMap(e=>{let r=Cv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Tv=e=>[...new Set(e.map(lv))].sort().join(`|`),Ev=(e,t)=>{let n=new Set(t.map(Tv));return[...e.filter(e=>!n.has(Tv(e))),...t]},Dv=e=>{let t=Sv(e),n=wv(t,`Always`,`And`),r=wv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Cv(t,`Eventually`,`Or`);if(n&&!(dv(e,n.first)||dv(e,n.second)))return Ev(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(dv(e,t.first)||dv(e,t.second))&&!dv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!xv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Cv(t[e],`Always`,`And`);n&&(dv(t,n.first)||t.push(n.first),dv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)dv(t,e.first)&&dv(t,e.second)&&!dv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!xv(t)?[]:i(t)};return a(e)},Ov=e=>({particle:e,successors:[],statePredicates:e.filter(e=>av(e)<=1)}),kv=e=>{let t=Dv([e]).map(Ov),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Tv(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 Dv(n)){let n=Tv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Ov(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Av=(e,t)=>!dv(e,t)||dv(e,t.body),jv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&av(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=gv(e);if(n){let e=av(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(ov(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Mv=(e,t)=>{let n=e.findIndex(e=>uv(e,t));return n===-1?(e.push(t),e.length-1):n},Nv=e=>{let t=_v(hv(pv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=vv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])jv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:iv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:uv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&yv(e.formula),n=[];t&&bv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Mv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Mv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Mv(i,e))}));return{tableau:t&&kv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Pv=()=>n(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.livenessEvaluationFailure),Fv=()=>n(new x,e.error),Iv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Lv=/* @__PURE__ */ new WeakMap,Rv=/* @__PURE__ */ new WeakSet,zv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Bv=(e,t)=>new y(`TLC cannot handle the temporal formula ${Xc(e)}${t===void 0?``:`:\n${t}`}`),Vv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ol(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Vv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Vv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=pl(e,n);if(t)return Hv(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?r.isStateLevel&&!r.isLevelConstant?1:0:void 0},o=(e,t)=>r.has(e)?0:B(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Xo(e,(e,a)=>(i.value=Math.max(i.value,Vv(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 Iv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Hv=(e,t)=>{let n=Lv.get(e);if(n!==void 0)return n;Lv.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(Vv(e.body,void 0,t),...r.map(e=>Vv(e.set,void 0,t)));return Lv.set(e,i),i},Uv=(t,r)=>{try{return El(t,r)}catch(t){if(!(t instanceof y))throw t;if(!_a(t))return;throw n(new y(`${o(`tlc2.tool.EvalException`)}${t.message}`),e.error)}},Wv=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>Wv(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,Xc(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,Gv(e,t,n));if(e.kind===`Identifier`){let r=B(e)?ol(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:pl(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Hv(a,n)>0){if(i.has(a))throw Fv();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=zv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Vv(e,t,n)===3)){let t=Zl(e,c),r=B(e)?void 0:pl(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,lu(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>Vv(e.set,t,n)===0),u=l?Uv(e.bounds,c):void 0;if(l&&u){let n=[];if(Dl(e.bounds,u,t,t=>(n.push(...s(e.body,t,Xc(e.body))),!1)),n.length===0)throw Pv();return n}return[{expression:e,scope:t,name:o}]},Gv=(e,t,n)=>{let r=du(e.definitions,zv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Rv.add(e.binding);return r},Kv=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),qv=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?Vv(e,t,n):i;if(a===0){let r=W(e,zv(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${Zc(e)}`);return $_(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},a={depth:0},o=(e,t,n,r)=>{if(a.depth>=100)throw Fv();a.depth++;let o=f(e,t);a.depth--;let s=av(o);return s>2?o:i(n,r,s)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=zv(n,t),s=B(e)||pl(i,n)===void 0?ol(t,i):void 0;if(s?.kind===`Thunk`&&Rv.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:B(e)?Ql(i,a):Yl(i,n);if(l?.kind!==`Closure`)throw Bv(e);let u=e.kind===`Apply`?e.args:[],d=!B(e)&&pl(i,n)?.isRecursive===!0;return c(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(l.body,lu(l,u,a),e,t)),d)},c=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof x||n&&!r;throw!(t instanceof y)||i?t:Bv(e)}},l=(e,t)=>{let r=Vv(e,t,n);if(!e.bounds.every(e=>Vv(e.set,t,n)===0)){if(r<=2)return i(e,t,r);throw Bv(e)}let a=[],o=e.kind===`Forall`;try{Ol(e.bounds,zv(n,t),t=>(a.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof y)||n instanceof x)throw n;if(r<=2)return i(e,t,r);throw Bv(e,o&&!_a(n)?n.message:void 0)}return a.length===0?$_(o):u(e,t,iv(o?`And`:`Or`,a))},u=(e,t,n)=>{let r=av(n);return r>2?n:i(e,t,r)},d=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!B(e)||e.operator===`=>`),f=(e,t)=>{let a=Vv(e,t,n);if(a<=2&&!d(e))return i(e,t,a);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,Gv(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?nv(`Always`,rv(`Or`,nv(`Not`,f(n[0],t)),nv(`Eventually`,f(n[1],t)))):e.operator===`~`&&!B(e)?u(e,t,nv(`Not`,f(n[0],t))):e.operator===`=>`?u(e,t,rv(`Or`,nv(`Not`,f(n[0],t)),f(n[1],t))):s(e,t)}case`And`:case`Or`:return u(e,t,iv(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(!r&&Vv(e.condition,t,n)===0){let r=W(e.condition,zv(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return u(e,t,rv(`Or`,rv(`And`,i,f(e.consequent,t)),rv(`And`,nv(`Not`,i),f(e.alternative,t))))}case`Always`:case`Eventually`:return nv(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=Kv(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=nv(`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`?nv(`Always`,nv(`Eventually`,rv(`Or`,i,a))):rv(`Or`,nv(`Eventually`,nv(`Always`,i)),nv(`Always`,nv(`Eventually`,a)))}default:throw Bv(e)}};return f(e,t)},Jv=(e,t,n,r,i)=>{let a=e=>Jv(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`?fl(W(e.expression,a),`a temporal property predicate`):zc(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&&fl(W(e.unchanged,a),`a subscript`)?!1:fl(W(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return Jv(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`)}},Yv=(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)=>Yv(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 Jv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Xv=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return Xv(e.body);case`And`:case`Or`:return e.operands.some(Xv);default:return!1}},Zv=e=>e.promises.some(e=>Xv(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),Qv=(e,t)=>e.every((e,n)=>en(e,t[n])),$v=e=>e.filter((t,n)=>n===0||e[n-1]!==t),ey=e=>({data:e(1024),length:0,create:e}),ty=(e,t,n)=>{let r=t+n.length;if(r>e.data.length){let t=e.create(Math.max(2*e.data.length,r));t.set(e.data),e.data=t}e.data.set(n,t),e.length=Math.max(e.length,r)},ny=e=>new Int32Array(e).fill(-1),ry=(e,t)=>(e.edgeStarts[t]??-1)!==-1,iy=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},ay=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,oy=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),sy=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},cy=2**53-1,ly=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>qv(e.expression,e.scope,n)),a=e.map(e=>nv(`Not`,qv(e.expression,e.scope,n))),o=a.length===1?a[0]:iv(`Or`,a),s=i.length===0?o:iv(`And`,[...i,o]),c=Nv(s);if(c.length===0)throw Pv();let l=/* @__PURE__ */ new Map,u=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=lv(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:ey(e=>new Int32Array(e)),edgeActions:ey(e=>new Uint8Array(e)),stateResults:ey(e=>new Uint8Array(e)),initial:[],firstNodes:ey(ny),lastNodes:ey(ny),nextSiblings:[],isDone:[],errorNode:void 0})),d={multiplier:1},f=!wu(n),p={environment:n},m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>Jv(e,t,void 0,p.environment,f?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),b=(e,t,n,r)=>g(t,()=>{let t=e.solution.actionChecks;if(!f)return Uint8Array.from(t,e=>+!!Jv(e,n,r,p.environment,/* @__PURE__ */ new Map));let i=h(n),a=m.actions.get(n)??/* @__PURE__ */ new Map;m.actions.set(n,a);let o=a.get(r)??new Int8Array(l.size).fill(-1);return a.set(r,o),Uint8Array.from(e.actionIds,(e,a)=>(o[e]===-1&&(o[e]=+!!Jv(t[a],n,r,p.environment,i)),o[e]))}),x=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),ee=(e,t)=>{if(n.runtime.version===`1.7.4`)return!1;let r=e.nodes[t];return r.particle.length===0&&r.successors.length===1&&r.successors[0]===t},te=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),S=(e,t,n)=>e.solution.tableau?sy(e,t).find(t=>e.nodeTableaux[t]===n):t,ne=(e,t,n)=>{let r=oy(e,t,n),i=e.lastNodes.data[t]??-1;return i===-1?ty(e.firstNodes,t,[r]):e.nextSiblings[i]=r,ty(e.lastNodes,t,[r]),r},re=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;ty(e.edgeTargets,a,n),r.forEach((t,n)=>ty(e.edgeActions,(a+n)*o,t)),ty(e.stateResults,e.nodeStates[t]*i.length,i),e.edgeStarts[t]=a,e.edgeCounts[t]=n.length},ie=(e,t,n)=>{let i={slots:Array.from({length:16*d.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&Qv(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*d.multiplier&&d.multiplier++,i.slots.filter(e=>e!==void 0)},C=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=[],u=s.successors.length>0?b(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!x(t,r,i,n))continue;if(ee(t,r)&&e.errorNode===void 0&&te(e)){e.errorNode=a;return}let o=S(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&C(e,t,n,i,s)}for(let a of r.getSuccessors(i,n)){let r=b(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!x(t,n,i,a.state)||a.index===-1)continue;let s=S(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&C(e,t,a.state,a.index,u)}}l.length>0&&re(e,a,l,c,o)},ae=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>x(t,r,a,e.state)));e.isDone[a]=!0;for(let s of sy(e,a)){let a=[],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=S(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&C(e,t,n.state,n.index,d)}}),re(e,s,a,c,i)}if(e.errorNode!==void 0)return $v(se(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)oy(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{ry(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),re(e,i,a,o,r)},se=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)ry(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 iy(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}ry(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new y(`Couldn't re-create liveness trace (path) starting at: ${t}`)},w=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>ry(e,t)),c=[],l=t=>{let n=iy(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&Av(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=cy;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]=cy,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>ay(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>iy(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=$v(se(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+m.length+h.length},_={node:r},v=e=>o.has(e),b=e=>{l.push(_.node),_.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&ay(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},o=g.count;if(iy(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!v(r)||!a(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_.node,c,e)&&(m[t]=!0,g.count--)})}return g.count<o?(b(r),d.clear(),!0):(v(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){b(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=iy(e,t).find(e=>v(e)&&!d.has(e))??-1}b(n.unvisited),d.add(n.unvisited)}}let x=p(r,_.node,s,a);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let ee=c[c.length-1];return x[x.length-1]===ee&&x.pop(),{prefix:c.slice(0,-1),cycle:[ee,...x.reverse()],isCycleConstrained:Zv(n)}},p=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of iy(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r.link,n.push(t,l,-42),c.push(l);let u={value:r.link++};iy(e,l).forEach((t,r)=>{ry(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u.value=Math.min(u.value,o[t]):o[t]===-1&&s.push(t))}),n.push(u.value)}}};return{branches:u.length,addInitialState:(e,t,r)=>{p.environment=r??n,m.states.clear(),m.actions.clear();try{for(let n of u){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)x(r,i,void 0,t)&&n.initial.push(S(n,e,i)??ne(n,e,i))}}finally{p.environment=n}},addState:(e,t,r,i)=>{p.environment=i??n,m.states.clear(),m.actions.clear();try{let n=ie(e,t,r);for(let r of u){let i=n.map(n=>b(r,e,t,n.state)),a=v(r,e,t),o=r.solution.tableau,s=o?ae(r,o,n,i,a,e):oe(r,n,i,a,e);if(s)return s}return}finally{p.environment=n}},findViolation:()=>{for(let e of u)for(let t of e.solution.models){let n=w(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!Yv(a[i].body,t,r,0,n)).map(e=>e.name))]}},uy=`UnnamedAction`,dy={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},fy=e=>{let t=e.range??dy;return Xn([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},py=e=>{let t=[[`name`,e.name],[`location`,fy(e.location)]];return e.parameters.length===0?Xn(t):Xn([...t,[`context`,Xn(e.parameters)],[`parameters`,Yn(e.parameters.map(e=>e[0]))]])},my=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),hy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),gy=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,_y=e=>e.kind===`Apply`?e.args:[],vy=(e,t,n)=>{let r=gy(e);if(r===void 0)return;if(B(e)){let e=ol(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=Yl(r,n);return i?.kind===`Closure`?i:void 0},yy=(e,t)=>{try{return W(e,hy(t,void 0)),!0}catch(e){if(e instanceof l)return!1;throw e}},by=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&_l(e,t)&&yy(e.body,t),xy=(e,t)=>{let n=pl(e.name,t);return n?.body===e.body&&by(n,t)},Sy=(e,t)=>{if(e.kind!==`Identifier`||!B(e))return;let n=ol(t,e.name);return n?.kind===`Thunk`?n:void 0},Cy=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ol(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),wy=(e,t)=>{try{return e()}catch(e){if(e instanceof l)return t();throw e}},Ty=(e,t,n,r,i)=>{let a=_y(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=>Vv(e,n,i)!==0)?o():wy(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,hy(i,n))]),expression:t,scope:n}],o)},Ey=(e,t,n,r,i)=>{let a=()=>({name:n?.name??uy,location:e.location,parameters:Cy(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Ey(e.body,du(e.definitions,hy(r,t)),n,r,i);case`Label`:return Ey(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Ey(e,t,n,r,i));case`Exists`:return wy(()=>{let o=[];return Ol(e.bounds,hy(r,t),t=>(o.push(...Ey(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=B(e)?void 0:i.get(gy(e)??``),s=vy(e,t,r);if(o)return Ty(o,e,t,s,r);if(!s)return[a()];let c=_y(e),l=B(e)?s.name:r.instanceNames.get(gy(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return xy(s,r)||c.some(e=>Vv(e,t,r)!==0)?u():wy(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,hy(r,t))},parent:e}),s.scope);return Ey(s.body,e,{...s,name:l},r,i)},u)},Dy=(e,t,n,r,i)=>{let a=(e,t)=>Dy(e,t,n,r,i);if(e.kind===`Let`){a(e.body,du(e.definitions,hy(n,t)));return}let o=Sy(e,t);if(o){a(o.expression,o.scope);return}let s=vy(e,t,n);if(s&&xy(s,n))return;if(s&&s.params.length===0){if(Vv(s.body,s.scope,n)===1){r.inits.push(my(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,lu(s,e.args,hy(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(my(uy,e));return}let c=Vv(e,t,n);c<=1?r.inits.push(my(uy,e)):c===3&&r.temporals.push(my(uy,e))},Oy=(e,t,n,r,i)=>{let a=(t,n)=>Oy(e,t,n,r,i);if(t.kind===`Let`){a(t.body,du(t.definitions,hy(r,n)));return}let o=Sy(t,n);if(o){a(o.expression,o.scope);return}let s=vy(t,n,r);if(s&&xy(s,r))return;if(s&&s.params.length===_y(t).length){a(s.body,t.kind===`Apply`?lu(s,t.args,hy(r,n)):s.scope);return}if(t.kind===`Forall`&&wy(()=>(Ol(t.bounds,hy(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(my(e,a)):Vv(a,n,r)<2?i.invariants.push(my(e,a)):i.impliedTemporals.push(my(e,t));return}let c=Vv(t,n,r);c<=1?i.impliedInits.push(my(e,t)):c===3&&i.impliedTemporals.push(my(e,t))},ky=(e,t)=>{let n=pl(e,t);return n?.kind===`Operator`&&!by(n,t)?n:void 0},Ay=e=>Xn([[`name`,e.name],[`location`,fy(e.location)]]),jy=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:ky(e.specification,t);a&&(Dy(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Ey(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Yl(e.init,t);o?.kind===`Closure`&&r.inits.push(my(e.init??``,o.body));let s=e.next===void 0?void 0:Yl(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Ey(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=ky(e,t);n&&r.invariants.push(my(e,n.body))}),e.properties.forEach(e=>{let n=ky(e,t);n&&Oy(e,n.body,void 0,t,r)}),r},My=(e,t,n)=>jy(e,t,n).inits,Ny=(e,t,n)=>jy(e,t,n).actions,Py=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>z(e[1])).join(`,`)})`,Fy=(e,t)=>`${e.name===uy?`Action`:e.name}${t===`1.7.4`?``:Py(e)} ${g(e.location.range??dy)}`,Iy=e=>`${e.name}${Py(e)}`,Ly=(e,t,n,r)=>{let i=jy(e,t,r),a=e=>Nn(e.map(py)),o=e=>Nn(e.flatMap(e=>{let n=ky(e,t);return n?[Ay(n)]:[]}));return Xn([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,Nn(t.variables.map((e,t)=>Xn([[`name`,e],[`location`,fy(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},Ry=`paired12`,zy=(e,t=16)=>e<=t*.75?t:zy(e,t*2),By=(e,t)=>{let n=zy(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)},Vy=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Hy=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Uy=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Wy=e=>Uy(e).replaceAll(`
468
+ `,`\\n`),Gy=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},writeStuttering:r,close:()=>t?.(e.path,n.join(``))}},Ky=(e,t,n)=>{let r=n===`1.7.4`,i=[`strict digraph DiskGraph {
469
+ `,r?``:`node [shape=box,style=rounded]
470
+ `,e.colorize?`edge [colorscheme="${Ry}"]\n`:``,`nodesep=0.35;
414
471
  `,`subgraph cluster_graph {
415
472
  `,`color="white";
416
- `],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"
417
- `,`node [ labeljust="l",colorscheme="${om}",style=filled,shape=record ]\n`,...cm([...i.keys()],um).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${i.get(e)}]\n`),`}`].join(``),c=()=>[...cm([...r],e=>e[0]).map(e=>`{rank = same; ${cm([...e[1]],lm).map(e=>`${e};`).join(``)}}\n`),`}
418
- `,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="${fm(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?dm(s.signature):``;n.push(`${t.fingerprint} -> ${r.fingerprint} [label="${u}",color="${c}",fontcolor="${c}"];\n`),i||n.push(`${r.fingerprint} [label="${fm(r.getLabel())}",tooltip="${fm(r.getText())}"];\n`),a(t),l()},close:()=>t?.(e.path,n.join(``)+c())}},hm=(e,t)=>e.dot?mm(e,t):pm(e,t),gm=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),_m=(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},vm=t=>n(new u(`${o}${t}`),e.error),ym=e=>{if(!j(e))throw vm(`The symmetry values must be function records.`);let t=H(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!M(e)||!M(i))throw new l(`Symmetry function must have model values as domain and range`);e.name!==i.name&&n.set(e.name,i)}),n},bm=(e,t)=>{let n=t.definitions.get(e);if(n===void 0&&!t.constants.has(e))throw new l(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(n?.kind!==`Operator`||n.params.length>0)throw vm(`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)||!z(r))throw vm(`The symmetry operator must specify a set of functions.`);let i=B(r).elements.map(ym);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(gm(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=_m(n,e),r=gm(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}))},xm=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=wm(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(wm(e[r],t));return a}},Sm=(e,t)=>{let n=[],r=[];for(let i of e){let e=wm(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(L);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(L(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},Cm=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,wm=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Cm(e);if(n===0||n>64)return Tm(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=Tm(e,t),a=i!==e&&Be(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},Tm=(e,t)=>{let n=e.kind;if(n===`Set`){let n=Sm(e.elements,t);return n?Ie(n):e}if(n===`Function`||n===`LazyFunction`&&z(e.domain)){let n=H(e),r=xm(n.domain,t),i=xm(n.range,t)??n.range;if(r){let e=yt(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Le(n.domain,e.range):e}return i===n.range?n:Le(n.domain,i)}if(n===`Interval`||!A(e)||!z(e))return e;let r=B(e),i=xm(r.elements,t);return i?pt(i):r},Em=(e,t,n)=>{for(let r=t.length;r<e.length;r++)t.push(wm(e[r],n));return t},Dm=(e,t,n,r)=>{let i=[];for(let a=0;a<e.length;a++){let o=r?r[a]:a,s=wm(e[o],n),c=L(s,t[o]);if(c>0)return;if(r||i.push(s),c<0)return r?e.map(e=>wm(e,n)):Em(e,i,n)}},Om=(e,t,n)=>t.reduce((t,r)=>Dm(e,t,r,n)??t,e),km=(e,t)=>e*((t-e)/2**64),Am=e=>e.includes(`.`)?e:`${e}.0`,jm=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Am(String(e));let[n,r]=e.toExponential().split(`e`);return`${Am(n)}E${r.replace(`+`,``)}`},Mm=e=>e!==void 0&&e>=`0`&&e<=`9`,Nm=e=>{if(e===0)return`0.0`;let t=jm(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Mm(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(;Mm(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Mm(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Mm(t[n.next])&&Number(t[n.next])>=5&&(n.result=Pm(n.result));Mm(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Pm=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Pm(r)}.`:n===`9`?`${Pm(r)}0`:`${r}${Number(n)+1}`},Fm=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}`)},Im=(e,t,n)=>{if(km(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},Lm=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}).`},Rm={line:0,column:0},zm=`Failed to recover the initial state from its fingerprint.`,Bm=`Failed to recover the next state from its fingerprint.`,Vm=e=>({kind:`Identifier`,name:e,location:Rm}),Hm=/* @__PURE__ */ new Set([`name`,`property`]),Um=(e,t,n)=>{let r=co(t,n);if(!r)throw new l(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new l(Hm.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},Wm=(e,t,n)=>{let r=Um(e,t,n);if(uo(r,n))throw new l(`The ${e} ${t} cannot be a constant.`);return r},Gm=(e,t,n)=>{if(uo(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return X(Vm(e),uh(n,void 0,void 0))}catch(e){if(e instanceof u)return;throw e}},Km=(e,t,n)=>{let r=Um(e,t,n),i=Gm(t,r,n);if(i!==void 0&&i!==!0)throw new l(`The ${e} of ${t} is equal to ${U(i)}`);return i===void 0?r:void 0},qm=(t,r)=>{let i=qd({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>co(e,r)});return t.flatMap(t=>{let a=Km(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
473
+ `],a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=e=>{let t=a.get(e.level)??/* @__PURE__ */ new Set;a.set(e.level,t.add(e.fingerprint))},c=e=>{if(!e)return 1;let t=o.get(e.name)??o.size+2;return o.set(e.name,t),t},l=()=>[`subgraph cluster_legend {graph[style=bold];label = "Next State Actions" style="solid"
474
+ `,`node [ labeljust="l",colorscheme="${Ry}",style=filled,shape=record ]\n`,...By([...o.keys()],Hy).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${o.get(e)}]\n`),`}`].join(``),u=()=>[...By([...a],e=>e[0]).map(e=>`{rank = same; ${By([...e[1]],Vy).map(e=>`${e};`).join(``)}}\n`),`}
475
+ `,e.colorize&&o.size>1?l():``,`}`].join(``),d=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),i.join(``)+u())};return{writeInitialState:e=>{i.push(`${e.fingerprint} [label="${Wy(e.getLabel())}",style = filled]\n`),s(e),d()},writeSuccessor:(t,n,a,o)=>{let l=e.colorize?String(c(o)):`black`,u=e.actionLabels&&o?Uy(r?o.name:o.signature):``;if(i.push(`${t.fingerprint} -> ${n.fingerprint} [label="${u}",color="${l}",fontcolor="${l}"];\n`),!a){let e=r?``:`,tooltip="${Wy(n.getText())}"`;i.push(`${n.fingerprint} [label="${Wy(n.getLabel())}"${e}];\n`)}s(t),d()},writeStuttering:e=>{i.push(`${e.fingerprint} -> ${e.fingerprint} [style="dashed"];\n`),s(e),d()},close:()=>t?.(e.path,i.join(``)+u())}},qy=(e,t,n)=>e.dot?Ky(e,t,n):Gy(e,t),Jy=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Yy=(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},Xy=t=>n(new y(`${s}${t}`),e.error),Zy=e=>{let t=Dr(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!I(e)||!I(i))throw Xy(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Qy=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(Qy);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},$y=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,eb=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new v(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw Xy(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!P(a)||!L(a))throw Xy(`The symmetry operator must specify a set of functions.`);let o=R(a).elements;if(!o.every(F))throw Xy(`The symmetry values must be function records.`);let s=o.map(Zy),c=r.body.kind===`Apply`?r.body.args:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=Qy($y(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(sa.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;s.forEach(e=>{e.size>0&&d.set(Jy(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=Yy(n,e),r=Jy(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!$y(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>I(e)&&m.has(e.name))})),d.size===0)return;let g=Math.max(256,Math.floor(4194304/d.size));return{permutations:[...d.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:g})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:g}},tb=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=ib(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(ib(e[r],t));return a}},nb=(e,t)=>{let n=[],r=[];for(let i of e){let e=ib(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(It);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(It(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},rb=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,ib=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=rb(e);if(n===0||n>64)return ab(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=ab(e,t),a=i!==e&&en(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},ab=(e,t)=>{let n=e.kind;if(n===`Set`){let n=nb(e.elements,t);return n?zt(n):e}if(n===`Function`||n===`LazyFunction`&&L(e.domain)){let n=Dr(e),r=tb(n.domain,t),i=tb(n.range,t)??n.range;if(r){let e=zn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Bt(n.domain,e.range):e}return i===n.range?n:Bt(n.domain,i)}if(n===`Interval`||!P(e)||!L(e))return e;let r=R(e),i=tb(r.elements,t);return i?Nn(i):r},ob=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},sb=(e,t,n)=>e.images[t]??=ib(e.images[0],n.permutations[t-1]),cb=(e,t,n,r)=>{let i=ob(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=It(sb(i,t,r),sb(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},lb=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?cb(i,t,n,r):0;if(o!==0)return o<0}return!1},ub=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>lb(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?sb(ob(e,t),r,t):e)},db=(e,t)=>e*((t-e)/2**64),fb=e=>e.includes(`.`)?e:`${e}.0`,pb=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return fb(String(e));let[n,r]=e.toExponential().split(`e`);return`${fb(n)}E${r.replace(`+`,``)}`},mb=e=>e!==void 0&&e>=`0`&&e<=`9`,hb=e=>{if(e===0)return`0.0`;let t=pb(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;mb(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(;mb(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;mb(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(mb(t[n.next])&&Number(t[n.next])>=5&&(n.result=gb(n.result));mb(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},gb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${gb(r)}.`:n===`9`?`${gb(r)}0`:`${r}${Number(n)+1}`},_b=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}`)},vb=(e,t,n)=>{if(db(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},yb=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}).`},bb=(e,t)=>({...e,traceOutput:[...e.traceOutput??[],...t]}),xb={line:0,column:0},Sb=`Failed to recover the initial state from its fingerprint.`,Cb=`Failed to recover the next state from its fingerprint.`,wb=e=>({kind:`Identifier`,name:e,location:xb}),Tb=/* @__PURE__ */ new Set([`name`,`property`]),Eb=(e,t,n)=>{let r=pl(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(Tb.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},Db=(e,t,n)=>{if(_l(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return W(wb(e),Xb(n,void 0,void 0))}catch(e){if(e instanceof y||c(e))return;throw e}},Ob=(e,t,n)=>{let r=Eb(e,t,n);if(Db(t,r,n)!==void 0)throw new v(`The ${e} ${t} cannot be a constant.`);return r},kb=(e,t,n)=>{let r=n.constants.has(t)?void 0:Eb(e,t,n),i=r?Db(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new v(`The ${e} of ${t} is equal to ${z(i)}`);return i===void 0?r:void 0},Ab=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},jb=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Gl(e.startupDefinitions,r),t.invariants.forEach(e=>{kb(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Mb=(t,r)=>{let i=l_({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>pl(e,r)});return t.flatMap(t=>{let a=kb(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
419
476
  Note that a bug can cause TLC to incorrectly report this error.
420
477
  If you believe your TLA+ or PlusCal specification to be correct,
421
- please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new l(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Vm(t),scope:void 0}]})},Jm=(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])))},Ym=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Ym(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=co(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Ym(n.body,t)}return[e]},Xm=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||$(r,e.scope,t)>0)return!1;let i=X(r,uh(t,void 0,void 0,e.scope));if(i===!1)throw new l(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new l(`The operator ${r.name}, which equals ${U(i)},\ncannot be used as a ${n}`);return!0},Zm=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=Um(t,e,r).body,i=Vm(e);if(n.kind!==`Number`&&n.kind!==`String`&&$(i,void 0,r)===0)throw new l(`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=Um(`name`,t.specification,r),c=Gm(t.specification,s,r);if(c!==void 0)throw new l(`The value of ${t.specification} is equal to ${U(c)}`);if(_p(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Xm(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new l(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&$(c.expression,s.scope,r)<2)throw new l(`TLC cannot handle []P in the specification ${t.specification} when P is a state predicate`);let u=$(c,s.scope,r);if(u===3)o.push(s);else{if(u===2)throw new l(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new l(`The specification ${t.specification} must contain at most one [][Next]_vars`);let u=[...i,...a],d=e=>`$specification${e}`,f=u.reduce((e,t,n)=>t.scope===void 0?e:{name:d(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),p=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:d(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(p),location:Rm},next:a.length===0?void 0:p(a[0],i.length),scope:f,temporals:o}},Qm=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=Km(`property`,e,t);r&&_p(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(Xm(r,t,`property`))return;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){n.actionProperties.push({name:r.name,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:r.scope});return}if(i.kind===`Always`&&$(i.expression,r.scope,t)<=1){let e=i.expression;n.invariants.push({name:e.kind===`Identifier`?e.name:r.name,expression:e,scope:r.scope});return}let a=$(i,r.scope,t);if(a<2)n.initialPredicates.push({name:r.name,expression:i,scope:r.scope});else{if(a===2)throw new l(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},$m=(e,t,n)=>t.flatMap(t=>Km(e,t,n)?[{name:t,expression:Vm(t),scope:void 0}]:[]),eh=(e,t)=>{let n=co(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},th=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new l(`_POSSIBLE lists ${n} more than once`);Wm(`possible`,n,t);let i=Vm(n);if($(i,void 0,t)===3)throw new l(`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}}),nh=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||W(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},rh=(e,t)=>e.flatMap(e=>Ym(e.expression,t).map(n=>{let r=e.scope===void 0?Ws(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:nh(n,r,t)}})),ih=(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},ah=/[\u0100-\uffff]/,oh=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),sh=e=>e.kind===`String`?ah.test(e.value):e.kind===`Set`&&e.elements.some(sh),ch=e=>e.kind===`String`&&ah.test(e.value)||e.kind===`Apply`&&oh.has(e.operator)||Un(e).some(ch),lh=(e,t)=>e.constants.some(e=>sh(e.value)||(e.args??[]).some(sh))||[...t.definitions.values()].some(e=>ch(e.body)||e.kind===`Function`&&e.bounds.some(e=>ch(e.set))),uh=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),dh=(e,t,n)=>so(X(e,t),n),fh=(e,t,n=ph)=>{let r=X(e,t);if(typeof r!=`boolean`)throw new u(n(e,t.environment));return r},ph=(e,t)=>{let n=e.kind===`Identifier`?co(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?Ka(i):qa(r)}`},mh=()=>{},hh=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=dh(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),gh=(e,t,n)=>{try{return dh(e,uh(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof u)return{message:e.message};throw e}},_h=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=gh(n.expression,t,`an assumption`);if(e)return{name:qa(n.expression),trace:[],message:e.message}}},vh=(t,r,i)=>{let a=qm(t.invariants,r),s=Zm(t,r),c=Qm(t,r),u=rh([...a,...c.invariants],r),d=u.length>0||c.actionProperties.length>0||c.liveness.length>0;if(s.init===void 0&&(d||c.initialPredicates.length>0||r.variables.length>0))throw new l(`The configuration file did not specify the initial state predicate.`);if(s.next===void 0&&d)throw new l(`The configuration file did not specify the next state predicate.`);let f=rh($m(`constraint`,t.constraints,r),r),p=$m(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Um(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Um(`periodic`,t.periodic,r);let m=th(t.possible,r);if(r.variables.length===0)return;let h=t.symmetry===void 0?[]:bm(t.symmetry,r);t.view!==void 0&&Um(`view function`,t.view,r);let g=t.view===void 0?void 0:{name:t.view,expression:Vm(t.view),scope:void 0},_=c.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Rm};return{...e,unchanged:t}}),v=e=>$(e.expression,void 0,r)>=2,y=m.filter(e=>!v(e)),ee=m.filter(v),b=r.runtime,x={indices:void 0},te=()=>{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},ne=h.length>0?te():void 0,re=(e,t)=>X(e,uh(r,t,void 0)),S=e=>{let t=te(),n=h.length===0?e:Om(e,h,t);return Vc(g===void 0?t.map(e=>n[e]):[re(g.expression,n)])},ie=lh(t,r);b.getFingerprint=S;let ae=()=>{let e=m.find(e=>!b.possibleCounts.get(e.name));if(!e)return;let t=eh(e.name,r),n=t?` at ${Ka(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:fe(U(ol(b),!0))}};return{properties:c,spec:s,isSymmetric:h.length>0,getTlcOrder:te,getStoredFingerprints:(e,t)=>{if(g!==void 0||ie)return BigInt64Array.from(e,S);let n=new BigInt64Array(t.length),r=Wc(te(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ie)return[String(S(e))];let t=h.length===0?e:Om(e,h,ne);return g===void 0?t:[re(g.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(ih(a,t,i))return!1;try{let e=uh(r,t,void 0,a.scope),n=a.membership;return i&&n?!en(t[n.variable],i[n.variable],X(n.set,e)):!fh(a.expression,e)}catch(t){throw i?xh(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>f.every(n=>ih(n,e,t)||fh(n.expression,uh(r,e,void 0))),findFailedInitialPredicate:e=>c.initialPredicates.find(t=>!fh(t.expression,uh(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>_.find(n=>{try{return!fh(n.action,uh(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${qa(n.box)}`)&&!dh(n.unchanged,uh(r,e,t,n.scope),`a subscript`)}catch(e){throw xh(yh(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>p.every(n=>fh(n.expression,uh(r,e,t),e=>`${o}${ph(e,r)}`)),trackStatePossible:y.length===0?mh:e=>hh(y,b,uh(r,e,void 0)),trackActionPossible:ee.length===0?mh:(e,t)=>hh(ee,b,uh(r,e,t)),findUnwitnessedPossible:ae,findPostconditionViolation:()=>{let e=ae();if(e)return e;for(let e of t.postconditions){let t=gh(Vm(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},yh=e=>e instanceof d?n(e,e.exitCode):e,bh=e=>e instanceof u&&!(e instanceof d)&&!(e instanceof f)?n(new u(`${o}${e.message}`,e),g(e)):yh(e),xh=(e,t)=>e instanceof u?n(new u(`${t}\n${e.message}`,e),g(e)):e,Sh=e=>{let t=e.dump&&hm(e.dump,e.writeFile),n=Ch(e,t);return t?.close(),n},Ch=(e,t)=>{let n=typeof e.config==`string`?ce(e.config):e.config,r=e.onPrint??console.log,i={isMuted:!1},o=e=>{i.isMuted||r(e)},s=e=>{i.isMuted=!0;let t=e();return i.isMuted=!1,t};De(_f(e.source,n,e.loadModule));let c=Df(n,{source:e.source,loadModule:e.loadModule,loadClass:e.loadClass,print:o,files:{readFile:e.readFile,writeFile:e.writeFile},seed:e.seed}),f=c.environment,p=f.runtime;p.pause=e.onPause??(()=>{}),p.getSpecification=()=>am(n,f,c.variableLocations,c.instanceActions);let m={depth:0},h=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:p.generatedStates,distinctStates:p.distinctStates,queuedStates:p.queueSize,depth:p.generatedStates===0?0:Math.max(m.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),_=Array.from({length:32},()=>0),v={newStates:0},y=()=>Math.min(v.newStates,31),ee=()=>_.map((e,t)=>t===y()?e+1:e),b=()=>({...h(`success`),outDegrees:[..._],fingerprintDistance:Im(p.distinctStates,p.generatedStates,()=>x?x.getStoredFingerprints(T,E):BigInt64Array.from(T,p.getFingerprint))}),x=vh(n,f,()=>gf(e.source,e.loadModule,`variable`)),te=_h(c.assumptions,f);if(te)return h(`assumption-violation`,te);if(!x)return b();let ne=n.postconditions.length>0||n.possible.length>0,re=(e,t,n)=>{if(ne){let e=t.loopStart;p.counterExample=lu(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=x.findUnwitnessedPossible();return r||x.findPostconditionViolation(),h(e,r?{...t,unwitnessed:r}:t)},S=x.spec,ie=x.getFingerprintState,ae={value:void 0},oe=n.view!==void 0||n.symmetry!==void 0,C=[],w=a(()=>Mp(x.properties.liveness,S.temporals,f,{getFingerprint:e=>C[e]??=Number(BigInt.asIntN(32,p.getFingerprint(T[e]))),getSuccessors:e=>{let t=[];return S.next===void 0||Ua(S.next,e,f,n=>{if(ue(n.state),!(x.satisfiesConstraints(n.state,e)&&x.satisfiesActionConstraints(e,n.state)))return!1;let r=ie(n.state),i=we(Se(r),r);return t.push({index:i,state:n.state}),!1},S.scope),t}})),se=x.isSymmetric||w!==void 0,T=[],E=[],D=[],O=[],k=[],le={slots:new Int32Array(1<<17),size:0,shift:16},ue=Hn(),de=e=>Object.fromEntries(x.getTlcOrder().map(t=>[f.variables[t],e[t]])),fe=(e,t,n,r)=>(p.getLevel=()=>n+1,p.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),A(e,t[n].state,(t[n+1]??t[r??n]).state)),A=(e,t,n)=>{try{let r=Wm(`alias`,e,f).body,i=X(Vm(e),uh(f,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return Jm(i,a)??de(t)}catch(e){if(!(e instanceof l||e instanceof u))throw e;return{...de(t),_ALIASEvalError:e.message}}},pe=(e,t,r)=>{ae.value??=tm(n,f,c.instanceActions);let i={...P};Object.assign(P,{index:e,isExpanding:!0,candidate:void 0});let a=ie(r),o=ae.value.find(e=>Wa(e.expression,t,f,e.scope).some(e=>Ce(ie(e.state),a)));return Object.assign(P,i),o&&rm(o)},j=(e,t,r)=>{let i=n.alias,a=s(()=>(e.length>1&&es(f)&&M(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:pe(t[r-1],e[r-1].state,n.state))));return e.map((t,n)=>({action:t.action,label:a[n],state:i===void 0?de(t.state):fe(i,e,n,r)}))},M=()=>S.init===void 0?[]:Ha(S.init,f,S.scope),me=e=>S.next===void 0?[]:Wa(S.next,e,f,S.scope),he=(e,t)=>Ce(ie(e),E[t]),ge=(e,t)=>me(e).find(e=>he(e.state,t)),_e=(e,t)=>{let n=oe||es(f)?M().find(t=>he(t,e[0])):T[e[0]];if(!n)throw new u(zm);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=ge(i,e[n]);if(!a)throw new u(t);r.push(a)}return r},ve=(e,t)=>{let n=[];for(let t=e;t!==-1;t=D[t])n.unshift(t);let r=oe&&n.length>1?_e(n,zm):n.map(e=>({state:T[e],action:O[e]}));if(!t)return j(r,n);let i=oe?me(T[e]).find(e=>Ce(e.state,t.state))?.action:t.action;return j([...r,{state:t.state,action:i}],n)},ye=e=>D[e]===-1?[{action:void 0,label:void 0,state:de(T[e])}]:ve(e),be=(e,t,n,r)=>{if(!(e instanceof u))throw e;return{...h(`error`,void 0,{message:e.message,trace:t,initialState:n&&!(e instanceof d)?de(n):void 0,exitCode:g(e)}),outDegrees:r}},xe=(e,t)=>{let n=_e(e,Bm),r=n[n.length-1].state;if(oe&&t!==void 0&&t!==e.length-1&&ge(r,e[t])===void 0)throw new u(Bm);return n},Se=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=vn(t,Cn(e[n]));return t&1073741823},Ce=(e,t)=>{for(let n=0;n<t.length;n++)if(!Be(e[n],t[n]))return!1;return!0},N=e=>Math.imul(e,2654435761)>>>le.shift<<1,we=(e,t)=>{let n=le.slots.length-1;for(let r=N(e);;r=r+2&n){let n=le.slots[r+1];if(n===0)return-1;if(le.slots[r]===e&&Ce(E[n-1],t))return n-1}},Te=(e,t)=>{let n=le.slots.length-1,r=N(e);for(;le.slots[r+1]!==0;)r=r+2&n;le.slots[r]=e,le.slots[r+1]=t},Ee=(e,t)=>{if(le.size++,le.size*4>le.slots.length){let e=le.slots;le.slots=new Int32Array(e.length*2),le.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&Te(e[t],e[t+1])}Te(e,t+1)},Oe=e=>{p.distinctStates=T.length+1,m.depth=Math.max(m.depth,e),p.diameter=Math.max(p.diameter,e)},ke=(e,t,n,r)=>{let i=n===-1?1:k[n]+1;T.push(e),E.push(t),D.push(n),O.push(r),k.push(i)},P={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},Ae=e=>e===-1?[]:[...Ae(D[e]),T[e]];p.isSeen=e=>{let t=ie(e);return we(Se(t),t)!==-1},p.getBehavior=e=>{let t=e===P.candidate?-1:T.indexOf(e);return t===-1?[...Ae(P.index),e]:Ae(t)},p.getCurrentState=()=>P.index===-1?void 0:T[P.index],p.setLivenessSource=e=>{P.livenessSource=e??-1},p.getLevel=e=>{let t=P.livenessSource;return t===-1?e===P.candidate?P.candidateLevel:P.index===-1?0:e===T[P.index]?k[P.index]:P.isExpanding?k[P.index]+1:0:e===T[t]?k[t]:k[t]+1};let F=(e,t)=>({fingerprint:BigInt.asIntN(64,p.getFingerprint(e)),level:t,getLabel:()=>Bn(n.alias===void 0?de(e):A(n.alias,e,void 0)),getText:()=>Bn(de(e))}),je=e=>{ue(e),p.generatedStates++,p.initialStates++,P.candidate=e,P.candidateLevel=1;let n=ie(e),r=Se(n),i=x.satisfiesConstraints(e);if(i&&x.trackStatePossible(e),i&&we(r,n)!==-1)return;i&&(Oe(1),p.queueSize++,w?.addInitialState(T.length,e),t?.writeInitialState(F(e,1)));let a=x.findViolatedInvariant(e);if(a)return re(`invariant-violation`,{name:a.name,trace:j([{action:void 0,state:e}],[])});let o=x.findFailedInitialPredicate(e);if(o)return re(`liveness-violation`,{name:o.name,trace:j([{action:void 0,state:e}],[])});i&&(Ee(r,T.length),ke(e,n,-1,void 0))},Me=(e,n,r,i,a)=>{let o=T[e];p.generatedStates++,P.candidate=n.state,P.candidateLevel=k[e]+1,se&&ue(n.state);let s=ie(n.state),c=Se(s),l=we(c,s),u=x.satisfiesConstraints(n.state,o);u&&x.trackStatePossible(n.state);let d=u&&x.satisfiesActionConstraints(o,n.state);d&&x.trackActionPossible(o,n.state);let f=d?l:-1;if(i&&d&&t?.writeSuccessor(i,F(n.state,k[e]+1),f!==-1,a&&{name:a.name,signature:im(a)}),f!==-1&&w){let e=T[f],t=e.every((e,t)=>e===n.state[t]);r.push({index:f,state:t?e:n.state})}let m=d&&f===-1;if(m&&(Oe(k[e]+1),v.newStates++),f===-1)try{let t=x.findViolatedInvariant(n.state,o);if(t)return re(`invariant-violation`,{name:t.name,trace:ve(e,n)})}catch(t){return be(t,ve(e,n),void 0,ee())}let h=x.findViolatedActionProperty(o,n.state);if(h)return re(`liveness-violation`,{name:h.name,trace:ve(e,n)});m&&(se||ue(n.state),Ee(c,T.length),w&&r.push({index:T.length,state:n.state}),ke(n.state,s,e,n.action),p.queueSize++)},I={result:void 0};if(S.init!==void 0)try{Va(S.init,f,e=>{try{I.result=je(e)}catch(t){I.result=be(t,[],e)}return I.result!==void 0},S.scope)}catch(e){return be(e,[])}if(I.result)return I.result;let Ne=S.next;if(Ne===void 0){if(T.length>0)throw new u(`No next state actions defined to generate successor states from.`);return b()}let L=!!(e.dump?.dot&&(e.dump.actionLabels||e.dump.colorize)),Pe=(e,t)=>{if(!L)return Ua(Ne,e,f,e=>t(e,void 0),S.scope);ae.value??=tm(n,f,c.instanceActions);let r={isStopped:!1};return ae.value.reduce((n,i)=>r.isStopped?n:n+Ua(i.expression,e,f,e=>(r.isStopped=t(e,i),r.isStopped),i.scope),0)},Fe=e=>{let r=T[e],i=[],a=t&&F(r,k[e]),o=Pe(r,(t,n)=>{try{I.result=Me(e,t,i,a,n)}catch(n){I.result=be(n,ve(e,t))}return I.result!==void 0});if(P.isExpanding=!1,I.result)return I.result;if(o===0&&n.checkDeadlock)return re(`deadlock`,{name:`deadlock`,trace:ye(e)});try{let t=w?.addState(e,r,i);if(!w||!t)return;let n=xe(t),a=w.getViolatedProperties(n.map(e=>e.state),n.length-1);return re(`property-violation`,{name:a[0],properties:a,trace:j(n,t)})}catch(t){return be(t,ye(e),void 0,ee())}},Ie=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=xe(n,r),a=j(i,n,r),o=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:s(()=>pe(l,u,T[c]));return re(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:d},()=>c===l?a[a.length-1].action:ge(u,c)?.action)},Le=w!==void 0&&e.livenessCheck!==`final`,Re=performance.now(),ze={at:Re+3e3,size:1,time:0},Ve=e=>{let t=performance.now();if(ze.at=t+6e4,!((e-ze.size)/ze.size>.1)||ze.time>(t-Re)*.2)return;ze.size=e;let n=w?.findViolation();return ze.time+=performance.now()-t,n};for(let e=0;e<T.length&&!p.isStopped;e++){P.index=e,P.candidate=void 0,p.queueSize=T.length-e-1,P.isExpanding=!0;try{I.result=Fe(e)}catch(t){I.result=be(bh(t),ye(e))}if(I.result)return I.result;if(_[y()]++,v.newStates=0,Le&&performance.now()>=ze.at){let t=Ve(e+1);if(w&&t)return Ie(w,t)}}P.index=-1,P.candidate=void 0;let He=w?.findViolation();if(w&&He)return Ie(w,He);let Ue=x.findPostconditionViolation();return Ue?h(`postcondition-violation`,{...Ue,trace:[]}):b()},wh=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Th=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Cn(e[t]),16777619),r=Math.imul(r^An(e[t]),1540483477);t[0]=wh(n)||1,t[1]=wh(r)},Eh=()=>{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)}}},Dh=(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}},Oh=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),kh=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Dh(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Ah=e=>Atomics.load(e.used,0)*2>=e.slots.length,jh=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Dh(t,n);return{slots:t,used:e.used}},Mh=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=pn(e.domain);return t?(r(7),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},Nh=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 Fe(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=Dt({kind:`Interval`,low:e,high:e+t-1});return Le(a,i(t))}let a=n[r.index++];if(e===5)return Ie(i(a));let o=i(a);return Le(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return ce}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Ha}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return U}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Bn}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return c}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return h}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return l}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return s}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return ke}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return u}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return m}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return es}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Hn}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return Df}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return jh}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return wc}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Th}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return _h}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return Nm}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Lm}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return km}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Oh}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return De}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return Sh}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return Im}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Mh}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return kh}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Fm}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return Eh}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return Ah}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return Nh}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return vh}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return gf}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Wa}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return Tc}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return _f}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return g}});
478
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new v(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:wb(t),scope:void 0}]})},Nb=(e,t)=>{if(!F(e))return;let n=Dr(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Pb=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Pb(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=pl(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Pb(n.body,t)}return[e]},Fb=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Vv(r,e.scope,t)>0)return!1;let i=W(r,Xb(t,void 0,void 0,e.scope));if(i===!1)throw new v(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new v(`The operator ${r.name}, which equals ${z(i)},\ncannot be used as a ${n}`);return!0},Ib=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return Ob(t,e,r),wb(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let i=[],a=[],o=[],s=Eb(`name`,t.specification,r),c=Db(t.specification,s,r);if(c!==void 0)throw new v(`The value of ${t.specification} is equal to ${z(c)}`);if(Wv(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Fb(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`&&Vv(c.expression,s.scope,r)<2)throw n(new y(`TLC cannot handle the temporal formula ${Xc(c.expression)}`),e.error);let l=Vv(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:xb},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},Lb=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=kb(`property`,e,t);if(!i)return;Vv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Wv(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(Fb(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&Vv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!B(e)?pl(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=Vv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new v(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},Rb=(e,t,n)=>t.flatMap(t=>kb(e,t,n)?[{name:t,expression:wb(t),scope:void 0}]:[]),zb=(e,t)=>{let n=pl(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Bb=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);Ob(`possible`,n,t);let i=wb(n);if(Vv(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}}),Vb=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||B(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Hb=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=pl(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},Ub=(e,t)=>e.flatMap(e=>Pb(e.expression,t).map(n=>{let r=e.scope===void 0?bd(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Vb(n,r,t),predicate:Hb(e.expression,t)}})),Wb=(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},Gb=/[\u0100-\uffff]/,Kb=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),qb=e=>e.kind===`String`?Gb.test(e.value):e.kind===`Set`&&e.elements.some(qb),Jb=e=>e.kind===`String`&&Gb.test(e.value)||e.kind===`Apply`&&Kb.has(e.operator)||hi(e).some(Jb),Yb=(e,t)=>e.constants.some(e=>qb(e.value)||(e.args??[]).some(qb))||[...t.definitions.values()].some(e=>Jb(e.body)||e.kind===`Function`&&e.bounds.some(e=>Jb(e.set))),Xb=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),Zb=(e,t,n)=>fl(W(e,t),n),Qb=(e,t,n=$b)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},$b=(e,t)=>{let n=e.kind===`Identifier`?pl(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?Yc(i):Zc(r)}`},ex=(e,t)=>Qb(e.expression,t,(n,r)=>(Qb(e.predicate,t),$b(n,r))),tx=()=>{},nx=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=Zb(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),rx=(e,t,n)=>{try{return Zb(e,Xb(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},ix=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=rx(n.expression,t,`an assumption`);if(e)return{name:Xc(n.expression),trace:[],message:e.message}}},ax=(t,r,i,a)=>{let o=Mb(t.invariants,r),c=Ib(t,r),l=Lb(t,r,a),u=Ub([...o,...l.invariants],r),d=[...new Map(u.map(e=>[e.predicate,e])).values()],f=u.length>0||l.actionProperties.length>0||l.liveness.length>0;if(c.init===void 0&&(f||l.initialPredicates.length>0||r.variables.length>0))throw new v(r.runtime.version===`1.7.4`?da:`The configuration file did not specify the initial state predicate.`);if(c.next===void 0&&f)throw new v(`The configuration file did not specify the next state predicate.`);let p=Ub(Rb(`constraint`,t.constraints,r),r),m=Rb(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Eb(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Eb(`periodic`,t.periodic,r);let h=Bb(t.possible,r);if(r.variables.length===0)return;let g=t.symmetry===void 0?void 0:eb(t.symmetry,r,t.substitutions);t.view!==void 0&&Eb(`view function`,t.view,r);let _=t.view===void 0?void 0:{name:t.view,expression:wb(t.view),scope:void 0},b=l.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:xb};return{...e,unchanged:t}}),x=e=>Vv(e.expression,void 0,r)>=2,ee=h.filter(e=>!x(e)),te=h.filter(x),S=r.runtime,ne={indices:void 0},re=()=>{if(ne.indices)return ne.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return ne.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ne.indices},ie=(e,t)=>W(e,Xb(r,t,void 0)),C=e=>{let t=re(),n=g===void 0?e:ub(e,g,t);return nm(_===void 0?t.map(e=>n[e]):[ie(_.expression,n)])},ae=Yb(t,r);S.getFingerprint=C;let oe=()=>{let e=h.find(e=>!S.possibleCounts.get(e.name));if(!e)return;let t=zb(e.name,r),n=t?` at ${Yc(t)}`:``;return{name:e.name,code:sa.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${n} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:N(z(Cm(S),!0))}};return{properties:l,spec:c,isSymmetric:g!==void 0,isConstrained:p.length>0||m.length>0,getTlcOrder:re,getStoredFingerprints:(e,t)=>{if(_!==void 0||ae)return BigInt64Array.from(e,C);let n=new BigInt64Array(t.length),r=am(re(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ae)return[String(C(e))];let t=g===void 0?e:ub(e,g,re());return _===void 0?t:[ie(_.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(Wb(a,t,i))return!1;try{let e=Xb(r,t,void 0,a.scope),n=a.membership;return i&&n?!Er(t[n.variable],i[n.variable],W(n.set,e)):!ex(a,e)}catch(t){throw i?fx(n(t,e.safetyEvaluationFailure),sa.invariantEvaluationFailed,`Evaluating invariant ${a.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Qb(n,Xb(t,e,void 0,r));p.every(e=>r(e.predicate,e.scope))&&n();let i=d.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=l.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(p.every(e=>Qb(e.predicate,Xb(n,t,void 0,e.scope)))&&m.every(r=>Qb(r.expression,Xb(n,e,t,r.scope))))||r())||d.every(e=>Qb(e.predicate,Xb(n,t,void 0,e.scope))))&&b.every(r=>Qb(r.box,Xb(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>p.every(n=>Wb(n,e,t)||ex(n,Xb(r,e,void 0))),findFailedInitialPredicate:e=>l.initialPredicates.find(t=>!Qb(t.expression,Xb(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>b.find(n=>{try{return!Qb(n.action,Xb(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Xc(n.box)}`)&&!Zb(n.unchanged,Xb(r,e,t,n.scope),`a subscript`)}catch(e){throw fx(ox(e),sa.actionPropertyEvaluationFailed,`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>m.every(n=>Qb(n.expression,Xb(r,e,t),e=>`${s}${$b(e,r)}`)),trackStatePossible:ee.length===0?tx:e=>nx(ee,S,Xb(r,e,void 0)),trackActionPossible:te.length===0?tx:(e,t)=>nx(te,S,Xb(r,e,t)),findUnwitnessedPossible:oe,findPostconditionViolation:(i=!1)=>{let a=t.postconditions.find(e=>{let t=pl(e,r);return t!==void 0&&r.definitionValues.has(t)});if(a!==void 0){if(i)return;throw n(new y(`${s}The post condition ${a} cannot be a constant.`),e.error)}let o=oe();if(o)return o;for(let e of t.postconditions){let t=rx(wb(e),r,`a postcondition`);if(!t)continue;let n=zb(e,r),i=n?` at ${Yc(n)}`:``;return t.message===void 0?{name:e,code:sa.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:sa.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},ox=e=>e instanceof S?n(e,e.exitCode):e,sx=/* @__PURE__ */ Error(`The replay stopped`),cx=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),lx=t=>{let n=ga(t.message);return n&&!n.isEvalException&&cx.has(n.code)?e.configParseError:oe(t)},ux=t=>{let n=t.cause;return n instanceof y?ux(n):t instanceof S?t.exitCode:e.specEvaluationFailure},dx=/* @__PURE__ */ new WeakMap,fx=(e,t,r)=>{if(!(e instanceof y))return e;let i=n(new y(`${r}\n${e.message}`,e),oe(e));return dx.set(i,{code:t,headline:r,inner:e}),i},px=s.slice(0,s.indexOf(`
479
+ `)),mx=`${s}tlc2.tool.EvalException: `,hx=`${s}util.Assert$TLCRuntimeException: `,gx=o(`tlc2.tool.EvalException`),_x=e=>_a(e)?mx:hx,vx=e=>{try{return e()}catch(e){throw e instanceof y?_a(e)?new y(`${gx}${e.message}`):ga(e.message)?e:new y(`${s}${e.message}`):e}},yx=[mx,hx,s,gx],bx=(e,t)=>{let n=dx.get(e);if(n)return`${n.headline}\n${bx(n.inner,t)}`;let r=e.message,i=yx.find(e=>r.startsWith(e))??``;return`${i}${ba(r.slice(i.length),t)}`},xx=(e,t)=>{let n=dx.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:bx(e,!0)};if(t&&_a(e))return{code:ga(r)?.code??sa.general,message:r,toolMessage:r};let i=t&&!r.startsWith(px)?s:``;return{code:sa.general,message:`${i}${r}`,toolMessage:`${i}${bx(e,!0)}`}},Sx=e=>{let t=e.dump&&qy(e.dump,e.writeFile,e.version);try{return wx(e,t)}catch(e){throw c(e)?Cx():e}finally{t?.close()}},Cx=()=>n(new x,e.error),wx=(t,i)=>{let o=typeof t.config==`string`?it(t.config,t.version):t.config,l=t.onPrint??console.log,u={lines:void 0},d=e=>{u.lines?u.lines.push(e):l(e)},f=e=>{let t=u.lines,n=[];u.lines=n;try{return{result:e(),lines:n}}finally{u.lines=t}};wt(I_(t.source,o,t.loadModule)),Et(t.version);let p=X_(o,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:d,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed,isTool:t.isTool,isTraceRecorded:t.isTraceRecorded,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version});jb(p,o,t.onProgress);let m=p.environment,h=m.runtime,g=h.version===`1.7.4`;h.pause=t.onPause??(()=>{}),h.getSpecification=()=>Ly(o,m,p.variableLocations,p.instanceActions);let _={depth:0,initialStates:void 0},b=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:h.generatedStates,distinctStates:h.distinctStates,queuedStates:h.queueSize,depth:h.generatedStates===0?0:Math.max(_.depth,1),initialStates:_.initialStates,outDegrees:void 0,fingerprintDistance:void 0}),te=Array.from({length:32},()=>0),re={newStates:0},ie=()=>Math.min(re.newStates,31),C=()=>te.map((e,t)=>t===ie()?e+1:e),ae=()=>g?[...te]:C(),se=(e,t,n)=>g?[]:e.getViolatedProperties(t,n),w=(e,t=[...te])=>({...e,violationOutDegrees:t}),T=()=>({...b(`success`),outDegrees:[...te],fingerprintDistance:vb(h.distinctStates,h.generatedStates,()=>E?E.getStoredFingerprints(A,Ee):BigInt64Array.from(A,h.getFingerprint))}),E=ax(o,m,()=>F_(t.source,t.loadModule),t.onProgress),D=()=>ix(p.assumptions,m);if(!E){h.isStarted=!0;let e=D();return e?b(`assumption-violation`,e):(_.initialStates={generated:0,distinct:0},t.onProgress?.({kind:`initial-states-started`}),t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates}),T())}let ce=o.postconditions.length>0||o.possible.length>0,le=/* @__PURE__ */ new WeakMap,ue=e=>le.get(e)?.state??e.state,de=e=>{let t=le.get(e)?.action;return t?py(t):Dh(e.action)},fe=(e,t)=>{ce&&(h.counterExample=Oh(e.map(ue),e.slice(1).map(de),t));let n=E.findUnwitnessedPossible(),r=n?{result:void 0,lines:[]}:f(()=>E.findPostconditionViolation(!0));return{unwitnessed:n,postcondition:r.result,lines:r.lines}},pe=(e,t,n)=>{let r=t.loopStart,i=fe(t.trace,r===void 0||!n?void 0:{start:r,action:n()}),a=[...t.traceOutput??[],...i.lines];return b(e,{...t,...a.length>0&&{traceOutput:a},...i.unwitnessed&&{unwitnessed:i.unwitnessed},...i.postcondition&&{postcondition:i.postcondition}})},me=E.spec,he=E.getFingerprintState,O={value:void 0},ge=()=>O.value??=Ny(o,m,p.instanceActions),_e=e=>{let t=zu(m),n=t.callStack;try{e(t);return}catch(e){return c(e)?{callStack:[],fingerprint:void 0}:!(e instanceof y)||!n?void 0:{callStack:n.expressions,fingerprint:n.fingerprint}}},ve=(e,t)=>{if(typeof e!=`object`)return[];let n=t.get(e),r=qr(e).find(e=>Kr(e)!==void 0);return[...n?[n]:[],...r===void 0?[]:ve(r,t)]},ye=(e,t)=>{for(let n of he(e)){let e=Kr(n);if(!e)continue;let r=t?ve(n,t.sources):[];throw t&&r.length>0&&(t.expressions.length=0,t.isFrozen=!0,t.fingerprint={sources:r,reason:e.message}),e}e.forEach(Xt)},be=()=>{let e=tt.fingerprint?[tt.fingerprint]:[];return(t,n)=>{ye(t,n);let r=he(t);return Qe(Je(r),r)!==-1||e.some(e=>Xe(e,r))?!1:(e.push(r),h.distinctStates++,!0)}},xe=()=>{let e={count:0},t=[],n=be();return _e(r=>{if(Ys(My(o,m,p.instanceActions),r,i=>{if(Ab(e.count,e=>u.lines?.push(e)),e.count++,h.generatedStates=e.count,!(t.length>0))try{let e=E.checkReplayedInitialState(i,r,()=>{n(i,r.callStack)&&(h.queueSize++,k?.addInitialState(A.length,i,r))});if(e){let t=Ie([{action:void 0,state:i}],[]).trace[0].state;throw u.lines?.push({kind:`initial-state-violation`,...e,state:t}),sx}}catch(e){if(!(e instanceof y)||!r.callStack?.fingerprint)throw e;t.push(e)}}),t.length>0)throw t[0]})},Se=e=>_e(t=>{let n=A[e],r=i&&ot(n,ke[e]),a=be();Xs(ge(),n,t,(o,s)=>{if(!E.checkReplayedSuccessor(n,o,t,()=>{let n=a(o,t.callStack);return r&&i?.writeSuccessor(r,ot(o,ke[e]+1),!n,F?{name:s.name,signature:Iy(s)}:void 0),n}))throw sx})}),Ce=o.view!==void 0||o.symmetry!==void 0,we=[];E.properties.liveness.length>0&&t.onProgress?.({kind:`liveness-initializing`,isSymmetric:E.isSymmetric,isConstrained:E.isConstrained});let k=a(()=>vx(()=>ly(E.properties.liveness,me.temporals,m,{getFingerprint:({index:e,state:t})=>we[e]??=Number(BigInt.asIntN(32,h.getFingerprint(t))),getSuccessors:(e,t)=>{let n=[];if(me.next===void 0)return n;let r=M.livenessSource;return M.livenessSource=e,Hc(me.next,t,m,e=>{if(je(e.state),!(E.satisfiesConstraints(e.state,t)&&E.satisfiesActionConstraints(t,e.state)))return!1;let r=he(e.state),i=Qe(Je(r),r);return n.push({index:i,state:e.state}),!1},me.scope),M.livenessSource=r,n}})));h.isStarted=!0;let Te=E.isSymmetric||k!==void 0,A=[],Ee=[],De=[],Oe=[],ke=[],Ae={slots:new Int32Array(1<<17),size:0,shift:16},je=mi(),Me=e=>Object.fromEntries(E.getTlcOrder().map(t=>[m.variables[t],e[t]])),Ne=(e,t,n,r)=>(h.getLevel=()=>n+1,h.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Pe(e,t[n].state,(t[n+1]??t[r??n]).state)),Pe=(e,n,r)=>{try{let t=Ob(`alias`,e,m).body,i=W(wb(e),Xb(m,n,r)),a=t.kind===`Record`?t.fields.map(e=>e.name):[];return Nb(i,a)??Me(n)}catch(e){if(!(e instanceof v||e instanceof y))throw e;return{...Me(n),_ALIASEvalError:ba(e.message,t.isTool??!1)}}},Fe=(e,t,n,r)=>{let i=ge(),a={...M};Object.assign(M,{index:e,isExpanding:!0,candidate:void 0});let o=r?e=>e:he,s=o(n),c=i.find(e=>Uc(e.expression,t,m,e.scope).some(e=>Xe(o(e.state),s)));return Object.assign(M,a),c},Ie=(e,n,r={})=>{let i=o.alias,a=r.known??1,s=e.length>1?f(Le).lines:[],c=e.map((t,r)=>r===0||t.action===`Stuttering`?{result:void 0,lines:[]}:f(()=>Fe(n[r-1],e[r-1].state,t.state,a===2&&r===e.length-1))),l=c.map(e=>e.lines),u=r.loopStart,d=g&&u!==void 0?u+1:e.length-a,p=d>0?[s,...l.slice(1,d)].flat():[];return{trace:e.map((n,r)=>{let a=c[r].result,o={action:n.action,label:a&&Fy(a,t.version),state:i===void 0?Me(n.state):Ne(i,e,r,u),output:r===0?p:r<d?[]:l[r]};return(i!==void 0||a)&&le.set(o,{state:Me(n.state),action:a}),o}),traceOutput:a>0&&!g?[s,...l].flat():[]}},Le=()=>me.init===void 0?[]:Vc(me.init,m,me.scope),j=(e,t)=>f(()=>{for(let n of ge()){let r=Uc(n.expression,e,m,n.scope).find(t);if(r)return{...r,action:r.action??n.name}}}).result,Re=(e,t)=>Xe(he(e),Ee[t]),ze=(e,t)=>j(e,e=>Re(e.state,t)),Be=(e,t)=>{let n=f(()=>Ce||Cu(m)?Le().find(t=>Re(t,e[0])):A[e[0]]).result;if(!n)throw new y(Sb);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=ze(i,e[n]);if(!a)throw new y(t);r.push(a)}return r},Ve=(e,t)=>{let n=[];for(let t=e;t!==-1;t=De[t])n.unshift(t);let r=Ce&&n.length>1?Be(n,Sb):n.map(e=>({state:A[e],action:Oe[e]}));if(!t)return Ie(r,n);let i=Ce?j(A[e],e=>Xe(e.state,t.state))?.action:t.action;return Ie([...r,{state:t.state,action:i}],n,{known:2})},He=e=>De[e]===-1?{trace:[{action:void 0,label:void 0,state:Me(A[e])}],traceOutput:g?[]:f(Le).lines}:Ve(e),Ue=(e,t)=>({trace:Ve(e,t).trace}),We=(t,n)=>n.isInitial&&!n.callStack&&!n.fingerprint&&g?e.success:n.callStack?n.isCallStackFirst?oe(t):n.isLiveCallStack?r(t)??(t instanceof S?t.exitCode:e.error):n.isInitial||n.fingerprint?e.specEvaluationFailure:ux(t):n.isInitial?lx(t):oe(t),Ge=(e,t,n={})=>{let r=c(e)?new x:e;if(!(r instanceof y))throw r;let i=t.trace.length>0&&!n.traceFailure?fe(t.trace,void 0):void 0,a=i?.unwitnessed??i?.postcondition,o=[...t.traceOutput??[],...i?.lines??[]];return{...b(`error`,void 0,{...xx(r,n.isNextState??!1),...t,...o.length>0&&{traceOutput:o},...a&&{postcondition:a},initialState:n.initialState&&!(r instanceof S)?Me(n.initialState):void 0,exitCode:We(r,n),callStack:n.callStack,...n.isCallStackFirst&&{isCallStackFirst:!0},...n.fingerprint&&{fingerprint:n.fingerprint},...n.traceFailure&&{traceFailure:n.traceFailure}}),outDegrees:n.outDegrees}},Ke=(n,r)=>{h.generatedStates++;let i=ge(),a=i.length===1?i[0]:i.find(e=>e.name===r.action),o=r.variables,s=i.length===1?`the next-state action`:`action ${r.action} of the next-state relation`,c=g?`assigned`:`defined`,l=`Successor state is not completely specified by ${s}. The following variable${o.length>1?`s are`:` is`} not ${c}: ${o.join(`, `)}.\n`,u=Rt(`null`),d=r.state.map(e=>e??u),f=Ge(r,He(n));return w({...f,failure:f.failure&&{...f.failure,code:sa.incompleteSuccessor,message:l,toolMessage:l,exitCode:e.specEvaluationFailure,trace:[...f.failure.trace,{action:r.action,label:a&&Fy(a,t.version),state:Me(d)}]}})},qe=(e,t)=>{let n=Be(e,Cb),r=n[n.length-1].state;if(Ce&&t!==void 0&&t!==e.length-1&&ze(r,e[t])===void 0)throw new y(Cb);return n},Je=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=zr(t,Jr(e[n]));return t&1073741823},Ye=e=>{for(let t of e){let e=Kr(t);if(e)throw e}},Xe=(e,t)=>{for(let n=0;n<t.length;n++)if(!en(e[n],t[n]))return!1;return!0},Ze=e=>Math.imul(e,2654435761)>>>Ae.shift<<1,Qe=(e,t)=>{let n=Ae.slots.length-1;for(let r=Ze(e);;r=r+2&n){let n=Ae.slots[r+1];if(n===0)return-1;if(Ae.slots[r]===e&&Xe(Ee[n-1],t))return n-1}},$e=(e,t)=>{let n=Ae.slots.length-1,r=Ze(e);for(;Ae.slots[r+1]!==0;)r=r+2&n;Ae.slots[r]=e,Ae.slots[r+1]=t},et=(e,t)=>{if(Ae.size++,Ae.size*4>Ae.slots.length){let e=Ae.slots;Ae.slots=new Int32Array(e.length*2),Ae.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&$e(e[t],e[t+1])}$e(e,t+1)},tt={fingerprint:void 0},nt=e=>{h.distinctStates=A.length+1,_.depth=Math.max(_.depth,e),h.diameter=Math.max(h.diameter,e)},rt=(e,t,n,r)=>{let i=n===-1?1:ke[n]+1;A.push(e),Ee.push(t),De.push(n),Oe.push(r),ke.push(i)},M={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},at=e=>e===-1?[]:[...at(De[e]),A[e]];h.isSeen=e=>{let t=he(e);return Qe(Je(t),t)!==-1},h.getBehavior=e=>{let t=e===M.candidate?-1:A.indexOf(e);return t===-1?[...at(M.index),e]:at(t)},h.getCurrentState=()=>M.index===-1?void 0:A[M.index],h.setLivenessSource=e=>{M.livenessSource=e??-1},h.getLevel=e=>{let t=M.livenessSource;if(g){let e=t===-1?M.isExpanding?M.index:-1:t;return e===-1?0:ke[e]}return t===-1?e===M.candidate?M.candidateLevel:M.index===-1?0:e===A[M.index]?ke[M.index]:M.isExpanding?ke[M.index]+1:0:e===A[t]?ke[t]:ke[t]+1};let ot=(e,t)=>({fingerprint:BigInt.asIntN(64,h.getFingerprint(e)),level:t,getLabel:()=>fi(o.alias===void 0?Me(e):Pe(o.alias,e,void 0)),getText:()=>fi(Me(e))}),st=e=>{je(e),h.generatedStates++,h.initialStates++,M.candidate=e,M.candidateLevel=1;let t=he(e),n=Je(t),r=E.satisfiesConstraints(e);if(r&&(E.trackStatePossible(e),Ye(t),e.forEach(Xt)),r&&Qe(n,t)!==-1)return;tt.fingerprint=r?t:void 0,r&&(nt(1),h.queueSize++,k?.addInitialState(A.length,e),i?.writeInitialState(ot(e,1)));let a=E.findViolatedInvariant(e);if(a)return pe(`invariant-violation`,{name:a.name,...Ie([{action:void 0,state:e}],[])});let o=E.findFailedInitialPredicate(e);if(o)return pe(`liveness-violation`,{name:o.name,...Ie([{action:void 0,state:e}],[])});r&&(et(n,A.length),rt(e,t,-1,void 0))},ct=(e,t,n,r,a)=>{let o=A[e];h.generatedStates++,M.candidate=t.state,M.candidateLevel=ke[e]+1,Te&&je(t.state);let s=he(t.state),l=Je(s),u=Qe(l,s),d=E.satisfiesConstraints(t.state,o);d&&E.trackStatePossible(t.state);let p=d&&E.satisfiesActionConstraints(o,t.state);p&&(E.trackActionPossible(o,t.state),Ye(s),t.state.forEach(Xt));let m=p?u:-1;if(r&&p&&i?.writeSuccessor(r,ot(t.state,ke[e]+1),m!==-1,a&&{name:a.name,signature:Iy(a)}),m!==-1&&k){let e=A[m],r=e.every((e,n)=>e===t.state[n]);n.push({index:m,state:r?e:t.state})}let g=p&&m===-1;if(g&&k&&n.push({index:A.length,state:t.state}),tt.fingerprint=g?s:void 0,g&&(nt(ke[e]+1),re.newStates++),m===-1)try{let n=E.findViolatedInvariant(t.state,o);if(n)return w(pe(`invariant-violation`,{name:n.name,...Ve(e,t)}))}catch(n){if(c(n))throw n;let r=f(()=>Se(e));return Ge(n,bb(Ue(e,t),r.lines),r.result??{outDegrees:ae()})}let _=E.findViolatedActionProperty(o,t.state);if(_)return w(pe(`liveness-violation`,{name:_.name,...Ve(e,t)}));g&&(Te||je(t.state),et(l,A.length),rt(t.state,s,e,t.action),h.queueSize++)},N={result:void 0};k&&t.onProgress?.({kind:`liveness-prepared`,branches:k.branches});let P=D();if(P)return b(`assumption-violation`,P);if(t.onProgress?.({kind:`initial-states-started`}),me.init!==void 0)try{Bc(me.init,m,e=>{Ab(h.initialStates,t.onProgress);try{N.result=st(e)}catch(t){let n=f(xe);N.result=Ge(t,{trace:[],traceOutput:n.lines},{initialState:e,...n.result,isInitial:!0})}return N.result!==void 0},me.scope)}catch(e){if(e instanceof ne){let t=Ge(e,{trace:[]},{initialState:e.state.map(e=>e??Rt(`null`))});return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}let t=f(xe);return Ge(e,{trace:[],traceOutput:t.lines},{...t.result,isInitial:!0})}if(N.result)return N.result;_.initialStates={generated:h.initialStates,distinct:h.distinctStates},t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates});let lt=me.next;if(lt===void 0){if(A.length>0)throw new y(`No next state actions defined to generate successor states from.`);return T()}let F=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),I=(e,t)=>{if(!F)return Hc(lt,e,m,e=>t(e,void 0),me.scope);let n={isStopped:!1};return ge().reduce((r,i)=>n.isStopped?r:r+Hc(i.expression,e,m,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},ut=(e,t)=>{if(!k||g)return;let n=_e(n=>k.addState(e,A[e],t,n));return n?.callStack.length&&!n.fingerprint?n.callStack:void 0},dt=(e,t)=>{try{k?.addState(e,A[e],t);return}catch(n){if(!(n instanceof y))throw n;return ut(e,t)}},ft=(e,t)=>{let n=f(()=>dt(e,t));if(n.result)return{result:{callStack:n.result,fingerprint:void 0,isLiveCallStack:!0},lines:n.lines};let r=f(()=>Se(e));return{result:r.result,lines:[...n.lines,...r.lines]}},pt=e=>Ge(Cx(),He(e)),mt=(e,t,n)=>{if(c(e))return pt(t);let r=ft(t,n);return Ge(ox(e),bb(He(t),r.lines),{isNextState:!0,...r.result})},ht=(t,r)=>{let a=A[t],l=i&&ot(a,ke[t]),u=I(a,(e,n)=>{try{N.result=ct(t,e,r,l,n)}catch(n){if(c(n))return N.result=pt(t),!0;let i=g?f(()=>Se(t)):ft(t,r);if(g&&n instanceof y&&!dx.has(n))return N.result=Ge(new y(`${_x(n)}${n.message}`,n),bb({trace:[]},i.lines),{isNextState:!0,...i.result}),!0;let a=he(e.state).some(e=>Kr(e)!==void 0)&&n instanceof y?xx(_a(n)?new y(`${gx}${n.message}`):n,!0):void 0;N.result=Ge(n,bb(a?He(t):Ue(t,e),i.lines),{isNextState:!0,...i.result,traceFailure:a})}return N.result!==void 0});M.isExpanding=!1;let d=N.result;if(d?.violation&&!g){let e=f(()=>dt(t,r));return{...d,violation:bb(d.violation,e.lines),...e.result&&{liveCallStack:e.result}}}if(d)return d;let p=()=>{k&&l&&g&&i?.writeStuttering(l);let e=k?.addState(t,a,r);if(!k||!e)return;let n=qe(e),o=se(k,n.map(e=>e.state),n.length-1);return pe(`property-violation`,{name:o[0],properties:o,...Ie(n,e,{known:0})})};if(u===0&&o.checkDeadlock){let e=pe(`deadlock`,{name:`deadlock`,...He(t)}),n=f(()=>{try{return{additional:p()?.violation}}catch(e){if(!(e instanceof y))throw e;return{isFailed:!0,callStack:ut(t,r)}}}),i=e.violation?{...e,violation:bb(e.violation,n.lines)}:e,a=w(i,n.result.isFailed?ae():C());return n.result.additional?{...a,additionalViolation:n.result.additional}:n.result.callStack?{...a,liveCallStack:n.result.callStack}:a}try{return p()}catch(i){if(g&&i instanceof y){let t=new y(`${_a(i)?gx:s}${i.message}`);return Ge(n(t,e.error),{trace:[]},{outDegrees:ae()})}let o=_e(e=>k?.addState(t,a,r,e));return Ge(i,He(t),{outDegrees:ae(),callStack:o?.callStack.length?o.callStack:void 0,isNextState:!0,isCallStackFirst:!0})}},gt=()=>{let e=o.specification,t=`(compare Chapter 8, page 87ff of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`;if(e===void 0)return{code:sa.noSpecificationButProperty,text:`The stuttering counterexample above may be caused by the absence of a behavior specification (SPECIFICATION). Only INIT and NEXT have been provided, so TLC permits infinite stuttering. To rule out such counterexamples, use SPECIFICATION Spec, with Spec asserting a suitable fairness constraint ${t}`};let n=pl(e,m)?.location.range;if(!(me.temporals.length>0||!n))return{code:sa.noFairnessButProperty,text:`The stuttering counterexample above may be caused by the absence of a fairness constraint in the behavior specification ${e} defined at ${Yc(n)}. To rule out such counterexamples, conjoin a suitable fairness constraint to ${e} ${t}`}},_t=(e,n)=>{let r=[...n.prefix,...n.cycle],i=n.prefix.length,a=qe(r,i),o=Ie(a,r,{loopStart:i,known:0}).trace,s=se(e,a.map(e=>e.state),i),c=r[i],l=r[r.length-1],u=a[a.length-1].state,d=c===l?{result:void 0,lines:[]}:f(()=>Fe(l,u,A[c],!1)),p=c===l&&n.isCycleConstrained;return pe(`liveness-violation`,{name:s[0],properties:s,trace:o,traceOutput:d.lines,loopStart:i,loopLabel:d.result&&Fy(d.result,t.version),warning:p?gt():void 0},()=>c===l?de(o[o.length-1]):d.result?py(d.result):Dh(ze(u,c)?.action))},vt=k!==void 0&&t.livenessCheck!==`final`,yt=performance.now(),bt={at:yt+3e3,size:1,time:0},xt=e=>{let n=performance.now();if(!((e-bt.size)/bt.size>.1)||bt.time>(n-yt)*.2||(bt.size=e,!k))return;t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!1,states:e,statistics:b(`success`)});let r=k.findViolation();return r||t.onProgress?.({kind:`liveness-finished`}),bt.time+=performance.now()-n,r};for(let e=0;e<A.length&&!h.isStopped;e++){M.index=e,M.candidate=void 0,h.queueSize=A.length-e-1,M.isExpanding=!0;let n=[];try{N.result=ht(e,n)}catch(t){N.result=t instanceof ee?Ke(e,t):mt(t,e,n)}if(N.result)return N.result;if(te[ie()]++,re.newStates=0,(vt||t.onProgress)&&performance.now()>=bt.at){bt.at=performance.now()+6e4;let n=vt?xt(e+1):void 0;if(k&&n)return _t(k,n);t.onProgress?.({kind:`progress`,statistics:b(`success`)})}}M.index=-1,M.candidate=void 0,k&&t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!0,states:h.distinctStates,statistics:b(`success`)});let St=k?.findViolation();if(k&&St)return _t(k,St);k&&t.onProgress?.({kind:`liveness-finished`});try{let e=E.findPostconditionViolation();if(e)return b(`postcondition-violation`,{name:e.name,message:e.message,counts:e.counts,trace:[],postcondition:e})}catch(e){return Ge(e,{trace:[]})}return T()},Tx=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Ex=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Jr(e[t]),16777619),r=Math.imul(r^ti(e[t]),1540483477);t[0]=Tx(n)||1,t[1]=Tx(r)},Dx=()=>{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)}}},Ox=(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}},kx=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Ax=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Ox(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},jx=e=>Atomics.load(e.used,0)*2>=e.slots.length,Mx=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Ox(t,n);return{slots:t,used:e.used}},Nx=[void 0,`lambda`,`tuple`,`record`],Px=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=Pr(e.domain);return t?(r(7),r(Nx.indexOf(Ut(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Nx.indexOf(Ut(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},Fx=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Rt(t.strings[n[r.index++]]);if(e===5)return zt(i(n[r.index++]));let a=Nx[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=qn({kind:`Interval`,low:e,high:e+t-1});return Ht(Bt(o,i(t)),a)}let o=n[r.index++],s=i(o);return Ht(Bt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return Re}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return Sd}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return ba}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Ip}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return up}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return zp}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return Uc}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return mi}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return Sa}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return sa}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return Ot}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return fi}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return ca}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return Xc}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return Cu}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return Ld}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Vc}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return qe}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return ua}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return F_}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Bp}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return ga}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Ca}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return hi}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return Et}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return wt}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return it}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return db}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return o}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Mx}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return v}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return N_}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Ex}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return ae}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return ix}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return d}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return ye}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return Ab}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return u}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return vb}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return oe}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return _b}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return s}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return kx}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return w}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return Cd}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return xd}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return Sx}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return hb}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return ie}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Px}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return T}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return Ax}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return l}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return jb}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return C}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return z}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return Dx}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return jx}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return y}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return Fx}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return xe}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return ax}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return yb}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Rp}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return I_}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return X_}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return n}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return ya}});