tla-ts 0.0.10-dev.09e53c2a6 → 0.0.10-dev.1ebc153bd
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/compile.cjs +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +36 -36
- package/dist/deciders.js +54 -54
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +2 -1
- package/dist/index.d.ts +2 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +43 -43
- package/dist/prove.js +78 -78
- package/dist/run.cjs +33 -35
- package/dist/run.js +44 -46
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +43 -43
- package/dist/transfer.js +38 -38
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +1 -1
- package/src/ast.ts +1 -0
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +152 -64
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +1 -2
- package/src/cli/tlc.ts +13 -8
- package/src/cli/xml-exporter.ts +1 -1
- package/src/codegen.ts +9 -5
- package/src/dependencies.ts +49 -9
- package/src/dfid.ts +9 -2
- package/src/environment.ts +57 -33
- package/src/errors.ts +7 -0
- package/src/evaluate.ts +92 -32
- package/src/exit-codes.ts +4 -2
- package/src/instances.ts +5 -5
- package/src/java-overrides.ts +2 -2
- package/src/levels.ts +138 -90
- package/src/liveness-checker.ts +43 -4
- package/src/liveness.ts +1 -1
- package/src/obligations/index.ts +1 -1
- package/src/obligations/normalize.ts +1 -4
- package/src/obligations/printer.ts +5 -5
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +5 -0
- package/src/parser.ts +106 -144
- package/src/prover/isabelle/isar/attrib.ts +4 -4
- package/src/prover/isabelle/isar/rule-cases.ts +8 -6
- package/src/prover/isabelle/provers/clasimp.ts +1 -1
- package/src/prover/isabelle/provers/hypsubst.ts +2 -2
- package/src/prover/isabelle/pure/rewriter.ts +3 -3
- package/src/prover/isabelle/pure/term.ts +3 -3
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/smt/rewrite.ts +2 -7
- package/src/prover/smt/simplify.ts +1 -1
- package/src/prover/smt/solver/asserted-formulas.ts +66 -1
- package/src/prover/smt/solver/ast-lt.ts +1 -1
- package/src/prover/smt/solver/ast.ts +58 -11
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-simplifier.ts +2 -3
- package/src/prover/smt/solver/bv-decl-plugin.ts +13 -10
- package/src/prover/smt/solver/bv-rewriter.ts +1 -1
- package/src/prover/smt/solver/card2bv.ts +3 -5
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +2 -3
- package/src/prover/smt/solver/context.ts +24 -3
- package/src/prover/smt/solver/ctx-simplify.ts +1 -2
- package/src/prover/smt/solver/datatype-decl-plugin.ts +15 -7
- package/src/prover/smt/solver/dependent-expr-state.ts +9 -4
- package/src/prover/smt/solver/diff-neq.ts +1 -2
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +4 -7
- package/src/prover/smt/solver/euf/arith-internalize.ts +1 -1
- package/src/prover/smt/solver/euf/array-internalize.ts +1 -1
- package/src/prover/smt/solver/euf/bv-internalize.ts +1 -1
- package/src/prover/smt/solver/euf/egraph.ts +4 -10
- package/src/prover/smt/solver/euf/euf-solver.ts +1 -2
- package/src/prover/smt/solver/euf/mam.ts +1 -5
- package/src/prover/smt/solver/euf/q-ematch.ts +1 -2
- package/src/prover/smt/solver/euf/th-solver.ts +0 -7
- package/src/prover/smt/solver/expr2polynomial.ts +204 -79
- package/src/prover/smt/solver/factor.ts +36 -14
- package/src/prover/smt/solver/fd-solver.ts +2 -0
- package/src/prover/smt/solver/fix-dl-var.ts +1 -2
- package/src/prover/smt/solver/fpa-rewriter.ts +1 -2
- package/src/prover/smt/solver/fpa2bv-converter.ts +3 -1
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +1 -0
- package/src/prover/smt/solver/goal.ts +6 -3
- package/src/prover/smt/solver/goal2nlsat.ts +57 -30
- package/src/prover/smt/solver/hashtable.ts +4 -0
- package/src/prover/smt/solver/logic-tactics.ts +9 -2
- package/src/prover/smt/solver/lp/containers.ts +7 -1
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -3
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -1
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -2
- package/src/prover/smt/solver/lp/nex.ts +2 -1
- package/src/prover/smt/solver/lp/nla-core.ts +1 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +158 -80
- package/src/prover/smt/solver/lp/nra-solver.ts +45 -39
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -2
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -20
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -39
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/union-find.ts +1 -1
- package/src/prover/smt/solver/mam-compiler.ts +1 -1
- package/src/prover/smt/solver/model-based-opt.ts +1 -1
- package/src/prover/smt/solver/model-generator.ts +3 -1
- package/src/prover/smt/solver/mpf.ts +2 -4
- package/src/prover/smt/solver/mus.ts +2 -3
- package/src/prover/smt/solver/muz/dl-context.ts +10 -4
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +3 -3
- package/src/prover/smt/solver/muz/dl-rule.ts +2 -2
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +1 -1
- package/src/prover/smt/solver/muz/horn-tactic.ts +1 -1
- package/src/prover/smt/solver/muz/spacer-context.ts +2 -4
- package/src/prover/smt/solver/muz/spacer-pdr.ts +1 -0
- package/src/prover/smt/solver/nlqsat.ts +1 -1
- package/src/prover/smt/solver/nlsat/algebraic.ts +196 -92
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -33
- package/src/prover/smt/solver/nlsat/explain.ts +375 -217
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -240
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -681
- package/src/prover/smt/solver/nlsat/solver.ts +74 -64
- package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -17
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -18
- package/src/prover/smt/solver/nlsat-tactic.ts +1 -1
- package/src/prover/smt/solver/nnf.ts +6 -2
- package/src/prover/smt/solver/opt-context.ts +9 -3
- package/src/prover/smt/solver/opt-nlsat.ts +29 -18
- package/src/prover/smt/solver/opt-preprocess.ts +1 -1
- package/src/prover/smt/solver/opt-solver.ts +6 -3
- package/src/prover/smt/solver/optsmt.ts +1 -1
- package/src/prover/smt/solver/pb-rewriter.ts +1 -4
- package/src/prover/smt/solver/poly-rewriter.ts +74 -18
- package/src/prover/smt/solver/probes.ts +88 -23
- package/src/prover/smt/solver/proto-model.ts +4 -6
- package/src/prover/smt/solver/qe-arith-plugin.ts +2 -4
- package/src/prover/smt/solver/qe-lite.ts +2 -2
- package/src/prover/smt/solver/qe.ts +3 -2
- package/src/prover/smt/solver/quantifier-manager.ts +14 -9
- package/src/prover/smt/solver/recfun-decl-plugin.ts +2 -1
- package/src/prover/smt/solver/rlimit.ts +4 -0
- package/src/prover/smt/solver/sat/config.ts +1 -1
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +26 -1
- package/src/prover/smt/solver/sat/model-converter.ts +1 -1
- package/src/prover/smt/solver/sat/pb-solver.ts +1 -1
- package/src/prover/smt/solver/sat/sat-tactic.ts +4 -3
- package/src/prover/smt/solver/sat/simplifier.ts +1 -1
- package/src/prover/smt/solver/sat/solver.ts +25 -47
- package/src/prover/smt/solver/seq-axioms.ts +20 -35
- package/src/prover/smt/solver/seq-decl-plugin.ts +1 -1
- package/src/prover/smt/solver/seq-derive.ts +4 -7
- package/src/prover/smt/solver/seq-eq-solver.ts +2 -2
- package/src/prover/smt/solver/seq-monadic.ts +7 -5
- package/src/prover/smt/solver/seq-re-rewriter.ts +2 -1
- package/src/prover/smt/solver/seq-re-util.ts +1 -1
- package/src/prover/smt/solver/seq-regex-bisim.ts +1 -1
- package/src/prover/smt/solver/seq-regex-live.ts +2 -2
- package/src/prover/smt/solver/seq-rewriter.ts +31 -29
- package/src/prover/smt/solver/seq-skolem.ts +0 -23
- package/src/prover/smt/solver/seq-view-witness.ts +4 -4
- package/src/prover/smt/solver/smt-kernel.ts +9 -3
- package/src/prover/smt/solver/smt-setup.ts +68 -6
- package/src/prover/smt/solver/smtlib-parser.ts +558 -220
- package/src/prover/smt/solver/smtlib-script.ts +495 -153
- package/src/prover/smt/solver/solve-eqs.ts +13 -21
- package/src/prover/smt/solver/tactic.ts +219 -130
- package/src/prover/smt/solver/theory-bv.ts +2 -2
- package/src/prover/smt/solver/theory-lra-final-check.ts +1 -1
- package/src/prover/smt/solver/theory-lra-internalize.ts +1 -0
- package/src/prover/smt/solver/theory-lra-propagate.ts +6 -4
- package/src/prover/smt/solver/theory-lra.ts +0 -1
- package/src/prover/smt/solver/theory-pb.ts +24 -7
- package/src/prover/smt/solver/theory-seq-solve.ts +1 -1
- package/src/prover/smt/solver/theory-seq-state.ts +2 -21
- package/src/prover/tlapm/cache.ts +8 -8
- package/src/prover/zenon/equality-rules.ts +24 -0
- package/src/prover/zenon/expr.ts +21 -0
- package/src/prover/zenon/index-table.ts +7 -2
- package/src/prover/zenon/isar-case.ts +1 -1
- package/src/prover/zenon/isar.ts +2 -2
- package/src/prover/zenon/phrase.ts +1 -1
- package/src/prover/zenon/rules.ts +2 -1
- package/src/resolve.ts +624 -187
- package/src/runtime.ts +3 -1
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +2 -13
- package/src/sany/generator-definitions.ts +3 -1
- package/src/sany/generator-expressions.ts +36 -30
- package/src/sany/generator-proofs.ts +5 -3
- package/src/sany/generator.ts +2 -1
- package/src/sany/lexer.ts +3 -3
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +11 -6
- package/src/sany/xml.ts +2 -3
- package/src/search.ts +51 -22
- package/src/spec-description.ts +2 -2
- package/src/subexpressions.ts +265 -94
- package/src/successors.ts +1 -0
- package/src/symmetry.ts +1 -1
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +3 -3
- package/src/tlc/order.ts +14 -3
- package/src/tlc/tlc-operators.ts +3 -1
- package/src/tlc/tlcext-operators.ts +18 -5
- package/src/tlc/trace-spec.ts +5 -5
- package/src/typed-tier.ts +29 -23
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +46 -27
package/dist/transfer.js
CHANGED
|
@@ -6,20 +6,20 @@
|
|
|
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
|
-
import{$ as e,
|
|
10
|
-
`,t:` `,r:`\r`,f:`\f`},Ce=(e,t)=>t===9?e+8-e%8:e+1,we=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),Te=(e,t,n=!1)=>{if(e.charCodeAt(t)!==92)return 0;let r=e.charAt(t+1),i=we.get(n?r:r.toLowerCase());if(i===void 0)return 0;let a=
|
|
11
|
-
`),
|
|
12
|
-
`&&e!==`\r`)-
|
|
9
|
+
import{$ as e,A as t,B as n,C as r,F as i,G as a,H as o,I as s,J as c,K as l,P as u,Q as d,S as f,V as p,X as m,Y as h,Z as g,_,b as v,et as y,g as ee,nt as b,ot as x,q as te,rt as S,u as ne,v as C,w as re,x as w,y as T,z as ie}from"./worker.js";import{gzipSync as ae}from"node:zlib";const oe=/* @__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(`.`)),se=/* @__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(` `),E=/* @__PURE__ */ new Map([[`∃`,`\\E`],[`∀`,`\\A`],[`∷`,`::`],[`≜`,`==`],[`⟨`,`<<`],[`⟩_`,`>>_`],[`⟩`,`>>`],[`→`,`->`],[`←`,`<-`],[`↦`,`|->`],[`⁺`,`^+`],[`¬`,`~`],[`□`,`[]`],[`◇`,`<>`],[`∧`,`/\\`],[`∨`,`\\/`],[`∈`,`\\in`],[`≈`,`\\approx`],[`≔`,`:=`],[`≍`,`\\asymp`],[`◯`,`\\bigcirc`],[`⩴`,`::=`],[`●`,`\\bullet`],[`∩`,`\\cap`],[`⋅`,`\\cdot`],[`∘`,`\\o`],[`≅`,`\\cong`],[`∪`,`\\cup`],[`÷`,`\\div`],[`≐`,`\\doteq`],[`‥`,`..`],[`…`,`...`],[`≡`,`<=>`],[`‼`,`!!`],[`≥`,`>=`],[`≫`,`\\gg`],[`⇔`,`<=>`],[`⇒`,`=>`],[`⫤`,`=|`],[`↝`,`~>`],[`≤`,`<=`],[`≪`,`\\ll`],[`⊣`,`-|`],[`≠`,`#`],[`∉`,`\\notin`],[`⊙`,`\\odot`],[`⊖`,`\\ominus`],[`⊕`,`\\oplus`],[`⊘`,`\\oslash`],[`⊗`,`\\otimes`],[`⇸`,`-+->`],[`≺`,`\\prec`],[`⪯`,`\\preceq`],[`∝`,`\\propto`],[`⁇`,`??`],[`⊨`,`|=`],[`⊢`,`|-`],[`∼`,`\\sim`],[`≃`,`\\simeq`],[`⊓`,`\\sqcap`],[`⊔`,`\\sqcup`],[`⊏`,`\\sqsubset`],[`⊑`,`\\sqsubseteq`],[`⊐`,`\\sqsupset`],[`⊒`,`\\sqsupseteq`],[`⋆`,`\\star`],[`⊂`,`\\subset`],[`⊆`,`\\subseteq`],[`≻`,`\\succ`],[`⪰`,`\\succeq`],[`⊃`,`\\supset`],[`⊇`,`\\supseteq`],[`×`,`\\X`],[`⊎`,`\\uplus`],[`‖`,`||`],[`≀`,`\\wr`]]),D=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),ue=e=>e.startsWith(`\\`)?parseInt(e.slice(2),D.get(e[1].toLowerCase())):Number(e),O=/-{4,} *MODULE\b/,k=/* @__PURE__ */ new Uint8Array(128);(/* @__PURE__ */ new Map([[`0123456789`,33],[`abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ`,2],[`_`,4],[`01`,8],[`01234567`,16],[`abcdefABCDEF`,32]])).forEach((e,t)=>{for(let n of t)k[n.charCodeAt(0)]|=e});const de=(e,t)=>e<128&&(k[e]&t)!==0,fe=(e,t,n)=>{let r=t;for(;de(e.charCodeAt(r),n);)r++;return r},pe=/* @__PURE__ */ new Map;le.forEach(e=>{let t=e.charCodeAt(0),n=pe.get(t)??[];n.push(e),pe.set(t,n)});const me=(e,t)=>{let n=pe.get(e.charCodeAt(t));if(n!==void 0){for(let r=0;r<n.length;r++)if(e.startsWith(n[r],t))return n[r]}},he=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(E.has(n))return n;let r=e[t];return E.has(r)?r:void 0},ge=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&de(e.charCodeAt(t+1),2)){let n=e.slice(t+1,fe(e,t+1,2)),r=n.length;for(;r>0&&!se.has(n.slice(0,r));)r--;let i=se.get(n.slice(0,r));return{text:i??`\\`,length:i===void 0?1:r+1}}let r=he(e,t);if(r!==void 0)return{text:E.get(r)??``,length:r.length};let i=me(e,t);return i?{text:ce.get(i)??i,length:i.length}:n===92?{text:`\\`,length:1}:void 0},_e=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),ve=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>E.has(e)||_e.has(e));return n===void 0?void 0:{text:n,length:n.length}},ye=(e,t,n)=>{let r=t;for(;r<e.length&&n(e[r]);)r++;return r},be=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:fe(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?fe(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return ye(e,s?o+1:o,e=>e===`.`)-t},xe=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,Se={n:`
|
|
10
|
+
`,t:` `,r:`\r`,f:`\f`},Ce=(e,t)=>t===9?e+8-e%8:e+1,we=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),Te=(e,t,n=!1)=>{if(e.charCodeAt(t)!==92)return 0;let r=e.charAt(t+1),i=we.get(n?r:r.toLowerCase());if(i===void 0)return 0;let a=fe(e,t+2,i);return a===t+2?0:a-t},Ee=(e,t=!1)=>{let n=O.exec(e);if(!n)throw new s(`Expected a module header such as ---- MODULE Name ----`);let r=[],i=/* @__PURE__ */ new Map,a=e.slice(0,n.index).split(`
|
|
11
|
+
`),o=n.index,c=a.length,l=n.index-a[a.length-1].length,u=0,d=-1,f=0,p=0,m=()=>{for((d!==l||f>o)&&(d=l,f=l,p=0);f<o;f++)p=Ce(p,e.charCodeAt(f));return Ce(p,e.charCodeAt(o))},h=(e,t,n,i)=>{let a=m();r.push({kind:e,text:t,spelling:i,line:c,column:a,endColumn:a+n-1}),o+=n},g=t=>{for(let n=0;n<t;n++)e.charCodeAt(o)===10&&(c++,l=o+1),o++},_=t=>new s(`${t} at line ${c}, column ${m()}`,void 0,{reason:t,line:c,column:m(),isEnd:o>=e.length});for(;o<e.length;){let n=e.charCodeAt(o);if(n===10||n===32||n===9||n===13){g(1);continue}if(n===92&&e.charCodeAt(o+1)===42){g(ye(e,o,e=>e!==`
|
|
12
|
+
`&&e!==`\r`)-o);continue}if(n===40&&e.charCodeAt(o+1)===42){let t=0;do{if(o>=e.length)throw _(`Unterminated comment`);e.startsWith(`(*`,o)?(t++,g(2)):e.startsWith(`*)`,o)?(t--,g(2)):g(1)}while(t>0);continue}if(n===45&&e.startsWith(`----`,o)){let t=ye(e,o,e=>e===`-`)-o,n=ye(e,o+t,e=>e===` `);e.startsWith(`MODULE`,n)&&u++,h(`Separator`,`----`,t);continue}if(n===61&&e.startsWith(`====`,o)){if(h(`ModuleEnd`,`====`,ye(e,o,e=>e===`=`)-o),u--,u<=0)break;continue}if(n===34){let t=c,n=m(),i=[];for(g(1);e.charCodeAt(o)!==34;){let t=e.charCodeAt(o);if(o>=e.length||t===10||t===13)throw _(`Unterminated string`);if(t===92){let t=e[o+1];if(t===void 0||!`ntrf\\"`.includes(t))throw _(`Invalid escape in string`);i.push(Se[t]??t),g(2)}else i.push(e[o]),g(1)}g(1),r.push({kind:`String`,text:i.join(``),line:t,column:n,endColumn:m()-1});continue}let a=Te(e,o,t);if(a>0){h(`Number`,e.slice(o,o+a),a);continue}if(de(n,7)){let t=fe(e,o,7),r=e.slice(o,t),a=fe(e,o,1);if(a===t){let n=e.charCodeAt(t)===46?fe(e,t+1,1):t,i=n>t+1,a=i?e.slice(o,n):r;h(i?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(r)){let t=n===95?`_`:e.slice(o,a);h(t===`_`?`Operator`:`Number`,t,t.length);continue}if(r.startsWith(`WF_`)||r.startsWith(`SF_`)){h(`Keyword`,r.slice(0,3),3);continue}let s=i.get(r)??r;i.set(s,s),h(oe.has(r)?`Keyword`:`Identifier`,s,r.length);continue}let s=e[o];if(n>=128&&_e.has(s)){h(`Identifier`,i.get(s)??s,1),i.set(s,s);continue}if(n===60){let n=be(e,o,t);if(n>0){h(`Step`,e.slice(o,o+n),n);continue}}let l=ge(e,o);if(l){let t=e.slice(o,o+l.length);h(`Operator`,l.text,l.length,t===l.text?void 0:t)}else throw _(`Unexpected character ${JSON.stringify(s)}`)}let v=m();return r.push({kind:`End`,text:``,line:c,column:v,endColumn:v}),r},De=[[`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`]],Oe=De.map(e=>e[0]),ke=new Map(Oe.map((e,t)=>[e,t]).reverse()),A=e=>{let t=ke.get(e);if(t===void 0)throw new v(`Unknown SANY token kind ${e}`);return t},Ae=new Map(De.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),je=Math.max(...[...Ae.keys()].map(e=>e.length)),Me=Array.from({length:je},(e,t)=>je-t),Ne=/----+ *MODULE/y,Pe=[/_\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],Fe=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`)),Ie=Fe(String.raw`\.\/\\`),Le=Fe(String.raw`\.\\\/`),Re=String.raw`<(?:[0-9]+|\+|\*)>`,ze=[[`_BM0`,[Ne]],[`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`,Ie],[`BOR`,Le],[`IDENTIFIER`,Pe],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Re}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Re,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Re}(?:\*\.*|-\.*|\.+)`,`y`)]]],Be=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[Ne]]],Ve=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[Ne]],[`BAND`,Ie],[`BOR`,Le],[`IDENTIFIER`,Pe]],He=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Ue=(e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,We=(e,t,n)=>e.map(e=>({kind:A(e[0]),length:Math.max(...e[1].map(e=>He(e,t,n)))})).reduce(Ue,{kind:-1,length:0}),Ge=(e,t)=>{let n=Me.find(n=>Ae.has(e.slice(t,t+n))),r=We(ze,e,t);return n===void 0?r:Ue(r,{kind:Ae.get(e.slice(t,t+n))??-1,length:n})},Ke=e=>e+8-e%8,qe=e=>{let t=[],n=[],r=1,i=0,a=!1,o=!1;for(let s of e)for(let e=0;e<s.length;e++)i++,o?(o=!1,r++,i=1):a&&(a=!1,s===`
|
|
13
13
|
`?o=!0:(r++,i=1)),s===`\r`?a=!0:s===`
|
|
14
14
|
`?o=!0:s===` `&&(i=Ke(i-1)),t.push(r),n.push(i);return{lines:t,columns:n}},Je=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Ye=new Set([...Ae.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Xe=(e,t)=>{let n=0;for(;Ye.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,He(Je,e,t)))},Ze=e=>{let t=qe(e),n=0,r=`DEFAULT`,i=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),a=()=>i(A(`EOF`),e.length-1,0),o=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?et(o,s,e[a],i):t.lines[n]===o?e[a]===`
|
|
15
15
|
`||e[a]===`\r`?et(o+1,0,void 0,i):et(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},s=()=>{let t=n;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return o(t,e.length,``);n+=r+1;return}let r=0,i=t,a=t;for(;a<e.length;)if(e.startsWith(`(*`,a))r++,a+=2,r>1&&(i=a);else if(e.startsWith(`*)`,a)){if(r--,a+=2,i=a,r===0){n=a;return}}else a++;return n=a,i===e.length?void 0:o(i,a,``)},c=t=>{for(;n<e.length;){let a=We(t,e,n);if(a.length>0){let e=i(a.kind,n,a.length);return n+=a.length,Oe[a.kind].startsWith(`_BM`)&&(r=`SPEC`),Oe[a.kind]===`BEGIN_PRAGMA`&&(r=`PRAGMA`),e}n++}return a()};return()=>{if(r===`DEFAULT`)return c(Be);if(r===`PRAGMA`)return c(Ve);for(;n<e.length;){let t=n;if(`
|
|
16
16
|
\r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=s();if(e!==void 0)return e}else{let r=Ge(e,t);if(r.length===0){let n=Xe(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),a=r<e.length?n:i.length>1?i:``;return o(t,r,a)}let a=i(r.kind,t,r.length);return n+=r.length,a}}return a()}},Qe=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
17
|
-
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),$e=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Qe.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),et=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${$e(n)}" (${n.charCodeAt(0)}), `}after : "${$e(r)}"`,tt=e=>{let t=Ze(e);for(let e=t();typeof e!=`string`&&e.kind!==A(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?Ke(e):e+1,e.beginColumn);return et(e.beginLine,n,e.image[t],e.image.slice(0,t))}},nt=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],rt=/* @__PURE__ */ new Set([...nt,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),it=[`TYPE`,`TYPE_CONSTRAINT`],at=/* @__PURE__ */ new Set([...nt,...it]),ot=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],
|
|
17
|
+
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),$e=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Qe.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),et=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${$e(n)}" (${n.charCodeAt(0)}), `}after : "${$e(r)}"`,tt=e=>{let t=Ze(e);for(let e=t();typeof e!=`string`&&e.kind!==A(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?Ke(e):e+1,e.beginColumn);return et(e.beginLine,n,e.image[t],e.image.slice(0,t))}},nt=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],rt=/* @__PURE__ */ new Set([...nt,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),it=[`TYPE`,`TYPE_CONSTRAINT`],at=/* @__PURE__ */ new Set([...nt,...it]),ot=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],j=e=>{let t=0,n=0;do{if(t>=e.length)return;let r=e.slice(t,t+2),i=r===`(*`?1:r===`*)`?-1:0;n+=i,t+=i===0?1:2}while(n>0);return t},st=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:et(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:et(r+1,0,void 0,e),line:r})},s=e=>{let t=e.split(`
|
|
18
18
|
`);t.length>1&&(r+=t.length-1,i=n+e.length-t[t.length-1].length),n+=e.length};for(;n<e.length;){let i=e.slice(n),c=/^\s+/.exec(i)?.[0];if(c){s(c);continue}if(i.startsWith(`\\*`)){let e=i.indexOf(`
|
|
19
|
-
`);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=st(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=Te(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=ve(e,n)??ge(e,n),m=ot.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},lt=(e,t)=>new _(`TLC found an error in the configuration file at line ${e}\n${t}`),j=(e,t)=>lt(e,`The keyword ${t} appeared twice.`),ut=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),dt=/* @__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`]]),ft=(t,n=`master`)=>{let r=n===`1.7.4`?at:rt,i=ct(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let e=i[Math.min(a++,i.length-1)];if(e.kind===`Error`)throw new _(`TLC found an error in the configuration file:\n${e.text}`);return e},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw v(new _(`${e(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),S.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new _(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw lt(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(t.kind!==`End`)return{kind:`ModelValue`,name:t.text};throw lt(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw lt(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw lt(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=l();for(;r.text===`!`;)n=`${n}!${l().text}`,r=l();if(r.text===`<-`){if(r=l(),r.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw lt(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw lt(r.line,`Expected an identifier after <-.`);o.substitutions.push({name:n,target:r.text});return}let i=[],a=r.text===`(`;if(a){for(;i.push(u(l())),r=l(),r.text===`,`;);if(r.text!==`)`)throw lt(t,``);r=l()}if(r.text!==`=`)throw lt(r.line,`It was expecting = or <-, but did not find it.`);r=l();let s=r.text===`[`?d(`=`):void 0,c=u(s===void 0?r:l());o.constants.push({name:n,value:c,...a&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n=a-1;f(t,e),o.rawConstants.push(i.slice(n,a).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},h=l();for(;h.kind!==`End`;){let e=h.text,t=h.line,n=r.has(e)?ut.get(e):void 0,i=r.has(e)?dt.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw lt(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw j(t,e);o[n]=r.text,h=l()}else if(i!==void 0)h=m(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw lt(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw j(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!it.includes(e))throw lt(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw j(t,e);c.add(e),h=l()}}return o},pt=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],mt=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(pt),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:[])}},ht=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},M=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,gt=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},_t={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:` `}},vt=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},yt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),bt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),xt=e=>{let t=t=>{let n=ye(e,t,vt);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=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);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=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=ye(e,t,yt);if(e.startsWith(`..`,n)&&yt(e[n+2]))return{kind:`Constant`,first:t,last:ye(e,n+2,yt)-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=yt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:ye(e,t+1,yt)-1,children:[]};if(bt(n))return{kind:`Constant`,first:t,last:ye(e,t,bt)-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:xt(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=_t[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},St={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},Ct={none:0,error:1,warning:3,state:4},wt={0:``,1:`Error: `,3:`Warning: `,4:`State `},Tt=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${wt[n]}${r}`,Et=e=>{let t=/* @__PURE__ */ new Set;return{isTool:e.isTool,isDiffTrace:e.isDiffTrace??!1,version:e.version??`master`,print:(n,r,i)=>{let a=r===Ct.warning;if(a&&e.errorCodes?.includes(n))throw new f(n,i);if(a&&e.isWarningEnabled===!1||r!==Ct.error&&e.suppressedCodes?.includes(n))return;let o=a&&!e.isTool&&t.size===0?`
|
|
20
|
-
(Use the -nowarning option to disable this warning.)`:``,
|
|
19
|
+
`);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=j(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=Te(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=ve(e,n)??ge(e,n),m=ot.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},ct=(e,t)=>new C(`TLC found an error in the configuration file at line ${e}\n${t}`),lt=(e,t)=>ct(e,`The keyword ${t} appeared twice.`),ut=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),dt=/* @__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`]]),ft=(e,t=`master`)=>{let n=t===`1.7.4`?at:rt,r=st(e),i=0,a={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},o=!1,s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i++,r.length-1)];if(e.kind===`Error`)throw new C(`TLC found an error in the configuration file:\n${e.text}`);return e},l=e=>{if(e.kind===`Number`&&e.text.startsWith(`\\`))throw x(new C(`${y(`java.lang.NumberFormatException`)}For input string: "${e.text}"`),S.error);if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`&&e.text.includes(`\\`))throw new C(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${e.line}`);if(e.kind===`String`)return{kind:`String`,value:e.text.slice(1,-1)};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t=c();if(t.text!==`}`)for(;e.push(l(t)),t=c(),t.text===`,`;)t=c();if(t.text!==`}`)throw ct(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw ct(e.line,`It was expecting a value, but did not find it.`)},u=e=>{let t=c();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw ct(n.line,`It was expecting ], but did not find it.`);return t.text},d=(e,t)=>{let n=e.text,r=c();for(;r.text===`!`;)n=`${n}!${c().text}`,r=c();if(r.text===`<-`){if(r=c(),r.text===`[`){let e=u(`<-`),t=c();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw ct(r.line,`Expected an identifier after <-.`);a.substitutions.push({name:n,target:r.text});return}let i=[],o=r.text===`(`;if(o){for(;i.push(l(c())),r=c(),r.text===`,`;);if(r.text!==`)`)throw ct(t,``);r=c()}if(r.text!==`=`)throw ct(r.line,`It was expecting = or <-, but did not find it.`);r=c();let s=r.text===`[`?u(`=`):void 0,d=l(s===void 0?r:c());a.constants.push({name:n,value:d,...o&&{args:i},...s!==void 0&&{module:s}})},f=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let o=i-1;d(t,e),a.rawConstants.push(r.slice(o,i).map(e=>e.text).join(` `))}},p=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},m=c();for(;m.kind!==`End`;){let e=m.text,t=m.line,r=n.has(e)?ut.get(e):void 0,i=n.has(e)?dt.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw ct(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 lt(t,e);a[r]=n.text,m=c()}else if(i!==void 0)m=p(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)m=f(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw ct(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o)throw lt(t,e);o=!0,a.checkDeadlock=n.text===`TRUE`,m=c()}else{if(!n.has(e)||!it.includes(e))throw ct(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw lt(t,e);s.add(e),m=c()}}return a},pt=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],mt=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(pt),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:[])}},ht=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},M=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,gt=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},_t={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:` `}},vt=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},yt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),bt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),xt=e=>{let t=t=>{let n=ye(e,t,vt);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=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);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=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=ye(e,t,yt);if(e.startsWith(`..`,n)&&yt(e[n+2]))return{kind:`Constant`,first:t,last:ye(e,n+2,yt)-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=yt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:ye(e,t+1,yt)-1,children:[]};if(bt(n))return{kind:`Constant`,first:t,last:ye(e,t,bt)-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:xt(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=_t[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},St={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},Ct={none:0,error:1,warning:3,state:4},wt={0:``,1:`Error: `,3:`Warning: `,4:`State `},Tt=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${wt[n]}${r}`,Et=e=>{let t=/* @__PURE__ */ new Set;return{isTool:e.isTool,isDiffTrace:e.isDiffTrace??!1,version:e.version??`master`,print:(n,r,i)=>{let a=r===Ct.warning;if(a&&e.errorCodes?.includes(n))throw new o(n,i);if(a&&e.isWarningEnabled===!1||r!==Ct.error&&e.suppressedCodes?.includes(n))return;let s=a&&!e.isTool&&t.size===0?`
|
|
20
|
+
(Use the -nowarning option to disable this warning.)`:``,c=Tt(e.isTool,n,r,`${i}${s}`);a&&t.has(c)||(a&&t.add(c),console.log(c))}}},Dt=`The configuration file did not specify the initial state predicate.
|
|
21
21
|
Can also be caused by trying to run TLC on a specification from
|
|
22
|
-
a module imported with a parameterized INSTANCE statement.`,Ot=[[1005,
|
|
22
|
+
a module imported with a parameterized INSTANCE statement.`,Ot=[[1005,ne,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!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:
|
|
23
23
|
%1%`,!0],[2143,`The variable %1% was changed while it is specified as UNCHANGED at
|
|
24
24
|
%2%`,!1],[2144,`The EXCEPT was applied to non-existing fields of the value at
|
|
25
25
|
%1%`,!1],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
@@ -64,27 +64,17 @@ The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configurat
|
|
|
64
64
|
Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
|
|
65
65
|
It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
|
|
66
66
|
%1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
|
|
67
|
-
`,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!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]];let kt;const At=()=>kt??=Ot.map(
|
|
67
|
+
`,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!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]];let kt;const At=()=>kt??=Ot.map(e=>({pattern:RegExp(`^${e[1].split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e[0],isEvalException:e[2]}})),jt=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,Mt=e=>jt.test(e)?void 0:At().find(t=>t.pattern.test(e))?.message,Nt=e=>e instanceof t||Mt(e.message)?.isEvalException===!0,Pt=/* @__PURE__ */ new Map([[1e3,`
|
|
68
68
|
: `],[2105,`failed.
|
|
69
69
|
`],[2154,`but it produced the following error:
|
|
70
70
|
`],[2171,`Parsing or semantic analysis failed.`],[2213,`:
|
|
71
71
|
`],[2281,` - specifically: `],[2405,`failed.
|
|
72
|
-
`]]),Ft=(e,t,n)=>{let r=n?Pt.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)}${It(t.slice(a),n)}`},It=(e,t)=>{let n=t?Mt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Ct.none} @!@!@\n${Ft(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Lt=(e,t=2)=>String(e).padStart(t,`0`),Rt=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 ${Lt(r%24)}h`:e>36e5?`${Lt(r%24)}h ${Lt(n)}min`:e>6e4?`${Lt(n)}min ${Lt(t)}s`:`${Lt(t)}s`},zt=e=>`${e.getFullYear()}-${Lt(e.getMonth()+1)}-${Lt(e.getDate())} ${Lt(e.getHours())}:${Lt(e.getMinutes())}:${Lt(e.getSeconds())}`,Bt=/* @__PURE__ */ new WeakMap,Vt=(
|
|
73
|
-
`)),Gt=`${i}tlc2.tool.EvalException: `,Kt=`${i}util.Assert$TLCRuntimeException: `,qt=e=>Nt(e)?Gt:Kt,Jt=e=>{try{return e()}catch(e){throw e instanceof y?Nt(e)?new y(`${p}${e.message}`):Mt(e.message)?e:new y(`${i}${e.message}`):e}},Yt=[Gt,Kt,i,p],Xt=(e,t)=>{let n=Bt.get(e);if(n)return`${n.headline}\n${Xt(n.inner,t)}`;let r=e.message;if(e instanceof ie)return r;let i=Yt.find(e=>r.startsWith(e))??``;return`${i}${It(r.slice(i.length),t)}`},Zt=(e,t)=>{let n=Bt.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Xt(e,!0)};if(e instanceof c)return{code:t?St.stackOverflow:St.general,message:r,toolMessage:r};if(t&&Nt(e))return{code:Mt(r)?.code??St.general,message:r,toolMessage:r};let a=t&&!r.startsWith(Wt)&&!(e instanceof ie),o=e instanceof s?Ut:i,l=a?o:``;return{code:St.general,message:`${l}${r}`,toolMessage:`${l}${Xt(e,!0)}`}},Qt=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,$t=2147483647,en=1e6;let tn=en;const nn=()=>tn,rn=()=>Math.max(tn,10),an=()=>`Attempted to construct a set with too many elements (>${tn}).`,on=(e,t)=>{if(e.length===rn())throw new s(an());e.push(t)},sn=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=rn(),cn=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},P=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,ln=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),un=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),dn=e=>typeof e==`object`&&e.kind===`ModelValue`,fn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),pn=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:P(e)?`set`:`function`,mn=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let hn=!1;const gn=(e,t)=>(hn=!0,e.writtenKeys=t,e),_n=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,vn=e=>_n(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),yn=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):vn(e),bn=(e,t,n)=>gn(di(e,t),n),xn=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(xn);e.writtenKeys=void 0,e.range.forEach(xn)}},Sn=e=>e.every(e=>typeof e==`string`),Cn=(e,t)=>e.length>0&&t.length>0&&Sn(e)!==Sn(t),wn=(e,t)=>{hn&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Cn(n,r)?Pr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Xn(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:Xn(t,n);if(r!==0)return r}return 0},Tn=(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=Xn(n[e],r[e]);if(t!==0)return t}return 0},En=e=>dn(e)?e.type:void 0,Dn=(e,t,n)=>{let r=En(e),i=En(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(dn(e)&&dn(t)){if(r===void 0||i===void 0||r===i)return;throw new y(`Attempted to ${a} the differently-typed model values ${R(e)} and ${R(t)}`)}throw r===void 0?new y(`Attempted to ${a} the typed model value ${R(t)} and the non-model value\n${R(e)}`):new y(`Attempted to ${a}${n?``:` the`} typed model value ${R(e)} and non-model value\n${R(t)}`)},On=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),kn=On(),An=e=>{Object.assign(kn,On()),Zn.clear();for(let t of e)Bn(t)},jn=()=>{kn.searchRank=kn.size},Mn=()=>kn.unorderedString;let Nn=!1;const Pn={isExpanded:!0,isViewPrinted:!1},Fn=e=>{Nn=e.version===`1.7.4`,tn=e.maxSetSize??en,Pn.isExpanded=e.isLazyValueExpanded??!0,Pn.isViewPrinted=e.isViewPrinted??!1},In=/* @__PURE__ */ new WeakMap,Ln=(e,t)=>(Pn.isViewPrinted&&In.set(e,t),e),Rn=/* @__PURE__ */ new WeakMap,zn=(e,t)=>(Rn.set(e,t),e),Bn=e=>(kn.ranks[e]===void 0&&(kn.ranks[e]=kn.size++),e),Vn=e=>kn.ranks[Bn(e)],Hn=(e,t)=>{if(e===t)return 0;let n=kn.ranks,r=n[e],i=n[t],a=kn.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(kn.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Un=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Wn=(e,t)=>(Un(e)||Un(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Gn=(e,t)=>new y(Un(e)?`Attempted to compare overridden value ${R(e,!0)} with non-overridden value:\n${R(t)}`:`Attempted to compare ${pn(e)} ${R(e)} with ${pn(t)} ${R(t)}`),Kn=(e,t,n)=>{if(!Un(e))throw new y(`Attempted to ${n} the set ${R(F(e)?I(e):e,!0)} with the value:\n${R(t,!0)}`);if(!Un(t))throw Gn(e,t);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 x(`Attempted to compare ${R(e,!0)} with the value\n${R(t,!0)}`)},qn={kind:`InfiniteSet`,name:`Any`},Jn=e=>{throw new x(`Attempted to compare ANY with the value\n${R(e)}`)},Yn=e=>{hn&&xn(e),e===qn&&Jn(e),typeof e==`object`&&e.kind===`LazyFunction`&&L(e)},Xn=(e,t)=>{if(e===t)return Yn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return wn(e,t);if(n===`Set`&&r===`Set`)return Tn(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&&Dn(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Dn(e,t,!1),n===`ModelValue`?-1:1;if(e===qn||t===qn)return Jn(e===qn?t:e);if(P(e)&&P(t)&&Wn(e,t))return Kn(e,t,`compare`);let i=P(e);if(i!==P(t))throw Gn(e,t);if(n===`Interval`&&r===`Set`){let n=Fi(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-Fi(t);if(n!==0)return n}return i?Tn(I(e),I(t)):wn(L(e),L(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Hn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Dn(e,t,!1),dn(e))return-1;if(dn(t))return 1;throw Gn(e,t)},Zn=/* @__PURE__ */ new Map,Qn=32768,$n=e=>{let t=Zn.get(e);if(t)return t;if(Zn.size===Qn)throw new T(`TLC supports at most ${Qn} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Vn(e),hash:fa(pa(ma(e),109)),fingerprint:Ca(wa(e)^60)};return Zn.set(e,n),n},er=()=>[...Zn.values()],tr=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),nr=e=>{let t=tr(e);return t.isNormalized=!0,t},rr=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let ir=!1;const ar=(e,t)=>(t===`lambda`&&(ir=!0),t!==void 0&&(e.functionClass=t),e),or=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,sr=e=>ar(e,`lambda`),cr=e=>Qt(e)&&e.isCached===!0;let lr=!1;const ur=e=>(lr=!0,e),dr=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),fr=e=>{lr&&typeof e==`object`&&Qt(e)&&dr.has(e.kind)&&(e.isCached=!0)},pr=e=>{(ir||lr)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(pr),e.range.forEach(pr)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(pr):P(e)&&F(e)&&(fr(e),I(e).elements.forEach(pr))))},mr=(e,t)=>{if(fr(e),e===t)return Yn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Dn(e,t,!0),Xn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return wn(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Tn(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&Fi(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==Fi(t))return!1;if(dn(e)||dn(t))return e.kind===`LazyFunction`&&L(e),Dn(e,t,!0),dn(e)&&dn(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return mr(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=Mi(e.domain),r=Mi(t.domain);if(n||r)return n===r;let i=Mi(e.range),a=Mi(t.range);return i||a?i===a:mr(e.domain,t.domain)&&mr(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(Mi(e))return Mi(t);if(Mi(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]&&mr(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return Mi(e)?Mi(t):!Mi(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>mr(e,t.factors[n]));let n=P(e)&&P(t)&&!(F(e)&&F(t));if(n&&Wn(e,t))return Kn(e,t,`check equality of`)===0;if(n){if(!Un(e)){let n=I(e);if(!Un(t))return Tn(n,I(t))===0}return ka(e)===ka(t)}return Xn(e,t)===0},hr=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},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):ka(n)===ka(r);return n},gr=hr(!1),_r=hr(!0),vr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},yr=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Sa(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||_r(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||_r(i[e],n))return i[e]}return n.kind===`Set`?vr(n.elements,t):(vr(n.domain,t),vr(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}},br=(e,t)=>t.length===0||or(e)===`tuple`?1:la(t)?.low,xr=e=>{if(!un(e))return;let t=L(e);return{domain:t.domain,range:t.range,low:br(e,t.domain)}},Sr=e=>{if(!un(e))return;let t=L(e);return Sn(t.domain)?t:void 0},Cr=(e,t,n)=>(Dn(t,e,n),1),wr={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`}},Tr=(e,t,n)=>{let r=wr[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${R(e)} with ${r.other}:\n${R(t)}`},Er=e=>e?`check equality of`:`compare`,Dr=(e,t,n,r)=>{let i=xr(n);if(!i){if(dn(n))return Cr(n,t,r);throw new y(`Attempted to ${Er(r)} the function ${R(t)} with the value:\n${R(n)}`)}if(e.range.length!==i.range.length)return e.range.length-i.range.length;let a=()=>Or(e.range,i.range,r);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&i.low!==void 0)return e.low===i.low?a():e.low-i.low;let o=e.low??i.low;if(o===void 0)return Or(e.domain,i.domain,r)||a();let s=e.low===void 0?e.domain:i.domain;for(let t=0;t<s.length;t++){let n=s[t];if(typeof n!=`number`)throw new y(`Attempted to compare ${r?`an `:``}integer with non-integer${r||e.low!==void 0?`:`:``}\n${R(n)}.`);let i=e.low===void 0?n-(o+t):o+t-n;if(i!==0)return i}return a()},Or=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=Nr(e[r],t[r],n);if(i!==0)return i}return 0},kr=(e,t,n)=>{let r=L(e);if(or(e)===`tuple`){let i=un(t)?Bi(t):void 0;return i?r.range.length-i.length||Or(r.range,i,n):Dr({...r,low:1},e,t,n)}if(or(e)===`record`){let i=Sr(t);if(!i){if(dn(t))return Cr(t,e,n);throw new y(`Attempted to ${Er(n)} record:\n${R(e)}\nwith non-record\n${R(t)}`)}return r.domain.length-i.domain.length||Or(r.domain,i.domain,n)||Or(r.range,i.range,n)}return Dr({...r,low:br(e,r.domain)},e,t,n)},Ar=(e,t)=>Un(e)||Un(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),jr=(e,t)=>{let n=fn(t)?t:I(t);return{elements:I(e).elements,otherElements:I(n).elements}},Mr=(e,t,n)=>{if(Ar(e,t))return n?+!mr(e,t):Xn(e,t);if(!fn(e))return Mr(I(e),t,n);if(!P(t)){if(dn(t))return Cr(t,e,n);throw new y(`Attempted to ${Er(n)} the set ${R(e)} with the value:\n${R(t)}`)}let r=jr(e,t);return r.elements.length-r.otherElements.length||Or(r.elements,r.otherElements,n)},Nr=(e,t,n)=>{if(typeof e!=`object`){if(typeof t==typeof e)return n?e===t?0:1:Xn(e,t);if(dn(t))return Cr(t,e,n);throw new y(Tr(e,t,n))}return e.kind===`ModelValue`?(e.type!==void 0&&Dn(e,t,n),dn(t)?n?e.name===t.name?0:1:e.rank-t.rank:-1):un(e)?kr(e,t,n):Mr(e,t,n)},Pr=(e,t)=>Nr(e,t,!1),Fr=(e,t)=>Nr(e,t,!0)===0,Ir=e=>{let t=[];for(let n of e){let e=Rr(n,t);e.isFound||t.splice(e.index,0,n)}return t},Lr=(e,t)=>{let n=Hi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Rr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=Lr(e,()=>Pr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},zr=(e,t)=>t.some(t=>Lr(t,()=>Fr(t,e))),Br=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Vr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Vr)),e.kind===`Function`&&(e.domain.forEach(Vr),e.range.forEach(Vr)))},Hr=e=>{if(!(typeof e!=`object`||cr(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:I(e);return;case`FilteredSet`:case`Subset`:return Hr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(Hr(e.left),Hr(e.right));case`FunctionSet`:return Hr(e.domain),Hr(e.range);case`RecordSet`:return e.sets.forEach(Hr);case`ProductSet`:return e.factors.forEach(Hr)}},Ur=(e,t)=>Ui(mr,Fr,e,t),Wr=e=>{for(let t=1;t<e.length;t++)if(Xn(e[t-1],e[t])>=0)return!1;return!0},Gr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},Kr=e=>{for(let t=1;t<e.length;t++)fr(e[t]);if(e.length<2||Wr(e))return tr(e);let t=[...e].sort(Xn),n=[t[0]];for(let e=1;e<t.length;e++)Xn(n[n.length-1],t[e])!==0&&n.push(t[e]);return tr(n)},qr=e=>{if(Gr(e))return tr(e);let t=Ui(Kr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Jr=tr([]),Yr=(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&&Xn(r[a],t)<0;)a++;a<r.length&&Xn(r[a],t)===0||i.push(t)}return i.length===n.length?e:tr(i)},Xr=(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&&Xn(r[a],t)<0;)a++;a<r.length&&Xn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:tr(i)},Zr=(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=Xn(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=tr(i);if(e.hash!==0&&e.hash!==_a){let t=e.hash,n=0;for(;n<a.length;n++){let e=Sa(a[n]);if(e===_a)break;t=t+ha(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+Ta(a[e])|0;c.fingerprint=t}return c},Qr=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Xn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Xn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return rr(n,r)},$r=e=>{let t=Qr(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:gn(t,e.map(e=>e[0]))},ei=[],ti=/* @__PURE__ */ new Map,ni=[],ri=/* @__PURE__ */ new WeakMap,ii=e=>{let t=ei[e]??ti.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?ti.set(e,new WeakRef(n)):ei[e]=n,n},ai=e=>{if(Fi(e),e.low===1&&e.high>=1)return ii(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},oi=e=>e.length>0&&(e===ei[e.length]||e===ti.get(e.length)?.deref())||ri.has(e),si=e=>{let t=I(e).elements;return oi(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},ci=e=>{let t=ni[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return ni[e]=n,n},li=e=>ar(rr(ii(e.length),e),`tuple`),ui=e=>ar(Qr(e),`record`),di=(e,t)=>ar(rr(e,t),`record`),fi=e=>P(e)&&!Un(e),pi=(e,t=!1)=>`UNION(${R(e.base,t)})`,mi=(e,t=e=>I(e).elements)=>{if(!fi(e.base))throw new y(`Attempted to enumerate the nonenumerable set:\n${pi(e)}`);return t(e.base)},hi=(e,t,n)=>{if(fi(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${R(e)}\nwhen enumerating:\n${pi(n)}`)},F=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 F(e.base);case`FunctionSet`:return F(e.domain)&&F(e.range)||gi(e.domain)===!0||gi(e)===!0;case`RecordSet`:return e.sets.every(F)||gi(e)===!0;case`ProductSet`:return e.factors.every(F)||gi(e)===!0;case`Union`:return F(e.base)&&(fn(e.base)?Br(e.base):Di(e.base)).every(F);case`SetOperation`:return e.operator===`\\cup`?F(e.left)&&F(e.right):e.operator===`\\cap`?F(e.left)||F(e.right):F(e.left);default:return!1}},gi=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=gi(e.domain);return t===void 0?void 0:!t&&gi(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=gi(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return F(e)?I(e).elements.length===0:void 0;default:return}},_i=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},vi=(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},yi=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Un(e.base))return;let t=I(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:vi(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return tr(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},bi=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(tr(r.map(t=>e[t])));while(vi(r,e.length))}return t},xi=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Un(a))throw new y(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},Si=(e,t=e=>I(e).elements)=>{if(typeof e!=`object`)throw new y(`Expected a set but found ${R(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Ir(e.elements);case`Interval`:{let t=ai(e);return t!==ei[t.length]&&ri.set(t,e),t}case`Subset`:{if(Fi(e.base)===0)return bi([]);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(R(e.base))}`);let t=I(e.base).elements;if(t.length>30)throw new y(Pi(e));return bi(t)}case`FunctionSet`:{if(!Nn&&Mi(e))return[];if(Un(e.domain))throw new y(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${R(e.domain)}\ncannot be enumerated.`);let n=si(e.domain);if((n.length>0||Nn)&&Un(e.range))throw new y(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${R(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return _i(n.map(()=>r)).map(e=>rr(n,e))}case`RecordSet`:{if(!Nn&&Mi(e))return[];let n=xi(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${R(t)}`);return _i(n).map(t=>ui(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Nn&&Mi(e))return[];let n=xi(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${R(e)}`);return _i(n).map(li)}case`FilteredSet`:if(!P(e.base)||Un(e.base))throw new y(`Attempted to enumerate { x \\in S : p(x) } when S:\n${R(e.base)}\nis not enumerable`);return I(qr(Di(e.base).filter(t=>e.test(t,!1)))).elements;case`Union`:{let t=[];return mi(e).forEach((n,r)=>{let i=hi(n,r,e);if(sn(i))throw new s(an());Di(i).forEach(e=>on(t,e))}),I(qr(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!fi(e.left)&&!fi(e.right))throw new y(`Attempted to enumerate S \\cap T when neither S:\n${R(e.left)}\nnor T:\n${R(e.right)}\nis enumerable`);if(e.operator===`\\`&&!fi(e.left))throw new y(`Attempted to enumerate S \\ T when S:\n${R(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return I(qr(wi(e))).elements;let t=e.operator===`\\`||fi(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return cn(typeof n==`object`&&n.kind===`Interval`?n:Di(n),t=>{Gi(t,r)===(e.operator===`\\cap`)&&on(i,t)}),I(qr(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to enumerate the non-enumerable set ${R(e)}`);default:throw new y(`Expected a set but found ${R(e)}`)}},I=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return tr(Si(e));let t=typeof e==`object`&&Qt(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Hi.sets;n?.push(e);let r=Si(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`)?tr(r):Kr(r);return t&&(t.enumerated=i),i},Ci=e=>{if(!(typeof e!=`object`||cr(e)))switch(e.kind){case`MixedSet`:I(e);return;case`FilteredSet`:return fi(e.base)||I(e),Ci(e.base);case`Union`:if(!fn(e.base)&&fi(e.base))return Ci(e.base);mi(e).slice(0,1).forEach(t=>Ci(hi(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!fi(e.left)&&I(e),e.operator!==`\\cup`||fi(e.left)&&fi(e.right)||I(e),e.operator!==`\\cap`||fi(e.left)?Ci(e.left):Ci(e.right),e.operator===`\\cup`&&Ci(e.right)}},wi=e=>{if(!fi(e.left)||!fi(e.right))throw new y(`Attempted to enumerate S \\cup T when S:\n${R(e.left)}\nand T:\n${R(e.right)}\nare not both enumerable`);if(Ci(e.left),Ci(e.right),sn(e.left))throw new s(an());let t=Di(e.left),n=sn(e.right)?void 0:Di(e.right);if(!n||t.length+n.length>rn())throw new s(an());return[...t,...n]},Ti=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return I(e).elements;let t=Lr(e,()=>wi(e)),n=I(qr(t)).elements;return e.enumerated=tr(n),n},Ei=(e,t)=>{if(typeof e!=`object`||cr(e))return I(e).elements.some(t);let n=Hi.sets;n?.push(e),Ci(e);let r=ji(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Di=e=>{let t=[];return Ei(e,e=>(t.push(e),!1)),t},Oi=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,ki=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(ki);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(ki)&&e.range.every(ki);case`SetOperation`:return e.operator!==`\\cup`&&ki(e.left)&&ki(e.right);case`FilteredSet`:return ki(e.base);case`ProductSet`:return e.factors.every(ki);default:return!1}},Ai=e=>typeof e!=`object`||cr(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Ai(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Ai(e.left)||Ai(e.right):Oi(e)?.some(Ai)??!1,ji=(e,t)=>{if(e.kind===`Union`)return mi(e,Di).some((n,r)=>Ei(hi(n,r,e),t));if(e.kind===`FilteredSet`&&fi(e.base))return Ei(e.base,n=>e.test(n,!1)&&t(n));if(Oi(e)?.some(Ai))return Si(e,Di).some(t);if(e.kind!==`SetOperation`)return I(e).elements.some(t);if(e.operator===`\\cup`)return!fi(e.left)||!fi(e.right)?I(e).elements.some(t):Ei(e.left,t)||Ei(e.right,t);let n=e.operator===`\\`||fi(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return fi(r)?Ei(r,n=>Gi(n,i)===(e.operator===`\\cap`)&&t(n)):I(e).elements.some(t)},Mi=e=>{if(typeof e!=`object`||!P(e))throw new y(`Shouldn't call isEmpty() on value ${R(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(Mi);case`RecordSet`:return e.sets.some(Mi);case`FunctionSet`:return!Mi(e.domain)&&Mi(e.range);case`Union`:return mi(e).every((t,n)=>Mi(hi(t,n,e)));default:return I(e).elements.length===0}},Ni=(e,t,n)=>e.reduce((e,r)=>{let i=e*Fi(r,t);if(i>2147483647)throw new y(n());return i},1),Pi=e=>`Overflow when computing the number of elements in:\n${R(e)}`,Fi=(e,t)=>{if(typeof e!=`object`)throw new y(`Attempted to compute the number of elements in the ${pn(e)} ${R(e)}.`);switch(e.kind){case`ModelValue`:throw new y(`Attempted to compute the number of elements in the model value ${R(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return Fi(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 ${R(e)}.`);case`Subset`:{let n=Fi(e.base,t);if(n>=31)throw new y(Pi(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(Mi(e.domain))return 1;if(Mi(e.range))return 0;if(Fi(e.range,t)===1)return 1}let n=Fi(e.domain,t),r=Fi(e.range,t);if(r<=1)return n===0?1:r;let i=1;for(let t=0;t<n;t++)if(i*=r,i>2147483647)throw new y(Pi(e));return i}case`RecordSet`:return t!==`1.7.4`&&Mi(e)?0:Ni(e.sets,t,()=>Pi(e));case`ProductSet`:return t!==`1.7.4`&&Mi(e)?0:Ni(e.factors,t,()=>`Overflow when computing the number of elements in ${R(e)}`);default:return fr(e),I(e).elements.length}},Ii=e=>`Attempted to check if the set ${R(e)}is finite.`,Li=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new y(`Attempted to check if the ${pn(e)} ${R(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${R(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Li(e.base)&&Mi(e.base);case`Subset`:return Li(e.base);case`FunctionSet`:{let t=Li(e.domain);if(t&&Mi(e.domain))return!0;let n=Li(e.range);return n&&Mi(e.range)?!0:n&&(t||Fi(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n=!0;for(let e of t)if(!Li(e))n=!1;else if(Mi(e))return!0;return n}case`Union`:if(!fi(e.base))throw new y(`Attempted to check if the nonenumerable set:\n${pi(e)}\nis a finite set.`);return I(e.base).elements.every(Li);case`SetOperation`:if(e.operator===`\\cup`)return Li(e.left)&&Li(e.right);if(e.operator===`\\cap`){if(!Li(e.left)&&!Li(e.right))throw new y(Ii(e));return!0}if(Li(e.left))return!0;if(!Li(e.right))throw new y(Ii(e));return!1;case`FilteredSet`:if(!Li(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${R(e.base)}\nis finite.`);return!0}},Ri=(e,t,n=Xn)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},zi=(e,t)=>{let n=e.elements;if(n.length>rn())throw new s(an());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=Ri(n,e);return!r[t]&&(r[t]=!0,!0)}),a=tr(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},Bi=e=>{if(typeof e!=`object`||!un(e))return;if(e.kind===`LazyFunction`&&(!P(e.domain)||Un(e.domain)))throw new y(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=L(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Vi=(e,t)=>{let n=`Attempted to check if the value:\n${R(e)}\nis an element of the`;if(!un(t))return`${n} ${pn(t)} ${R(t)}`;let r=or(t);return r===`record`?`Attempted to check if element:\n${R(e)}\nis in the record:\n${R(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${R(t)}`},Hi={sets:void 0},Ui=(e,t,n,r)=>{let i=Hi.sets,a=Hi.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof y))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Wi=e=>(Hi.sets??[]).slice(e).some(e=>typeof e==`object`&&Hi.callStack?.sources.has(e)===!0),Gi=(e,t)=>{let n=Hi.sets;if(n===void 0)return Xi(e,t);n.push(t);let r=Xi(e,t);return n.pop(),r},Ki=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},qi=(e,t)=>Ri(t.elements,e)!==-1,Ji=(e,t)=>t.isNormalized?Rr(e,t.elements).isFound:zr(e,Br(t)),Yi=(e,t)=>{if(e.type!==void 0)throw new y(`Attempted to check if the typed model value ${N(R(e))} is an element of\n${N(R(t))}`);return!1},Xi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return Ki(e,t)??Zi(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return Zi(e,t)},Zi=(e,t)=>{if(!P(t))throw new y(Vi(e,t));switch(t.kind){case`Set`:return fr(e),Ui(qi,Ji,e,t);case`MixedSet`:return zr(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&(!dn(e)||e.type!==void 0))throw new y(`Attempted to check if the value:\n${R(e)}\nis in the integer interval ${R(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(dn(e))return Yi(e,t);if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new x(`Attempted to check if the value:\n${R(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!P(e)||Un(e))throw new y(`Attempted to check if the non-enumerable value\n${N(R(e))}\nis element of\n${N(R(t))}`);return I(e).elements.every(e=>Gi(e,t.base));case`FunctionSet`:{if(!un(e)){if(dn(e))return Yi(e,t);throw new y(`Attempted to check if \n${R(e)}\nwhich is not a TLC function value, is in the set of functions:\n${N(R(t))}`)}let n=L(e),r=br(e,n.domain);return(r===void 0?Ur(t.domain,tr(n.domain)):Ur({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Gi(e,t.range))}case`RecordSet`:{let n=un(e)?L(e):void 0;if(!n||!Sn(n.domain)){if(dn(e))return Yi(e,t);throw new y(`Attempted to check if non-record\n${R(e)}\nis in the set of records:\n${R(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Ri(n.domain,e);return i!==-1&&Gi(n.range[i],t.sets[r])})}case`ProductSet`:{let n=un(e)?Bi(e):void 0;if(n===void 0){let n=un(e)&&L(e).domain.every(e=>typeof e==`number`);if(dn(e))return Yi(e,t);if(n)return!1;throw new y(`Attempted to check if non-tuple\n${R(e)}\nis in the set of tuples:\n${R(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>Gi(e,t.factors[n]))}case`FilteredSet`:try{return Gi(e,t.base)&&t.test(e,!0)}catch(n){throw!(n instanceof y)||!Nt(n)?n:new y(`Cannot decide if element:\n${N(R(e))}\n is element of:\n${N(R(t.base))}\nand satisfies the predicate ${t.source?.predicate}`)}case`Union`:{if(!fi(t.base))throw new y(`Attempted to check if:\n ${R(e)}\nis an element of the non-enumerable set:\n ${pi(t)}`);let n=I(t.base).elements;return n.length>1&&n.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),n.some(t=>Gi(e,t))}case`SetOperation`:return t.operator===`\\cup`?Gi(e,t.left)||Gi(e,t.right):Gi(e,t.left)&&Gi(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Bi(e);if(n===void 0){if(dn(e))return Yi(e,t);throw new x(`Attempted to check if the value:\n${N(R(e))}\nis an element of ${N(R(t))}.`)}return n.every(e=>Gi(e,t.base))}default:throw new y(Vi(e,t))}},Qi=(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?Gi(e,n):e.range.every((e,r)=>Qi(e,t.range[r],n.range)),L=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(F(e.domain)||Fi(e.domain),!P(e.domain))throw new y(`The domains of formal parameters must be enumerable.`);let t=si(e.domain);return e.enumerated=ar(rr(t,t.map(t=>e.apply(t))),or(e)),e.enumerated}throw new y(`Expected a function but found ${R(e)}`)},$i=(e,t,n)=>{let r=N(R(e)),i=N(R(t)),a=n===`1.7.4`;switch(or(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.`}},ea=(e,t)=>{if(!Nn)return $i(e,t);let n=N(R(t));return or(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},ta=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},na=e=>new y(`Attempted to apply function with integer domain to the non-integer argument ${N(R(e))}`),ra=(e,t)=>Ri(e.domain,t),ia=(e,t,n)=>{let r=_n(e);throw Nn||r!==e.domain||r.length<32?r.forEach(e=>Fr(e,t)):Ri(r,t,Pr),n},aa=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=or(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&&!Nn&&typeof t!=`number`&&oi(r))throw na(t)}let i=ta(r,t);return i===-1?Ui(ra,ia,e,t):i},oa=(e,t,n)=>{let r=e.domain,i=Bi(n),a=(t,n,r)=>`In applying the function\n${N(R(e))},\nthe ${t} is:\n${N(R(n))}\nwhich ${r}.\n`,o=()=>new y(a(`argument list`,n,`does not match its formal parameter`));if(i===void 0)throw o();if(typeof r!=`object`||r.kind!==`ProductSet`)throw new y(`Attempted to apply a function to ${R(n)}, which is not in its domain`);if(t.forEach((e,t)=>{if(t>=i.length)throw o();let n=i[t],s=`argument number ${t+1}`;if(!Gi(n,r.factors[t]))throw new y(a(s,n,e===void 0?`is not in the function's domain ${R(r)}`:`is not in its domain`));if(e!==void 0&&Bi(n)?.length!==e)throw new y(a(s,n,`does not match its formal parameter`))}),i.length>t.length)throw o()},sa=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!Gi(t,e.lambdaDomain),ca=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return ca(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return oa(e,r,t),e.apply(t);if(!Gi(t,e.domain))throw new y(or(e)===`lambda`?$i(e,t):`Attempted to apply a function to ${R(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new y(`Attempted to apply ${R(e)}, which is not a function`);let r=n??$i;if(sa(e,t))throw new y(r(e,t));let i=aa(e,t,r);if(i===-1)throw new y(r(e,t));return e.range[i]},la=e=>oi(e)?ri.get(e)??ci(e.length):void 0,ua=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=L(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=la(t.domain);if(n)return n;let r=tr(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},da=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(!Gi(t,e.domain))return e;let r=n(e.apply(t));return ar({kind:`LazyFunction`,domain:e.domain,apply:n=>Ur(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},or(e))}if(!un(e))throw new y(`Attempted to apply EXCEPT construct to the value ${N(R(e))}.`);let i=L(e);if(sa(i,t))return i;let a=aa(i,t,ea);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=ar(rr(i.domain,o),or(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==_a){let e=Sa(c);if(e!==_a){let t=Sa(i.domain[a]);l.hash=s===c?i.hash:i.hash-ga(t,Sa(s))+ga(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Ea(e,s)+Ea(e,c)|0}return l},fa=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},pa=(e,t)=>Math.imul(e^t,16777619),ma=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return fa(t)},ha=e=>fa(e+2654435769|0),ga=(e,t)=>fa(Math.imul(e,668265261)+t|0),_a=795548749,va=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Sa(t[e]);if(r===_a)return _a;n=n+ha(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Sa(e.domain[n]),i=Sa(e.range[n]);if(r===_a||i===_a)return _a;t=t+ga(r,i)|0}return t},ya=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 ${R(e)}`);if(P(e)){I(e).elements.forEach(ya);return}let t=L(e);t.domain.forEach(ya),t.range.forEach(ya)},ba=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Sa(e)===_a&&ya(e);return}catch(e){if(!(e instanceof y))throw e;return e}},xa=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[]}},Sa=e=>typeof e==`number`?fa(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?ma(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=va(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?F(e.domain)?Sa(L(e)):_a:F(e)?Sa(I(e)):_a,Ca=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},wa=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Ca(t)},Ta=e=>Ca(Oa(e)+2135587861|0),Ea=(e,t)=>Ca(Math.imul(Oa(e),374761393)+Oa(t)|0),Da=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Ta(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Ea(e.domain[n],e.range[n])|0;return t},Oa=e=>typeof e==`number`?Ca(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?wa(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Da(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Oa(L(e)):F(e)?Oa(I(e)):wa(ka(e)),ka=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Aa(e),Aa=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ka(e.base)}>`;if(e.kind===`FilteredSet`&&!F(e))throw new y(`Attempted to compare the non-enumerable set ${R(e)} with another value`);if(P(e))return F(e)?`{${I(e).elements.map(ka).join(`,`)}}`:`<${e.kind} ${R(e)}>`;let t=L(e);return`(${t.domain.map((e,n)=>`${ka(e)}:${ka(t.range[n])}`).join(`,`)})`},ja={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},Ma=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>ja[e])}"`,Na=1999,Pa=e=>e.reduce((e,t)=>e===0?0:e*Fi(t),1),Fa=e=>{if(e.kind===`Subset`)return Fi(e.base)<=6?I(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return I(e);if(e.kind===`FunctionSet`){let t=Mi(e.domain)?0:Fi(e.domain);return(t===0?1:Fi(e.range)**t)<=Na?I(e):void 0}return Pa(e.kind===`RecordSet`?e.sets:e.factors)<=Na?I(e):void 0},Ia=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&un(e.base)&&(e.base.kind===`Function`||F(e.base.domain)))return Fa(e);if(F(e))try{return Fa(e)}catch(e){if(e instanceof y)return;throw e}},La=(e,t)=>{let n=e=>R(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 pi(e,t)}},Ra=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),za=e=>{if(F(e.domain))try{return L(e)}catch(e){if(e instanceof y||C(e))return;throw e}},Ba=e=>{let t=[],n=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:if(e.elements.forEach(n),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(n),I(e);return;case`Function`:e.range.forEach(n);return;case`LazyFunction`:n(e.enumerated??e.domain);return;case`SetOperation`:n(e.left),n(e.right);return;case`FunctionSet`:n(e.domain),n(e.range);return;case`RecordSet`:e.sets.forEach(n);return;case`ProductSet`:e.factors.forEach(n);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:n(e.base);return;default:return}};try{return e.forEach(n),e.map(e=>R(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1})}},R=(e,t=!1,n=!1)=>{let r=e=>R(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Ma(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(I(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=Pn.isExpanded?Ia(e,t):void 0;return n?r(n):La(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Pn.isExpanded||!e.source?za(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${R(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Nn&&or(e)!==`tuple`)return`<< >>`;let a=r=>R(r,t,n&&or(e)!==`lambda`);if(i.domain.length===0&&or(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):yn(i);return or(e)===`record`||i.domain.every(e=>typeof e==`string`&&Ra(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},Va=(e,t)=>{if(e===void 0)return!1;try{return mr(e,t)}catch(e){if(e instanceof y)return!1;throw e}},Ha=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Ua=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(Ha,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
|
|
74
|
-
`;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(gt(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},
|
|
72
|
+
`]]),Ft=(e,t,n)=>{let r=n?Pt.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)}${It(t.slice(a),n)}`},It=(e,t)=>{let n=t?Mt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Ct.none} @!@!@\n${Ft(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Lt=(e,t=2)=>String(e).padStart(t,`0`),Rt=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 ${Lt(r%24)}h`:e>36e5?`${Lt(r%24)}h ${Lt(n)}min`:e>6e4?`${Lt(n)}min ${Lt(t)}s`:`${Lt(t)}s`},zt=e=>`${e.getFullYear()}-${Lt(e.getMonth()+1)}-${Lt(e.getDate())} ${Lt(e.getHours())}:${Lt(e.getMinutes())}:${Lt(e.getSeconds())}`,Bt=/* @__PURE__ */ new WeakMap,Vt=(t,n,r)=>{if(!(t instanceof w))return t;let i=x(new w(`${r}\n${t.message}`,t),e(t));return Bt.set(i,{code:n,headline:r,inner:t}),i},Ht=e=>Bt.has(e),Ut=y(`util.WrongInvocationException`),Wt=l.slice(0,l.indexOf(`
|
|
73
|
+
`)),Gt=`${l}tlc2.tool.EvalException: `,Kt=`${l}util.Assert$TLCRuntimeException: `,qt=e=>Nt(e)?Gt:Kt,Jt=e=>{try{return e()}catch(e){throw e instanceof w?Nt(e)?new w(`${a}${e.message}`):Mt(e.message)?e:new w(`${l}${e.message}`):e}},Yt=[Gt,Kt,l,a],Xt=(e,t)=>{let r=Bt.get(e);if(r)return`${r.headline}\n${Xt(r.inner,t)}`;let i=e.message;if(e instanceof n)return i;let a=Yt.find(e=>i.startsWith(e))??``;return`${a}${It(i.slice(a.length),t)}`},Zt=(e,t)=>{let r=Bt.get(e),a=e.message;if(r)return{code:r.code,message:a,toolMessage:Xt(e,!0)};if(e instanceof i)return{code:t?St.stackOverflow:St.general,message:a,toolMessage:a};if(t&&Nt(e))return{code:Mt(a)?.code??St.general,message:a,toolMessage:a};let o=t&&!a.startsWith(Wt)&&!(e instanceof n),s=e instanceof u?Ut:l,c=o?s:``;return{code:St.general,message:`${c}${a}`,toolMessage:`${c}${Xt(e,!0)}`}},Qt=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,$t=2147483647,en=1e6;let tn=en;const nn=()=>tn,rn=()=>Math.max(tn,10),an=()=>`Attempted to construct a set with too many elements (>${tn}).`,on=(e,t)=>{if(e.length===rn())throw new u(an());e.push(t)},sn=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=rn(),cn=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},ln=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,un=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),dn=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),fn=e=>typeof e==`object`&&e.kind===`ModelValue`,pn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),mn=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:ln(e)?`set`:`function`,hn=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let gn=!1;const _n=(e,t)=>(gn=!0,e.writtenKeys=t,e),vn=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,yn=e=>vn(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),bn=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):yn(e),xn=(e,t,n,r)=>_n(fi(e,t.map(e=>n[e])),r),Sn=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(Sn);e.writtenKeys=void 0,e.range.forEach(Sn)}},Cn=e=>e.every(e=>typeof e==`string`),wn=(e,t)=>e.length>0&&t.length>0&&Cn(e)!==Cn(t),Tn=(e,t)=>{gn&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return wn(n,r)?Fr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Zn(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:Zn(t,n);if(r!==0)return r}return 0},En=(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=Zn(n[e],r[e]);if(t!==0)return t}return 0},Dn=e=>fn(e)?e.type:void 0,On=(e,t,n)=>{let r=Dn(e),i=Dn(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(fn(e)&&fn(t)){if(r===void 0||i===void 0||r===i)return;throw new w(`Attempted to ${a} the differently-typed model values ${L(e)} and ${L(t)}`)}throw r===void 0?new w(`Attempted to ${a} the typed model value ${L(t)} and the non-model value\n${L(e)}`):new w(`Attempted to ${a}${n?``:` the`} typed model value ${L(e)} and non-model value\n${L(t)}`)},kn=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),An=kn(),jn=e=>{Object.assign(An,kn()),Qn.clear();for(let t of e)Vn(t)},Mn=()=>{An.searchRank=An.size},Nn=()=>An.unorderedString;let Pn=!1;const Fn={isExpanded:!0,isViewPrinted:!1},In=e=>{Pn=e.version===`1.7.4`,tn=e.maxSetSize??en,Fn.isExpanded=e.isLazyValueExpanded??!0,Fn.isViewPrinted=e.isViewPrinted??!1},Ln=/* @__PURE__ */ new WeakMap,Rn=(e,t)=>(Fn.isViewPrinted&&Ln.set(e,t),e),zn=/* @__PURE__ */ new WeakMap,Bn=(e,t)=>(zn.set(e,t),e),Vn=e=>(An.ranks[e]===void 0&&(An.ranks[e]=An.size++),e),Hn=e=>An.ranks[Vn(e)],Un=(e,t)=>{if(e===t)return 0;let n=An.ranks,r=n[e],i=n[t],a=An.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(An.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Wn=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Gn=(e,t)=>(Wn(e)||Wn(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Kn=(e,t)=>new w(Wn(e)?`Attempted to compare overridden value ${L(e,!0)} with non-overridden value:\n${L(t)}`:`Attempted to compare ${mn(e)} ${L(e)} with ${mn(t)} ${L(t)}`),qn=(e,n,r)=>{if(!Wn(e))throw new w(`Attempted to ${r} the set ${L(P(e)?F(e):e,!0)} with the value:\n${L(n,!0)}`);if(!Wn(n))throw Kn(e,n);let i=e.kind===`InfiniteSet`?e.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new t(`Attempted to compare ${L(e,!0)} with the value\n${L(n,!0)}`)},Jn={kind:`InfiniteSet`,name:`Any`},Yn=e=>{throw new t(`Attempted to compare ANY with the value\n${L(e)}`)},Xn=e=>{gn&&Sn(e),e===Jn&&Yn(e),typeof e==`object`&&e.kind===`LazyFunction`&&I(e)},Zn=(e,t)=>{if(e===t)return Xn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Tn(e,t);if(n===`Set`&&r===`Set`)return En(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&&On(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return On(e,t,!1),n===`ModelValue`?-1:1;if(e===Jn||t===Jn)return Yn(e===Jn?t:e);if(ln(e)&&ln(t)&&Gn(e,t))return qn(e,t,`compare`);let i=ln(e);if(i!==ln(t))throw Kn(e,t);if(n===`Interval`&&r===`Set`){let n=Ii(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-Ii(t);if(n!==0)return n}return i?En(F(e),F(t)):Tn(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Un(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(On(e,t,!1),fn(e))return-1;if(fn(t))return 1;throw Kn(e,t)},Qn=/* @__PURE__ */ new Map,$n=32768,er=e=>{let t=Qn.get(e);if(t)return t;if(Qn.size===$n)throw new f(`TLC supports at most ${$n} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Hn(e),hash:pa(ma(ha(e),109)),fingerprint:wa(Ta(e)^60)};return Qn.set(e,n),n},tr=()=>[...Qn.values()],nr=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),rr=e=>{let t=nr(e);return t.isNormalized=!0,t},ir=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let ar=!1;const or=(e,t)=>(t===`lambda`&&(ar=!0),t!==void 0&&(e.functionClass=t),e),sr=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,cr=e=>or(e,`lambda`),lr=e=>Qt(e)&&e.isCached===!0;let ur=!1;const dr=e=>(ur=!0,e),fr=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),pr=e=>{ur&&typeof e==`object`&&Qt(e)&&fr.has(e.kind)&&(e.isCached=!0)},mr=e=>{(ar||ur)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(mr),e.range.forEach(mr)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(mr):ln(e)&&P(e)&&(pr(e),F(e).elements.forEach(mr))))},hr=(e,t)=>{if(pr(e),e===t)return Xn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&On(e,t,!0),Zn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Tn(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return En(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&Ii(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==Ii(t))return!1;if(fn(e)||fn(t))return e.kind===`LazyFunction`&&I(e),On(e,t,!0),fn(e)&&fn(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return hr(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=Ni(e.domain),r=Ni(t.domain);if(n||r)return n===r;let i=Ni(e.range),a=Ni(t.range);return i||a?i===a:hr(e.domain,t.domain)&&hr(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(Ni(e))return Ni(t);if(Ni(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]&&hr(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return Ni(e)?Ni(t):!Ni(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>hr(e,t.factors[n]));let n=ln(e)&&ln(t)&&!(P(e)&&P(t));if(n&&Gn(e,t))return qn(e,t,`check equality of`)===0;if(n){if(!Wn(e)){let n=F(e);if(!Wn(t))return En(n,F(t))===0}return Aa(e)===Aa(t)}return Zn(e,t)===0},gr=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},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):Aa(n)===Aa(r);return n},_r=gr(!1),vr=gr(!0),yr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},br=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Ca(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||vr(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||vr(i[e],n))return i[e]}return n.kind===`Set`?yr(n.elements,t):(yr(n.domain,t),yr(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}},xr=(e,t)=>t.length===0||sr(e)===`tuple`?1:ua(t)?.low,Sr=e=>{if(!dn(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:xr(e,t.domain)}},Cr=e=>{if(!dn(e))return;let t=I(e);return Cn(t.domain)?t:void 0},wr=(e,t,n)=>(On(t,e,n),1),Tr={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`}},Er=(e,t,n)=>{let r=Tr[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${L(e)} with ${r.other}:\n${L(t)}`},Dr=e=>e?`check equality of`:`compare`,Or=(e,t,n,r)=>{let i=Sr(n);if(!i){if(fn(n))return wr(n,t,r);throw new w(`Attempted to ${Dr(r)} the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==i.range.length)return e.range.length-i.range.length;let a=()=>kr(e.range,i.range,r);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&i.low!==void 0)return e.low===i.low?a():e.low-i.low;let o=e.low??i.low;if(o===void 0)return kr(e.domain,i.domain,r)||a();let s=e.low===void 0?e.domain:i.domain;for(let t=0;t<s.length;t++){let n=s[t];if(typeof n!=`number`)throw new w(`Attempted to compare ${r?`an `:``}integer with non-integer${r||e.low!==void 0?`:`:``}\n${L(n)}.`);let i=e.low===void 0?n-(o+t):o+t-n;if(i!==0)return i}return a()},kr=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=Pr(e[r],t[r],n);if(i!==0)return i}return 0},Ar=(e,t,n)=>{let r=I(e);if(sr(e)===`tuple`){let i=dn(t)?Vi(t):void 0;return i?r.range.length-i.length||kr(r.range,i,n):Or({...r,low:1},e,t,n)}if(sr(e)===`record`){let i=Cr(t);if(!i){if(fn(t))return wr(t,e,n);throw new w(`Attempted to ${Dr(n)} record:\n${L(e)}\nwith non-record\n${L(t)}`)}return r.domain.length-i.domain.length||kr(r.domain,i.domain,n)||kr(r.range,i.range,n)}return Or({...r,low:xr(e,r.domain)},e,t,n)},jr=(e,t)=>Wn(e)||Wn(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Mr=(e,t)=>{let n=pn(t)?t:F(t);return{elements:F(e).elements,otherElements:F(n).elements}},Nr=(e,t,n)=>{if(jr(e,t))return n?+!hr(e,t):Zn(e,t);if(!pn(e))return Nr(F(e),t,n);if(!ln(t)){if(fn(t))return wr(t,e,n);throw new w(`Attempted to ${Dr(n)} the set ${L(e)} with the value:\n${L(t)}`)}let r=Mr(e,t);return r.elements.length-r.otherElements.length||kr(r.elements,r.otherElements,n)},Pr=(e,t,n)=>{if(typeof e!=`object`){if(typeof t==typeof e)return n?e===t?0:1:Zn(e,t);if(fn(t))return wr(t,e,n);throw new w(Er(e,t,n))}return e.kind===`ModelValue`?(e.type!==void 0&&On(e,t,n),fn(t)?n?e.name===t.name?0:1:e.rank-t.rank:-1):dn(e)?Ar(e,t,n):Nr(e,t,n)},Fr=(e,t)=>Pr(e,t,!1),Ir=(e,t)=>Pr(e,t,!0)===0,Lr=e=>{let t=[];for(let n of e){let e=zr(n,t);e.isFound||t.splice(e.index,0,n)}return t},Rr=(e,t)=>{let n=Ui.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},zr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=Rr(e,()=>Fr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},Br=(e,t)=>t.some(t=>Rr(t,()=>Ir(t,e))),Vr=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Hr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Hr)),e.kind===`Function`&&(e.domain.forEach(Hr),e.range.forEach(Hr)))},Ur=e=>{if(!(typeof e!=`object`||lr(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:F(e);return;case`FilteredSet`:case`Subset`:return Ur(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(Ur(e.left),Ur(e.right));case`FunctionSet`:return Ur(e.domain),Ur(e.range);case`RecordSet`:return e.sets.forEach(Ur);case`ProductSet`:return e.factors.forEach(Ur)}},Wr=(e,t)=>Wi(hr,Ir,e,t),Gr=e=>{for(let t=1;t<e.length;t++)if(Zn(e[t-1],e[t])>=0)return!1;return!0},Kr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},qr=e=>{for(let t=1;t<e.length;t++)pr(e[t]);if(e.length<2||Gr(e))return nr(e);let t=[...e].sort(Zn),n=[t[0]];for(let e=1;e<t.length;e++)Zn(n[n.length-1],t[e])!==0&&n.push(t[e]);return nr(n)},Jr=e=>{if(Kr(e))return nr(e);let t=Wi(qr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Yr=nr([]),Xr=(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&&Zn(r[a],t)<0;)a++;a<r.length&&Zn(r[a],t)===0||i.push(t)}return i.length===n.length?e:nr(i)},Zr=(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&&Zn(r[a],t)<0;)a++;a<r.length&&Zn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:nr(i)},Qr=(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=Zn(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=nr(i);if(e.hash!==0&&e.hash!==va){let t=e.hash,n=0;for(;n<a.length;n++){let e=Ca(a[n]);if(e===va)break;t=t+ga(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+Ea(a[e])|0;c.fingerprint=t}return c},$r=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Zn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Zn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return ir(n,r)},ei=e=>{let t=$r(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:_n(t,e.map(e=>e[0]))},ti=[],ni=/* @__PURE__ */ new Map,ri=[],ii=/* @__PURE__ */ new WeakMap,ai=e=>{let t=ti[e]??ni.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?ni.set(e,new WeakRef(n)):ti[e]=n,n},oi=e=>{if(Ii(e),e.low===1&&e.high>=1)return ai(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},si=e=>e.length>0&&(e===ti[e.length]||e===ni.get(e.length)?.deref())||ii.has(e),ci=e=>{let t=F(e).elements;return si(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},li=e=>{let t=ri[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return ri[e]=n,n},ui=e=>or(ir(ai(e.length),e),`tuple`),di=e=>or($r(e),`record`),fi=(e,t)=>or(ir(e,t),`record`),pi=e=>ln(e)&&!Wn(e),mi=(e,t=!1)=>`UNION(${L(e.base,t)})`,hi=(e,t=e=>F(e).elements)=>{if(!pi(e.base))throw new w(`Attempted to enumerate the nonenumerable set:\n${mi(e)}`);return t(e.base)},gi=(e,t,n)=>{if(pi(e))return e;throw new w(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(e)}\nwhen enumerating:\n${mi(n)}`)},P=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 P(e.base);case`FunctionSet`:return P(e.domain)&&P(e.range)||_i(e.domain)===!0||_i(e)===!0;case`RecordSet`:return e.sets.every(P)||_i(e)===!0;case`ProductSet`:return e.factors.every(P)||_i(e)===!0;case`Union`:return P(e.base)&&(pn(e.base)?Vr(e.base):Oi(e.base)).every(P);case`SetOperation`:return e.operator===`\\cup`?P(e.left)&&P(e.right):e.operator===`\\cap`?P(e.left)||P(e.right):P(e.left);default:return!1}},_i=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=_i(e.domain);return t===void 0?void 0:!t&&_i(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=_i(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return P(e)?F(e).elements.length===0:void 0;default:return}},vi=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},yi=(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},bi=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Wn(e.base))return;let t=F(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:yi(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return nr(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},xi=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(nr(r.map(t=>e[t])));while(yi(r,e.length))}return t},Si=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Wn(a))throw new w(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},Ci=(e,t=e=>F(e).elements)=>{if(typeof e!=`object`)throw new w(`Expected a set but found ${L(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Lr(e.elements);case`Interval`:{let t=oi(e);return t!==ti[t.length]&&ii.set(t,e),t}case`Subset`:{if(Ii(e.base)===0)return xi([]);if(!ln(e.base))throw new w(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${N(L(e.base))}`);let t=F(e.base).elements;if(t.length>30)throw new w(Fi(e));return xi(t)}case`FunctionSet`:{if(!Pn&&Ni(e))return[];if(Wn(e.domain))throw new w(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(e.domain)}\ncannot be enumerated.`);let n=ci(e.domain);if((n.length>0||Pn)&&Wn(e.range))throw new w(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${L(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return vi(n.map(()=>r)).map(e=>ir(n,e))}case`RecordSet`:{if(!Pn&&Ni(e))return[];let n=Si(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${L(t)}`);return vi(n).map(t=>di(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Pn&&Ni(e))return[];let n=Si(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${L(e)}`);return vi(n).map(ui)}case`FilteredSet`:if(!ln(e.base)||Wn(e.base))throw new w(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(e.base)}\nis not enumerable`);return F(Jr(Oi(e.base).filter(t=>e.test(t,!1)))).elements;case`Union`:{let t=[];return hi(e).forEach((n,r)=>{let i=gi(n,r,e);if(sn(i))throw new u(an());Oi(i).forEach(e=>on(t,e))}),F(Jr(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!pi(e.left)&&!pi(e.right))throw new w(`Attempted to enumerate S \\cap T when neither S:\n${L(e.left)}\nnor T:\n${L(e.right)}\nis enumerable`);if(e.operator===`\\`&&!pi(e.left))throw new w(`Attempted to enumerate S \\ T when S:\n${L(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return F(Jr(Ti(e))).elements;let t=e.operator===`\\`||pi(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return cn(typeof n==`object`&&n.kind===`Interval`?n:Oi(n),t=>{Ki(t,r)===(e.operator===`\\cap`)&&on(i,t)}),F(Jr(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new w(`Attempted to enumerate the non-enumerable set ${L(e)}`);default:throw new w(`Expected a set but found ${L(e)}`)}},F=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return nr(Ci(e));let t=typeof e==`object`&&Qt(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Ui.sets;n?.push(e);let r=Ci(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`)?nr(r):qr(r);return t&&(t.enumerated=i),i},wi=e=>{if(!(typeof e!=`object`||lr(e)))switch(e.kind){case`MixedSet`:F(e);return;case`FilteredSet`:return pi(e.base)||F(e),wi(e.base);case`Union`:if(!pn(e.base)&&pi(e.base))return wi(e.base);hi(e).slice(0,1).forEach(t=>wi(gi(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!pi(e.left)&&F(e),e.operator!==`\\cup`||pi(e.left)&&pi(e.right)||F(e),e.operator!==`\\cap`||pi(e.left)?wi(e.left):wi(e.right),e.operator===`\\cup`&&wi(e.right)}},Ti=e=>{if(!pi(e.left)||!pi(e.right))throw new w(`Attempted to enumerate S \\cup T when S:\n${L(e.left)}\nand T:\n${L(e.right)}\nare not both enumerable`);if(wi(e.left),wi(e.right),sn(e.left))throw new u(an());let t=Oi(e.left),n=sn(e.right)?void 0:Oi(e.right);if(!n||t.length+n.length>rn())throw new u(an());return[...t,...n]},Ei=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return F(e).elements;let t=Rr(e,()=>Ti(e)),n=F(Jr(t)).elements;return e.enumerated=nr(n),n},Di=(e,t)=>{if(typeof e!=`object`||lr(e))return F(e).elements.some(t);let n=Ui.sets;n?.push(e),wi(e);let r=Mi(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Oi=e=>{let t=[];return Di(e,e=>(t.push(e),!1)),t},ki=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Ai=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Ai);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Ai)&&e.range.every(Ai);case`SetOperation`:return e.operator!==`\\cup`&&Ai(e.left)&&Ai(e.right);case`FilteredSet`:return Ai(e.base);case`ProductSet`:return e.factors.every(Ai);default:return!1}},ji=e=>typeof e!=`object`||lr(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?ji(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||ji(e.left)||ji(e.right):ki(e)?.some(ji)??!1,Mi=(e,t)=>{if(e.kind===`Union`)return hi(e,Oi).some((n,r)=>Di(gi(n,r,e),t));if(e.kind===`FilteredSet`&&pi(e.base))return Di(e.base,n=>e.test(n,!1)&&t(n));if(ki(e)?.some(ji))return Ci(e,Oi).some(t);if(e.kind!==`SetOperation`)return F(e).elements.some(t);if(e.operator===`\\cup`)return!pi(e.left)||!pi(e.right)?F(e).elements.some(t):Di(e.left,t)||Di(e.right,t);let n=e.operator===`\\`||pi(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return pi(r)?Di(r,n=>Ki(n,i)===(e.operator===`\\cap`)&&t(n)):F(e).elements.some(t)},Ni=e=>{if(typeof e!=`object`||!ln(e))throw new w(`Shouldn't call isEmpty() on value ${L(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 w(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(Ni);case`RecordSet`:return e.sets.some(Ni);case`FunctionSet`:return!Ni(e.domain)&&Ni(e.range);case`Union`:return hi(e).every((t,n)=>Ni(gi(t,n,e)));default:return F(e).elements.length===0}},Pi=(e,t,n)=>e.reduce((e,r)=>{let i=e*Ii(r,t);if(i>2147483647)throw new w(n());return i},1),Fi=e=>`Overflow when computing the number of elements in:\n${L(e)}`,Ii=(e,t)=>{if(typeof e!=`object`)throw new w(`Attempted to compute the number of elements in the ${mn(e)} ${L(e)}.`);switch(e.kind){case`ModelValue`:throw new w(`Attempted to compute the number of elements in the model value ${L(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return Ii(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new w(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new w(`Attempted to compute the number of elements in the overridden value ${L(e)}.`);case`Subset`:{let n=Ii(e.base,t);if(n>=31)throw new w(Fi(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(Ni(e.domain))return 1;if(Ni(e.range))return 0;if(Ii(e.range,t)===1)return 1}let n=Ii(e.domain,t),r=Ii(e.range,t);if(r<=1)return n===0?1:r;let i=1;for(let t=0;t<n;t++)if(i*=r,i>2147483647)throw new w(Fi(e));return i}case`RecordSet`:return t!==`1.7.4`&&Ni(e)?0:Pi(e.sets,t,()=>Fi(e));case`ProductSet`:return t!==`1.7.4`&&Ni(e)?0:Pi(e.factors,t,()=>`Overflow when computing the number of elements in ${L(e)}`);default:return pr(e),F(e).elements.length}},Li=e=>`Attempted to check if the set ${L(e)}is finite.`,Ri=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new w(`Attempted to check if the ${mn(e)} ${L(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new w(`Attempted to check if the function:\n${L(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Ri(e.base)&&Ni(e.base);case`Subset`:return Ri(e.base);case`FunctionSet`:{let t=Ri(e.domain);if(t&&Ni(e.domain))return!0;let n=Ri(e.range);return n&&Ni(e.range)?!0:n&&(t||Ii(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n=!0;for(let e of t)if(!Ri(e))n=!1;else if(Ni(e))return!0;return n}case`Union`:if(!pi(e.base))throw new w(`Attempted to check if the nonenumerable set:\n${mi(e)}\nis a finite set.`);return F(e.base).elements.every(Ri);case`SetOperation`:if(e.operator===`\\cup`)return Ri(e.left)&&Ri(e.right);if(e.operator===`\\cap`){if(!Ri(e.left)&&!Ri(e.right))throw new w(Li(e));return!0}if(Ri(e.left))return!0;if(!Ri(e.right))throw new w(Li(e));return!1;case`FilteredSet`:if(!Ri(e.base))throw new w(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(e.base)}\nis finite.`);return!0}},zi=(e,t,n=Zn)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},Bi=(e,t)=>{let n=e.elements;if(n.length>rn())throw new u(an());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=zi(n,e);return!r[t]&&(r[t]=!0,!0)}),a=nr(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},Vi=e=>{if(typeof e!=`object`||!dn(e))return;if(e.kind===`LazyFunction`&&(!ln(e.domain)||Wn(e.domain)))throw new w(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Hi=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!dn(t))return`${n} ${mn(t)} ${L(t)}`;let r=sr(t);return r===`record`?`Attempted to check if element:\n${L(e)}\nis in the record:\n${L(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${L(t)}`},Ui={sets:void 0},Wi=(e,t,n,r)=>{let i=Ui.sets,a=Ui.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof w))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Gi=e=>(Ui.sets??[]).slice(e).some(e=>typeof e==`object`&&Ui.callStack?.sources.has(e)===!0),Ki=(e,t)=>{let n=Ui.sets;if(n===void 0)return Zi(e,t);n.push(t);let r=Zi(e,t);return n.pop(),r},qi=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},Ji=(e,t)=>zi(t.elements,e)!==-1,Yi=(e,t)=>t.isNormalized?zr(e,t.elements).isFound:Br(e,Vr(t)),Xi=(e,t)=>{if(e.type!==void 0)throw new w(`Attempted to check if the typed model value ${N(L(e))} is an element of\n${N(L(t))}`);return!1},Zi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return qi(e,t)??Qi(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return Qi(e,t)},Qi=(e,n)=>{if(!ln(n))throw new w(Hi(e,n));switch(n.kind){case`Set`:return pr(e),Wi(Ji,Yi,e,n);case`MixedSet`:return Br(e,n.elements);case`Interval`:if(typeof e==`number`)return e>=n.low&&e<=n.high;if(n.low<=n.high&&(!fn(e)||e.type!==void 0))throw new w(`Attempted to check if the value:\n${L(e)}\nis in the integer interval ${L(n)}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(fn(e))return Xi(e,n);if(!(n.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new t(`Attempted to check if the value:\n${L(e)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!ln(e)||Wn(e))throw new w(`Attempted to check if the non-enumerable value\n${N(L(e))}\nis element of\n${N(L(n))}`);return F(e).elements.every(e=>Ki(e,n.base));case`FunctionSet`:{if(!dn(e)){if(fn(e))return Xi(e,n);throw new w(`Attempted to check if \n${L(e)}\nwhich is not a TLC function value, is in the set of functions:\n${N(L(n))}`)}let t=I(e),r=xr(e,t.domain);return(r===void 0?Wr(n.domain,nr(t.domain)):Wr({kind:`Interval`,low:r,high:r+t.domain.length-1},n.domain))&&t.range.every(e=>Ki(e,n.range))}case`RecordSet`:{let t=dn(e)?I(e):void 0;if(!t||!Cn(t.domain)){if(fn(e))return Xi(e,n);throw new w(`Attempted to check if non-record\n${L(e)}\nis in the set of records:\n${L(n)}`)}return t.domain.length===n.names.length&&n.names.every((e,r)=>{let i=zi(t.domain,e);return i!==-1&&Ki(t.range[i],n.sets[r])})}case`ProductSet`:{let t=dn(e)?Vi(e):void 0;if(t===void 0){let t=dn(e)&&I(e).domain.every(e=>typeof e==`number`);if(fn(e))return Xi(e,n);if(t)return!1;throw new w(`Attempted to check if non-tuple\n${L(e)}\nis in the set of tuples:\n${L(n)}`)}return t.length===n.factors.length&&t.every((e,t)=>Ki(e,n.factors[t]))}case`FilteredSet`:try{return Ki(e,n.base)&&n.test(e,!0)}catch(t){throw!(t instanceof w)||!Nt(t)?t:new w(`Cannot decide if element:\n${N(L(e))}\n is element of:\n${N(L(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!pi(n.base))throw new w(`Attempted to check if:\n ${L(e)}\nis an element of the non-enumerable set:\n ${mi(n)}`);let t=F(n.base).elements;return t.length>1&&t.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),t.some(t=>Ki(e,t))}case`SetOperation`:return n.operator===`\\cup`?Ki(e,n.left)||Ki(e,n.right):Ki(e,n.left)&&Ki(e,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=Vi(e);if(r===void 0){if(fn(e))return Xi(e,n);throw new t(`Attempted to check if the value:\n${N(L(e))}\nis an element of ${N(L(n))}.`)}return r.every(e=>Ki(e,n.base))}default:throw new w(Hi(e,n))}},$i=(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?Ki(e,n):e.range.every((e,r)=>$i(e,t.range[r],n.range)),I=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(P(e.domain)||Ii(e.domain),!ln(e.domain))throw new w(`The domains of formal parameters must be enumerable.`);let t=ci(e.domain);return e.enumerated=ir(t,t.map(t=>e.apply(t))),e.enumerated}throw new w(`Expected a function but found ${L(e)}`)},ea=(e,t,n)=>{let r=N(L(e)),i=N(L(t)),a=n===`1.7.4`;switch(sr(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.`}},ta=(e,t)=>{if(!Pn)return ea(e,t);let n=N(L(t));return sr(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},na=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},ra=e=>new w(`Attempted to apply function with integer domain to the non-integer argument ${N(L(e))}`),ia=(e,t)=>zi(e.domain,t),aa=(e,t,n)=>{let r=vn(e);throw Pn||r!==e.domain||r.length<32?r.forEach(e=>Ir(e,t)):zi(r,t,Fr),n},oa=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=sr(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new w(n(e,t));if(a===void 0&&!Pn&&typeof t!=`number`&&si(r))throw ra(t)}let i=na(r,t);return i===-1?Wi(ia,aa,e,t):i},sa=(e,t,n)=>{let r=e.domain,i=Vi(n),a=(t,n,r)=>`In applying the function\n${N(L(e))},\nthe ${t} is:\n${N(L(n))}\nwhich ${r}.\n`,o=()=>new w(a(`argument list`,n,`does not match its formal parameter`));if(i===void 0)throw o();if(typeof r!=`object`||r.kind!==`ProductSet`)throw new w(`Attempted to apply a function to ${L(n)}, which is not in its domain`);if(t.forEach((e,t)=>{if(t>=i.length)throw o();let n=i[t],s=`argument number ${t+1}`;if(!Ki(n,r.factors[t]))throw new w(a(s,n,e===void 0?`is not in the function's domain ${L(r)}`:`is not in its domain`));if(e!==void 0&&Vi(n)?.length!==e)throw new w(a(s,n,`does not match its formal parameter`))}),i.length>t.length)throw o()},ca=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!Ki(t,e.lambdaDomain),la=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return la(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return sa(e,r,t),e.apply(t);if(!Ki(t,e.domain))throw new w(sr(e)===`lambda`?ea(e,t):`Attempted to apply a function to ${L(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new w(`Attempted to apply ${L(e)}, which is not a function`);let r=n??ea;if(ca(e,t))throw new w(r(e,t));let i=oa(e,t,r);if(i===-1)throw new w(r(e,t));return e.range[i]},ua=e=>si(e)?ii.get(e)??li(e.length):void 0,da=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=ua(t.domain);if(n)return n;let r=nr(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},fa=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(!Ki(t,e.domain))return e;let r=n(e.apply(t));return or({kind:`LazyFunction`,domain:e.domain,apply:n=>Wr(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},sr(e))}if(!dn(e))throw new w(`Attempted to apply EXCEPT construct to the value ${N(L(e))}.`);let i=I(e);if(ca(i,t))return i;let a=oa(i,t,ta);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=or(ir(i.domain,o),sr(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==va){let e=Ca(c);if(e!==va){let t=Ca(i.domain[a]);l.hash=s===c?i.hash:i.hash-_a(t,Ca(s))+_a(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Da(e,s)+Da(e,c)|0}return l},pa=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},ma=(e,t)=>Math.imul(e^t,16777619),ha=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return pa(t)},ga=e=>pa(e+2654435769|0),_a=(e,t)=>pa(Math.imul(e,668265261)+t|0),va=795548749,ya=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Ca(t[e]);if(r===va)return va;n=n+ga(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Ca(e.domain[n]),i=Ca(e.range[n]);if(r===va||i===va)return va;t=t+_a(r,i)|0}return t},ba=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new w(`TLC has found a state in which the value of a variable contains ${L(e)}`);if(ln(e)){F(e).elements.forEach(ba);return}let t=I(e);t.domain.forEach(ba),t.range.forEach(ba)},xa=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Ca(e)===va&&ba(e);return}catch(e){if(!(e instanceof w))throw e;return e}},Sa=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[]}},Ca=e=>typeof e==`number`?pa(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?ha(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=ya(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?P(e.domain)?Ca(I(e)):va:P(e)?Ca(F(e)):va,wa=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Ta=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return wa(t)},Ea=e=>wa(ka(e)+2135587861|0),Da=(e,t)=>wa(Math.imul(ka(e),374761393)+ka(t)|0),Oa=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Ea(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Da(e.domain[n],e.range[n])|0;return t},ka=e=>typeof e==`number`?wa(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Ta(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Oa(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?ka(I(e)):P(e)?ka(F(e)):Ta(Aa(e)),Aa=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ja(e),ja=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${Aa(e.base)}>`;if(e.kind===`FilteredSet`&&!P(e))throw new w(`Attempted to compare the non-enumerable set ${L(e)} with another value`);if(ln(e))return P(e)?`{${F(e).elements.map(Aa).join(`,`)}}`:`<${e.kind} ${L(e)}>`;let t=I(e);return`(${t.domain.map((e,n)=>`${Aa(e)}:${Aa(t.range[n])}`).join(`,`)})`},Ma={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},Na=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>Ma[e])}"`,Pa=1999,Fa=e=>e.reduce((e,t)=>e===0?0:e*Ii(t),1),Ia=e=>{if(e.kind===`Subset`)return Ii(e.base)<=6?F(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return F(e);if(e.kind===`FunctionSet`){let t=Ni(e.domain)?0:Ii(e.domain);return(t===0?1:Ii(e.range)**t)<=Pa?F(e):void 0}return Fa(e.kind===`RecordSet`?e.sets:e.factors)<=Pa?F(e):void 0},La=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&dn(e.base)&&(e.base.kind===`Function`||P(e.base.domain)))return Ia(e);if(P(e))try{return Ia(e)}catch(e){if(e instanceof w)return;throw e}},Ra=(e,t)=>{let n=e=>L(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 mi(e,t)}},za=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Ba=e=>{if(P(e.domain))try{return I(e)}catch(e){if(e instanceof w||b(e))return;throw e}},Va=e=>{let t=[],n=[],r=(e,i)=>{if(typeof e!=`object`)return;let a=e=>r(e,i);switch(e.kind){case`Set`:if(e.elements.forEach(a),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(a),F(e);return;case`Function`:{let t=i||sr(e)===`lambda`;if(e.range.forEach(e=>r(e,t)),i||e.writtenKeys===void 0)return;n.push([e,e.writtenKeys]),e.writtenKeys=void 0;return}case`LazyFunction`:e.enumerated?r(e.enumerated,!0):a(e.domain);return;case`SetOperation`:a(e.left),a(e.right);return;case`FunctionSet`:a(e.domain),a(e.range);return;case`RecordSet`:e.sets.forEach(a);return;case`ProductSet`:e.factors.forEach(a);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:a(e.base);return;default:return}};try{return e.forEach(e=>r(e,!1)),e.map(e=>L(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1}),n.forEach(e=>{e[0].writtenKeys=e[1]})}},L=(e,t=!1,n=!1)=>{let r=e=>L(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Na(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(F(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=Fn.isExpanded?La(e,t):void 0;return n?r(n):Ra(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Fn.isExpanded||!e.source?Ba(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Pn&&sr(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&sr(e)!==`lambda`);if(i.domain.length===0&&sr(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):bn(i);return sr(e)===`record`||i.domain.every(e=>typeof e==`string`&&za(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},Ha=(e,t)=>{if(e===void 0)return!1;try{return hr(e,t)}catch(e){if(e instanceof w)return!1;throw e}},Ua=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Wa=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(Ua,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
|
|
74
|
+
`;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(gt(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},Ga=(e,t)=>{let n=t?void 0:Ln.get(e);if(n)return n();let r=Object.entries(e),i=zn.get(e),a=i!==void 0&&`_format`in e,o=a?e._format:r.length===1?`%s = %s
|
|
75
75
|
`:`/\\ %s = %s
|
|
76
|
-
`;if(typeof o!=`string`)throw new b(`The _format field of the ALIAS ${i} is ${R(o)}, but it must be a string.`);return r.filter(([e])=>!(a&&e===`_format`)).filter(([e,n])=>!t||!Va(t[e],n)).map(([e,t])=>{let n=Ua(o,[e,N(R(t))]);if(n===void 0)throw new b(`The _format field of the ALIAS ${i} is ${R(o)}, but it must format two strings, the name and the value of a field.`);return n}).join(``)},Ga=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let Ka=Ga[0];const qa=()=>Ka,Ja=/* @__PURE__ */ new Int32Array(256),Ya=/* @__PURE__ */ new Int32Array(256),Xa=/* @__PURE__ */ new Int32Array(256),Za=/* @__PURE__ */ new Int32Array(256),Qa=/* @__PURE__ */ new Int32Array(256),$a=/* @__PURE__ */ new Int32Array(256),eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256);let no=0,ro=0,io=0,ao=0;const oo=e=>{let t=(e^ao)&255;ao=(ao>>>8|io<<24)^Qa[t],io=io>>>8^Ja[t]},so=e=>{let t=Ga[e];Ka=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);Ja[e]=Number(BigInt.asIntN(32,t>>32n)),Qa[e]=Number(BigInt.asIntN(32,t))}let i=[Ja,Ya,Xa,Za],a=[Qa,$a,eo,to];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^Qa[o],i[e][r]=t[r]>>>8^Ja[o]}}no=Number(BigInt.asIntN(32,t>>32n)),ro=Number(BigInt.asIntN(32,t))};so(0);const co=e=>{let t=ao^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;ao=io^to[n]^eo[r]^$a[i]^Qa[a],io=Za[n]^Xa[r]^Ya[i]^Ja[a]},lo=e=>{if(typeof e==`boolean`)return oo(0),oo(e?116:102),2;if(typeof e==`number`)return oo(1),co(e),5;if(typeof e==`string`){oo(3),co(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)co(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)oo(e.charCodeAt(n));return 5+e.length}return oo(21),co(Vn(e.name)+1),5},uo=e=>{let t=io,n=ao;io=0,ao=0;let r=[lo(e),io,ao];return io=t,ao=n,r},fo=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,po=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,mo={integer:e=>`${fo(`1`)} ${po(e)}`,boolean:e=>`${fo(`0`)} ${fo(`(${e} ? 116 : 102)`)}`,set:e=>`${fo(`5`)} ${po(e)}`,function:e=>`${fo(`9`)} ${po(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${po(`0`)} } for (; r > 0; r--) { ${fo(`0`)} } h ^= ${t}; l ^= ${n}; }`},ho=()=>({H0:Ja,H1:Ya,H2:Xa,H3:Za,L0:Qa,L1:$a,L2:eo,L3:to,initialHigh:no,initialLow:ro}),go=(e,t)=>{let n=io,r=ao;ao=e[0],io=e[1],yo(t),e[0]=ao,e[1]=io,io=n,ao=r},_o=e=>{oo(5),co(e)},vo=e=>{oo(9),co(e)},yo=e=>{if(typeof e!=`object`||dn(e))lo(e);else if(un(e)){let t=L(e);vo(t.domain.length);for(let e=0;e<t.domain.length;e++)yo(t.domain[e]),yo(t.range[e])}else{let t=I(e).elements;_o(t.length);for(let e of t)yo(e)}},bo=e=>{let t=io,n=ao;io=no,ao=ro;for(let t of e)yo(t);let r=BigInt(io>>>0)<<32n|BigInt(ao>>>0);return io=t,ao=n,r},xo=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=io,a=ao;for(let n=0;n<e;n++)io=no,ao=ro,t(n),r[2*n]=ao,r[2*n+1]=io;return io=i,ao=a,n},So=(e,t)=>xo(e.length,n=>{for(let r of t)yo(e[n][r])}),Co=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),wo=1024,To=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*wo),relations:[]}),Eo=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},Do=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,Oo=(e,t,n,r,i)=>{let a=t===`next`?Do(e,t,r):void 0;if(a!==void 0)return a;let o=Eo(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},ko=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Ao=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?m(a):`Unknown location`}`:ko(r.body.location.range,a)||!a?`${r.name} ${m(i)}`:`${r.name} ${m(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},jo=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,Mo=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,No=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Po=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(gt(t.name)&2147483647)%e.length].unshift(t));t=e}t[(gt(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Fo=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Io=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Lo=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),Ro=(e,t,n)=>{let r=new Set(n.map(jo)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(M(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Co.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=Eo(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(jo(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?Lo(t.bounds):t.params.map(e=>e.name);m(t.body,Io(n,e.scope)),t.kind===`Function`&&Fo(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Io(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,Io(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Po(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,Mo(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,No(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,Mo(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Io(Lo(e.bounds),t)),r(Fo(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Io(Lo(e.bounds),t)),r(Fo(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Io(Lo([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Io(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Io(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},zo=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=zo(e,r,n);if(t!==-1)return t}}return-1},Bo=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=zo(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:zo(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Vo=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},Ho=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Uo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Wo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},Go=(e,t)=>t.forEach((t,n)=>{let r=bo([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*wo+i;e.registers[o]=Math.max(e.registers[o],Wo(a)+1)}),Ko=(e,t)=>{let n=e.registers.subarray(t*wo,(t+1)*wo),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*wo*wo/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*wo?a===0?i:wo*Math.log(wo/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},qo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},Jo=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>qo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},Yo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},Xo=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],Zo=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},Qo=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},$o=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||Xo(e,t))&&Yo(n,a),Zo(e,t).forEach(e=>i(e).forEach(e=>Yo(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?m(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=Zo(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>Yo(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=Xo(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,Jo(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return Zo(e,t).forEach(e=>{i(e),s(e,0)}),n},es=[`init`,`next`,`invariant`,`constraint`,`implied`],ts=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,ns=e=>es.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>ts(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||ts(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),rs=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?m(i):`Unknown location`}`,distinct:Ko(e,r)}}),relations:ns(e).map(t=>({kind:t.kind,label:t.label,...Qo(e,t),expressions:$o(e,t.node)}))}),is=(e,t,n)=>{let r=Do(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},as=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),os=(e,t)=>as.has(e)?new y(t):new x(t),ss=(e,t,n,r)=>new x(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${R(r)}`),cs=(e,t,n=e)=>{if(!P(e)||Un(e))throw new x(`Applying ${t} to the following value,\nwhich is not a finite set:\n${R(n)}`);return I(e)},ls=e=>typeof e==`object`&&e.kind===`Operator`,z=(e,t,n)=>{let r=e[t];if(r===void 0||ls(r))throw os(n,`${n} expects a value as argument ${t+1}`);return r},us=(e,t,n)=>{let r=z(e,t,n);if(typeof r!=`boolean`)throw os(n,`${n} expects a boolean but received ${R(r)}`);return r},ds=(e,t,n)=>{let r=e[t];if(r===void 0||!ls(r))throw os(n,`${n} expects an operator as argument ${t+1}`);return r},fs=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),B=(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}),ps=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ms=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),hs=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(z(n,0,e),z(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),gs=e=>e>2147483647||e<-2147483648,_s=e=>new x(`Overflow when computing ${e}`),vs={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`},ys={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},bs={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`},xs={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ss=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ys[e.operator];if(e.kind!==`Function`)return vs[e.kind];let t=or(e);return t===void 0?`FcnRcdValue`:xs[t]},Cs=e=>bs[Ss(e)],ws=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Ts=(e,t)=>{let n=n=>(...r)=>{let i=Hi.sets?.length??0;try{return n(...r)}catch(n){if(!(n instanceof y)||n instanceof ne)throw n;let r=Wi(i);throw Hi.sets&&(Hi.sets.length=i),e.isLazy!==!0&&n instanceof x&&!r?n:ws(t,n.message)}},r=n(e.evaluate);return{...e,evaluate:(n,i)=>{if(n.length!==e.arity)throw ws(t,`array is not of length ${e.arity}`);return r(n,i)},evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Es=(e,t)=>{if(typeof e!=`number`)throw ws(t,`Cannot cast tlc2.value.impl.${Ss(e)} to tlc2.value.impl.IntValue`);return e},Ds=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Os=(e,t,n,r)=>{let i=Ds(e,n,`IntValue`,2);return hs(t,(e,n)=>{let a=Es(n,i),o=Es(e,i),s=r(o,a);if(gs(s))throw _s(`${o}${t}${a}`);return s})},ks=(e,t,n)=>{if(typeof e!=`number`)throw new x(`The ${t} argument of ${n} should be an integer, but instead it is:\n${R(e)}`);return e},As=(e,t,n=e)=>hs(e,(e,r)=>t(ks(e,`first`,n),ks(r,`second`,n))),js=(e,t,n)=>({...ms(e,t,n),isLazy:!0}),Ms=(e,t,n)=>{let r=ds(e,t,n);return()=>r.call([])},Ns=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),Ps=()=>({implication:lg,negate:ug,equivalent:dg,body:fg,condition:(e,t)=>{if(typeof e!=`boolean`)throw Kh(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw qh(t,n,e);return e},apply:ca,expectFunction:ag,tuple:li,set:qr,record:di,writtenRecord:bn,equal:mr,enumerate:yg,choiceElements:G_,noChoice:e=>{throw K_(e)},filterPredicate:W_,isReducible:ln,finiteElements:e=>I(e).elements,addBounded:on,normalizedSet:nr,isBeyondBound:sn,cardinality:Fi,functionDomain:si,sortedFunction:rr,unassigned:(e,t)=>{throw eg(e,t)},prime:h_,keepLazyContext:og,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>rg(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Fs,Is;const Ls=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Rs=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),zs=e=>`local${e.counter++}`,Bs=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e);return n!==void 0&&t.add(n),mt(e).forEach(e=>Bs(e,t)),t},Vs=(e,t,n)=>{let r=Bs(t),i=[...n.locals].filter(([e])=>r.has(e));if(i.length===0)return n.context;let a=Rs(e,i.map(([e])=>e));return`extend(${n.context}, ${a}, [${i.map(([,e])=>e).join(`, `)}])`},Hs=(e,t,n)=>`${Rs(e,C_(t,e.environment))}(${Vs(e,t,n)})`,Us=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},Ws=(e,t,n,r)=>{let i=zs(e),a=zs(e),o=zs(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},Gs=(e,t,n)=>{let r=t.kind===`Forall`;return Us(e,n,n=>{let i=t.bounds.map(()=>zs(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${Qs(e,r.set,n)}, ${Rs(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=zs(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${Qs(e,t.body,n)}, ${Rs(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>Ws(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Ks=(e,t,n,r,i)=>Us(e,i,i=>{let a=zs(e),o=zs(e),s=Rs(e,t),c=`choiceElements(${Qs(e,n,i)}, ${s}, ${Rs(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${Qs(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${Ws(e,a,o,l)} return noChoice(${s});`}),qs=(e,t,n,r)=>Us(e,r,r=>{let i=zs(e),a=zs(e),o=zs(e),s=zs(e),c=Rs(e,t),l=`if (!isReducible(${i})) return ${Rs(e,U_(t,e.environment))}(${i}, ${Vs(e,t,r)});`,u=Qs(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${Qs(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${Ws(e,a,s,d)} return normalizedSet(${o});`}),Js=(e,t,n,r)=>Us(e,r,r=>{let i=zs(e),a=zs(e),o=zs(e),s=zs(e),c=zs(e),l=zs(e),u=Rs(e,B_(t,e.environment)),d=Vs(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=Qs(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${Qs(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${Ws(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),Ys=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=Qs(e,r[0],n),a=Qs(e,r[1],n),o=Rs(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${Qs(e,r[0],n)}, ${Rs(e,t)})`;if(t.operator===`<=>`)return`equivalent(${Qs(e,r[0],n)}, ${Qs(e,r[1],n)}, ${Rs(e,t)})`;if(M(t))return Hs(e,t,n);let i=Kg(t.operator,e.environment);if(i?.kind!==`Builtin`)return Hs(e,t,n);if(i.name===`DOMAIN`)return`${Rs(e,Xh(t))}(${Qs(e,r[0],n)})`;if(i.name===`TLCEval`)return Hs(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Rs(e,Zh(t,i))}(${Qs(e,r[0],n)}, ${Qs(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&E_(r[0],a))return`${Rs(e,i.evaluateUnary)}(${Qs(e,r[0],n)})`;let o=r.length===2&&E_(r[0],a)&&E_(r[1],a);return i.evaluateBinary&&o?`${Rs(e,i.evaluateBinary)}(${Qs(e,r[0],n)}, ${Qs(e,r[1],n)})`:Hs(e,t,n)},Xs=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(M(e))return!1;let r=r_(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Xs(e.expression,t,n);case`FieldAccess`:return Xs(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Xs(e,t,n));default:return!1}},Zs=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Zs(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Zs);default:return!1}},Qs=(e,t,n)=>{let r=(t,r=n)=>Qs(e,t,r);switch(t.kind){case`Number`:return mn(t.value)?String(t.value):Hs(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(M(t))return Hs(e,t,n);let i=r_(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Rs(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Rs(e,i.value):Hs(e,t,n)}case`Apply`:return Ys(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=Rs(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)}, ${Rs(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{F_(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Xs(t.function,n,e.environment)?r(t.function):Zs(t.function)?r(t.function,i):Hs(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Rs(e,t)}))`,o=Yh(e.environment.runtime.version),s=o?`, ${Rs(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${Rs(e,Jh(t))}(${r(t.record)})`;case`Record`:{let i=J_(t.fields);if(Y_(i))return Hs(e,t,n);let a=Rs(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}, ${Rs(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`:return n.isPrimed?Hs(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});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`)?Gs(e,t,n):Hs(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Ks(e,t,t.set,t.pattern.name,n):Hs(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!z_(t)?Js(e,t,r.pattern.name,n):Hs(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?qs(e,t,t.bound.pattern.name,n):Hs(e,t,n);default:return Hs(e,t,n)}},$s=(e,t)=>{if(!Ns.has(e.kind)||(Is??=Ls(),!Is))return;let n={environment:t,references:[],helpers:[],counter:0},r=Qs(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(`
|
|
77
|
-
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return Fs
|
|
78
|
-
from outside that declaration's scope.`,Vc=(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:m(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`&&Rc(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:Lc(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?Ic(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&Fc(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${Bc}`);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=zc(n.operand);if(l.isSufficesOpen){if(Oc(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=Rc(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Sc(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=Mc(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:Nc(e);if(!c)return;let f=Oc(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=Oc(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(Fc(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${Bc}`);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.`))},Hc=(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:m(e.location.range),message:n}),!0)},Uc=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=m(r),a=e.params.filter((r,i)=>{let a=uc(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:m(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)},Wc=(e,t,n,r)=>{if(!Pc(e))return!1;let i=Ac(e),a=i[0],o=i.length>1&&a.kind===`Name`?uc(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Vc(e,i,o,t,n,r),o!==void 0},Gc=(e,t,n,r)=>{let i=e.location;if(tl(e,n,r))return;let a=rc.get(e);if(a!==void 0)return a;if(ic(t))return e.kind===`Apply`?e.args.length:0;let o=uc(n,t);if(o?.isNonFact){r.errors.push({location:m(wc(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(Wc(e,n,r,!1)||Dc(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=ec),o)return o.arity;let s=xc(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,rc.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(uc(n,c)!==void 0||xc(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=m(e.kind===`Apply`&&l===`-.`?Cc(i,`-`):wc(e,t));if(!Ec(t)||Dc(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=Tc(e);d&&i.range&&r.errors.push({location:m(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},Kc=(e,t,n)=>(e.forEach(e=>V(e.set,t,n)),e.reduce((e,t)=>gc(e,vc(t.pattern),t.pattern.ranges,n),t)),qc=(e,t)=>e.kind===`Identifier`&&e.name===t&&M(e)||mt(e).some(e=>qc(e,t)),Jc=(e,t)=>{e.kind===`FunctionConstruction`&&qc(e.body,t)&&(e.isRecursive=!0),mt(e).forEach(e=>Jc(e,t))},Yc=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?yc(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:m(o),message:e})},c=e.kind===`Function`?Kc(e.bounds,t,i):_c(t,e.params,i),l=uc(c,a)??dc(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`?(V(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Jc(e.body,a),e.isSelfReferential=qc(e.body,a)):V(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:pc(a,uc(t,a)??dc(a,i,o),{kind:`Definition`,arity:sc(e),range:o},i)},Xc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(uc(e,t.name)?.isPending)return e;let n={name:t.name,arity:sc(t),params:cc(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)=>sl(t,e,n),e)};return s(e.reduce((e,t)=>{let a=ic(t.name)?e:s(e,e=>!oc(t.location,e.location)),o={name:t.name,arity:sc(t),kind:`Definition`,range:t.location.range,parent:a};if(lc(t))return{...o,params:cc(t)};let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||ic(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Yc(t,a,u,i)?{...o,params:cc(t)}:a},a),()=>!0)},Zc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:uc(t,r)??dc(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Qc=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=Zc(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:m(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},$c=(e,t,n)=>{if(Qc(e,t,n))return;let r=e.operator,i=Sc(r,t,n),a=Gc(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:m(e.argumentsRange??wc(e,r)),message:`The operator ${r} requires ${a-(Zc(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>el(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:m(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=Gc(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else V(i,t,n);return!0}if(i.kind===`Lambda`){V(i,t,n);let o=i.params.length===c;return!o&&tc.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)??wc(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return V(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=Sc(u,t,n)?.params??[],f=Gc(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(wc(i,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},el=(e,t,n)=>{e.kind===`Identifier`?Gc(e,e.name,t,n):V(e,t,n)},tl=(e,t,n)=>{let r=nc.get(e);return r?(r.args.forEach(e=>el(e,t,n)),n.errors.push(r.error),!0):!1},V=(e,t,n)=>{if(tc.has(e)&&!n.isGenerated){V(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>V(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(Qc(e,t,n))return;let r=e.name,i=Gc(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:m(wc(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Gc(e,e.operator,t,n);return;case`Apply`:$c(e,t,n);return;case`Lambda`:V(e.body,gc(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`:V(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&&V(e.other,t,n);return;case`Let`:V(e.body,Xc(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:V(e.body,Kc(e.bounds,t,n),i(yc(e.bounds)));return;case`UnboundedQuantifier`:V(e.body,gc(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&V(e.set,t,n),V(e.body,gc(t,vc(e.pattern),e.pattern.ranges,n),i(vc(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:V(e.predicate,Kc([e.bound],t,n),i(vc(e.bound.pattern)));return;case`SetMap`:V(e.expression,Kc(e.bounds,t,n),i(yc(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:m(r.location.range??Cc(r.location,r.name)),message:`Non-unique fields in constructor.`}),V(r.value,t,n)});return;case`Except`:V(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),V(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:V(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(Hc(e,n))return;V(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Uc(e,t,n);return;case`Subexpression`:if(tl(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>el(e,t,n)),Wc(e,t,n,!1)}},nl=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Qc(e,t,n)||Wc(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&uc(t,r)?.isNonFact?n.errors.push({location:m(wc(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||V(e,t,n)}),rl=(e,t,n)=>(e.set&&V(e.set,t,n),mc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),il=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:rl(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?il(t,e.scope,e.unit,!0):V(t,e.scope,e.unit),e),{scope:t,unit:n});return V(e.conclusion,i.scope,i.unit),i.scope},al=(e,t,n)=>e.kind===`AssumeProve`?il(e,t,n):(V(e,t,n),t),ol=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&nl(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>cl(t,e,r),t)},sl=(e,t,n)=>{let r=ml(e,t,n);return e.name===void 0?r:mc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},cl=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=al(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return ol(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return ol(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 nl(r.facts,t,n),o(t);case`Instance`:return o(sl(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?sl(t,e,i):Xc([t],e,n),t));case`Have`:case`Case`:return V(r.expression,t,i),ol(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>V(e,t,i)),a(t);case`Take`:return a(gc(Kc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=gc(Kc(r.bounds,t,i),r.names,r.nameRanges,i);return V(r.body,o,{...i,labelParams:[...i.labelParams,...yc(r.bounds),...r.names]}),ol(e.proof,a(t),n),a(o)}default:return ol(e.proof,a(t),n),a(t)}},ll=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:al(e.statement,void 0,t);e.name!==void 0&&hc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),ol(e.proof,n,t),r&&(r.isInProof=!1)},ul={line:0,column:0},dl=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),fl=(e,t)=>{let n=new Map([...ac,...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},pl=(e,t,n,i,a)=>{let o=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){V(n,o,a);return}let i=Gc(n,n.name,o,a);if(i!==void 0&&i!==t.arity)throw new r(`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}`)},c=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){a.errors.push({location:m(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let i=e.expression;s(r,i);let o=i.location.range;c.has(n)?o&&a.errors.push({location:m(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):c.set(n,i)});let l=t.filter(e=>!c.has(e.name)),u=e=>!uc(o,e.name)&&!xc(e.name,a);return l.filter(e=>!u(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};s(t,n),c.set(t.name,n)}),l.filter(u).forEach(t=>{let r=e.location.range,i=t.location.range;r&&i&&a.errors.push({location:m(r),message:`Substitution missing for symbol ${t.name} declared at ${m(i)} \nand instantiated in module ${n}.`})}),c},ml=(e,t,n)=>{let r=n.getInstance(e);return pl(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>mc(e,t,r,n),t)},hl=(e,t,n,r)=>{let i=fl(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),pl(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:ul}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},gl=(e,t)=>{let n=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>oc(e.location,t.location)?-1:+!!oc(t.location,e.location)).forEach(e=>{let a=[],o=[];try{e.check(a,o)}catch(e){if(!(e instanceof r)||!e.sany&&a.length===0)throw e;a.push(...e.sany?.errors??[])}a.forEach(e=>i(n,e)),o.forEach(e=>i(t,e))}),n},_l=(e,t)=>{let n=fl(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([...ac,...t.bound].map(([e,t])=>[e,{...t,position:ul}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c)=>({location:e,check:(l,u)=>c({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:l,warnings:u,hasLabelScope:s,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),l=(e,t)=>e.map(e=>c(e.location,void 0,!1,n=>hc(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return gl([...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=>c(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},r=pc(e.name,a.get(e.name),n,t);r&&(a.set(e.name,n),o.add(n)),s.push({declaration:e,binding:r?n:void 0})})),...e.definitions.map(t=>c(t.location,t,!0,n=>{dl(e,t)?V(t.body,void 0,n):Yc(t,void 0,n,o)&&a.set(t.name,{kind:`Definition`,arity:sc(t),range:t.location.range,position:t.location})})),...e.instances.map(e=>c(e.location,void 0,!1,n=>{_c(void 0,e.params,n),t.instanced.get(e)?.forEach((e,t)=>hc(t,e,n)),e.name!==void 0&&hc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)})),...e.assumptions.map(e=>c(e.location,void 0,e.name!==void 0,t=>{V(e.expression,void 0,t),e.name!==void 0&&hc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...e.theorems.map(e=>c(e.location,void 0,e.name!==void 0,t=>ll(e,t))),...e.uses.map(e=>c(e.location,void 0,!1,t=>nl(e.facts,void 0,t))),{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:m(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},vl=/* @__PURE__ */ new WeakSet,yl=/* @__PURE__ */ new WeakMap,bl=(e,t)=>{if(t.length===0)return e;let n={...e};return vl.has(e)&&vl.add(n),yl.set(n,[...t,...yl.get(e)??[]]),n},xl=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Dl(e,(e,r)=>xl(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&M(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&M(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Sl=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Cl=/* @__PURE__ */ new WeakMap,wl=e=>Cl.get(e)??e.name,Tl=(e,t)=>(wl(t)!==e.name&&Cl.set(e,wl(t)),e),El=(e,t)=>Tl(e.kind===`Function`?{...e,bounds:Sl(e.bounds,e=>t(e,[])),body:t(e.body,yc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Dl=(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=>El(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Sl(e.bounds,n),body:t(e.body,yc(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,vc(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,vc(e.bound.pattern))};case`SetMap`:return{...e,bounds:Sl(e.bounds,n),expression:t(e.expression,yc(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)}}},Ol=(e,t)=>{Dl(e,(e,n)=>(t(e,n),e))},kl=`LAMBDA`,Al=e=>`${e}@SUBSTITUTION`,jl=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(jl),Ml=(e,t)=>{if(e.kind!==`Identifier`)return!jl(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=M(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!jl(n.body)},Nl=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e),r=n===void 0||t.has(n)?[]:[n];return Ol(e,(e,n)=>r.push(...Nl(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},Pl=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}},Fl=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Il=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Ll=(e,t)=>e.map(e=>({pattern:Il(e.pattern,t),set:e.set})),Rl=(e,t)=>e.kind===`Function`?{...e,bounds:Ll(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},zl=(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=>Tl({...Rl(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Ll(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Il(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Il(e.bound.pattern,n),set:e.bound.set}};default:return e}},Bl=e=>`${e}@ENABLED`,Vl=(e,t)=>e.modes.get(t)??e,Hl=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!M(e)&&t.instantiation.variables.has(e.name),Ul=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Ul(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Hl(e,t,n))return[e.name];let r=M(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Ul(r.body,t,/* @__PURE__ */ new Map):void 0},Wl=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Hl(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Bl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Xl(e.expression,Vl(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Xl(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Xl(e.subscript,Vl(t,`Primed`),n),location:r},Xl(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Ul(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:Bl(r),location:e.location},location:e.location},Xl({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Gl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:ec}),Kl=(e,t)=>e.map(e=>Gl(e.name,t)),ql=(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:Kl(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),Jl=(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:[...Kl(t,r),...i.map(e=>Gl(e,r))],location:r},location:r}},Yl=(e,t)=>e.instantiation.isParameterized(t)?Ql(e,t):void 0,Xl=(e,t,n)=>{let i=e=>Xl(e,t,n),a=t.instantiation,o=a.params,s=t=>!n.has(t)&&!M(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Xl(e.expression,Vl(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:i(e.subscript),action:i(e.action),enabled:Xl(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Vl(t,`Enabled`),n)};let c=Wl(e,t,n);if(c)return c;if(e.kind===`Identifier`&&s(e.name)){let n=a.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!Ml(n,a)))return bl(n,[e]);if(n&&r){let t=Al(e.name);return r.set(t,n),Gl(t,e.location)}let i=Yl(t,e.name);if(i===void 0)return e;if(o.length===0)return{...e,name:i};let s=a.getDefinition(e.name);return s&&sc(s)>0?Jl(i,o,sc(s),e.location):{kind:`Apply`,operator:i,args:Kl(o,e.location),location:e.location}}if(e.kind===`Apply`&&s(e.operator)){let n=e.args.map(i),s=a.substitutions.get(e.operator),c=a.substitutions.size>0||o.length>0||vl.has(e),l=e=>(c&&vl.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let t=s.kind===`Identifier`?s.name:s.operator;return l({...e,operator:t,args:n,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...e,operator:s.operator,args:[...s.args,...n],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:kl,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...e,operator:kl,args:n,resolution:ec},location:e.location};if(s)throw new r(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Yl(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...Kl(o,e.location),...n]}}if(e.kind===`OperatorReference`&&s(e.operator)){let n=a.substitutions.get(e.operator);if(n?.kind===`Identifier`||n?.kind===`OperatorReference`||n?.kind===`Lambda`)return bl(n,[e]);let r=Yl(t,e.operator);if(r===void 0)return e;let i=a.getDefinition(e.operator);return o.length>0&&i?Jl(r,o,sc(i),e.location):{...e,operator:r}}let l=Pl(t),u=Dl(e,(e,r)=>r.length===0?i(e):Xl(e,t,Fl(n,r,l)));return zl(u,n,l)},Zl=(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:Gl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ql=(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=Pl(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=Rl(El(i,(e,t)=>Xl(e,s,Fl(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&yl.set(l,[u,...yl.get(i.body)??[]]),Zl({...c,body:l},r.params,i.location)}):t},$l=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Nl(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=>Yl(i,e)??e,getQualifiedKey:t=>{let n=Yl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Zl(r,e.params,r.location)):t}}},eu=e=>e.kind===`Let`&&e.instances!==void 0||mt(e).some(eu),tu=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Dl(e,e=>tu(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>oc(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}},nu=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ru=(e,t)=>e.definitions.some(e=>eu(e.body))||e.assumptions.some(e=>eu(e.expression))||e.theorems.some(e=>{let t=nu(e);return t!==void 0&&eu(t)})?{...e,definitions:e.definitions.map(e=>El(e,e=>tu(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:tu(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=nu(e);return n===void 0?e:{...e,statement:tu(n,t,[])}})}:e,iu=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]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].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}])),au={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]}},ou=(e,t)=>{let n=au[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},su=(e,t)=>`${e}${t}`,cu=(e,t,n)=>`${e}${t}${n}`,lu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},uu=(e,t,n)=>`${e},${t},${n}`,du=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),fu=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),pu=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),mu=(e,t)=>{t.constraints.forEach((t,n)=>fu(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>pu(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},hu=(e,t,n,r)=>({...du(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),gu=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,_u=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,vu=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,{...hu(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),yu=hu(`$Set`,0,[2],[1]),bu=hu(`$Junction`,0,[3],[1]),xu=hu(`$Choose`,0,[2],[1]),Su=hu(`$Function`,0,[3],[1]),Cu=hu(`$FcnApply`,0,[2,2],[1,1]),wu=hu(`$RcdSelect`,0,[2,0],[1,1]),Tu=hu(`'`,2,[1],[0]),Eu=hu(`ENABLED`,1,[2],[0]),Du=hu(`[]`,3,[3],[0]),Ou=hu(`$SquareAct`,2,[2,1],[0,0]),ku=hu(`$WF`,3,[1,2],[0,0]),Au=hu(`$TemporalExists`,3,[3],[0]),ju=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Mu=e=>e.map(e=>({name:e,arity:0})),Nu=(e,t)=>t.location.range?a(`${e}.`,t.location.range):new r(`${e} at line ${t.location.line}, column ${t.location.column}`),Pu=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Fu=e=>e.kind!==`Let`&&e.kind!==`Label`,Iu=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=vu.get(t)??iu.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},i=(e,t,n)=>{let r=du(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(cu(e,n,t))}),pu(r.argConstraints,su(e,n),t.data.level),mu(r,t.data)}),r},a=(e,t,n=[],i=[])=>{let a=e=>i.includes(e);if(t.forEach((t,n)=>{if(t.kind===`Value`&&t.data.level>gu(e,n))throw new r(`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 r(`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 o=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},s=(t,n,r)=>e.conditions.has(uu(t,n,r)),c=du(Math.max(e.level,...t.filter((t,n)=>_u(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),t.forEach((t,n)=>{_u(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),n.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>fu(c.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||fu(c.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>fu(c.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{a(t)||fu(c.constraints,t,gu(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>fu(c.constraints,e,gu(r,a)))}))}),e.argParams.forEach(e=>{let t=lu(e),n=o(t.operator);n?.kind===`Operator`&&fu(c.constraints,t.param,gu(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>pu(c.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>pu(c.argConstraints,su(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&pu(c.argConstraints,su(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=lu(e),n=o(t.operator);n&&pu(c.argConstraints,su(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{a(lu(e).param)||c.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=lu(e),n=o(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(cu(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(cu(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>c.argParams.add(cu(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:_(`LAMBDA`,Mu(e.params),e.body,t)};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{kind:`Operator`,data:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=du();return e.params.add(r),{kind:`Declared`,data:e,declared:{name:r,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:du()}}return{kind:`Value`,data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=ju(n,Mu(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Nu(`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 Nu(`Action used where only temporal formula or state predicate allowed`,e);Pu.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Fu(n)&&n.kind!==r)throw Nu(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=>mu(i,v(e,n))),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof r)||t.sany?t:Nu(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return du();case`Identifier`:return l(n(e.name,t),[]);case`Apply`:{let r=s(e.args,t);return d(e,r),l(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(bu,n)}case`Prime`:case`Unchanged`:return c(Tu,[e.expression],t);case`Enabled`:return c(Eu,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Du,[n])}case`If`:return c(bu,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(bu,[...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=c(bu,[e.body],t,e.bounds.map(e=>e.set),yc(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Nu(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Au:bu,[e.body],t,[],e.names);case`Choose`:return c(xu,[e.body],t,e.set?[e.set]:[],vc(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(yu,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(yu,[e.predicate],t,[e.bound.set],vc(e.bound.pattern));case`SetMap`:return c(yu,[e.expression],t,e.bounds.map(e=>e.set),yc(e.bounds));case`FunctionConstruction`:return c(Su,[e.body],t,e.bounds.map(e=>e.set),yc(e.bounds));case`Record`:return c(Su,e.fields.map(e=>e.value),t);case`RecordSet`:return c(yu,e.fields.map(e=>e.value),t);case`Except`:return c(yu,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Cu,[o(e.function,t),e.args.length===1?o(e.args[0],t):{kind:`Value`,data:c(yu,e.args,t)}]);case`Bracket`:return du();case`FieldAccess`:return a(wu,[o(e.record,t),{kind:`Value`,data:du()}]);case`BoxAction`:case`AngleAction`:return c(Ou,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(ku,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return du()}},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 mt(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,ju(t,Mu(e.names))),i;default:return Ol(e,(e,n)=>a(e,r,ju(t,Mu(n)))),i}},_=(e,t,n,r)=>{let i=ju(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...du(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(su(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(cu(e.name,n,t.name))).map(e=>uu(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(lu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=lu(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,{...du(),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:o}},Lu=(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`?Lu(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=du(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),mu(a,e)}),a},Ru=(e,t,n,r)=>{let i=Iu(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`?Lu(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=m(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:m(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=gl([...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`?Lu(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 te(n)}})),...n],r);if(l.length>0)throw te(l,!1,void 0,r)},zu=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Bu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Vu=/* @__PURE__ */ new Set([...zu,...Bu,`Enabled`]),Hu=/* @__PURE__ */ new Set([`~>`,`-+->`]),Uu=/* @__PURE__ */ new Set([...Hu,`\\cdot`]),Wu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Gu=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Ku=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),qu=(e,t)=>Wu.has(e)||t.builtins.get(e)?.isStateLevel===!0,Ju=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(zu.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Bu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Hu.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(Vu.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&Uu.has(e.operator))&&(r[0]|=1),Vu.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=ht(e);if(u!==void 0&&!M(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{qu(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),Gu.has(u)&&(r[0]|=8),Ku.has(u)&&(r[0]|=256),!a&&qu(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}mt(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},Yu=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Xu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),Zu=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=Ju(pt(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&270,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Yu(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Yu(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!Xu(t[e],l[e*r])))),p=Yu(a,r,f,270);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&270:e),words:r}},Qu=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?$u(pt(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},$u=(e,t)=>{let n=t.facts.words,r=Ju(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Qu(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Xu(e.callee,r[0])||(i[0]|=r[0]&270)}),i},ed=(e,t)=>!(Qu(e,t)[0]&1),td={any:2,repeated:4,streamed:8,replayed:260},nd=(e,t,n)=>($u(e,t)[0]&td[n])!==0,rd=(e,t,n=`any`)=>(Qu(e,t)[0]&td[n])!==0,id=(e,t)=>{let n=Qu(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},ad=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},od=(e,t)=>{let n=$u([e],t);return n[0]&16?void 0:ad(n)},sd=(e,t)=>!!($u([e],t)[0]&1),cd=(e,t,n)=>new x(`Applying ${e} to the following value,\nwhich is not ${t}:\n${R(n)}`),ld=e=>un(e)?L(e):void 0,ud=`a function with a finite domain`,dd=(e,t,n)=>{let r=z(e,t,n),i=ld(r);if(!i)throw cd(n,ud,r);return i},fd=(e,t)=>{let n=z(e,1,t),r=ld(n),i=r&&gd(r,z(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw ss(`second`,t,`bag`,n);return i},pd=(e,t,n)=>{let r=t[n];if(!r||!hd(r))throw ss(n===0?`first`:`second`,`(+)`,`bag`,z(e,n,`(+)`));return r},md=(e,t)=>{if(!P(e)||!F(e))throw t();return I(e).elements},hd=e=>e.range.every(e=>typeof e==`number`&&e>0),gd=(e,t)=>{let n=e.domain.findIndex(e=>Ur(t,e));return n===-1?void 0:e.range[n]},_d=e=>{if(typeof e==`number`)return e;let t=`tlc2.value.impl.${Ss(e)}`;throw new y(`class ${t} cannot be cast to class tlc2.value.impl.IntValue (${t} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},vd=(e,t)=>{let n=_d(e)+_d(t);if(gs(n))throw _s(`${e}+${t}`);return n},yd=(e,t,n)=>{let r=_d(e.range[t]),i=gd(n,e.domain[t]);if(i===void 0)return r;let a=r-_d(i);if(gs(a))throw _s(`${r}-${i}`);return a},bd=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>Ur(t,e[0]));i?i[1]=vd(i[1],n):e.push([t,n])},xd=e=>e.domain.map((t,n)=>[t,e.range[n]]),Sd=rr([],[]),Cd=e=>[fs(`EmptyBag`,Sd),B(`IsABag`,1,e=>{let t=ld(z(e,0,`IsABag`));return t!==void 0&&hd(t)}),B(`BagCardinality`,1,e=>{let t=z(e,0,`BagCardinality`);return dd(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw cd(`BagCardinality`,`a bag`,t);return vd(e,n)},0)}),B(`BagIn`,2,e=>{let t=fd(e,`BagIn`);return t!==void 0&&t>0}),B(`CopiesIn`,2,e=>fd(e,`CopiesIn`)??0),B(`\\oplus`,2,e=>{let t=[0,1].map(t=>ld(z(e,t,`(+)`))),n=pd(e,t,0),r=pd(e,t,1),i=xd(n);return r.domain.forEach((e,t)=>bd(i,e,r.range[t],n.domain.length)),Qr(i)}),B(`\\ominus`,2,e=>{let t=z(e,0,`(-)`),n=z(e,1,`(-)`),r=ld(t),i=ld(n);if(!r)throw ss(`first`,`(-)`,`bag`,t);if(!i)throw ss(`second`,`(-)`,`bag`,n);return Qr(r.domain.flatMap((e,t)=>{let n=yd(r,t,i);return n>0?[[e,n]]:[]}))}),B(`BagUnion`,1,e=>{let t=z(e,0,`BagUnion`),n=md(t,()=>cd(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??Sd;let r=e=>{let n=ld(e);if(!n)throw new x(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${R(t)}`);return n},i=xd(r(n[0]));return n.slice(1).forEach(e=>{let t=r(e);t.domain.forEach((e,n)=>bd(i,e,t.range[n]))}),Qr(i)}),B(`\\sqsubseteq`,2,e=>{let t=z(e,0,`\\sqsubseteq`),n=z(e,1,`\\sqsubseteq`),r=ld(t),i=ld(n);if(!r)throw cd(`\\sqsubseteq`,ud,t);if(!i)throw cd(`\\sqsubseteq`,ud,n);return r.domain.every((e,t)=>{let n=gd(i,e);return _d(r.range[t])<=(n===void 0?0:_d(n))})}),ps(`BagOfAll`,2,e=>{let t=ds(e,0,`BagOfAll`),n=z(e,1,`BagOfAll`),r=ld(n);if(!r)throw ss(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>bd(i,t.call([e]),r.range[n])),Qr(i)}),B(`SubBag`,1,t=>{let n=z(t,0,`SubBag`);if(!un(n))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${Cs(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=L(n),i=I(qr(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 ${R(r)}, which is not in its domain`);return Kr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>rr(e.map(e=>e[0]),e.map(e=>e[1]))))}),B(`BagToSet`,1,e=>ua(dd(e,0,`BagToSet`))),B(`SetToBag`,1,e=>{let t=z(e,0,`SetToBag`),n=md(t,()=>cd(`BagToSet`,ud,t));return rr([...n],n.map(()=>1))})],wd={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},H={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},Td={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Ed=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],Dd=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
79
|
-
`],[`r`,`\r`],[`f`,`\f`]]),Od=1024,kd=e=>{let t=+!!e.startsWith(``),n=t,r=0,i=t,a=!0,o=H.none,s=0,c=[wd.emptyDocument],l=[void 0],u=[0],d=()=>`$${c.map((e,t)=>e===wd.emptyArray||e===wd.nonemptyArray?`[${u[t]}]`:e===wd.emptyDocument||e===wd.nonemptyDocument?``:`.${l[t]??``}`).join(``)}`,f=()=>` at line ${r+1} column ${n-i+1} path ${d()}`,p=e=>new y(`com.google.gson.stream.MalformedJsonException: ${e}${f()}
|
|
80
|
-
See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),m=()=>new y(`java.io.EOFException: End of input${f()}`),h=()=>{if(!a)throw p(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},g=e=>`/\\;#=`.includes(e)?(h(),!1):!`{}[]:, \f\r
|
|
81
|
-
`.includes(e),_=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
82
|
-
`){r++,i=n;return}if(t===`\r`)return}},v=t=>{for(;n+t.length<=e.length;n++)if(e[n]===`
|
|
83
|
-
`)r++,i=n+1;else if(e.startsWith(t,n))return!0;return!1},b=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
84
|
-
`)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)_();else if(v(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),_();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},ee=()=>{let e=b();if(e===void 0)throw m();return e},x=()=>{let t=Ed.find(t=>e[n]===t.lower[0]||e[n]===t.upper[0]);if(!t)return H.none;let r=t.lower.length;for(let i=0;i<r;i++){let r=e[n+i];if(r!==t.lower[i]&&r!==t.upper[i])return H.none}return n+r<e.length&&g(e[n+r])?H.none:(n+=r,t.token)},S=()=>{let t=Td.none,r=!1,i=0;for(;n+i<e.length;i++){if(i===Od)return H.none;let a=e[n+i];if(a===`-`){if(t===Td.none)t=Td.sign;else if(t===Td.exponentE)t=Td.exponentSign;else return H.none}else if(a===`+`){if(t!==Td.exponentE)return H.none;t=Td.exponentSign}else if(a===`e`||a===`E`){if(t!==Td.digit&&t!==Td.fractionDigit)return H.none;t=Td.exponentE}else if(a===`.`){if(t!==Td.digit)return H.none;t=Td.decimal}else if(a<`0`||a>`9`){if(g(a))return H.none;break}else if(t===Td.sign||t===Td.none)r=a===`0`,t=Td.digit;else if(t===Td.digit){if(r)return H.none}else t===Td.decimal?t=Td.fractionDigit:(t===Td.exponentE||t===Td.exponentSign)&&(t=Td.exponentDigit)}return i===Od||t!==Td.digit&&t!==Td.fractionDigit&&t!==Td.exponentDigit?H.none:(s=i,H.number)},te=()=>{let t=c.length-1,r=c[t];if(r===wd.emptyArray)c[t]=wd.nonemptyArray;else if(r===wd.nonemptyArray){let e=ee();if(e===`]`)return H.endArray;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated array`)}else if(r===wd.emptyObject||r===wd.nonemptyObject){if(c[t]=wd.danglingName,r===wd.nonemptyObject){let e=ee();if(e===`}`)return H.endObject;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated object`)}let e=ee();if(e===`"`)return H.doubleQuotedName;if(e===`'`)return h(),H.singleQuotedName;if(e===`}`){if(r!==wd.nonemptyObject)return H.endObject;throw p(`Expected name`)}if(h(),n--,g(e))return H.unquotedName;throw p(`Expected name`)}else if(r===wd.danglingName){c[t]=wd.nonemptyObject;let r=ee();if(r===`=`)h(),e[n]===`>`&&n++;else if(r!==`:`)throw p(`Expected ':'`)}else if(r===wd.emptyDocument){if(b()===void 0)return H.eof;n--,e.startsWith(`)]}'
|
|
85
|
-
`,n)&&(n+=5),c[t]=wd.nonemptyDocument}else if(r===wd.nonemptyDocument){if(b()===void 0)return H.eof;h(),n--}let i=b();if(i===void 0){if(r===wd.emptyDocument)return H.eof;throw m()}if(i===`]`&&r===wd.emptyArray)return H.endArray;if(i===`]`||i===`;`||i===`,`){if(r!==wd.emptyArray&&r!==wd.nonemptyArray)throw p(`Unexpected value`);return h(),n--,H.null}if(i===`'`)return h(),H.singleQuoted;if(i===`"`)return H.doubleQuoted;if(i===`[`)return H.beginArray;if(i===`{`)return H.beginObject;n--;let a=x();if(a!==H.none)return a;let o=S();if(o!==H.none)return o;if(!g(e[n]))throw p(`Expected value`);return h(),H.unquoted},C=()=>(o===H.none&&(o=te()),o),w=()=>{if(n===e.length)throw p(`Unterminated escape sequence`);let t=e[n++];if(t===`u`){if(n+4>e.length)throw p(`Unterminated escape sequence`);let t=e.slice(n,n+4);if(!/^[\da-fA-F]{4}$/.test(t))throw p(`Malformed Unicode escape \\u${t}`);return n+=4,String.fromCharCode(Number.parseInt(t,16))}let a=Dd.get(t);if(a!==void 0)return a;if(t===`
|
|
86
|
-
`)return r++,i=n,t;if(`'"\\/`.includes(t))return t;throw p(`Invalid escape sequence`)},ne=t=>{let a=``,o=n;for(;n<e.length;){let s=e[n++];if(s===t)return a+e.slice(o,n-1);s===`\\`?(a+=e.slice(o,n-1)+w(),o=n):s===`
|
|
87
|
-
`&&(r++,i=n)}throw p(`Unterminated string`)},T=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},re=e=>{if(c.length-1>=255)throw new y(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=H.none},ie=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=H.none},ae=()=>{let e=C();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},oe=()=>{let e=C(),t=e===H.unquotedName?T():ne(e===H.singleQuotedName?`'`:`"`);return o=H.none,l[c.length-1]=t,t},se=t=>t===H.true||t===H.false?t===H.true:t===H.null?null:t===H.number?(n+=s,{literal:e.slice(n-s,n)}):t===H.unquoted?T():ne(t===H.singleQuoted?`'`:`"`),ce=()=>{let e=C();if(e===H.beginArray){re(wd.emptyArray);let e=[];for(;ae();)e.push(ce());return ie(),e}if(e===H.beginObject){re(wd.emptyObject);let e=/* @__PURE__ */ new Map;for(;ae();)e.set(oe(),ce());return ie(),e}let t=se(e);return o=H.none,u[c.length-1]++,t};if(C()===H.eof)return null;let le=ce();return a=!1,le!==null&&C(),le},Ad=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),jd=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Md=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Nd=e=>{if(!un(e))return;let t=L(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?ui(n):void 0},Pd=(e,t)=>{let n=`tlc2.value.impl.${Ss(e)}`,r=`tlc2.value.impl.${t}`;return new y(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Fd=e=>new y(`Cannot convert value: unsupported value type tlc2.value.impl.${Ss(e)}`),Id=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Ld=e=>`[${e.map(Vd).join(`,`)}]`,Rd=e=>`{${yn(e).map(e=>`${Id(typeof e[0]==`string`?e[0]:R(e[0]))}:${Vd(e[1])}`).join(`,`)}}`,zd=e=>{let t=L(e),n=Bi(t);return n?Ld(n):Rd(t)},Bd=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Vd=e=>typeof e==`string`?Id(e):typeof e==`object`?e.kind===`ModelValue`?Id(e.name):Ss(e)===`RecordValue`?Rd(L(e)):Hd(e):String(e),Hd=e=>{let t=Ss(e);if(t===`TupleValue`)return Ld(L(e).range);if(Bd(t))return zd(e);if(fi(e))return Ld(I(e).elements);throw Fd(e)},Ud=e=>e.map(e=>`${Vd(e)}\n`).join(``),Wd=e=>{let t=Ss(e);if(t===`RecordValue`)return Rd(L(e));if(t===`TupleValue`)return`{${L(e).range.map((e,t)=>`"${t}":${Vd(e)}`).join(`,`)}}`;if(Bd(t))return zd(e);throw Fd(e)},Gd=e=>{if(e===null)throw new y(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Bn(e);if(Array.isArray(e))return li(e.map(Gd));if(e instanceof Map)return ui([...e].map(e=>[Bn(e[0]),Gd(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||gs(t))throw new y(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},Kd=e=>{if(typeof e!=`string`)throw new y(`Cannot cast tlc2.value.impl.${Ss(e)} to tlc2.value.impl.StringValue`);return e},qd=(e,t)=>{let n=ca(e,t);if(typeof n!=`string`)throw Pd(n,`StringValue`);return n},Jd=e=>{if(!jd.has(e.toLowerCase()))throw Md.has(e.toLowerCase())?new t(`IOUtils!Serialize does not support the charset ${e}`):new y(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},Yd=(e,n,r,i)=>{let a=r.find(e=>!Ad.has(e));if(a!==void 0)throw new y(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new y(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new y(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new t(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=e.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new y(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new y(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?e.writeFile?.(n,i):e.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},Xd=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},Zd=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new y(`${t} (No such file or directory)`);return n},Qd=e=>[Ts(ms(`ToJson`,1,e=>Bn(Vd(z(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Ts(ms(`ToJsonArray`,1,e=>Bn(Hd(z(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Ts(ms(`ToJsonObject`,1,e=>Bn(Wd(z(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Ts(ms(`JsonSerialize`,2,t=>{let n=Kd(z(t,0,`JsonSerialize`)),r=z(t,1,`JsonSerialize`);if(!Bi(r)&&!Nd(r))throw ss(`second`,`JsonSerialize`,`sequence or record`,r);return Xd(e,n),e.writeFile?.(n,Vd(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Ts(ms(`ndJsonSerialize`,2,t=>{let n=Kd(z(t,0,`ndJsonSerialize`)),r=z(t,1,`ndJsonSerialize`),i=Bi(r);if(!i)throw ss(`second`,`ndJsonSerialize`,`sequence`,r);return Xd(e,n),e.writeFile?.(n,Ud(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Ts(ms(`JsonDeserialize`,1,t=>Gd(kd(Zd(e,Kd(z(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Ts(ms(`ndJsonDeserialize`,1,t=>li(Zd(e,Kd(z(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>Gd(kd(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],$d=(e,t)=>[Ts(js(`Serialize`,3,(n,r)=>{let i=Ms(n,2,`Serialize`)(),a=Nd(i);if(!a)throw ss(`third`,`ndJsonSerialize`,`sequence`,i);if(qd(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Ms(n,0,`Serialize`)(),s=Bi(o);if(!s)throw ss(`first`,`Serialize`,`sequence`,o);let c=Ms(n,1,`Serialize`)();if(typeof c!=`string`)throw ss(`second`,`ndJsonSerialize`,`sequence`,c);let l=ca(a,`openOptions`);if(Ss(l)!==`TupleValue`)throw Pd(l,`TupleValue`);let u=qd(a,`charset`),d=L(l).range.map(e=>{if(typeof e!=`string`)throw Pd(e,`StringValue`);return e});return Jd(u),Yd(e,c,d,Ud(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],ef={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},tf=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=er(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(ef.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(ef.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(ef.boolean),o(+!!e);return}if(typeof e==`number`){o(ef.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(ef.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(ef.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),P(e)){let t=I(e).elements;o(ef.set),c(t.length),t.forEach(f);return}let p=L(e),m=or(e);m===`tuple`?(o(ef.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(ef.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(ef.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ae(Uint8Array.from(t))},nf=e=>[Ts(ms(`_TLCTraceSerialize`,2,t=>{let n=Kd(z(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,tf(z(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],rf=25214903917n,af=(1n<<48n)-1n,of=e=>{let t=(BigInt.asUintN(64,e)^rf)&af,n=e=>(t=t*rf+11n&af,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^rf)&af},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<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},sf=[],cf=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},lf=()=>{for(let e=1277011;sf.length<1341;e++)cf(e)&&sf.push(e);return sf},uf=e=>{let t=lf(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},df=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},ff=e=>{for(let t=Math.max(e,9);;t++){let e=df(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)}}},pf=(e,t,n)=>{if(t<=0)return[];let r=ff(t),i=BigInt(n.nextInt(t)),a=BigInt(uf(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},mf=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:$t),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},hf=(1n<<63n)-1n-24n,gf=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(hf*BigInt(n)+i)%t;return r<0n?r+t:r})},_f=(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,vf=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=si(e.domain),n=I(e.range).elements;return{lists:t.map(()=>n),create:e=>rr(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>I(e).elements),create:t=>ui(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>I(e).elements),create:li}}},yf=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,bf=(e,t,n,r)=>{if(Mi(t))return[];let i=r===`1.7.4`?mf:pf;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=yf(t,r)?void 0:vf(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?gf(e,t,n):i(e,Number(t),n)).map(e=>a.create(_f(a.lists,e)))}let o=I(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},xf=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...cs(e.domain,`RandomElement`,e).elements];return rr(n,n.map(()=>xf(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return ui(e.names.map((n,r)=>[n,xf(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return li(e.factors.map(e=>xf(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(`Attempted to retrieve out-of-bounds element from the interval value ${R(e)}.`);return e.low+r}let n=cs(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new y(`Index ${r} out of bounds for length ${n.length}`);return n[r]},Sf=(e,t,n)=>{if(typeof e!=`number`||e<0)throw ss(t,n,`nonnegative integer`,e);return e},Cf=(e,t,n,r)=>Kr(Array.from({length:t},()=>Kr(e.filter(()=>r.nextDouble()<n)))),wf=(e,t)=>{let n=`RandomSetOfSubsets`,r=Sf(z(e,0,n),`first`,n),i=Sf(z(e,1,n),`second`,n),a=z(e,2,n);if(!P(a)||!F(a))throw ss(`third`,n,`finite set`,a);let o=I(a).elements;if(o.length<31&&r>2**o.length)throw ss(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw ss(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Cf(o,r,o.length===0?0:i/o.length,t.getRandom())},Tf=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Ef=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Df=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(Tf.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Ef.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},Of=e=>B(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=Sf(z(t,0,n),`first`,n),i=z(t,1,n);if(typeof i!=`string`)throw ss(`second`,n,`string literal representing a probability`,i);let a=Df(i);if(a===void 0||a<0||a>1)throw ss(`second`,n,`string literal does not represent a parsable probability`,i);let o=z(t,2,n);if(!P(o)||Un(o)||!Li(o))throw ss(`third`,n,`finite set`,o);let s=Fi(o);if(32-Math.clz32(r)>s&&r>1<<s)throw ss(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Cf(I(o).elements,r,a,e.getRandom())}),kf=e=>[Ts(B(`RandomSubset`,2,t=>{let n=Sf(z(t,0,`RandomSubset`),`first`,`RandomSubset`),r=z(t,1,`RandomSubset`);if(!fi(r)||!Li(r))throw ss(`second`,`RandomSubset`,`a finite set`,r);let i=yf(r,e.version);if(i&&i.reduce((e,t)=>e*I(t).elements.length,1)>rn())throw new y(an());return Kr(bf(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),B(`RandomSetOfSubsets`,3,t=>wf(t,e)),B(`TestRandomSetOfSubsets`,3,t=>li(Array.from({length:5},()=>I(wf(t,e)).elements.length)))],Af=(e,t=0n)=>{let n=of(t),r=of(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>ui([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:bo,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,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 o},jf=e=>Qr([...e.possibleCounts].map(([e,t])=>[e,t])),Mf=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,jf(e)]]),Nf=e=>ui([[`name`,e??`UnnamedAction`],[`location`,ui([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Pf=/* @__PURE__ */ new WeakSet,Ff=(e,t)=>{let n=ui([[`action`,Kr(e)],[`state`,Kr(t)]]);return Pf.add(n),n},If=(e,t,n)=>{let r=e.map((e,t)=>li([t+1,ui(Object.entries(e))])),i=r.slice(1).map((e,n)=>li([r[n],t[n],e])),a=n?[li([r[r.length-1],n.action,r[n.start]])]:[];return Ff([...i,...a],r)},Lf=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Mf(e).get(t)},Rf=(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||!e.pause)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),R(r));else throw new x(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${R(n)}`)},zf=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),Bf=e=>e.every(e=>e!==void 0),Vf=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!M(e);if(i&&t.variableIndex.has(r))return 1;let a=mt(e).map(e=>Vf(e,t,n)),o=i?pg(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Vf(o.body,t,n))),Math.max(0,...a)},Hf=(e,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[js(`AssertError`,2,e=>{let t=ds(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw new y(`In computing AssertError, a non-string expression (${zf(t)}) was used as the err of an AssertError(err, exp).`);let r=Ms(e,0,`AssertError`)();try{Ms(e,1,`AssertError`)()}catch(e){if(e instanceof y)return It(e.message,n.isTool)===r;throw e}return!1}),ms(`TLCGetOrDefault`,2,e=>Lf(n,z(e,0,`TLCGetOrDefault`))??z(e,1,`TLCGetOrDefault`)),ms(`Trace`,0,(e,t)=>{let r=t?.environment.variables??[],i=t?.state??r.map(()=>void 0);if(!t||!Bf(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new y(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return t.state?li(n.getBehavior(i).map(e=>{let r=t.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return ui(i===void 0?r:[[`_action`,i],...r])})):li([ui([])])}),ms(`CounterExample`,0,()=>n.counterExample??Ff([],[])),B(`ToTrace`,1,e=>{let t=z(e,0,`ToTrace`);if(typeof t!=`object`||!Pf.has(t))throw new x(`The argument of ToTrace should be a CounterExample, but instead it is:\n${R(t)}`);let n=I(ca(t,`state`)).elements.map(e=>Bi(e)??[]);return li(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),B(`TLCModelValue`,1,e=>{let t=z(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new x(`The argument of ModelValue should be a string, but instead it is:\n${R(t)}`);return $n(t)}),js(`TLCDefer`,1,(e,t)=>{let r=ds(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),B(`TLCNoOp`,1,e=>z(e,0,`TLCNoOp`)),{...js(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(!Bf(a)||i?.next&&n.isSeen(a))return!0;let o=ds(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new y(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Cs(s)}) was used as the condition of an IF.\n${o.expression?zf(o.expression):``}`);if(s||!i?.next||!i.state||!Bf(i.state))return!0;let c=i.state,l=n.getSuccessorAction(c,a),u=t=>e(Tt(n.isTool,St.moduleOverrideStdout,Ct.none,t));for(;;){u(`Extend behavior of length ${n.getLevel(c)} with a "${l?.name}" step [<Action ${l?.location.range&&m(l.location.range)}>]? (Yes/no/explored/states/diff):`);let e=n.readLine?.();if(e===void 0)throw new ne;if(/^[\0-\x20]*$/.test(e)||e.toLowerCase().startsWith(`y`))return!0;if(e[0]===`s`)u(`${Wa(n.toRecord(c)).trimEnd()}\n~>\n${Wa(n.toRecord(a)).trimEnd()}`);else if(e[0]===`d`)u(Wa(n.toRecord(a),n.toRecord(c)));else if(e[0]===`e`){if(n.getSimulationValue===void 0)throw new t(`tla-ts can't mark a state explored while it checks a model.`);u(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(e[0]===`n`)return!1}}),isActionLevel:!0},js(`TLCCache`,2,(e,t)=>{let i=ds(e,0,`TLCCache`),o=ka(Ms(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=Vf(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),B(`TLCFP`,1,e=>{let t=z(e,0,`TLCFP`),n=ba(t);if(n)throw n;return Number(BigInt.asIntN(32,bo([t])))}),js(`TLCEvalDefinition`,1,(e,t)=>{let n=Ms(e,0,`TLCEvalDefinition`)();if(typeof n!=`string`)throw new x(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${R(n)}`);let r=t?pg(n,t.environment):void 0,i=r?void 0:t?.environment.builtins.get(n);if(i?.arity===0)return i.evaluate([],t);if(!r||!t)throw new x(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${R(n)}`);if(r.kind===`Operator`&&r.params.length>0){let e=r.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new x(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${n}(${e.join(`, `)})`)}return r.kind===`Operator`?W(r.body,t):W({kind:`Identifier`,name:n,location:r.location},t)})]},Uf=(e,t)=>[ms(`_Track`,2,e=>{let n=String(z(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,z(e,0,`_Track`)===!0?r+1:r),!0}),ms(`_Counts`,0,()=>jf(t)),ms(`_CheckName`,1,n=>{let r=String(z(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(R(jf(t),!0)),!1)}),ms(`_PrintCounts`,0,()=>(e(R(jf(t),!0)),!0))],Wf=e=>`${e.getUTCFullYear()}.${Lt(e.getUTCMonth()+1)}.${Lt(e.getUTCDate())}.${Lt(e.getUTCHours())}${Lt(e.getUTCMinutes())}${Lt(e.getUTCSeconds())}`,Gf=e=>Qr([...e].map(([e,t])=>[e,li([t])])),Kf=e=>ar($r(e),`record`),qf=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Jf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Yf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Xf=(e,t,n)=>{if(e.version===`1.7.4`?!Jf.has(t)||!e.isStarted&&Yf.has(t):!e.isStarted&&qf.has(t))throw new x(`TLCGet(${t}) was undefined.`);let r=e.getSimulationValue?.(t,n);if(r!==void 0)return r;let i=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 i;case`stats`:return Kf([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return Kf([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,qa()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Kf([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Bn(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Bn(Wf(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Nf(void 0);case`all`:return Gf(e.registers);case`all:named`:return Gf(Mf(e))}if(t.startsWith(`s:`)){let n=Mf(e).get(t);if(n===void 0)throw new x(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Bn(e.properties.get(t.slice(2))??t);throw new x(`TLCGet(${t}) was undefined.`)},Zf=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new x(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new x(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${R(t)}`);return Xf(e,t,n?.state)},Qf=e=>e.length===0?[[]]:e.flatMap((t,n)=>Qf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),$f=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&I(e).elements.forEach($f),e.kind===`Function`&&e.range.forEach($f))},ep=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return L(e);default:return I(e)}},tp=(e,t)=>[B(`Print`,2,t=>(e(Ba([z(t,0,`Print`),z(t,1,`Print`)]).map(N).join(` `)),z(t,1,`Print`))),B(`PrintT`,1,t=>(e(N(Ba([z(t,0,`PrintT`)])[0])),!0)),B(`Assert`,2,e=>{if(z(e,0,`Assert`)!==!0)throw new x(`The first argument of Assert evaluated to FALSE; the second argument was:\n${N(R(z(e,1,`Assert`)))}`,S.assertViolation);return!0}),B(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),B(`:>`,2,e=>Qr([[z(e,0,`:>`),z(e,1,`:>`)]])),B(`@@`,2,e=>{let t=z(e,0,`@@`),n=z(e,1,`@@`),r=un(t)?L(t):void 0,i=un(n)?L(n):void 0;if(!r)throw ss(`first`,`@@`,`function`,t);if(!i)throw ss(`second`,`@@`,`function`,n);let a=vn(r),o=vn(i).filter(e=>!a.some(t=>Ur(e[0],t[0])));return $r([...a,...o])}),B(`ToString`,1,e=>Bn(R(z(e,0,`ToString`),!0))),{...js(`TLCEval`,1,(e,t)=>{let n=ep(Ms(e,0,`TLCEval`)());return t===void 0&&$f(n),n}),isStateLevel:!1},B(`Permutations`,1,e=>{let t=cs(z(e,0,`Permutations`),`Permutations`).elements;return Kr(Qf(t).map(e=>Qr(t.map((t,n)=>[t,e[n]]))))}),ps(`SortSeq`,2,e=>{let t=z(e,0,`SortSeq`),n=Bi(t);if(!n)throw ss(`first`,`SortSeq`,`natural number`,t);let r=ds(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw ss(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),li(a)}),t.version===`1.7.4`?Ts({...ms(`TLCGet`,1,(e,n)=>Zf(t,z(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Ts(js(`TLCGet`,1,(e,n)=>Zf(t,Ms(e,0,`TLCGet`)(),n)),`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)`),ms(`TLCSet`,2,n=>(Rf(t,e,z(n,0,`TLCSet`),z(n,1,`TLCSet`)),!0)),fs(`Any`,qn),B(`RandomElement`,1,e=>xf(z(e,0,`RandomElement`),t.getRandom()))],np=/* @__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(`,`),rp=[[`\\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`,`≀`],[`^+`,`⁺`]],ip=/* @__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(`,`),ap=/* @__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.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),op=/* @__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(`.`),sp=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
76
|
+
`;if(typeof o!=`string`)throw new _(`The _format field of the ALIAS ${i} is ${L(o)}, but it must be a string.`);return r.filter(e=>!(a&&e[0]===`_format`)).filter(e=>!t||!Ha(t[e[0]],e[1])).map(e=>{let t=Wa(o,[e[0],N(L(e[1]))]);if(t===void 0)throw new _(`The _format field of the ALIAS ${i} is ${L(o)}, but it must format two strings, the name and the value of a field.`);return t}).join(``)},Ka=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let qa=Ka[0];const Ja=()=>qa,Ya=/* @__PURE__ */ new Int32Array(256),Xa=/* @__PURE__ */ new Int32Array(256),Za=/* @__PURE__ */ new Int32Array(256),Qa=/* @__PURE__ */ new Int32Array(256),$a=/* @__PURE__ */ new Int32Array(256),eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256),no=/* @__PURE__ */ new Int32Array(256);let ro=0,io=0,ao=0,oo=0;const so=e=>{let t=(e^oo)&255;oo=(oo>>>8|ao<<24)^$a[t],ao=ao>>>8^Ya[t]},co=e=>{let t=Ka[e];qa=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);Ya[e]=Number(BigInt.asIntN(32,t>>32n)),$a[e]=Number(BigInt.asIntN(32,t))}let i=[Ya,Xa,Za,Qa],a=[$a,eo,to,no];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^$a[o],i[e][r]=t[r]>>>8^Ya[o]}}ro=Number(BigInt.asIntN(32,t>>32n)),io=Number(BigInt.asIntN(32,t))};co(0);const lo=e=>{let t=oo^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;oo=ao^no[n]^to[r]^eo[i]^$a[a],ao=Qa[n]^Za[r]^Xa[i]^Ya[a]},uo=e=>{if(typeof e==`boolean`)return so(0),so(e?116:102),2;if(typeof e==`number`)return so(1),lo(e),5;if(typeof e==`string`){so(3),lo(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)lo(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)so(e.charCodeAt(n));return 5+e.length}return so(21),lo(Hn(e.name)+1),5},fo=e=>{let t=ao,n=oo;ao=0,oo=0;let r=[uo(e),ao,oo];return ao=t,oo=n,r},po=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,mo=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,ho={integer:e=>`${po(`1`)} ${mo(e)}`,boolean:e=>`${po(`0`)} ${po(`(${e} ? 116 : 102)`)}`,set:e=>`${po(`5`)} ${mo(e)}`,function:e=>`${po(`9`)} ${mo(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${mo(`0`)} } for (; r > 0; r--) { ${po(`0`)} } h ^= ${t}; l ^= ${n}; }`},go=()=>({H0:Ya,H1:Xa,H2:Za,H3:Qa,L0:$a,L1:eo,L2:to,L3:no,initialHigh:ro,initialLow:io}),_o=(e,t)=>{let n=ao,r=oo;oo=e[0],ao=e[1],bo(t),e[0]=oo,e[1]=ao,ao=n,oo=r},vo=e=>{so(5),lo(e)},yo=e=>{so(9),lo(e)},bo=e=>{if(typeof e!=`object`||fn(e))uo(e);else if(dn(e)){let t=I(e);yo(t.domain.length);for(let e=0;e<t.domain.length;e++)bo(t.domain[e]),bo(t.range[e])}else{let t=F(e).elements;vo(t.length);for(let e of t)bo(e)}},xo=e=>{let t=ao,n=oo;ao=ro,oo=io;for(let t of e)bo(t);let r=BigInt(ao>>>0)<<32n|BigInt(oo>>>0);return ao=t,oo=n,r},So=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=ao,a=oo;for(let n=0;n<e;n++)ao=ro,oo=io,t(n),r[2*n]=oo,r[2*n+1]=ao;return ao=i,oo=a,n},Co=(e,t)=>So(e.length,n=>{for(let r of t)bo(e[n][r])}),wo=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),To=1024,Eo=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*To),relations:[]}),Do=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},Oo=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,ko=(e,t,n,r,i)=>{let a=t===`next`?Oo(e,t,r):void 0;if(a!==void 0)return a;let o=Do(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},Ao=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,jo=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?g(a):`Unknown location`}`:Ao(r.body.location.range,a)||!a?`${r.name} ${g(i)}`:`${r.name} ${g(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},Mo=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,No=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Po=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Fo=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(gt(t.name)&2147483647)%e.length].unshift(t));t=e}t[(gt(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Io=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Lo=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Ro=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),zo=(e,t,n)=>{let r=new Set(n.map(Mo)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(M(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!wo.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=Do(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(Mo(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?Ro(t.bounds):t.params.map(e=>e.name);m(t.body,Lo(n,e.scope)),t.kind===`Function`&&Io(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Lo(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,Lo(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Fo(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,No(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,Po(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,No(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Lo(Ro(e.bounds),t)),r(Io(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Lo(Ro(e.bounds),t)),r(Io(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Lo(Ro([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Lo(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Lo(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},Bo=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=Bo(e,r,n);if(t!==-1)return t}}return-1},Vo=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=Bo(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:Bo(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Ho=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},Uo=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Wo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Go=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},Ko=(e,t)=>t.forEach((t,n)=>{let r=xo([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*To+i;e.registers[o]=Math.max(e.registers[o],Go(a)+1)}),qo=(e,t)=>{let n=e.registers.subarray(t*To,(t+1)*To),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*To*To/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*To?a===0?i:To*Math.log(To/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},Jo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},Yo=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>Jo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},Xo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},Zo=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],Qo=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},$o=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},es=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||Zo(e,t))&&Xo(n,a),Qo(e,t).forEach(e=>i(e).forEach(e=>Xo(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?g(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=Qo(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>Xo(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=Zo(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,Yo(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return Qo(e,t).forEach(e=>{i(e),s(e,0)}),n},ts=[`init`,`next`,`invariant`,`constraint`,`implied`],ns=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,rs=e=>ts.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>ns(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||ns(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),is=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?g(i):`Unknown location`}`,distinct:qo(e,r)}}),relations:rs(e).map(t=>({kind:t.kind,label:t.label,...$o(e,t),expressions:es(e,t.node)}))}),as=(e,t,n)=>{let r=Oo(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},os=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),ss=(e,n)=>os.has(e)?new w(n):new t(n),cs=(e,n,r,i)=>new t(`The ${e} argument of ${n} should be a ${r}, but instead it is:\n${L(i)}`),ls=(e,n,r=e)=>{if(!ln(e)||Wn(e))throw new t(`Applying ${n} to the following value,\nwhich is not a finite set:\n${L(r)}`);return F(e)},us=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||us(r))throw ss(n,`${n} expects a value as argument ${t+1}`);return r},ds=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw ss(n,`${n} expects a boolean but received ${L(r)}`);return r},fs=(e,t,n)=>{let r=e[t];if(r===void 0||!us(r))throw ss(n,`${n} expects an operator as argument ${t+1}`);return r},ps=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),z=(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}),ms=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),hs=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),gs=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),_s=e=>e>2147483647||e<-2147483648,vs=e=>new t(`Overflow when computing ${e}`),ys={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`},bs={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},xs={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`},Ss={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Cs=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return bs[e.operator];if(e.kind!==`Function`)return ys[e.kind];let t=sr(e);return t===void 0?`FcnRcdValue`:Ss[t]},ws=e=>xs[Cs(e)],Ts=(e,t)=>new w(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Es=(e,n)=>{let r=r=>(...i)=>{let a=Ui.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof w)||r instanceof T)throw r;let i=Gi(a);throw Ui.sets&&(Ui.sets.length=a),e.isLazy!==!0&&r instanceof t&&!i?r:Ts(n,r.message)}},i=r(e.evaluate);return{...e,evaluate:(t,r)=>{if(t.length!==e.arity)throw Ts(n,`array is not of length ${e.arity}`);return i(t,r)},evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},Ds=(e,t)=>{if(typeof e!=`number`)throw Ts(t,`Cannot cast tlc2.value.impl.${Cs(e)} to tlc2.value.impl.IntValue`);return e},Os=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,ks=(e,t,n,r)=>{let i=Os(e,n,`IntValue`,2);return gs(t,(e,n)=>{let a=Ds(n,i),o=Ds(e,i),s=r(o,a);if(_s(s))throw vs(`${o}${t}${a}`);return s})},As=(e,n,r)=>{if(typeof e!=`number`)throw new t(`The ${n} argument of ${r} should be an integer, but instead it is:\n${L(e)}`);return e},js=(e,t,n=e)=>gs(e,(e,r)=>t(As(e,`first`,n),As(r,`second`,n))),Ms=(e,t,n)=>({...hs(e,t,n),isLazy:!0}),Ns=(e,t,n)=>{let r=fs(e,t,n);return()=>r.call([])},Ps=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),Fs=()=>({implication:Yg,negate:Xg,equivalent:Zg,body:Qg,condition:(e,t)=>{if(typeof e!=`boolean`)throw Mg(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Ng(t,n,e);return e},apply:la,expectFunction:Gg,tuple:ui,set:Jr,record:fi,writtenRecord:xn,equal:hr,enumerate:a_,choiceElements:Mv,noChoice:e=>{throw Nv(e)},filterPredicate:jv,isReducible:un,finiteElements:e=>F(e).elements,addBounded:on,normalizedSet:rr,isBeyondBound:sn,cardinality:Ii,functionDomain:ci,sortedFunction:ir,unassigned:(e,t)=>{throw Bg(e,t)},prime:tv,keepLazyContext:Kg,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Ug(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Is,Ls;const Rs=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},zs=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Bs=e=>`local${e.counter++}`,Vs=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e);return n!==void 0&&t.add(n),mt(e).forEach(e=>Vs(e,t)),t},Hs=(e,t,n)=>{let r=Vs(t),i=[...n.locals].filter(e=>r.has(e[0]));if(i.length===0)return n.context;let a=zs(e,i.map(e=>e[0]));return`extend(${n.context}, ${a}, [${i.map(e=>e[1]).join(`, `)}])`},Us=(e,t,n)=>`${zs(e,uv(t,e.environment))}(${Hs(e,t,n)})`,Ws=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},Gs=(e,t,n,r)=>{let i=Bs(e),a=Bs(e),o=Bs(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},Ks=(e,t,n)=>{let r=t.kind===`Forall`;return Ws(e,n,n=>{let i=t.bounds.map(()=>Bs(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${$s(e,r.set,n)}, ${zs(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=Bs(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${$s(e,t.body,n)}, ${zs(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>Gs(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},qs=(e,t,n,r,i)=>Ws(e,i,i=>{let a=Bs(e),o=Bs(e),s=zs(e,t),c=`choiceElements(${$s(e,n,i)}, ${s}, ${zs(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${$s(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${Gs(e,a,o,l)} return noChoice(${s});`}),Js=(e,t,n,r)=>Ws(e,r,r=>{let i=Bs(e),a=Bs(e),o=Bs(e),s=Bs(e),c=zs(e,t),l=`if (!isReducible(${i})) return ${zs(e,Av(t,e.environment))}(${i}, ${Hs(e,t,r)});`,u=$s(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${$s(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${Gs(e,a,s,d)} return normalizedSet(${o});`}),Ys=(e,t,n,r)=>Ws(e,r,r=>{let i=Bs(e),a=Bs(e),o=Bs(e),s=Bs(e),c=Bs(e),l=Bs(e),u=zs(e,Dv(t,e.environment)),d=Hs(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=$s(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${$s(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${Gs(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),Xs=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=$s(e,r[0],n),a=$s(e,r[1],n),o=zs(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${$s(e,r[0],n)}, ${zs(e,t)})`;if(t.operator===`<=>`)return`equivalent(${$s(e,r[0],n)}, ${$s(e,r[1],n)}, ${zs(e,t)})`;if(M(t))return Us(e,t,n);let i=M_(t.operator,e.environment);if(i?.kind!==`Builtin`)return Us(e,t,n);if(i.name===`DOMAIN`)return`${zs(e,Ig(t))}(${$s(e,r[0],n)})`;if(i.name===`TLCEval`)return Us(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${zs(e,Lg(t,i))}(${$s(e,r[0],n)}, ${$s(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&pv(r[0],a))return`${zs(e,i.evaluateUnary)}(${$s(e,r[0],n)})`;let o=r.length===2&&pv(r[0],a)&&pv(r[1],a);return i.evaluateBinary&&o?`${zs(e,i.evaluateBinary)}(${$s(e,r[0],n)}, ${$s(e,r[1],n)})`:Us(e,t,n)},Zs=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(M(e))return!1;let r=U_(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Zs(e.expression,t,n);case`FieldAccess`:return Zs(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Zs(e,t,n));default:return!1}},Qs=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Qs(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Qs);default:return!1}},$s=(e,t,n)=>{let r=(t,r=n)=>$s(e,t,r);switch(t.kind){case`Number`:return hn(t.value)?String(t.value):Us(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(M(t))return Us(e,t,n);let i=U_(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=zs(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?zs(e,i.value):Us(e,t,n)}case`Apply`:return Xs(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=zs(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)}, ${zs(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Sv(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Zs(t.function,n,e.environment)?r(t.function):Qs(t.function)?r(t.function,i):Us(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${zs(e,t)}))`,o=Fg(e.environment.runtime.version),s=o?`, ${zs(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${zs(e,Pg(t))}(${r(t.record)})`;case`Record`:{let i=Fv(t.fields);if(Iv(i))return Us(e,t,n);let a=zs(e,i.map(e=>e.name)),o=`[${t.fields.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}, ${zs(e,i.map(e=>t.fields.indexOf(e)))}, ${o}, ${zs(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`:return n.isPrimed?Us(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});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`)?Ks(e,t,n):Us(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?qs(e,t,t.set,t.pattern.name,n):Us(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!Ev(t)?Ys(e,t,r.pattern.name,n):Us(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Js(e,t,t.bound.pattern.name,n):Us(e,t,n);default:return Us(e,t,n)}},ec=(e,t)=>{if(!Ps.has(e.kind)||(Ls??=Rs(),!Ls))return;let n={environment:t,references:[],helpers:[],counter:0},r=$s(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(`
|
|
77
|
+
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return Is??=Fs(),Function(...Object.keys(Is),...i,a)(...Object.values(Is),...n.references)},tc=/* @__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(`,`),nc=[[`\\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`,`≀`],[`^+`,`⁺`]],rc=new Map(nc.flatMap(e=>e.slice(1).map(t=>[t,e[0]]))),ic=e=>e.split(`!`).map(e=>rc.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),ac=/* @__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(`,`),oc=/* @__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.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),sc=/* @__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(`.`),cc=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
88
78
|
Nat == { }
|
|
89
79
|
a+b == {a, b}
|
|
90
80
|
a-b == CHOOSE n : b + n = a
|
|
@@ -400,7 +390,18 @@ _CheckName(name) ==
|
|
|
400
390
|
=> (PrintT(counts) /\\ FALSE)
|
|
401
391
|
_PrintCounts == PrintT(_Counts)
|
|
402
392
|
=============================================================================
|
|
403
|
-
`]]),cp=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`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)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),lp=`----------------------------- MODULE Bags --------------------------------
|
|
393
|
+
`]]),lc=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`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)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),uc={kind:`Local`},dc=/* @__PURE__ */ new WeakSet,fc=/* @__PURE__ */ new WeakMap,pc=/* @__PURE__ */ new WeakMap,mc=/* @__PURE__ */ new WeakSet,hc=/* @__PURE__ */ new WeakMap,gc=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},_c=new Map([...[`~>`,`-+->`,`\\cdot`,`\\X`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}]),[`'`,{key:`'`,arity:1,kind:`Builtin`}]]),vc=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,yc=(e,t)=>vc(e,t)?-1:+!!vc(t,e),bc=e=>e.kind===`Operator`?e.params.length:0,xc=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Sc=e=>e.name.includes(`!`),Cc=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},wc=(e,t,n)=>{let r=t.bindings.get(e);return r&&vc(r.position,t.location)&&(!n||vc(r.position,n.start))?r:void 0},Tc=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),Ec=(e,t,n,r)=>{if(t===void 0)return!0;if(Tc(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 ${ic(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 '${ic(e)}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${ic(e)}. \nThis duplicates the one at ${o}.`}),!1},Dc=(e,t,n,r)=>Ec(t,Cc(e,t)??wc(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Oc=(e,t,n)=>{Ec(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},kc=(e,t,n,r)=>t.reduce((e,t,i)=>Dc(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Ac=(e,t,n)=>t.reduce((e,t)=>Dc(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),jc=e=>e.kind===`Name`?[e.name]:e.names,Mc=e=>e.flatMap(e=>jc(e.pattern)),Nc=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.isRecursive:n.isRecursive?wc(e,t,void 0)!==void 0:vc(n.location,t.location))?n:void 0},Pc=(e,t)=>{let n=Nc(e,t);if(n){let r=n.isRecursive?t.bindings.get(e):void 0;return{key:t.getKey(n),arity:r?.arity??bc(n),params:r?.params??xc(n),kind:`Definition`}}let r=wc(e,t,void 0);return r?.isPending?{key:e,arity:r.arity,kind:r.kind}:r?t.imported.get(e):void 0},Fc=(e,t)=>t.facts.has(e)||t.bindings.get(e)?.kind===`Theorem`,Ic=(e,t)=>t.bindings.get(e)?.kind===`Theorem`?t.goals.get(e):void 0,Lc=(e,t,n)=>Cc(t,e)??Pc(e,n),Rc=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),zc=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Rc(e.location,e.spelling??t)},Bc=e=>{if(!(e.kind!==`Apply`||e.argumentsRange)){if(e.args.length===2)return`infix`;if(e.args.length===1)return vc(e.location,e.args[0].location)?`prefix`:`postfix`}},Vc=`In module --TLA+ BUILTINS--`,Hc=/* @__PURE__ */ new Set([`Definition`,`Instance`,`Theorem`]),Uc=(e,t,n)=>n.errors.push({location:g(t),message:`Cannot take subexpression of \`${ic(e)}'.`}),Wc=e=>!/^[\p{L}\d_]/u.test(e),Gc=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Kc=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,qc=(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])}})},Jc=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?qc(e.name,[],void 0):qc(e.operator,e.args,e.argumentCounts),Yc=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Xc=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Mc(e.bounds),body:e.body,sets:Yc(e.bounds)};case`SetMap`:return{names:Mc(e.bounds),body:e.expression,sets:Yc(e.bounds)};case`SetFilter`:return{names:jc(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:jc(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}},Zc=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}},Qc=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,$c=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),el=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?el(e.body,t):mt(e).reduce((e,n)=>e??el(n,t),void 0)},tl=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??tl(i,t,n||$c(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&el(e.set,t):el(e,t)},nl=e=>e.kind===`Label`?nl(e.body):e,rl=e=>typeof e==`number`?`argument selector ${e}`:e,il=`within the scope of a declaration
|
|
394
|
+
from outside that declaration's scope.`,al=(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`&&nl(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:tl(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?el(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&$c(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${il}`);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===`Colon`)return;let d=n.kind===`Operand`?rl(n.operand):n.kind===`At`?`@`:`!(...)`,f=e=>n.kind===`Operand`?Kc(n.operand,e):-1;if(l.isSufficesOpen){if(f(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=nl(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Lc(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=Xc(e)?.sets;if(s&&n.kind!==`Operand`)return;let c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:Zc(e);if(!c)return;let p=f(c.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[p],l.isGoal=!1;continue}let p=[...u.assumptions,u.conclusion],m=f(p.length);if(m===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if($c(u,m)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${il}`);let h=p[m];if(h.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=h,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.`))},ol=(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)},sl=(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=Cc(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)},cl=(e,t,n,r)=>{if(!Qc(e))return!1;let i=Jc(e),a=i[0],o=i.length>1&&a.kind===`Name`?Cc(t,a.name)?.goal??Ic(a.name,n):void 0;return o&&al(e,i,o,t,n,r),o!==void 0},ll=(e,t,n,r)=>{let i=e.location;if(xl(e,n,r))return;let a=hc.get(e);if(a!==void 0)return a;if(gc(t))return e.kind===`Apply`?e.args.length:0;let o=Cc(n,t);if(o?.isNonFact){r.errors.push({location:g(zc(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(cl(e,n,r,!1)||Gc(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=uc),o)return o.arity;let s=Pc(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,hc.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``,l=c===``?void 0:Cc(n,c)??Pc(c,r);if(l&&!Hc.has(l.kind)){Uc(c,e.kind!==`OperatorReference`&&e.selectorRanges?.[0]||zc(e,t),r);return}if(l||c!==``&&Fc(c,r))return e.kind===`Apply`?e.args.length:0;let u=Bc(e),d=e.kind===`OperatorReference`||u!==void 0;if(!Wc(t)||Gc(t)||!d){r.errors.push({location:g(zc(e,t)),message:`Unknown operator: \`${ic(t)}'.`});return}let f=e.spelling??t;r.errors.push({location:g(u===`prefix`&&f===`-.`?Rc(i,`-`):zc(e,t)),message:`Could not find declaration or definition of symbol '${f}'.`}),u&&mc.add(e),u&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${u} operator symbol \`${f}'.`})},ul=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>kc(e,jc(t.pattern),t.pattern.ranges,n),t)),dl=(e,t)=>e.kind===`Identifier`&&e.name===t&&M(e)||mt(e).some(e=>dl(e,t)),fl=(e,t)=>{e.kind===`FunctionConstruction`&&dl(e.body,t)&&(e.isRecursive=!0),mt(e).forEach(e=>fl(e,t))},pl=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Mc(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`?ul(e.bounds,t,i):Ac(t,e.params,i),l=Cc(c,a)??wc(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${ic(a)} defined at wrong LET/IN level.`):l&&!u?s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${ic(a)} already defined or declared.`):l&&e.kind===`Function`&&l.arity>0?s(`Function ${ic(a)} has operator arguments in its RECURSIVE declaration.`):l&&e.kind===`Operator`&&(l.arity!==e.params.length||e.params.some(e=>e.arity>0))&&s(`Definition of ${ic(a)} has different arity than its RECURSIVE declaration.`),l&&u&&e.kind===`Operator`&&(l.params=xc(e)),e.kind===`Function`?(B(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),fl(e.body,a),e.isSelfReferential=dl(e.body,a)):B(e.body,c,i),l&&u?((e.kind===`Operator`||l.arity===0)&&(l.isPending=!1,l.range=o),!1):e.kind===`Function`?l===void 0:Ec(a,Cc(t,a)??wc(a,i,o),{kind:`Definition`,arity:bc(e),range:o},i)},ml=(e,t,n,r=[],i=[])=>{let a=/* @__PURE__ */ new Set,o=e.filter(e=>e.isRecursive&&i.every(t=>t.name!==e.name)).reduce((e,t)=>{if(Cc(e,t.name)?.isPending)return e;let n={name:t.name,arity:bc(t),params:xc(t),kind:`Definition`,parent:e,isPending:!0};return a.add(n),n},t),s=/* @__PURE__ */ new Map,c=(e,t)=>{let r={kind:`Definition`,arity:t.arity,params:Array(t.arity).fill(0),range:t.location.range},i=Ec(t.name,Cc(e,t.name)??wc(t.name,n,r.range),r,n)?{...r,name:t.name,parent:e,isPending:!0}:void 0;return i&&a.add(i),s.set(t,i),i??e},l=[...n.isGenerated?[]:r,...i].toSorted((e,t)=>yc(e.location,t.location)),u=(e,t)=>{let r=l.findIndex(e=>!t(e));return l.splice(0,r===-1?l.length:r).reduce((e,t)=>`kind`in t?jl(t,e,n):c(e,t),e)},d=u(e.reduce((e,t)=>{let i=gc(t.name)?e:u(e,e=>!vc(t.location,e.location)),o={name:t.name,arity:bc(t),kind:`Definition`,range:t.location.range,parent:i};if(Sc(t))return{...o,params:xc(t)};let s=r.some(e=>e.location===t.location),c=n.isGenerated||t.isLocal||gc(t.name),l=s?{...n,isGenerated:!0,errors:[],warnings:[]}:c?{...n,isGenerated:c}:n;return pl(t,i,l,a)?{...o,params:xc(t)}:i},o),()=>!0);return s.forEach((e,t)=>{let r=t.location.range;r&&!n.isGenerated&&(!e||e.isPending)&&n.errors.push({location:g(r),message:`Symbol ${ic(t.name)} declared in RECURSIVE statement but not defined.`})}),d},hl=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Cc(t,r)??wc(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},gl=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=hl(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},_l=(e,t,n,r,i)=>{let a=e?.kind===`Definition`?e.params:void 0;return!e||!a||a.length===e.arity?!1:(r&&i.errors.push({location:g(r),message:`Wrong number of arguments (${n}) given to operator '${ic(t)}', \nwhich requires ${a.length} arguments.`}),!0)},vl=(e,t,n,r,i,a,o)=>{let s=(e,t)=>{e&&o.errors.push({location:g(e),message:t})},c=e.location.range;if(t===0){if(e.kind===`Lambda`&&e.operator!==void 0)s(c,`The operator ${ic(e.operator)} requires 1 arguments.`);else if(e.kind===`Lambda`&&c)s(c,`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let t=ll(e,e.operator,a,o);t!==void 0&&s(c,`The operator ${ic(e.operator)} requires ${t} arguments.`)}else B(e,a,o);return!0}if(e.kind===`Lambda`){dc.has(e)?B(e,a,o):Sl(e,a,o);let l=e.params.length===t;return!l&&dc.has(e)?s(c,`Expected arity ${t} but found operator of arity ${e.params.length}.`):!l&&c&&e.operator===void 0&&s(i,`Lambda expression with arity ${e.params.length} used as argument ${n+1} of operator \`${r}', \nbut an operator of arity ${t} is required.`),l}if(e.kind===`Subexpression`)return B(e,a,o),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return s(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return s(c,`An expression appears as argument number ${n+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let l=e.kind===`Identifier`?e.name:e.operator,u=Lc(l,a,o)?.params??[],d=ll(e,l,a,o);return e.kind===`Identifier`&&d!==void 0&&d!==t&&s(zc(e,l),`Expected arity ${t} but found operator of arity ${d}.`),d===t&&u.every(e=>e===0)},yl=(e,t,n)=>{if(gl(e,t,n))return;let r=e.operator,i=Lc(r,t,n),a=ll(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:g(e.argumentsRange??zc(e,r)),message:`The operator ${ic(r)} requires ${a-(hl(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:e.args.map(()=>0));if(o===void 0){e.args.forEach(e=>bl(e,t,n));return}let s=e.selectorRanges?.at(-1)??zc(e,r),c=e.args.slice(0,o.length).map((e,i)=>vl(e,o[i],i,r,s,t,n));_l(i,r,e.args.length,e.location.range,n)||c.forEach((t,i)=>{!t&&e.location.range&&n.errors.push({location:g(e.location.range),message:`Argument number ${i+1} to operator '${r}' \nshould be a ${o[i]}-parameter operator.`})})},bl=(e,t,n)=>{e.kind===`Identifier`?ll(e,e.name,t,n):B(e,t,n)},xl=(e,t,n)=>{let r=fc.get(e);return r?(r.applications.forEach(e=>e.args.forEach((r,i)=>vl(r,e.params[i],i,e.operator,e.range,t,n))),n.errors.push(r.error),!0):!1},Sl=(e,t,n)=>B(e.body,kc(t,e.params,e.paramRanges,n),{...n,labelParams:[...n.labelParams,...e.params]}),B=(e,t,n)=>{if(dc.has(e)&&!n.isGenerated){let r=pc.get(e)?.find(e=>mc.has(e.node));r?n.errors.push(r.error):B(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>B(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:return;case`ExceptAt`:!n.isInExcept&&e.location.range&&n.errors.push({location:g(e.location.range),message:`@ used where its meaning is not defined.`});return;case`Identifier`:{if(gl(e,t,n))return;let r=e.name,i=ll(e,r,t,n);i===0?_l(Lc(r,t,n),r,0,zc(e,r),n):i!==void 0&&n.errors.push({location:g(zc(e,r)),message:`The operator ${ic(r)} requires ${i} arguments.`});return}case`OperatorReference`:ll(e,e.operator,t,n);return;case`Apply`:yl(e,t,n);return;case`Lambda`:dc.has(e)?Sl(e,t,n):e.location.range&&n.errors.push({location:g(e.location.range),message:`LAMBDA expression used where an expression is required.`});return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(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&&B(e.other,t,n);return;case`Let`:B(e.body,ml(e.definitions,t,n,e.instances,e.recursive),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(e.body,ul(e.bounds,t,n),i(Mc(e.bounds)));return;case`UnboundedQuantifier`:B(e.body,kc(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&B(e.set,t,n),B(e.body,kc(t,jc(e.pattern),e.pattern.ranges,n),i(jc(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:B(e.predicate,ul([e.bound],t,n),i(jc(e.bound.pattern)));return;case`SetMap`:B(e.expression,ul(e.bounds,t,n),i(Mc(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??Rc(r.location,r.name)),message:`Non-unique fields in constructor.`}),B(r.value,t,n)});return;case`Except`:B(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:B(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(ol(e,n))return;B(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),sl(e,t,n);return;case`Subexpression`:{if(xl(e,t,n)||(e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>bl(e,t,n)),cl(e,t,n,!1)))return;let r=e.selectors[0],i=e.selectorRanges?.[0],a=e.selectors.findIndex(e=>e.kind!==`Name`),o=e.selectors.slice(0,a).flatMap(e=>e.kind===`Name`?[e.name]:[]),s=o.findIndex((e,t)=>t>0&&Pc(o.slice(0,t+1).join(`!`),n)),c=o.length>1&&(Cc(t,o[0])??wc(o[0],n,void 0))?.kind===`Instance`,l=e.selectorRanges?.[a-1];if(c&&s===-1&&i&&l){n.errors.push({location:g({module:i.module,start:i.start,end:l.end}),message:`Unknown operator: \`${ic(o.join(`!`))}'.`});return}let u=o.slice(0,s+1).join(`!`),d=s>0?Pc(u,n):void 0,f=e.selectors.slice(0,s+1).flatMap(e=>`args`in e?e.args:[]).length,p=e.argumentRanges?.[s]??e.location.range;if(d&&d.arity!==f&&p){n.errors.push({location:g(p),message:`The operator ${ic(u)} requires ${d.arity} arguments.`});return}if(r.kind!==`Name`||e.selectors[1].kind===`Name`||!i)return;let m=Cc(t,r.name)??Pc(r.name,n);m===void 0&&!Fc(r.name,n)||m?.kind===`Instance`?n.errors.push({location:g(i),message:`Unknown operator: \`${ic(r.name)}'.`}):m&&!Hc.has(m.kind)&&Uc(r.name,i,n)}}},Cl=(e,t,n)=>e.forEach(e=>{if(e.kind===`ExceptAt`&&e.location.range){n.errors.push({location:g(e.location.range),message:"Unknown operator: `@'."});return}if(e.kind===`ModuleFact`||gl(e,t,n)||cl(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&Cc(t,r)?.isNonFact?n.errors.push({location:g(zc(e,r)),message:`Step number of non-fact used as a fact`}):Fc(r,n)||B(e,t,n)}),wl=(e,t,n)=>{let r=e.location.range,i=e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:``;if(i===``||!r)return!0;let a=Cc(t,i)??Pc(i,n)??wc(i,n,r);return a===void 0&&(Fc(i,n)||Gc(i))||(a===void 0&&n.errors.push({location:g(r),message:`Unknown operator: \`${ic(i)}'.`}),a&&Hc.has(a.kind)&&!Gc(i))?!0:(n.errors.push({location:g(r),message:`DEF clause entry should describe a defined operator.`}),!1)},Tl=(e,t,n)=>{let r=e.location.range&&g(e.location.range);if(!(e.kind===`ModuleFact`||dc.has(e))){if(fc.has(e)||e.kind===`ExceptAt`)return Vc;switch(e.kind){case`Number`:case`String`:case`Decimal`:case`Let`:case`Label`:return;case`Identifier`:case`Apply`:case`Subexpression`:{let i=Jc(e)[0];if(e.kind===`Subexpression`||i.kind!==`Name`)return;let a=e.kind===`Identifier`?e.name:e.operator,o=Cc(t,i.name)?.goal??Ic(i.name,n);if(Fc(a,n)||o||Gc(a)&&Cc(t,a))return;let s=Lc(a,t,n),c=e.kind===`Apply`?e.args.length:0;return s?.arity===c?r:Vc}default:return r}}},El=(e,t,n)=>{let r=e.kind===`Hide`?e.facts.map(e=>Tl(e,t,n)):[];Cl(e.facts,t,n);let i=e.defs.filter(e=>wl(e,t,n)).length;r.forEach(e=>{e&&n.errors.push({location:e,message:`The only expression allowed as a fact in a HIDE is
|
|
395
|
+
the name of a theorem, assumption, or step.`})});let a=e.location.range;e.facts.length+i===0&&a&&n.errors.push({location:g(a),message:e.kind===`By`?`Empty BY`:`Empty USE or HIDE statement.`})},Dl=(e,t,n)=>(e.set&&B(e.set,t,n),Dc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Ol=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Dl(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Ol(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},kl=(e,t,n)=>e.kind===`AssumeProve`?Ol(e,t,n):(B(e,t,n),t),Al=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&El(e,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Ml(t,e,r),t)},jl=(e,t,n)=>{let r=Rl(e,t,n);return e.name===void 0?r:Dc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Ml=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=kl(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Al(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Al(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 El(r,t,n),o(t);case`Instance`:return o(jl(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?jl(t,e,i):ml([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),Al(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),a(t);case`Take`:return a(kc(ul(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=kc(ul(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,o,{...i,labelParams:[...i.labelParams,...Mc(r.bounds),...r.names]}),Al(e.proof,a(t),n),a(o)}default:return Al(e.proof,a(t),n),a(t)}},Nl=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:kl(e.statement,void 0,t);e.name!==void 0&&Oc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Al(e.proof,n,t),r&&(r.isInProof=!1)},Pl={line:0,column:0},Fl=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Il=(e,t)=>{let n=new Map([..._c,...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},Ll=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(e,t)=>i.errors.push({location:t,message:`An operator must be substituted for symbol '${ic(e.name)}', and it must have arity ${e.arity}.`}),s=(e,t)=>{let n=t.location.range;if(e.arity===0){B(t,a,i);return}if(t.kind===`Lambda`){Sl(t,a,i),t.params.length!==e.arity&&n&&o(e,g(n));return}if(t.kind===`OperatorReference`){let r=ll(t,t.operator,a,i);r===void 0?o(e,Vc):r!==e.arity&&n&&o(e,g(n));return}if(t.kind!==`Identifier`){n&&i.errors.push({location:g(n),message:`Arity ${e.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${ic(e.name)}'.`}),o(e,Vc);return}let r=ll(t,t.name,a,i);r!==void 0&&r!==e.arity&&i.errors.push({location:g(zc(t,t.name)),message:`Expected arity ${e.arity} but found operator of arity ${r}.`}),r!==e.arity&&o(e,Vc)},c=e.location.range,l=t.filter(e=>Cc(a,e.name)!==void 0||Pc(e.name,i)!==void 0).map(t=>({declaration:t,expression:{kind:`Identifier`,name:t.name,location:e.location}}));l.filter(e=>e.declaration.arity===0).forEach(e=>{let t=ll(e.expression,e.declaration.name,a,i);t&&c&&i.errors.push({location:g(c),message:`Wrong number of arguments (0) given to operator '${ic(e.declaration.name)}', \nwhich requires ${t} arguments.`})});let u=/* @__PURE__ */ new Map;return 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;s(r,a);let o=a.location.range;u.has(n)?o&&i.errors.push({location:g(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):u.set(n,a)}),l.filter(e=>!u.has(e.declaration.name)).forEach(e=>{(e.declaration.arity===0?0:ll(e.expression,e.declaration.name,a,i))!==e.declaration.arity&&c&&o(e.declaration,g(c)),u.set(e.declaration.name,e.expression)}),t.filter(e=>!u.has(e.name)).forEach(e=>{let t=e.location.range;c&&t&&i.errors.push({location:g(c),message:`Substitution missing for symbol ${ic(e.name)} declared at ${g(t)} \nand instantiated in module ${n}.`})}),u},Rl=(e,t,n)=>{let r=n.getInstance(e);return Ll(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,t)=>Dc(e,t[0],t[1],n),t)},zl=(e,t,n,r)=>{let i=Il(n,r.imported),a=new Map([...n.constants,...n.variables].map(e=>[e.name,e.location])),o={location:e.location,errors:[],warnings:[]};return r.reports.push(o),Ll(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=>[e[0],{...e[1],position:a.get(e[0])??Pl}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Bl=(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)=>yc(e.location,t.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof s)||!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},Vl=(e,t)=>{let n=Il(e,t.imported),r=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),i=new Map([..._c,...t.bound].map(e=>[e[0],{...e[1],position:Pl}])),a=/* @__PURE__ */ new Set,o=[],s=(e,a,o,s)=>({location:e,check:(c,l)=>s({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:a,facts:t.facts,goals:r,bindings:i,errors:c,warnings:l,hasLabelScope:o,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),c=(e,t)=>e.map(e=>s(e.location,void 0,!1,n=>Oc(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return Bl([...e.units.flatMap(e=>{let t=e.kind===`Variables`?{type:`A VARIABLE declaration`,location:e.location}:e.kind===`Constants`?{type:`A declaration`,location:e.location}:e.kind===`Module`?{type:`A MODULE `,location:e.module.location}:e.kind===`Theorem`?{type:`A THEOREM`,location:e.theorem.location}:e.kind===`Assumption`?{type:`An ASSUME`,location:e.assumption.location}:e.kind===`Use`?{type:`A USE or HIDE`,location:e.use.location}:void 0,n=t?.location.range;return!t||!n?[]:[{location:t.location,check:e=>{o.some(e=>e.binding?.isPending)&&e.push({location:g(n),message:`${t.type} may not appear within a recursive definition section.`})}}]}),...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...c(e.constants,`Constant`),...c(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>s(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,params:Array(e.arity).fill(0),range:e.location.range,position:e.location,isPending:!0},r=Ec(e.name,i.get(e.name),n,t);r&&(i.set(e.name,n),a.add(n)),o.push({declaration:e,binding:r?n:void 0})})),...e.definitions.map(t=>s(t.location,t,!0,n=>{Fl(e,t)?B(t.body,void 0,n):pl(t,void 0,n,a)&&i.set(t.name,{kind:`Definition`,arity:bc(t),range:t.location.range,position:t.location})})),...e.instances.map(e=>s(e.location,void 0,!1,n=>{Ac(void 0,e.params,n),t.instanced.get(e)?.forEach((e,t)=>Oc(t,e,n)),e.name!==void 0&&Oc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)})),...e.assumptions.map(e=>s(e.location,void 0,e.name!==void 0,t=>{B(e.expression,void 0,t),e.name!==void 0&&Oc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...e.theorems.map(e=>s(e.location,void 0,e.name!==void 0,t=>Nl(e,t))),...e.uses.map(e=>s(e.location,void 0,!1,t=>El(e,void 0,t))),{location:e.location.range?.end??e.location,check:e=>o.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:g(n),message:`Symbol ${ic(t.declaration.name)} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Hl=/* @__PURE__ */ new WeakSet,Ul=/* @__PURE__ */ new WeakMap,Wl=(e,t)=>{if(t.length===0)return e;let n={...e};return Hl.has(e)&&Hl.add(n),Ul.set(n,[...t,...Ul.get(e)??[]]),n},Gl=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Zl(e,(e,r)=>Gl(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&M(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&M(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Kl=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),ql=/* @__PURE__ */ new WeakMap,Jl=e=>ql.get(e)??e.name,Yl=(e,t)=>(Jl(t)!==e.name&&ql.set(e,Jl(t)),e),Xl=(e,t)=>Yl(e.kind===`Function`?{...e,bounds:Kl(e.bounds,e=>t(e,[])),body:t(e.body,Mc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Zl=(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=>Xl(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Kl(e.bounds,n),body:t(e.body,Mc(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,jc(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,jc(e.bound.pattern))};case`SetMap`:return{...e,bounds:Kl(e.bounds,n),expression:t(e.expression,Mc(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)}}},Ql=(e,t)=>{Zl(e,(e,n)=>(t(e,n),e))},$l=`LAMBDA`,eu=e=>`${e}@SUBSTITUTION`,tu=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(tu),nu=(e,t)=>{if(e.kind!==`Identifier`)return!tu(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=M(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!tu(n.body)},ru=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e),r=n===void 0||t.has(n)?[]:[n];return Ql(e,(e,n)=>r.push(...ru(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},iu=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}},au=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),ou=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},su=(e,t)=>e.map(e=>({pattern:ou(e.pattern,t),set:e.set})),cu=(e,t)=>e.kind===`Function`?{...e,bounds:su(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},lu=(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=>Yl({...cu(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:su(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:ou(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:ou(e.bound.pattern,n),set:e.bound.set}};default:return e}},uu=e=>`${e}@ENABLED`,du=(e,t)=>e.modes.get(t)??e,fu=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!M(e)&&t.instantiation.variables.has(e.name),pu=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>pu(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(fu(e,t,n))return[e.name];let r=M(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?pu(r.body,t,/* @__PURE__ */ new Map):void 0},mu=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return fu(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:uu(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:bu(e.expression,du(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[bu(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:bu(e.subscript,du(t,`Primed`),n),location:r},bu(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=pu(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:uu(r),location:e.location},location:e.location},bu({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},hu=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:uc}),gu=(e,t)=>e.map(e=>hu(e.name,t)),_u=(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:gu(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),vu=(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:[...gu(t,r),...i.map(e=>hu(e,r))],location:r},location:r}},yu=(e,t)=>e.instantiation.isParameterized(t)?Su(e,t):void 0,bu=(e,t,n)=>{let r=e=>bu(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!M(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:bu(e.expression,du(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:bu(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},du(t,`Enabled`),n)};let c=mu(e,t,n);if(c)return c;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!nu(n,i)))return Wl(n,[e]);if(n&&r){let t=eu(e.name);return r.set(t,n),hu(t,e.location)}let o=yu(t,e.name);if(o===void 0)return e;if(a.length===0)return{...e,name:o};let s=i.getDefinition(e.name);return s&&bc(s)>0?vu(o,a,bc(s),e.location):{kind:`Apply`,operator:o,args:gu(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),c=i.substitutions.size>0||a.length>0||Hl.has(e),l=e=>(c&&Hl.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:$l,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:$l,args:n,resolution:uc},location:e.location};if(o)throw new s(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=yu(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...gu(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=i.substitutions.get(e.operator);if(n?.kind===`Identifier`||n?.kind===`OperatorReference`||n?.kind===`Lambda`)return Wl(n,[e]);let r=yu(t,e.operator);if(r===void 0)return e;let o=i.getDefinition(e.operator);return a.length>0&&o?vu(r,a,bc(o),e.location):{...e,operator:r}}let l=iu(t),u=Zl(e,(e,i)=>i.length===0?r(e):bu(e,t,au(n,i,l)));return lu(u,n,l)},xu=(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:hu(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Su=(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=iu(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=cu(Xl(i,(e,t)=>bu(e,s,au(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(e=>({kind:`Operator`,name:e[0],params:[],body:e[1],isLocal:!0,isRecursive:!1,location:e[1].location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&Ul.set(l,[u,...Ul.get(i.body)??[]]),xu({...c,body:l},r.params,i.location)}):t},Cu=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ru(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=>yu(i,e)??e,getQualifiedKey:t=>{let n=yu(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>xu(r,e.params,r.location)):t}}},wu=e=>e.kind===`Let`&&e.instances!==void 0||mt(e).some(wu),Tu=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Zl(e,e=>Tu(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>vc(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}},Eu=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Du=(e,t)=>e.definitions.some(e=>wu(e.body))||e.assumptions.some(e=>wu(e.expression))||e.theorems.some(e=>{let t=Eu(e);return t!==void 0&&wu(t)})?{...e,definitions:e.definitions.map(e=>Xl(e,e=>Tu(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Tu(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Eu(e);return n===void 0?e:{...e,statement:Tu(n,t,[])}})}:e,Ou=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]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].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}])),ku={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]}},Au=(e,t)=>{let n=ku[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},ju=(e,t)=>`${e}${t}`,Mu=(e,t,n)=>`${e}${t}${n}`,Nu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Pu=(e,t,n)=>`${e},${t},${n}`,Fu=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Iu=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Lu=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Ru=(e,t)=>{t.constraints.forEach((t,n)=>Iu(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>Lu(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},V=(e,t,n,r)=>({...Fu(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),zu=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Bu=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Vu=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=>[e[0],{...V(e[0],e[1],[...e[2]],[...e[3]]),nonLeibniz:new Set(e[1]>1?[0,1]:[])}])),Hu=V(`'`,2,[1],[0]),Uu=V(`UNCHANGED`,2,[1],[0]),Wu=V(`ENABLED`,1,[2],[0]),Gu=V(`[]`,3,[3],[0]),Ku=V(`<>`,3,[3],[0]),qu=V(`$ConjList`,0,[3],[1]),Ju=V(`$DisjList`,0,[3],[1]),Yu=V(`$IfThenElse`,0,[3],[1]),Xu=V(`$Case`,0,[3],[1]),Zu=V(`$BoundedForall`,0,[3],[1]),Qu=V(`$BoundedExists`,0,[3],[1]),$u=V(`$UnboundedForall`,0,[3],[1]),ed=V(`$UnboundedExists`,0,[3],[1]),td=V(`$TemporalForall`,3,[3],[0]),nd=V(`$TemporalExists`,3,[3],[0]),rd=V(`$BoundedChoose`,0,[2],[1]),id=V(`$UnboundedChoose`,0,[2],[1]),ad=V(`$SetEnumerate`,0,[2],[1]),od=V(`$Tuple`,0,[2],[1]),sd=V(`$SetOfFcns`,0,[2],[1]),cd=V(`$CartesianProd`,0,[2],[1]),ld=V(`$SubsetOf`,0,[2],[1]),ud=V(`$SetOfAll`,0,[2],[1]),dd=V(`$FcnConstructor`,0,[3],[1]),fd=V(`$RcdConstructor`,0,[3],[1]),pd=V(`$SetOfRcds`,0,[2],[1]),md=V(`$Except`,0,[2],[1]),hd=V(`$Pair`,0,[3],[1]),gd=V(`$Seq`,0,[2],[1]),_d=V(`$FcnApply`,0,[2,2],[1,1]),vd=V(`$RcdSelect`,0,[2,0],[1,1]),yd=V(`$SquareAct`,2,[2,1],[0,0]),bd=V(`$AngleAct`,2,[2,1],[0,0]),xd=V(`$WF`,3,[1,2],[0,0]),Sd=V(`$SF`,3,[1,2],[0,0]),Cd=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),wd=e=>e.map(e=>({name:e,arity:0})),Td=(e,t)=>t.location.range?h(`${e}.`,t.location.range):new s(`${e} at line ${t.location.line}, column ${t.location.column}`),Ed=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Dd=e=>e.kind!==`Let`&&e.kind!==`Label`,Od=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:y(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=y(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Vu.get(t)??Ou.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Fu(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(Mu(e,n,t))}),Lu(r.argConstraints,ju(e,n),t.data.level),Ru(r,t.data)}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);t.forEach((t,n)=>{if(t.kind===`Value`&&t.data.level>zu(e,n))throw new s(`Level error in applying operator ${ic(e.name)}:\nThe level of argument ${n+1} 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(Pu(t,n,r)),c=Fu(Math.max(e.level,...t.filter((t,n)=>Bu(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),t.forEach((t,n)=>{Bu(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),n.forEach(e=>e.params.forEach(e=>c.params.add(e))),r.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>Iu(c.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Iu(c.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Iu(c.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Iu(c.constraints,t,zu(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Iu(c.constraints,e,zu(r,a)))}))}),e.argParams.forEach(e=>{let t=Nu(e),n=a(t.operator);n?.kind===`Operator`&&Iu(c.constraints,t.param,zu(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Lu(c.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>Lu(c.argConstraints,ju(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Lu(c.argConstraints,ju(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=Nu(e),n=a(t.operator);n&&Lu(c.argConstraints,ju(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Nu(e).param)||c.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=Nu(e),n=a(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(Mu(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(Mu(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>c.argParams.add(Mu(r.name,a,e)))}))}),c},a=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:v(`LAMBDA`,wd(e.params),e.body,t)};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{kind:`Operator`,data:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Fu();return e.params.add(r),{kind:`Declared`,data:e,declared:{name:r,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:Fu()}}return{kind:`Value`,data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),c=(e,t,n,r=[],a=Mc(r))=>{let c=o(t,Cd(n,wd(a))),l=r.map(e=>m(e.set,n)),u=i(e,c,l,a),d=r[l.findIndex(e=>e.level>2)]?.pattern;if(d){let t=d.ranges?.[0];throw new s(`Level error in applying operator ${e.name}:\nThe level of the range for the bounded variable ${t?g(t):jc(d)[0]} \nexceeds the maximum level allowed by the operator`)}return u},l=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),u=(e,t,n)=>{let r=e.map(e=>e.data.level);if(r.includes(2)&&r.includes(3))throw Td(`${n} 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 Td(`Action used where only temporal formula or state predicate allowed`,e);Ed.has(e.operator)&&u(t,e,ic(e.operator))},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Dd(n)&&n.kind!==r)throw Td(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=>Ru(i,y(e,n))),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof s)||t.sany?t:Td(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Fu();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),r=e.kind===`And`;return u(n,e,e.isBulleted?`${r?`Conjunction`:`Disjunction`} list`:r?`\\land`:`\\lor`),i(r?qu:Ju,n)}case`Prime`:return c(Hu,[e.expression],t);case`Unchanged`:return c(Uu,[e.expression],t);case`Enabled`:return c(Wu,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(e.kind===`Always`?Gu:Ku,[n])}case`If`:return c(Yu,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Xu,[...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=c(e.kind===`Forall`?Zu:Qu,[e.body],t,e.bounds),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Td(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?e.quantifier===`Forall`?td:nd:e.quantifier===`Forall`?$u:ed,[e.body],t,[],e.names);case`Choose`:return c(e.set?rd:id,[e.body],t,e.set?[{pattern:e.pattern,set:e.set}]:[],jc(e.pattern));case`SetEnumeration`:return c(ad,e.elements,t);case`Tuple`:return c(od,e.elements,t);case`FunctionSet`:return c(sd,[e.domain,e.range],t);case`Product`:return c(cd,e.factors,t);case`SetFilter`:return c(ld,[e.predicate],t,[e.bound]);case`SetMap`:return c(ud,[e.expression],t,e.bounds);case`FunctionConstruction`:return c(dd,[e.body],t,e.bounds);case`Record`:return c(fd,e.fields.map(e=>e.value),t);case`RecordSet`:return c(pd,e.fields.map(e=>e.value),t);case`Except`:return i(md,[a(e.function,t),...e.updates.map(e=>({kind:`Value`,data:i(hd,[{kind:`Value`,data:i(gd,e.path.map(e=>e.kind===`Field`?{kind:`Value`,data:Fu()}:e.args.length===1?a(e.args[0],t):{kind:`Value`,data:c(od,e.args,t)}))},a(e.value,t)])}))]);case`FunctionApplication`:return i(_d,[a(e.function,t),e.args.length===1?a(e.args[0],t):{kind:`Value`,data:c(od,e.args,t)}]);case`Bracket`:return Fu();case`FieldAccess`:return i(vd,[a(e.record,t),{kind:`Value`,data:Fu()}]);case`BoxAction`:case`AngleAction`:return c(e.kind===`BoxAction`?yd:bd,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(e.kind===`WeakFairness`?xd:Sd,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Fu()}},_=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>_(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 mt(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Cd(t,wd(e.names))),i;default:return Ql(e,(e,n)=>a(e,r,Cd(t,wd(n)))),i}},v=(e,t,n,r)=>{let i=Cd(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=_(n,i),c={...Fu(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(ju(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(Mu(e.name,n,t.name))).map(e=>Pu(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(Nu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Nu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},y=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...Fu(),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=v(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:y,toOperand:a}},kd=(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`?kd(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Fu(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),Ru(a,e)}),a},Ad=(e,t,n,r)=>{let i=Od(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`?kd(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):[]}):[],l=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[...l(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],u=Bl([...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:()=>{let t=i.analyze(e.expression,/* @__PURE__ */ new Map).level,n=e.location.range;if(t!==0&&n)throw h(`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${t}.`,n)}})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?kd(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...l(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw c(n)}})),...n],r);if(u.length>0)throw c(u,!1,void 0,r)},jd=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Md=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Nd=/* @__PURE__ */ new Set([...jd,...Md,`Enabled`]),Pd=/* @__PURE__ */ new Set([`~>`,`-+->`]),Fd=/* @__PURE__ */ new Set([...Pd,`\\cdot`]),Id=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Ld=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Rd=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),zd=(e,t)=>Id.has(e)||t.builtins.get(e)?.isStateLevel===!0,Bd=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(jd.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Md.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Pd.has(e.operator))return 224},o=(e,n,s)=>{let c=e.kind,l=s?1:513;(Nd.has(c)||c===`UnboundedQuantifier`&&e.isTemporal===!0||c===`Apply`&&Fd.has(e.operator))&&(r[0]|=l),Nd.has(c)&&(r[0]|=16);let u=a(e);n&&u!==void 0&&(r[0]|=u);let d=n&&u===void 0,f=ht(e);if(f!==void 0&&M(e)&&t.variableIndex.has(f)&&(s||(r[0]|=512),d&&(r[0]|=32)),f!==void 0&&!M(e)){let e=t.substitutions.get(f)??f,n=t.definitions.get(e),a=t.constants.has(f),o=t.variableIndex.get(f);if((o!==void 0||t.builtins.get(f)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=l),o!==void 0&&(d&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:d,isOperatorArgument:s||c===`OperatorReference`||c===`Identifier`&&n.kind===`Operator`&&n.params.length>0});else{zd(f,t)&&(r[0]|=2|(f===`Assert`?0:4)),Ld.has(f)&&(r[0]|=8),Rd.has(f)&&(r[0]|=256),!a&&zd(e,t)&&(r[0]|=16);let n=t.builtins.get(e);d&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}mt(e).forEach(e=>o(e,d,s||c===`Lambda`))};return e.forEach(e=>o(e,!0,!1)),{row:r,edges:i}},Vd=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Hd=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&513),Ud=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=Bd(pt(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&270,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Vd(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Vd(i,r,u,224),f=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&!e.isOperatorArgument).map(s))),p=Vd(i,r,f,512),m=o.map(e=>new Int32Array(e.map(s).filter(e=>!Hd(t[e],l[e*r]|p[e*r])))),h=Vd(a,r,m,270);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|p[t]&512|d[t]&224|h[t]&270:e),words:r}},Wd=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Gd(pt(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Gd=(e,t)=>{let n=t.facts.words,r=Bd(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Wd(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isOperatorArgument||(i[0]|=r[0]&512),e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Hd(e.callee,r[0])||(i[0]|=r[0]&270)}),i},Kd=(e,t)=>!(Wd(e,t)[0]&513),qd=(e,t)=>!(Wd(e,t)[0]&512),Jd={any:2,repeated:4,streamed:8,replayed:260},Yd=(e,t,n)=>(Gd(e,t)[0]&Jd[n])!==0,Xd=(e,t,n=`any`)=>(Wd(e,t)[0]&Jd[n])!==0,Zd=(e,t)=>{let n=Wd(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},Qd=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},$d=(e,t)=>{let n=Gd([e],t);return n[0]&16?void 0:Qd(n)},ef=(e,t)=>!!(Gd([e],t)[0]&1),tf=(e,n,r)=>new t(`Applying ${e} to the following value,\nwhich is not ${n}:\n${L(r)}`),nf=e=>dn(e)?I(e):void 0,rf=`a function with a finite domain`,af=(e,t,n)=>{let r=R(e,t,n),i=nf(r);if(!i)throw tf(n,rf,r);return i},of=(e,t)=>{let n=R(e,1,t),r=nf(n),i=r&&uf(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw cs(`second`,t,`bag`,n);return i},sf=(e,t,n)=>{let r=t[n];if(!r||!lf(r))throw cs(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},cf=(e,t)=>{if(!ln(e)||!P(e))throw t();return F(e).elements},lf=e=>e.range.every(e=>typeof e==`number`&&e>0),uf=(e,t)=>{let n=e.domain.findIndex(e=>Wr(t,e));return n===-1?void 0:e.range[n]},df=(e,t)=>{if(typeof e==`number`)return e;throw t()},ff=(e,t,n)=>{let r=df(e,n)+df(t,n);if(_s(r))throw vs(`${e}+${t}`);return r},pf=(e,t,n,r,i)=>{let a=df(e.range[t],r),o=uf(n,e.domain[t]);if(o===void 0)return a;let s=a-df(o,i);if(_s(s))throw vs(`${a}-${o}`);return s},mf=(e,t,n,r,i=e.length)=>{let a=e.slice(0,i).find(e=>Wr(t,e[0]));a?a[1]=ff(a[1],n,r):e.push([t,n])},hf=e=>e.domain.map((t,n)=>[t,e.range[n]]),gf=ir([],[]),_f=e=>[ps(`EmptyBag`,gf),z(`IsABag`,1,e=>{let t=nf(R(e,0,`IsABag`));return t!==void 0&&lf(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`),n=af(e,0,`BagCardinality`),r=()=>tf(`BagCardinality`,`a bag`,t);return n.range.reduce((e,t)=>{if(typeof t!=`number`||t<=0)throw r();return ff(e,t,r)},0)}),z(`BagIn`,2,e=>{let t=of(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>of(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>nf(R(e,t,`(+)`))),n=sf(e,t,0),r=sf(e,t,1),i=hf(n),a=()=>cs(`second`,`(+)`,`bag`,R(e,1,`(+)`));return r.domain.forEach((e,t)=>mf(i,e,r.range[t],a,n.domain.length)),$r(i)}),z(`\\ominus`,2,e=>{let t=R(e,0,`(-)`),n=R(e,1,`(-)`),r=nf(t),i=nf(n);if(!r)throw cs(`first`,`(-)`,`bag`,t);if(!i)throw cs(`second`,`(-)`,`bag`,n);let a=()=>cs(`first`,`(-)`,`bag`,t),o=()=>cs(`second`,`(-)`,`bag`,n);return $r(r.domain.flatMap((e,t)=>{let n=pf(r,t,i,a,o);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,e=>{let n=R(e,0,`BagUnion`),r=cf(n,()=>tf(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??gf;let i=()=>new t(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(n)}`),a=e=>{let t=nf(e);if(!t)throw i();return t},o=hf(a(r[0]));return r.slice(1).forEach(e=>{let t=a(e);t.domain.forEach((e,n)=>mf(o,e,t.range[n],i))}),$r(o)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=nf(t),i=nf(n);if(!r)throw tf(`\\sqsubseteq`,rf,t);if(!i)throw tf(`\\sqsubseteq`,rf,n);let a=()=>tf(`\\sqsubseteq`,`a bag`,t),o=()=>tf(`\\sqsubseteq`,`a bag`,n);return r.domain.every((e,t)=>{let n=uf(i,e);return df(r.range[t],a)<=(n===void 0?0:df(n,o))})}),ms(`BagOfAll`,2,e=>{let t=fs(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=nf(n);if(!r)throw cs(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[],a=()=>cs(`second`,`BagOfAll`,`bag`,n);return r.domain.forEach((e,n)=>mf(i,t.call([e]),r.range[n],a)),$r(i)}),z(`SubBag`,1,t=>{let n=R(t,0,`SubBag`);if(!dn(n))throw new w(`Attempted to apply the operator DOMAIN to a non-function\n(${ws(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=I(n),i=F(Jr(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 w(`Attempted to apply a function to ${L(r)}, which is not in its domain`);return qr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>ir(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>da(af(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=cf(t,()=>tf(`BagToSet`,rf,t));return ir([...n],n.map(()=>1))})],vf={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},H={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},yf={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},bf=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],xf=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
396
|
+
`],[`r`,`\r`],[`f`,`\f`]]),Sf=1024,Cf=e=>{let t=+!!e.startsWith(``),n=t,r=0,i=t,a=!0,o=H.none,s=0,c=[vf.emptyDocument],l=[void 0],u=[0],d=()=>`$${c.map((e,t)=>e===vf.emptyArray||e===vf.nonemptyArray?`[${u[t]}]`:e===vf.emptyDocument||e===vf.nonemptyDocument?``:`.${l[t]??``}`).join(``)}`,f=()=>` at line ${r+1} column ${n-i+1} path ${d()}`,p=e=>new w(`com.google.gson.stream.MalformedJsonException: ${e}${f()}
|
|
397
|
+
See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),m=()=>new w(`java.io.EOFException: End of input${f()}`),h=()=>{if(!a)throw p(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},g=e=>`/\\;#=`.includes(e)?(h(),!1):!`{}[]:, \f\r
|
|
398
|
+
`.includes(e),_=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
399
|
+
`){r++,i=n;return}if(t===`\r`)return}},v=t=>{for(;n+t.length<=e.length;n++)if(e[n]===`
|
|
400
|
+
`)r++,i=n+1;else if(e.startsWith(t,n))return!0;return!1},y=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
401
|
+
`)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)_();else if(v(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),_();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},ee=()=>{let e=y();if(e===void 0)throw m();return e},b=()=>{let t=bf.find(t=>e[n]===t.lower[0]||e[n]===t.upper[0]);if(!t)return H.none;let r=t.lower.length;for(let i=0;i<r;i++){let r=e[n+i];if(r!==t.lower[i]&&r!==t.upper[i])return H.none}return n+r<e.length&&g(e[n+r])?H.none:(n+=r,t.token)},x=()=>{let t=yf.none,r=!1,i=0;for(;n+i<e.length;i++){if(i===Sf)return H.none;let a=e[n+i];if(a===`-`){if(t===yf.none)t=yf.sign;else if(t===yf.exponentE)t=yf.exponentSign;else return H.none}else if(a===`+`){if(t!==yf.exponentE)return H.none;t=yf.exponentSign}else if(a===`e`||a===`E`){if(t!==yf.digit&&t!==yf.fractionDigit)return H.none;t=yf.exponentE}else if(a===`.`){if(t!==yf.digit)return H.none;t=yf.decimal}else if(a<`0`||a>`9`){if(g(a))return H.none;break}else if(t===yf.sign||t===yf.none)r=a===`0`,t=yf.digit;else if(t===yf.digit){if(r)return H.none}else t===yf.decimal?t=yf.fractionDigit:(t===yf.exponentE||t===yf.exponentSign)&&(t=yf.exponentDigit)}return i===Sf||t!==yf.digit&&t!==yf.fractionDigit&&t!==yf.exponentDigit?H.none:(s=i,H.number)},te=()=>{let t=c.length-1,r=c[t];if(r===vf.emptyArray)c[t]=vf.nonemptyArray;else if(r===vf.nonemptyArray){let e=ee();if(e===`]`)return H.endArray;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated array`)}else if(r===vf.emptyObject||r===vf.nonemptyObject){if(c[t]=vf.danglingName,r===vf.nonemptyObject){let e=ee();if(e===`}`)return H.endObject;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated object`)}let e=ee();if(e===`"`)return H.doubleQuotedName;if(e===`'`)return h(),H.singleQuotedName;if(e===`}`){if(r!==vf.nonemptyObject)return H.endObject;throw p(`Expected name`)}if(h(),n--,g(e))return H.unquotedName;throw p(`Expected name`)}else if(r===vf.danglingName){c[t]=vf.nonemptyObject;let r=ee();if(r===`=`)h(),e[n]===`>`&&n++;else if(r!==`:`)throw p(`Expected ':'`)}else if(r===vf.emptyDocument){if(y()===void 0)return H.eof;n--,e.startsWith(`)]}'
|
|
402
|
+
`,n)&&(n+=5),c[t]=vf.nonemptyDocument}else if(r===vf.nonemptyDocument){if(y()===void 0)return H.eof;h(),n--}let i=y();if(i===void 0){if(r===vf.emptyDocument)return H.eof;throw m()}if(i===`]`&&r===vf.emptyArray)return H.endArray;if(i===`]`||i===`;`||i===`,`){if(r!==vf.emptyArray&&r!==vf.nonemptyArray)throw p(`Unexpected value`);return h(),n--,H.null}if(i===`'`)return h(),H.singleQuoted;if(i===`"`)return H.doubleQuoted;if(i===`[`)return H.beginArray;if(i===`{`)return H.beginObject;n--;let a=b();if(a!==H.none)return a;let o=x();if(o!==H.none)return o;if(!g(e[n]))throw p(`Expected value`);return h(),H.unquoted},S=()=>(o===H.none&&(o=te()),o),ne=()=>{if(n===e.length)throw p(`Unterminated escape sequence`);let t=e[n++];if(t===`u`){if(n+4>e.length)throw p(`Unterminated escape sequence`);let t=e.slice(n,n+4);if(!/^[\da-fA-F]{4}$/.test(t))throw p(`Malformed Unicode escape \\u${t}`);return n+=4,String.fromCharCode(Number.parseInt(t,16))}let a=xf.get(t);if(a!==void 0)return a;if(t===`
|
|
403
|
+
`)return r++,i=n,t;if(`'"\\/`.includes(t))return t;throw p(`Invalid escape sequence`)},C=t=>{let a=``,o=n;for(;n<e.length;){let s=e[n++];if(s===t)return a+e.slice(o,n-1);s===`\\`?(a+=e.slice(o,n-1)+ne(),o=n):s===`
|
|
404
|
+
`&&(r++,i=n)}throw p(`Unterminated string`)},re=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},T=e=>{if(c.length-1>=255)throw new w(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=H.none},ie=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=H.none},ae=()=>{let e=S();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},oe=()=>{let e=S(),t=e===H.unquotedName?re():C(e===H.singleQuotedName?`'`:`"`);return o=H.none,l[c.length-1]=t,t},se=t=>t===H.true||t===H.false?t===H.true:t===H.null?null:t===H.number?(n+=s,{literal:e.slice(n-s,n)}):t===H.unquoted?re():C(t===H.singleQuoted?`'`:`"`),ce=()=>{let e=S();if(e===H.beginArray){T(vf.emptyArray);let e=[];for(;ae();)e.push(ce());return ie(),e}if(e===H.beginObject){T(vf.emptyObject);let e=/* @__PURE__ */ new Map;for(;ae();)e.set(oe(),ce());return ie(),e}let t=se(e);return o=H.none,u[c.length-1]++,t};if(S()===H.eof)return null;let le=ce();return a=!1,le!==null&&S(),le},wf=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Tf=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Ef=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Df=e=>{if(!dn(e))return;let t=I(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?di(n):void 0},Of=(e,t)=>{let n=`tlc2.value.impl.${Cs(e)}`,r=`tlc2.value.impl.${t}`;return new w(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},kf=e=>new w(`Cannot convert value: unsupported value type tlc2.value.impl.${Cs(e)}`),Af=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),jf=e=>`[${e.map(Ff).join(`,`)}]`,Mf=e=>`{${bn(e).map(e=>`${Af(typeof e[0]==`string`?e[0]:L(e[0]))}:${Ff(e[1])}`).join(`,`)}}`,Nf=e=>{let t=I(e),n=Vi(t);return n?jf(n):Mf(t)},Pf=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Ff=e=>typeof e==`string`?Af(e):typeof e==`object`?e.kind===`ModelValue`?Af(e.name):Cs(e)===`RecordValue`?Mf(I(e)):If(e):String(e),If=e=>{let t=Cs(e);if(t===`TupleValue`)return jf(I(e).range);if(Pf(t))return Nf(e);if(pi(e))return jf(F(e).elements);throw kf(e)},Lf=e=>e.map(e=>`${Ff(e)}\n`).join(``),Rf=e=>{let t=Cs(e);if(t===`RecordValue`)return Mf(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${Ff(e)}`).join(`,`)}}`;if(Pf(t))return Nf(e);throw kf(e)},zf=e=>{if(e===null)throw new w(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Vn(e);if(Array.isArray(e))return ui(e.map(zf));if(e instanceof Map)return di([...e].map(e=>[Vn(e[0]),zf(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||_s(t))throw new w(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},Bf=e=>{if(typeof e!=`string`)throw new w(`Cannot cast tlc2.value.impl.${Cs(e)} to tlc2.value.impl.StringValue`);return e},Vf=(e,t)=>{let n=la(e,t);if(typeof n!=`string`)throw Of(n,`StringValue`);return n},Hf=e=>{if(!Tf.has(e.toLowerCase()))throw Ef.has(e.toLowerCase())?new p(`IOUtils!Serialize does not support the charset ${e}`):new w(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},Uf=(e,t,n,r)=>{let i=n.find(e=>!wf.has(e));if(i!==void 0)throw new w(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${i}`);if(n.includes(`READ`))throw new w(`java.lang.IllegalArgumentException: READ not allowed`);let a=new Set(n.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:n);if(a.has(`APPEND`)&&a.has(`TRUNCATE_EXISTING`))throw new w(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(a.has(`DELETE_ON_CLOSE`))throw new p(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let o=e.readFile?.(t);if(o===void 0&&!a.has(`CREATE`)&&!a.has(`CREATE_NEW`))throw new w(`java.nio.file.NoSuchFileException: ${t}`);if(o!==void 0&&a.has(`CREATE_NEW`))throw new w(`java.nio.file.FileAlreadyExistsException: ${t}`);o===void 0||a.has(`TRUNCATE_EXISTING`)?e.writeFile?.(t,r):e.writeFile?.(t,a.has(`APPEND`)?o+r:r+o.slice(r.length))},Wf=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},Gf=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new w(`${t} (No such file or directory)`);return n},Kf=e=>[Es(hs(`ToJson`,1,e=>Vn(Ff(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Es(hs(`ToJsonArray`,1,e=>Vn(If(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Es(hs(`ToJsonObject`,1,e=>Vn(Rf(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Es(hs(`JsonSerialize`,2,t=>{let n=Bf(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!Vi(r)&&!Df(r))throw cs(`second`,`JsonSerialize`,`sequence or record`,r);return Wf(e,n),e.writeFile?.(n,Ff(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Es(hs(`ndJsonSerialize`,2,t=>{let n=Bf(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=Vi(r);if(!i)throw cs(`second`,`ndJsonSerialize`,`sequence`,r);return Wf(e,n),e.writeFile?.(n,Lf(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Es(hs(`JsonDeserialize`,1,t=>zf(Cf(Gf(e,Bf(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Es(hs(`ndJsonDeserialize`,1,t=>ui(Gf(e,Bf(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>zf(Cf(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],qf=(e,t)=>[Es(Ms(`Serialize`,3,(n,r)=>{let i=Ns(n,2,`Serialize`)(),a=Df(i);if(!a)throw cs(`third`,`ndJsonSerialize`,`sequence`,i);if(Vf(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Ns(n,0,`Serialize`)(),s=Vi(o);if(!s)throw cs(`first`,`Serialize`,`sequence`,o);let c=Ns(n,1,`Serialize`)();if(typeof c!=`string`)throw cs(`second`,`ndJsonSerialize`,`sequence`,c);let l=la(a,`openOptions`);if(Cs(l)!==`TupleValue`)throw Of(l,`TupleValue`);let u=Vf(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw Of(e,`StringValue`);return e});return Hf(u),Uf(e,c,d,Lf(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],Jf={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Yf=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=tr(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(Jf.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(Jf.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(Jf.boolean),o(+!!e);return}if(typeof e==`number`){o(Jf.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(Jf.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(Jf.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),ln(e)){let t=F(e).elements;o(Jf.set),c(t.length),t.forEach(f);return}let p=I(e),m=sr(e);m===`tuple`?(o(Jf.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(Jf.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(Jf.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ae(Uint8Array.from(t))},Xf=e=>[Es(hs(`_TLCTraceSerialize`,2,t=>{let n=Bf(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Yf(R(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],Zf=25214903917n,Qf=(1n<<48n)-1n,$f=e=>{let t=(BigInt.asUintN(64,e)^Zf)&Qf,n=e=>(t=t*Zf+11n&Qf,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^Zf)&Qf},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<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},ep=[],tp=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},np=()=>{for(let e=1277011;ep.length<1341;e++)tp(e)&&ep.push(e);return ep},rp=e=>{let t=np(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},ip=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},ap=e=>{for(let t=Math.max(e,9);;t++){let e=ip(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)}}},op=(e,t,n)=>{if(t<=0)return[];let r=ap(t),i=BigInt(n.nextInt(t)),a=BigInt(rp(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},sp=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:$t),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},cp=(1n<<63n)-1n-24n,lp=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(cp*BigInt(n)+i)%t;return r<0n?r+t:r})},up=(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,dp=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=ci(e.domain),n=F(e.range).elements;return{lists:t.map(()=>n),create:e=>ir(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>F(e).elements),create:t=>di(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>F(e).elements),create:ui}}},fp=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,pp=(e,t,n,r)=>{if(Ni(t))return[];let i=r===`1.7.4`?sp:op;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=fp(t,r)?void 0:dp(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?lp(e,t,n):i(e,Number(t),n)).map(e=>a.create(up(a.lists,e)))}let o=F(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},mp=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...ls(e.domain,`RandomElement`,e).elements];return ir(n,n.map(()=>mp(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return di(e.names.map((n,r)=>[n,mp(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return ui(e.factors.map(e=>mp(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 w(`Attempted to retrieve out-of-bounds element from the interval value ${L(e)}.`);return e.low+r}let n=ls(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new w(`Index ${r} out of bounds for length ${n.length}`);return n[r]},hp=(e,t,n)=>{if(typeof e!=`number`||e<0)throw cs(t,n,`nonnegative integer`,e);return e},gp=(e,t,n,r)=>qr(Array.from({length:t},()=>qr(e.filter(()=>r.nextDouble()<n)))),_p=(e,t)=>{let n=`RandomSetOfSubsets`,r=hp(R(e,0,n),`first`,n),i=hp(R(e,1,n),`second`,n),a=R(e,2,n);if(!ln(a)||!P(a))throw cs(`third`,n,`finite set`,a);let o=F(a).elements;if(o.length<31&&r>2**o.length)throw cs(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw cs(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return gp(o,r,o.length===0?0:i/o.length,t.getRandom())},vp=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,yp=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,bp=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(vp.test(t))return Number(t.replace(/[fFdD]$/,``));let n=yp.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},xp=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=hp(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw cs(`second`,n,`string literal representing a probability`,i);let a=bp(i);if(a===void 0||a<0||a>1)throw cs(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!ln(o)||Wn(o)||!Ri(o))throw cs(`third`,n,`finite set`,o);let s=Ii(o);if(32-Math.clz32(r)>s&&r>1<<s)throw cs(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return gp(F(o).elements,r,a,e.getRandom())}),Sp=e=>[Es(z(`RandomSubset`,2,t=>{let n=hp(R(t,0,`RandomSubset`),`first`,`RandomSubset`),r=R(t,1,`RandomSubset`);if(!pi(r)||!Ri(r))throw cs(`second`,`RandomSubset`,`a finite set`,r);let i=fp(r,e.version);if(i&&i.reduce((e,t)=>e*F(t).elements.length,1)>rn())throw new w(an());return qr(pp(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),z(`RandomSetOfSubsets`,3,t=>_p(t,e)),z(`TestRandomSetOfSubsets`,3,t=>ui(Array.from({length:5},()=>F(_p(t,e)).elements.length)))],Cp=(e,t=0n)=>{let n=$f(t),r=$f(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>di([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,markExplored:void 0,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:xo,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,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 o},wp=e=>$r([...e.possibleCounts].map(e=>[e[0],e[1]])),Tp=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,wp(e)]]),Ep=e=>di([[`name`,e??`UnnamedAction`],[`location`,di([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Dp=/* @__PURE__ */ new WeakSet,Op=(e,t)=>{let n=di([[`action`,qr(e)],[`state`,qr(t)]]);return Dp.add(n),n},kp=(e,t,n)=>{let r=e.map((e,t)=>ui([t+1,di(Object.entries(e))])),i=r.slice(1).map((e,n)=>ui([r[n],t[n],e])),a=n?[ui([r[r.length-1],n.action,r[n.start]])]:[];return Op([...i,...a],r)},Ap=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Tp(e).get(t)},jp=(e,n,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0||!e.pause)return;n(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),L(i));else throw new t(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(r)}`)},Mp=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),Np=e=>e.every(e=>e!==void 0),Pp=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!M(e);if(i&&t.variableIndex.has(r))return 1;let a=mt(e).map(e=>Pp(e,t,n)),o=i?$g(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Pp(o.body,t,n))),Math.max(0,...a)},Fp=(e,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[Ms(`AssertError`,2,e=>{let t=fs(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw new w(`In computing AssertError, a non-string expression (${Mp(t)}) was used as the err of an AssertError(err, exp).`);let r=Ns(e,0,`AssertError`)();try{Ns(e,1,`AssertError`)()}catch(e){if(e instanceof w)return It(e.message,n.isTool)===r;throw e}return!1}),hs(`TLCGetOrDefault`,2,e=>Ap(n,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),hs(`Trace`,0,(e,t)=>{let r=t?.environment.variables??[],i=t?.state??r.map(()=>void 0);if(!t||!Np(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new w(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return t.state?ui(n.getBehavior(i).map(e=>{let r=t.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return di(i===void 0?r:[[`_action`,i],...r])})):ui([di([])])}),hs(`CounterExample`,0,()=>n.counterExample??Op([],[])),z(`ToTrace`,1,e=>{let n=R(e,0,`ToTrace`);if(typeof n!=`object`||!Dp.has(n))throw new t(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(n)}`);let r=F(la(n,`state`)).elements.map(e=>Vi(e)??[]);return ui(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let n=R(e,0,`TLCModelValue`);if(typeof n!=`string`)throw new t(`The argument of ModelValue should be a string, but instead it is:\n${L(n)}`);return er(n)}),Ms(`TLCDefer`,1,(e,t)=>{let r=fs(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...Ms(`PickSuccessor`,1,(t,r)=>{let i=r?.next??(r?.environment.variables??[]).map(()=>void 0);if(n.getSimulationValue===void 0&&(!Np(i)||r?.next&&n.isSeen(i)))return!0;let a=fs(t,0,`PickSuccessor`),o=a.call([]);if(typeof o!=`boolean`)throw new w(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${ws(o)}) was used as the condition of an IF.\n${a.expression?Mp(a.expression):``}`);if(o||!r?.next||!Np(i)||!r.state||!Np(r.state))return!0;let s=r.state,c=n.getSuccessorAction(s,i),l=t=>e(Tt(n.isTool,St.moduleOverrideStdout,Ct.none,t));for(;;){l(`Extend behavior of length ${n.getLevel(s)} with a "${c?.name}" step [<Action ${c?.location.range&&g(c.location.range)}>]? (Yes/no/explored/states/diff):`);let e=n.readLine?.();if(e===void 0)throw new T;if(/^[\0-\x20]*$/.test(e)||e.toLowerCase().startsWith(`y`))return!0;if(e[0]===`s`)l(`${Ga(n.toRecord(s)).trimEnd()}\n~>\n${Ga(n.toRecord(i)).trimEnd()}`);else if(e[0]===`d`)l(Ga(n.toRecord(i),n.toRecord(s)));else if(e[0]===`e`){if(n.markExplored)return n.markExplored(i),!0;if(n.getSimulationValue===void 0)throw new p(`tla-ts can't mark a state explored while it searches depth first.`);l(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(e[0]===`n`)return!1}}),isActionLevel:!0},Ms(`TLCCache`,2,(e,t)=>{let i=fs(e,0,`TLCCache`),o=Aa(Ns(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=Pp(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),z(`TLCFP`,1,e=>{let t=R(e,0,`TLCFP`),n=xa(t);if(n)throw n;return Number(BigInt.asIntN(32,xo([t])))}),Ms(`TLCEvalDefinition`,1,(e,n)=>{let r=Ns(e,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new t(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${L(r)}`);let i=n?$g(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new t(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${L(r)}`);if(i.kind===`Operator`&&i.params.length>0){let e=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new t(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${e.join(`, `)})`)}return i.kind===`Operator`?W(i.body,n):W({kind:`Identifier`,name:r,location:i.location},n)})]},Ip=(e,t)=>[hs(`_Track`,2,e=>{let n=String(R(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,R(e,0,`_Track`)===!0?r+1:r),!0}),hs(`_Counts`,0,()=>wp(t)),hs(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(wp(t),!0)),!1)}),hs(`_PrintCounts`,0,()=>(e(L(wp(t),!0)),!0))],Lp=e=>`${e.getUTCFullYear()}.${Lt(e.getUTCMonth()+1)}.${Lt(e.getUTCDate())}.${Lt(e.getUTCHours())}${Lt(e.getUTCMinutes())}${Lt(e.getUTCSeconds())}`,Rp=e=>$r([...e].map(e=>[e[0],ui([e[1]])])),zp=e=>or(ei(e),`record`),Bp=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Vp=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Hp=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Up=(e,n,r)=>{if(e.version===`1.7.4`?!Vp.has(n)||!e.isStarted&&Hp.has(n):!e.isStarted&&Bp.has(n))throw new t(`TLCGet(${n}) was undefined.`);let i=e.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-e.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return a;case`stats`:return zp([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,a],[`worker`,0]]);case`config`:return zp([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,Ja()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return zp([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Vn(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Vn(Lp(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Ep(void 0);case`all`:return Rp(e.registers);case`all:named`:return Rp(Tp(e))}if(n.startsWith(`s:`)){let r=Tp(e).get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return Vn(e.properties.get(n.slice(2))??n);throw new t(`TLCGet(${n}) was undefined.`)},Wp=(e,n,r)=>{if(typeof n==`number`&&n>=0){let r=e.registers.get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new t(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(n)}`);return Up(e,n,r?.state)},Gp=e=>e.length===0?[[]]:e.flatMap((t,n)=>Gp([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Kp=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&F(e).elements.forEach(Kp),e.kind===`Function`&&e.range.forEach(Kp))},qp=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return F(e)}},Jp=(e,n)=>[z(`Print`,2,t=>(e(Va([R(t,0,`Print`),R(t,1,`Print`)]).map(N).join(` `)),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(N(Va([R(t,0,`PrintT`)])[0])),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new t(`The first argument of Assert evaluated to FALSE; the second argument was:\n${N(L(R(e,1,`Assert`)))}`,S.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>$r([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=dn(t)?I(t):void 0,i=dn(n)?I(n):void 0;if(!r)throw cs(`first`,`@@`,`function`,t);if(!i)throw cs(`second`,`@@`,`function`,n);let a=yn(r),o=yn(i).filter(e=>!a.some(t=>Wr(e[0],t[0])));return ei([...a,...o])}),z(`ToString`,1,e=>Vn(L(R(e,0,`ToString`),!0))),{...Ms(`TLCEval`,1,(e,t)=>{let n=qp(Ns(e,0,`TLCEval`)());return t===void 0&&Kp(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=ls(R(e,0,`Permutations`),`Permutations`).elements;return qr(Gp(t).map(e=>$r(t.map((t,n)=>[t,e[n]]))))}),ms(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=Vi(t);if(!n)throw cs(`first`,`SortSeq`,`natural number`,t);let r=fs(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw cs(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),ui(a)}),n.version===`1.7.4`?Es({...hs(`TLCGet`,1,(e,t)=>Wp(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Es(Ms(`TLCGet`,1,(e,t)=>Wp(n,Ns(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)`),hs(`TLCSet`,2,t=>(jp(n,e,R(t,0,`TLCSet`),R(t,1,`TLCSet`)),!0)),ps(`Any`,Jn),z(`RandomElement`,1,e=>mp(R(e,0,`RandomElement`),n.getRandom()))],Yp=`----------------------------- MODULE Bags --------------------------------
|
|
404
405
|
(**************************************************************************)
|
|
405
406
|
(* A bag, also called a multiset, is a set that can contain multiple *)
|
|
406
407
|
(* copies of the same element. A bag can have infinitely many elements, *)
|
|
@@ -553,7 +554,7 @@ CopiesIn(e, B) ==
|
|
|
553
554
|
7 Dec 98 : Corrected error found by Stephan Merz.
|
|
554
555
|
6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
|
|
555
556
|
5 Dec 98 : Initial version.
|
|
556
|
-
`,
|
|
557
|
+
`,Xp=/* @__PURE__ */ new Map([[`Bags`,Yp],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
|
|
557
558
|
(***************************************************************************)
|
|
558
559
|
(* The two definitions in this standard module are overridden by TLC in *)
|
|
559
560
|
(* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
|
|
@@ -1685,7 +1686,7 @@ _TLCTrace ==
|
|
|
1685
1686
|
/\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
|
|
1686
1687
|
|
|
1687
1688
|
=============================================================================
|
|
1688
|
-
`]]),
|
|
1689
|
+
`]]),Zp=new Map([...[...Xp].filter(e=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e[0])),[`Bags`,Yp.replace(`
|
|
1689
1690
|
LOCAL INSTANCE Naturals
|
|
1690
1691
|
`,`
|
|
1691
1692
|
EXTENDS TLC
|
|
@@ -1777,17 +1778,16 @@ _TEPosition ==
|
|
|
1777
1778
|
ELSE TLCGet("level") + 1
|
|
1778
1779
|
|
|
1779
1780
|
=============================================================================
|
|
1780
|
-
`]]),fp=(e=`master`)=>e===`1.7.4`?dp:up,pp=(e,t)=>e.every(e=>Gi(e,t)),mp=Kr([!1,!0]);Vr(mp);const hp=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Zr(hp(e,t,r),hp(e,r,n))},gp=[`\\cup`,`\\cap`,`\\`],_p=e=>typeof e==`object`&&e.kind===`MixedSet`,vp=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,yp=(e,t,n)=>{t.kind===`Interval`&&Fi(t);let r=t.kind===`Interval`?t:Br(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return cn(r,e=>{Gi(e,n)===i&&on(a,e)}),vp(t)?nr(a):qr(a)}if(Mi(t))return n;if(!ln(n))return ur({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return cn(r,e=>on(i,e)),cn(n.kind===`Interval`?n:I(n).elements,e=>{Gi(e,t)||on(i,e)}),qr(i)},bp=(e,t)=>{let n=(t,n)=>us([Ms(t,n,e)()],0,e);return{...B(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},xp=[fs(`TRUE`,!0),fs(`FALSE`,!1),fs(`BOOLEAN`,mp),fs(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),hs(`=`,Ur),hs(`#`,(e,t)=>!Ur(e,t)),B(`~`,1,e=>!us(e,0,`~`)),B(`<=>`,2,e=>us(e,0,`<=>`)===us(e,1,`<=>`)),bp(`/\\`,(e,t)=>e&&t()),bp(`\\/`,(e,t)=>e||t()),bp(`=>`,(e,t)=>!e||t()),B(`\\in`,2,e=>Gi(z(e,0,`\\in`),z(e,1,`\\in`))),B(`\\notin`,2,e=>!Gi(z(e,0,`\\notin`),z(e,1,`\\notin`))),hs(`\\subseteq`,(e,t)=>{if(!P(e))throw new y(`\\subseteq expects a set but received ${R(e)}`);if(typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&F(e.base))return pp(I(e.base).elements,t.base);if(typeof e==`object`&&e.kind===`Interval`){if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;for(let n=e.low;n<=e.high;n++)if(!Gi(n,t))return!1;return!0}return!Ei(e,e=>!Gi(e,t))}),...gp.map(e=>B(e,2,t=>{let n=z(t,0,e),r=z(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(ln(n)&&ln(r)&&!_p(n)&&!_p(r)&&!i&&!sn(n)&&!sn(r)){if(e===`\\cup`&&Mi(n))return r;let t=e===`\\cup`?Zr:e===`\\cap`?Xr:Yr;return Ui((n,r)=>{let i=I(n),a=I(r),o=t(i,a);if(e===`\\cup`){let e=Br(i),t=Yr(a,i).elements,n=e===i.elements&&(t.length===0||Xn(e[e.length-1],t[0])<0);if(e.length+t.length>rn())throw new s(an());if(n&&!i.isNormalized)return o;let r=o===i?tr(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=vp(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>Gi(e,o)))),o},(t,n)=>yp(e,t,n),n,r)}return ln(n)?yp(e,n,r):e!==`\\`&&ln(r)?yp(e,r,n):ur({kind:`SetOperation`,operator:e,left:n,right:r})})),B(`SUBSET`,1,e=>({kind:`Subset`,base:z(e,0,`SUBSET`)})),B(`UNION`,1,e=>{let t=z(e,0,`UNION`),n=fn(t)?Br(t):[],r=n.filter(fn);if(!fn(t)||r.length!==n.length)return ur({kind:`Union`,base:t});let i=r.flatMap(Br),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{Gi(t,e)||on(e.elements,t)}),qr(e.elements)};return _p(t)||r.some(_p)?a():r.length===0?Jr:Ui(e=>zi(hp(e,0,e.length),i),a,r.map(I),void 0)}),B(`DOMAIN`,1,e=>{let t=z(e,0,`DOMAIN`);if(!un(t))throw new y(`DOMAIN expects a function but received ${R(t)}`);return ua(t)})],Sp=Ds(`Integers`,`Neg`,`IntValue`,1),Cp=e=>{let t=Ds(e,`DotDot`,`IntervalValue`,2);return[Os(e,`+`,`Plus`,(e,t)=>e+t),Os(e,`-`,`Minus`,(e,t)=>e-t),Os(e,`*`,`Times`,(e,t)=>e*t),Os(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new x(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new x(`0^0 is undefined.`);return e**t}),Os(e,`\\div`,`Divide`,(e,t)=>{if(t===0)throw new x(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(gs(n))throw _s(`${e} \\div ${t}`);return n}),Os(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new x(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),B(`..`,2,e=>{let n=z(e,0,`..`),r=Es(z(e,1,`..`),t);return{kind:`Interval`,low:Es(n,t),high:r}})]},wp=Cp(`Naturals`),Tp=Cp(`Integers`),Ep=e=>{let t=wp.indexOf(e);return t===-1?void 0:Tp[t]},Dp=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[Ts(As(`<`,(e,t)=>e<t),t(`LT`)),Ts(As(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),Ts(As(`<=`,(e,t)=>e<=t),t(`LE`)),Ts(As(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Op=[fs(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...wp,...Dp(`Naturals`)],kp=[fs(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Tp,...Dp(`Integers`),B(`-.`,1,e=>{let t=Es(z(e,0,`-`),Sp);if(gs(-t))throw _s(`-${t}`);return-t})],Ap=(e,t,n)=>{let r=z(e,t,n),i=Bi(r);if(!i)throw new x(`${n}\n${R(r)}`);return i},jp=(e,t,n)=>{let r=z(e,t,n);return typeof r==`string`?r:Ap(e,t,n)},Mp=(e,t,n)=>{let r=z(e,t,`SubSeq`);if(typeof r!=`number`)throw ss(n,`SubSeq`,`natural number`,r);return r},Np=(e,t,n)=>typeof e==`string`?Bn(e.slice(t,n)):li(e.slice(t,n)),Pp=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Fp=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Ip=(e,t)=>{let n=cp.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Ts(e,t):e}):t},Lp=e=>Ip(`Sequences`,[B(`Seq`,1,e=>({kind:`SequenceSet`,base:z(e,0,`Seq`)})),B(`Len`,1,e=>jp(e,0,Pp(``,`Len`)).length),B(`\\o`,2,e=>{let t=jp(e,0,Fp(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Ap(e,1,Fp(`t \\o s`,`sequence`));return li([...t,...n])}let n=z(e,1,`\\o`);if(typeof n!=`string`)throw new x(`${Fp(`t \\o s`,`string`)}\n${R(n)}`);return Bn(t+n)}),B(`Append`,2,t=>li([...Ap(t,0,Fp(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),z(t,1,`Append`)])),B(`Head`,1,e=>{let t=Ap(e,0,Pp(``,`Head`));if(t.length===0)throw new x(`Attempted to apply Head to the empty sequence.`);return t[0]}),B(`Tail`,1,e=>{let t=jp(e,0,Pp(``,`Tail`));if(t.length===0)throw new x(`Attempted to apply Tail to the empty sequence.`);return Np(t,1)}),B(`SubSeq`,3,e=>{let t=jp(e,0,Pp(`first `,`SubSeq`)),n=Mp(e,1,`second`),r=Mp(e,2,`third`);if(n>r)return Np(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 x(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${R(z(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Np(t,n-1,r)}),ps(`SelectSeq`,2,e=>{let t=ds(e,1,`SelectSeq`);return li(Ap(e,0,Pp(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new x(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${t.name}>`);return n}))})]),Rp=e=>Ip(`FiniteSets`,[B(`IsFiniteSet`,1,e=>Li(z(e,0,`IsFiniteSet`))),B(`Cardinality`,1,t=>{let n=z(t,0,`Cardinality`);if(!P(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new x(`Attempted to compute cardinality of the value\n${R(n)}`);return Fi(n,e)})]),zp=[Ts(B(`Warshall`,1,e=>{let t=z(e,0,`Warshall`);if(!P(t)||Un(t))throw new x(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${R(t)}`);Fi(t);let n=[],r=/* @__PURE__ */ new Map,i=e=>{let t=ka(e),i=r.get(t)??n.length;return i===n.length&&(r.set(t,i),n.push(e)),i},a=I(t).elements.map(e=>{let t=Bi(e);if(t?.length!==2)throw new x(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${R(e)}`);return[i(t[0]),i(t[1])]}),o=n.map(()=>n.map(()=>!1));a.forEach(e=>{o[e[0]][e[1]]=!0});for(let e=0;e<n.length;e++)for(let t=0;t<n.length;t++)if(o[t][e])for(let r=0;r<n.length;r++)o[e][r]&&(o[t][r]=!0);return qr(n.flatMap((e,t)=>n.flatMap((n,r)=>o[t][r]?[li([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],Bp=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return zp;if(e===`AnySet`)return[fs(`ANY`,qn)];if(e===`IOUtils`)return $d(r,a);if(e===`_TLCTrace`)return nf(r);if(!fp(n.version).has(e))return;let o=Up(e,t,n,r,i);return e===`Randomization`&&o?[...o,Of(n)]:o},Vp=/* @__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`]]]),Hp=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),Up=(e,t,n,r,i)=>{switch(e){case`Naturals`:return Op;case`Integers`:return kp;case`Sequences`:return Lp(n.version);case`FiniteSets`:return Rp(n.version);case`TLC`:return Ip(`TLC`,tp(t,n));case`Randomization`:return kf(n);case`_Possible`:return Uf(t,n);case`Json`:return Qd(r);case`Bags`:return Ip(`Bags`,Cd(i));case`TLCExt`:return Ip(`TLCExt`,Hf(t,n));default:return}},Wp=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&yl.get(t)||[];r.expressions.push(...i,t);let a=Hi.sets,o=a??[],s=o.length;Hi.sets=o;try{return n()}catch(e){throw v_(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Hi.sets=a}},Gp=(e,t,n)=>e.coverage?Bo(e.coverage,t,n):-1,Kp=(e,t,n)=>e.coverage?Ho(e.coverage,t,n):n(),qp=(e,t,n,r)=>Kp(e,t,()=>W(n,r)),Jp=(e,t,n,r)=>{let i=qp(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},Yp=(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},Xp=e=>!e.includes(void 0),Zp=e=>e.variables.map(()=>void 0),Qp=(e,t,n)=>{let r=[...e];return r[t]=n,r},$p=(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}},em=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,tm=e=>e.kind===`Identifier`?e.name:void 0,nm=(e,t,n)=>{if(t.kind===`Label`)return nm(e,t.body,n);let r=tm(t);if(r===void 0)return;let i=ng(n,r);if(i?.kind===`Thunk`)return nm(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=Kg(r,e);return o?.kind===`Closure`&&o.params.length===0?nm(e,o.body,o.scope):void 0},rm=(e,t,n)=>{if(t.kind===`Prime`)return nm(e,t.expression,n);if(t.kind===`Label`)return rm(e,t.body,n);let r=tm(t);if(r===void 0)return;let i=ng(n,r);if(i?.kind===`Thunk`)return rm(e,i.expression,i.scope);if(i)return;let a=Kg(r,e);return a?.kind===`Closure`&&a.params.length===0?rm(e,a.body,a.scope):void 0},im=e=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean expression.`);return e},am=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),om=(e,t,n,r)=>{let i=cm(e,t,n,r);return i&&e.coverage&&!e.isInit&&Vo(e.coverage,r),i},sm=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Vo(r,n),Vo(r,r.roots[n])),e.onState(t),!0},cm=(e,t,n,r)=>t===void 0?Xp(n)?sm(e,n,r):(e.onIncomplete?.(n),!1):Xp(n)&&am(e)?um(e,t,n,r):t.kind===`Predicate`?dm(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?Dm(e,t.expression,t.rest,t.scope,n,t.node):lm(e,t,n)&&om(e,t.rest,n,t.node),lm=(e,t,n)=>{let r=e.environment,i=qp(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return qp(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?tg(t,r.runtime.version):t}})();try{return!Ur(i,a)}catch(t){throw e.callStack&&v_(e.callStack,[i],t),t}},um=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return Dm(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?lm(e,i,n):im(qp(e,i.node,i.expression,Yp(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return sm(e,n,r)},dm=(e,t,n,r,i,a)=>fm(e,t,n,r,i,Gp(e,a,t)),fm=(e,t,n,r,i,a)=>Wp(e,t,()=>{switch(t.kind){case`Let`:{let o=Yp(e,r,i),s=t.definitions,c=e.coverage?l_(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):l_(s,o);return dm(e,t.body,n,c,i,a)}case`Label`:return dm(e,t.body,n,r,i,a);default:if(xm.has(t.kind))throw new y(`The state relation is not a boolean expression.`);return Wp(e,t,()=>Tm(e,t,n,r,i,a))}}),pm=(e,t,n,r,i)=>im(t)&&om(e,n,r,i),mm=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),hm=(e,t,n,r,i,a)=>{let o=Yp(e,r,i);if(t.kind===`Identifier`){let s=ng(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return dm(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return dm(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:Kg(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&ed(c,e.environment))?dm(e,l.body,n,l.scope,i,a):pm(e,Jp(e,a,t,o),n,i,a)}let s=qg(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Kp(e,a,()=>a_(s,t.args,o));return dm(e,s.body,n,r,i,a)}let c=mm.has(t.operator)?qp(e,a,t,o):Jp(e,a,t,o);return pm(e,c,n,i,a)},gm=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?om(e,t,Qp(n,r,i),a):Ur(o,i)&&om(e,t,n,a)},_m=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),vm=(e,t,n)=>(e.coverage&&Uo(e.coverage,t,n.length+1),n),ym=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?nm(e.environment,o,r):rm(e.environment,o,r),l=Yp(e,r,i);if(c===void 0)return qp(e,a,t,l)===!0&&om(e,n,i,a);let u=qp(e,a,s,l),d=i[c];if(t.operator===`=`)return gm(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&e.callStack?.sources.set(f,s),d!==void 0)return qp(e,a,t,l)===!0&&om(e,n,i,a);if(!fi(f))throw new y(`The right side of \\IN is not enumerable.`);return vm(e,f,Di(f)).reduce((t,r)=>om(e,n,Qp(i,c,r),a)||t,!1)},bm=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),xm=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Sm={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Cm=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Sm[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${U(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${U(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${U(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`},wm=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Kp(e,r,()=>Sg(t.bounds,t=>{let r=W(t,n),i=yg(r,t,a);return Array.isArray(i)&&vm(e,r,i),i}));return wg(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},Tm=(e,t,n,r,i,a)=>{let o=Yp(e,r,i);switch(t.kind){case`Identifier`:return hm(e,t,n,r,i,a);case`Apply`:return bm.has(t.operator)&&t.args.length===2?ym(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?im(qp(e,a,t.args[0],o))?dm(e,t.args[1],n,r,i,a):om(e,n,i,a):hm(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>_m(`Predicate`,t,r,a,e),n);return dm(e,o[0],t,r,i,a)}let s=o[o.length-1];return fm(e,$p(t,o.length-1),_m(`Predicate`,s,r,a,n),r,i,em(e,a))}case`Or`:{let o=t.operands;if(t.isBulleted||o.length===2)return o.reduce((t,o)=>dm(e,o,n,r,i,a)||t,!1);let s=fm(e,$p(t,o.length-1),n,r,i,em(e,a)),c=dm(e,o[o.length-1],n,r,i,a);return s||c}case`Exists`:return wm(e,t,o,a).reduce((r,o)=>dm(e,t.body,n,o,i,a)||r,!1);case`Forall`:{let r=wm(e,t,o,a);if(r.length===0)return om(e,n,i,a);let s=r.slice(1).reduce((e,n)=>_m(`Predicate`,t.body,n,a,e),n);return dm(e,t.body,s,r[0],i,a)}case`If`:return dm(e,im(qp(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>im(qp(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new y(`TLC encountered a CASE with no conditions true.`);return dm(e,s,n,r,i,a)}case`FunctionApplication`:{let r=Ag(qp(e,a,t.function,e.isInit?o:og(o)));if(r){let s=Kp(e,a,()=>jg(r,t,o));return dm(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return Dm(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=dm(e,t.action,n,r,i,a);return Dm(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return dm(e,t.action,_m(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?Cm(t):void 0;if(s!==void 0)throw new y(s);return pm(e,qp(e,a,t,o),n,i,a)},Em=(e,t,n)=>e.runtime.warn(St.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${U(n)}`),Dm=(e,t,n,r,i,a)=>Wp(e,t,()=>{let o=Gp(e,a,t),s=nm(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!Ur(a,r)?(Em(e.environment,s,t),!1):gm(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return om(e,n,i,o);let c=s.reduceRight((e,t)=>_m(`Unchanged`,t,r,o,e),n);return Dm(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=ng(r,t.name);if(a?.kind===`Thunk`)return Dm(e,a.expression,n,a.scope,i,o);let s=a?void 0:Kg(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return Dm(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Yp(e,r,i),s=qg(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return Dm(e,s.body,n,a_(s,t.args,a),i,o)}let c=e.environment,l=qp(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=qp(e,o,t,{environment:c,scope:r,state:i,next:void 0});return Ur(l,u)&&om(e,n,i,o)}),Om=(e,t,n,r,i)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i}),km=/* @__PURE__ */ Error(`The replay found a successor`),Am=(e,t,n,r)=>{let i=Om(r,`enabled`,n,()=>{throw km}),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=_m(`Changed`,e.subscript,t,-1,void 0);dm(i,e.action,n,t,Zp(r),-1)}else dm(i,e,void 0,t,Zp(r),-1);return!1}catch(e){if(e!==km)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},jm=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Om(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>_m(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);dm(o,i.expression,s,i.scope,Zp(t),i.node??-1)},Mm=(e,t,n,r)=>{e.some(e=>xm.has(e.expression.kind))||e.forEach(e=>{let i=[];Nm(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},Nm=(e,t,n,r,i,a)=>{let o=Om(r,`next`,n,i,a);dm(o,e.expression,void 0,e.scope,Zp(r),t)},Pm=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(nm(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=ng(r,e.name)?void 0:Kg(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,l_(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){rm(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=ng(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?qg(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:Kg(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,a_(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},Fm=/* @__PURE__ */ new WeakMap,Im=/* @__PURE__ */ new WeakMap,Lm=(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},Rm=(e,t,n)=>{let r=e.slice();return r[t]=n,r},zm=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Bm=(e,t)=>{let n=new y(t);return e.isInit?n:v(n,S.error)},Vm=(e,t,n,r)=>{let i=Gh(n);return r&&xm.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 ${zm(e)}, TLC expected a boolean expression,\nbut instead found ${R(t)}.\n${i}`},Hm=(e,t,n)=>{let r=Cs(t),i=U(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 ${zm(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1781
|
-
`:``}${i}`},Um=(e,t,n)=>Km(e,t,W(t,n)),Wm=new Set(xp.map(e=>e.name)),Gm=e=>e.kind===`Apply`?Wm.has(e.operator):e.kind!==`Identifier`&&!xm.has(e.kind),Km=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;let i=Vm(e,n,t,r);throw e.isInit&&r&&Gm(t)?new ie(i):Bm(e,i)},qm=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=w_(n,r.environment))(r),Jm=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Ym=(e,t,n)=>{let r=n?Fm:Im,i=r.get(e);if(i)return i;let a=kh(e,t,n),o=n?void 0:Oh(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},Xm=(e,t)=>{if(t.constants.has(e))return;let n=pg(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Zm=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Zm(e.expression,t,!1,r);if(e.kind!==`Identifier`||M(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Xm(e.name,t);if(a&&!r.has(a))return r.add(a),Zm(a.body,t,n,r)},Qm=(e,t,n)=>Zm(e,t,!n),$m=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return $m(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=l_(e.definitions,Lm(r,t,n));return $m(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ng(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return $m(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=Xm(e.name,r.environment);if(s)return $m(s.body,void 0,n,r,i)},eh=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||M(e))||!t&&e.kind===`Prime`,th=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>th(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[{index:r,expression:e}];let i=Xm(e.name,t);if(i)return n.add(e.name),th(i.body,t,n)},nh=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),rh=(e,t,n)=>nh.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Jm(e.operator)&&(eh(e.args[0],n)||Qm(e.args[0],t,n)!==void 0)||M(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,ih=/* @__PURE__ */ new Set,ah=(e,t)=>{if(M(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return Ol(e,(e,i)=>{let a=r?ah(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},oh=(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||M(e)?void 0:pg(r,t);return i&&!n.has(i)&&(n.add(i),oh(i.body,t,n))?!0:mt(e).some(e=>oh(e,t,n))},sh=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Qm(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=th(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return rh(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Ym(e,t,n)}},ch=(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(od(e,t)===void 0||oh(e,t,/* @__PURE__ */ new Set))return!0;let n=ah(e,ih);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)}},lh=(e,t,n)=>{let r=e.map(e=>sh(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=am(t);for(let s=e;s<r.length;s++){if(s>0&&f&&jh(u)){d??=Lm(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!Ur(t,i[e.index])}):void 0;if(o){Em(t.environment,o.index,o.expression);return}let s=n.expression,c=qm(a,e,s,d);if(!Km(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Lm(t,n,u);let r=qm(i,s,e.expression,d);if(!Km(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Lm(t,n,u);let r=qm(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Rm(u,e.index,r),d=void 0;else if(!Ur(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!Ur(e,n[i.index])){Em(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},uh=e=>{let t=Cm(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw Bm(n,t);Um(n,e,Lm(n,r,i))&&s(i,a)}},dh=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Lm(r,i,a);if(a[l]!==void 0){Um(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!fi(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${zm(r)}, the right side of \\IN is not enumerable.`;throw Bm(r,`${t}\n${U(e)}`)}let p=Di(f);if(r.generator){for(let e of bf(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(Rm(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(Rm(a,l,p[e]),o)}},fh=/* @__PURE__ */ new WeakMap,ph=e=>{let t=fh.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(ph),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return fh.set(e,n),n},mh=(e,t)=>{let n=e.args[0],r=uh(e),i=(e,r,i)=>$m(n,r,i,e,!t)??-1,a=dh(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],Lm(t,n,o));l(Rm(o,u,d),s)}},hh=(e,t,n)=>{let r=U(e);return(i,a,o,s,c,l)=>{let u=Lm(i,a,o),d=W(e.function,n?u:og(u)),f=Ag(d);if(f!==void 0){Ym(f.body,t,n)(i,jg(f,e,u),o,s,c,l);return}if(!un(d))throw Bm(i,`In computing ${zm(i)}, a non-function (${Cs(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw Bm(i,`In computing ${zm(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},gh=(e,t)=>{let n=ph(e);return th(e,t)?lh([n],t,!1):e.kind===`Tuple`?Ym(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ng(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Ym(ph(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=Lm(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=qg(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Ym(ph(n.body),t,!1)(r,a_(n,e.args,u),a,o,s,c);return}}Um(r,n,u)&&c(a,o)}},_h=(e,t,n)=>{let r=e.operator,i=uh(e),a=M(e)?void 0:Kg(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=k_(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=Ym(a.body,t,n),o(e,i(Lm(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Lm(a,o,s),f=qg(e,d);f?.kind===`Closure`?Ym(f.body,t,n)(a,a_(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},vh=(e,t,n)=>{let r=uh(e),i=M(e)?void 0:Xm(e.name,t),a;return(o,s,c,l,u,d)=>{let f=ng(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Ym(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&Vg(i,t)!==void 0?r(o,s,c,l,u,d):(a??=Ym(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},yh=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||M(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!M(i))return;let a=Zm(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},bh=e=>e.kind===`And`?e.operands.flatMap(bh):[e],xh=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&rh(e,t,!1),Sh=e=>{let t=[];return(n,r,i)=>{let a=Lm(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Km(n,i,qm(t,r,i,a)))return}}},Ch=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=bh(e),r=n.findIndex(e=>!xh(e,t)||yh(e,t)),i=r===-1?void 0:yh(n[r],t);return i?{...i,before:r===0?void 0:Sh(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Ch(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===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,before:void 0}}if(e.kind!==`Apply`||M(e))return;let r=Kg(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Ch(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`||!M(o))return;let s=i.before,c=s&&k_(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Lm(e,t,n)),n))}},wh=(e,t,n)=>{let r=ng(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},Th=(e,t,n)=>{let r=e.map(e=>Ym(e,t,n)),i=n?[]:e.map(e=>Ch(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:void 0);return(e,t,n,i,s,c)=>{let l=a&&wh(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Eh=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=uf(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},Dh=(e,t)=>{let n=Ym(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=Lm(r,i,a),u=t.runtime.version,d=Sg(e.bounds,e=>W(e,l)).map((n,r)=>bf(_g(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,ig(i,l,e)))};f(d.length-1,i)}},Oh=(e,t)=>{if(e.kind===`Exists`)return Dh(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Ym(e,t,!1));return e.isBulleted?Eh(n):n.reduce((e,t)=>Eh([e,t]))},kh=(e,t,n)=>{let r=e=>Ym(e,t,n);switch(e.kind){case`And`:return lh(e.operands,t,n);case`Or`:return Th(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=_g(W(a.set,Lm(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,rg(r,e,u[t]),o,s,c,l)}}let o=n?void 0:ch(e,t);if(o){let r=lh(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=Lm(n,i,a),d=Sg(e.bounds,e=>_g(W(e,u),e,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=rg(t,o.names[e],r);if(e===d.length-1){let e=Lm(n,i,a);if(!o.guards.every(t=>Um(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Tg(e.bounds,Lm(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&od(e,t)!==void 0&&!oh(e.body,t,/* @__PURE__ */ new Set)?ah(e,ih):void 0;return(t,n,r,o,s,c)=>{let l=[];Tg(e.bounds,Lm(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ng(n,e)?.kind===`Value`)){u.every(n=>Um(t,e.body,Lm(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&jh(r)?u.slice(n).every(n=>Um(t,e.body,Lm(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,Lm(r,i,a));if(typeof l!=`boolean`)throw Bm(r,Hm(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=Lm(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw Bm(r,`In computing ${zm(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Cs(t)}) was used as a guard condition of a CASE.\n${Gh(e.source)}`)})?.body??n;if(!u)throw Bm(r,`In computing ${zm(r)}, TLC encountered a CASE with no conditions true.\n${U(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=d_(e.definitions,t);return(t,r,a,o,s,c)=>n(t,l_(e.definitions,Lm(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new y(`UNCHANGED appears in an initial predicate at ${Hh(e)}`)}:gh(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return Um(e,i,Lm(e,n,r))}catch(n){throw e.isEnabled?tg(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 Th([e.action,ph(e.subscript)],t,n);case`Label`:return r(e.body);case`Identifier`:return vh(e,t,n);case`FunctionApplication`:return hh(e,t,n);case`Apply`:{let i=e.args;if(Jm(e.operator)){let r=Qm(i[0],t,n);if(r!==void 0)return e.operator===`=`?lh([e],t,n):dh(e,()=>r);if(eh(i[0],n))return mh(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=W(i[0],Lm(n,r,a));if(typeof l!=`boolean`){let t=Cs(l),r=U(e);throw Bm(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return _h(e,t,n)}default:return uh(e)}},Ah=e=>e.variables.map(()=>void 0),jh=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Mh=(e,t)=>{let n=t.state;if(!n||!jh(n))throw new y(`ENABLED needs a complete state at ${Hh(e)}`);let r=t.environment;if(r.callStack)return Am(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return Ym(e,r,!1)(i,t.scope,Ah(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Nh=(e,t,n,r,i)=>{let a={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Ym(e,t,!0)(a,r,Ah(t),void 0,!1,e=>{if(!a.isStopped){if(!jh(e)){if(i){a.isStopped=i([...e]);return}throw v(new d([...e]),S.error)}a.isStopped=n(e)}})},Ph=(e,t,n)=>{let r=[];return Nh(e,t,e=>(r.push(e),!1),n),r},Fh=(e,t,r,i,a,o,s)=>{let c={environment:r,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:o,successors:0,onUnsatisfied:s};return Ym(e,r,!1)(c,a,Ah(r),void 0,!1,(e,t)=>{if(!c.isStopped){if(!jh(e)){let i=r.variables.filter((t,n)=>e[n]===void 0);throw new n(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,e,t,i)}c.successors++,c.isStopped=i({state:e,action:t})}}),c.successors},Ih=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Ym(e,n,!1)(i,r,Ah(n),void 0,!1,e=>{jh(e)||(i.isStopped=!0)}),i.isStopped},Lh=(e,t,n,r)=>{let i=[];return Fh(e,t,n,e=>(i.push(e),!1),r),i},Rh=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),zh=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Bh=e=>zh.has(e.kind)||e.kind===`Apply`&&Rh.has(e.operator),Vh=(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&&ln(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Hh=e=>`line ${e.location.line}, column ${e.location.column}`,U=e=>{let t=e.location.range;return t?m(t):Hh(e)},Uh={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Wh=(e,t)=>new y(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${U(t)}`),Gh=e=>e.kind===`Number`?e.text??String(e.value):U(e),Kh=(e,t)=>new y(`A non-boolean expression (${Cs(t)}) was used as the condition of an IF.\n${U(e)}`),qh=(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 (${Cs(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Gh(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${Cs(n)}.\n${U({...e,location:{...e.location,range:{...r,end:i}}})}`)},Jh=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${N(R(n))}\n${U(e)}`,r=e=>`Attempted to apply function:\n${N(R(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!un(i))throw new y(`Attempted to select field "${t}" from a non-record value ${N(R(i))}\n${U(e)}`);let a=or(i);if(a===`tuple`)throw na(t);return ca(i.kind===`LazyFunction`?L(i):i,t,a===`record`?n:r)}},Yh=e=>e===`1.7.4`?(t,n)=>$i(t,n,e):void 0,Xh=e=>t=>{if(!un(t))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${Cs(t)})\n${U(e)}`);return ua(t)},Zh=(e,t)=>(n,r)=>{if(!P(n)||Un(n))throw new y(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${U(e)}`);return t.evaluateBinary?t.evaluateBinary(n,r):t.evaluate([n,r])},Qh=e=>v(new y(`TLC can't handle real numbers.\n${e.text}`),S.configParseError),$h=e=>v(new y(`TLC can't handle a number this big.\n${e.text??e.value}`),S.error),eg=(e,t)=>new u(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${U(t)}`,e),tg=(e,t)=>e instanceof u&&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,ng=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},rg=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),ig=(e,t,n)=>{if(t.kind===`Name`)return rg(e,t.name,n);let r=Bi(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new y(`Argument mismatch in operator application.${e?m(e):``}`)}return t.names.reduce((e,t,n)=>rg(e,t,r[n]),e)},ag=(e,t)=>{if(un(e))return e;throw new y(`A non-function (${Cs(e)}) was applied as a function.\n${U(t)}`)},og=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},sg=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),cg=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Expected ${t} to be a boolean but found ${R(e)}`);return e},lg=(e,t,n)=>{if(typeof e!=`boolean`)throw new y(`Attempted to evaluate an expression of form P => Q when ${n} was\n${Cs(e)}.\n${U(t)}`);return e},ug=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Attempted to apply the operator ~ to a non-boolean\n(${Cs(e)})\n${U(t)}`);return!e},dg=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new y(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${U(n)}`);return e===t},fg=(e,t)=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${Gh(t)}`);return e},pg=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),mg=(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.`},hg=(e,t,n)=>{if(!P(e)||Un(e)){let r=R(e),i=n===`1.7.4`?void 0:mg(e,r);throw new y(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Gh(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Gh(t)}\n${i}`)}},gg=(e,t,n)=>(hg(e,t,n),typeof e==`object`&&e.kind===`Interval`?ai(e):yi(e)??Ti(e)),_g=(e,t,n)=>n===`1.7.4`?(hg(e,t,n),yi(e)??Di(e)):gg(e,t,n),vg=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Fi(e),e},yg=(e,t,n)=>vg(e)??_g(e,t,n),bg=(e,t,n)=>vg(e)??gg(e,t,n),xg=(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},Sg=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),Cg=(e,t)=>Sg(e,e=>yg(W(e,t),e,t.environment.runtime.version)),wg=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):xg(t[n],t=>i(n-1,ig(a,e[n].pattern,t)));return i(e.length-1,n)},Tg=(e,t,n)=>wg(e,Cg(e,t),t.scope,n),Eg=(e,t)=>{let n=Sg(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Dg=(e,t,n)=>{if(e.length===1)return ig(t,e[0].pattern,n);let r=Bi(n)??[];return e.reduce((e,t,n)=>ig(e,t.pattern,r[n]),t)},Og=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,kg=e=>Object.assign(e.value,{lambda:e}),Ag=e=>Og(e)?e.lambda:void 0,jg=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:li(i),o=(e,n,i)=>`In applying the function\n${N(R(r))},\nthe ${e} is:\n${N(R(n))}${i}.\n${U(t.function)}`,s=e.bounds;if(s.length===1){if(!Gi(a,r.domain))throw new y(o(`first argument`,a,`which is not in its domain`));return Dg(s,e.scope,a)}let c=Bi(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[],u=()=>new y(`In applying the function\n${N(R(r))},\nthe argument list is:\n${N(R(a))}\nwhich does not match its formal parameter.\n`);if(c===void 0||(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!Gi(n,l[t]))throw new y(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
1782
|
-
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Bi(n)?.length!==e.pattern.names.length)throw new y(o(r,n,`which does not match its formal parameter`))}),c.length>s.length))throw u();return Dg(s,e.scope,a)},Mg=(e,t)=>{let n=t.location.range;if(n)return{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:m(n)}},Ng=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Pg=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},Fg=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),Ig=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Lg=(e,t)=>{let n=Eg(e.bounds,t),r=Pg(n,(n,r)=>W(e.body,sg(t,Dg(e.bounds,rg(void 0,e.name,r),n))),Ng(Mg(e.bounds,e.body),e.bounds,n),Fg(e.bounds));kg({value:r,bounds:e.bounds,body:e.body,scope:rg(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=Lg(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?sr(i):i},Rg=(e,t)=>{if(typeof t!=`object`||or(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!ln(t.domain))return t;try{let e=L(t);return rr(e.domain,e.range)}catch(e){if(e instanceof y)return t;throw e}},zg=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new y(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>Lg(e,t):w_(Ig(e),t):w_(e.body,t),Bg=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=zg(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(sg(e,void 0)):e=>a[i]??r(sg(e,void 0));return t.definitionEvaluators.set(e,o),o},Vg=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},Hg=(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)||!ed(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>Rg(e,zg(e,t)(i)));Vr(n),t.startupValues[r]=n}catch(e){if(!(e instanceof y)&&!C(e))throw e}}),Ug=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&mr(e[n],t))}catch(e){if(e instanceof y)return!1;throw e}},Wg=(e,t)=>{let n=e.cache;if(n!==void 0&&Ug(t.state,e.state)&&Ug(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?Ho(r,i,()=>W(e.expression,sg(t,e.scope))):W(e.expression,sg(t,e.scope));return(!e.isStreamed||ki(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},Gg=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),Kg=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Kg(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Gg(r):t.builtins.get(e)},qg=(e,t)=>M(e)?Jg(e.operator,t):Kg(e.operator,t.environment)??Jg(e.operator,t),Jg=(e,t)=>{let n=ng(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Kg(e,t.environment)},Yg=e=>e.kind===`Closure`?e.params.length:e.arity,Xg=(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:Jg(n,t);if(!r)throw new y(`Expected an operator argument at ${Hh(e)}`);return r},Zg=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),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)=>rg(e,n.name,t[r]),e.scope);return W(e.body,sg(n,r))},Qg=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Yg(e),call:n=>Zg(e,n,t)},$g=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Jg(e.name,t);return n!==void 0&&Yg(n)>0},e_=(e,t)=>e.map(e=>$g(e,t)?Qg(Xg(e,t),t):W(e,t)),t_=(e,t)=>new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),n_=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),r_=(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 r_(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([])}},i_=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&mn(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=n_(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=M(e)?void 0:r_(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=ng(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:n_(e,t)}}return t=>n_(e,t)},a_=(e,t,n,r)=>{if(t.length!==e.params.length)throw t_(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:Xg(t[a],n)}:(r?.[a]??i_(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},o_=(e,t,n,r)=>e.kind===`Closure`?W(e.body,sg(n,a_(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(D_(t,n),n):e.evaluate(e_(t,n),n),s_=/* @__PURE__ */ new WeakMap,c_=e=>{let t=s_.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return s_.set(e,n),n},l_=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:c_(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},u_=(e,t,n)=>{let r=ng(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Wg(r,n);if(r?.kind===`Operator`){if(Yg(r.operator)===0)return Zg(r.operator,[],n);throw new y(`Operator ${e} is used without arguments`)}let i=r_(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw eg(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Bg(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new y(`Unknown identifier ${e} at ${Hh(t)}`)},d_=(e,t)=>({impure:new Set(e.filter(e=>rd(e,t))),streamed:new Set(e.filter(e=>rd(e,t,`streamed`)))}),f_=e=>[...e.facts.ids.keys()].some(t=>rd(t,e)),p_=e=>[...e.facts.ids.keys()].some(t=>rd(t,e,`repeated`)),m_=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,h_=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),g_=e=>t=>{let n=e(t);return mr(n,e(h_(t)))},__=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Hi.sets,o=Hi.callStack,c=a??[],l=c.length;Hi.sets=c,Hi.callStack=r;try{let a=t(i),o=m_(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Bh(e)&&r.sources.set(o,e),o}catch(t){t instanceof s&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Vh(e,r.values),a=i&&!mt(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!un(a)?void 0:a;throw v_(r,[o,...c.slice(l).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),c.length=l,Hi.sets=a,Hi.callStack=o}},v_=(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},y_=(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}},b_=e=>({...e,coverage:void 0,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),x_=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},S_=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=Bo(n,i,e);Vo(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},C_=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Z_(e,t),i=t.callStack,a=i&&yl.get(e),o=i?__(e,r,t,i):r,s=i&&a?x_(e,a,o,i):o,c=t.coverage,l=c?S_(e,s,c):s;return t.evaluators.set(e,l),l},w_=(e,t)=>{if(t.callStack||t.coverage)return C_(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=$s(e,t)??C_(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>w_(e,t.environment)(t),T_=(e,t)=>{let n=e.name,r=M(e)?void 0:r_(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw eg(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=Bg(e,t))(r)}return t=>u_(n,e,t)},E_=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||M(e))return!0;let n=Kg(e.name,t);return n===void 0||Yg(n)===0},D_=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),O_=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(D_(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&E_(t[0],n)){let e=C_(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&E_(t[0],n)&&E_(t[1],n);if(i&&a){let e=C_(t[0],n),r=C_(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(e_(t,n),n)},k_=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw t_(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:i_(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:Xg(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},A_=(e,t,n)=>{let r=k_(e,t,n),i;return t=>(i??=w_(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},j_=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=C_(n[0],t),i=C_(n[1],t);return t=>!lg(r(t),e,`P`)||lg(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=C_(n[0],t);return t=>ug(r(t),e)}if(e.operator===`<=>`){let r=C_(n[0],t),i=C_(n[1],t);return t=>dg(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw Wh(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=M(e)?void 0:Kg(e.operator,t);if(r?.kind===`Closure`)return A_(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=C_(n[0],t),i=Xh(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!vl.has(e)&&!sd(n[0],t);return e=>r.evaluate(D_(n,e),i&&e.scope===void 0?void 0:e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=C_(n[0],t),a=C_(n[1],t),o=Zh(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return O_(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{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.`)};let i=n.map(e=>i_(e,t));return r=>{let a=Jg(e.operator,r);if(a)return o_(a,n,r,i);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 ${Hh(e)}`)}},M_=(e,t)=>{let n=e.kind===`Forall`,r=C_(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=C_(i.set,t);return s=>xg(yg(o(s),i.set,t.runtime.version),t=>fg(r(sg(s,rg(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=Sg(a,e=>yg(C_(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?fg(r(sg(o,a)),e)!==n:xg(s[t],e=>c(t-1,rg(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>Tg(a,t,i=>fg(r(sg(t,i)),e)!==n)?!n:n},N_=(e,t)=>{if(e.kind===`Tuple`)return li(e.names.map(e=>{let n=ng(t,e);return n?.kind===`Value`&&n.value}));let n=ng(t,e.name);return n?.kind===`Value`?n.value:void 0},P_=/* @__PURE__ */ new WeakSet,F_=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&P_.add(e)},I_=/* @__PURE__ */ new WeakMap,L_=e=>{if(I_.has(e))return I_.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=ht(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),mt(e).every(n)},r=n(e)?[...t]:void 0;return I_.set(e,r),r},R_=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=ng(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),z_=e=>P_.has(e),B_=(e,t)=>{let n=z_(e),r=C_(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(sg(t,rg(t.scope,n,e)));if(sn(e))return Fi(e),cn(e,i),d(e,t);let o=si(e),s=rr(o,o.map(i));return ln(e)?s:(s.lambdaDomain=e,sr(s))}let n=[],s=Sg(i,e=>bg(W(e,t),e,t.environment.runtime.version));return wg(i,s,t.scope,e=>{let o=i.length===1?N_(a.pattern,e)??!1:li(i.map(t=>N_(t.pattern,e)??!1));return n.push([o,r(sg(t,e))]),!1}),Qr(n)},c=Mg(i,e.body),l=Fg(i),u=L_(e.body),d=(t,n)=>{let a=R_(n.scope,u),o=sg(n,a),s=kg({value:Pg(t,e=>r(sg(o,Dg(i,a,e))),Ng(c,i,t),l),bounds:i,body:e.body,scope:a});return i.length===1?sr(s):s},f=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!F(t))return d(t,r);if(!(i.length===1?ln(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(ln))){if(f)return d(t,r);try{return s(t,r)}catch(e){if(!(e instanceof y))throw e;return d(t,r)}}if(!f)return s(t,r);try{return s(t,r)}catch(t){throw y_(f,e,t),t}},createLazy:d}},V_=(e,t)=>{let n=B_(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=C_(r[0].set,t);return t=>n(e(t),t)}return e=>n(Eg(r,e),e)},H_=(e,t)=>{let n=P_.has(e);n&&F_(e.function);let r=C_(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=>C_(e,t))}),value:C_(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):li(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(sg(i,rg(i.scope,`@`,e))):da(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=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(St.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${U(e.function)}`)}return n}},U_=(e,t)=>{let n=C_(e.predicate,t),r=e.bound.pattern,i=e.predicate.location.range,a=i&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:m(i)},o=Gh(e.predicate),s=t.coverage,c=(e,t,n)=>{if(!s||e===-1)return n();t||s.secondary[e]++;let r=Ho(s,t?-1:e,n);return!t&&r===!0&&s.secondary[e]++,r},l=(t,n,i,s)=>({kind:`FilteredSet`,base:t,test:(e,t)=>{if(r.kind===`Tuple`&&Bi(e)?.length!==r.names.length)throw new y(`Attempted to check if the value:\n${N(R(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=c(s,t,()=>i(sg(n,ig(n.scope,r,e))));if(typeof a!=`boolean`)throw new y(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${o} yielded non-Boolean value.`);return a},source:a,rebind:r=>l(t,{...n,environment:r},C_(e.predicate,r),-1)});return(e,t,r=-1)=>l(e,t,n,r)},W_=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${Cs(e)}.\n${Gh(t.predicate)}`);return e},G_=(e,t,n,r)=>{if(!P(e)||Un(e))throw new y(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${U(t)}`);return Hr(e),bg(e,n,r)},K_=e=>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${U(e)}`),q_=(e,t)=>{if(e.kind===`SetFilter`){let n=C_(e.predicate,t),r=C_(e.bound.set,t),i=U_(e,t),a=e.bound.pattern,o=t.coverage;return t=>{let s=r(t);if(!ln(s))return i(s,t,o?.current);let c=[],l=r=>{let i=n(sg(t,ig(t.scope,a,r)));W_(i,e)&&on(c,r)},u=s.kind===`Interval`?s:I(s).elements;return cn(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),nr(c)}}if(e.kind===`SetMap`){let n=C_(e.expression,t);return t=>{let r=[];return Tg(e.bounds,t,e=>(on(r,n(sg(t,e))),!1)),qr(r)}}let n=e.set;if(!n)return()=>{throw new y(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`)};let r=C_(e.body,t),i=C_(n,t);return t=>{let a=G_(i(t),e,n,t.environment.runtime.version),o,s=e.pattern;if(xg(a,n=>{if(s.kind===`Tuple`&&Bi(n)?.length!==s.names.length)throw new y(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${U(e)}`);let i=ig(t.scope,s,n);return fg(r(sg(t,i)),e)?(o=N_(s,i),!0):!1}),o===void 0)throw K_(e);return o}},J_=e=>[...e].sort((e,t)=>Xn(e.name,t.name)),Y_=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),X_=(e,t)=>{let n=J_(e),r=Y_(n),i=n.map(e=>C_(e.value,t));if(r)return e=>ui(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=>bn(a,i.map(t=>t(e)),o):e=>di(a,i.map(t=>t(e)))},Z_=(e,t)=>{let n=e=>C_(e,t);switch(e.kind){case`Number`:{let t=e.value;return mn(t)?()=>t:()=>{throw $h(e)}}case`Decimal`:return()=>{throw Qh(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return T_(e,t);case`Apply`:return j_(e,t);case`Bracket`:return()=>{throw new y(`A bracket without a function or subscript is not an expression at ${Hh(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new y(`An operator cannot be used as a value at ${Hh(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 qh(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 qh(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return e=>t(h_(e))}case`Unchanged`:return g_(n(e.expression));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 Kh(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 (${Cs(t)}) was used as a condition of a CASE. ${Gh(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${U(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(sg(n,l_(e.definitions,n)))}case`Forall`:case`Exists`:return M_(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?Wh(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new y(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${U(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return q_(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>qr(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>li(t.map(t=>t(e)))}case`FunctionConstruction`:return V_(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 X_(e.fields,t);case`RecordSet`:{let t=J_(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 H_(e,t);case`ExceptAt`:return t=>{let n=ng(t.scope,`@`);if(n?.kind!==`Value`)throw new y(`@ appears outside an EXCEPT at ${Hh(e)}`);return n.value};case`FunctionApplication`:{F_(e.function);let r=n(e.function),i=t=>ag(r(og(t)),e),a=e.args.map(n),o=Yh(t.runtime.version);if(a.length===1){let e=a[0];return t=>ca(i(t),e(t),o)}return e=>ca(i(e),li(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Jh(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=g_(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new y(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${U(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>Mh(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new y(`The subexpression reference at ${Hh(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Wh(Uh[e.kind],e)}}},Q_=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},$_=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Sa(e[t]),16777619),r=Math.imul(r^Oa(e[t]),1540483477);t[0]=Q_(n)||1,t[1]=Q_(r)},ev=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(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}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},tv=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),nv=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=pa(t,Sa(e[n]));return t&1073741823},rv=(e,t)=>{for(let n=0;n<t.length;n++)if(!gr(e[n],t[n]))return!1;return!0},iv=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,av=(e,t,n)=>{let r=e.slots.length-1;for(let i=iv(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&rv(e.states[r-1],n))return r-1}},ov=(e,t,n)=>{let r=e.slots.length-1,i=iv(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},sv=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&ov(e,t[n],t[n+1])}ov(e,t,n+1)},cv=(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}},lv=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),uv=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return cv(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},dv=e=>Atomics.load(e.used,0)*2>=e.slots.length,fv=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&cv(t,n);return{slots:t,used:e.used}},pv={kind:`Boolean`,value:!0},mv={kind:`Boolean`,value:!1},hv=e=>e?pv:mv,gv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,_v=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,vv=(e,t)=>({kind:e,body:t}),yv=(e,t,n)=>({kind:e,operands:[t,n]}),bv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?bv(e,t.operands).operands:[t])}),xv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return xv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,xv(t)),0)}},Sv=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 Sv(e.body);case`And`:case`Or`:return e.operands.some(Sv)}},Cv=/* @__PURE__ */ new WeakMap;let wv=0;const Tv=e=>{let t=Cv.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`#${wv++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Tv).join(`,`)})`;default:return`${e.kind}(${Tv(e.body)})`}})();return Cv.set(e,n),n},Ev=(e,t)=>e===t||Tv(e)===Tv(t),Dv=(e,t)=>{let n=Tv(t);return e.some(e=>e===t||Tv(e)===n)},Ov=e=>e===`And`?`Or`:`And`,kv=(e,t)=>{switch(e.kind){case`Boolean`:return t?hv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?vv(`Not`,e):e;case`Not`:return kv(e.body,!t);case`And`:case`Or`:return bv(t?Ov(e.kind):e.kind,e.operands.map(e=>kv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return vv(n,kv(e.body,t))}}},Av=e=>{switch(e.kind){case`Boolean`:return hv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return bv(Ov(e.kind),e.operands.map(Av));case`Always`:return vv(`Eventually`,Av(e.body));case`Eventually`:return vv(`Always`,Av(e.body));default:return vv(`Not`,e)}},jv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=jv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return hv(t)}return n.length===0?hv(!t):n.length===1?n[0]:bv(e.kind,n)}case`Not`:{let t=jv(e.body);return t.kind===`Boolean`?hv(!t.value):vv(`Not`,t)}case`Always`:case`Eventually`:{let t=jv(e.body);return vv(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Mv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Nv=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=Nv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>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===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>bv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Nv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Mv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:bv(`Or`,t);n.push(vv(`Always`,vv(`Eventually`,e)))}return bv(`Or`,n)}case`Not`:return gv(e.body)?e:Nv(Av(e.body));default:return e}},Pv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Pv(e.operands[0]):bv(e.kind,e.operands.map(Pv));case`Not`:return e.body.kind===`Not`?Pv(e.body.body):vv(`Not`,Pv(e.body));case`Always`:case`Eventually`:case`Next`:return vv(e.kind,Pv(e.body));default:return e}},Fv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Fv(e.operands[0]);let t=Math.floor(e.operands.length/2);return yv(e.kind,Fv(bv(e.kind,e.operands.slice(0,t))),Fv(bv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return vv(e.kind,Fv(e.body));default:return e}},Iv=(e,t)=>{e.kind===`Eventually`&&!Dv(t,e)&&t.push(e),`body`in e&&Iv(e.body,t),`operands`in e&&e.operands.forEach(e=>Iv(e,t))},Lv=e=>{let t=e.filter(_v),n=e.flatMap(e=>e.kind===`Not`&&_v(e.body)?[e.body]:[]);return!t.some(e=>Dv(n,e))},Rv=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,vv(`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},zv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:vv(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Bv=(e,t,n)=>e.flatMap(e=>{let r=zv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Vv=e=>[...new Set(e.map(Tv))].sort().join(`|`),Hv=(e,t)=>{let n=new Set(t.map(Vv));return[...e.filter(e=>!n.has(Vv(e))),...t]},Uv=e=>{let t=Rv(e),n=Bv(t,`Always`,`And`),r=Bv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=zv(t,`Eventually`,`Or`);if(n&&!(Dv(e,n.first)||Dv(e,n.second)))return Hv(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(!Lv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=zv(t[e],`Always`,`And`);n&&(Dv(t,n.first)||t.push(n.first),Dv(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)Dv(t,e.first)&&Dv(t,e.second)&&!Dv(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!Lv(t)?[]:i(t)};return a(e)},Wv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>xv(e)<=1)}),Gv=e=>{let t=Uv([e]).map(Wv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Vv(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 Uv(n)){let n=Vv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Wv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Kv=(e,t)=>!Dv(e,t)||Dv(e,t.body),qv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&xv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Mv(e);if(n){let e=xv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Sv(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Jv=(e,t)=>{let n=e.findIndex(e=>Ev(e,t));return n===-1?(e.push(t),e.length-1):n},Yv=e=>{let t=Nv(jv(kv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Pv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])qv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:bv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Ev(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Fv(e.formula),n=[];t&&Iv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Jv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Jv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Jv(i,e))}));return{tableau:t&&Gv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Xv=()=>v(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),S.livenessEvaluationFailure),Zv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Qv=/* @__PURE__ */ new WeakSet,$v=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),ey=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),ty=(e,t)=>new y(`TLC cannot handle the temporal formula ${U(e)}${t===void 0?``:`:\n${t}`}`),ny=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=ny(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=ng(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=pg(e,n);if(t)return id(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:M(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return Dl(e,(e,o)=>(a=Math.max(a,ny(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};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:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(Zv.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=M(e)?void 0:Kg(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,a_(o,e.args,ey(n,t)))}default:return l(e)}},ry=(e,t)=>{try{return Cg(e,t)}catch(e){if(!(e instanceof y))throw e;if(!Nt(e))return;throw v(new y(`${p}${e.message}`),S.error)}},iy=(e,t,n,r,i={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let a=(e,t,a=i.name,o=i.expanding,s)=>iy(e,t,n,r,{name:a,path:s?.kind===`Operator`&&s.params.length===0?[...i.path,s.name]:i.path,expanding:o,isSubstituted:i.isSubstituted||s!==void 0&&n.substitutedDefinitions.has(s)});if(e.kind===`And`)return e.operands.flatMap(e=>a(e,t,U(e)));if(e.kind===`Label`)return a(e.body,t);if(e.kind===`Let`)return a(e.body,ay(e,t,n));if(e.kind===`Identifier`){let r=M(e)?ng(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return a(r.expression,r.scope,Qv.has(r)?e.name:i.name);let o=n.constants.has(e.name)?void 0:pg(e.name,n);if(!r&&o?.kind===`Operator`&&o.params.length===0&&(id(o,n)>0||Vg(o,n)===void 0)){if(i.expanding.has(o))throw h();return a(o.body,void 0,!i.isSubstituted&&n.instanceNames.get(e.name)||o.name,/* @__PURE__ */ new Set([...i.expanding,o]),o)}}let o=ey(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||ny(e,t,n)===3)){let t=qg(e,o),r=M(e)?void 0:pg(e.operator,n),s=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!i.isSubstituted||s))return a(t.body,a_(t,e.args,o),i.isSubstituted&&r?r.name:e.operator,i.expanding,r)}let s=r&&e.kind===`Forall`&&e.bounds.every(e=>ny(e.set,t,n)===0),c=s?ry(e.bounds,o):void 0;if(s&&c){let n=[];if(wg(e.bounds,c,t,t=>(n.push(...a(e.body,t,U(e.body))),!1)),n.length===0)throw Xv();return n}return[{expression:e,scope:t,name:i.name,path:i.path}]},ay=(e,t,n)=>{let r=l_(e.definitions,ey(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Qv.add(e.binding);return r},oy=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?ny(e,t,n):i;if(a===0){let r=W(e,ey(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${Gh(e)}`);return hv(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},a=0,o=(e,t,r,o)=>{if(a>=100)throw h();a++;let s=f(e,t);a--;let c=xv(s),l=c===0&&ny(r,o,n)>2;return c>2||l?s:i(r,o,c)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=ey(n,t),s=M(e)||pg(i,n)===void 0?ng(t,i):void 0;if(s?.kind===`Thunk`&&!s.isReleased&&Qv.has(s))return l(e,()=>o(s.expression,s.scope,e,t));let c=s?.kind===`Operator`?s.operator:s?void 0:M(e)?Jg(i,a):Kg(i,n),u=e.kind===`Apply`?e.args:[],p=c?.kind===`Builtin`&&u.length===2?$v.get(c.name):void 0;if(p){let n=u.map(e=>f(e,t));return d(e,t,bv(p,n))}if(c?.kind!==`Closure`)throw ty(e);let m=!M(e)&&pg(i,n)?.isRecursive===!0;return l(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(c.body,a_(c,u,a),e,t)),m)},l=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof c||n&&!r;throw!(t instanceof y)||i?t:ty(e)}},u=(e,t)=>{let r=ny(e,t,n),a=[],o=e.kind===`Forall`;try{Tg(e.bounds,ey(n,t),t=>(a.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof y)||n instanceof c)throw n;if(r<=2)return i(e,t,r);throw ty(e,o&&!Nt(n)?n.message:void 0)}return a.length===0?hv(o):d(e,t,bv(o?`And`:`Or`,a))},d=(e,t,n)=>{let r=xv(n);return r>2?n:i(e,t,r)},f=(e,t)=>{let a=ny(e,t,n);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,ay(e,t,n));case`Apply`:{let n=e.args;if(e.operator===`~`&&!M(e))return d(e,t,vv(`Not`,f(n[0],t)));if(e.operator===`=>`)return d(e,t,yv(`Or`,vv(`Not`,f(n[0],t)),f(n[1],t)));break}case`And`:case`Or`:return d(e,t,bv(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&ny(e.condition,t,n)===0){let r=W(e.condition,ey(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return d(e,t,yv(`Or`,yv(`And`,i,f(e.consequent,t)),yv(`And`,vv(`Not`,i),f(e.alternative,t))))}}if(a<=2)return i(e,t,a);switch(e.kind){case`Identifier`:return s(e,t);case`Apply`:return e.operator===`~>`?vv(`Always`,yv(`Or`,vv(`Not`,f(e.args[0],t)),vv(`Eventually`,f(e.args[1],t)))):s(e,t);case`Always`:case`Eventually`:return vv(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=vv(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?vv(`Always`,vv(`Eventually`,yv(`Or`,i,a))):yv(`Or`,vv(`Eventually`,vv(`Always`,i)),vv(`Always`,vv(`Eventually`,a)))}default:throw ty(e)}};return f(e,t)},sy=e=>({holdsState:(t,n)=>{let r={environment:e,scope:t.scope,state:n,next:void 0},i=t.kind===`State`?W(t.expression,r):Mh(t.step,r);if(typeof i!=`boolean`)throw new y(`A state predicate was evaluated to a non-boolean value.`);return i},holdsAction:(t,n,r)=>{let i=t.scope,a=t.subscript;if(a&&Ur(W(a,{environment:e,scope:i,state:n,next:void 0}),W(a,{environment:e,scope:i,state:r,next:void 0})))return!1;let o=W(t.expression,{environment:e,scope:i,state:n,next:r});if(typeof o!=`boolean`)throw new y(`Encountered an action predicate that's not a boolean.`);return o}}),cy=(e,t,n,r,i)=>{let a=e=>cy(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=r.holdsState(e,t);return i.set(e,a),a}case`Action`:return e.enabled&&i.get(e.enabled)===!1?!1:n!==void 0&&r.holdsAction(e,t,n);case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return cy(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`)}},ly=(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)=>ly(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 cy(e,t[r],t[a(r)],sy(i),/* @__PURE__ */ new Map)}},uy=`UnnamedAction`,dy={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},fy=e=>{let t=e.range??dy;return ui([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},py=(e,t)=>{let n=[[`name`,e.name],[`location`,fy(e.location)]];return e.parameters.length>0&&n.push([`context`,ui(e.parameters)],[`parameters`,li(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),ui(n)},my=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),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(M(e)){let e=ng(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=Kg(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 re)return!1;throw e}},by=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&ed(e,t)&&yy(e.body,t),xy=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&by(e,t),Sy=(e,t)=>{let n=pg(e.name,t);return n?.body===e.body&&xy(n,t)},Cy=(e,t)=>{if(e.kind!==`Identifier`||!M(e))return;let n=ng(t,e.name);return n?.kind===`Thunk`?n:void 0},wy=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:l_(e.definitions,hy(n,t))};let r=Cy(e,t);return r&&{expression:r.expression,scope:r.scope}},Ty=(e,t,n,r)=>t.kind===`Apply`?a_(e,t.args,hy(r,n)):e.scope,Ey=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ng(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Dy=(e,t)=>{try{return e()}catch(e){if(e instanceof re)return t();throw e}},Oy=(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:r.body,scope:r.scope}]:r?a.some(e=>ny(e,n,i)!==0)?o():Dy(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,hy(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},ky=(e,t,n,r,a)=>{let o=()=>({name:n?.name??uy,location:e.location,parameters:Ey(n,t),expression:e,scope:t});if(xm.has(e.kind))throw v(new y(`${i}The next state relation is not a boolean expression.\n${Gh(e)}`),S.error);switch(e.kind){case`Let`:return ky(e.body,l_(e.definitions,hy(r,t)),n,r,a);case`Label`:return ky(e.body,t,n,r,a);case`Or`:return e.operands.flatMap(e=>ky(e,t,n,r,a));case`Exists`:return Dy(()=>{let i=[];return Tg(e.bounds,hy(r,t),t=>(i.push(...ky(e.body,t,n,r,a)),!1)),i.length===0?[o()]:i},()=>[o()])}let s=M(e)?void 0:a.get(gy(e)??``),c=vy(e,t,r);if(s)return Oy(s,e,t,c,r);if(!c)return[o()];let l=_y(e),u=M(e)?c.name:r.instanceNames.get(gy(e)??``)??c.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return Sy(c,r)||l.some(e=>ny(e,t,r)!==0)?d():Dy(()=>{let e=l.reduce((e,n,i)=>({name:c.params[i].name,binding:{kind:`Value`,value:W(n,hy(r,t))},parent:e}),c.scope);return ky(c.body,e,{...c,name:u},r,a)},d)},Ay=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>Ay(e,t,n,r,i,o),s=(e,t,n)=>my(e,bl(t,a),n),c=wy(e,t,n);if(c){o(c.expression,c.scope);return}let l=vy(e,t,n);if(l&&Sy(l,n))return;let u=l?[...a,...yl.get(l.body)??[]]:a;if(l&&l.params.length===0){if(ny(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,a_(l,e.args,hy(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(uy,e,t));return}let d=ny(e,t,n);d<=1?r.inits.push(s(uy,e,t)):d===3&&r.temporals.push(s(uy,e,t))},jy=(e,t,n,r,i)=>{let a=(t,n)=>jy(e,t,n,r,i),o=wy(t,n,r);if(o){a(o.expression,o.scope);return}let s=vy(t,n,r);if(s&&Sy(s,r))return;if(s&&s.params.length===_y(t).length){a(s.body,Ty(s,t,n,r));return}if(t.kind===`Forall`&&Dy(()=>(Tg(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)):ny(a,n,r)<2?i.invariants.push(my(e,a)):i.impliedTemporals.push(my(e,t));return}let c=ny(t,n,r);c<=1?i.impliedInits.push(my(e,t)):c===3&&i.impliedTemporals.push(my(e,t))},My=(e,t)=>{let n=pg(e,t);return n?.kind===`Operator`&&!xy(n,t)?n:void 0},Ny=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:My(e.specification,t);a&&(Ay(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:uy,location:e.frames[0].location,parameters:[],expression:bl(e.expression,e.frames),scope:e.scope}]:ky(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Kg(e.init,t);o?.kind===`Closure`&&r.inits.push(my(e.init??``,o.body));let s=e.next===void 0?void 0:Kg(e.next,t);return s?.kind===`Closure`&&r.actions.push(...ky(s.body,s.scope,s,t,n)),r},Py=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=wy(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&M(e)?ng(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!M(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=vy(e,t,n);if(!s||s.params.length!==_y(e).length)return!0;let c=pg(s.name,n);return c?.body===s.body&&by(c,n)?!0:i(s.body,Ty(s,e,t,n))};return i(e,t)?r:void 0},Fy=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>R(e[1])).join(`,`)})`,Iy=(e,t,n=!1)=>`${e.name===uy?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:Fy(e)} ${m(e.location.range??dy)}`,Ly=e=>`${e.name}${Fy(e)}`,Ry=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=My(e,n);t&&i.invariants.push(my(e,t.body))}),t.properties.forEach(e=>{let t=My(e,n);t&&jy(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>Kr(e.map(e=>{let n=a&&t&&is(a,t,e.expression);return py(e,n&&ui(n))})),s=e=>Kr(e.flatMap(e=>{let t=My(e,n);return t?[ui([[`name`,t.name],[`location`,fy(t.location)]])]:[]}));return ui([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,Kr(n.variables.map((e,t)=>ui([[`name`,e],[`location`,fy(r[t])],...a?[[`coverage`,ui([[`distinct`,Ko(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},zy=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return zy(e.body);case`And`:case`Or`:return e.operands.some(zy);default:return!1}},By=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,Vy=e=>e.promises.some(e=>zy(e.body))||e.models.some(e=>!By(e)),Hy=(e,t)=>e.every((e,n)=>gr(e,t[n])),Uy=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Wy=e=>({data:e(1024),length:0,create:e}),Gy=(e,t,n,r=0,i=n.length-r)=>{let a=t+i;if(a>e.data.length){let t=e.create(Math.max(2*e.data.length,a));t.set(e.data),e.data=t}for(let a=0;a<i;a++)e.data[t+a]=n[r+a];e.length=Math.max(e.length,a)},Ky=(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}},qy=e=>new Int32Array(e).fill(-1),Jy=(e,t)=>(e.edgeStarts[t]??-1)!==-1,Yy=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},Xy=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,Zy=(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),Qy=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},$y=2**53-1,eb=(e,t,n)=>{let r=t.map(e=>oy(e.expression,e.scope,n)),i=e.map(e=>vv(`Not`,oy(e.expression,e.scope,n))),a=i.length===1?i[0]:bv(`Or`,i);return{formula:r.length===0?a:bv(`And`,[...r,a]),negations:i}},tb=e=>{switch(e.kind){case`State`:return[e];case`Enabled`:return[{expression:e.step,scope:e.scope}];case`Action`:return[e.expression,e.subscript].flatMap(t=>t?[{expression:t,scope:e.scope}]:[])}},nb=(e,t)=>{switch(e.kind){case`Boolean`:return;case`State`:case`Enabled`:case`Action`:t.add(e);return;case`And`:case`Or`:e.operands.forEach(e=>nb(e,t));return;default:nb(e.body,t)}},rb=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>nb(e,t));return[...t]},ib=e=>rb(e).flatMap(e=>tb(e).map(e=>e.expression)),ab=(e,t,n,r)=>{if(e.length===0)return;let i=eb(e,t,n),a=/* @__PURE__ */ new Set;nb(i.formula,a);let o=[...a].flatMap(tb),s=o.every(e=>e.scope===void 0)?!nd(o.map(e=>e.expression),n,`repeated`):!p_(n),c={environment:n,atoms:sy(n)},l=Yv(i.formula),u=ob(l,{atoms:{holdsState:(e,t)=>c.atoms.holdsState(e,t),holdsAction:(e,t,n)=>c.atoms.holdsAction(e,t,n)},isShared:s,isSame:Hy,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},r,n.runtime.version!==`1.7.4`),d=(e,t)=>{if(e===void 0)return t();c.atoms=sy(e);try{return t()}finally{c.atoms=sy(n)}};return{branches:u.branches,solutions:l,addInitialState:(e,t,n)=>d(n,()=>u.addInitialState(e,t)),addState:(e,t,n,r)=>d(r,()=>u.addState(e,t,n)),findViolation:u.findViolation,getViolatedProperties:(t,r)=>[...new Set(e.filter((e,a)=>!ly(i.negations[a].body,t,r,0,n)).map(e=>e.name))]}},ob=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map,a=1,o=t.isShared,s=t.atoms,c=t.evaluateFrom,l=/* @__PURE__ */ new Map,u=[],d=e=>{let t=l.get(e)??l.size;return l.set(e,t),u[t]=e,t},f=e=>{if(e.kind===`State`||e.kind===`Enabled`)return[d(e)*2+1];if(e.kind===`Not`){let t=e.body;return t.kind===`State`||t.kind===`Enabled`?[d(t)*2]:void 0}if(e.kind!==`And`)return;let t=e.operands.map(f);return t.every(e=>e!==void 0)?t.flat():void 0},p=e=>new Int8Array(e*l.size).fill(-1),m=e=>new Int8Array(e*i.size).fill(-1),h=(e,t,n,r,i)=>o?e(t,n,r,i):e(t,p(1),0,i),g=e=>{switch(e.kind){case`Boolean`:{let t=e.value;return()=>t}case`State`:case`Enabled`:{let t=d(e);return(n,r,i)=>(r[i+t]===-1&&(r[i+t]=+!!s.holdsState(e,n)),r[i+t]===1)}case`Action`:{let t=e.enabled&&d(e.enabled);return(n,r,i,a)=>(t===void 0||r[i+t]!==0)&&a!==void 0&&s.holdsAction(e,n,a)}case`Not`:{let t=g(e.body);return(e,n,r,i)=>!t(e,n,r,i)}case`And`:{let t=e.operands.map(g);return(e,n,r,i)=>t.every(t=>t(e,n,r,i))}case`Or`:{let t=e.operands.map(g);return(e,n,r,i)=>t.some(t=>t(e,n,r,i))}case`Next`:{let t=g(e.body);return(e,n,r,i)=>t(i??e,p(1),0,void 0)}case`Always`:case`Eventually`:return()=>{throw new y(`TLC cannot evaluate a temporal formula in a single step`)}}},_=e.map(e=>({solution:e,checks:{states:e.stateChecks.map(g),actions:e.actionChecks.map(g),nodes:e.tableau?.nodes.map(e=>{let t=o?f({kind:`And`,operands:e.statePredicates}):void 0;return t?Int32Array.from(t):e.statePredicates.map(g)})??[]},actionIds:Int32Array.from(e.actionChecks,e=>{let t=Tv(e),n=i.get(t)??i.size;return i.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:Wy(e=>new Int32Array(e)),edgeActions:Wy(e=>new Uint8Array(e)),stateResults:Wy(e=>new Uint8Array(e)),initial:[],firstNodes:Wy(qy),lastNodes:Wy(qy),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),v=(e,t,n,r,i)=>c(t,()=>{let t=e.checks.states,a=new Uint8Array(t.length);return t.forEach((e,t)=>{a[t]=+!!h(e,n,r,i)}),a}),b=(e,t,n,r,i,a,s,l,u,d)=>c(t,()=>{let t=e.checks.actions;for(let c=0;c<t.length;c++){if(!o){u[d+c]=+!!h(t[c],n,r,i,a);continue}let f=l+e.actionIds[c];s[f]===-1&&(s[f]=+!!t[c](n,r,i,a)),u[d+c]=s[f]}}),ee=(e,t,n,r,i)=>{let a=e.checks.nodes[t];if(!(a instanceof Int32Array))return a.every(e=>h(e,n,r,i));for(let e=0;e<a.length;e++){let t=a[e],o=i+(t>>1);if(r[o]===-1&&(r[o]=+!!s.holdsState(u[t>>1],n)),r[o]!==(t&1))return!1}return!0},x=(e,t,n,r,i,a)=>c(n,()=>ee(e,t,r,i,a)),S=(e,t)=>{if(!r)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Ky(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},C=(e,t,n)=>{let r=Zy(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),Ky(i,e[t]-1,e[t+1]))}i.slots.set([t+1,n,r],Ky(i,t,n));let a=e.lastNodes.data[t]??-1;return a===-1?Gy(e.firstNodes,t,[r]):e.nextSiblings[a]=r,Gy(e.lastNodes,t,[r]),r},w=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;Gy(e.edgeTargets,o,n),i.forEach((t,n)=>Gy(e.edgeActions,(o+n)*s,r,t*s,s)),Gy(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},ne={slots:/* @__PURE__ */ new Int32Array},T=(e,r,i)=>{let o=[...i,{index:e,state:r}],s=16*a;ne.slots=ne.slots.length===s?ne.slots.fill(0):new Int32Array(s);let c=e=>{let r=ne.slots,i=o[e];for(let a=(n.getFingerprint(i)&2147483647)%r.length;;a=(a+1)%r.length){let n=r[a];if(n===0)return r[a]=e+1,!0;let s=o[n-1];if(s.index===i.index&&t.isSame(s.state,i.state))return!1}},l=0;for(let e=0;e<o.length;e++){if(l>=ne.slots.length>>1){let e=ne.slots;ne.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}ne.slots.length>s&&a++;let u=[];for(let e of ne.slots)e!==0&&u.push(o[e-1]);return u},re=(e,t,r,a,o,s,c)=>{let l=v(e,a,r,s,c),u=t.nodes[e.nodeTableaux[o]],d=e.checks.actions.length,f=[],h=[],g=new Uint8Array(d);u.successors.length>0&&b(e,a,r,s,c,r,m(1),0,g,0);for(let n of u.successors){if(!x(e,n,a,r,s,c))continue;if(S(t,n)&&e.errorNode===void 0&&e.solution.models.some(By)){e.errorNode=o;return}let i=te(e,a,n);if(i!==void 0&&h.includes(i))continue;let l=i??C(e,a,n);h.push(l),f.push(0),i===void 0&&re(e,t,r,a,l,s,c)}let _=n.getSuccessors(a,r),y=new Uint8Array((_.length+1)*d);y.set(g);let ee=m(_.length);_.forEach((n,o)=>{let l=p(1);b(e,a,r,s,c,n.state,ee,o*i.size,y,(o+1)*d);let m=e.isDone[n.index]===!0;for(let r of u.successors){if(!x(e,r,a,n.state,l,0)||n.index===-1)continue;let i=te(e,n.index,r);if(i!==void 0&&h.includes(i))continue;let s=i??C(e,n.index,r);h.push(s),f.push(o+1),i===void 0&&m&&re(e,t,n.state,n.index,s,l,0)}}),h.length>0&&w(e,o,h,y,f,l)},ie=(e,t,n,r,i,a,o)=>{let s=l.size,u=new Uint8Array(t.nodes.length*n.length);c(o,()=>{for(let i=0;i<t.nodes.length;i++)for(let t=0;t<n.length;t++)ee(e,i,n[t].state,r,t*s)&&(u[i*n.length+t]=1)}),e.isDone[o]=!0;for(let c of Qy(e,o)){let o=[],l=[];n.forEach((i,a)=>{let d=e.isDone[i.index]===!0;for(let f of t.nodes[e.nodeTableaux[c]].successors){if(u[f*n.length+a]===0)continue;let c=te(e,i.index,f);if(c!==void 0&&o.includes(c))continue;let p=c??C(e,i.index,f);o.push(p),l.push(a),c===void 0&&d&&re(e,t,i.state,i.index,p,r,a*s)}}),w(e,c,o,i,l,a)}return e.errorNode===void 0?void 0:se(e,e.errorNode)},ae=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Zy(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{Jy(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),w(e,i,a,n,o,r)},oe=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Jy(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 Yy(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}Jy(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}`)},se=(e,t)=>Uy(oe(e,t).reverse().map(t=>e.nodeStates[t])),ce=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>Jy(e,t)),c=[],l=t=>{let n=Yy(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&Kv(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=$y;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]=$y,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>Xy(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>Yy(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=se(e,r),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g=f.length+m.length+h.length,_=r,v=e=>{l.push(_),_=e};for(;g>0;){let r=g;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&Xy(e,_,t)&&(f[n]=!0,g--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_,e)&&(h[t]=!0,g--)}),!(g<=0);){let n=-1,c=-1,u=g;if(Yy(e,_).some((r,l)=>{if(s.has(e.nodeStates[r])){if(!o.has(r)||!a(_,l))return!1;n=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_,l,e)&&(m[t]=!0,g--)})}return g<u?(v(r),d.clear(),!0):(o.has(r)&&!d.has(r)&&(c=r),!1)}))break;if(g<r){v(n),d.clear();break}for(;c===-1;){let t=l.pop();if(t===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);_=t,c=Yy(e,t).find(e=>o.has(e)&&!d.has(e))??-1}v(c),d.add(c)}}let b=p(r,_,s);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];b[b.length-1]!==n&&b.push(n)}let ee=c[c.length-1];return b[b.length-1]===ee&&b.pop(),{prefix:c.slice(0,-1),cycle:[ee,...b.reverse()],isCycleConstrained:Vy(n)}},p=(t,n,r)=>{if(n===t)return[];let i=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([i]),c=[];for(let n=i,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of Yy(e,u).entries()){if(f===u||!a(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==i;)e.push(t),t=r,r=o.get(t)??-1;return e.push(i),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=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,n.push(t,l,-42),c.push(l);let u=r++;Yy(e,l).forEach((t,r)=>{Jy(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u=Math.min(u,o[t]):o[t]===-1&&s.push(t))}),n.push(u)}}};return{branches:_.length,addInitialState:(e,t)=>{let n=p(1);for(let r of _){let i=r.solution.tableau;if(!i)r.initial.push(e);else for(let a=0;a<i.initialCount;a++)x(r,a,void 0,t,n,0)&&r.initial.push(te(r,e,a)??C(r,e,a))}},addState:(e,t,n)=>{let r=T(e,t,n),a=p(r.length),o=r.findIndex(t=>t.index===e)*l.size,s=m(r.length);for(let n of _){let c=n.checks.actions.length,l=new Uint8Array(r.length*c);r.forEach((r,u)=>b(n,e,t,a,o,r.state,s,u*i.size,l,u*c));let u=v(n,e,t,a,o),d=n.solution.tableau;if(!d){ae(n,r,l,u,e);continue}let f=ie(n,d,r,a,l,u,e);if(f)return f}},findViolation:()=>{for(let e of _)for(let t of e.solution.models){let n=ce(e,t);if(n)return n}}}},sb=e=>{switch(e.kind){case`Number`:if(!mn(e.value))throw v(new x(`TLC can't handle a number this big.\n${e.value}`),S.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return $n(e.name);case`Set`:return I({kind:`MixedSet`,elements:e.elements.map(sb)})}},cb=e=>{try{return sb(e)}catch(e){throw!(e instanceof y)||e instanceof x||e instanceof T?e:v(new y(`${i}${e.message}`),S.error)}},lb=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>R(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`)&&mr(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:R(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},ub=e=>new _(`In the configuration file, the identifier ${e} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),db=(e,t)=>{let n=e=>t.root.visible.get(e)?.key??e,r=t.root.constants.map(e=>e.name),i=t.root.variables,a=e=>{let n=t.moduleSymbols.get(e.module??``)?.get(e.name);return n?.kind===`Definition`?n:void 0},o=e=>{if(e.module===void 0)return[e.name,n(e.name)];let t=a(e);return t?[t.key]:[]},s=e=>e.module===t.root.module.name?[]:o(e),c=e=>{let n=t.definitions.get(e);return n?.kind===`Operator`?n.params.length:t.root.constants.find(t=>t.name===e)?.arity??t.builtins.get(e)?.arity??0},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set,d=(e,n)=>{t.builtins.set(e,n),t.definitions.delete(e),l.delete(e),u.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=cb(e.value);Vr(t),s(e).forEach(e=>{let n=c(e);n===0?l.set(e,t):d(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let f=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=f.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new _(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(sb),sb(e.value)]),f.set(t,n)}),f.forEach(e=>s(e).forEach(t=>d(t,lb(e.name,c(t),e.rows))));let p=new Map(e.substitutions.flatMap(e=>o(e).map(t=>[t,n(e.target)])));[...p.keys()].forEach(e=>l.delete(e));let m=(e,a,o)=>{let s=n(a),c=t.definitions.get(s);if(!(c!==void 0||t.builtins.has(s)||l.has(s)||r.includes(a)||i.includes(a)))throw new _(`The configuration file substitutes for ${e} with the undefined identifier ${a}.`);if(c?.kind===`Operator`&&c.params.length!==o)throw new _(`The configuration file substitutes for ${e} with ${a} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(n=>{let i=n.name,a=n.target;if(!r.includes(i)&&!t.root.visible.has(i))throw new _(`In the configuration file, the identifier ${i} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===a))throw ub(a);m(i,a,t.root.constants.find(e=>e.name===i)?.arity??t.root.visible.get(i)?.arity)});let h=e.substitutions.filter(e=>e.module!==void 0);[...t.moduleSymbols.keys()].forEach(e=>{let t=h.filter(t=>t.module===e);t.forEach(e=>{let n=a(e);if(n){if(t.some(t=>t.name===e.target))throw ub(e.target);m(e.name,e.target,n.arity)}});let n=t.find(e=>!a(e));if(n)throw new _(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let g=h.find(e=>!t.moduleSymbols.has(e.module??``));if(g)throw new _(`In the configuration file, the module name ${g.module} is not a module in the specification.`);let v=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(s)),y=(e,n)=>{if(v.has(e))return{key:e,prefix:n};let r=t.copySources.get(e);return r&&y(r.source,n+r.prefix)};t.copySources.forEach((e,n)=>{let r=y(e.source,e.prefix),i=t.definitions.get(n);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=ql(n,r.key,a,a.slice(r.prefix),i.location);t.definitions.set(n,o),t.root.visible.forEach((e,r)=>{e.key===n&&r!==n&&t.definitions.set(r,o)})}),t.operatorConstants.forEach((e,t)=>l.set(t,e));let b=r.filter(e=>!l.has(e)&&!p.has(e)&&!u.has(e));if(b.length>0){let e=t.order.getDeclarationOrder(`constant`).find(e=>b.includes(e))??b[0];throw new _(`The constant parameter ${e} is not assigned a value by the configuration file.`)}return{constants:l,substitutions:p}},fb=`tlc2/value/impl/`,pb={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},mb={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},hb=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=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)}},gb=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),_b=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],vb=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??gb.get(e[3])}${`[]`.repeat(e[1].length)}`),yb=(e,t)=>e[e[t].first].text,bb=(e,t)=>yb(e,t).replaceAll(`/`,`.`),xb=e=>{let t=hb(e);if(t.readUint32()!==3405691582)throw new r(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],i=t.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let r=t.readUint8(),i={tag:r,text:``,value:0,first:0,second:0};n[e]=i,r===pb.utf8?i.text=a.decode(t.readBytes(t.readUint16())):r===pb.integer?i.value=t.readInt32():r===pb.float?t.readUint32():r===pb.long||r===pb.double?(t.readBytes(8),e++):r===pb.class||r===pb.string||r===pb.methodType||r===pb.module||r===pb.package?i.first=t.readUint16():r===pb.methodHandle?(t.readUint8(),i.first=t.readUint16()):(i.first=t.readUint16(),i.second=t.readUint16())}t.readUint16();let o=bb(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 s=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,a=i.indexOf(`)`),c=vb(i.slice(1,a)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:hb(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()},()=>bb(n,d.readUint16())):[],p=_b.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=vb(i.slice(a+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:s}},Sb=(e,t)=>{let n=e[t],r=e[n.second];return{className:yb(e,n.first),name:e[r.first].text}},Cb=(e,n,r,i)=>{let a=()=>new t(`The Java override ${r}.${e.name} computes its value, which tla-ts cannot run`),o=e.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===pb.integer)return t.value;if(t.tag===pb.string)return n[t.first].text;throw a()};for(let e=0;e<o.length;){let t=o[e],r=()=>o[e+1]<<8|o[e+2];if(t>=mb.iconstM1&&t<=mb.iconst5)s.push(t-mb.iconst0),e+=1;else if(t===mb.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===mb.sipush)s.push(r()<<16>>16),e+=3;else if(t===mb.ldc)s.push(l(o[e+1])),e+=2;else if(t===mb.ldcW)s.push(l(r())),e+=3;else if(t===mb.dup){let t=c();s.push(t,t),e+=1}else if(t===mb.getstatic){let t=Sb(n,r());if(t.className!==`${fb}BoolValue`||t.name!==`ValTrue`&&t.name!==`ValFalse`)throw a();s.push({kind:`Identifier`,name:t.name===`ValTrue`?`TRUE`:`FALSE`,location:i}),e+=3}else if(t===mb.invokestatic){let t=Sb(n,r()),o=c();if(t.className!==`${fb}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===mb.new)s.push({className:yb(n,r()),value:void 0}),e+=3;else if(t===mb.invokespecial){let t=Sb(n,r()),o=c(),s=c();if(!(t.className===`${fb}StringValue`&&t.name===`<init>`&&typeof o==`string`&&typeof s==`object`&&`className`in s))throw a();s.value={kind:`String`,value:o,location:i},e+=3}else if(t===mb.areturn){let e=c();if(typeof e!=`object`)throw a();if(`className`in e){if(!e.value)throw a();return e.value}return e}else throw a()}throw a()},wb=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=xb(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:Cb(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)}))}},Tb=A(`EOF`),Eb=A(`IDENTIFIER`),Db=A(`DEFBREAK`),Ob=(e,t)=>Array.from({length:A(t)-A(e)+1},(t,n)=>A(e)+n),kb=new Set(Ob(`op_57`,`op_119`)),Ab=new Set(Ob(`op_1`,`op_119`)),jb=new Set(Ob(`op_57`,`op_70`)),Mb=/* @__PURE__ */ new Set([...Ob(`ACTION`,`EXCEPT`),A(`EXTENDS`),...Ob(`IF`,`SF`),A(`STATE`),...Ob(`THEN`,`WITH`),A(`US`),...Ob(`op_112`,`op_116`)]),Nb=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),Pb=new Map([...Nb(`postfix`,160,160,!0,`[`),...Nb(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Nb(`prefix`,120,120,!1,`-.`),...Nb(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Nb(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Nb(`prefix`,40,40,!0,`\\lnot`),...Nb(`nfix`,100,130,!0,`\\times`),...Nb(`infix`,140,140,!1,`^`,`^^`),...Nb(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Nb(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Nb(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Nb(`infix`,100,110,!0,`|`,`||`,`%%`),...Nb(`infix`,100,110,!1,`%`),...Nb(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Nb(`infix`,90,140,!1,`\\wr`),...Nb(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Nb(`infix`,90,130,!1,`!!`),...Nb(`infix`,90,90,!1,`...`,`..`),...Nb(`infix`,80,80,!0,`\\intersect`,`\\union`),...Nb(`infix`,80,80,!1,`\\`),...Nb(`infix`,70,70,!1,`<:`,`:>`),...Nb(`infix`,60,60,!0,`@@`),...Nb(`infix`,50,140,!0,`\\cdot`),...Nb(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Nb(`infix`,30,30,!0,`\\land`,`\\lor`),...Nb(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Nb(`infix`,10,10,!1,`=>`)]),Fb=new Map([...Pb,...rp.flatMap(e=>e.slice(1).map(t=>[t,Pb.get(e[0])]))]),Ib=Fb.get(`[`),Lb={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Rb=e=>({type:`tokens`,kinds:new Set(e)}),zb=e=>typeof e==`string`?e.startsWith(`<`)?Rb([A(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(zb)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),Bb=e=>(...t)=>({type:e,body:G(...t)}),q=Bb(`zeroOrMore`),Vb=Bb(`oneOrMore`),J=Bb(`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}),Hb=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Ub=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Hb(e,n);return n},Wb=(...e)=>{let t=e.map(A);return e=>t.includes(Ub(e,1).kind)},Gb=(e,t=Ub(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Kb=e=>{let t=Ub(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},qb=e=>Wb(`CASESEP`)(e)&&Gb(e),Jb=e=>{let t=Ub(e,1);Mb.has(t.kind)&&(t.kind=Eb)},Yb=(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}`,Xb=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Zb=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Qb=e=>e.operatorStacks[e.operatorStacks.length-1],$b=(e,t)=>e.low>t.high,ex=(e,t)=>e.high<t.low,tx=e=>e.fix===`prefix`?e:Fb.get(`${e.name}.`),nx=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Ib?Xb(`FcnAppl`,[n,...r.node.heirs]):Xb(`PostfixExpr`,[n,r.node]),operator:void 0})},rx=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Xb(`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:Xb(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},ix=e=>{let t=Qb(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 nx(t,n),ix(e);if(i.operator!==void 0){let t=tx(r.operator);return t!==void 0&&$b(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Yb(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 ${Yb(e,a.node.first,a.node.last)} and expression at location ${Yb(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return ex(a.operator,r.operator)?void 0:$b(a.operator,r.operator)?(rx(t,a.operator),ix(e)):`Precedence conflict between ops ${a.operator.name} in block ${Yb(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=tx(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(ex(s,r.operator))return;if(!$b(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Yb(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return rx(t,s),ix(e);let c=Yb(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===Lb?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},ax=e=>Y(t=>{let n=Qb(t),r=Zb(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:ix(t)}),ox=ax(()=>!1),sx=ax(()=>!0),cx=Y(e=>{e.lastOperator=Fb.get(e.token.image)}),lx=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},ux=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?lx(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},dx=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Gb(e,n.first.beginColumn))return n;let t=dx(e,n);if(t!==void 0)return t}},fx=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(A),n=(e,...t)=>t.some(t=>e.kind===A(t)),r=e=>e!==void 0&&kb.has(e.kind),i=e.token,a=Hb(e,i);i.next=void 0;let o=Hb(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===Eb&&(e=e.next)}else if(e.kind===Eb){let t=e.next;!r(t)||jb.has(t.kind)||Ab.has(t.kind)&&t.next?.kind!==Eb||(e=t.next?.kind===A(`SUBSTITUTE`)?i:Ab.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Db&&(e.next={kind:Db,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Hb(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},px=e=>{let t=Ub(e,1);if(t.kind===A(`LAB`)){let n=1;for(;n!==0;)if(t=Hb(e,t),t.kind===A(`LAB`)&&n++,t.kind===A(`RAB`)&&n--,t.kind===Tb)return!1;return Hb(e,t).kind===A(`IN`)}if(t.kind!==Eb)return!1;for(t=Hb(e,t);t.kind===A(`COMMA`);){if(t=Hb(e,t),t.kind!==Eb)return!1;t=Hb(e,t)}return t.kind===A(`IN`)},mx=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),hx=e=>e.proofLevels.at(-1)??-1,gx=e=>{let t=Ub(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Wb(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||hx(e)>=0&&mx(t)>hx(e):Wb(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},_x=(e,t)=>{let n=mx(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},vx=e=>Y(t=>_x(t,t.token)?void 0:`${Yb(t,t.token)}: ${e}`),yx=Rb([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(A)),bx=Rb([...yx.kinds,A(`op_76`)]),xx=Rb(Ab),Sx=Rb(jb),Cx=Rb([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(A)),wx=()=>q(Z({expansion:[K(yx,`<op_77>`)],semantic:Gb}),K(`PrefixOp`,`InfixOp`),sx),Tx=()=>K(G(Z({expansion:[`OpenStart`],semantic:Gb}),`OpenExpression`,ox),G(Z({semantic:Gb}),`ExtendableExpr`)),Ex=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),Dx=()=>K(G(Z({semantic:e=>Wb(`ASSUME`,`BOXASSUME`)(e)||Ub(e,2).kind===A(`COLONCOLON`)&&[A(`ASSUME`),A(`BOXASSUME`)].includes(Ub(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Ox=()=>[`JuncItem`,q(Z({semantic:Kb}),`JuncItem`)],kx=e=>Y(t=>{t.expecting=e,Jb(t)}),Ax=e=>Y(t=>{t.isTerminalProof=e}),jx=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{fx(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),Mx={CompilationUnit:Q(void 0,[Y(fx),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>`),kx(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,kx(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,kx(`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(fx)),G(Z({semantic:e=>Wb(`USE`)(e)&&Ub(e,2).kind!==A(`ONLY`)||Wb(`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(jx(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),jx(`Expression`,Z({expansion:[`<IDENTIFIER>`,Sx]}),`PostfixLHS`,`Expression`),jx(`Expression`,Z({expansion:[`<IDENTIFIER>`,xx]}),`InfixLHS`,`Expression`),jx(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),jx(`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`,[bx,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,xx,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,Sx]),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>`,kx(`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,[yx,cx]),NonExpPrefixOp:Q(void 0,[bx,cx]),InfixOp:Q(`Infix Op`,[xx,cx]),PostfixOp:Q(void 0,[Sx,cx]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{fx(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),Dx(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),Dx(),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=Zb(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Yb(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(fx),K(G(Z({amount:3}),Z({semantic:Wb(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:gx}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>Wb(`BY`)(e)||Ub(e,2).kind===A(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>Ub(e,2).kind!==A(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,Ax(!0),J(`<ONLY>`)),G(`<USE>`,Ax(!1),J(`<ONLY>`)),G(`<HIDE>`,Ax(!1))),X("an expression, `MODULE' or `DEF'"),J(Ex(),q(`<COMMA>`,X(`MODULE or expression`),Ex(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Ex(),q(`<COMMA>`,X(`MODULE or expression`),Ex(),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`),Cx,vx(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:gx}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),Cx,vx(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:Wb(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:Wb(`INSTANCE`)}),`Instantiation`),G(Z({semantic:Wb(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:gx}),Y(e=>{let t=Zb(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Yb(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),Vb(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:Wb(`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(bx,xx,Sx),Rb([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(A))],semantic:Gb}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Yb(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:Gb}),`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:px}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),Vb(`<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=Zb(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`)),Vb(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:px}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>Ub(e,2).kind===A(`MAPTO`)&&Mb.has(Ub(e,1).kind)}),Y(e=>{Ub(e,1).kind=Eb}),`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=Xb(`FcnAppl`,t.heirs),e.lastOperator=Ib})),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>`,Vb(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(Jb),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===A(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>qb(e)&&Ub(e,2).kind!==A(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:qb}),`<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`,[Vb(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=Ub(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...Ox()),G(Z({expansion:[`<AND>`]}),...Ox())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=dx(t,e.heirs[1]);return n&&`Item at ${Yb(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Yb(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([])}),wx(),Tx()],(e,t)=>{let n=Qb(t);n.push({node:e.heirs[0],operator:Lb});let r=ix(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`),ox,q(K(G(Z({expansion:[`PostfixOp`],semantic:Gb}),`PostfixOp`,sx),G(Z({expansion:[`<DOT>`],semantic:Gb}),`<DOT>`,Y(Jb),Z({semantic:Gb}),`Identifier`,Y(e=>{let t=Qb(e);t[t.length-1].operator!==void 0&&nx(t,t.length),t[t.length-1]={node:Xb(`RecordComponent`,[t[t.length-1].node,Zb(e,2),Zb(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:Gb}),X(`function argument`),`SBracketCases`,ax(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:Gb}),`InfixOp`,sx,wx(),Tx()),G(Z({expansion:[`<COLONCOLON>`],semantic:Gb}),`<COLONCOLON>`,Y(e=>{let t=Qb(e);if(!ux(t[t.length-1].node))return`\`::' at ${Yb(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=Qb(e),n=Zb(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!ex(r,e.lastOperator)){let t=Zb(e,3);return`Removing label at ${Yb(e,t.first,t.last)} would change expression parsing.`}t.push({node:Xb(`Label`,[Zb(e,3),Zb(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:Gb}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:Gb}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>hx(e)<0&&e.proofLevels.length<=1?`${Yb(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Yb(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:lx(e.heirs)===void 0?e.heirs.length===1?Xb(`GeneralId`,e.heirs):void 0:Xb(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>Ub(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=>Ub(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Yb(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Nx=/* @__PURE__ */ new Map,Px=e=>{let t=Nx.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Px(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,Px(Mx[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 Nx.set(e,n),n},Fx=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Ix=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Hb(e,e.scanPosition)),e.scanPosition=Hb(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`},Lx=(e,t)=>{if(t.type===`tokens`)return Ix(e,t.kinds);if(t.type===`call`)return Lx(e,Mx[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Fx(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=Lx(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||Fx(e,t.semantic)?Lx(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Lx(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=Lx(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Rx=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Lx(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},zx=(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||Px(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Px(a).hasSemanticStart?Px(a).first.has(Ub(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Rx(e,i,a)&&(o===void 0||o(e))}),Bx=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,Lx(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Hb(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Tb){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Hb(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${$e(e.token.image)}" `},Vx=(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??Bx(e)}\n\nResidual stack trace follows:\n${r}`,!1},Hx=(e,t)=>{let n=Hb(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,Vx(e))},Ux=(e,t)=>{let n=Mx[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Ub(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Wx(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 Vx(e,i);let a=r.node??(r.heirs.length===0?void 0:Xb(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Wx=(e,t)=>{if(t.type===`tokens`)return Hx(e,t.kinds);if(t.type===`call`)return Ux(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Vx(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Vx(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Wx(e,t));if(t.type===`choice`){let n=zx(e,t.alternatives);return n===-1?Vx(e):Wx(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Wx(e,t.body))return!1;if(t.type===`optional`)return zx(e,[t.body])===-1||Wx(e,t.body);for(;zx(e,[t.body])===0;)if(!Wx(e,t.body))return!1;return!0},Gx=e=>{let t=Ze(e),n={kind:Tb,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:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Wx(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
|
|
1783
|
-
`)},
|
|
1784
|
-
`,set:``},
|
|
1781
|
+
`]]),Qp=(e=`master`)=>e===`1.7.4`?Zp:Xp,$p=(e,t)=>e.every(e=>Ki(e,t)),em=qr([!1,!0]);Hr(em);const tm=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Qr(tm(e,t,r),tm(e,r,n))},nm=[`\\cup`,`\\cap`,`\\`],rm=e=>typeof e==`object`&&e.kind===`MixedSet`,im=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,am=(e,t,n)=>{t.kind===`Interval`&&Ii(t);let r=t.kind===`Interval`?t:Vr(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return cn(r,e=>{Ki(e,n)===i&&on(a,e)}),im(t)?rr(a):Jr(a)}if(Ni(t))return n;if(!un(n))return dr({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return cn(r,e=>on(i,e)),cn(n.kind===`Interval`?n:F(n).elements,e=>{Ki(e,t)||on(i,e)}),Jr(i)},om=(e,t)=>{let n=(t,n)=>ds([Ns(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},sm=[ps(`TRUE`,!0),ps(`FALSE`,!1),ps(`BOOLEAN`,em),ps(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),gs(`=`,Wr),gs(`#`,(e,t)=>!Wr(e,t)),z(`~`,1,e=>!ds(e,0,`~`)),z(`<=>`,2,e=>ds(e,0,`<=>`)===ds(e,1,`<=>`)),om(`/\\`,(e,t)=>e&&t()),om(`\\/`,(e,t)=>e||t()),om(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>Ki(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Ki(R(e,0,`\\notin`),R(e,1,`\\notin`))),gs(`\\subseteq`,(e,t)=>{if(!ln(e))throw new w(`\\subseteq expects a set but received ${L(e)}`);if(typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&P(e.base))return $p(F(e.base).elements,t.base);if(typeof e==`object`&&e.kind===`Interval`){if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;for(let n=e.low;n<=e.high;n++)if(!Ki(n,t))return!1;return!0}return!Di(e,e=>!Ki(e,t))}),...nm.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(un(n)&&un(r)&&!rm(n)&&!rm(r)&&!i&&!sn(n)&&!sn(r)){if(e===`\\cup`&&Ni(n))return r;let t=e===`\\cup`?Qr:e===`\\cap`?Zr:Xr;return Wi((n,r)=>{let i=F(n),a=F(r),o=t(i,a);if(e===`\\cup`){let e=Vr(i),t=Xr(a,i).elements,n=e===i.elements&&(t.length===0||Zn(e[e.length-1],t[0])<0);if(e.length+t.length>rn())throw new u(an());if(n&&!i.isNormalized)return o;let r=o===i?nr(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=im(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>Ki(e,o)))),o},(t,n)=>am(e,t,n),n,r)}return un(n)?am(e,n,r):e!==`\\`&&un(r)?am(e,r,n):dr({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=R(e,0,`UNION`),n=pn(t)?Vr(t):[],r=n.filter(pn);if(!pn(t)||r.length!==n.length)return dr({kind:`Union`,base:t});let i=r.flatMap(Vr),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{Ki(t,e)||on(e.elements,t)}),Jr(e.elements)};return rm(t)||r.some(rm)?a():r.length===0?Yr:Wi(e=>Bi(tm(e,0,e.length),i),a,r.map(F),void 0)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!dn(t))throw new w(`DOMAIN expects a function but received ${L(t)}`);return da(t)})],cm=Os(`Integers`,`Neg`,`IntValue`,1),lm=e=>{let n=Os(e,`DotDot`,`IntervalValue`,2);return[ks(e,`+`,`Plus`,(e,t)=>e+t),ks(e,`-`,`Minus`,(e,t)=>e-t),ks(e,`*`,`Times`,(e,t)=>e*t),ks(e,`^`,`Expt`,(e,n)=>{if(n<0)throw new t(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(e===0&&n===0)throw new t(`0^0 is undefined.`);return e**n}),ks(e,`\\div`,`Divide`,(e,n)=>{if(n===0)throw new t(`The second argument of \\div is 0.`);let r=Math.floor(e/n);if(_s(r))throw vs(`${e} \\div ${n}`);return r}),ks(e,`%`,`Mod`,(e,n)=>{if(n<=0)throw new t(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(e%n+n)%n}),z(`..`,2,e=>{let t=R(e,0,`..`),r=Ds(R(e,1,`..`),n);return{kind:`Interval`,low:Ds(t,n),high:r}})]},um=lm(`Naturals`),dm=lm(`Integers`),fm=e=>{let t=um.indexOf(e);return t===-1?void 0:dm[t]},pm=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[Es(js(`<`,(e,t)=>e<t),t(`LT`)),Es(js(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),Es(js(`<=`,(e,t)=>e<=t),t(`LE`)),Es(js(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},mm=[ps(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...um,...pm(`Naturals`)],hm=[ps(`Int`,{kind:`InfiniteSet`,name:`Int`}),...dm,...pm(`Integers`),z(`-.`,1,e=>{let t=Ds(R(e,0,`-`),cm);if(_s(-t))throw vs(`-${t}`);return-t})],gm=(e,n,r)=>{let i=R(e,n,r),a=Vi(i);if(!a)throw new t(`${r}\n${L(i)}`);return a},_m=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:gm(e,t,n)},vm=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw cs(n,`SubSeq`,`natural number`,r);return r},ym=(e,t,n)=>typeof e==`string`?Vn(e.slice(t,n)):ui(e.slice(t,n)),bm=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,xm=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Sm=(e,t)=>{let n=lc.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Es(e,t):e}):t},Cm=e=>Sm(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>_m(e,0,bm(``,`Len`)).length),z(`\\o`,2,e=>{let n=_m(e,0,xm(`s \\o t`,`sequence`));if(typeof n!=`string`){let t=gm(e,1,xm(`t \\o s`,`sequence`));return ui([...n,...t])}let r=R(e,1,`\\o`);if(typeof r!=`string`)throw new t(`${xm(`t \\o s`,`string`)}\n${L(r)}`);return Vn(n+r)}),z(`Append`,2,t=>ui([...gm(t,0,xm(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let n=gm(e,0,bm(``,`Head`));if(n.length===0)throw new t(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,e=>{let n=_m(e,0,bm(``,`Tail`));if(n.length===0)throw new t(`Attempted to apply Tail to the empty sequence.`);return ym(n,1)}),z(`SubSeq`,3,e=>{let n=_m(e,0,bm(`first `,`SubSeq`)),r=vm(e,1,`second`),i=vm(e,2,`third`);if(r>i)return ym(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new t(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(e,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return ym(n,r-1,i)}),ms(`SelectSeq`,2,e=>{let n=fs(e,1,`SelectSeq`);return ui(gm(e,0,bm(`first `,`SelectSeq`)).filter(e=>{let r=n.call([e]);if(typeof r!=`boolean`)throw new t(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),wm=e=>Sm(`FiniteSets`,[z(`IsFiniteSet`,1,e=>Ri(R(e,0,`IsFiniteSet`))),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!ln(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new t(`Attempted to compute cardinality of the value\n${L(r)}`);return Ii(r,e)})]),Tm=[Es(z(`Warshall`,1,e=>{let n=R(e,0,`Warshall`);if(!ln(n)||Wn(n))throw new t(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${L(n)}`);Ii(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=Aa(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=F(n).elements.map(e=>{let n=Vi(e);if(n?.length!==2)throw new t(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${L(e)}`);return[a(n[0]),a(n[1])]}),s=r.map(()=>r.map(()=>!1));o.forEach(e=>{s[e[0]][e[1]]=!0});for(let e=0;e<r.length;e++)for(let t=0;t<r.length;t++)if(s[t][e])for(let n=0;n<r.length;n++)s[e][n]&&(s[t][n]=!0);return Jr(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[ui([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],Em=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return Tm;if(e===`AnySet`)return[ps(`ANY`,Jn)];if(e===`IOUtils`)return qf(r,a);if(e===`_TLCTrace`)return Xf(r);if(!Qp(n.version).has(e))return;let o=km(e,t,n,r,i);return e===`Randomization`&&o?[...o,xp(n)]:o},Dm=/* @__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`]]]),Om=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),km=(e,t,n,r,i)=>{switch(e){case`Naturals`:return mm;case`Integers`:return hm;case`Sequences`:return Cm(n.version);case`FiniteSets`:return wm(n.version);case`TLC`:return Sm(`TLC`,Jp(t,n));case`Randomization`:return Sp(n);case`_Possible`:return Ip(t,n);case`Json`:return Kf(r);case`Bags`:return Sm(`Bags`,_f(i));case`TLCExt`:return Sm(`TLCExt`,Fp(t,n));default:return}},Am=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&Ul.get(t)||[];r.expressions.push(...i,t);let a=Ui.sets,o=a??[],s=o.length;Ui.sets=o;try{return n()}catch(e){throw iv(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Ui.sets=a}},jm=(e,t,n)=>e.coverage?Vo(e.coverage,t,n):-1,Mm=(e,t,n)=>e.coverage?Uo(e.coverage,t,n):n(),Nm=(e,t,n,r)=>Mm(e,t,()=>W(n,r)),Pm=(e,t,n,r)=>{let i=Nm(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},Fm=(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},Im=e=>!e.includes(void 0),Lm=e=>e.variables.map(()=>void 0),Rm=(e,t,n)=>{let r=[...e];return r[t]=n,r},zm=(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}},Bm=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,Vm=e=>e.kind===`Identifier`?e.name:void 0,Hm=(e,t,n)=>{if(t.kind===`Label`)return Hm(e,t.body,n);let r=Vm(t);if(r===void 0)return;let i=Hg(n,r);if(i?.kind===`Thunk`)return Hm(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=M_(r,e);return o?.kind===`Closure`&&o.params.length===0?Hm(e,o.body,o.scope):void 0},Um=(e,t,n)=>{if(t.kind===`Prime`)return Hm(e,t.expression,n);if(t.kind===`Label`)return Um(e,t.body,n);let r=Vm(t);if(r===void 0)return;let i=Hg(n,r);if(i?.kind===`Thunk`)return Um(e,i.expression,i.scope);if(i)return;let a=M_(r,e);return a?.kind===`Closure`&&a.params.length===0?Um(e,a.body,a.scope):void 0},Wm=e=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean expression.`);return e},Gm=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Km=(e,t,n,r)=>{let i=Jm(e,t,n,r);return i&&e.coverage&&!e.isInit&&Ho(e.coverage,r),i},qm=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Ho(r,n),Ho(r,r.roots[n])),e.onState(t),!0},Jm=(e,t,n,r)=>t===void 0?Im(n)?qm(e,n,r):(e.onIncomplete?.(n),!1):Im(n)&&Gm(e)?Xm(e,t,n,r):t.kind===`Predicate`?Zm(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?ph(e,t.expression,t.rest,t.scope,n,t.node):Ym(e,t,n)&&Km(e,t.rest,n,t.node),Ym=(e,t,n)=>{let r=e.environment,i=Nm(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return Nm(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Vg(t,r.runtime.version):t}})();try{return!Wr(i,a)}catch(t){throw e.callStack&&iv(e.callStack,[i],t),t}},Xm=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return ph(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?Ym(e,i,n):Wm(Nm(e,i.node,i.expression,Fm(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return qm(e,n,r)},Zm=(e,t,n,r,i,a)=>Qm(e,t,n,r,i,jm(e,a,t)),Qm=(e,t,n,r,i,a)=>Am(e,t,()=>{switch(t.kind){case`Let`:{let o=Fm(e,r,i),s=t.definitions,c=e.coverage?Y_(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):Y_(s,o);return Zm(e,t.body,n,c,i,a)}case`Label`:return Zm(e,t.body,n,r,i,a);default:if(sh.has(t.kind))throw new w(`The state relation is not a boolean expression.`);return Am(e,t,()=>dh(e,t,n,r,i,a))}}),$m=(e,t,n,r,i)=>Wm(t)&&Km(e,n,r,i),eh=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),th=(e,t,n,r,i,a)=>{let o=Fm(e,r,i);if(t.kind===`Identifier`){let s=Hg(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return Zm(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return Zm(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:M_(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&Kd(c,e.environment))?Zm(e,l.body,n,l.scope,i,a):$m(e,Pm(e,a,t,o),n,i,a)}let s=N_(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Mm(e,a,()=>G_(s,t.args,o));return Zm(e,s.body,n,r,i,a)}let c=eh.has(t.operator)?Nm(e,a,t,o):Pm(e,a,t,o);return $m(e,c,n,i,a)},nh=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?Km(e,t,Rm(n,r,i),a):Wr(o,i)&&Km(e,t,n,a)},rh=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),ih=(e,t,n)=>(e.coverage&&Wo(e.coverage,t,n.length+1),n),ah=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?Hm(e.environment,o,r):Um(e.environment,o,r),l=Fm(e,r,i);if(c===void 0)return Nm(e,a,t,l)===!0&&Km(e,n,i,a);let u=Nm(e,a,s,l),d=i[c];if(t.operator===`=`)return nh(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&e.callStack?.sources.set(f,s),d!==void 0)return Nm(e,a,t,l)===!0&&Km(e,n,i,a);if(!pi(f))throw new w(`The right side of \\IN is not enumerable.`);return ih(e,f,Oi(f)).reduce((t,r)=>Km(e,n,Rm(i,c,r),a)||t,!1)},oh=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),sh=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),ch={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},lh=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:ch[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${U(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${U(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${U(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`},uh=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Mm(e,r,()=>c_(t.bounds,t=>{let r=W(t,n),i=a_(r,t,a);return Array.isArray(i)&&ih(e,r,i),i}));return u_(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},dh=(e,t,n,r,i,a)=>{let o=Fm(e,r,i);switch(t.kind){case`Identifier`:return th(e,t,n,r,i,a);case`Apply`:return oh.has(t.operator)&&t.args.length===2?ah(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?Wm(Nm(e,a,t.args[0],o))?Zm(e,t.args[1],n,r,i,a):Km(e,n,i,a):th(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>rh(`Predicate`,t,r,a,e),n);return Zm(e,o[0],t,r,i,a)}let s=o[o.length-1];return Qm(e,zm(t,o.length-1),rh(`Predicate`,s,r,a,n),r,i,Bm(e,a))}case`Or`:{let o=t.operands;if(t.isBulleted||o.length===2)return o.reduce((t,o)=>Zm(e,o,n,r,i,a)||t,!1);let s=Qm(e,zm(t,o.length-1),n,r,i,Bm(e,a)),c=Zm(e,o[o.length-1],n,r,i,a);return s||c}case`Exists`:return uh(e,t,o,a).reduce((r,o)=>Zm(e,t.body,n,o,i,a)||r,!1);case`Forall`:{let r=uh(e,t,o,a);if(r.length===0)return Km(e,n,i,a);let s=r.slice(1).reduce((e,n)=>rh(`Predicate`,t.body,n,a,e),n);return Zm(e,t.body,s,r[0],i,a)}case`If`:return Zm(e,Wm(Nm(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>Wm(Nm(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new w(`TLC encountered a CASE with no conditions true.`);return Zm(e,s,n,r,i,a)}case`FunctionApplication`:{let r=g_(Nm(e,a,t.function,e.isInit?o:Kg(o)));if(r){let s=Mm(e,a,()=>__(r,t,o));return Zm(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return ph(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=Zm(e,t.action,n,r,i,a);return ph(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return Zm(e,t.action,rh(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?lh(t):void 0;if(s!==void 0)throw new w(s);return $m(e,Nm(e,a,t,o),n,i,a)},fh=(e,t,n)=>e.runtime.warn(St.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${U(n)}`),ph=(e,t,n,r,i,a)=>Am(e,t,()=>{let o=jm(e,a,t),s=Hm(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!Wr(a,r)?(fh(e.environment,s,t),!1):nh(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return Km(e,n,i,o);let c=s.reduceRight((e,t)=>rh(`Unchanged`,t,r,o,e),n);return ph(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=Hg(r,t.name);if(a?.kind===`Thunk`)return ph(e,a.expression,n,a.scope,i,o);let s=a?void 0:M_(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return ph(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Fm(e,r,i),s=N_(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return ph(e,s.body,n,G_(s,t.args,a),i,o)}let c=e.environment,l=Nm(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=Nm(e,o,t,{environment:c,scope:r,state:i,next:void 0});return Wr(l,u)&&Km(e,n,i,o)}),mh=(e,t,n,r,i)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i}),hh=/* @__PURE__ */ Error(`The replay found a successor`),gh=(e,t,n,r)=>{let i=mh(r,`enabled`,n,()=>{throw hh}),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=rh(`Changed`,e.subscript,t,-1,void 0);Zm(i,e.action,n,t,Lm(r),-1)}else Zm(i,e,void 0,t,Lm(r),-1);return!1}catch(e){if(e!==hh)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},_h=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=mh(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>rh(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);Zm(o,i.expression,s,i.scope,Lm(t),i.node??-1)},vh=(e,t,n,r)=>{e.some(e=>sh.has(e.expression.kind))||e.forEach(e=>{let i=[];yh(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},yh=(e,t,n,r,i,a)=>{let o=mh(r,`next`,n,i,a);Zm(o,e.expression,void 0,e.scope,Lm(r),t)},bh=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(Hm(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=Hg(r,e.name)?void 0:M_(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,Y_(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){Um(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=Hg(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?N_(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:M_(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,G_(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},xh=/* @__PURE__ */ new WeakMap,Sh=/* @__PURE__ */ new WeakMap,Ch=(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},wh=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Th=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Eh=(e,t)=>{let n=new w(t);return e.isInit?n:x(n,S.error)},Dh=(e,t,n,r)=>{let i=jg(n);return r&&sh.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 ${Th(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},Oh=(e,t,n)=>{let r=ws(t),i=U(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 ${Th(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1782
|
+
`:``}${i}`},kh=(e,t,n)=>Mh(e,t,W(t,n)),Ah=new Set(sm.map(e=>e.name)),jh=e=>e.kind===`Apply`?Ah.has(e.operator):e.kind!==`Identifier`&&!sh.has(e.kind),Mh=(e,t,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=Dh(e,r,t,i);throw e.isInit&&i&&jh(t)?new n(a):Eh(e,a)},Nh=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=dv(n,r.environment))(r),Ph=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Fh=(e,t,n)=>{let r=n?xh:Sh,i=r.get(e);if(i)return i;let a=hg(e,t,n),o=n?void 0:mg(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},Ih=(e,t)=>{if(t.constants.has(e))return;let n=$g(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Lh=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Lh(e.expression,t,!1,r);if(e.kind!==`Identifier`||M(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Ih(e.name,t);if(a&&!r.has(a))return r.add(a),Lh(a.body,t,n,r)},Rh=(e,t,n)=>Lh(e,t,!n),zh=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return zh(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Y_(e.definitions,Ch(r,t,n));return zh(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Hg(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return zh(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=Ih(e.name,r.environment);if(s)return zh(s.body,void 0,n,r,i)},Bh=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||M(e))||!t&&e.kind===`Prime`,Vh=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Vh(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[{index:r,expression:e}];let i=Ih(e.name,t);if(i)return n.add(e.name),Vh(i.body,t,n)},Hh=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Uh=(e,t,n)=>Hh.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Ph(e.operator)&&(Bh(e.args[0],n)||Rh(e.args[0],t,n)!==void 0)||M(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Wh=/* @__PURE__ */ new Set,Gh=(e,t)=>{if(M(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return Ql(e,(e,i)=>{let a=r?Gh(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},Kh=(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||M(e)?void 0:$g(r,t);return i&&!n.has(i)&&(n.add(i),Kh(i.body,t,n))?!0:mt(e).some(e=>Kh(e,t,n))},qh=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Rh(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=Vh(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return Uh(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Fh(e,t,n)}},Jh=(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($d(e,t)===void 0||Kh(e,t,/* @__PURE__ */ new Set))return!0;let n=Gh(e,Wh);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)}},Yh=(e,t,n)=>{let r=e.map(e=>qh(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Gm(t);for(let s=e;s<r.length;s++){if(s>0&&f&&_g(u)){d??=Ch(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!Wr(t,i[e.index])}):void 0;if(o){fh(t.environment,o.index,o.expression);return}let s=n.expression,c=Nh(a,e,s,d);if(!Mh(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Ch(t,n,u);let r=Nh(i,s,e.expression,d);if(!Mh(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Ch(t,n,u);let r=Nh(i,s,e.value,d),a=u[e.index];if(a===void 0)u=wh(u,e.index,r),d=void 0;else if(!Wr(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!Wr(e,n[i.index])){fh(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},Xh=e=>{let t=lh(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw Eh(n,t);kh(n,e,Ch(n,r,i))&&s(i,a)}},Zh=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Ch(r,i,a);if(a[l]!==void 0){kh(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!pi(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Th(r)}, the right side of \\IN is not enumerable.`;throw Eh(r,`${t}\n${U(e)}`)}let p=Oi(f);if(r.generator){for(let e of pp(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(wh(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(wh(a,l,p[e]),o)}},Qh=/* @__PURE__ */ new WeakMap,$h=e=>{let t=Qh.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map($h),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Qh.set(e,n),n},eg=(e,t)=>{let n=e.args[0],r=Xh(e),i=(e,r,i)=>zh(n,r,i,e,!t)??-1,a=Zh(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],Ch(t,n,o));l(wh(o,u,d),s)}},tg=(e,t,n)=>{let r=U(e);return(i,a,o,s,c,l)=>{let u=Ch(i,a,o),d=W(e.function,n?u:Kg(u)),f=g_(d);if(f!==void 0){Fh(f.body,t,n)(i,__(f,e,u),o,s,c,l);return}if(!dn(d))throw Eh(i,`In computing ${Th(i)}, a non-function (${ws(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw Eh(i,`In computing ${Th(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},ng=(e,t)=>{let n=$h(e);return Vh(e,t)?Yh([n],t,!1):e.kind===`Tuple`?Fh(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Hg(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Fh($h(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=Ch(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=N_(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Fh($h(n.body),t,!1)(r,G_(n,e.args,u),a,o,s,c);return}}kh(r,n,u)&&c(a,o)}},rg=(e,t,n)=>{let r=e.operator,i=Xh(e),a=M(e)?void 0:M_(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=gv(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=Fh(a.body,t,n),o(e,i(Ch(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Ch(a,o,s),f=N_(e,d);f?.kind===`Closure`?Fh(f.body,t,n)(a,G_(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},ig=(e,t,n)=>{let r=Xh(e),i=M(e)?void 0:Ih(e.name,t),a;return(o,s,c,l,u,d)=>{let f=Hg(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Fh(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&D_(i,t)!==void 0?r(o,s,c,l,u,d):(a??=Fh(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},ag=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||M(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!M(i))return;let a=Lh(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},og=e=>e.kind===`And`?e.operands.flatMap(og):[e],sg=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Uh(e,t,!1),cg=e=>{let t=[];return(n,r,i)=>{let a=Ch(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Mh(n,i,Nh(t,r,i,a)))return}}},lg=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=og(e),r=n.findIndex(e=>!sg(e,t)||ag(e,t)),i=r===-1?void 0:ag(n[r],t);return i?{...i,before:r===0?void 0:cg(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>lg(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===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,before:void 0}}if(e.kind!==`Apply`||M(e))return;let r=M_(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=lg(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`||!M(o))return;let s=i.before,c=s&&gv(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Ch(e,t,n)),n))}},ug=(e,t,n)=>{let r=Hg(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},dg=(e,t,n)=>{let r=e.map(e=>Fh(e,t,n)),i=n?[]:e.map(e=>lg(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:void 0);return(e,t,n,i,s,c)=>{let l=a&&ug(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},fg=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=rp(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},pg=(e,t)=>{let n=Fh(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=Ch(r,i,a),u=t.runtime.version,d=c_(e.bounds,e=>W(e,l)).map((n,r)=>pp(r_(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,Wg(i,l,e)))};f(d.length-1,i)}},mg=(e,t)=>{if(e.kind===`Exists`)return pg(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Fh(e,t,!1));return e.isBulleted?fg(n):n.reduce((e,t)=>fg([e,t]))},hg=(e,t,n)=>{let r=e=>Fh(e,t,n);switch(e.kind){case`And`:return Yh(e.operands,t,n);case`Or`:return dg(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=r_(W(a.set,Ch(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,Ug(r,e,u[t]),o,s,c,l)}}let o=n?void 0:Jh(e,t);if(o){let r=Yh(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=Ch(n,i,a),d=c_(e.bounds,e=>r_(W(e,u),e,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=Ug(t,o.names[e],r);if(e===d.length-1){let e=Ch(n,i,a);if(!o.guards.every(t=>kh(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{d_(e.bounds,Ch(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&$d(e,t)!==void 0&&!Kh(e.body,t,/* @__PURE__ */ new Set)?Gh(e,Wh):void 0;return(t,n,r,o,s,c)=>{let l=[];d_(e.bounds,Ch(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Hg(n,e)?.kind===`Value`)){u.every(n=>kh(t,e.body,Ch(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&_g(r)?u.slice(n).every(n=>kh(t,e.body,Ch(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,Ch(r,i,a));if(typeof l!=`boolean`)throw Eh(r,Oh(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=Ch(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw Eh(r,`In computing ${Th(r)}, a non-boolean expression${r.isEnabled?``:` `}(${ws(t)}) was used as a guard condition of a CASE.\n${jg(e.source)}`)})?.body??n;if(!u)throw Eh(r,`In computing ${Th(r)}, TLC encountered a CASE with no conditions true.\n${U(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Z_(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Y_(e.definitions,Ch(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new w(`UNCHANGED appears in an initial predicate at ${Og(e)}`)}:ng(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return kh(e,i,Ch(e,n,r))}catch(n){throw e.isEnabled?Vg(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 dg([e.action,$h(e.subscript)],t,n);case`Label`:return r(e.body);case`Identifier`:return ig(e,t,n);case`FunctionApplication`:return tg(e,t,n);case`Apply`:{let i=e.args;if(Ph(e.operator)){let r=Rh(i[0],t,n);if(r!==void 0)return e.operator===`=`?Yh([e],t,n):Zh(e,()=>r);if(Bh(i[0],n))return eg(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=W(i[0],Ch(n,r,a));if(typeof l!=`boolean`){let t=ws(l),r=U(e);throw Eh(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return rg(e,t,n)}default:return Xh(e)}},gg=e=>e.variables.map(()=>void 0),_g=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},vg=(e,t)=>{let n=t.state;if(!n||!_g(n))throw new w(`ENABLED needs a complete state at ${Og(e)}`);let r=t.environment;if(r.callStack)return gh(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return Fh(e,r,!1)(i,t.scope,gg(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},yg=(e,t,n,i,a)=>{let o={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Fh(e,t,!0)(o,i,gg(t),void 0,!1,e=>{if(!o.isStopped){if(!_g(e)){if(a){o.isStopped=a([...e]);return}throw x(new r([...e]),S.error)}o.isStopped=n(e)}})},bg=(e,t,n)=>{let r=[];return yg(e,t,e=>(r.push(e),!1),n),r},xg=(e,t,n,r,i,a,o)=>{let s={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:a,successors:0,onUnsatisfied:o};return Fh(e,n,!1)(s,i,gg(n),void 0,!1,(e,t)=>{if(!s.isStopped){if(!_g(e)){let r=n.variables.filter((t,n)=>e[n]===void 0);throw new re(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}s.successors++,s.isStopped=r({state:e,action:t})}}),s.successors},Sg=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Fh(e,n,!1)(i,r,gg(n),void 0,!1,e=>{_g(e)||(i.isStopped=!0)}),i.isStopped},Cg=(e,t,n,r)=>{let i=[];return xg(e,t,n,e=>(i.push(e),!1),r),i},wg=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Tg=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Eg=e=>Tg.has(e.kind)||e.kind===`Apply`&&wg.has(e.operator),Dg=(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&&un(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Og=e=>`line ${e.location.line}, column ${e.location.column}`,U=e=>{let t=e.location.range;return t?g(t):Og(e)},kg={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Ag=(e,t)=>new w(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${U(t)}`),jg=e=>e.kind===`Number`?e.text??String(e.value):U(e),Mg=(e,t)=>new w(`A non-boolean expression (${ws(t)}) was used as the condition of an IF.\n${U(e)}`),Ng=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new w(`A non-boolean expression (${ws(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${jg(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new w(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${ws(n)}.\n${U({...e,location:{...e.location,range:{...r,end:i}}})}`)},Pg=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${N(L(n))}\n${U(e)}`,r=e=>`Attempted to apply function:\n${N(L(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!dn(i))throw new w(`Attempted to select field "${t}" from a non-record value ${N(L(i))}\n${U(e)}`);let a=sr(i);if(a===`tuple`)throw ra(t);return la(i.kind===`LazyFunction`?I(i):i,t,a===`record`?n:r)}},Fg=e=>e===`1.7.4`?(t,n)=>ea(t,n,e):void 0,Ig=e=>t=>{if(!dn(t))throw new w(`Attempted to apply the operator DOMAIN to a non-function\n(${ws(t)})\n${U(e)}`);return da(t)},Lg=(e,t)=>(n,r)=>{if(!ln(n)||Wn(n))throw new w(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${U(e)}`);return t.evaluateBinary?t.evaluateBinary(n,r):t.evaluate([n,r])},Rg=e=>x(new w(`TLC can't handle real numbers.\n${e.text}`),S.configParseError),zg=e=>x(new w(`TLC can't handle a number this big.\n${e.text??e.value}`),S.error),Bg=(e,t)=>new ie(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${U(t)}`,e),Vg=(e,t)=>e instanceof ie&&t!==`1.7.4`?new w(`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,Hg=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Ug=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Wg=(e,t,n)=>{if(t.kind===`Name`)return Ug(e,t.name,n);let r=Vi(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new w(`Argument mismatch in operator application.${e?g(e):``}`)}return t.names.reduce((e,t,n)=>Ug(e,t,r[n]),e)},Gg=(e,t)=>{if(dn(e))return e;throw new w(`A non-function (${ws(e)}) was applied as a function.\n${U(t)}`)},Kg=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},qg=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Jg=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Expected ${t} to be a boolean but found ${L(e)}`);return e},Yg=(e,t,n)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form P => Q when ${n} was\n${ws(e)}.\n${U(t)}`);return e},Xg=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to apply the operator ~ to a non-boolean\n(${ws(e)})\n${U(t)}`);return!e},Zg=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new w(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${U(n)}`);return e===t},Qg=(e,t)=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${jg(t)}`);return e},$g=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),e_=(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.`},t_=(e,t,n)=>{if(!ln(e)||Wn(e)){let r=L(e),i=n===`1.7.4`?void 0:e_(e,r);throw new w(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${jg(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${jg(t)}\n${i}`)}},n_=(e,t,n)=>(t_(e,t,n),typeof e==`object`&&e.kind===`Interval`?oi(e):bi(e)??Ei(e)),r_=(e,t,n)=>n===`1.7.4`?(t_(e,t,n),bi(e)??Oi(e)):n_(e,t,n),i_=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Ii(e),e},a_=(e,t,n)=>i_(e)??r_(e,t,n),o_=(e,t,n)=>i_(e)??n_(e,t,n),s_=(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},c_=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),l_=(e,t)=>c_(e,e=>a_(W(e,t),e,t.environment.runtime.version)),u_=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):s_(t[n],t=>i(n-1,Wg(a,e[n].pattern,t)));return i(e.length-1,n)},d_=(e,t,n)=>u_(e,l_(e,t),t.scope,n),f_=(e,t)=>{let n=c_(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},p_=(e,t,n)=>{if(e.length===1)return Wg(t,e[0].pattern,n);let r=Vi(n)??[];return e.reduce((e,t,n)=>Wg(e,t.pattern,r[n]),t)},m_=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,h_=e=>Object.assign(e.value,{lambda:e}),g_=e=>m_(e)?e.lambda:void 0,__=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:ui(i),o=(e,n,i)=>`In applying the function\n${N(L(r))},\nthe ${e} is:\n${N(L(n))}${i}.\n${U(t.function)}`,s=e.bounds;if(s.length===1){if(!Ki(a,r.domain))throw new w(o(`first argument`,a,`which is not in its domain`));return p_(s,e.scope,a)}let c=Vi(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0)throw new w(`Attempted to apply a function to an argument not in its domain.\n${U(t.function)}`);let u=()=>new w(`In applying the function\n${N(L(r))},\nthe argument list is:\n${N(L(a))}\nwhich does not match its formal parameter.\n`);if(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!Ki(n,l[t]))throw new w(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
1783
|
+
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Vi(n)?.length!==e.pattern.names.length)throw new w(o(r,n,`which does not match its formal parameter`))}),c.length>s.length)throw u();return p_(s,e.scope,a)},v_=(e,t)=>{if(t.location.range)return{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:jg(t)}},y_=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},b_=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},x_=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),S_=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),C_=(e,t)=>{let n=f_(e.bounds,t),r=b_(n,(n,r)=>W(e.body,qg(t,p_(e.bounds,Ug(void 0,e.name,r),n))),y_(v_(e.bounds,e.body),e.bounds,n),x_(e.bounds));h_({value:r,bounds:e.bounds,body:e.body,scope:Ug(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=C_(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?cr(i):i},w_=(e,t)=>{if(typeof t!=`object`||sr(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!un(t.domain))return t;try{let e=I(t);return ir(e.domain,e.range)}catch(e){if(e instanceof w)return t;throw e}},T_=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new w(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>C_(e,t):dv(S_(e),t):dv(e.body,t),E_=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=T_(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(qg(e,void 0)):e=>a[i]??r(qg(e,void 0));return t.definitionEvaluators.set(e,o),o},D_=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},O_=(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)||!qd(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>w_(e,T_(e,t)(i)));Hr(n),t.startupValues[r]=n}catch(e){if(!(e instanceof w)&&!b(e))throw e}}),k_=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&hr(e[n],t))}catch(e){if(e instanceof w)return!1;throw e}},A_=(e,t)=>{let n=e.cache;if(n!==void 0&&k_(t.state,e.state)&&k_(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?Uo(r,i,()=>W(e.expression,qg(t,e.scope))):W(e.expression,qg(t,e.scope));return(!e.isStreamed||Ai(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},j_=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),M_=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return M_(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?j_(r):t.builtins.get(e)},N_=(e,t)=>M(e)?P_(e.operator,t):M_(e.operator,t.environment)??P_(e.operator,t),P_=(e,t)=>{let n=Hg(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return M_(e,t.environment)},F_=e=>e.kind===`Closure`?e.params.length:e.arity,I_=(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:P_(n,t);if(!r)throw new w(`Expected an operator argument at ${Og(e)}`);return r},L_=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),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)=>Ug(e,n.name,t[r]),e.scope);return W(e.body,qg(n,r))},R_=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:F_(e),call:n=>L_(e,n,t)},z_=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=P_(e.name,t);return n!==void 0&&F_(n)>0},B_=(e,t)=>e.map(e=>z_(e,t)?R_(I_(e,t),t):W(e,t)),V_=(e,t)=>new w(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),H_=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),U_=(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 U_(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([])}},W_=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&hn(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=H_(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=M(e)?void 0:U_(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=Hg(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:H_(e,t)}}return t=>H_(e,t)},G_=(e,t,n,r)=>{if(t.length!==e.params.length)throw V_(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:I_(t[a],n)}:(r?.[a]??W_(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},K_=(e,t,n,r)=>e.kind===`Closure`?W(e.body,qg(n,G_(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(mv(t,n),n):e.evaluate(B_(t,n),n),q_=/* @__PURE__ */ new WeakMap,J_=e=>{let t=q_.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return q_.set(e,n),n},Y_=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:J_(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},X_=(e,t,n)=>{let r=Hg(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return A_(r,n);if(r?.kind===`Operator`){if(F_(r.operator)===0)return L_(r.operator,[],n);throw new w(`Operator ${e} is used without arguments`)}let i=U_(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Bg(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return E_(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new w(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${U(t)}`)},Z_=(e,t)=>({impure:new Set(e.filter(e=>Xd(e,t))),streamed:new Set(e.filter(e=>Xd(e,t,`streamed`)))}),Q_=e=>[...e.facts.ids.keys()].some(t=>Xd(t,e)),$_=e=>[...e.facts.ids.keys()].some(t=>Xd(t,e,`repeated`)),ev=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,tv=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),nv=e=>t=>{let n=e(t);return hr(n,e(tv(t)))},rv=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Ui.sets,o=Ui.callStack,s=a??[],c=s.length;Ui.sets=s,Ui.callStack=r;try{let a=t(i),o=ev(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Eg(e)&&r.sources.set(o,e),o}catch(t){t instanceof u&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Dg(e,r.values),a=i&&!mt(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!dn(a)?void 0:a;throw iv(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Ui.sets=a,Ui.callStack=o}},iv=(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 w){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},av=(e,t,n)=>{if(!(n instanceof w))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}},ov=e=>({...e,coverage:void 0,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),sv=(e,t,n)=>{let r=e.location.range,i=e.prefixEnds;if(!n||e.isBulleted||!r||!i||t.length<3)return;let a=i.slice(0,t.length-2).map(t=>({...e,location:{...e.location,range:{...r,end:t}}})).reverse(),o=e.kind===`And`;return r=>{n.expressions.push(...a);for(let i=0;i<t.length;i++){i>=2&&!n.isFrozen&&n.expressions.pop();let s=t[i](r);if(typeof s!=`boolean`)throw Ng(e,i,s);if(s!==o)return n.isFrozen||(n.expressions.length-=a.length-Math.max(i-1,0)),s}return o}},cv=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},lv=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=Vo(n,i,e);Ho(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},uv=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Rv(e,t),i=t.callStack,a=i&&Ul.get(e),o=i?rv(e,r,t,i):r,s=i&&a?cv(e,a,o,i):o,c=t.coverage,l=c?lv(e,s,c):s;return t.evaluators.set(e,l),l},dv=(e,t)=>{if(t.callStack||t.coverage)return uv(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=ec(e,t)??uv(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>dv(e,t.environment)(t),fv=(e,t)=>{let n=e.name,r=M(e)?void 0:U_(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Bg(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=E_(e,t))(r)}return t=>X_(n,e,t)},pv=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||M(e))return!0;let n=M_(e.name,t);return n===void 0||F_(n)===0},mv=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),hv=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(mv(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&pv(t[0],n)){let e=uv(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&pv(t[0],n)&&pv(t[1],n);if(i&&a){let e=uv(t[0],n),r=uv(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(B_(t,n),n)},gv=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw V_(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:W_(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:I_(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},_v=(e,t,n)=>{let r=gv(e,t,n),i;return t=>(i??=dv(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},vv=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=uv(n[0],t),i=uv(n[1],t);return t=>!Yg(r(t),e,`P`)||Yg(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=uv(n[0],t);return t=>Xg(r(t),e)}if(e.operator===`<=>`){let r=uv(n[0],t),i=uv(n[1],t);return t=>Zg(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw Ag(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=M(e)?void 0:M_(e.operator,t);if(r?.kind===`Closure`)return _v(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=uv(n[0],t),i=Ig(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!Hl.has(e)&&!ef(n[0],t);return e=>r.evaluate(mv(n,e),i&&e.scope===void 0?void 0:e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=uv(n[0],t),a=uv(n[1],t),o=Lg(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return hv(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new w(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.`)};let i=n.map(e=>W_(e,t));return r=>{let a=P_(e.operator,r);if(a)return K_(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new w(`${e.operator} is a function; apply it with brackets`):new w(`Unknown operator ${e.operator} at ${Og(e)}`)}},yv=(e,t)=>{let n=e.kind===`Forall`,r=uv(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=uv(i.set,t);return s=>s_(a_(o(s),i.set,t.runtime.version),t=>Qg(r(qg(s,Ug(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=c_(a,e=>a_(uv(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?Qg(r(qg(o,a)),e)!==n:s_(s[t],e=>c(t-1,Ug(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>d_(a,t,i=>Qg(r(qg(t,i)),e)!==n)?!n:n},bv=(e,t)=>{if(e.kind===`Tuple`)return ui(e.names.map(e=>{let n=Hg(t,e);return n?.kind===`Value`&&n.value}));let n=Hg(t,e.name);return n?.kind===`Value`?n.value:void 0},xv=/* @__PURE__ */ new WeakSet,Sv=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&xv.add(e)},Cv=/* @__PURE__ */ new WeakMap,wv=e=>{if(Cv.has(e))return Cv.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=ht(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),mt(e).every(n)},r=n(e)?[...t]:void 0;return Cv.set(e,r),r},Tv=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=Hg(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),Ev=e=>xv.has(e),Dv=(e,t)=>{let n=Ev(e),r=uv(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(qg(t,Ug(t.scope,n,e)));if(sn(e))return Ii(e),cn(e,i),d(e,t);let o=ci(e),s=ir(o,o.map(i));return un(e)?s:(s.lambdaDomain=e,cr(s))}let n=[],s=c_(i,e=>o_(W(e,t),e,t.environment.runtime.version));return u_(i,s,t.scope,e=>{let o=i.length===1?bv(a.pattern,e)??!1:ui(i.map(t=>bv(t.pattern,e)??!1));return n.push([o,r(qg(t,e))]),!1}),$r(n)},c=v_(i,e.body),l=x_(i),u=wv(e.body),d=(t,n)=>{let a=Tv(n.scope,u),o=qg(n,a),s=h_({value:b_(t,e=>r(qg(o,p_(i,a,e))),y_(c,i,t),l),bounds:i,body:e.body,scope:a});return i.length===1?cr(s):s},f=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!P(t))return d(t,r);if(!(i.length===1?un(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(un))){if(f)return d(t,r);try{return s(t,r)}catch(e){if(!(e instanceof w))throw e;return d(t,r)}}if(!f)return s(t,r);try{return s(t,r)}catch(t){throw av(f,e,t),t}},createLazy:d}},Ov=(e,t)=>{let n=Dv(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=uv(r[0].set,t);return t=>n(e(t),t)}return e=>n(f_(r,e),e)},kv=(e,t)=>{let n=xv.has(e);n&&Sv(e.function);let r=uv(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=>uv(e,t))}),value:uv(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):ui(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(qg(i,Ug(i.scope,`@`,e))):fa(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=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(St.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${U(e.function)}`)}return n}},Av=(e,t)=>{let n=uv(e.predicate,t),r=e.bound.pattern,i=jg(e.predicate),a=e.predicate.location.range&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:i},o=t.coverage,s=(e,t,n)=>{if(!o||e===-1)return n();t||o.secondary[e]++;let r=Uo(o,t?-1:e,n);return!t&&r===!0&&o.secondary[e]++,r},c=(t,n,o,l)=>({kind:`FilteredSet`,base:t,test:(e,t)=>{if(r.kind===`Tuple`&&Vi(e)?.length!==r.names.length)throw new w(`Attempted to check if the value:\n${N(L(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=s(l,t,()=>o(qg(n,Wg(n.scope,r,e))));if(typeof a!=`boolean`)throw new w(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${i} yielded non-Boolean value.`);return a},source:a,rebind:r=>c(t,{...n,environment:r},uv(e.predicate,r),-1)});return(e,t,r=-1)=>c(e,t,n,r)},jv=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${ws(e)}.\n${jg(t.predicate)}`);return e},Mv=(e,t,n,r)=>{if(!ln(e)||Wn(e))throw new w(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${U(t)}`);return Ur(e),o_(e,n,r)},Nv=e=>new w(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${U(e)}`),Pv=(e,t)=>{if(e.kind===`SetFilter`){let n=uv(e.predicate,t),r=uv(e.bound.set,t),i=Av(e,t),a=e.bound.pattern,o=t.coverage;return t=>{let s=r(t);if(!un(s))return i(s,t,o?.current);let c=[],l=r=>{let i=n(qg(t,Wg(t.scope,a,r)));jv(i,e)&&on(c,r)},u=s.kind===`Interval`?s:F(s).elements;return cn(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),rr(c)}}if(e.kind===`SetMap`){let n=uv(e.expression,t);return t=>{let r=[];return d_(e.bounds,t,e=>(on(r,n(qg(t,e))),!1)),Jr(r)}}let n=e.set;if(!n)return()=>{throw new w(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`)};let r=uv(e.body,t),i=uv(n,t);return t=>{let a=Mv(i(t),e,n,t.environment.runtime.version),o,s=e.pattern;if(s_(a,n=>{if(s.kind===`Tuple`&&Vi(n)?.length!==s.names.length)throw new w(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${U(e)}`);let i=Wg(t.scope,s,n);return Qg(r(qg(t,i)),e)?(o=bv(s,i),!0):!1}),o===void 0)throw Nv(e);return o}},Fv=e=>[...e].sort((e,t)=>Zn(e.name,t.name)),Iv=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Lv=(e,t)=>{let n=Fv(e),r=e.map(e=>uv(e.value,t));if(Iv(n))return t=>di(e.map((e,n)=>[e.name,r[n](t)]));let i=n.map(e=>e.name),a=e.map(e=>e.name);if(a.some((e,t)=>e!==i[t])){let t=n.map(t=>e.indexOf(t));return e=>xn(i,t,r.map(t=>t(e)),a)}return e=>fi(i,r.map(t=>t(e)))},Rv=(e,t)=>{let n=e=>uv(e,t);switch(e.kind){case`Number`:{let t=e.value;return hn(t)?()=>t:()=>{throw zg(e)}}case`Decimal`:return()=>{throw Rg(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return fv(e,t);case`Apply`:return vv(e,t);case`Bracket`:return()=>{throw new w(`A bracket without a function or subscript is not an expression at ${Og(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new w(`An operator cannot be used as a value at ${Og(e)}`)};case`And`:{let r=e.operands.map(n);return sv(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Ng(e,n,i);if(!i)return!1}return!0})}case`Or`:{let r=e.operands.map(n);return sv(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Ng(e,n,i);if(i)return!0}return!1})}case`Prime`:{let t=n(e.expression);return e=>t(tv(e))}case`Unchanged`:return nv(n(e.expression));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 Mg(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 w(`A non-boolean expression (${ws(t)}) was used as a condition of a CASE. ${jg(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new w(`Attempted to evaluate a CASE with no conditions true.\n${U(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(qg(n,Y_(e.definitions,n)))}case`Forall`:case`Exists`:return yv(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?Ag(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new w(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${U(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Pv(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Jr(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>ui(t.map(t=>t(e)))}case`FunctionConstruction`:return Ov(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 Lv(e.fields,t);case`RecordSet`:{let t=Fv(e.fields),r=t.map(e=>e.name),i=t.map(t=>e.fields.indexOf(t)),a=e.fields.map(e=>n(e.value));return i.every((e,t)=>e===t)?e=>({kind:`RecordSet`,names:r,sets:a.map(t=>t(e))}):e=>{let t=a.map(t=>t(e));return{kind:`RecordSet`,names:r,sets:i.map(e=>t[e])}}}case`Except`:return kv(e,t);case`ExceptAt`:return t=>{let n=Hg(t.scope,`@`);if(n?.kind!==`Value`)throw new w(`@ appears outside an EXCEPT at ${Og(e)}`);return n.value};case`FunctionApplication`:{Sv(e.function);let r=n(e.function),i=t=>Gg(r(Kg(t)),e),a=e.args.map(n),o=Fg(t.runtime.version);if(a.length===1){let e=a[0];return t=>la(i(t),e(t),o)}return e=>la(i(e),ui(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Pg(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=nv(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new w(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${U(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>vg(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new w(`The subexpression reference at ${Og(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Ag(kg[e.kind],e)}}},zv=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Bv=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Ca(e[t]),16777619),r=Math.imul(r^ka(e[t]),1540483477);t[0]=zv(n)||1,t[1]=zv(r)},Vv=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(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}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},Hv=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),Uv=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=ma(t,Ca(e[n]));return t&1073741823},Wv=(e,t)=>{for(let n=0;n<t.length;n++)if(!_r(e[n],t[n]))return!1;return!0},Gv=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,Kv=(e,t,n)=>{let r=e.slots.length-1;for(let i=Gv(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&Wv(e.states[r-1],n))return r-1}},qv=(e,t,n)=>{let r=e.slots.length-1,i=Gv(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},Jv=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&qv(e,t[n],t[n+1])}qv(e,t,n+1)},Yv=(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}},Xv=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Zv=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Yv(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Qv=e=>Atomics.load(e.used,0)*2>=e.slots.length,$v=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Yv(t,n);return{slots:t,used:e.used}},ey={kind:`Boolean`,value:!0},ty={kind:`Boolean`,value:!1},ny=e=>e?ey:ty,ry=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,iy=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,ay=(e,t)=>({kind:e,body:t}),oy=(e,t,n)=>({kind:e,operands:[t,n]}),sy=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?sy(e,t.operands).operands:[t])}),cy=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return cy(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,cy(t)),0)}},ly=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 ly(e.body);case`And`:case`Or`:return e.operands.some(ly)}},uy=/* @__PURE__ */ new WeakMap;let dy=0;const fy=e=>{let t=uy.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`#${dy++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(fy).join(`,`)})`;default:return`${e.kind}(${fy(e.body)})`}})();return uy.set(e,n),n},py=(e,t)=>e===t||fy(e)===fy(t),my=(e,t)=>{let n=fy(t);return e.some(e=>e===t||fy(e)===n)},hy=e=>e===`And`?`Or`:`And`,gy=(e,t)=>{switch(e.kind){case`Boolean`:return t?ny(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?ay(`Not`,e):e;case`Not`:return gy(e.body,!t);case`And`:case`Or`:return sy(t?hy(e.kind):e.kind,e.operands.map(e=>gy(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return ay(n,gy(e.body,t))}}},_y=e=>{switch(e.kind){case`Boolean`:return ny(!e.value);case`Not`:return e.body;case`And`:case`Or`:return sy(hy(e.kind),e.operands.map(_y));case`Always`:return ay(`Eventually`,_y(e.body));case`Eventually`:return ay(`Always`,_y(e.body));default:return ay(`Not`,e)}},vy=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=vy(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return ny(t)}return n.length===0?ny(!t):n.length===1?n[0]:sy(e.kind,n)}case`Not`:{let t=vy(e.body);return t.kind===`Boolean`?ny(!t.value):ay(`Not`,t)}case`Always`:case`Eventually`:{let t=vy(e.body);return ay(e.kind,t.kind===e.kind?t.body:t)}default:return e}},yy=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,by=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=by(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new w(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>sy(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=by(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=yy(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:sy(`Or`,t);n.push(ay(`Always`,ay(`Eventually`,e)))}return sy(`Or`,n)}case`Not`:return ry(e.body)?e:by(_y(e.body));default:return e}},xy=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?xy(e.operands[0]):sy(e.kind,e.operands.map(xy));case`Not`:return e.body.kind===`Not`?xy(e.body.body):ay(`Not`,xy(e.body));case`Always`:case`Eventually`:case`Next`:return ay(e.kind,xy(e.body));default:return e}},Sy=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Sy(e.operands[0]);let t=Math.floor(e.operands.length/2);return oy(e.kind,Sy(sy(e.kind,e.operands.slice(0,t))),Sy(sy(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return ay(e.kind,Sy(e.body));default:return e}},Cy=(e,t)=>{e.kind===`Eventually`&&!my(t,e)&&t.push(e),`body`in e&&Cy(e.body,t),`operands`in e&&e.operands.forEach(e=>Cy(e,t))},wy=e=>{let t=e.filter(iy),n=e.flatMap(e=>e.kind===`Not`&&iy(e.body)?[e.body]:[]);return!t.some(e=>my(n,e))},Ty=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,ay(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new w(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Ey=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:ay(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Dy=(e,t,n)=>e.flatMap(e=>{let r=Ey(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Oy=e=>[...new Set(e.map(fy))].sort().join(`|`),ky=(e,t)=>{let n=new Set(t.map(Oy));return[...e.filter(e=>!n.has(Oy(e))),...t]},Ay=e=>{let t=Ty(e),n=Dy(t,`Always`,`And`),r=Dy(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Ey(t,`Eventually`,`Or`);if(n&&!(my(e,n.first)||my(e,n.second)))return ky(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(my(e,t.first)||my(e,t.second))&&!my(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!wy(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Ey(t[e],`Always`,`And`);n&&(my(t,n.first)||t.push(n.first),my(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)my(t,e.first)&&my(t,e.second)&&!my(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!wy(t)?[]:i(t)};return a(e)},jy=e=>({particle:e,successors:[],statePredicates:e.filter(e=>cy(e)<=1)}),My=e=>{let t=Ay([e]).map(jy),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Oy(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 Ay(n)){let n=Oy(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(jy(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Ny=(e,t)=>!my(e,t)||my(e,t.body),Py=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&cy(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=yy(e);if(n){let e=cy(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(ly(e))throw new w(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Fy=(e,t)=>{let n=e.findIndex(e=>py(e,t));return n===-1?(e.push(t),e.length-1):n},Iy=e=>{let t=by(vy(gy(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=xy(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Py(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:sy(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:py(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Sy(e.formula),n=[];t&&Cy(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Fy(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Fy(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Fy(i,e))}));return{tableau:t&&My(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Ly=()=>x(new w(`Temporal formula is a tautology (its negation is unsatisfiable).`),S.livenessEvaluationFailure),Ry=/* @__PURE__ */ new Set([`~>`,`-+->`]),zy=/* @__PURE__ */ new WeakSet,By=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),Vy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Hy=(e,t)=>new w(`TLC cannot handle the temporal formula ${U(e)}${t===void 0?``:`:\n${t}`}`),Uy=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=Uy(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=Hg(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=$g(e,n);if(t)return Zd(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:M(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return Zl(e,(e,o)=>(a=Math.max(a,Uy(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};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:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(Ry.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=M(e)?void 0:M_(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,G_(o,e.args,Vy(n,t)))}default:return l(e)}},Wy=(e,t)=>{try{return l_(e,t)}catch(e){if(!(e instanceof w))throw e;if(!Nt(e))return;throw x(new w(`${a}${e.message}`),S.error)}},Gy=(e,t,n,r,i={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let a=(e,t,a=i.name,o=i.expanding,s)=>Gy(e,t,n,r,{name:a,path:s?.kind===`Operator`&&s.params.length===0?[...i.path,s.name]:i.path,expanding:o,isSubstituted:i.isSubstituted||s!==void 0&&n.substitutedDefinitions.has(s)});if(e.kind===`And`)return e.operands.flatMap(e=>a(e,t,U(e)));if(e.kind===`Label`)return a(e.body,t);if(e.kind===`Let`)return a(e.body,Ky(e,t,n));if(e.kind===`Identifier`){let r=M(e)?Hg(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return a(r.expression,r.scope,zy.has(r)?e.name:i.name);let o=n.constants.has(e.name)?void 0:$g(e.name,n);if(!r&&o?.kind===`Operator`&&o.params.length===0&&(Zd(o,n)>0||D_(o,n)===void 0)){if(i.expanding.has(o))throw m();return a(o.body,void 0,!i.isSubstituted&&n.instanceNames.get(e.name)||o.name,/* @__PURE__ */ new Set([...i.expanding,o]),o)}}let o=Vy(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Uy(e,t,n)===3)){let t=N_(e,o),r=M(e)?void 0:$g(e.operator,n),s=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!i.isSubstituted||s))return a(t.body,G_(t,e.args,o),i.isSubstituted&&r?r.name:e.operator,i.expanding,r)}let s=r&&e.kind===`Forall`&&e.bounds.every(e=>Uy(e.set,t,n)===0),c=s?Wy(e.bounds,o):void 0;if(s&&c){let n=[];if(u_(e.bounds,c,t,t=>(n.push(...a(e.body,t,U(e.body))),!1)),n.length===0)throw Ly();return n}return[{expression:e,scope:t,name:i.name,path:i.path}]},Ky=(e,t,n)=>{let r=Y_(e.definitions,Vy(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&zy.add(e.binding);return r},qy=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,a=(e,t,i)=>{let a=i===0&&!r?Uy(e,t,n):i;if(a===0){let r=W(e,Vy(n,t));if(typeof r!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${jg(e)}`);return ny(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},o=0,s=(e,t,r,i)=>{if(o>=100)throw m();o++;let s=f(e,t);o--;let c=cy(s),l=c===0&&Uy(r,i,n)>2;return c>2||l?s:a(r,i,c)},c=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=Vy(n,t),o=M(e)||$g(i,n)===void 0?Hg(t,i):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&zy.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:M(e)?P_(i,a):M_(i,n),u=e.kind===`Apply`?e.args:[],p=c?.kind===`Builtin`&&u.length===2?By.get(c.name):void 0;if(p){let n=u.map(e=>f(e,t));return d(e,t,sy(p,n))}if(c?.kind!==`Closure`)throw Hy(e);let m=!M(e)&&$g(i,n)?.isRecursive===!0;return l(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),s(c.body,G_(c,u,a),e,t)),m)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof i||n&&!r;throw!(t instanceof w)||a?t:Hy(e)}},u=(e,t)=>{let r=Uy(e,t,n),o=[],s=e.kind===`Forall`;try{d_(e.bounds,Vy(n,t),t=>(o.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof w)||n instanceof i)throw n;if(r<=2)return a(e,t,r);throw Hy(e,s&&!Nt(n)?n.message:void 0)}return o.length===0?ny(s):d(e,t,sy(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=cy(n);return r>2?n:a(e,t,r)},f=(e,t)=>{let i=Uy(e,t,n);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,Ky(e,t,n));case`Apply`:{let n=e.args;if(e.operator===`~`&&!M(e))return d(e,t,ay(`Not`,f(n[0],t)));if(e.operator===`=>`)return d(e,t,oy(`Or`,ay(`Not`,f(n[0],t)),f(n[1],t)));break}case`And`:case`Or`:return d(e,t,sy(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&Uy(e.condition,t,n)===0){let r=W(e.condition,Vy(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return d(e,t,oy(`Or`,oy(`And`,i,f(e.consequent,t)),oy(`And`,ay(`Not`,i),f(e.alternative,t))))}}if(i<=2)return a(e,t,i);switch(e.kind){case`Identifier`:return c(e,t);case`Apply`:return e.operator===`~>`?ay(`Always`,oy(`Or`,ay(`Not`,f(e.args[0],t)),ay(`Eventually`,f(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return ay(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=ay(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?ay(`Always`,ay(`Eventually`,oy(`Or`,i,a))):oy(`Or`,ay(`Eventually`,ay(`Always`,i)),ay(`Always`,ay(`Eventually`,a)))}default:throw Hy(e)}};return f(e,t)},Jy=e=>({holdsState:(t,n)=>{let r={environment:e,scope:t.scope,state:n,next:void 0},i=t.kind===`State`?W(t.expression,r):vg(t.step,r);if(typeof i!=`boolean`)throw new w(`A state predicate was evaluated to a non-boolean value.`);return i},holdsAction:(t,n,r)=>{let i=t.scope,a=t.subscript;if(a&&Wr(W(a,{environment:e,scope:i,state:n,next:void 0}),W(a,{environment:e,scope:i,state:r,next:void 0})))return!1;let o=W(t.expression,{environment:e,scope:i,state:n,next:r});if(typeof o!=`boolean`)throw new w(`Encountered an action predicate that's not a boolean.`);return o}}),Yy=(e,t,n,r,i)=>{let a=e=>Yy(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=r.holdsState(e,t);return i.set(e,a),a}case`Action`:return e.enabled&&i.get(e.enabled)===!1?!1:n!==void 0&&r.holdsAction(e,t,n);case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return Yy(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new w(`TLC cannot evaluate a temporal formula in a single step`)}},Xy=(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)=>Xy(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 Yy(e,t[r],t[a(r)],Jy(i),/* @__PURE__ */ new Map)}},Zy=`UnnamedAction`,Qy={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},$y=e=>{let t=e.range??Qy;return di([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},eb=(e,t)=>{let n=[[`name`,e.name],[`location`,$y(e.location)]];return e.parameters.length>0&&n.push([`context`,di(e.parameters)],[`parameters`,ui(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),di(n)},tb=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),nb=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),rb=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,ib=e=>e.kind===`Apply`?e.args:[],ab=(e,t,n)=>{let r=rb(e);if(r===void 0)return;if(M(e)){let e=Hg(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=M_(r,n);return i?.kind===`Closure`?i:void 0},ob=(e,t)=>{try{return W(e,nb(t,void 0)),!0}catch(e){if(e instanceof v)return!1;throw e}},sb=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&qd(e,t)&&ob(e.body,t),cb=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&sb(e,t),lb=(e,t)=>{let n=$g(e.name,t);return n?.body===e.body&&cb(n,t)},ub=(e,t)=>{if(e.kind!==`Identifier`||!M(e))return;let n=Hg(t,e.name);return n?.kind===`Thunk`?n:void 0},db=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:Y_(e.definitions,nb(n,t))};let r=ub(e,t);return r&&{expression:r.expression,scope:r.scope}},fb=(e,t,n,r)=>t.kind===`Apply`?G_(e,t.args,nb(r,n)):e.scope,pb=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Hg(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),mb=(e,t)=>{try{return e()}catch(e){if(e instanceof v)return t();throw e}},hb=(e,t,n,r,i)=>{let a=ib(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>Uy(e,n,i)!==0)?o():mb(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,nb(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},gb=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Zy,location:e.location,parameters:pb(n,t),expression:e,scope:t});if(sh.has(e.kind))throw x(new w(`${l}The next state relation is not a boolean expression.\n${jg(e)}`),S.error);switch(e.kind){case`Let`:return gb(e.body,Y_(e.definitions,nb(r,t)),n,r,i);case`Label`:return gb(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>gb(e,t,n,r,i));case`Exists`:return mb(()=>{let o=[];return d_(e.bounds,nb(r,t),t=>(o.push(...gb(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=M(e)?void 0:i.get(rb(e)??``),s=ab(e,t,r);if(o)return hb(o,e,t,s,r);if(!s)return[a()];let c=ib(e),u=M(e)?s.name:r.instanceNames.get(rb(e)??``)??s.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return lb(s,r)||c.some(e=>Uy(e,t,r)!==0)?d():mb(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,nb(r,t))},parent:e}),s.scope);return gb(s.body,e,{...s,name:u},r,i)},d)},_b=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>_b(e,t,n,r,i,o),s=(e,t,n)=>tb(e,Wl(t,a),n),c=db(e,t,n);if(c){o(c.expression,c.scope);return}let l=ab(e,t,n);if(l&&lb(l,n))return;let u=l?[...a,...Ul.get(l.body)??[]]:a;if(l&&l.params.length===0){if(Uy(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,G_(l,e.args,nb(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(Zy,e,t));return}let d=Uy(e,t,n);d<=1?r.inits.push(s(Zy,e,t)):d===3&&r.temporals.push(s(Zy,e,t))},vb=(e,t,n,r,i)=>{let a=(t,n)=>vb(e,t,n,r,i),o=db(t,n,r);if(o){a(o.expression,o.scope);return}let s=ab(t,n,r);if(s&&lb(s,r))return;if(s&&s.params.length===ib(t).length){a(s.body,fb(s,t,n,r));return}if(t.kind===`Forall`&&mb(()=>(d_(t.bounds,nb(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(tb(e,a)):Uy(a,n,r)<2?i.invariants.push(tb(e,a)):i.impliedTemporals.push(tb(e,t));return}let c=Uy(t,n,r);c<=1?i.impliedInits.push(tb(e,t)):c===3&&i.impliedTemporals.push(tb(e,t))},yb=(e,t)=>{let n=$g(e,t);return n?.kind===`Operator`&&!cb(n,t)?n:void 0},bb=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:yb(e.specification,t);a&&(_b(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:Zy,location:e.frames[0].location,parameters:[],expression:Wl(e.expression,e.frames),scope:e.scope}]:gb(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:M_(e.init,t);o?.kind===`Closure`&&r.inits.push(tb(e.init??``,o.body));let s=e.next===void 0?void 0:M_(e.next,t);return s?.kind===`Closure`&&r.actions.push(...gb(s.body,s.scope,s,t,n)),r},xb=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=db(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&M(e)?Hg(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!M(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=ab(e,t,n);if(!s||s.params.length!==ib(e).length)return!0;let c=$g(s.name,n);return c?.body===s.body&&sb(c,n)?!0:i(s.body,fb(s,e,t,n))};return i(e,t)?r:void 0},Sb=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,Cb=(e,t,n=!1)=>`${e.name===Zy?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:Sb(e)} ${g(e.location.range??Qy)}`,wb=e=>`${e.name}${Sb(e)}`,Tb=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=yb(e,n);t&&i.invariants.push(tb(e,t.body))}),t.properties.forEach(e=>{let t=yb(e,n);t&&vb(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>qr(e.map(e=>{let n=a&&t&&as(a,t,e.expression);return eb(e,n&&di(n))})),s=e=>qr(e.flatMap(e=>{let t=yb(e,n);return t?[di([[`name`,t.name],[`location`,$y(t.location)]])]:[]}));return di([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,qr(n.variables.map((e,t)=>di([[`name`,e],[`location`,$y(r[t])],...a?[[`coverage`,di([[`distinct`,qo(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},Eb=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return Eb(e.body);case`And`:case`Or`:return e.operands.some(Eb);default:return!1}},Db=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,Ob=e=>e.promises.some(e=>Eb(e.body))||e.models.some(e=>!Db(e)),kb=(e,t)=>e.every((e,n)=>_r(e,t[n])),Ab=e=>e.filter((t,n)=>n===0||e[n-1]!==t),jb=e=>({data:e(1024),length:0,create:e}),Mb=(e,t,n,r=0,i=n.length-r)=>{let a=t+i;if(a>e.data.length){let t=e.create(Math.max(2*e.data.length,a));t.set(e.data),e.data=t}for(let a=0;a<i;a++)e.data[t+a]=n[r+a];e.length=Math.max(e.length,a)},Nb=(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}},Pb=e=>new Int32Array(e).fill(-1),Fb=(e,t)=>(e.edgeStarts[t]??-1)!==-1,Ib=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},Lb=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,Rb=(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),zb=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},Bb=2**53-1,Vb=(e,t,n)=>{let r=t.map(e=>qy(e.expression,e.scope,n)),i=e.map(e=>ay(`Not`,qy(e.expression,e.scope,n))),a=i.length===1?i[0]:sy(`Or`,i);return{formula:r.length===0?a:sy(`And`,[...r,a]),negations:i}},Hb=e=>{switch(e.kind){case`State`:return[e];case`Enabled`:return[{expression:e.step,scope:e.scope}];case`Action`:return[e.expression,e.subscript].flatMap(t=>t?[{expression:t,scope:e.scope}]:[])}},Ub=(e,t)=>{switch(e.kind){case`Boolean`:return;case`State`:case`Enabled`:case`Action`:t.add(e);return;case`And`:case`Or`:e.operands.forEach(e=>Ub(e,t));return;default:Ub(e.body,t)}},Wb=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>Ub(e,t));return[...t]},Gb=e=>Wb(e).flatMap(e=>Hb(e).map(e=>e.expression)),Kb=(e,t,n,r)=>{if(e.length===0)return;let i=Vb(e,t,n),a=/* @__PURE__ */ new Set;Ub(i.formula,a);let o=[...a].flatMap(Hb),s=o.every(e=>e.scope===void 0)?!Yd(o.map(e=>e.expression),n,`repeated`):!$_(n),c={environment:n,atoms:Jy(n)},l=Iy(i.formula),u=qb(l,{atoms:{holdsState:(e,t)=>c.atoms.holdsState(e,t),holdsAction:(e,t,n)=>c.atoms.holdsAction(e,t,n)},isShared:s,isSame:kb,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},r,n.runtime.version!==`1.7.4`),d=(e,t)=>{if(e===void 0)return t();c.atoms=Jy(e);try{return t()}finally{c.atoms=Jy(n)}};return{branches:u.branches,solutions:l,addInitialState:(e,t,n)=>d(n,()=>u.addInitialState(e,t)),addState:(e,t,n,r)=>d(r,()=>u.addState(e,t,n)),storeState:u.storeState,getStateCounts:u.getStateCounts,findViolation:u.findViolation,getViolatedProperties:(t,r)=>[...new Set(e.filter((e,a)=>!Xy(i.negations[a].body,t,r,0,n)).map(e=>e.name))]}},qb=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map,a=1,o=t.isShared,s=t.atoms,c=t.evaluateFrom,l=/* @__PURE__ */ new Map,u=[],d=e=>{let t=l.get(e)??l.size;return l.set(e,t),u[t]=e,t},f=e=>{if(e.kind===`State`||e.kind===`Enabled`)return[d(e)*2+1];if(e.kind===`Not`){let t=e.body;return t.kind===`State`||t.kind===`Enabled`?[d(t)*2]:void 0}if(e.kind!==`And`)return;let t=e.operands.map(f);return t.every(e=>e!==void 0)?t.flat():void 0},p=e=>new Int8Array(e*l.size).fill(-1),m=e=>new Int8Array(e*i.size).fill(-1),h=(e,t,n,r,i)=>o?e(t,n,r,i):e(t,p(1),0,i),g=e=>{switch(e.kind){case`Boolean`:{let t=e.value;return()=>t}case`State`:case`Enabled`:{let t=d(e);return(n,r,i)=>(r[i+t]===-1&&(r[i+t]=+!!s.holdsState(e,n)),r[i+t]===1)}case`Action`:{let t=e.enabled&&d(e.enabled);return(n,r,i,a)=>(t===void 0||r[i+t]!==0)&&a!==void 0&&s.holdsAction(e,n,a)}case`Not`:{let t=g(e.body);return(e,n,r,i)=>!t(e,n,r,i)}case`And`:{let t=e.operands.map(g);return(e,n,r,i)=>t.every(t=>t(e,n,r,i))}case`Or`:{let t=e.operands.map(g);return(e,n,r,i)=>t.some(t=>t(e,n,r,i))}case`Next`:{let t=g(e.body);return(e,n,r,i)=>t(i??e,p(1),0,void 0)}case`Always`:case`Eventually`:return()=>{throw new w(`TLC cannot evaluate a temporal formula in a single step`)}}},_=e.map(e=>({solution:e,checks:{states:e.stateChecks.map(g),actions:e.actionChecks.map(g),nodes:e.tableau?.nodes.map(e=>{let t=o?f({kind:`And`,operands:e.statePredicates}):void 0;return t?Int32Array.from(t):e.statePredicates.map(g)})??[]},actionIds:Int32Array.from(e.actionChecks,e=>{let t=fy(e),n=i.get(t)??i.size;return i.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:jb(e=>new Int32Array(e)),edgeActions:jb(e=>new Uint8Array(e)),stateResults:jb(e=>new Uint8Array(e)),initial:[],firstNodes:jb(Pb),lastNodes:jb(Pb),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],stateCount:0,errorNode:void 0})),v=(e,t,n,r,i)=>c(t,()=>{let t=e.checks.states,a=new Uint8Array(t.length);return t.forEach((e,t)=>{a[t]=+!!h(e,n,r,i)}),a}),y=(e,t,n,r,i,a,s,l,u,d)=>c(t,()=>{let t=e.checks.actions;for(let c=0;c<t.length;c++){if(!o){u[d+c]=+!!h(t[c],n,r,i,a);continue}let f=l+e.actionIds[c];s[f]===-1&&(s[f]=+!!t[c](n,r,i,a)),u[d+c]=s[f]}}),ee=(e,t,n,r,i)=>{let a=e.checks.nodes[t];if(!(a instanceof Int32Array))return a.every(e=>h(e,n,r,i));for(let e=0;e<a.length;e++){let t=a[e],o=i+(t>>1);if(r[o]===-1&&(r[o]=+!!s.holdsState(u[t>>1],n)),r[o]!==(t&1))return!1}return!0},b=(e,t,n,r,i,a)=>c(n,()=>ee(e,t,r,i,a)),x=(e,t)=>{if(!r)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Nb(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},S=(e,t,n,r)=>{let 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),Nb(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],Nb(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?Mb(e.firstNodes,t,[r]):e.nextSiblings[a]=r,Mb(e.lastNodes,t,[r]),r},ne=(e,t)=>t<0?e.checks.nodes.some((n,r)=>te(e,t,r)!==void 0):e.isDone[t]===!0||(e.firstNodes.data[t]??-1)!==-1,C=(e,t,n)=>(ne(e,t)||e.stateCount++,S(e,t,n,Rb(e,t,n))),re=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;Mb(e.edgeTargets,o,n),i.forEach((t,n)=>Mb(e.edgeActions,(o+n)*s,r,t*s,s)),Mb(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},T={slots:/* @__PURE__ */ new Int32Array},ie=(e,r,i)=>{let o=[...i,{index:e,state:r}],s=16*a;T.slots=T.slots.length===s?T.slots.fill(0):new Int32Array(s);let c=e=>{let r=T.slots,i=o[e];for(let a=(n.getFingerprint(i)&2147483647)%r.length;;a=(a+1)%r.length){let n=r[a];if(n===0)return r[a]=e+1,!0;let s=o[n-1];if(s.index===i.index&&t.isSame(s.state,i.state))return!1}},l=0;for(let e=0;e<o.length;e++){if(l>=T.slots.length>>1){let e=T.slots;T.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}T.slots.length>s&&a++;let u=[];for(let e of T.slots)e!==0&&u.push(o[e-1]);return u},ae=(e,t,r,a,o,s,c)=>{let l=v(e,a,r,s,c),u=t.nodes[e.nodeTableaux[o]],d=e.checks.actions.length,f=[],h=[],g=new Uint8Array(d);u.successors.length>0&&y(e,a,r,s,c,r,m(1),0,g,0);for(let n of u.successors){if(!b(e,n,a,r,s,c))continue;if(x(t,n)&&e.errorNode===void 0&&e.solution.models.some(Db)){e.errorNode=o;return}let i=te(e,a,n);if(i!==void 0&&h.includes(i))continue;let l=i??C(e,a,n);h.push(l),f.push(0),i===void 0&&ae(e,t,r,a,l,s,c)}let _=n.getSuccessors(a,r),ee=new Uint8Array((_.length+1)*d);ee.set(g);let S=m(_.length);_.forEach((n,o)=>{let l=p(1);y(e,a,r,s,c,n.state,S,o*i.size,ee,(o+1)*d);let m=e.isDone[n.index]===!0;for(let r of u.successors){if(!b(e,r,a,n.state,l,0))continue;let i=te(e,n.index,r);if(i!==void 0&&h.includes(i))continue;let s=i??C(e,n.index,r);h.push(s),f.push(o+1),i===void 0&&m&&ae(e,t,n.state,n.index,s,l,0)}}),h.length>0&&re(e,o,h,ee,f,l)},oe=(e,t,n,r,i,a,o)=>{let s=l.size,u=new Uint8Array(t.nodes.length*n.length);c(o,()=>{for(let i=0;i<t.nodes.length;i++)for(let t=0;t<n.length;t++)ee(e,i,n[t].state,r,t*s)&&(u[i*n.length+t]=1)}),ne(e,o)||e.stateCount++,e.isDone[o]=!0;for(let c of zb(e,o)){let o=[],l=[];n.forEach((i,a)=>{let d=e.isDone[i.index]===!0;for(let f of t.nodes[e.nodeTableaux[c]].successors){if(u[f*n.length+a]===0)continue;let c=te(e,i.index,f);if(c!==void 0&&o.includes(c))continue;let p=c??C(e,i.index,f);o.push(p),l.push(a),c===void 0&&d&&ae(e,t,i.state,i.index,p,r,a*s)}}),re(e,c,o,i,l,a)}return e.errorNode===void 0?void 0:le(e,e.errorNode)},se=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Rb(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{Fb(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),Fb(e,i)||e.stateCount++,re(e,i,a,n,o,r)},ce=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Fb(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 Ib(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}Fb(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new w(`Couldn't re-create liveness trace (path) starting at: ${t}`)},le=(e,t)=>Ab(ce(e,t).reverse().map(t=>e.nodeStates[t])),E=(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=>Fb(e,t)),c=[],l=t=>{let n=Ib(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&Ny(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=Bb;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]=Bb,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>Lb(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>Ib(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=le(e,r),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g=f.length+m.length+h.length,_=r,v=e=>{l.push(_),_=e};for(;g>0;){let r=g;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&Lb(e,_,t)&&(f[n]=!0,g--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_,e)&&(h[t]=!0,g--)}),!(g<=0);){let n=-1,c=-1,u=g;if(Ib(e,_).some((r,l)=>{if(s.has(e.nodeStates[r])){if(!o.has(r)||!a(_,l))return!1;n=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_,l,e)&&(m[t]=!0,g--)})}return g<u?(v(r),d.clear(),!0):(o.has(r)&&!d.has(r)&&(c=r),!1)}))break;if(g<r){v(n),d.clear();break}for(;c===-1;){let t=l.pop();if(t===void 0)throw new w(`TLC failed to build the counterexample of a liveness property`);_=t,c=Ib(e,t).find(e=>o.has(e)&&!d.has(e))??-1}v(c),d.add(c)}}let y=p(r,_,s);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];y[y.length-1]!==n&&y.push(n)}let ee=c[c.length-1];return y[y.length-1]===ee&&y.pop(),{prefix:c.slice(0,-1),cycle:[ee,...y.reverse()],isCycleConstrained:Ob(n)}},p=(t,n,r)=>{if(n===t)return[];let i=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([i]),c=[];for(let n=i,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of Ib(e,u).entries()){if(f===u||!a(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==i;)e.push(t),t=r,r=o.get(t)??-1;return e.push(i),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 w(`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=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,n.push(t,l,-42),c.push(l);let u=r++;Ib(e,l).forEach((t,r)=>{Fb(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u=Math.min(u,o[t]):o[t]===-1&&s.push(t))}),n.push(u)}}};return{branches:_.length,addInitialState:(e,t)=>{let n=p(1);for(let r of _){let i=r.solution.tableau;if(!i)r.initial.push(e);else for(let a=0;a<i.initialCount;a++)b(r,a,void 0,t,n,0)&&r.initial.push(te(r,e,a)??C(r,e,a))}},addState:(e,t,n)=>{let r=ie(e,t,n),a=p(r.length),o=r.findIndex(t=>t.index===e)*l.size,s=m(r.length);for(let n of _){let c=n.checks.actions.length,l=new Uint8Array(r.length*c);r.forEach((r,u)=>y(n,e,t,a,o,r.state,s,u*i.size,l,u*c));let u=v(n,e,t,a,o),d=n.solution.tableau;if(!d){se(n,r,l,u,e);continue}let f=oe(n,d,r,a,l,u,e);if(f)return f}},storeState:(e,t)=>{for(let n of _){let r=n.solution.tableau;if(!r)continue;let i=[];for(let t=0;t<r.nodes.length;t++){let r=te(n,e,t);r!==void 0&&i.push(r)}for(let e of i.sort((e,t)=>e-t))n.nodeStates[e]=t,S(n,t,n.nodeTableaux[e],e)}},getStateCounts:()=>_.map(e=>e.stateCount),findViolation:()=>{for(let e of _)for(let t of e.solution.models){let n=E(e,t);if(n)return n}}}},Jb=e=>{switch(e.kind){case`Number`:if(!hn(e.value))throw x(new t(`TLC can't handle a number this big.\n${e.value}`),S.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return er(e.name);case`Set`:return F({kind:`MixedSet`,elements:e.elements.map(Jb)})}},Yb=e=>{try{return Jb(e)}catch(e){throw!(e instanceof w)||e instanceof t||e instanceof f?e:x(new w(`${l}${e.message}`),S.error)}},Xb=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>L(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 w(`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`)&&hr(t,r)})});if(t)return t[1];throw new w(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Zb=e=>new C(`In the configuration file, the identifier ${e} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),Qb=(e,t)=>{let n=e=>t.root.visible.get(e)?.key??e,r=t.root.constants.map(e=>e.name),i=t.root.variables,a=e=>{let n=t.moduleSymbols.get(e.module??``)?.get(e.name);return n?.kind===`Definition`?n:void 0},o=e=>{if(e.module===void 0)return[e.name,n(e.name)];let t=a(e);return t?[t.key]:[]},s=e=>e.module===t.root.module.name?[]:o(e),c=e=>{let n=t.definitions.get(e);return n?.kind===`Operator`?n.params.length:t.root.constants.find(t=>t.name===e)?.arity??t.builtins.get(e)?.arity??0},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set,d=(e,n)=>{t.builtins.set(e,n),t.definitions.delete(e),l.delete(e),u.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Yb(e.value);Hr(t),s(e).forEach(e=>{let n=c(e);n===0?l.set(e,t):d(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let f=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=f.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new C(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(Jb),Jb(e.value)]),f.set(t,n)}),f.forEach(e=>s(e).forEach(t=>d(t,Xb(e.name,c(t),e.rows))));let p=new Map(e.substitutions.flatMap(e=>o(e).map(t=>[t,n(e.target)])));[...p.keys()].forEach(e=>l.delete(e));let m=(e,a,o)=>{let s=n(a),c=t.definitions.get(s);if(!(c!==void 0||t.builtins.has(s)||l.has(s)||r.includes(a)||i.includes(a)))throw new C(`The configuration file substitutes for ${e} with the undefined identifier ${a}.`);if(c?.kind===`Operator`&&c.params.length!==o)throw new C(`The configuration file substitutes for ${e} with ${a} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(n=>{let i=n.name,a=n.target;if(!r.includes(i)&&!t.root.visible.has(i))throw new C(`In the configuration file, the identifier ${i} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===a))throw Zb(a);m(i,a,t.root.constants.find(e=>e.name===i)?.arity??t.root.visible.get(i)?.arity)});let h=e.substitutions.filter(e=>e.module!==void 0);[...t.moduleSymbols.keys()].forEach(e=>{let t=h.filter(t=>t.module===e);t.forEach(e=>{let n=a(e);if(n){if(t.some(t=>t.name===e.target))throw Zb(e.target);m(e.name,e.target,n.arity)}});let n=t.find(e=>!a(e));if(n)throw new C(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let g=h.find(e=>!t.moduleSymbols.has(e.module??``));if(g)throw new C(`In the configuration file, the module name ${g.module} is not a module in the specification.`);let _=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(s)),v=(e,n)=>{if(_.has(e))return{key:e,prefix:n};let r=t.copySources.get(e);return r&&v(r.source,n+r.prefix)};t.copySources.forEach((e,n)=>{let r=v(e.source,e.prefix),i=t.definitions.get(n);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=_u(n,r.key,a,a.slice(r.prefix),i.location);t.definitions.set(n,o),t.root.visible.forEach((e,r)=>{e.key===n&&r!==n&&t.definitions.set(r,o)})}),t.operatorConstants.forEach((e,t)=>l.set(t,e));let y=r.filter(e=>!l.has(e)&&!p.has(e)&&!u.has(e));if(y.length>0){let e=t.order.getDeclarationOrder(`constant`).find(e=>y.includes(e))??y[0];throw new C(`The constant parameter ${e} is not assigned a value by the configuration file.`)}return{constants:l,substitutions:p}},$b=`tlc2/value/impl/`,ex={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},tx={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},nx=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=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)}},rx=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),ix=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],ax=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??rx.get(e[3])}${`[]`.repeat(e[1].length)}`),ox=(e,t)=>e[e[t].first].text,sx=(e,t)=>ox(e,t).replaceAll(`/`,`.`),cx=e=>{let t=nx(e);if(t.readUint32()!==3405691582)throw new s(`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===ex.utf8?a.text=i.decode(t.readBytes(t.readUint16())):r===ex.integer?a.value=t.readInt32():r===ex.float?t.readUint32():r===ex.long||r===ex.double?(t.readBytes(8),e++):r===ex.class||r===ex.string||r===ex.methodType||r===ex.module||r===ex.package?a.first=t.readUint16():r===ex.methodHandle?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=sx(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=ax(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:nx(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()},()=>sx(n,d.readUint16())):[],p=ix.filter(t=>(e&t[0])!==0).map(e=>e[1]),m=ax(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}},lx=(e,t)=>{let n=e[t],r=e[n.second];return{className:ox(e,n.first),name:e[r.first].text}},ux=(e,t,n,r)=>{let i=()=>new p(`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===ex.integer)return n.value;if(n.tag===ex.string)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>=tx.iconstM1&&n<=tx.iconst5)o.push(n-tx.iconst0),e+=1;else if(n===tx.bipush)o.push(a[e+1]<<24>>24),e+=2;else if(n===tx.sipush)o.push(l()<<16>>16),e+=3;else if(n===tx.ldc)o.push(c(a[e+1])),e+=2;else if(n===tx.ldcW)o.push(c(l())),e+=3;else if(n===tx.dup){let t=s();o.push(t,t),e+=1}else if(n===tx.getstatic){let n=lx(t,l());if(n.className!==`${$b}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===tx.invokestatic){let n=lx(t,l()),a=s();if(n.className!==`${$b}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===tx.new)o.push({className:ox(t,l()),value:void 0}),e+=3;else if(n===tx.invokespecial){let n=lx(t,l()),a=s(),o=s();if(!(n.className===`${$b}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===tx.areturn){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()},dx=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=cx(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:ux(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)}))}},fx=A(`EOF`),px=A(`IDENTIFIER`),mx=A(`DEFBREAK`),hx=(e,t)=>Array.from({length:A(t)-A(e)+1},(t,n)=>A(e)+n),gx=new Set(hx(`op_57`,`op_119`)),_x=new Set(hx(`op_1`,`op_119`)),vx=new Set(hx(`op_57`,`op_70`)),yx=/* @__PURE__ */ new Set([...hx(`ACTION`,`EXCEPT`),A(`EXTENDS`),...hx(`IF`,`SF`),A(`STATE`),...hx(`THEN`,`WITH`),A(`US`),...hx(`op_112`,`op_116`)]),bx=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),xx=new Map([...bx(`postfix`,160,160,!0,`[`),...bx(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...bx(`prefix`,120,120,!1,`-.`),...bx(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...bx(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...bx(`prefix`,40,40,!0,`\\lnot`),...bx(`nfix`,100,130,!0,`\\times`),...bx(`infix`,140,140,!1,`^`,`^^`),...bx(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...bx(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...bx(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...bx(`infix`,100,110,!0,`|`,`||`,`%%`),...bx(`infix`,100,110,!1,`%`),...bx(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...bx(`infix`,90,140,!1,`\\wr`),...bx(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...bx(`infix`,90,130,!1,`!!`),...bx(`infix`,90,90,!1,`...`,`..`),...bx(`infix`,80,80,!0,`\\intersect`,`\\union`),...bx(`infix`,80,80,!1,`\\`),...bx(`infix`,70,70,!1,`<:`,`:>`),...bx(`infix`,60,60,!0,`@@`),...bx(`infix`,50,140,!0,`\\cdot`),...bx(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...bx(`infix`,30,30,!0,`\\land`,`\\lor`),...bx(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...bx(`infix`,10,10,!1,`=>`)]),Sx=new Map([...xx,...nc.flatMap(e=>e.slice(1).map(t=>[t,xx.get(e[0])]))]),Cx=Sx.get(`[`),wx={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Tx=e=>({type:`tokens`,kinds:new Set(e)}),Ex=e=>typeof e==`string`?e.startsWith(`<`)?Tx([A(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(Ex)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),Dx=e=>(...t)=>({type:e,body:G(...t)}),q=Dx(`zeroOrMore`),Ox=Dx(`oneOrMore`),J=Dx(`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}),kx=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Ax=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=kx(e,n);return n},jx=(...e)=>{let t=e.map(A);return e=>t.includes(Ax(e,1).kind)},Mx=(e,t=Ax(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Nx=e=>{let t=Ax(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Px=e=>jx(`CASESEP`)(e)&&Mx(e),Fx=e=>{let t=Ax(e,1);yx.has(t.kind)&&(t.kind=px)},Ix=(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}`,Lx=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Rx=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},zx=e=>e.operatorStacks[e.operatorStacks.length-1],Bx=(e,t)=>e.low>t.high,Vx=(e,t)=>e.high<t.low,Hx=e=>e.fix===`prefix`?e:Sx.get(`${e.name}.`),Ux=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Cx?Lx(`FcnAppl`,[n,...r.node.heirs]):Lx(`PostfixExpr`,[n,r.node]),operator:void 0})},Wx=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Lx(`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:Lx(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Gx=e=>{let t=zx(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 Ux(t,n),Gx(e);if(i.operator!==void 0){let t=Hx(r.operator);return t!==void 0&&Bx(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Ix(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 ${Ix(e,a.node.first,a.node.last)} and expression at location ${Ix(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Vx(a.operator,r.operator)?void 0:Bx(a.operator,r.operator)?(Wx(t,a.operator),Gx(e)):`Precedence conflict between ops ${a.operator.name} in block ${Ix(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Hx(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Vx(s,r.operator))return;if(!Bx(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Ix(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Wx(t,s),Gx(e);let c=Ix(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===wx?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Kx=e=>Y(t=>{let n=zx(t),r=Rx(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:Gx(t)}),qx=Kx(()=>!1),Jx=Kx(()=>!0),Yx=Y(e=>{e.lastOperator=Sx.get(e.token.image)}),Xx=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},Zx=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?Xx(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Qx=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Mx(e,n.first.beginColumn))return n;let t=Qx(e,n);if(t!==void 0)return t}},$x=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(A),n=(e,...t)=>t.some(t=>e.kind===A(t)),r=e=>e!==void 0&&gx.has(e.kind),i=e.token,a=kx(e,i);i.next=void 0;let o=kx(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===px&&(e=e.next)}else if(e.kind===px){let t=e.next;!r(t)||vx.has(t.kind)||_x.has(t.kind)&&t.next?.kind!==px||(e=t.next?.kind===A(`SUBSTITUTE`)?i:_x.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==mx&&(e.next={kind:mx,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=kx(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},eS=e=>{let t=Ax(e,1);if(t.kind===A(`LAB`)){let n=1;for(;n!==0;)if(t=kx(e,t),t.kind===A(`LAB`)&&n++,t.kind===A(`RAB`)&&n--,t.kind===fx)return!1;return kx(e,t).kind===A(`IN`)}if(t.kind!==px)return!1;for(t=kx(e,t);t.kind===A(`COMMA`);){if(t=kx(e,t),t.kind!==px)return!1;t=kx(e,t)}return t.kind===A(`IN`)},tS=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),nS=e=>e.proofLevels.at(-1)??-1,rS=e=>{let t=Ax(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:jx(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||nS(e)>=0&&tS(t)>nS(e):jx(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},iS=(e,t)=>{let n=tS(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},aS=e=>Y(t=>iS(t,t.token)?void 0:`${Ix(t,t.token)}: ${e}`),oS=Tx([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(A)),sS=Tx([...oS.kinds,A(`op_76`)]),cS=Tx(_x),lS=Tx(vx),uS=Tx([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(A)),dS=()=>q(Z({expansion:[K(oS,`<op_77>`)],semantic:Mx}),K(`PrefixOp`,`InfixOp`),Jx),fS=()=>K(G(Z({expansion:[`OpenStart`],semantic:Mx}),`OpenExpression`,qx),G(Z({semantic:Mx}),`ExtendableExpr`)),pS=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),mS=()=>K(G(Z({semantic:e=>jx(`ASSUME`,`BOXASSUME`)(e)||Ax(e,2).kind===A(`COLONCOLON`)&&[A(`ASSUME`),A(`BOXASSUME`)].includes(Ax(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),hS=()=>[`JuncItem`,q(Z({semantic:Nx}),`JuncItem`)],gS=e=>Y(t=>{t.expecting=e,Fx(t)}),_S=e=>Y(t=>{t.isTerminalProof=e}),vS=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{$x(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),yS={CompilationUnit:Q(void 0,[Y($x),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>`),gS(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,gS(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,gS(`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($x)),G(Z({semantic:e=>jx(`USE`)(e)&&Ax(e,2).kind!==A(`ONLY`)||jx(`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(vS(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),vS(`Expression`,Z({expansion:[`<IDENTIFIER>`,lS]}),`PostfixLHS`,`Expression`),vS(`Expression`,Z({expansion:[`<IDENTIFIER>`,cS]}),`InfixLHS`,`Expression`),vS(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),vS(`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`,[sS,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,cS,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,lS]),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>`,gS(`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,[oS,Yx]),NonExpPrefixOp:Q(void 0,[sS,Yx]),InfixOp:Q(`Infix Op`,[cS,Yx]),PostfixOp:Q(void 0,[lS,Yx]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{$x(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),mS(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),mS(),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=Rx(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Ix(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($x),K(G(Z({amount:3}),Z({semantic:jx(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:rS}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>jx(`BY`)(e)||Ax(e,2).kind===A(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>Ax(e,2).kind!==A(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,_S(!0),J(`<ONLY>`)),G(`<USE>`,_S(!1),J(`<ONLY>`)),G(`<HIDE>`,_S(!1))),X("an expression, `MODULE' or `DEF'"),J(pS(),q(`<COMMA>`,X(`MODULE or expression`),pS(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),pS(),q(`<COMMA>`,X(`MODULE or expression`),pS(),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`),uS,aS(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:rS}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),uS,aS(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:jx(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:jx(`INSTANCE`)}),`Instantiation`),G(Z({semantic:jx(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:rS}),Y(e=>{let t=Rx(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Ix(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),Ox(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:jx(`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(sS,cS,lS),Tx([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(A))],semantic:Mx}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Ix(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:Mx}),`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:eS}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),Ox(`<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=Rx(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`)),Ox(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:eS}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>Ax(e,2).kind===A(`MAPTO`)&&yx.has(Ax(e,1).kind)}),Y(e=>{Ax(e,1).kind=px}),`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=Lx(`FcnAppl`,t.heirs),e.lastOperator=Cx})),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>`,Ox(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(Fx),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===A(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>Px(e)&&Ax(e,2).kind!==A(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:Px}),`<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`,[Ox(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=Ax(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...hS()),G(Z({expansion:[`<AND>`]}),...hS())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Qx(t,e.heirs[1]);return n&&`Item at ${Ix(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Ix(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([])}),dS(),fS()],(e,t)=>{let n=zx(t);n.push({node:e.heirs[0],operator:wx});let r=Gx(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`),qx,q(K(G(Z({expansion:[`PostfixOp`],semantic:Mx}),`PostfixOp`,Jx),G(Z({expansion:[`<DOT>`],semantic:Mx}),`<DOT>`,Y(Fx),Z({semantic:Mx}),`Identifier`,Y(e=>{let t=zx(e);t[t.length-1].operator!==void 0&&Ux(t,t.length),t[t.length-1]={node:Lx(`RecordComponent`,[t[t.length-1].node,Rx(e,2),Rx(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:Mx}),X(`function argument`),`SBracketCases`,Kx(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:Mx}),`InfixOp`,Jx,dS(),fS()),G(Z({expansion:[`<COLONCOLON>`],semantic:Mx}),`<COLONCOLON>`,Y(e=>{let t=zx(e);if(!Zx(t[t.length-1].node))return`\`::' at ${Ix(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=zx(e),n=Rx(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Vx(r,e.lastOperator)){let t=Rx(e,3);return`Removing label at ${Ix(e,t.first,t.last)} would change expression parsing.`}t.push({node:Lx(`Label`,[Rx(e,3),Rx(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:Mx}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:Mx}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>nS(e)<0&&e.proofLevels.length<=1?`${Ix(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Ix(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:Xx(e.heirs)===void 0?e.heirs.length===1?Lx(`GeneralId`,e.heirs):void 0:Lx(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>Ax(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=>Ax(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Ix(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},bS=/* @__PURE__ */ new Map,xS=e=>{let t=bS.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=xS(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,xS(yS[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 bS.set(e,n),n},SS=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},CS=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=kx(e,e.scanPosition)),e.scanPosition=kx(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`},wS=(e,t)=>{if(t.type===`tokens`)return CS(e,t.kinds);if(t.type===`call`)return wS(e,yS[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||SS(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=wS(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||SS(e,t.semantic)?wS(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=wS(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=wS(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},TS=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=wS(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},ES=(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||xS(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!xS(a).hasSemanticStart?xS(a).first.has(Ax(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):TS(e,i,a)&&(o===void 0||o(e))}),DS=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,wS(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=kx(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===fx){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=kx(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${$e(e.token.image)}" `},OS=(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??DS(e)}\n\nResidual stack trace follows:\n${r}`,!1},kS=(e,t)=>{let n=kx(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,OS(e))},AS=(e,t)=>{let n=yS[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Ax(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!jS(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 OS(e,i);let a=r.node??(r.heirs.length===0?void 0:Lx(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},jS=(e,t)=>{if(t.type===`tokens`)return kS(e,t.kinds);if(t.type===`call`)return AS(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||OS(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||OS(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||jS(e,t));if(t.type===`choice`){let n=ES(e,t.alternatives);return n===-1?OS(e):jS(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!jS(e,t.body))return!1;if(t.type===`optional`)return ES(e,[t.body])===-1||jS(e,t.body);for(;ES(e,[t.body])===0;)if(!jS(e,t.body))return!1;return!0},MS=e=>{let t=Ze(e),n={kind:fx,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:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=jS(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
|
|
1784
|
+
`)},NS={low:15,high:15},PS={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),FS=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)]]),IS=(e,t)=>t.isAssociative||e===`%`||e===`\\X`,LS=/* @__PURE__ */ new Map([[`~`,{low:4,high:4}],[`[]`,{low:4,high:15}],[`<>`,{low:4,high:15}],[`ENABLED`,{low:4,high:15}],[`UNCHANGED`,{low:4,high:15}],[`SUBSET`,{low:8,high:8}],[`UNION`,{low:8,high:8}],[`DOMAIN`,{low:9,high:9}],[`-`,{low:12,high:12}],[`-.`,{low:12,high:12}]]),RS={low:17,high:17},zS=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`@`,`\\A`,`\\E`,`\\AA`,`\\EE`,`IF`,`CASE`,`LET`,`CHOOSE`,`LAMBDA`,`WF_`,`SF_`]),BS=/* @__PURE__ */ new Set([`(`,`{`,`<<`]),VS=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),HS=/* @__PURE__ */ new Set([...VS,`'`]),US=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),WS=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),GS=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),KS=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),qS=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...HS]),JS=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),YS=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),XS=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),ZS=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),QS=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),$S=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),eC=/* @__PURE__ */ new Set([``,`*`,`-`]),tC={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},nC=(e,t)=>e.line-t.line||e.column-t.column,rC=(e,t)=>({start:nC(e.start,t.start)<=0?e.start:t.start,stop:nC(e.stop,t.stop)>=0?e.stop:t.stop}),iC=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),aC={printed:``,set:``},oC={printed:`
|
|
1785
|
+
`,set:``},sC={printed:`
|
|
1785
1786
|
`,set:`
|
|
1786
|
-
`},
|
|
1787
|
-
`)}\n`},NS=(e,t,n=Ee(e,t===`tlapm`))=>{let i=t===`tlapm`,a=i?n:n.map(xe),o=0,s=[],c,l,u=[],d=/* @__PURE__ */ new Set,f=[],p=[],h,g=0,_=[],v=/* @__PURE__ */ new WeakMap,y=e=>u[u.length-1].has(e),b=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),ee=[],x=[],S=[],C=(e,t=o-1)=>{let n=e===t?S[e]:void 0;if(n)return n;let r=a[t];ee[e]??=b(a[e]),x[t]??={line:r.line,column:r.endColumn};let i={module:p[0].name,start:ee[e],end:x[t]};return e===t&&(S[e]=i),i},w=(e,t)=>(e.location.range=C(t),e),ne=(e=0)=>a[Math.min(o+e,a.length-1)],T=(e=0)=>{let t=ne(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},re=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ie=e=>i&&(e.kind===`Keyword`||DS.has(e.text)),ae=e=>{let t=a.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},oe=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:fS.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:ie(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,se=(e,t=ne(),n)=>{let i=a[a.length-1],o=t.line===i.line&&t.column===i.column,s=new r(`${e} at line ${t.line}, column ${t.column}`,void 0,ce(e,t,o,n));return h!==void 0&&v.set(s,h),s},ce=(e,t,n,r)=>{if(!i)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=a[_[0]-1],s=r?`Unexpected ${oe(r)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=r?ae(r):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},le=(e,t=ne())=>se(e,t,t),ue=e=>{let t={cursor:o,frame:h,restorePoints:_.length,offsideColumns:s.length,recursiveScopes:u.length},n=++g;h=n;try{let n=e();return h=t.frame,n}catch(e){if(!(e instanceof r)||v.get(e)!==n)throw e;o=t.cursor,h=t.frame,_.length=t.restorePoints,s.length=t.offsideColumns,u.length=t.recursiveScopes;return}},de=e=>{let t=h;h=void 0;let n=e();return h=t,n},pe=e=>{_.push(o);let t=e();return _.pop(),t},me=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ie(e),E=(e,t=0)=>{let n=T(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},D=()=>{let e=T();if(e.kind===`End`)throw le(`Unexpected end of expression`);return o++,e},O=e=>E(e)?(o++,!0):!1,k=e=>{if(!E(e))throw le(`Expected ${JSON.stringify(e)} but found ${re(T())}`);return D()},he=()=>{let e=T();if(e.kind!==`Identifier`)throw le(`Expected an identifier but found ${re(e)}`);if(ie(e))throw le(`Unexpected keyword ${e.text}`);return o++,e.text},ge=()=>{let e=o;return{name:he(),range:C(e)}},_e=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ve=()=>{let e=T();return e.kind!==`String`&&(rS.has(e.text)||Jx.has(e.text)||tS.has(e.text))?(o++,e.text):he()},ye=!1,be=()=>T().kind===`Identifier`||!me(T())?he():(ye=!0,D().text),Se=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},Ce=(e,t=`,`)=>{let n=[e()];for(;O(t);)n.push(e());return n},we=(e=0)=>{if(E(`<<`,e)){let t=e+1;for(;T(t).kind===`Identifier`||E(`,`,t);)t++;return E(`>>`,t)&&E(`\\in`,t+1)}let t=e;for(;T(t).kind===`Identifier`;){if(E(`\\in`,t+1))return!0;if(!E(`,`,t+1))return!1;t+=2}return!1},Te=()=>{if(E(`::`))return!0;if(!E(`(`))return!1;let e=1;for(;T(e).kind===`Identifier`&&E(`,`,e+1);)e+=2;return T(e).kind===`Identifier`&&E(`)`,e+1)&&E(`::`,e+2)},De=()=>{if(!O(`<<`)){let e=ge();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=_e(E(`>>`)?[]:Ce(ge));return k(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Oe=()=>{let e=()=>{let e=Ce(De);k(`\\in`);let t=de(j);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;E(`,`)&&(!i||we(1));)D(),t.push(e());return t.flat()},ke=()=>{let e=T();if(i&&DS.has(e.text)){let t=o;D();let n={kind:`Identifier`,name:e.text,location:b(e)};return{subscript:w(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||E(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(C(o,o)),n.push(he()),e&&E(`(`)?Ne():[]),s=[a(!i)];for(;E(`!`)&&T(1).kind===`Identifier`;)D(),s.push(a(!0));let c=s.slice(0,-1),l=b(e);l.range={...C(t),end:r[r.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:r,location:l},lastArgs:s[s.length-1]}}if(E(`<<`)||E(`(`)||E(`{`)||E(`[`)||t){let e=o,t=Ue();return{subscript:t.location.range?t:w(t,e),lastArgs:[]}}throw le(`Expected a subscript but found ${re(e)}`)},A=e=>{let t=T(1),n=T(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`&&E(`==`,tS.has(n.text)?3:4))},Ae=e=>{let t=T(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||E(`,`,1)||E(`)`,1)||t.kind===`Keyword`&&cS.has(t.text)||A(e)},je=()=>{let e=T(),t=e.kind===`Operator`&&(Jx.has(e.text)||nS.has(e.text))&&Ae(e);if(i&&e.kind!==`String`&&(nS.has(e.text)||oS.has(e.text)&&e.text!==`'`&&!eS.has(e.text)||aS.has(e.text)&&T(-1).text===`(`&&T(-1).line===e.line&&T(-1).endColumn+1===e.column&&T(1).text===`)`&&T(1).line===e.line&&T(1).column===e.endColumn+1)&&Ae(e))throw se(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw se(`\\X may not be used as an infix operator`,e);if(t)return o++,w({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:b(e)},o-1);if(e.kind!==`String`&&oS.has(e.text)&&Ae(e)){o++;let t=b(e);if(eS.has(e.text))return w({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return w({kind:`Lambda`,params:[n.name],body:jS(e.text,n,t),operator:e.text,location:b(e)},o-1)}if(E(`LAMBDA`)){let t=o;D();let n=_e(Ce(ge));k(`:`);let r=j();return w({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:b(e)},t)}if(!i)return j();let n=ue(j);if(n)return n;throw le(`Unexpected ${re(T())}`)},Me,Ne=()=>Se(()=>{let e=o;k(`(`);let t=Ce(je);return k(`)`),Me=C(e),t}),Pe=()=>{let e=D();s.push(e.column);let t=[j()],n=()=>{for(;kS(ne())&&ne().text===e.text&&ne().column===e.column;)o++,t.push(j())};return i?de(n):n(),s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:b(e)}},Fe=e=>Se(()=>{let t=b(e),n=T().kind===`Identifier`,r=E(`|->`,1)&&(n||me(T()));if(r||n&&E(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=b(T()),i=e();return n.range=C(t),k(r?`|->`:`:`),{name:i,value:j(),location:n}},a=[i(()=>n?he():D().text),...O(`,`)?Ce(()=>i(he)):[]];return k(`]`),{kind:e,fields:a,location:t}}if(we()){let e=o,n=Oe();if(!i||E(`|->`)){k(`|->`);let e=j();return k(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=j();if(O(`->`)){let e=j();return k(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(O(`EXCEPT`)){let e=Ce(()=>{k(`!`);let e=[];for(;E(`.`)||E(`[`);)if(O(`.`)){if(!me(T()))throw le(`Expected a field name but found ${re(T())}`);if(!i&&E(`@`))throw le(`@ used in !.@`);e.push({kind:`Field`,name:D().text})}else k(`[`),e.push({kind:`Index`,args:Ce(()=>j())}),k(`]`);return k(`=`),{path:e,value:j()}});return k(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!E(`]_`)){let e=[a];for(;O(`,`);)e.push(j());return k(`]`),{kind:`Bracket`,args:e,location:t}}return k(`]_`),{kind:`BoxAction`,action:a,subscript:ke().subscript,location:t}}),Ie=()=>{let e=o,t=w(Ge(),e),n=b(D());return w({kind:`Apply`,operator:`\\in`,args:[t,de(j)],location:n},e)},Le=e=>Se(()=>{let t=b(e);if(O(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(we()&&(T(1).text===`\\in`||E(`<<`))){let e=o,n=De();k(`\\in`);let r=de(j);if(O(`:`)){let e=de(j);return k(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=T().kind===`Identifier`&&E(`\\in`,1)?Ie():j();if(O(`:`)){let e=Oe();return k(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;O(`,`);)r.push(j());return k(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Re=e=>{let t=b(e),n=Se(()=>E(`>>`)||E(`>>_`)?[]:Ce(()=>j()));if(O(`>>_`)){if(n.length!==1)throw se(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:de(ke).subscript,location:t}}return k(`>>`),{kind:`Tuple`,elements:n,location:t}},ze=e=>{let t=b(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&we()){let e=Oe();return k(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=_e(Ce(ge));return k(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Be=e=>{let t=[];do{let n=o;if(O(`OTHER`))return k(`->`),{kind:`Case`,arms:t,other:j(),otherRange:C(n),location:b(e)};let r=j();k(`->`),t.push({condition:r,body:j()})}while(O(`[]`));return{kind:`Case`,arms:t,other:void 0,location:b(e)}},Ve=()=>{let e=T(1);return E(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||sS.has(e.text)||e.kind===`Operator`&&(Jx.has(e.text)||tS.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&rS.has(e.text))},He=()=>{let e=D();if(e.kind===`Number`)return{kind:`Operand`,operand:fe(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o--,{kind:`Bound`,args:Ne()}}return{kind:`Name`,name:e.text,args:E(`(`)?Ne():[]}},Ue=e=>{let n=o,r=D(),a=b(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=Ce(he);return k(`:`),{kind:`Lambda`,params:e,body:j(),location:a}}if(r.kind===`Number`)return{kind:`Number`,value:fe(r.text),text:r.text,location:a};if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:a};if(r.kind===`String`)return{kind:`String`,value:r.text,location:a};let s=r.kind===`Step`&&wt(r);if(!i&&s&&N()<0&&xt.length<=1)throw se(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw se(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let t=s?Tt(r)??r.text:r.text;if(Te()){let o=_e(O(`(`)?Ce(ge):[]);o.names.length>0&&k(`)`),k(`::`);let s=C(n),l=j();if(!i&&e!==void 0&&c!==void 0&&OS(l)&&e.high>=c.low)throw se(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:t,params:o.names,paramRanges:o.ranges,head:s,body:l,location:a}}let l=E(`(`);if(t===`@`&&!l&&!Ve())return{kind:`ExceptAt`,location:a};let u=l?Ne():[],d=[l?Me:void 0];if(!Ve())return l?{kind:`Apply`,operator:t,args:u,argumentsRange:Me,location:a}:{kind:`Identifier`,name:t,location:a};let f=[{kind:`Name`,name:t,args:u}],p=[C(n,n)];for(;Ve();)D(),p.push(C(o,o)),Me=void 0,f.push(He()),d.push(Me);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),v=d.at(-1)??C(n);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:a}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:a}:{kind:`Apply`,operator:h,args:g,..._.slice(0,-1).some(e=>e>0)&&{argumentCounts:_},argumentsRange:v,selectorRanges:p,argumentRanges:d,location:a}}if(r.kind===`Operator`&&AS(r.text)&&E(`(`)){let e=Ne();return t===`tlc`&&r.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:{kind:`Apply`,operator:r.text,spelling:r.spelling,args:e,location:a}}if(r.kind===`Operator`&&AS(r.text)&&!i)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=Se(()=>j());return k(`)`),e}case`[`:return Fe(r);case`{`:return Le(r);case`<<`:return Re(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return ze(r);case`IF`:{let e=j();k(`THEN`);let t=j();return k(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:a}}case`CASE`:return Be(r);case`LET`:{let e=[],t=[];for(u.push(/* @__PURE__ */ new Set);!O(`IN`);){if(i&&E(`RECURSIVE`))throw le(`Unexpected keyword RECURSIVE`);if(O(`RECURSIVE`)){vt();continue}let n=ft(!i&&O(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}u.pop();let n=j();return t.length===0?{kind:`Let`,definitions:e,body:n,location:a}:{kind:`Let`,definitions:e,instances:t,body:n,location:a}}case`CHOOSE`:{let e=De(),t=O(`\\in`)?j():void 0;return k(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:a}}case`WF_`:case`SF_`:{let e=ke(),t=!E(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:Se(()=>{k(`(`);let e=j();return k(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw le(`Unexpected ${re(r)}`,r)},We=(e,t,n)=>{c=l={low:t,high:n};let r=j(n+1),i=T(),a=tS.has(i.text)?Kx.high:Jx.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw se(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},Ge=()=>{let e=l;l=void 0;let t=T(),n=b(t);if(t.kind===`Operator`&&kS(t))return Pe();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return D(),{kind:`Apply`,operator:`~`,args:[We(t,4,4)],location:n};case`-`:return D(),{kind:`Apply`,operator:`-.`,args:[We(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return D(),jS(t.text,We(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return D(),{kind:`Apply`,operator:t.text,args:[We(t,10,13)],location:n}}return Ue(e)},Ke=(e,t,n,r,i)=>{let a=b(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},qe=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:b(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:b(e)},Je=()=>{D();let e=Se(()=>Ce(()=>j()));return Se(()=>k(`]`)),e},Ye=e=>{let t=o,n=Ge(),r=n.location.range?n:w(n,t),i;for(;;){let n=T();if(n.kind!==`Operator`)break;let a=b(n);if(tS.has(n.text)&&e<=15){D(),c=Kx,r=w(qe(n,r),t);continue}if(n.text===`[`){let e=Je();c=qx,r=w({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&me(T(1))){D();let e=D().text;r=w({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=Jx.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw se(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(D(),o.low>12&&E(`-`))throw se(`Precedence conflict between ${n.text} and -`,T());c=l=o;let s=j(o.high+1),u=i?.text===n.text;r=w(Ke(n,r,s,u,C(t).end),t),i={...o,text:n.text}}return r},Xe=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&wt(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&Qx.has(e.text),Ze=(e,t)=>({start:t,end:o-1,expression:e.location.range?e:w(e,t)}),Qe=(e,t,n,r)=>({...n,start:e,end:o-1,fixity:t,isLeft:!1,apply:r}),$e=e=>e.kind===`Operator`&&tS.has(e.text)&&E(`(`,1)?ue(()=>Se(()=>{D(),D();let t=j(),n=o-1;return k(`)`),{end:n,expression:qe(e,t)}})):void 0,et=()=>{let e=0;for(let t=o+1;t<a.length;t++){let n=a[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(a[t-1].text!==`!`&&(TS.has(n.text)&&e++,ES.has(n.text)&&--e===0))return!1}}return!1},tt=e=>E(`(`,1)&&et()?ue(()=>Se(()=>{D(),D();let t=j();k(`,`);let n=j();return k(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:b(e)}})):void 0,nt=e=>{let t=o,n=T(),r=b(n),i=n.kind===`Operator`||n.kind===`Keyword`,a=i?Jx.get(n.text):void 0;if(!e){if(E(`[`)){let e=Je();return Qe(t,`Postfix`,Zx,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(E(`.`)&&me(T(1))){D();let e=D().text;return Qe(t,`Postfix`,Zx,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(a){if(tt(n)){o=t;return}return D(),{...Qe(t,`Infix`,a,e=>Ke(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,C(e[0].start,e[1].end).end)),isLeft:Yx(n.text,a),joins:n.text}}if(n.kind!==`Operator`||!tS.has(n.text))return;if($e(n)){o=t;return}return D(),Qe(t,`Postfix`,Kx,e=>qe(n,e[0].expression))}if(n.kind===`Operator`&&kS(n))return Ze(Pe(),t);let s=a?tt(n):void 0;if(s)return Ze(s,t);let c=$e(n);if(c)return c.expression.location.range=C(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?Xx.get(n.text):void 0;if(l)return D(),Qe(t,`Prefix`,l,e=>jS(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!Xe(n))return;let u=n.kind===`Operator`&&$x.has(n.text);return Ze(u?Ue():de(Ue),t)},rt=e=>e!==void 0&&`fixity`in e,it=e=>e!==void 0&&!(`fixity`in e),at=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=C(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},ot=e=>{let t=e.pop(),n=e.pop();if(!it(t)||!rt(n))throw se(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(at(n,it(r)?[r,t]:[t]))},st=e=>{let t=e[e.length-2];return rt(t)?t:void 0},ct=(e,t)=>t!==void 0&&e.high<t.low,lt=()=>pe(()=>{let e=ue(()=>nt(!0));if(e===void 0){let e=ne();throw e.kind===`End`?le(`Unexpected end of expression`,e):se(`required expressions(s) missing before '${oe(e)}'`,e)}return de(()=>{let t=[e];for(;;){let e=ue(()=>nt(rt(t[t.length-1])));if(e===void 0)break;if(it(e)||e.fixity===`Prefix`){t.push(e);continue}for(;ct(e,st(t));)ot(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&it(n)){t.splice(-1,1,at(e,[n]));continue}let r=st(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!ct(r,e)&&ot(t),t.push(e)}for(;t.length>1;)ot(t);let n=t[0];if(!it(n))throw se(`incomplete expression`);return n.expression})}),j=(e=0)=>i?lt():Ye(e),ut=()=>{if(!O(`(`))return[];let e=_t();return k(`)`),e},dt=()=>{let e=b(T()),t=j(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:p[0].name,start:e,end:r}}},ft=e=>{let t=o;return w(mt(e),t)},pt=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),mt=e=>{let t=T(),n=o,r=b(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:C(n,o-2),...dt(),isLocal:e,isRecursive:y(t),location:r});if(t.kind===`Identifier`&&T(1).kind===`Operator`&&Jx.has(T(1).text)&&T(2).kind===`Identifier`&&E(`==`,3)){let e=ge(),t=D().text,n=ge();return k(`==`),i(t,[pt(e),pt(n)])}let a=t.kind!==`String`&&rS.has(t.text),s=t.kind===`Identifier`&&tS.has(T(1).text)&&E(`==`,2);if(a||s){let e=a?t.text:T(1).text;a&&D();let n=ge();return s&&D(),k(`==`),i(e,[pt(n)])}let c=he();if(O(`[`)){let t=Se(()=>Oe());return k(`]`),k(`==`),{kind:`Function`,name:c,bounds:t,body:j(),isLocal:e,isRecursive:y(c),location:r}}let l=o,u=ut();return k(`==`),E(`INSTANCE`)?{...ht(c,u,e,r),definitionRange:C(l)}:i(c,u)},ht=(e,t,n,r)=>{let i=o;return k(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:be(),substitutions:O(`WITH`)?Ce(()=>{let e=o,t=ve(),n=C(e);return k(`<-`),{name:t,nameRange:n,expression:je()}}):[],isLocal:n,location:r,instanceRange:C(i)}},M=()=>{let e=o;return w(gt(),e)},gt=()=>{let e=b(T());if(E(`_`)&&T(1).kind===`Operator`)return D(),{name:D().text,arity:O(`_`)?2:1,location:e};if(T().kind!==`String`&&(rS.has(T().text)||i&&T().kind===`Operator`)&&E(`_`,1)){let t=D().text;return D(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=he();if(!O(`(`))return{name:t,arity:0,location:e};let n=Ce(()=>k(`_`));return k(`)`),{name:t,arity:n.length,location:e}},_t=()=>Ce(M),vt=()=>{let e=_t();return e.forEach(e=>u[u.length-1].add(e.name)),e},yt=e=>{let t=0,n=e;do{let e=T(n);if(e.kind===`End`)return n;e.kind===`Operator`&&TS.has(e.text)&&t++,e.kind===`Operator`&&ES.has(e.text)&&t--,n++}while(t>0);return n},bt=()=>{let e=T(),t=T(1);return e.kind===`Identifier`?E(`(`,1)||E(`[`,1)?E(`==`,yt(1)):t.kind===`Operator`&&tS.has(t.text)?E(`==`,2):t.kind===`Operator`&&Jx.has(t.text)?T(2).kind===`Identifier`&&E(`==`,3):E(`==`,1):e.kind!==`String`&&rS.has(e.text)&&t.kind===`Identifier`&&E(`==`,2)},xt=[],N=()=>xt[xt.length-1]??-1,St=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Ct=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},wt=e=>!e.text.endsWith(`.`)&&!pS.has(Ct(e)),Tt=e=>{let t=Ct(e);if(pS.has(t))return;let n=St(e);if(n>=0)return`<${n}>${t}`;let r=N(),i=xt[xt.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Et=e=>{if(e.kind===`Keyword`)return uS.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return xt.length===0;if(e.text[1]===`+`||xt.length===0)return!0;let t=N();return t>=0&&St(e)>t},Dt=e=>{let t=St(e),n=xt.length-1,r=xt[n-1]??-1,i=xt[n]<0;return i&&(xt[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:xt[n]===t},Ot=e=>!d.has(e)&&p.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),kt=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!DS.has(e.name)&&!Ot(e.name):!1,At=()=>{let e=T();return e.kind===`Step`?wt(e):e.kind===`Keyword`?SS.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!bt()},jt=()=>{let e=o,t=T();return t.kind===`Operator`&&!iS.has(t.text)&&AS(t.text)?(o++,w({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:b(t)},e)):O(`MODULE`)?w({kind:`ModuleFact`,name:he(),location:b(t)},e):j()},Mt=e=>f[f.length-1]?.add(e),Nt=e=>{f.push(/* @__PURE__ */ new Set);let t=e();return f.pop(),t},Pt=e=>f.some(t=>t.has(e))||p.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),Ft=()=>{let e=o,t=T(),n=Ce(()=>{let e=T();if((e.kind!==`Identifier`||ie(e))&&e.kind!==`Operator`)throw le(`Expected a definition name but found ${re(e)}`,e);return o++,e.text},`!`),r=b(t);return w(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},It=()=>{if(i)return Ce(Ft);let e=Ce(jt),n=t===`tlc`?e.find(e=>e.kind===`Identifier`&&Pt(e.name)):void 0;if(n)throw se(`DEF clause entry should describe a defined operator`,n.location);return e},Lt=()=>{let e=ue(j);if(!e)return[];let t=[e];return pe(()=>{for(;E(`,`);){let e=ue(()=>(D(),j()));if(!e)return;t.push(e)}}),t},Rt=()=>{let e=i?Lt():At()?Ce(jt):[],t=O(`DEF`)||O(`DEFS`);if(i&&e.length===0&&!t)throw le(`Expected a fact`);return{facts:e,defs:t?It():[]}},zt=()=>{let e=o,n=D(),r=n.text===`USE`&&O(`ONLY`),i=C(e),a={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...Rt(),keyword:i,location:b(n)},s=a.kind===`Hide`&&t===`tlc`?a.facts.filter(e=>!kt(e)):[];if(s.length>0)throw te(s.map(t=>({location:m(t.location.range??C(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
1788
|
-
the name of a theorem, assumption, or step.`})));return w(a,e)},Bt=()=>{let e=o,t=b(T()),n=O(`NEW`),r=i?o:e,a=i?b(T()):t,s=T().kind===`Keyword`?CS.get(T().text):void 0;if(!n&&s===void 0)throw le(`Expected a declaration but found ${re(T())}`);if(s!==void 0&&D(),s===`Variable`){let e=ge();return Mt(e.name),w({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=M();Mt(c.name);let l=(s??`Constant`)===`Constant`&&E(`\\in`);if(l&&c.arity>0)throw se(`declared symbol with arguments before \\in`);return l&&D(),w({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?j():void 0,nameRange:c.location.range,location:a},r)},Vt=()=>{if(T().kind===`Identifier`&&E(`::`,1)&&E(`ASSUME`,2)&&(D(),D()),E(`ASSUME`))return Nt(Ut);if(T().kind===`Keyword`&&wS.has(T().text))return i?de(Bt):Bt();if(!i)return j();let e=ue(j);if(e===void 0)throw le(`Expected a hypothesis`);return e},Ht=()=>{let e=[Vt()];return pe(()=>{for(;;){let t=ue(()=>(k(`,`),Vt()));if(t===void 0)break;e.push(t)}}),e},Ut=()=>{let e=o,t=b(k(`ASSUME`)),n=()=>{let n=i?Ht():Ce(Vt);return k(`PROVE`),w({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)};return i?de(n):n()},Wt=e=>{let t=0;for(;T(t).kind===`Identifier`&&E(`,`,t+1);)t+=2;return T(t).kind===`Identifier`&&E(e,t+1)},Gt=(e,t)=>{e.forEach(Mt),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(Mt))},Kt=()=>{let e=T();if(E(`USE`)||E(`HIDE`))return zt();if(!i&&E(`INSTANCE`)){let t=o;return w(ht(void 0,[],!1,b(e)),t)}if(E(`DEFINE`)||bt()){let t=o;O(`DEFINE`);let n=[ft(!1)];for(;bt();)n.push(ft(!1));let r={kind:`Define`,definitions:n,location:b(e)};return w(r,t)}if(O(`HAVE`))return{kind:`Have`,expression:j()};if(O(`TAKE`)){let e=we(),t=_e(e?[]:Ce(ge)),n=e?Oe():[];return Gt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(O(`WITNESS`))return{kind:`Witness`,expressions:Ce(()=>j())};if(O(`PICK`)){let e=Wt(`:`),t=_e(e?Ce(ge):[]),n=e?[]:Oe();return Gt(t.names,n),k(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return O(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:O(`SUFFICES`),statement:E(`ASSUME`)?Ut():j()}},qt=e=>{let n=T();if(n.kind!==`Step`)throw le(`Expected a step number but found ${re(n)}`,n);if(!Dt(n))throw se(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&St(n)<0&&Tt(n)!==void 0)throw se(`<*> and <+> cannot be used for a named step`,n);return o++,{name:Tt(n),token:n.text,location:b(n)}},Jt=()=>{let e=o,t=qt(E(`QED`,1)),n=o,r=/* @__PURE__ */ new Set;f.push(r);let i=O(`QED`)?{kind:`Qed`}:Kt(),a=C(e),s=C(n),c=Et(T());if(c&&!dS.has(i.kind))throw se(`Proof of a step that does not take a proof`);let l=c?Zt():void 0;return f.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(Mt),w({...t,body:i,head:a,statement:s,proof:l},e)},Yt=e=>{if(O(`BY`)){let t=C(o-1);return{kind:`By`,isOnly:O(`ONLY`),...Rt(),keyword:t,location:e}}let t=T();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;D();let n=C(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Xt=()=>{let e=b(T());O(`PROOF`);let t=Yt(e);if(t)return t;let n=[Jt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Jt());return{kind:`Steps`,level:N(),steps:n,location:e}},Zt=()=>{let e=o;xt.push(-1);let t=Nt(Xt);return xt.pop(),w(t,e)},Qt=()=>T().kind===`Step`||T().kind===`Keyword`&&uS.has(T().text),$t=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return _S(e);let n=t.defs[t.defs.length-1]?.location.range;return gS(_S({...e,end:e.start}),_S(n??t.keyword))},en=()=>{let e=o,t=b(T()),n=O(`PROOF`),r=Yt(t);if(r){let t=w(r,e);return{kind:`Leaf`,proof:t,span:_S(t.keyword),first:e,end:o-1}}let i=T();if(i.kind!==`Step`)throw le(`Expected a step number but found ${re(i)}`);let a=o;D();let s=o,c=O(`QED`)?{kind:`Qed`}:Kt(),l=C(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:C(s),span:$t(l,c),first:e,start:a,end:o-1}},tn=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=nn(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...b(a[i.first]),range:C(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},nn=(e,t,n,r,i)=>{let a=e[t];if(!a)throw xS(`Unexpected end of (sub)proof at level ${n} before QED step`,r,bS);if(a.kind===`Leaf`)throw xS(`Expecting a proof step but found a${mS[a.proof.kind]} leaf proof`,a.span,bS);if(!i&&a.isProof)throw xS(`PROOF keyword found in step that does not begin subproof`,a.span,yS);let o=a.token.text[1];if(o===`+`&&!i)throw xS(`<+> used but no subproof expected`,a.span,yS);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:St(a.token);if(s<n||!i&&s>n)return;let c=dS.has(a.body.kind)?tn(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:Tt(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...b(a.token),range:C(a.start,l)}},d=gS(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=nn(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:gS(d,f.span)}},rn=()=>{if(!Qt())return;let e=[];for(;Qt();)e.push(en());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=tn(e,0,0,t.span),r=e[n.next];if(r)throw xS(`extra step(s) after finished proof`,r.span,vS,`Proof.Parser.toplevel`);return n.proof},an=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},on=()=>{if(T().kind!==`Identifier`||!E(`==`,1))return;let e=he();return d.add(e),D(),e},sn=()=>{if(!i)return j();let e=ne(),t=ue(j);if(t)return t;throw le(`Expected "====" but found ${re(e)}`,e)},cn=e=>{let t=o,n=D(),r=on(),a=Nt(()=>{let e=E(`ASSUME`)?Ut():sn();return i?{statement:e,proof:rn()}:{statement:e,proof:Et(T())?Zt():void 0}}),s=a.statement,c=w({name:r,statement:s,proof:a.proof,location:b(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&an(e,r,s,c.location)},P=()=>{let e=o,t=D(),n=on();return w({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:b(t)},e)},ln=()=>{let e=b(k(`----`));k(`MODULE`);let t=be();k(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(p.push(n),u.push(/* @__PURE__ */ new Set),O(`EXTENDS`)&&Ce(()=>{let e=o;n.extends.push(be()),n.extendsRanges.push(C(e))});;){let t=o,r=T();if(r.kind===`ModuleEnd`)return e.range={module:p[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},p.pop(),u.pop(),n;if(r.kind===`Separator`){if(E(`MODULE`,1)){let e=ln();n.modules.push(e),n.units.push({kind:`Module`,module:e}),k(`====`);continue}D()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=b(D()),r=_t();n.constants.push(...r),e.range=C(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=b(D()),r=Ce(()=>{let e=o,t=b(T());return w({name:he(),arity:0,location:t},e)});n.variables.push(...r),e.range=C(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=P();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&an(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(E(`USE`)&&E(`ONLY`,1))throw le(`Expected a module unit but found ${re(r)}`);let e=zt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=b(D()),r=vt();e.range=C(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:un(n,w(ht(void 0,[],!1,b(r)),t));continue;case`LOCAL`:if(D(),E(`INSTANCE`)){un(n,w(ht(void 0,[],!0,b(r)),t));continue}un(n,w(mt(!0),t));continue}r.kind===`Keyword`&&lS.has(r.text)?cn(n):un(n,ft(!1))}}},un=(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}))},dn=ln(),fn=ye?Gx(e):void 0;if(fn!==void 0)throw new r(fn);return dn},PS=e=>NS(e,`tlc`),FS=(e,t)=>NS(e,`tlc`,t),IS=e=>NS(e,`tlapm`),LS=e=>NS(e,`sany`),RS=`$subexpression`,zS=(e,t)=>new r(`${e} at line ${t.line}, column ${t.column}`),BS=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return BS(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of mt(e)){let e=BS(r,t,n);if(e)return e}},VS=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),HS=(e,t)=>{let n=e.location,r=VS(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 zS(`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 zS(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:RS,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:RS,args:e.args,location:n,resolution:ec},location:n}},US=(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:ec})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ec}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ec};return HS({...t,params:[...t.params,...r]},a)},WS=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o=0,s,c=!1,l=(t,r)=>{if(!t)throw zS(r,i);nc.set(n,{args:e.slice(0,o).flatMap(e=>`args`in e?e.args:[]),error:{location:m(t),message:r}}),c=!0},u=n=>{let r=[],a=[];for(;o<e.length;){let s=e[o];if(s.kind!==`Name`)throw zS(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>wl(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o++}throw zS(`Unknown operator ${r.join(`!`)}`,i)},d=t=>{let c=u(t),d=c.definition,f=sc(d),p=o===e.length-1;if(c.args.length!==f&&(!r||c.args.length!==0))return l(n.argumentRanges?.[o]??i.range,`The operator ${c.name} requires ${f-c.earlier} arguments.`);if(p)return{definition:d,args:c.args};if(d.kind!==`Operator`)throw zS(`Cannot select a subexpression of ${d.name}`,i);a.params.push(...d.params),a.args.push(...c.args),s=d.body,o++},f=()=>{for(;o<e.length&&!c;){let t=e[o];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o],c=s&&BS(s,t.name,[]);if(!c)return l(i,`Cannot find label \`${t.name}'.`);let u=c.label.params;if(!r&&t.args.length!==u.length)return l(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...u.map(e=>({name:e,arity:0}))),a.args.push(...t.args),s=c.label.body,o++}},p=t=>{if(!s)throw zS(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(s.kind===`Label`){s=s.body,p(t);return}if(s.kind===`Let`){if(t.kind!==`Operand`||Oc(t.operand,1)!==0)throw zS(`A LET/IN expression has only one operand`,i);a.lets.push(s.definitions),s=s.body;return}let n=Mc(s);if(n&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...n.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),s=n.body;return}if(s.kind===`Case`&&t.kind===`Operand`){let n=[...s.arms,...s.other?[{condition:void 0,body:s.other}]:[]],r=n[Oc(t.operand,n.length)],a=e[o+1];if(!r||a?.kind!==`Operand`)throw zS(`A subexpression of CASE must have the form !i!j`,i);o++;let c=Oc(a.operand,2),l=c===0?r.condition:c===1?r.body:void 0;if(!l)throw zS(`Nonexistent CASE operand`,i);s=l;return}if(t.kind!==`Operand`)throw zS(`Unexpected subexpression selector`,i);let r=n?n.sets:Nc(s),c=r?.[Oc(t.operand,r.length)];if(!c)throw zS(`Nonexistent operand specified by the selector`,i);s=c},h=d(void 0);if(c)return n;if(h)return US(h.definition,{...a,args:h.args});for(f();o<e.length&&!c;){let t=e[o];if(t.kind===`Name`){for(;s?.kind===`Label`;)s=s.body;if(s?.kind!==`Let`)throw zS(`A name selector here must be from a LET clause`,i);a.lets.push(s.definitions);let e=d(s.definitions);if(c)return n;if(e)return US(e.definition,{...a,args:[...a.args,...e.args]});f()}else p(t),o++}if(c)return n;if(!s)throw zS(`Subexpression selection failed`,i);return HS(a,s)},GS=(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 kc(e,t,n)},KS=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||mt(e).some(KS),qS=(e,t,n,r=!1)=>{if(!KS(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Dl(e,e=>qS(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>JS(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)=>qS(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Dl(e,e=>qS(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?GS(a.name,[],void 0,t):a.kind===`Apply`?GS(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=WS(o,t,a,r);return c!==a&&tc.add(c),c},JS=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:qS(e.expression,t,n,!0)}))}),YS=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},XS=(e,t)=>JS(e,YS(t.definitions),()=>!1),ZS=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=YS([...t,...e.definitions]),a=e=>n.has(e),o=YS([...t,...e.definitions,...r]),s=e=>qS(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>qS(e,i,c),u=e=>e.map(e=>e.kind===`ModuleFact`?e:l(e)),d=e=>e.map(e=>({...e,set:l(e.set)})),f=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&l(e.set)}:f(e)),conclusion:l(e.conclusion)}:l(e),p=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:u(e.facts)};case`Instance`:return JS(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?JS(e,i,c):El(e,l))};case`Have`:case`Case`:return{...e,expression:l(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(l)};case`Take`:return{...e,bounds:d(e.bounds)};case`Pick`:return{...e,bounds:d(e.bounds),body:l(e.body)};case`Assert`:return{...e,statement:f(e.statement)};default:return e}},m=e=>e?.kind===`By`?{...e,facts:u(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:p(e.body),proof:m(e.proof)}))}:e,h={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:f(e.statement),proof:m(e.proof)})),uses:e.uses.map(e=>({...e,facts:u(e.facts)}))};return e.definitions.some(e=>KS(e.body))||e.assumptions.some(e=>KS(e.expression))?{...h,definitions:e.definitions.map(e=>El(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},QS=(e,t)=>e.maxLevels[t]??3,$S=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Iu({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=>fu(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>fu(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>pu(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=lu(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)&&fu(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(Lu(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=m(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),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.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;if(r)for(let n=0;n<e.arity;n++){let i=c.argConstraints.get(su(e.name,n));i!==void 0&&QS(r,n)<i&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${n+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),c.argParams.forEach(e=>{let n=lu(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=QS(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 te([...r.values()])}},eC=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],tC=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),nC=new Map(rp.flatMap(e=>e.map(t=>[t,e[0]]))),rC=e=>nC.get(e)??e,iC=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},aC=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:gt(e)&2147483647,kind:t,isLocal:n}),oC=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:rC(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:rC(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},sC=(e,t)=>{let n=[];for(let r=t;;){let t=oC(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},cC=e=>({line:e.line,column:e.column}),lC=(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!==`.`){if(a.text===`EXTENDS`){let n=sC(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},uC=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,dC={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},fC=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&uC(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&uC(e[n+1],e[n+2])?n+=uC(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=>dC[e])}"`:r.text)}return t},pC=e=>e[2]?.text,mC=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},hC=(e,t)=>e.find(e=>e.name===t)??e.map(e=>hC(e.modules,t)).find(Boolean),gC=e=>{let t=e===void 0?[]:Ee(e),n;return{tokens:t,ranges:mC(t),getModule:()=>n??=e===void 0?PS(``):FS(e,t)}},_C=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=gC(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??sp.get(i)??up.get(i)??MS(e,i),c=a(s),l=c.tokens,u=c.ranges.get(pC(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>hC(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},vC=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=sC(t,e+1);i.push({location:cC(t[e]),apply:e=>r.forEach(t=>e.put(aC(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:cC(n),apply:t=>t.put(aC(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&sC(t,u+1).every(e=>s.has(e))&&o(u,`definition`),tC.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(cC(n)),i.push({location:cC(n),apply:e=>e.put(aC(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(aC(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=rC(e.name);i.push({location:e.location,apply:n=>n.put(aC(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(aC(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(aC(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>oc(e.location,t.location)?-1:+!!oc(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=iC();n.set(i??``,o),np.toReversed().forEach(e=>o.put(aC(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},yC=(e,t)=>{let n=/* @__PURE__ */ new Set,r=e=>{n.add(e)},i=e=>{e.kind===`ModelValue`&&r(e.name),e.kind===`String`&&r(e.value),e.kind===`Set`&&e.elements.forEach(i)};t.constants.forEach(e=>{e.args?.forEach(i),i(e.value)}),ip.forEach(r);let a=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=lC(a(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;fC(a(void 0)).forEach((e,t)=>{t===3&&op.forEach(r),r(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,i]=t;if(d.add(`${n.key}>${i}`),v.set(n.unit,[...v.get(n.unit)??[],i]),!_.has(i)){if(_.add(i),e(i).tokens.length===0){let t=n.unit??pC(e(void 0).tokens);throw o(i,t)}fC(a(i)).forEach(r)}}eC.forEach(r);let b=/* @__PURE__ */ new Set,ee=e=>{if(b.has(e))return;b.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ee),a(e).forEach(e=>{e.kind===`String`&&r(e.text)})};return ee(void 0),ap.forEach(r),[...n]},bC=(e,t)=>{let n=_C(e,t),r=n.getParsed,i,a=()=>i??=vC(r);return{getStringOrder:e=>yC(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},xC=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),SC=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],CC=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof r))throw n;let i=Gx(e);throw i===void 0?n:te([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,i)}},wC=e=>new r(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),TC=(e,t)=>e.location.range&&t.location.range&&{location:m(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${m(t.location.range)}.`},EC=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,DC=e=>e===`Theorem`?`ThmOrAssumpDefNode`:EC(e),OC=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Gl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),kC=(e,t)=>{let n=ht(e);return n!==void 0&&t.has(n)||mt(e).some(e=>kC(e,t))},AC=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Bl(e),n.get(e)??n.size)),n},jC=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),MC=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Qh(e);if(e.kind===`Number`&&!mn(e.value))throw $h(e);MC(e.kind===`Let`?[...mt(e),...jC(e.instances??[])]:mt(e))}),NC=(e,t)=>{let n=t.order??bC(t.source,t.loadModule),i=n.parseModule(t.source),a=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,d=new Map(xp.map(e=>[e.name,e])),f=/* @__PURE__ */ new Map,p=Af(e.checkDeadlock,t.seed);p.isWarningEnabled=t.isWarningEnabled??!0,p.isTool=t.isTool??!1,p.version=t.version??`master`,p.readLine=t.readLine;let h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Map,b=[],ee=/* @__PURE__ */ new Map,x=[],S=[],C=(e,t)=>x.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),w=0,ne=e=>`${e}#${w++}`,T=[],re=[],ie=$S(e=>{let t=v.get(e)??pe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=e=>{let n=f.get(e);if(n)return n;let r=Up(e,t.print,p,t.files,d);if(!r)return;Vp.get(e)?.forEach(ce);let i=/* @__PURE__ */ new Map;return Hp.get(e)?.forEach(e=>ce(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{d.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:iu.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:ou(e,t.name)??i.get(t.name)?.range})}),f.set(e,i),i},le=e=>{let n=Vp.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=ce(e);return r&&C(e,n),r&&n.includes(`Integers`)&&ce(`Integers`),r},ue=e=>(MC([...e.definitions.flatMap(pt),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...jC(e.instances)]),e.modules.forEach(ue),e);ue(i);let de=(e,r)=>{let i=t.loadModule?.(e)??fp(p.version).get(e)??MS(t.source,e);if(i===void 0)throw o(e,r);let a=CC(i,e,n);if(a.name!==e)throw te([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return ue(a)},fe=e=>{let t=S.indexOf(e.name);if(t!==-1){let n=[...S.slice(t),e.name].map(e=>`${e}.tla`);throw new r(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,i=[],a=[],o=[];S.push(e.name),x.push(n);let s=ve(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:re,levelChecks:o});if(x.pop(),S.pop(),a.length>0)throw te(a,!1,void 0,re);let c=i.find(e=>n.has(e.name)),l=c&&h.get(c.name),u=l&&TC(c,l.module);if(u)throw te([u],!1,void 0,re);if(c)throw wC(c);return o.forEach(e=>e()),{linked:s,closure:n}},pe=(e,n)=>{let r=h.get(e);if(r)return C(e,ee.get(e)??[]),r;let i=fe(de(e,n)),o=/* @__PURE__ */ new Map;return Bp(e,t.print,p,t.files,d,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new y(`No definition of ${e} to fall back to`);return W(r.body,{environment:n.environment,scope:a_(Gg(r),i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=i.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&xC.has(e))return;let r=a.get(n.key);r&&o.set(t.name,r),d.set(n.key,t),a.delete(n.key)}),h.set(e,i.linked),ee.set(e,i.closure),C(e,i.closure),i.linked},me=(e,t,n,r,i)=>{let o=i?void 0:le(e.module);if(o)return E(e,o);let d=i??pe(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=SC(d),p=`#${w++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=hl(XS(e,t),f,t,n);T.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>u.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=$l({params:g,substitutions:new Map([...h].map(([e,t])=>[e,xl(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>s.get(e)===!0,addDefinition:(n,i,o)=>{let u=ne(`${i}@${t.name}`),d=o(u);return a.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&oe.set(u,`${e.name}!${oe.get(n)??i}`),s.set(u,!r),c.set(u,{source:n,prefix:e.params.length}),u},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return D(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&ae.set(r,{name:n,location:e.location}),e.name!==void 0&&se.set(r,n),r})},E=(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}])),D=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.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:s.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},O=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),k=(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,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Kl(r,n),location:n}}},he=(e,t,n,r)=>{let i=e.location,o=r?void 0:le(e.module);if(o)return e.name===void 0?[]:[...o].map(([t,n])=>{let r=O(n.arity,n.params);return ql(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${w++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=SC(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};T.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>kC(f(e),p),h=d.map(t=>{let n=k(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],_=$l({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Kl(e.params,i),location:i,resolution:ec}:Gl(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>s.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}:OC(a,i)),i},createName:ne}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=O(n.arity,n.params),o=[...e.params,...a];return ql(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...y]},ge=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),_e=/* @__PURE__ */ new Map,ve=(e,n)=>{let r=wb(e,t.loadClass?.(e.name),e===i);_e.set(e.name,r.overrides);let o=r.module,c=T.length,l=new Map([...xp.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:ul,errors:[],warnings:[]},f=[d],p=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||m(n.range)===m(e.range))return;let r=m(e.range),i=m(n.range);DC(n.kind)===DC(e.kind)?d.warnings.push({location:r,message:`Warning: the ${EC(n.kind)} of '${t}' conflicts with \nits ${EC(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${EC(e.kind)} of '${t}' conflicts with \nits ${EC(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,_=/* @__PURE__ */ new Map,y=[],ee=[...o.constants],x=o.variables.filter((e,t)=>o.variables.findIndex(t=>t.name===e.name)===t),S=x.map(e=>e.name),te=x.map(e=>e.location);o.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:le(e);if(r){p(r);return}let i=t??pe(e,o.name);ee.push(...i.constants.filter(e=>ee.every(t=>t.name!==e.name)&&!S.includes(e.name))),i.variables.forEach((e,t)=>{S.includes(e)||ee.some(t=>t.name===e)||(S.push(e),te.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>_.set(t,e)),y.push(i)});let C=new Map(l),w=[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))],ne=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});w.forEach(e=>h.set(e.name,ne(e)));let ae=e=>({key:ce(e),arity:sc(e),params:cc(e),kind:dl(o,e)?`Theorem`:`Definition`,range:e.location.range}),oe=ee.length===0&&S.length===0,ce=e=>o===i?e.name:`${e.name}@${n.id}`,ue=/* @__PURE__ */ new Map,de=()=>new Map([...n.modules,..._]),fe=e=>{let t=o.modules.find(t=>t.name===e.module);return t?oc(t.location,e.location)?_.get(t.name):void 0:de().get(e.module)},O=e=>({imported:l,getInstance:e=>{let t=fe(e),n=t?void 0:le(e.module);if(n)return{declarations:[],symbols:E(e,n),instancer:o.name};let r=t??pe(e.module,o.name),i=SC(r);return{declarations:i,symbols:D(e,r.exported,i,e=>e),instancer:o.name}},bound:C,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:ce,instanced:ue,facts:g,reports:f,warnings:n.warnings}),k=e=>[...w.filter(t=>oc(t.location,e)).map(e=>[e.name,ne(e)]),...o.definitions.filter(t=>oc(t.location,e)).map(e=>[e.name,ae(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),ye=e=>{let t=de(),r=t.get(e.name),i=r&&TC(e,r.module);if(r&&!i)throw wC(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=ve(e,{id:`${n.id}/${e.name}`,symbols:k(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||_.set(e.name,o)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=me(e,o,O(o),oe,de().get(e.module));ue.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))})}})),...o.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>oc(e.location,t.location)?-1:1).forEach(e=>e.link());let be=ZS(ru(o,(e,t)=>he(e,t,o.name,fe(e))),ge(l));n.errors.push(..._l(be,O(be))),be.definitions.forEach(e=>{let t=ce(e);a.set(t,e),s.set(t,!oe);let n=ae(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!oc(r,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let xe={module:be,constants:ee,variables:S,variableLocations:te,visible:l,exported:h,modules:_,extended:y,facts:/* @__PURE__ */ new Set([...g,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};v.has(o.name)||v.set(o.name,xe);let Se=T.splice(c).map(e=>({location:e.location,check:()=>ie(e)}));return n.levelChecks.push(()=>Ru(be,{constants:new Set(ee.map(e=>e.name)),variables:new Set(S),getDefinition:e=>a.get(l.get(e)?.key??e),getQualifiedName:e=>se.get(l.get(e)?.key??e)},Se,re)),b.push(xe),xe},ye=fe(i).linked,be=t.traceFile,xe=be===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:be}}],Se=[...t.moduleOperators??[],...xe].map(e=>{let t=pe(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});b.push(...b.splice(b.indexOf(ye),1)),re.length>0&&!t.isSanyReported&&t.print(g(re)),ye.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),Se.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(ye,/* @__PURE__ */ new Set);let Te=ye.constants.map(e=>e.name),Ee=ye.variables,De=db(e,{root:ye,moduleSymbols:new Map([...f,...[...h].map(([e,t])=>[e,t.visible]),[i.name,ye.visible]]),definitions:a,builtins:d,copySources:c,operatorConstants:new Map(Se.flatMap(e=>pe(e.module,i.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:n}),Oe=De.constants,ke=De.substitutions;be!==void 0&&d.forEach((e,t)=>{let n=Ep(e);n&&d.set(t,n)});let A=AC(Ee,b.flatMap(e=>e.module.variables.map(e=>e.name))),Ae=Zu({definitions:a,substitutions:ke,constants:Oe,variableIndex:A,builtins:d,variables:Ee}),je={runtime:p,definitions:a,builtins:d,constants:Oe,substitutions:ke,instanceNames:oe,variables:Ee,variableIndex:A,facts:Ae,startupValues:Array.from({length:Ae.ids.size},()=>void 0),substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Me=Iu({constants:new Set(Oe.keys()),variables:/* @__PURE__ */ new Set([...Ee,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>d.has(e))]),getDefinition:e=>pg(e,je)}),Ne=e=>{try{W(e,{environment:je,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};ke.forEach((e,t)=>{let n=a.get(e),r=Te.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Me.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Ne(n.body):void 0;if(r){let n=Nt(r)?``:` - specifically: ${r.message}`;throw new _(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),p.version!==`1.7.4`&&(p.isStarted=!0);let Pe=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),Fe=n.createDefinitionOrder();return{environment:je,assumptions:Ce,variableLocations:ye.variableLocations,instanceActions:ae,startupDefinitions:b.filter(e=>!Pe.has(e.module.name)||SC(e).length===0).flatMap(e=>Fe(e===ye?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:b.flatMap(e=>_e.get(e.module.name)??[]),moduleOperators:Se,rootName:i.name}},PC=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),FC=(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},IC=e=>v(new y(`${i}${e}`),S.error),LC=e=>{let t=L(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!dn(e)||!dn(i))throw IC(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},RC=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${zC(t)}`:n},zC=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(zC).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${RC(e.pattern,e.set)}:${zC(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(zC).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${zC(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>RC(e.pattern,e.set)).join(`,`)}|->${zC(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(zC);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},BC=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,VC=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new _(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw IC(`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)||!F(a))throw IC(`The symmetry operator must specify a set of functions.`);let o=I(a).elements;if(!o.every(un))throw IC(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],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=zC(BC(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(St.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;o.map(LC).forEach(e=>{e.size>0&&d.set(PC(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=FC(n,e),r=PC(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=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(!BC(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=>dn(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},HC=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=WC(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(WC(e[r],t));return a}},UC=(e,t)=>{let n=[],r=[];for(let i of e){let e=WC(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Xn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Xn(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},WC=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=UC(e.elements,t);return n?tr(n):e}if(n===`Function`||n===`LazyFunction`&&F(e.domain)){let n=L(e),r=HC(n.domain,t),i=HC(n.range,t)??n.range;if(r){let e=Qr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?rr(n.domain,e.range):e}return i===n.range?n:rr(n.domain,i)}if(n===`Interval`||!P(e)||!F(e))return e;let r=I(e),i=HC(r.elements,t);return i?Kr(i):r},GC=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=WC(e[o],i),a===0&&(a=Xn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},KC={line:0,column:0},qC=e=>({kind:`Identifier`,name:e,location:KC}),JC=e=>({name:e,expression:qC(e),scope:void 0}),YC=/* @__PURE__ */ new Set([`name`,`property`]),XC=(e,t,n)=>{let r=pg(t,n);if(!r)throw new _(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new _(YC.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},ZC=e=>e.body.kind===`Number`||e.body.kind===`String`,QC=(e,t,n)=>{if(n.constants.has(e))return n.constants.get(e);if(ed(t,n)&&!ZC(t))try{return W(qC(e),Cw(n,void 0,void 0))}catch(e){if(e instanceof y||C(e))return;throw e}},$C=(e,t,n)=>{if(n.constants.has(t))throw new _(`The ${e} ${t} cannot be a constant.`);let r=XC(e,t,n);if(QC(t,r,n)!==void 0)throw new _(`The ${e} ${t} cannot be a constant.`);return r},ew=(e,t,n)=>{let r=n.constants.has(t)?void 0:XC(e,t,n),i=r?QC(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new _(`The ${e} of ${t} is equal to ${R(i)}`);return i===void 0?r:void 0},tw=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},nw=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Hg(e.startupDefinitions,r),t.invariants.forEach(e=>{ew(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},rw=(e,t)=>{let n=Iu({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=ew(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1787
|
+
`},cC=(e,t,n,r=`Proof.Parser`)=>new s(e,void 0,{reason:`${e}${n.set}`,line:t.start.line,column:t.start.column,isEnd:!1,proof:{stop:t.stop,exception:r,printed:`${e}${n.printed}`}}),lC=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),uC=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),dC=/* @__PURE__ */ new Set([`NEW`,...uC.keys()]),fC=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),pC=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),mC=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),hC=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?FS.has(e.operator):VS.has(e.operator)),gC=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,_C=e=>FS.has(e)||VS.has(e)||e===`-.`,vC=(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}}},yC=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).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(`
|
|
1788
|
+
`)}\n`},bC=(e,t,n=Ee(e,t===`tlapm`))=>{let r=t===`tlapm`,i=r?n:n.map(xe),a=0,o=[],c,l,u=[],d=[],f,p=0,m=[],h=/* @__PURE__ */ new WeakMap,g=e=>u[u.length-1].has(e),_=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),v=[],y=[],ee=[],b=(e,t=a-1)=>{let n=e===t?ee[e]:void 0;if(n)return n;let r=i[t];v[e]??=_(i[e]),y[t]??={line:r.line,column:r.endColumn};let o={module:d[0].name,start:v[e],end:y[t]};return e===t&&(ee[e]=o),o},x=(e,t)=>(e.location.range=b(t),e),te=(e=0)=>i[Math.min(a+e,i.length-1)],S=(e=0)=>{let t=te(e),n=o[o.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ne=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),C=e=>r&&(e.kind===`Keyword`||mC.has(e.text)),re=e=>{let t=i.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},w=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:$S.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:C(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,T=(e,t=te(),n)=>{let r=i[i.length-1],a=t.line===r.line&&t.column===r.column,o=new s(`${e} at line ${t.line}, column ${t.column}`,void 0,ie(e,t,a,n));return f!==void 0&&h.set(o,f),o},ie=(e,t,n,a)=>{if(!r)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=i[m[0]-1],s=a?`Unexpected ${w(a)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=a?re(a):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},ae=(e,t=te())=>T(e,t,t),oe=e=>{let t={cursor:a,frame:f,restorePoints:m.length,offsideColumns:o.length,recursiveScopes:u.length},n=++p;f=n;try{let n=e();return f=t.frame,n}catch(e){if(!(e instanceof s)||h.get(e)!==n)throw e;a=t.cursor,f=t.frame,m.length=t.restorePoints,o.length=t.offsideColumns,u.length=t.recursiveScopes;return}},se=e=>{let t=f;f=void 0;let n=e();return f=t,n},ce=e=>{m.push(a);let t=e();return m.pop(),t},le=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!C(e),E=(e,t=0)=>{let n=S(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},D=()=>{let e=S();if(e.kind===`End`)throw ae(`Unexpected end of expression`);return a++,e},O=e=>E(e)?(a++,!0):!1,k=e=>{if(!E(e))throw ae(`Expected ${JSON.stringify(e)} but found ${ne(S())}`);return D()},de=()=>{let e=S();if(e.kind!==`Identifier`)throw ae(`Expected an identifier but found ${ne(e)}`);if(C(e))throw ae(`Unexpected keyword ${e.text}`);return a++,e.text},fe=()=>{let e=a;return{name:de(),range:b(e)}},pe=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),me=()=>{let e=S();return e.kind!==`String`&&(WS.has(e.text)||FS.has(e.text)||HS.has(e.text))?(a++,e.text):de()},he=!1,ge=()=>S().kind===`Identifier`||!le(S())?de():(he=!0,D().text),_e=e=>{if(!r)return e();o.push(-1);let t=e();return o.pop(),t},ve=(e,t=`,`)=>{let n=[e()];for(;O(t);)n.push(e());return n},ye=(e=0)=>{if(E(`<<`,e)){let t=e+1;for(;S(t).kind===`Identifier`||E(`,`,t);)t++;return E(`>>`,t)&&E(`\\in`,t+1)}let t=e;for(;S(t).kind===`Identifier`;){if(E(`\\in`,t+1))return!0;if(!E(`,`,t+1))return!1;t+=2}return!1},be=()=>{if(E(`::`))return!0;if(!E(`(`))return!1;let e=1;for(;S(e).kind===`Identifier`&&E(`,`,e+1);)e+=2;return S(e).kind===`Identifier`&&E(`)`,e+1)&&E(`::`,e+2)},Se=()=>{if(!O(`<<`)){let e=fe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=pe(E(`>>`)?[]:ve(fe));return k(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>{let e=()=>{let e=ve(Se);k(`\\in`);let t=se(j);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;E(`,`)&&(!r||ye(1));)D(),t.push(e());return t.flat()},we=()=>{let e=S();if(r&&mC.has(e.text)){let t=a;D();let n={kind:`Identifier`,name:e.text,location:_(e)};return{subscript:x(n,t),lastArgs:[]}}let t=r&&(e.kind===`Number`||e.kind===`String`||E(`@`));if(e.kind===`Identifier`){let t=a,n=[],i=[],o=e=>(i.push(b(a,a)),n.push(de()),e&&E(`(`)?A():[]),s=[o(!r)];for(;E(`!`)&&S(1).kind===`Identifier`;)D(),s.push(o(!0));let c=s.slice(0,-1),l=_(e);l.range={...b(t),end:i[i.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:i,location:l},lastArgs:s[s.length-1]}}if(E(`<<`)||E(`(`)||E(`{`)||E(`[`)||t){let e=a,t=Be();return{subscript:t.location.range?t:x(t,e),lastArgs:[]}}throw ae(`Expected a subscript but found ${ne(e)}`)},Te=e=>{let t=S(1),n=S(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`&&E(`==`,HS.has(n.text)?3:4))},De=e=>{let t=S(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||E(`,`,1)||E(`)`,1)||t.kind===`Keyword`&&YS.has(t.text)||Te(e)},Oe=()=>{let e=S(),t=e.kind===`Operator`&&(FS.has(e.text)||US.has(e.text))&&De(e);if(r&&e.kind!==`String`&&(US.has(e.text)||qS.has(e.text)&&e.text!==`'`&&!VS.has(e.text)||KS.has(e.text)&&S(-1).text===`(`&&S(-1).line===e.line&&S(-1).endColumn+1===e.column&&S(1).text===`)`&&S(1).line===e.line&&S(1).column===e.endColumn+1)&&De(e))throw T(`incomplete expression`,e);if(t&&!r&&e.text===`\\X`&&e.spelling!==`×`)throw T(`\\X may not be used as an infix operator`,e);if(t)return a++,x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:_(e)},a-1);if(e.kind!==`String`&&qS.has(e.text)&&De(e)){a++;let t=_(e);if(VS.has(e.text))return x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},a-1);let n={kind:`Identifier`,name:`argument`,location:t};return x({kind:`Lambda`,params:[n.name],body:vC(e.text,n,t),operator:e.text,location:_(e)},a-1)}if(E(`LAMBDA`)){let t=a;D();let n=pe(ve(fe));k(`:`);let r=j();return x({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:_(e)},t)}if(!r)return j();let n=oe(j);if(n)return n;throw ae(`Unexpected ${ne(S())}`)},ke,A=()=>_e(()=>{let e=a;k(`(`);let t=ve(Oe);return k(`)`),ke=b(e),t}),Ae=()=>{let e=D();o.push(e.column);let t=[j()],n=()=>{for(;gC(te())&&te().text===e.text&&te().column===e.column;)a++,t.push(j())};return r?se(n):n(),o.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:_(e)}},je=e=>_e(()=>{let t=_(e),n=S().kind===`Identifier`,i=E(`|->`,1)&&(n||le(S()));if(i||n&&E(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=a,n=_(S()),r=e();return n.range=b(t),k(i?`|->`:`:`),{name:r,value:j(),location:n}},o=[r(()=>n?de():D().text),...O(`,`)?ve(()=>r(de)):[]];return k(`]`),{kind:e,fields:o,location:t}}if(ye()){let e=a,n=Ce();if(!r||E(`|->`)){k(`|->`);let e=j();return k(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}a=e}let o=j();if(O(`->`)){let e=j();return k(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(O(`EXCEPT`)){let e=ve(()=>{k(`!`);let e=[];for(;E(`.`)||E(`[`);)if(O(`.`)){if(!le(S()))throw ae(`Expected a field name but found ${ne(S())}`);if(!r&&E(`@`))throw ae(`@ used in !.@`);e.push({kind:`Field`,name:D().text})}else k(`[`),e.push({kind:`Index`,args:ve(()=>j())}),k(`]`);return k(`=`),{path:e,value:j()}});return k(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!r&&!E(`]_`)){let e=[o];for(;O(`,`);)e.push(j());return k(`]`),{kind:`Bracket`,args:e,location:t}}return k(`]_`),{kind:`BoxAction`,action:o,subscript:we().subscript,location:t}}),Me=()=>{let e=a,t=x(He(),e),n=_(D());return x({kind:`Apply`,operator:`\\in`,args:[t,se(j)],location:n},e)},Ne=e=>_e(()=>{let t=_(e);if(O(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ye()&&(S(1).text===`\\in`||E(`<<`))){let e=a,n=Se();k(`\\in`);let r=se(j);if(O(`:`)){let e=se(j);return k(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}a=e}let n=S().kind===`Identifier`&&E(`\\in`,1)?Me():j();if(O(`:`)){let e=Ce();return k(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;O(`,`);)r.push(j());return k(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=_(e),n=_e(()=>E(`>>`)||E(`>>_`)?[]:ve(()=>j()));if(O(`>>_`)){if(n.length!==1)throw T(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:se(we).subscript,location:t}}return k(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=_(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ye()){let e=Ce();return k(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=pe(ve(fe));return k(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{let n=a;if(O(`OTHER`))return k(`->`),{kind:`Case`,arms:t,other:j(),otherRange:b(n),location:_(e)};let r=j();k(`->`),t.push({condition:r,body:j()})}while(O(`[]`));return{kind:`Case`,arms:t,other:void 0,location:_(e)}},Le=()=>{let e=S(1);return E(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||JS.has(e.text)||e.kind===`Operator`&&(FS.has(e.text)||HS.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&WS.has(e.text))},Re=()=>{let e=D();if(e.kind===`Number`)return{kind:`Operand`,operand:ue(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return a--,{kind:`Bound`,args:A()}}return{kind:`Name`,name:e.text,args:E(`(`)?A():[]}},ze=(e,t,n,r,i)=>{let o=[{kind:`Name`,name:e,args:t}],s=[b(r,r)],c=[n];for(;Le();){D();let e=a;ke=void 0;let t=Re();s.push(t.kind===`Bound`?b(e):b(e,e)),o.push(t),c.push(ke)}let l=o.flatMap(e=>e.kind===`Name`?[e.name]:[]),u=l.join(`!`),d=o.flatMap(e=>`args`in e?e.args:[]),f=o.map(e=>`args`in e?e.args.length:0);return l.length<o.length?{kind:`Subexpression`,selectors:o,selectorRanges:s,argumentRanges:c,location:i}:d.length===0?{kind:`Identifier`,name:u,selectorRanges:s,location:i}:{kind:`Apply`,operator:u,args:d,...f.slice(0,-1).some(e=>e>0)&&{argumentCounts:f},argumentsRange:c.at(-1)??b(r),selectorRanges:s,argumentRanges:c,location:i}},Be=e=>{let n=a,i=D(),o=_(i);if(r&&i.kind===`Keyword`&&i.text===`LAMBDA`){let e=ve(de);return k(`:`),{kind:`Lambda`,params:e,body:j(),location:o}}if(i.kind===`Number`)return{kind:`Number`,value:ue(i.text),text:i.text,location:o};if(i.kind===`Decimal`)return{kind:`Decimal`,text:i.text,location:o};if(i.kind===`String`)return{kind:`String`,value:i.text,location:o};let s=i.kind===`Step`&&N(i);if(!r&&s&&yt()<0&&vt.length<=1)throw T(`Step number used outside proof`,i);if(s&&i.text[1]===`+`)throw T(`<+> step number used in an expression`,i);if(i.kind===`Identifier`||s){let t=s?St(i)??i.text:i.text;if(be()){let a=pe(O(`(`)?ve(fe):[]);a.names.length>0&&k(`)`),k(`::`);let s=b(n),l=j();if(!r&&e!==void 0&&c!==void 0&&hC(l)&&e.high>=c.low)throw T(`Removing the label would change expression parsing`,i);return{kind:`Label`,name:t,params:a.names,paramRanges:a.ranges,head:s,body:l,location:o}}let a=E(`(`);if(t===`@`&&!a&&!Le())return{kind:`ExceptAt`,location:o};let l=a?A():[];return Le()?ze(t,l,a?ke:void 0,n,o):a?{kind:`Apply`,operator:t,args:l,argumentsRange:ke,location:o}:{kind:`Identifier`,name:t,location:o}}let l=i.kind===`Operator`&&(_C(i.text)||i.text===`'`&&!r);if(l&&E(`(`)){let e=A();return!r&&Le()?ze(i.text,e,ke,n,o):t===`tlc`&&i.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:o}:i.text===`'`&&e.length===1?{kind:`Prime`,expression:e[0],location:o}:{kind:`Apply`,operator:i.text,spelling:i.spelling,args:e,argumentsRange:ke,location:o}}if(l&&!r)return Le()?ze(i.text,[],void 0,n,o):{kind:`Identifier`,name:i.text,spelling:i.spelling,location:o};switch(i.text){case`(`:{let e=_e(()=>j());return k(`)`),e}case`[`:return je(i);case`{`:return Ne(i);case`<<`:return Pe(i);case`@`:return{kind:`ExceptAt`,location:o};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Fe(i);case`IF`:{let e=j();k(`THEN`);let t=j();return k(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:o}}case`CASE`:return Ie(i);case`LET`:{let e=[],t=[],n=[];for(u.push(/* @__PURE__ */ new Set);!O(`IN`);){if(r&&E(`RECURSIVE`))throw ae(`Unexpected keyword RECURSIVE`);if(O(`RECURSIVE`)){n.push(...M());continue}let i=lt(!r&&O(`LOCAL`));i.kind===`Instance`?t.push(i):e.push(i)}return u.pop(),{kind:`Let`,definitions:e,...t.length>0&&{instances:t},...n.length>0&&{recursive:n},body:j(),location:o}}case`CHOOSE`:{let e=Se(),t=O(`\\in`)?j():void 0;return k(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:o}}case`WF_`:case`SF_`:{let e=we(),t=!E(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:_e(()=>{k(`(`);let e=j();return k(`)`),e});return{kind:i.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:o}}}throw ae(`Unexpected ${ne(i)}`,i)},Ve=(e,t,n)=>{c=l={low:t,high:n};let r=j(n+1),i=S(),a=HS.has(i.text)?NS.high:FS.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw T(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},He=()=>{let e=l;l=void 0;let t=S(),n=_(t);if(t.kind===`Operator`&&gC(t))return Ae();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return D(),{kind:`Apply`,operator:`~`,args:[Ve(t,4,4)],location:n};case`-`:return D(),{kind:`Apply`,operator:`-.`,args:[Ve(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return D(),vC(t.text,Ve(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return D(),{kind:`Apply`,operator:t.text,args:[Ve(t,10,13)],location:n}}return Be(e)},Ue=(e,t,n,r,i)=>{let a=_(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},We=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:_(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:_(e)},Ge=()=>{D();let e=_e(()=>ve(()=>j()));return _e(()=>k(`]`)),e},Ke=e=>{let t=a,n=He(),r=n.location.range?n:x(n,t),i;for(;;){let n=S();if(n.kind!==`Operator`)break;let a=_(n);if(HS.has(n.text)&&e<=15){D(),c=NS,r=x(We(n,r),t);continue}if(n.text===`[`){let e=Ge();c=PS,r=x({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&le(S(1))){D();let e=D().text;r=x({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=FS.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw T(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(D(),o.low>12&&E(`-`))throw T(`Precedence conflict between ${n.text} and -`,S());c=l=o;let s=j(o.high+1),u=i?.text===n.text;r=x(Ue(n,r,s,u,b(t).end),t),i={...o,text:n.text}}return r},qe=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&N(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&zS.has(e.text),Je=(e,t)=>({start:t,end:a-1,expression:e.location.range?e:x(e,t)}),Ye=(e,t,n,r)=>({...n,start:e,end:a-1,fixity:t,isLeft:!1,apply:r}),Xe=e=>e.kind===`Operator`&&HS.has(e.text)&&E(`(`,1)?oe(()=>_e(()=>{D(),D();let t=j(),n=a-1;return k(`)`),{end:n,expression:We(e,t)}})):void 0,Ze=()=>{let e=0;for(let t=a+1;t<i.length;t++){let n=i[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(i[t-1].text!==`!`&&(fC.has(n.text)&&e++,pC.has(n.text)&&--e===0))return!1}}return!1},Qe=e=>E(`(`,1)&&Ze()?oe(()=>_e(()=>{D(),D();let t=j();k(`,`);let n=j();return k(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:_(e)}})):void 0,$e=e=>{let t=a,n=S(),r=_(n),i=n.kind===`Operator`||n.kind===`Keyword`,o=i?FS.get(n.text):void 0;if(!e){if(E(`[`)){let e=Ge();return Ye(t,`Postfix`,RS,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(E(`.`)&&le(S(1))){D();let e=D().text;return Ye(t,`Postfix`,RS,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(o){if(Qe(n)){a=t;return}return D(),{...Ye(t,`Infix`,o,e=>Ue(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,b(e[0].start,e[1].end).end)),isLeft:IS(n.text,o),joins:n.text}}if(n.kind!==`Operator`||!HS.has(n.text))return;if(Xe(n)){a=t;return}return D(),Ye(t,`Postfix`,NS,e=>We(n,e[0].expression))}if(n.kind===`Operator`&&gC(n))return Je(Ae(),t);let s=o?Qe(n):void 0;if(s)return Je(s,t);let c=Xe(n);if(c)return c.expression.location.range=b(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?LS.get(n.text):void 0;if(l)return D(),Ye(t,`Prefix`,l,e=>vC(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!qe(n))return;let u=n.kind===`Operator`&&BS.has(n.text);return Je(u?Be():se(Be),t)},et=e=>e!==void 0&&`fixity`in e,tt=e=>e!==void 0&&!(`fixity`in e),nt=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=b(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},rt=e=>{let t=e.pop(),n=e.pop();if(!tt(t)||!et(n))throw T(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(nt(n,tt(r)?[r,t]:[t]))},it=e=>{let t=e[e.length-2];return et(t)?t:void 0},at=(e,t)=>t!==void 0&&e.high<t.low,ot=()=>ce(()=>{let e=oe(()=>$e(!0));if(e===void 0){let e=te();throw e.kind===`End`?ae(`Unexpected end of expression`,e):T(`required expressions(s) missing before '${w(e)}'`,e)}return se(()=>{let t=[e];for(;;){let e=oe(()=>$e(et(t[t.length-1])));if(e===void 0)break;if(tt(e)||e.fixity===`Prefix`){t.push(e);continue}for(;at(e,it(t));)rt(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&tt(n)){t.splice(-1,1,nt(e,[n]));continue}let r=it(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!at(r,e)&&rt(t),t.push(e)}for(;t.length>1;)rt(t);let n=t[0];if(!tt(n))throw T(`incomplete expression`);return n.expression})}),j=(e=0)=>r?ot():Ke(e),st=()=>{if(!O(`(`))return[];let e=ht();return k(`)`),e},ct=()=>{let e=_(S()),t=j(),n=i[a-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},lt=e=>{let t=a;return x(dt(e),t)},ut=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),dt=e=>{let t=S(),n=a,r=_(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:b(n,a-2),...ct(),isLocal:e,isRecursive:g(t),location:r});if(t.kind===`Identifier`&&S(1).kind===`Operator`&&FS.has(S(1).text)&&S(2).kind===`Identifier`&&E(`==`,3)){let e=fe(),t=D().text,n=fe();return k(`==`),i(t,[ut(e),ut(n)])}let o=t.kind!==`String`&&WS.has(t.text),s=t.kind===`Identifier`&&HS.has(S(1).text)&&E(`==`,2);if(o||s){let e=o?t.text:S(1).text;o&&D();let n=fe();return s&&D(),k(`==`),i(e,[ut(n)])}let c=de();if(O(`[`)){let t=_e(()=>Ce());return k(`]`),k(`==`),{kind:`Function`,name:c,bounds:t,body:j(),isLocal:e,isRecursive:g(c),location:r}}let l=a,u=st();return k(`==`),E(`INSTANCE`)?{...ft(c,u,e,r),definitionRange:b(l)}:i(c,u)},ft=(e,t,n,r)=>{let i=a;return k(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ge(),substitutions:O(`WITH`)?ve(()=>{let e=a,t=me(),n=b(e);return k(`<-`),{name:t,nameRange:n,expression:Oe()}}):[],isLocal:n,location:r,instanceRange:b(i)}},pt=()=>{let e=a;return x(mt(),e)},mt=()=>{let e=_(S());if(E(`_`)&&S(1).kind===`Operator`)return D(),{name:D().text,arity:O(`_`)?2:1,location:e};if(S().kind!==`String`&&(WS.has(S().text)||r&&S().kind===`Operator`)&&E(`_`,1)){let t=D().text;return D(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=de();if(!O(`(`))return{name:t,arity:0,location:e};let n=ve(()=>k(`_`));return k(`)`),{name:t,arity:n.length,location:e}},ht=()=>ve(pt),M=()=>{let e=ht();return e.forEach(e=>u[u.length-1].add(e.name)),e},gt=e=>{let t=0,n=e;do{let e=S(n);if(e.kind===`End`)return n;e.kind===`Operator`&&fC.has(e.text)&&t++,e.kind===`Operator`&&pC.has(e.text)&&t--,n++}while(t>0);return n},_t=()=>{let e=S(),t=S(1);return e.kind===`Identifier`?E(`(`,1)||E(`[`,1)?E(`==`,gt(1)):t.kind===`Operator`&&HS.has(t.text)?E(`==`,2):t.kind===`Operator`&&FS.has(t.text)?S(2).kind===`Identifier`&&E(`==`,3):E(`==`,1):e.kind!==`String`&&WS.has(e.text)&&t.kind===`Identifier`&&E(`==`,2)},vt=[],yt=()=>vt[vt.length-1]??-1,bt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),xt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},N=e=>!e.text.endsWith(`.`)&&!eC.has(xt(e)),St=e=>{let t=xt(e);if(eC.has(t))return;let n=bt(e);if(n>=0)return`<${n}>${t}`;let r=yt(),i=vt[vt.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Ct=e=>{if(e.kind===`Keyword`)return ZS.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return vt.length===0;if(e.text[1]===`+`||vt.length===0)return!0;let t=yt();return t>=0&&bt(e)>t},wt=e=>{let t=bt(e),n=vt.length-1,r=vt[n-1]??-1,i=vt[n]<0;return i&&(vt[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:vt[n]===t},Tt=()=>{let e=S();return e.kind===`Step`?N(e):e.kind===`Keyword`?lC.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!_t()},Et=()=>{let e=a,t=S();return t.kind===`Operator`&&!GS.has(t.text)&&_C(t.text)?(a++,x({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:_(t)},e)):O(`MODULE`)?x({kind:`ModuleFact`,name:de(),location:_(t)},e):j()},Dt=()=>{let e=a,t=S(),n=ve(()=>{let e=S();if((e.kind!==`Identifier`||C(e))&&e.kind!==`Operator`)throw ae(`Expected a definition name but found ${ne(e)}`,e);return a++,e.text},`!`),r=_(t);return x(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},Ot=()=>ve(r?Dt:Et),kt=()=>{let e=oe(j);if(!e)return[];let t=[e];return ce(()=>{for(;E(`,`);){let e=oe(()=>(D(),j()));if(!e)return;t.push(e)}}),t},At=()=>{let e=r?kt():Tt()?ve(Et):[],t=O(`DEF`)||O(`DEFS`);if(r&&e.length===0&&!t)throw ae(`Expected a fact`);return{facts:e,defs:t?Ot():[]}},jt=()=>{let e=a,t=D(),n=t.text===`USE`&&O(`ONLY`),r=b(e);return x({kind:t.text===`USE`?`Use`:`Hide`,isOnly:n,...At(),keyword:r,location:_(t)},e)},Mt=()=>{let e=a,t=_(S()),n=O(`NEW`),i=r?a:e,o=r?_(S()):t,s=S().kind===`Keyword`?uC.get(S().text):void 0;if(!n&&s===void 0)throw ae(`Expected a declaration but found ${ne(S())}`);if(s!==void 0&&D(),s===`Variable`){let e=fe();return x({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:o},i)}let c=pt(),l=(s??`Constant`)===`Constant`&&E(`\\in`);if(l&&c.arity>0)throw T(`declared symbol with arguments before \\in`);return l&&D(),x({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?j():void 0,nameRange:c.location.range,location:o},i)},Nt=()=>{if(S().kind===`Identifier`&&E(`::`,1)&&E(`ASSUME`,2)&&(D(),D()),E(`ASSUME`))return Ft();if(S().kind===`Keyword`&&dC.has(S().text))return r?se(Mt):Mt();if(!r)return j();let e=oe(j);if(e===void 0)throw ae(`Expected a hypothesis`);return e},Pt=()=>{let e=[Nt()];return ce(()=>{for(;;){let t=oe(()=>(k(`,`),Nt()));if(t===void 0)break;e.push(t)}}),e},Ft=()=>{let e=a,t=_(k(`ASSUME`)),n=()=>{let n=r?Pt():ve(Nt);return k(`PROVE`),x({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)};return r?se(n):n()},It=e=>{let t=0;for(;S(t).kind===`Identifier`&&E(`,`,t+1);)t+=2;return S(t).kind===`Identifier`&&E(e,t+1)},Lt=()=>{let e=S();if(E(`USE`)||E(`HIDE`))return jt();if(!r&&E(`INSTANCE`)){let t=a;return x(ft(void 0,[],!1,_(e)),t)}if(E(`DEFINE`)||_t()){let t=a;O(`DEFINE`);let n=[lt(!1)];for(;_t();)n.push(lt(!1));let r={kind:`Define`,definitions:n,location:_(e)};return x(r,t)}if(O(`HAVE`))return{kind:`Have`,expression:j()};if(O(`TAKE`)){let e=ye(),t=pe(e?[]:ve(fe)),n=e?Ce():[];return{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(O(`WITNESS`))return{kind:`Witness`,expressions:ve(()=>j())};if(O(`PICK`)){let e=It(`:`),t=pe(e?ve(fe):[]),n=e?[]:Ce();return k(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return O(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:O(`SUFFICES`),statement:E(`ASSUME`)?Ft():j()}},Rt=e=>{let n=S();if(n.kind!==`Step`)throw ae(`Expected a step number but found ${ne(n)}`,n);if(!wt(n))throw T(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&bt(n)<0&&St(n)!==void 0)throw T(`<*> and <+> cannot be used for a named step`,n);return a++,{name:St(n),token:n.text,location:_(n)}},zt=()=>{let e=a,t=Rt(E(`QED`,1)),n=a,r=O(`QED`)?{kind:`Qed`}:Lt(),i=b(e),o=b(n),s=Ct(S());if(s&&!QS.has(r.kind))throw T(`Proof of a step that does not take a proof`);let c=s?Ht():void 0;return x({...t,body:r,head:i,statement:o,proof:c},e)},Bt=e=>{if(O(`BY`)){let t=b(a-1);return{kind:`By`,isOnly:O(`ONLY`),...At(),keyword:t,location:e}}let t=S();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;D();let n=b(a-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Vt=()=>{let e=_(S());O(`PROOF`);let t=Bt(e);if(t)return t;let n=[zt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(zt());return{kind:`Steps`,level:yt(),steps:n,location:e}},Ht=()=>{let e=a;vt.push(-1);let t=Vt();return vt.pop(),x(t,e)},Ut=()=>S().kind===`Step`||S().kind===`Keyword`&&ZS.has(S().text),Wt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return iC(e);let n=t.defs[t.defs.length-1]?.location.range;return rC(iC({...e,end:e.start}),iC(n??t.keyword))},Gt=()=>{let e=a,t=_(S()),n=O(`PROOF`),r=Bt(t);if(r){let t=x(r,e);return{kind:`Leaf`,proof:t,span:iC(t.keyword),first:e,end:a-1}}let i=S();if(i.kind!==`Step`)throw ae(`Expected a step number but found ${ne(i)}`);let o=a;D();let s=a,c=O(`QED`)?{kind:`Qed`}:Lt(),l=b(o);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:b(s),span:Wt(l,c),first:e,start:o,end:a-1}},Kt=(e,t,n,r)=>{let a=e[t];if(!a)return{proof:void 0,span:r,next:t,end:void 0};if(a.kind===`Leaf`)return{proof:a.proof,span:a.span,next:t+1,end:a.end};let o=qt(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={..._(i[a.first]),range:b(a.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},qt=(e,t,n,r,i)=>{let a=e[t];if(!a)throw cC(`Unexpected end of (sub)proof at level ${n} before QED step`,r,sC);if(a.kind===`Leaf`)throw cC(`Expecting a proof step but found a${tC[a.proof.kind]} leaf proof`,a.span,sC);if(!i&&a.isProof)throw cC(`PROOF keyword found in step that does not begin subproof`,a.span,oC);let o=a.token.text[1];if(o===`+`&&!i)throw cC(`<+> used but no subproof expected`,a.span,oC);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:bt(a.token);if(s<n||!i&&s>n)return;let c=QS.has(a.body.kind)?Kt(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:St(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{..._(a.token),range:b(a.start,l)}},d=rC(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=qt(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:rC(d,f.span)}},Jt=()=>{if(!Ut())return;let e=[];for(;Ut();)e.push(Gt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=Kt(e,0,0,t.span),r=e[n.next];if(r)throw cC(`extra step(s) after finished proof`,r.span,aC,`Proof.Parser.toplevel`);return n.proof},Yt=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},Xt=()=>{if(S().kind!==`Identifier`||!E(`==`,1))return;let e=de();return D(),e},Zt=()=>{if(!r)return j();let e=te(),t=oe(j);if(t)return t;throw ae(`Expected "====" but found ${ne(e)}`,e)},Qt=e=>{let t=a,n=D(),i=Xt(),o=E(`ASSUME`)?Ft():Zt(),s=r?Jt():Ct(S())?Ht():void 0,c=x({name:i,statement:o,proof:s,location:_(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&o.kind!==`AssumeProve`&&Yt(e,i,o,c.location)},$t=()=>{let e=a,t=D(),n=Xt();return x({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:_(t)},e)},en=()=>{let e=_(k(`----`));k(`MODULE`);let t=ge();k(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),u.push(/* @__PURE__ */ new Set),O(`EXTENDS`)&&ve(()=>{let e=a;n.extends.push(ge()),n.extendsRanges.push(b(e))});;){let t=a,r=S();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),u.pop(),n;if(r.kind===`Separator`){if(E(`MODULE`,1)){let e=en();n.modules.push(e),n.units.push({kind:`Module`,module:e}),k(`====`);continue}D()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=_(D()),r=ht();n.constants.push(...r),e.range=b(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=_(D()),r=ve(()=>{let e=a,t=_(S());return x({name:de(),arity:0,location:t},e)});n.variables.push(...r),e.range=b(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=$t();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Yt(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(E(`USE`)&&E(`ONLY`,1))throw ae(`Expected a module unit but found ${ne(r)}`);let e=jt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=_(D()),r=M();e.range=b(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:tn(n,x(ft(void 0,[],!1,_(r)),t));continue;case`LOCAL`:if(D(),E(`INSTANCE`)){tn(n,x(ft(void 0,[],!0,_(r)),t));continue}tn(n,x(dt(!0),t));continue}r.kind===`Keyword`&&XS.has(r.text)?Qt(n):tn(n,lt(!1))}}},tn=(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}))},nn=en(),rn=he?MS(e):void 0;if(rn!==void 0)throw new s(rn);return nn},xC=e=>bC(e,`tlc`),SC=(e,t)=>bC(e,`tlc`,t),CC=e=>bC(e,`tlapm`),wC=e=>bC(e,`sany`),TC=`$subexpression`,EC=e=>{switch(e.kind){case`Name`:return e.name;case`Operand`:return typeof e.operand==`number`?`argument selector ${e.operand}`:e.operand;case`Bound`:return`!(...)`;case`At`:return`@`;case`Colon`:return`:`}},DC=(e,t,n)=>({operator:e,range:t,args:n,params:n.map(()=>0)}),OC=(e,t)=>new s(`${e} at line ${t.line}, column ${t.column}`),kC=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return kC(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of mt(e)){let e=kC(r,t,n);if(e)return e}},AC=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),jC=(e,t)=>{let n=e.location,r=AC(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 OC(`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 OC(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:TC,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:TC,args:e.args,location:n,resolution:uc},location:n}},MC=(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:uc})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:uc}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:uc};return jC({...t,params:[...t.params,...r]},a)},NC=(e,t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s=0,c,l=!1,u=[],d=[],f=(e,t)=>{let n=r.selectorRanges?.[s];e&&n&&u.push({node:e,error:{location:g(n),message:t}})},p=(e,t)=>{if(!e)throw OC(t,a);fc.set(r,{applications:d,error:{location:g(e),message:t}}),l=!0},m=n=>{let r=[],i=[];for(;s<e.length;){let o=e[s];if(o.kind!==`Name`&&!n)return;if(o.kind!==`Name`)throw OC(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=n?n.find(e=>Jl(e)===c):t(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s++}throw OC(`Unknown operator ${r.join(`!`)}`,a)},h=t=>{let n=m(t);if(!n){l=!0;return}let u=n.definition,f=bc(u),h=s===e.length-1;if(n.args.length!==f&&(!i||n.args.length!==0))return p(r.argumentRanges?.[s]??a.range,`The operator ${ic(n.name)} requires ${f-n.earlier} arguments.`);if(h)return{definition:u,args:n.args};d.push({operator:n.name,range:r.selectorRanges?.[s],args:n.args,params:xc(u)});let g=u.location.range;if(u.isRecursive&&g&&g.module===a.range?.module&&vc(a,g.end))return p(r.selectorRanges?.[s],`Subexpression of \`${n.name}' used inside the operator's definition.`);if(u.kind!==`Operator`)throw OC(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),c=u.body,s++},_=()=>{for(;s<e.length&&!l;){let t=e[s];if(t.kind!==`Name`)return;let n=r.selectorRanges?.[s],a=c&&kC(c,t.name,[]);if(!a)return p(n,`Cannot find label \`${t.name}'.`);let l=a.label.params;if(!i&&t.args.length!==l.length)return p(n,`Label \`${t.name}' used with wrong number of arguments.`);o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...t.args),d.push(DC(t.name,n,t.args)),c=a.label.body,s++}},v=i=>{if(!c)throw OC(`Subexpression selection failed`,a);if(i.kind===`Colon`)return;let l=r.selectorRanges?.[s],u=c.location.range;if((c.kind===`Subexpression`||c.kind===`Identifier`&&c.name.includes(`!`)||c.kind===`Apply`&&c.operator.includes(`!`))&&(u?.module!==a.range?.module||vc(c.location,a))){let e=IC(c,t,n);if(fc.has(e)){p(l,`Choosing operand \`${EC(i)}' of subexpression with no operands.`);return}dc.has(e)&&e.kind!==`Lambda`&&(c=e.kind===`Let`&&e.body.kind===`Apply`&&e.body.operator===TC?e.body:{kind:`Tuple`,elements:[e],location:e.location})}if(c.kind===`Label`){c=c.body,v(i);return}let f=`Nonexistent operand specified by \`${EC(i)}'.`;if(c.kind===`Let`){if(i.kind!==`Operand`||Kc(i.operand,1)!==0){p(l,`A LET/IN expression has only one operand.`);return}o.lets.push(c.definitions),c=c.body;return}let m=Xc(c);if(m&&(i.kind===`Bound`||i.kind===`At`)){o.params.push(...m.names.map(e=>({name:e,arity:0}))),i.kind===`Bound`&&(o.args.push(...i.args),d.push(DC(``,l,i.args))),c=m.body;return}if(c.kind===`Case`){let t=[...c.arms,...c.other?[{condition:void 0,body:c.other}]:[]];if(s===e.length-1){p(l,`Subexpression of CASE must have form !i!j.`);return}let n=i.kind===`Operand`?t[Kc(i.operand,t.length)]:void 0;if(!n){p(l,f);return}s++;let a=e[s],o=a.kind===`Operand`?Kc(a.operand,2):-1,u=r.selectorRanges?.[s];if(o===-1){p(u,`Second selector for CASE subexpression must specify one of two operands.`);return}let d=o===0?n.condition:n.body;if(!d){p(u,`Selecting OTHER in a CASE statement.`);return}c=d;return}let h=m?m.sets:Zc(c);if(!h&&c.kind!==`Identifier`){p(l,`Selecting subexpression of expression that has none.`);return}if(i.kind!==`Operand`){p(l,f);return}let g=h?.[Kc(i.operand,h.length)];g?c=g:p(l,f)},y=h(void 0);if(l)return r;if(y)return MC(y.definition,{...o,args:y.args});for(_();s<e.length&&!l;){let t=e[s];if(t.kind===`Name`){for(;c?.kind===`Label`;)c=c.body;if(c?.kind!==`Let`)throw OC(`A name selector here must be from a LET clause`,a);o.lets.push(c.definitions);let e=h(c.definitions);if(l)return r;if(e)return MC(e.definition,{...o,args:[...o.args,...e.args]});_()}else t.kind!==`Colon`&&f(c,`Subexpression selection failed, probably due to an error in the selected expression.`),v(t),f(c,`An unexpected null node specified by '${EC(e[s])}'.\nThis is probably due to a previous error.`),s++}if(l)return r;if(!c)throw OC(`Subexpression selection failed`,a);let ee=o.params.length,b=o.args.length;if(ee!==b&&(!i||b>0))return p(a.range,`Expected ${ee} arguments but found ${b}.`),r;let x=jC(o,c);return pc.set(x,u),x},PC=(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 qc(e,t,n)},FC=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||mt(e).some(FC),IC=(e,t,n,r=!1)=>{if(!FC(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Zl(e,e=>IC(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>LC(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)=>IC(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Zl(e,e=>IC(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?PC(a.name,[],void 0,t):a.kind===`Apply`?PC(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name)||s?.kind===`Name`&&o[1].kind!==`Name`&&!t(s.name))return a;let c=NC(o,t,n,a,r);return c!==a&&dc.add(c),c},LC=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:IC(e.expression,t,n,!0)}))}),RC=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},zC=(e,t)=>LC(e,RC(t.definitions),()=>!1),BC=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=/* @__PURE__ */ new Set([...e.definitions,...r]),a=new Map(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations.map(e=>[e.name,e.location]):[])),o=(e,t)=>{let n=a.get(e.name);return vc(e.location,t)||e.isRecursive&&n!==void 0&&vc(n,t)},s=(e,t)=>n=>{let r=e(n);return r&&(!i.has(r)||o(r,t))?r:void 0},c=RC([...t,...e.definitions]),l=e=>n.has(e),u=RC([...t,...e.definitions,...r]),d=(e,t)=>IC(e,s(u,t),e=>l(e)&&r.every(t=>t.name!==e)),f=e=>{let t=s(c,e),n=e=>l(e)||!t(e),r=e=>IC(e,t,n),i=e=>e.map(e=>e.kind===`ModuleFact`?e:r(e)),a=e=>e.map(e=>({...e,set:r(e.set)})),o=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&r(e.set)}:o(e)),conclusion:r(e.conclusion)}:r(e),u=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:i(e.facts)};case`Instance`:return LC(e,t,n);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?LC(e,t,n):Xl(e,r))};case`Have`:case`Case`:return{...e,expression:r(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(r)};case`Take`:return{...e,bounds:a(e.bounds)};case`Pick`:return{...e,bounds:a(e.bounds),body:r(e.body)};case`Assert`:return{...e,statement:o(e.statement)};default:return e}},d=e=>e?.kind===`By`?{...e,facts:i(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:u(e.body),proof:d(e.proof)}))}:e;return{resolveFacts:i,resolveStatement:o,resolveProof:d}},p={...e,theorems:e.theorems.map(e=>{let t=f(e.location);return{...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:t.resolveStatement(e.statement),proof:t.resolveProof(e.proof)}}),uses:e.uses.map(e=>({...e,facts:f(e.location).resolveFacts(e.facts)}))};return e.definitions.some(e=>FC(e.body))||e.assumptions.some(e=>FC(e.expression))?{...p,definitions:e.definitions.map(e=>Xl(e,t=>d(t,e.location))),assumptions:e.assumptions.map(e=>({...e,expression:d(e.expression,e.location)}))}:p},VC=(e,t)=>e.maxLevels[t]??3,HC=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Od({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=>Iu(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Iu(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Lu(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Nu(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)&&Iu(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(kd(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),l=i(t.module),u=n(t.instancer),d=/* @__PURE__ */ new Map;t.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...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=u.analyze(n,d);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(n,d),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),p=(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(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&o(p(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&o(p(e.name,n));let r=e.operator;if(r)for(let n=0;n<e.arity;n++){let i=l.argConstraints.get(ju(e.name,n));i!==void 0&&VC(r,n)<i&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${n+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let n=Nu(e),r=f.find(e=>e.name===n.operator)?.operator,i=f.find(e=>e.name===n.param);if(!r||!i)return;let a=VC(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 c([...r.values()])}},UC=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],WC=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),GC=new Map(nc.flatMap(e=>e.map(t=>[t,e[0]]))),KC=e=>GC.get(e)??e,qC=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},JC=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:gt(e)&2147483647,kind:t,isLocal:n}),YC=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:KC(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:KC(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},XC=(e,t)=>{let n=[];for(let r=t;;){let t=YC(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},ZC=e=>({line:e.line,column:e.column}),QC=(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!==`.`){if(a.text===`EXTENDS`){let n=XC(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}}return{references:s,end:e.length}};return i(0,t??``).references},$C=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,ew={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},tw=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&$C(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&$C(e[n+1],e[n+2])?n+=$C(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>ew[e])}"`:r.text)}return t},nw=e=>e[2]?.text,rw=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},iw=(e,t)=>e.find(e=>e.name===t)??e.map(e=>iw(e.modules,t)).find(Boolean),aw=e=>{let t=e===void 0?[]:Ee(e),n;return{tokens:t,ranges:rw(t),getModule:()=>n??=e===void 0?xC(``):SC(e,t)}},ow=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=aw(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??cc.get(i)??Xp.get(i)??yC(e,i),c=a(s),l=c.tokens,u=c.ranges.get(nw(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>iw(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},sw=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=XC(t,e+1);i.push({location:ZC(t[e]),apply:e=>r.forEach(t=>e.put(JC(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:ZC(n),apply:t=>t.put(JC(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&XC(t,u+1).every(e=>s.has(e))&&o(u,`definition`),WC.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(ZC(n)),i.push({location:ZC(n),apply:e=>e.put(JC(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(JC(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=KC(e.name);i.push({location:e.location,apply:n=>n.put(JC(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(JC(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(JC(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>vc(e.location,t.location)?-1:+!!vc(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=qC();n.set(i??``,o),tc.toReversed().forEach(e=>o.put(JC(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},cw=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};t.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),ac.forEach(i);let o=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=QC(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;tw(o(void 0)).forEach((e,t)=>{t===3&&sc.forEach(i),i(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,r]=t;if(d.add(`${n.key}>${r}`),v.set(n.unit,[...v.get(n.unit)??[],r]),!_.has(r)){if(_.add(r),e(r).tokens.length===0){let t=n.unit??nw(e(void 0).tokens);throw te(r,t)}tw(o(r)).forEach(i)}}UC.forEach(i);let ee=/* @__PURE__ */ new Set,b=e=>{if(ee.has(e))return;ee.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(b),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return b(void 0),n.forEach(e=>{let t=o(e);tw(t).forEach(i),t.forEach(e=>{e.kind===`String`&&i(e.text)})}),oc.forEach(i),[...r]},lw=(e,t)=>{let n=ow(e,t),r=n.getParsed,i,a=()=>i??=sw(r);return{getStringOrder:(e,t)=>cw(r,e,t),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},uw=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),dw=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],fw=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof s))throw n;let r=MS(e);throw r===void 0?n:c([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},pw=e=>new s(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),mw=(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)}.`},hw=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,gw=e=>e===`Theorem`?`ThmOrAssumpDefNode`:hw(e),_w=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:hu(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),vw=(e,t)=>{let n=ht(e);return n!==void 0&&t.has(n)||mt(e).some(e=>vw(e,t))},yw=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(uu(e),n.get(e)??n.size)),n},bw=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),xw=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Rg(e);if(e.kind===`Number`&&!hn(e.value))throw zg(e);xw(e.kind===`Let`?[...mt(e),...bw(e.instances??[])]:mt(e))}),Sw=(e,t)=>{let n=t.order??lw(t.source,t.loadModule),r=n.parseModule(t.source),i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,f=new Map(sm.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=Cp(e.checkDeadlock,t.seed);m.isWarningEnabled=t.isWarningEnabled??!0,m.isTool=t.isTool??!1,m.version=t.version??`master`,m.readLine=t.readLine;let h=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,v=[],y=/* @__PURE__ */ new Map,ee=[],b=[],x=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),S=0,ne=e=>`${e}#${S++}`,re=[],T=[],ie=HC(e=>{let t=_.get(e)??O(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>i.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>i.get(t.visible.get(e)?.key??e)}}),ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=e=>{let n=p.get(e);if(n)return n;let r=km(e,t.print,m,t.files,f);if(!r)return;Dm.get(e)?.forEach(ce);let i=/* @__PURE__ */ new Map;return Om.get(e)?.forEach(e=>ce(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{f.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Ou.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Au(e,t.name)??i.get(t.name)?.range})}),p.set(e,i),i},le=e=>{let n=Dm.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=ce(e);return r&&x(e,n),r&&n.includes(`Integers`)&&ce(`Integers`),r},E=e=>(xw([...e.definitions.flatMap(pt),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...bw(e.instances)]),e.modules.forEach(E),e);E(r);let D=(e,r)=>{let i=t.loadModule?.(e)??Qp(m.version).get(e)??yC(t.source,e);if(i===void 0)throw te(e,r);let a=fw(i,e,n);if(a.name!==e)throw c([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return E(a)},ue=e=>{let t=b.indexOf(e.name);if(t!==-1){let n=[...b.slice(t),e.name].map(e=>`${e}.tla`);throw new s(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];b.push(e.name),ee.push(n);let o=ve(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:T,levelChecks:a});if(ee.pop(),b.pop(),i.length>0)throw c(i,!1,void 0,T);let l=r.find(e=>n.has(e.name)),u=l&&h.get(l.name),d=u&&mw(l,u.module);if(d)throw c([d],!1,void 0,T);if(l)throw pw(l);return a.forEach(e=>e()),{linked:o,closure:n}},O=(e,n)=>{let r=h.get(e);if(r)return x(e,y.get(e)??[]),r;let a=ue(D(e,n)),o=/* @__PURE__ */ new Map;return Em(e,t.print,m,t.files,f,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new w(`No definition of ${e} to fall back to`);return W(r.body,{environment:n.environment,scope:G_(j_(r),i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=a.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&uw.has(e))return;let r=i.get(n.key);r&&o.set(t.name,r),f.set(n.key,t),i.delete(n.key)}),h.set(e,a.linked),y.set(e,a.closure),x(e,a.closure),a.linked},k=(e,t,n,r,s)=>{let c=s?void 0:le(e.module);if(c)return de(e,c);let d=s??O(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=dw(d),p=`#${S++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=zl(zC(e,t),f,t,n);re.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>u.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=Cu({params:g,substitutions:new Map([...h].map(e=>[e[0],Gl(e[1],m)])),variables:new Set(d.variables),getDefinition:e=>i.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>a.get(e)===!0,addDefinition:(n,s,c)=>{let u=ne(`${s}@${t.name}`),d=c(u);return i.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&oe.set(u,`${e.name}!${oe.get(n)??s}`),a.set(u,!r),o.set(u,{source:n,prefix:e.params.length}),u},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return fe(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&ae.set(r,{name:n,location:e.location}),e.name!==void 0&&se.set(r,n),r})},de=(e,t)=>e.name===void 0?t:new Map([...t].map(t=>[`${e.name}!${t[0]}`,{key:t[1].key,arity:t[1].arity,params:t[1].params,kind:t[1].kind}])),fe=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(e=>!i.has(e[0])).map(t=>{if(e.name===void 0)return[t[0],{key:r(t[1].key,t[0]),arity:t[1].arity,params:t[1].params,kind:t[1].kind,range:a.get(t[1].key)===!0?e.location.range:t[1].range}];let n=`${e.name}!${t[0]}`;return[n,{key:r(t[1].key,n),arity:t[1].arity+e.params.length,params:t[1].params&&[...e.params.map(e=>e.arity),...t[1].params],kind:t[1].kind}]}))},pe=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),me=(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=pe(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:gu(r,n),location:n}}},he=(e,t,n,r)=>{let o=e.location,s=r?void 0:le(e.module);if(s)return e.name===void 0?[]:[...s].map(t=>{let n=pe(t[1].arity,t[1].params);return _u(`${e.name}!${t[0]}`,t[1].key,[...e.params,...n],n,o)});let c=r??O(e.module,n),l=`#${S++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=dw(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};re.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>vw(f(e),p),h=d.map(t=>{let n=me(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=[],_=Cu({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:gu(e.params,o),location:o,resolution:uc}:hu(`${t.name}${l}`,o)])),variables:new Set(c.variables),getDefinition:e=>i.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>a.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:ne}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(e=>!v.has(e[0])).map(t=>{let n=_.getKey(t[1].key),r=pe(t[1].arity,t[1].params),i=[...e.params,...r];return _u(e.name===void 0?t[0]:`${e.name}!${t[0]}`,n,i,n===t[1].key?r:i,o)});return[...h,...g,...y]},ge=e=>[...e].flatMap(e=>{let t=i.get(e[1].key);return t?[{...t,name:e[0]}]:[]}),_e=/* @__PURE__ */ new Map,ve=(e,n)=>{let o=dx(e,t.loadClass?.(e.name),e===r);_e.set(e.name,o.overrides);let s=o.module,c=re.length,l=new Map([...sm.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:Pl,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=m.get(t);if(!n){l.set(t,e),m.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);gw(n.kind)===gw(e.kind)?d.warnings.push({location:r,message:`Warning: the ${hw(n.kind)} of '${t}' conflicts with \nits ${hw(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${hw(e.kind)} of '${t}' conflicts with \nits ${hw(n.kind)} at ${i}.`})}),m=/* @__PURE__ */ new Map,h=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,ee=[],b=[...s.constants],x=s.variables.filter((e,t)=>s.variables.findIndex(t=>t.name===e.name)===t),te=x.map(e=>e.name),S=x.map(e=>e.location);s.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:le(e);if(r){p(r);return}let i=t??O(e,s.name);b.push(...i.constants.filter(e=>b.every(t=>t.name!==e.name)&&!te.includes(e.name))),i.variables.forEach((e,t)=>{te.includes(e)||b.some(t=>t.name===e)||(te.push(e),S.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>h.add(e)),i.modules.forEach((e,t)=>y.set(t,e)),ee.push(i)});let ne=new Map(l),C=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],w=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});C.forEach(e=>m.set(e.name,w(e)));let ae=e=>({key:ce(e),arity:bc(e),params:xc(e),kind:Fl(s,e)?`Theorem`:`Definition`,range:e.location.range}),oe=b.length===0&&te.length===0,ce=e=>s===r?e.name:`${e.name}@${n.id}`,E=/* @__PURE__ */ new Map,D=()=>new Map([...n.modules,...y]),ue=e=>{let t=s.modules.find(t=>t.name===e.module);return t?vc(t.location,e.location)?y.get(t.name):void 0:D().get(e.module)},pe=e=>({imported:l,getInstance:e=>{let t=ue(e),n=t?void 0:le(e.module);if(n)return{declarations:[],symbols:de(e,n),instancer:s.name};let r=t??O(e.module,s.name),i=dw(r);return{declarations:i,symbols:fe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:ce,instanced:E,facts:h,reports:f,warnings:n.warnings}),me=e=>[...C.filter(t=>vc(t.location,e)).map(e=>[e.name,w(e)]),...s.definitions.filter(t=>vc(t.location,e)).map(e=>[e.name,ae(e)])].reduce((e,t)=>e.has(t[0])?e:e.set(t[0],t[1]),new Map(l)),ye=e=>{let t=D(),r=t.get(e.name),i=r&&mw(e,r.module);if(r&&!i)throw pw(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=ve(e,{id:`${n.id}/${e.name}`,symbols:me(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||y.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=k(e,s,pe(s),oe,D().get(e.module));E.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||m.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>vc(e.location,t.location)?-1:1).forEach(e=>e.link());let be=BC(Du(s,(e,t)=>he(e,t,s.name,ue(e))),ge(l));n.errors.push(...Vl(be,pe(be))),be.definitions.forEach(e=>{let t=ce(e);i.set(t,e),a.set(t,!oe);let n=ae(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!vc(r,e.location))&&(l.set(e.name,n),e.isLocal||m.set(e.name,n))});let xe={module:be,constants:b,variables:te,variableLocations:S,visible:l,exported:m,modules:y,extended:ee,facts:/* @__PURE__ */ new Set([...h,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,xe);let Se=re.splice(c).map(e=>({location:e.location,check:()=>ie(e)}));return n.levelChecks.push(()=>Ad(be,{constants:new Set(b.map(e=>e.name)),variables:new Set(te),getDefinition:e=>i.get(l.get(e)?.key??e),getQualifiedName:e=>se.get(l.get(e)?.key??e)},Se,T)),v.push(xe),xe},ye=ue(r).linked,be=t.traceFile,xe=be===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:be}}],Se=[...t.moduleOperators??[],...xe].map(e=>{let t=O(e.module,r.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});v.push(...v.splice(v.indexOf(ye),1)),T.length>0&&!t.isSanyReported&&t.print(d(T));let Ce=t.runtimeInvariants??[];Ce.forEach(e=>{if(e.module===void 0)return;h.set(r.name,ye);let t=O(e.module,r.name);v.splice(v.indexOf(t),1);let n=i.get(t.visible.get(e.name)?.key??e.name);n&&i.set(e.name,n)}),ye.visible.forEach((e,t)=>{let n=i.get(e.key);n&&e.key!==t&&i.set(t,n)}),Se.forEach(e=>{let t=e.key===void 0?void 0:i.get(e.key);e.kind!==`postcondition`&&t&&i.set(e.operator,t)});let we=[],Te=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Te(e,t)),we.push(...e.module.assumptions))};Te(ye,/* @__PURE__ */ new Set);let Ee=ye.constants.map(e=>e.name),De=ye.variables,Oe=Qb(e,{root:ye,moduleSymbols:new Map([...p,...[...h].map(e=>[e[0],e[1].visible]),[r.name,ye.visible]]),definitions:i,builtins:f,copySources:o,operatorConstants:new Map(Se.flatMap(e=>O(e.module,r.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:n}),ke=Oe.constants,A=Oe.substitutions;be!==void 0&&f.forEach((e,t)=>{let n=fm(e);n&&f.set(t,n)});let Ae=yw(De,v.flatMap(e=>e.module.variables.map(e=>e.name))),je=Ud({definitions:i,substitutions:A,constants:ke,variableIndex:Ae,builtins:f,variables:De}),Me={runtime:m,definitions:i,builtins:f,constants:ke,substitutions:A,instanceNames:oe,variables:De,variableIndex:Ae,facts:je,startupValues:Array.from({length:je.ids.size},()=>void 0),substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ne=Od({constants:new Set(ke.keys()),variables:/* @__PURE__ */ new Set([...De,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>f.has(e))]),getDefinition:e=>$g(e,Me)}),Pe=e=>{try{W(e,{environment:Me,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof w)return e;throw e}};A.forEach((e,t)=>{let n=i.get(e),r=Ee.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ne.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Pe(n.body):void 0;if(r){let n=Nt(r)?``:` - specifically: ${r.message}`;throw new C(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),m.version!==`1.7.4`&&(m.isStarted=!0);let Fe=new Set(v.flatMap(e=>e.module.instances.map(e=>e.module))),Ie=n.createDefinitionOrder();return{environment:Me,assumptions:we,variableLocations:ye.variableLocations,instanceActions:ae,startupDefinitions:v.filter(e=>!Fe.has(e.module.name)||dw(e).length===0).flatMap(e=>Ie(e===ye?void 0:e.module.name).flatMap(t=>{let n=i.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:v.flatMap(e=>_e.get(e.module.name)??[]),moduleOperators:Se,runtimeInvariants:Ce,rootName:r.name}},Cw=e=>[...e].map(e=>`${e[0]}>${e[1].name}`).sort().join(`,`),ww=(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},Tw=e=>x(new w(`${l}${e}`),S.error),Ew=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!fn(e)||!fn(i))throw Tw(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Dw=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${Ow(t)}`:n},Ow=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(Ow).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${Dw(e.pattern,e.set)}:${Ow(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(Ow).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${Ow(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>Dw(e.pattern,e.set)).join(`,`)}|->${Ow(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(Ow);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},kw=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,Aw=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new C(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw Tw(`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(!ln(a)||!P(a))throw Tw(`The symmetry operator must specify a set of functions.`);let o=F(a).elements;if(!o.every(dn))throw Tw(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],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=Ow(kw(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(St.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;o.map(Ew).forEach(e=>{e.size>0&&d.set(Cw(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=ww(n,e),r=Cw(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=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(!kw(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=>fn(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},jw=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Nw(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(Nw(e[r],t));return a}},Mw=(e,t)=>{let n=[],r=[];for(let i of e){let e=Nw(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Zn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Zn(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},Nw=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=Mw(e.elements,t);return n?nr(n):e}if(n===`Function`||n===`LazyFunction`&&P(e.domain)){let n=I(e),r=jw(n.domain,t),i=jw(n.range,t)??n.range;if(r){let e=$r(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?ir(n.domain,e.range):e}return i===n.range?n:ir(n.domain,i)}if(n===`Interval`||!ln(e)||!P(e))return e;let r=F(e),i=jw(r.elements,t);return i?qr(i):r},Pw=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=Nw(e[o],i),a===0&&(a=Zn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},Fw={line:0,column:0},Iw=e=>({kind:`Identifier`,name:e,location:Fw}),Lw=e=>({name:e,expression:Iw(e),scope:void 0}),Rw=/* @__PURE__ */ new Set([`name`,`property`]),zw=(e,t,n)=>{let r=$g(t,n);if(!r)throw new C(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new C(Rw.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},Bw=e=>e.body.kind===`Number`||e.body.kind===`String`,Vw=(e,t,n)=>n.constants.has(e)?n.constants.get(e):Bw(t)?void 0:D_(t,n),Hw=(e,t,n)=>{if(n.constants.has(t))throw new C(`The ${e} ${t} cannot be a constant.`);let r=zw(e,t,n);if(Vw(t,r,n)!==void 0)throw new C(`The ${e} ${t} cannot be a constant.`);return r},Uw=(e,t,n)=>{let r=n.constants.has(t)?void 0:zw(e,t,n),i=r?Vw(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new C(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},Ww=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Gw=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),O_(e.startupDefinitions,r),t.invariants.forEach(e=>{Uw(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Kw=(e,t)=>{let n=Od({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=Uw(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1789
1789
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
1790
1790
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
1791
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw
|
|
1792
|
-
all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:St.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),o.length>0)throw new
|
|
1793
|
-
but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&ny(c.expression,e.scope,t)<2)throw v(new y(`TLC cannot handle the temporal formula ${U(c.expression)}`),S.error);let f=ny(c,e.scope,t);if(f===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(f===2)throw new _(`TLC cannot handle this conjunct of the spec:\n${U(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,h=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(g),location:KC},next:o.length===0?void 0:g(o[0],a.length),scope:h,temporals:s,isPropertyFairness:s.length>0&&!d}},sw=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=ew(`property`,e,t);if(!i)return;ny(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;iy(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(aw(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`&&ny(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!M(e)?pg(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=ny(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=U(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new _(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},cw=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},lw=(e,t,n)=>t.flatMap(t=>ew(e,t,n)?[JC(t)]:[]),uw=(e,t)=>{let n=pg(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},dw=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new _(`_POSSIBLE lists ${n} more than once`);$C(`possible`,n,t);let i=JC(n);if(ny(i.expression,void 0,t)===3)throw new _(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return i}),fw=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||M(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},pw=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=pg(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},mw=(e,t)=>e.flatMap(e=>iw(e.expression,t).map(n=>{let r=e.scope===void 0?od(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:fw(n,r,t),predicate:pw(e.expression,t)}})),hw=(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},gw=/[\u0100-\uffff]/,_w=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),vw=e=>e.kind===`String`?gw.test(e.value):e.kind===`Set`&&e.elements.some(vw),yw=e=>e.kind===`String`&&gw.test(e.value)||e.kind===`Apply`&&_w.has(e.operator)||mt(e).some(yw),bw=(e,t)=>e.constants.some(e=>vw(e.value)||(e.args??[]).some(vw))||[...t.definitions.values()].some(e=>yw(e.body)||e.kind===`Function`&&e.bounds.some(e=>yw(e.set))),xw=e=>{if(!un(e))return;let t=vn(L(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},Sw=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},Cw=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),ww=(e,t,n)=>cg(W(e,t),n),Tw=(e,t,n=Dw)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},Ew=(e,t,n)=>{let r=t.kind===`Identifier`?pg(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?m(a):Gh(i)}`},Dw=(e,t)=>Ew(`boolean`,e,t),Ow=(e,t)=>Tw(e.expression,t,(n,r)=>(Tw(e.predicate,t),Dw(n,r))),kw=()=>{},Aw=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=ww(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),jw=(e,t)=>{try{return e(Cw(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},Mw=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=jw(e=>fg(W(n.expression,e),n.expression),t);if(e)return{name:Gh(n.expression),trace:[],message:e.message}}},Nw=(e,t,n,r=!1)=>{let i=bC(t.source,t.loadModule);return An(i.getStringOrder(e)),Fn(t),so(t.fingerprintPolynomial??0),r&&jn(),{order:i,specification:NC(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine})}},Pw=e=>{let t=typeof e.config==`string`?ft(e.config,e.version):e.config,n=Nw(t,e,e.onPrint??console.log),r=n.specification;nw(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=Ny(t,i,r.instanceActions);return i.runtime.getSpecification=()=>Ry(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:Lw(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators),getDescription:o}},Fw=(e,t,n)=>{let r=Mw(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(St.assumptionFalse,e,e),S.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(St.assumptionEvaluationError,i,Ft(St.assumptionEvaluationError,i,!0)),S.assumptionViolation},Iw=e=>v(new y(`${i}Could not find operator: ${e.operator} in module: ${e.module}`),S.error),Lw=(e,t,n,r,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw Iw(e);return{name:e.operator,key:e.key}}),c=rw(e.invariants,t),l=ow(e,t,n,r,a),u=sw(e,t,a),d=e.properties[0],f=d&&pg(d,t)?.location.range,p=e.specification,h=p&&pg(p,t)?.location.range;l.isPropertyFairness&&f&&h&&a?.({kind:`warning`,code:St.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${d} at ${m(f)} equals\nthe fairness constraints of the behavior specification ${p} at ${m(h)}.\nTherefore, checking whether ${p} => ${d} using TLC will never result in a violation of ${d}.`});let g=mw([...c,...u.invariants],t),b=[...new Map(g.map(e=>[e.predicate,e])).values()],ee=g.length>0||u.actionProperties.length>0||u.liveness.length>0;if(l.init===void 0&&(ee||u.initialPredicates.length>0||t.variables.length>0))throw new _(t.runtime.version===`1.7.4`?Dt:`The configuration file did not specify the initial state predicate.`);if(l.next===void 0&&ee)throw new _(`The configuration file did not specify the next state predicate.`);let x=lw(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),te=mw(x,t),C=lw(`action constraint`,e.actionConstraints,t),w=t.coverage,ne=(e,n,r=!0)=>n.flatMap(n=>{if(!w)return[];let i=r?pw(n.expression,t):n.expression,a=Ao(r?n.name:void 0,i,t),o=Oo(w,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),T=[...ne(`invariant`,c),...ne(`invariant`,u.invariants,!1)],re=ne(`constraint`,C),ie=ne(`constraint`,x),ae=ne(`implied`,u.initialPredicates,!1),oe=ne(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),se=(e,n,r,i)=>{try{return Ho(e,n.node,()=>W(n.expression,Cw(t,r,i,n.scope)))}catch{return}},ce=(e,t,n)=>w!==void 0&&e.every(e=>se(w,e,t,n)===!0),le=(e,t,n)=>{if(w){for(let r of e){let e=se(w,r,t,n);if(typeof e!=`boolean`)return;if(!e)return w.primary[r.node]++,!1;w.secondary[r.node]++}return!0}};e.rlReward!==void 0&&XC(`rlreward`,e.rlReward,t),e.periodic!==void 0&&XC(`periodic`,e.periodic,t);let ue=dw(e.possible,t);if(t.variables.length===0)return;let de=e.symmetry===void 0?void 0:VC(e.symmetry,t,e.substitutions),fe=e.view===void 0?void 0:$C(`view function`,e.view,t),pe=e.view??s(`view`)[0]?.name,me=pe===void 0?void 0:JC(pe),E=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:KC};return{...e,unchanged:t}}),D=e=>ny(e.expression,void 0,t)>=2,O=ue.filter(e=>!D(e)),k=ue.filter(D),he=t.runtime,ge,_e=()=>{if(ge)return ge;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return ge=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),ge},ve=(e,n)=>W(e,Cw(t,n,void 0)),ye=e=>{let t=de===void 0?e:GC(e,de,_e());return bo(me===void 0?_e().map(e=>t[e]):[ve(me.expression,t)])},be=e=>ce(ae,e)?void 0:u.initialPredicates.find(n=>!Tw(n.expression,Cw(t,e,void 0,n.scope))),xe=/* @__PURE__ */ new WeakSet,Se=(e,n,r)=>{let i=r&&!xe.has(r)?r:void 0;if(hw(e,n,i))return!1;try{let r=Cw(t,n,void 0,e.scope),a=e.membership;return i&&a?!Qi(n[a.variable],i[a.variable],W(a.set,r)):!Ow(e,r)}catch(t){throw r?Vt(v(t,S.safetyEvaluationFailure),St.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},Ce=bw(e,t);he.getFingerprint=ye;let we=()=>{let e=ue.find(e=>!he.possibleCounts.get(e.name));if(!e)return;let n=uw(e.name,t),r=n?` at ${m(n)}`:``;return{name:e.name,code:St.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:N(R(jf(he),!0))}},Te=fe?.body.kind===`Tuple`?fe.body.elements:[],Ee=Te.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),De=fe?.body.kind===`Tuple`&&Ee.length===Te.length&&new Set(Ee).size===Ee.length,Oe=(e,n)=>De?_e().filter(e=>Ee.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${N(R(n[e]))}\n`).join(``):N(R(ve(e,n))),ke=(e,n,r)=>Tw(e.expression,Cw(t,n,r),e=>`${i}${Dw(e,t)}`),A=e=>{let n=Object.fromEntries(_e().map(n=>[t.variables[n],e[n]]));return me===void 0?n:Ln(n,()=>Oe(me.expression,e))};return he.toRecord=A,{properties:u,spec:l,toRecord:A,evaluateAlias:(e,n,r,i)=>{try{$C(`alias`,e,t);let i=W(qC(e),Cw(t,n,r)),a=xw(i);return a===void 0?A(n):zn(a,e)}catch(e){if(!(e instanceof _||e instanceof y))throw e;return{...A(n),_ALIASEvalError:It(e.message,i)}}},isSymmetric:de!==void 0,isConstrained:te.length>0||C.length>0,getTypedChecks:n=>{if(w!==void 0||ue.length>0||e.periodic!==void 0||[...g,...te].some(e=>e.scope!==void 0)||C.length>0||u.actionProperties.some(e=>e.scope!==void 0)||u.liveness.length>0&&(n===void 0||me!==void 0)||l.init===void 0||l.next===void 0)return;let r=b.map(e=>e.predicate),i=[...new Set(te.map(e=>e.predicate))],a=u.initialPredicates.map(e=>e.expression),o=[...t.facts.ids.keys()],s=cw(l.scope),c=e=>Vg(e,t)===void 0&&rd(e,t,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&ed(e,t)&&c(e))||nd([l.init,l.next,...r,...i,...a,...u.actionProperties.flatMap(e=>[e.action,e.subscript]),...me?[me.expression]:[],...s,...ib(n??[])],t,`replayed`))?void 0:{init:l.init,next:l.next,scope:l.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>be(e)===void 0,actionProperties:u.actionProperties,symmetry:de,view:me?.expression,variableOrder:_e(),liveness:n}},getTlcOrder:_e,getStoredFingerprints:(e,t)=>me!==void 0||Ce?BigInt64Array.from(e,ye):So(t,_e()),getFingerprintState:e=>{if(Ce)return[String(ye(e))];let t=de===void 0?e:GC(e,de,_e());return me===void 0?t:[ve(me.expression,t)]},findViolatedInvariant:(e,t)=>{if(ce(T,e))return;let n=g.find(n=>Se(n,e,t));return n&&xe.add(e),n},getViolatedInvariants:e=>{let t=b.filter(t=>g.some(n=>n.predicate===t.predicate&&Se(n,e,void 0)));return t.length>0&&xe.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Tw(n,Cw(t,e,void 0,r));te.every(e=>r(e.predicate,e.scope))&&n();let i=b.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=u.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(te.every(e=>Tw(e.predicate,Cw(n,t,void 0,e.scope)))&&C.every(r=>Tw(r.expression,Cw(n,e,t,r.scope))))||r())||b.every(e=>Tw(e.predicate,Cw(n,t,void 0,e.scope))))&&E.every(r=>Tw(r.box,Cw(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>le(ie,e)??te.every(r=>hw(r,e,n)||Ow(r,Cw(t,e,void 0))),findFailedInitialPredicate:be,findViolatedActionProperty:(e,n)=>ce(oe,e,n)?void 0:E.find(r=>{try{return!Tw(r.action,Cw(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!ww(r.unchanged,Cw(t,e,n,r.scope),`a subscript`)}catch(e){throw Vt(Rw(e),St.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>le(re,e,t)??C.every(n=>ke(n,e,t)),getExcludingConstraints:(e,n)=>[...te.filter(e=>!Ow(e,Cw(t,n,void 0))),...C.filter(t=>!ke(t,e,n))].map(e=>{let n=uw(e.name,t);return n?m(n):e.name}),trackStatePossible:O.length===0?kw:e=>Aw(O,he,Cw(t,e,void 0)),trackActionPossible:k.length===0?kw:(e,n)=>Aw(k,he,Cw(t,e,n)),findUnwitnessedPossible:we,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=qC(e.rlReward),o=W(a,Cw(t,n,r));if(typeof o!=`number`)throw new y(Ew(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=pg(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!ZC(n)&&Vg(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw v(new y(i),S.configParseError)}let a=(e,n)=>{let r=jw(e=>Tw(qC(n),e),t);if(!r)return;let i=pg(n,t)?.body,a=uw(n,t),o=a?` at ${i?.kind===`Number`?Gh(i):m(a)}`:``;return r.message===void 0?{name:e,code:St.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:St.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=we();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},Rw=e=>e instanceof x?v(e,e.exitCode):e,zw=(e,t)=>e*((t-e)/2**64),Bw=e=>e.includes(`.`)?e:`${e}.0`,Vw=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Bw(String(e));let[n,r]=e.toExponential().split(`e`);return`${Bw(n)}E${r.replace(`+`,``)}`},Hw=e=>e!==void 0&&e>=`0`&&e<=`9`,Uw=e=>{if(e===0)return`0.0`;let t=Vw(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;Hw(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;Hw(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;Hw(t[n])&&r<2;)i+=t[n++],r++;for(Hw(t[n])&&Number(t[n])>=5&&(i=Ww(i));Hw(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},Ww=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Ww(r)}.`:n===`9`?`${Ww(r)}0`:`${r}${Number(n)+1}`},Gw=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},Kw=(e,t,n)=>{if(zw(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},qw=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=0,o=n.find(t=>(a+=e[t],a>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}).`},Jw=[void 0,`lambda`,`tuple`,`record`],Yw=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=la(e.domain);return t?(a(7),a(Jw.indexOf(or(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(Jw.indexOf(or(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},Xw=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return $n(t.strings[n[r++]]);if(e===5)return tr(i(n[r++]));let a=Jw[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=si({kind:`Interval`,low:e,high:e+t-1});return ar(rr(o,i(t)),a)}let o=n[r++],s=i(o);return ar(rr(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Fh as $,I as $t,Ny as A,$t as At,uv as B,li as Bt,IS as C,Ao as Ct,rb as D,ho as Dt,ab as E,go as Et,lv as F,ui as Ft,b_ as G,rn as Gt,dv as H,R as Ht,tv as I,Kr as It,r_ as J,Di as Jt,U as K,er as Kt,av as L,rr as Lt,py as M,yr as Mt,Xv as N,Qr as Nt,Iy as O,uo as Ot,ev as P,$n as Pt,Nh as Q,pr as Qt,nv as R,di as Rt,LS as S,To as St,ob as T,mo as Tt,sv as U,ba as Ut,rv as V,Wa as Vt,$_ as W,xa as Wt,Vg as X,F as Xt,pg as Y,Mn as Yt,f_ as Z,gr as Zt,nw as _,tt as _n,nd as _t,Kw as a,zt as an,jm as at,MS as b,Ee as bn,Ro as bt,Nw as c,Zt as cn,dp as ct,Mw as d,Ht as dn,rp as dt,St as en,Ph as et,Cw as f,Jt as fn,Nf as ft,tw as g,ft as gn,ed as gt,Fw as h,mt as hn,uf as ht,Gw as i,It as in,Pm as it,Ry as j,Xn as jt,Ly as k,bo as kt,Iw as l,qt as ln,up as lt,Pw as m,gt as mn,of as mt,Yw as n,Et as nn,oh as nt,zw as o,Rt as on,Mm as ot,Sw as p,Lt as pn,If as pt,W as q,nn as qt,Uw as r,Ft as rn,Ih as rt,qw as s,Mt as sn,Nm as st,Xw as t,Ct as tn,Lh as tt,Lw as u,Nt as un,fp as ut,Rw as v,Ke as vn,oc as vt,Gx as w,rs as wt,PS as x,Go as xt,WC as y,xe as yn,Oo as yt,fv as z,tr as zt};
|
|
1791
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw x(new C(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),S.safetyEvaluationFailure)}return[Lw(e)]})},qw=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>qw(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=$g(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&D_(n,t)===void 0)return qw(n.body,t)}return[e]},Jw=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Uy(r,e.scope,t)>0)return!1;let i=W(r,fT(t,void 0,void 0,e.scope));if(i===!1)throw new C(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new C(`The operator ${r.name}, which equals ${L(i)},\ncannot be used as a ${n}`);return!0},Yw=(e,t,n,r,i)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return Hw(n,e,t),Iw(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(e.init!==void 0||e.next!==void 0)throw new C(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let a=[],o=[],s=[],c=t.constants.has(e.specification)?t.constants.get(e.specification):Vw(e.specification,zw(`name`,e.specification,t),t);if(c!==void 0)throw new C(`The value of ${e.specification} is equal to ${L(c)}`);let l=zw(`name`,e.specification,t),u=e.properties.length===1?e.properties[0]:void 0,d=!1;Gy(l.body,void 0,t,!1).forEach(e=>{let c=e.expression,l=e.path.some(e=>{let n=$g(e,t);return n?.kind===`Operator`&&Uy(n.body,void 0,t)===1});if(!l&&Jw(e,t,`spec`))return;let f=c.kind===`Identifier`&&!M(c)?t.variableIndex.get(c.name):void 0;if(!l&&c.kind===`Identifier`&&f!==void 0){let e=n[f].range;throw new C(`The operator ${c.name}, which equals ${e?g(e):c.name},\ncannot be used as a spec`)}if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw x(new C(`TLC does not support temporal existential, nor universal, quantification over state variables.`),S.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){let n=xb(c.expression.subscript,e.scope,t);if(n===void 0&&i?.({kind:`warning`,code:St.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
|
|
1792
|
+
all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:St.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),o.length>0)throw new C(`The specification contains more than one conjunct of the form [][Next]_v,
|
|
1793
|
+
but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&Uy(c.expression,e.scope,t)<2)throw x(new w(`TLC cannot handle the temporal formula ${U(c.expression)}`),S.error);let p=Uy(c,e.scope,t);if(p===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(p===2)throw new C(`TLC cannot handle this conjunct of the spec:\n${U(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,m=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),h=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(h),location:Fw},next:o.length===0?void 0:h(o[0],a.length),scope:m,temporals:s,isPropertyFairness:s.length>0&&!d}},Xw=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=Uw(`property`,e,t);if(!i)return;Uy(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Gy(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(Jw(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&Uy(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!M(e)?$g(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=Uy(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=U(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new C(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},Zw=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},Qw=(e,t,n)=>t.flatMap(t=>Uw(e,t,n)?[Lw(t)]:[]),$w=(e,t)=>{let n=$g(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},eT=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new C(`_POSSIBLE lists ${n} more than once`);Hw(`possible`,n,t);let i=Lw(n);if(Uy(i.expression,void 0,t)===3)throw new C(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return i}),tT=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||M(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},nT=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=$g(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},rT=(e,t)=>e.flatMap(e=>qw(e.expression,t).map(n=>{let r=e.scope===void 0?$d(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:tT(n,r,t),predicate:nT(e.expression,t)}})),iT=(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},aT=/[\u0100-\uffff]/,oT=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),sT=e=>e.kind===`String`?aT.test(e.value):e.kind===`Set`&&e.elements.some(sT),cT=e=>e.kind===`String`&&aT.test(e.value)||e.kind===`Apply`&&oT.has(e.operator)||mt(e).some(cT),lT=(e,t)=>e.constants.some(e=>sT(e.value)||(e.args??[]).some(sT))||[...t.definitions.values()].some(e=>cT(e.body)||e.kind===`Function`&&e.bounds.some(e=>cT(e.set))),uT=e=>{if(!dn(e))return;let t=yn(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},dT=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},fT=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),pT=(e,t,n)=>Jg(W(e,t),n),mT=(e,t,n=gT)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new w(n(e,t.environment));return r},hT=(e,t,n)=>{let r=t.kind===`Identifier`?$g(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?g(a):jg(i)}`},gT=(e,t)=>hT(`boolean`,e,t),_T=(e,t)=>mT(e.expression,t,(n,r)=>(mT(e.predicate,t),gT(n,r))),vT=()=>{},yT=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=pT(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),bT=(e,t)=>{try{return e(fT(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof w)return{message:e.message};throw e}},xT=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=bT(e=>Qg(W(n.expression,e),n.expression),t);if(e)return{name:jg(n.expression),trace:[],message:e.message}}},ST=(e,t,n,r=!1)=>{let i=lw(t.source,t.loadModule);return jn(i.getStringOrder(e,(t.runtimeInvariants??[]).flatMap(e=>e.module??[]))),In(t),co(t.fingerprintPolynomial??0),r&&Mn(),{order:i,specification:Sw(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine,runtimeInvariants:t.runtimeInvariants})}},CT=e=>{let t=typeof e.config==`string`?ft(e.config,e.version):e.config,n=ST(t,e,e.onPrint??console.log),r=n.specification;Gw(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=bb(t,i,r.instanceActions);return i.runtime.getSpecification=()=>Tb(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:ET(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators,r.runtimeInvariants),getDescription:o}},wT=(e,t,n)=>{let r=xT(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(St.assumptionFalse,e,e),S.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(St.assumptionEvaluationError,i,Ft(St.assumptionEvaluationError,i,!0)),S.assumptionViolation},TT=e=>x(new w(`${l}Could not find operator: ${e.operator} in module: ${e.module}`),S.error),ET=(e,t,n,r,i,a=[],o=[])=>{let s=e=>a.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw TT(e);return{name:e.operator,key:e.key}}),c=Kw(e.invariants,t),u=Yw(e,t,n,r,i),d=Xw(e,t,i),f=e.properties[0],p=f&&$g(f,t)?.location.range,m=e.specification,h=m&&$g(m,t)?.location.range;u.isPropertyFairness&&p&&h&&i?.({kind:`warning`,code:St.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${f} at ${g(p)} equals\nthe fairness constraints of the behavior specification ${m} at ${g(h)}.\nTherefore, checking whether ${m} => ${f} using TLC will never result in a violation of ${f}.`});let _=rT([...c,...d.invariants],t),v=_.length>0||d.actionProperties.length>0||d.liveness.length>0;if(u.init===void 0&&(v||d.initialPredicates.length>0||t.variables.length>0))throw new C(t.runtime.version===`1.7.4`?Dt:`The configuration file did not specify the initial state predicate.`);if(u.next===void 0&&v)throw new C(`The configuration file did not specify the next state predicate.`);let y=rT(o.map(e=>{let n=$g(e.name,t);return{name:e.name,expression:n?.kind===`Operator`?n.body:Iw(e.name),scope:void 0}}),t),ee=[..._,...y],b=[...new Map(ee.map(e=>[e.predicate,e])).values()],te=Qw(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),ne=rT(te,t),re=Qw(`action constraint`,e.actionConstraints,t),T=t.coverage,ie=(e,n,r=!0)=>n.flatMap(n=>{if(!T)return[];let i=r?nT(n.expression,t):n.expression,a=jo(r?n.name:void 0,i,t),o=ko(T,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),ae=[...ie(`invariant`,c),...ie(`invariant`,d.invariants,!1)],oe=ie(`constraint`,re),se=ie(`constraint`,te),ce=ie(`implied`,d.initialPredicates,!1),le=ie(`implied`,d.actionProperties.map(e=>({...e,expression:e.box})),!1),E=(e,n,r,i)=>{try{return Uo(e,n.node,()=>W(n.expression,fT(t,r,i,n.scope)))}catch{return}},D=(e,t,n)=>T!==void 0&&e.every(e=>E(T,e,t,n)===!0),ue=(e,t,n)=>{if(T){for(let r of e){let e=E(T,r,t,n);if(typeof e!=`boolean`)return;if(!e)return T.primary[r.node]++,!1;T.secondary[r.node]++}return!0}};e.rlReward!==void 0&&zw(`rlreward`,e.rlReward,t),e.periodic!==void 0&&zw(`periodic`,e.periodic,t);let O=eT(e.possible,t);if(t.variables.length===0)return;let k=e.symmetry===void 0?void 0:Aw(e.symmetry,t,e.substitutions),de=e.view===void 0?void 0:Hw(`view function`,e.view,t),fe=e.view??s(`view`)[0]?.name,pe=fe===void 0?void 0:Lw(fe),me=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Fw};return{...e,unchanged:t}}),he=e=>Uy(e.expression,void 0,t)>=2,ge=O.filter(e=>!he(e)),_e=O.filter(he),ve=t.runtime,ye,be=()=>{if(ye)return ye;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return ye=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),ye},xe=(e,n)=>W(e,fT(t,n,void 0)),Se=e=>{let t=k===void 0?e:Pw(e,k,be());return xo(pe===void 0?be().map(e=>t[e]):[xe(pe.expression,t)])},Ce=e=>D(ce,e)?void 0:d.initialPredicates.find(n=>!mT(n.expression,fT(t,e,void 0,n.scope))),we=/* @__PURE__ */ new WeakSet,Te=(e,n,r)=>{let i=r&&!we.has(r)?r:void 0;if(iT(e,n,i))return!1;try{let r=fT(t,n,void 0,e.scope),a=e.membership;return i&&a?!$i(n[a.variable],i[a.variable],W(a.set,r)):!_T(e,r)}catch(t){throw r?Vt(x(t,S.safetyEvaluationFailure),St.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},Ee=lT(e,t);ve.getFingerprint=Se;let De=()=>{let e=O.find(e=>!ve.possibleCounts.get(e.name));if(!e)return;let n=$w(e.name,t),r=n?` at ${g(n)}`:``;return{name:e.name,code:St.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:N(L(wp(ve),!0))}},Oe=de?.body.kind===`Tuple`?de.body.elements:[],ke=Oe.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),A=de?.body.kind===`Tuple`&&ke.length===Oe.length&&new Set(ke).size===ke.length,Ae=(e,n)=>A?be().filter(e=>ke.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${N(L(n[e]))}\n`).join(``):N(L(xe(e,n))),je=(e,n,r)=>mT(e.expression,fT(t,n,r),e=>`${l}${gT(e,t)}`),Me=e=>{let n=Object.fromEntries(be().map(n=>[t.variables[n],e[n]]));return pe===void 0?n:Rn(n,()=>Ae(pe.expression,e))};return ve.toRecord=Me,{properties:d,spec:u,toRecord:Me,evaluateAlias:(e,n,r,i)=>{try{Hw(`alias`,e,t);let i=W(Iw(e),fT(t,n,r)),a=uT(i);return a===void 0?Me(n):Bn(a,e)}catch(e){if(!(e instanceof C||e instanceof w))throw e;return{...Me(n),_ALIASEvalError:It(e.message,i)}}},isSymmetric:k!==void 0,isConstrained:ne.length>0||re.length>0,getTypedChecks:n=>{if(T!==void 0||O.length>0||e.periodic!==void 0||[...ee,...ne].some(e=>e.scope!==void 0)||re.length>0||d.actionProperties.some(e=>e.scope!==void 0)||d.liveness.length>0&&(n===void 0||pe!==void 0)||u.init===void 0||u.next===void 0)return;let r=b.map(e=>e.predicate),i=[...new Set(ne.map(e=>e.predicate))],a=d.initialPredicates.map(e=>e.expression),o=[...t.facts.ids.keys()],s=Zw(u.scope),c=e=>D_(e,t)===void 0&&Xd(e,t,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&Kd(e,t)&&c(e))||Yd([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...pe?[pe.expression]:[],...s,...Gb(n??[])],t,`replayed`))?void 0:{init:u.init,next:u.next,scope:u.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>Ce(e)===void 0,actionProperties:d.actionProperties,symmetry:k,view:pe?.expression,variableOrder:be(),liveness:n}},getTlcOrder:be,getStoredFingerprints:(e,t)=>pe!==void 0||Ee?BigInt64Array.from(e,Se):Co(t,be()),getFingerprintState:e=>{if(Ee)return[String(Se(e))];let t=k===void 0?e:Pw(e,k,be());return pe===void 0?t:[xe(pe.expression,t)]},findViolatedInvariant:(e,t)=>{let n=(D(ae,e)?y:ee).find(n=>Te(n,e,t));return n&&we.add(e),n},getViolatedInvariants:e=>{let t=b.filter(t=>ee.some(n=>n.predicate===t.predicate&&Te(n,e,void 0)));return t.length>0&&we.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>mT(n,fT(t,e,void 0,r));ne.every(e=>r(e.predicate,e.scope))&&n();let i=b.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=d.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(ne.every(e=>mT(e.predicate,fT(n,t,void 0,e.scope)))&&re.every(r=>mT(r.expression,fT(n,e,t,r.scope))))||r())||b.every(e=>mT(e.predicate,fT(n,t,void 0,e.scope))))&&me.every(r=>mT(r.box,fT(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>ue(se,e)??ne.every(r=>iT(r,e,n)||_T(r,fT(t,e,void 0))),findFailedInitialPredicate:Ce,findViolatedActionProperty:(e,n)=>D(le,e,n)?void 0:me.find(r=>{try{return!mT(r.action,fT(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!pT(r.unchanged,fT(t,e,n,r.scope),`a subscript`)}catch(e){throw Vt(DT(e),St.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>ue(oe,e,t)??re.every(n=>je(n,e,t)),getExcludingConstraints:(e,n)=>[...ne.filter(e=>!_T(e,fT(t,n,void 0))),...re.filter(t=>!je(t,e,n))].map(e=>{let n=$w(e.name,t);return n?g(n):e.name}),trackStatePossible:ge.length===0?vT:e=>yT(ge,ve,fT(t,e,void 0)),trackActionPossible:_e.length===0?vT:(e,n)=>yT(_e,ve,fT(t,e,n)),findUnwitnessedPossible:De,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=Iw(e.rlReward),o=W(a,fT(t,n,r));if(typeof o!=`number`)throw new w(hT(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=$g(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!Bw(n)&&D_(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw x(new w(i),S.configParseError)}let a=(e,n)=>{let r=bT(e=>mT(Iw(n),e),t);if(!r)return;let i=$g(n,t)?.body,a=$w(n,t),o=a?` at ${i?.kind===`Number`?jg(i):g(a)}`:``;return r.message===void 0?{name:e,code:St.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:St.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=De();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},DT=e=>e instanceof t?x(e,e.exitCode):e,OT=(e,t)=>e*((t-e)/2**64),kT=e=>e.includes(`.`)?e:`${e}.0`,AT=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return kT(String(e));let[n,r]=e.toExponential().split(`e`);return`${kT(n)}E${r.replace(`+`,``)}`},jT=e=>e!==void 0&&e>=`0`&&e<=`9`,MT=e=>{if(e===0)return`0.0`;let t=AT(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;jT(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;jT(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;jT(t[n])&&r<2;)i+=t[n++],r++;for(jT(t[n])&&Number(t[n])>=5&&(i=NT(i));jT(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},NT=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${NT(r)}.`:n===`9`?`${NT(r)}0`:`${r}${Number(n)+1}`},PT=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},FT=(e,t,n)=>{if(OT(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},IT=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=0,o=n.find(t=>(a+=e[t],a>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}).`},LT=[void 0,`lambda`,`tuple`,`record`],RT=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=ua(e.domain);return t?(a(7),a(LT.indexOf(sr(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(LT.indexOf(sr(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},zT=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return er(t.strings[n[r++]]);if(e===5)return nr(i(n[r++]));let a=LT[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=ci({kind:`Interval`,low:e,high:e+t-1});return or(ir(o,i(t)),a)}let o=n[r++],s=i(o);return or(ir(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{xg as $,F as $t,bb as A,$t as At,Zv as B,ui as Bt,CC as C,jo as Ct,Wb as D,go as Dt,Kb as E,_o as Et,Xv as F,di as Ft,ov as G,rn as Gt,Qv as H,L as Ht,Hv as I,qr as It,U_ as J,Oi as Jt,U as K,tr as Kt,Kv as L,ir as Lt,eb as M,br as Mt,Ly as N,$r as Nt,Cb as O,fo as Ot,Vv as P,er as Pt,yg as Q,mr as Qt,Uv as R,fi as Rt,wC as S,Eo as St,qb as T,ho as Tt,Jv as U,xa as Ut,Wv as V,Ga as Vt,Bv as W,Sa as Wt,D_ as X,P as Xt,$g as Y,Nn as Yt,Q_ as Z,_r as Zt,Gw as _,tt as _n,vc as _t,FT as a,zt as an,_h as at,yC as b,Ee as bn,zo as bt,ST as c,Zt as cn,Zp as ct,xT as d,Ht as dn,Ep as dt,St as en,bg as et,fT as f,Jt as fn,kp as ft,Ww as g,ft as gn,Yd as gt,wT as h,mt as hn,Kd as ht,PT as i,It as in,bh as it,Tb as j,Zn as jt,wb as k,xo as kt,TT as l,qt as ln,Xp as lt,CT as m,gt as mn,rp as mt,RT as n,Et as nn,Kh as nt,OT as o,Rt as on,vh as ot,dT as p,Lt as pn,$f as pt,W as q,nn as qt,MT as r,Ft as rn,Sg as rt,IT as s,Mt as sn,yh as st,zT as t,Ct as tn,Cg as tt,ET as u,Nt as un,Qp as ut,DT as v,Ke as vn,ic as vt,MS as w,is as wt,xC as x,Ko as xt,Nw as y,xe as yn,ko as yt,$v as z,nr as zt};
|