tla-ts 0.0.3 → 0.0.4-dev.1a3acf6
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +46 -115
- package/dist/cli.cjs +1 -1
- package/dist/cli.js +1 -1
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +194 -8
- package/dist/index.d.ts +194 -8
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +1006 -0
- package/dist/prove.js +1006 -0
- package/dist/run.cjs +45 -0
- package/dist/run.js +45 -0
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +1377 -18
- package/dist/transfer.js +1377 -18
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +24 -11
- package/src/ast.ts +149 -8
- package/src/bags.ts +26 -30
- package/src/builtins.ts +45 -19
- package/src/bundled-modules.ts +3 -3
- package/src/check.ts +1182 -900
- package/src/cli/options.ts +109 -0
- package/src/cli/run.ts +63 -0
- package/src/cli/shared.ts +106 -0
- package/src/cli/tlapm.ts +374 -0
- package/src/cli/tlc.ts +941 -0
- package/src/cli/xml-exporter.ts +221 -0
- package/src/cli.ts +9 -2
- package/src/codegen.ts +112 -51
- package/src/config.ts +254 -181
- package/src/dependencies.ts +5 -7
- package/src/environment.ts +579 -184
- package/src/errors.ts +287 -4
- package/src/evaluate.ts +1095 -365
- package/src/exit-codes.ts +22 -43
- package/src/fingerprints.ts +49 -14
- package/src/index.ts +11 -0
- package/src/instances.ts +73 -60
- package/src/java-overrides.ts +183 -66
- package/src/json.ts +31 -36
- package/src/levels.ts +197 -54
- package/src/lexer.ts +127 -30
- package/src/liveness-checker.ts +894 -0
- package/src/liveness.ts +246 -596
- package/src/{obligation-action.ts → obligations/action.ts} +248 -74
- package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
- package/src/obligations/equality.ts +260 -0
- package/src/obligations/expression.ts +618 -0
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/obligations/generate.ts +457 -0
- package/src/{obligations.ts → obligations/index.ts} +46 -32
- package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
- package/src/obligations/module.ts +445 -0
- package/src/obligations/normalize.ts +554 -0
- package/src/obligations/operators.ts +176 -0
- package/src/obligations/pragma.ts +195 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
- package/src/obligations/regroup.ts +100 -0
- package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
- package/src/{obligation-source.ts → obligations/source.ts} +174 -216
- package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
- package/src/obligations/substitution.ts +261 -0
- package/src/obligations/temporal.ts +321 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
- package/src/parallel-worker.ts +184 -235
- package/src/parallel.ts +156 -91
- package/src/parser.ts +490 -188
- package/src/pcal/ast.ts +755 -0
- package/src/pcal/parse.ts +1487 -0
- package/src/pcal/tokenize.ts +487 -0
- package/src/pcal/translate.ts +1151 -0
- package/src/pcal/validate.ts +444 -0
- package/src/prover/decide-pool.ts +95 -0
- package/src/prover/deciders.ts +33 -0
- package/src/prover/first-order.ts +175 -0
- package/src/prover/isabelle/LICENSE +36 -0
- package/src/prover/isabelle/LICENSE-tlapm +26 -0
- package/src/prover/isabelle/decide.ts +44 -0
- package/src/prover/isabelle/encode.ts +445 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prover/isabelle/isar/method.ts +367 -0
- package/src/prover/isabelle/isar/proof.ts +28 -0
- package/src/prover/isabelle/isar/statement.ts +57 -0
- package/src/prover/isabelle/isar/theory.ts +192 -0
- package/src/prover/isabelle/isar/type-check.ts +278 -0
- package/src/prover/isabelle/provers/blast/blast.ts +258 -0
- package/src/prover/isabelle/provers/blast/branch.ts +322 -0
- package/src/prover/isabelle/provers/blast/prove.ts +347 -0
- package/src/prover/isabelle/provers/blast/rules.ts +330 -0
- package/src/prover/isabelle/provers/blast/state.ts +180 -0
- package/src/prover/isabelle/provers/blast/term.ts +546 -0
- package/src/prover/isabelle/provers/clasimp.ts +150 -0
- package/src/prover/isabelle/provers/classical.ts +389 -0
- package/src/prover/isabelle/provers/hypsubst.ts +433 -0
- package/src/prover/isabelle/pure/bicompose.ts +174 -0
- package/src/prover/isabelle/pure/consts.ts +32 -0
- package/src/prover/isabelle/pure/conv.ts +79 -0
- package/src/prover/isabelle/pure/drule.ts +264 -0
- package/src/prover/isabelle/pure/envir.ts +331 -0
- package/src/prover/isabelle/pure/goal.ts +53 -0
- package/src/prover/isabelle/pure/interrupt.ts +16 -0
- package/src/prover/isabelle/pure/list.ts +12 -0
- package/src/prover/isabelle/pure/logic.ts +330 -0
- package/src/prover/isabelle/pure/name.ts +98 -0
- package/src/prover/isabelle/pure/net.ts +215 -0
- package/src/prover/isabelle/pure/object-logic.ts +41 -0
- package/src/prover/isabelle/pure/pattern.ts +631 -0
- package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
- package/src/prover/isabelle/pure/rewriter.ts +602 -0
- package/src/prover/isabelle/pure/search.ts +68 -0
- package/src/prover/isabelle/pure/seq.ts +133 -0
- package/src/prover/isabelle/pure/simplifier.ts +106 -0
- package/src/prover/isabelle/pure/table.ts +201 -0
- package/src/prover/isabelle/pure/tactic.ts +168 -0
- package/src/prover/isabelle/pure/tactical.ts +264 -0
- package/src/prover/isabelle/pure/term-ord.ts +105 -0
- package/src/prover/isabelle/pure/term.ts +688 -0
- package/src/prover/isabelle/pure/thm.ts +783 -0
- package/src/prover/isabelle/pure/type.ts +121 -0
- package/src/prover/isabelle/pure/unify.ts +753 -0
- package/src/prover/isabelle/pure/variable.ts +25 -0
- package/src/prover/isabelle/tla/classical-setup.ts +101 -0
- package/src/prover/isabelle/tla/context.ts +74 -0
- package/src/prover/isabelle/tla/logic-data.ts +5 -0
- package/src/prover/isabelle/tla/logic.ts +215 -0
- package/src/prover/isabelle/tla/simpdata.ts +241 -0
- package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prover/ocaml.ts +22 -0
- package/src/prover/prep/action.ts +508 -0
- package/src/prover/prep/enabled-axioms.ts +189 -0
- package/src/prover/prep/fingerprint.ts +388 -0
- package/src/prover/prep/level-comparison.ts +529 -0
- package/src/prover/prep/md5.ts +60 -0
- package/src/prover/prep/methods.ts +221 -0
- package/src/prover/prep/normalize.ts +309 -0
- package/src/prover/prove-worker.ts +22 -0
- package/src/prover/prove.ts +492 -0
- package/src/prover/ptl/decide.ts +68 -0
- package/src/prover/ptl/encode.ts +244 -0
- package/src/prover/ptl/sat.ts +151 -0
- package/src/prover/ptl/tableau.ts +276 -0
- package/src/prover/smt/axioms.ts +209 -0
- package/src/prover/smt/context.ts +108 -0
- package/src/prover/smt/data.ts +636 -0
- package/src/prover/smt/encode.ts +275 -0
- package/src/prover/smt/extensionality.ts +65 -0
- package/src/prover/smt/flatten.ts +112 -0
- package/src/prover/smt/format.ts +154 -0
- package/src/prover/smt/instances.ts +181 -0
- package/src/prover/smt/rewrite.ts +766 -0
- package/src/prover/smt/solver/act-cache.ts +265 -0
- package/src/prover/smt/solver/arith-rewriter.ts +962 -0
- package/src/prover/smt/solver/array.ts +22 -0
- package/src/prover/smt/solver/asserted-formulas.ts +469 -0
- package/src/prover/smt/solver/ast-lt.ts +157 -0
- package/src/prover/smt/solver/ast-util.ts +91 -0
- package/src/prover/smt/solver/ast.ts +1315 -0
- package/src/prover/smt/solver/auf-solver.ts +572 -0
- package/src/prover/smt/solver/case-split-queue.ts +178 -0
- package/src/prover/smt/solver/cg-table.ts +175 -0
- package/src/prover/smt/solver/clause.ts +276 -0
- package/src/prover/smt/solver/conflict-resolution.ts +343 -0
- package/src/prover/smt/solver/context.ts +1292 -0
- package/src/prover/smt/solver/ctx-simplify.ts +334 -0
- package/src/prover/smt/solver/der.ts +224 -0
- package/src/prover/smt/solver/dyn-ack.ts +141 -0
- package/src/prover/smt/solver/e-matching.ts +659 -0
- package/src/prover/smt/solver/enode.ts +259 -0
- package/src/prover/smt/solver/expr-ref.ts +21 -0
- package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prover/smt/solver/fingerprints.ts +92 -0
- package/src/prover/smt/solver/flat-literals.ts +51 -0
- package/src/prover/smt/solver/goal.ts +138 -0
- package/src/prover/smt/solver/hash.ts +173 -0
- package/src/prover/smt/solver/hashtable.ts +166 -0
- package/src/prover/smt/solver/internalizer.ts +1381 -0
- package/src/prover/smt/solver/lbool.ts +5 -0
- package/src/prover/smt/solver/literal.ts +24 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prover/smt/solver/lp/constraints.ts +78 -0
- package/src/prover/smt/solver/lp/containers.ts +296 -0
- package/src/prover/smt/solver/lp/core-solver.ts +504 -0
- package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
- package/src/prover/smt/solver/lp/dependency.ts +51 -0
- package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prover/smt/solver/lp/explanation.ts +46 -0
- package/src/prover/smt/solver/lp/gomory.ts +255 -0
- package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prover/smt/solver/lp/hnf.ts +281 -0
- package/src/prover/smt/solver/lp/int-cube.ts +295 -0
- package/src/prover/smt/solver/lp/int-solver.ts +514 -0
- package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prover/smt/solver/lp/lar-term.ts +62 -0
- package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prover/smt/solver/lp/nex.ts +120 -0
- package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prover/smt/solver/lp/nla-core.ts +968 -0
- package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prover/smt/solver/lp/nla-order.ts +307 -0
- package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prover/smt/solver/lp/nla-types.ts +124 -0
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prover/smt/solver/lp/pdd.ts +971 -0
- package/src/prover/smt/solver/lp/random-updater.ts +138 -0
- package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prover/smt/solver/lp/union-find.ts +96 -0
- package/src/prover/smt/solver/mam-compiler.ts +847 -0
- package/src/prover/smt/solver/mam-interpreter.ts +400 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prover/smt/solver/model-checker.ts +347 -0
- package/src/prover/smt/solver/model-evaluator.ts +262 -0
- package/src/prover/smt/solver/model-finder.ts +155 -0
- package/src/prover/smt/solver/model-generator.ts +97 -0
- package/src/prover/smt/solver/model-macro-solver.ts +728 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prover/smt/solver/nlsat/explain.ts +607 -0
- package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
- package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prover/smt/solver/nlsat/solver.ts +911 -0
- package/src/prover/smt/solver/nlsat/types.ts +43 -0
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prover/smt/solver/nnf.ts +469 -0
- package/src/prover/smt/solver/pattern-inference.ts +351 -0
- package/src/prover/smt/solver/poly-rewriter.ts +477 -0
- package/src/prover/smt/solver/propagate-values.ts +83 -0
- package/src/prover/smt/solver/proto-model.ts +551 -0
- package/src/prover/smt/solver/pull-quant.ts +139 -0
- package/src/prover/smt/solver/qe-lite-der.ts +526 -0
- package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prover/smt/solver/qe-lite.ts +381 -0
- package/src/prover/smt/solver/qi-queue.ts +362 -0
- package/src/prover/smt/solver/quant-tactics.ts +117 -0
- package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prover/smt/solver/quantifier-manager.ts +186 -0
- package/src/prover/smt/solver/random-gen.ts +10 -0
- package/src/prover/smt/solver/rational.ts +165 -0
- package/src/prover/smt/solver/ref-vector.ts +62 -0
- package/src/prover/smt/solver/relevancy.ts +247 -0
- package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prover/smt/solver/rewriter.ts +843 -0
- package/src/prover/smt/solver/rlimit.ts +79 -0
- package/src/prover/smt/solver/smtlib-parser.ts +526 -0
- package/src/prover/smt/solver/solver.ts +71 -0
- package/src/prover/smt/solver/sort.ts +35 -0
- package/src/prover/smt/solver/sticky-generations.ts +69 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prover/smt/solver/theory-lra-model.ts +243 -0
- package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prover/smt/solver/theory-lra-state.ts +43 -0
- package/src/prover/smt/solver/theory-lra.ts +56 -0
- package/src/prover/smt/solver/var-subst.ts +258 -0
- package/src/prover/smt/solver/z3-license.txt +10 -0
- package/src/prover/smt/table.ts +170 -0
- package/src/prover/tlapm/cache.ts +236 -0
- package/src/prover/tlapm/ocaml-marshal.ts +166 -0
- package/src/prover/tlapm/tlapm.ts +96 -0
- package/src/prover/tlaps-module.ts +510 -0
- package/src/prover/verdict.ts +13 -0
- package/src/prover/zenon/LICENSE +32 -0
- package/src/prover/zenon/check/check.ts +105 -0
- package/src/prover/zenon/check/definitions.ts +144 -0
- package/src/prover/zenon/check/equality.ts +182 -0
- package/src/prover/zenon/check/functions.ts +62 -0
- package/src/prover/zenon/check/keys.ts +125 -0
- package/src/prover/zenon/check/propositional.ts +104 -0
- package/src/prover/zenon/check/records.ts +188 -0
- package/src/prover/zenon/check/relations.ts +121 -0
- package/src/prover/zenon/check/rewrites.ts +224 -0
- package/src/prover/zenon/check/sets.ts +302 -0
- package/src/prover/zenon/check/terms.ts +127 -0
- package/src/prover/zenon/check/tla.ts +126 -0
- package/src/prover/zenon/decide.ts +107 -0
- package/src/prover/zenon/encode.ts +378 -0
- package/src/prover/zenon/eqrel.ts +300 -0
- package/src/prover/zenon/equality-rules.ts +435 -0
- package/src/prover/zenon/expr.ts +551 -0
- package/src/prover/zenon/index-table.ts +350 -0
- package/src/prover/zenon/isar-case.ts +513 -0
- package/src/prover/zenon/isar.ts +1249 -0
- package/src/prover/zenon/limits.ts +15 -0
- package/src/prover/zenon/llproof.ts +173 -0
- package/src/prover/zenon/mltoll.ts +1566 -0
- package/src/prover/zenon/node.ts +297 -0
- package/src/prover/zenon/ocaml.ts +169 -0
- package/src/prover/zenon/parse.ts +247 -0
- package/src/prover/zenon/phrase.ts +191 -0
- package/src/prover/zenon/proof.ts +198 -0
- package/src/prover/zenon/propositional-rules.ts +387 -0
- package/src/prover/zenon/rules.ts +94 -0
- package/src/prover/zenon/search.ts +288 -0
- package/src/prover/zenon/tla/functions.ts +151 -0
- package/src/prover/zenon/tla/llproof.ts +480 -0
- package/src/prover/zenon/tla/records.ts +225 -0
- package/src/prover/zenon/tla/rewrites.ts +447 -0
- package/src/prover/zenon/tla/sets.ts +304 -0
- package/src/prover/zenon/tla/terms.ts +162 -0
- package/src/prover/zenon/tla/tla.ts +506 -0
- package/src/randomization.ts +39 -27
- package/src/resolve.ts +1474 -426
- package/src/runtime.ts +25 -7
- package/src/sany/builtins.ts +147 -0
- package/src/sany/generator.ts +3111 -0
- package/src/sany/levels.ts +1205 -0
- package/src/sany/lexer.ts +544 -0
- package/src/sany/linter.ts +122 -0
- package/src/sany/modules.ts +1398 -0
- package/src/sany/nodes.ts +463 -0
- package/src/sany/parse-error.ts +2161 -0
- package/src/sany/report.ts +355 -0
- package/src/sany/selectors.ts +736 -0
- package/src/sany/source.ts +247 -0
- package/src/sany/xml.ts +1016 -0
- package/src/search.ts +969 -0
- package/src/spec-description.ts +66 -29
- package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
- package/src/standard-modules.ts +215 -164
- package/src/state-graph.ts +181 -0
- package/src/subexpressions.ts +231 -171
- package/src/substitution-levels.ts +40 -19
- package/src/successors.ts +253 -125
- package/src/symmetry.ts +194 -54
- package/src/tableau.ts +60 -32
- package/src/tlc/fingerprint.ts +214 -0
- package/src/{tlc-modules.ts → tlc/jar-data.ts} +4 -0
- package/src/tlc/messages.ts +441 -0
- package/src/{tlc-order.ts → tlc/order.ts} +84 -16
- package/src/{tlc-random.ts → tlc/random.ts} +30 -189
- package/src/tlc/replay.ts +659 -0
- package/src/{tlc-summary.ts → tlc/summary.ts} +20 -5
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +59 -50
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +63 -45
- package/src/tlc/version.ts +19 -0
- package/src/transfer.ts +44 -32
- package/src/values.ts +843 -241
- package/src/worker.ts +62 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- package/dist/run-cli.cjs +0 -28
- package/dist/run-cli.js +0 -28
- package/src/canonical.ts +0 -39
- package/src/cli-options.ts +0 -58
- package/src/obligation-expression.ts +0 -1060
- package/src/obligation-module.ts +0 -1042
- package/src/run-cli.ts +0 -478
package/dist/transfer.js
CHANGED
|
@@ -6,17 +6,18 @@
|
|
|
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
|
-
|
|
10
|
-
`),
|
|
11
|
-
`&&(
|
|
12
|
-
`||t===` `||t===` `||t===`\r`){
|
|
13
|
-
`,
|
|
14
|
-
|
|
15
|
-
`,t:` `,r:`\r`,f:`\f`}[t]??t),
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
`).length-1,n.index+=e+2;continue}let a=/^\d+(?![A-Za-z_])/.exec(r)?.[0];if(a){t.push({kind:`Number`,text:a,line:n.line}),n.index+=a.length;continue}let o=/^[A-Za-z0-9_!]+/.exec(r)?.[0];if(o){t.push({kind:`Word`,text:o,line:n.line}),n.index+=o.length;continue}let s=/^"((?:[^"\\]|\\.)*)"/.exec(r);if(s){t.push({kind:`String`,text:s[1],line:n.line}),n.index+=s[0].length;continue}let c=D.find(e=>r.startsWith(e));if(c){t.push({kind:`Symbol`,text:c,line:n.line}),n.index+=c.length;continue}let l=ae(e,n.index);if(!l)throw new d(`Unexpected character ${JSON.stringify(r[0])} at line ${n.line}`);t.push({kind:`Word`,text:l.text,line:n.line}),n.index+=l.length}return t.push({kind:`End`,text:``,line:n.line}),t},O=e=>{let t=ce(e),n={index:0},r={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},i={isSet:!1},a=()=>t[n.index],o=()=>t[n.index++],s=e=>e.kind===`Word`&&E.has(e.text),c=e=>{let t=o();if(t.text!==e)throw new d(`Expected ${JSON.stringify(e)} but found ${JSON.stringify(t.text)} at line ${t.line}`)},l=()=>{let e=o();if(e.kind!==`Word`||s(e))throw new d(`Expected a name but found ${JSON.stringify(e.text)} at line ${e.line}`);return e.text},u=()=>a().kind===`Word`&&!s(a()),f=()=>{let e=[];for(;u();)e.push(o().text);return e},p=(e,t)=>{if(r[e]!==void 0)throw new d(`The keyword ${t} appears twice`);r[e]=l()},m=()=>{let e=o();if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[];for(a().text!==`}`&&e.push(m());a().text===`,`;)o(),e.push(m());return c(`}`),{kind:`Set`,elements:e}}if(e.kind===`Word`&&!s(e))return{kind:`ModelValue`,name:e.text};throw new d(`Expected a value but found ${JSON.stringify(e.text)} at line ${e.line}`)},h=()=>{if(a().text!==`[`)return;o();let e=l();return c(`]`),e},g=()=>{for(;u();){let e=o().text;if(a().text===`(`){o();let t=[];for(;a().text!==`)`;)t.push(m()),a().text!==`)`&&c(`,`);o(),c(`=`);let n=h();r.constants.push({name:e,value:m(),args:t,...n&&{module:n}});continue}if(a().text===`<-`){o();let t=h();r.substitutions.push({name:e,target:l(),...t&&{module:t}});continue}c(`=`);let t=h();r.constants.push({name:e,value:m(),...t&&{module:t}})}};for(;a().kind!==`End`;){let e=o();switch(e.text){case`CONSTANT`:case`CONSTANTS`:g();break;case`INIT`:p(`init`,e.text);break;case`NEXT`:p(`next`,e.text);break;case`SPECIFICATION`:p(`specification`,e.text);break;case`SYMMETRY`:p(`symmetry`,e.text);break;case`VIEW`:p(`view`,e.text);break;case`INVARIANT`:case`INVARIANTS`:r.invariants.push(...f());break;case`PROPERTY`:case`PROPERTIES`:r.properties.push(...f());break;case`CONSTRAINT`:case`CONSTRAINTS`:r.constraints.push(...f());break;case`ACTION_CONSTRAINT`:case`ACTION_CONSTRAINTS`:r.actionConstraints.push(...f());break;case`ALIAS`:p(`alias`,e.text);break;case`POSTCONDITION`:case`POSTCONDITIONS`:r.postconditions.push(...f());break;case`_POSSIBLE`:r.possible.push(...f());break;case`_PERIODIC`:p(`periodic`,e.text);break;case`_RL_REWARD`:p(`rlReward`,e.text);break;case`CHECK_DEADLOCK`:{if(i.isSet)throw new d(`The keyword CHECK_DEADLOCK appears twice`);i.isSet=!0;let e=o().text;if(e!==`TRUE`&&e!==`FALSE`)throw new d(`CHECK_DEADLOCK expects TRUE or FALSE but found ${JSON.stringify(e)}`);r.checkDeadlock=e===`TRUE`;break}default:throw new d(`Unexpected ${JSON.stringify(e.text)} at line ${e.line}`)}}if(r.specification!==void 0&&(r.init!==void 0||r.next!==void 0))throw new d(`SPECIFICATION cannot be combined with INIT or NEXT`);return r},le={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:` `}},ue=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},de=e=>e!==void 0&&/^\p{Nd}$/u.test(e),fe=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),pe=e=>{let t=t=>{let n=C(e,t,ue);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=C(e,t,de);if(e.startsWith(`..`,n)&&de(e[n+2]))return{kind:`Constant`,first:t,last:C(e,n+2,de)-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=de(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:C(e,t+1,de)-1,children:[]};if(fe(n))return{kind:`Constant`,first:t,last:C(e,t,fe)-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)},me=e=>{let t=e.length===0?void 0:pe(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=le[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},k=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,A=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),j=e=>typeof e==`object`&&e.kind===`ModelValue`,he=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:k(e)?`set`:`function`,ge=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new p(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},_e={isUsed:!1},ve=(e,t)=>(_e.isUsed=!0,e.writtenKeys=t,e),ye=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Jt(e.domain,t)]]),be=(e,t,n)=>ve(ze(e,t),n),xe=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(xe);e.writtenKeys=void 0,e.range.forEach(xe)}},Se=e=>e.every(e=>typeof e==`string`),Ce=(e,t)=>e.length>0&&t.length>0&&Se(e)!==Se(t),we=(e,t)=>{_e.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Ce(n,r)?at(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=F(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=F(i[e],a[e]);if(t!==0)return t}return 0},M=(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=F(n[e],r[e]);if(t!==0)return t}return 0},Te=e=>j(e)?e.type:void 0,N=(e,t,n)=>{let r=Te(e),i=Te(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(j(e)&&j(t)){if(r===void 0||i===void 0||r===i)return;throw new f(`Attempted to ${a} the differently-typed model values ${H(e)} and ${H(t)}`)}throw r===void 0?new f(`Attempted to ${a} the typed model value ${H(t)} and the non-model value\n${H(e)}`):new f(`Attempted to ${a}${n?``:` the`} typed model value ${H(e)} and non-model value\n${H(t)}`)},Ee={ranks:Object.create(null),size:0},De=e=>{Ee.ranks=Object.create(null),Ee.size=0;for(let t of e)Oe(t)},Oe=e=>(Ee.ranks[e]===void 0&&(Ee.ranks[e]=Ee.size++),e),ke=()=>Ee.size,Ae=e=>Ee.ranks[Oe(e)],je=(e,t)=>{if(e===t)return 0;let n=Ee.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},P=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Me=(e,t)=>(P(e)||P(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Ne=(e,t,n)=>{if(!P(e))throw new f(`Attempted to ${n} the set ${H(L(e)?R(e):e,!0)} with the value:\n${H(t,!0)}`);if(!P(t))throw new f(`Attempted to compare overridden value ${H(e,!0)} with non-overridden value:\n${H(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new f(`Attempted to compare ${H(e,!0)} with the value\n${H(t,!0)}`)},Pe={kind:`InfiniteSet`,name:`Any`},Fe=e=>{throw new f(`Attempted to compare ANY with the value\n${H(e)}`)},F=(e,t)=>{if(e===t)return _e.isUsed&&xe(e),e===Pe?Fe(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return we(e,t);if(n===`Set`&&r===`Set`)return M(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&&N(e,t,!1),je(e.name,t.name);if(n===`ModelValue`||r===`ModelValue`)return N(e,t,!1),n===`ModelValue`?-1:1;if(e===Pe||t===Pe)return Fe(e===Pe?t:e);if(k(e)&&k(t)&&Me(e,t))return Ne(e,t,`compare`);let i=k(e);if(i!==k(t))throw new f(`Attempted to compare ${he(e)} ${H(e)} with ${he(t)} ${H(t)}`);return i?M(R(e),R(t)):we(V(e),V(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return je(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(N(e,t,!1),j(e))return-1;if(j(t))return 1;throw new f(`Attempted to compare ${he(e)} ${H(e)} with ${he(t)} ${H(t)}`)},Ie=/* @__PURE__ */ new Map,Le=e=>{Oe(e);let t=Ie.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0};return Ie.set(e,n),n},Re=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),ze=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0}),Be=(e,t)=>{if(e===t)return _e.isUsed&&xe(e),e!==Pe||Fe(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&N(e,t,!0),F(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return we(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return M(e,t)===0;if(j(e)||j(t))return N(e,t,!0),j(e)&&j(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Be(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=z(e.domain),r=z(t.domain);if(n||r)return n===r;let i=z(e.range),a=z(t.range);return i||a?i===a:Be(e.domain,t.domain)&&Be(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(z(e))return z(t);if(z(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]&&Be(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return z(e)?z(t):!z(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Be(e,t.factors[n]));let n=k(e)&&k(t)&&!(L(e)&&L(t));if(n&&Me(e,t))return Ne(e,t,`check equality of`)===0;if(n){if(!P(e)){let n=R(e);if(!P(t))return M(n,R(t))===0}return wn(e)===wn(t)}return F(e,t)===0},Ve=(e,t)=>e===t||e.length===t.length&&e.every((e,n)=>He(e,t[n])),He=(e,t)=>e===t?!0:typeof e!=`object`||typeof t!=`object`?!1:e.kind===`Set`&&t.kind===`Set`?(e.hash===0||t.hash===0||e.hash===t.hash)&&Ve(e.elements,t.elements):e.kind===`Function`&&t.kind===`Function`?(e.hash===0||t.hash===0||e.hash===t.hash)&&Ve(e.domain,t.domain)&&Ve(e.range,t.range):wn(e)===wn(t),Ue=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},We=e=>{if(!A(e))return;let t=V(e);return{domain:t.domain,range:t.range,low:Ue(t.domain)}},Ge=e=>{if(!A(e))return;let t=V(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},Ke=(e,t)=>{if(Te(e)!==void 0)throw new f(`Attempted to compare the typed model value ${H(e)} and the non-model value\n${H(t)}`);return 1},qe=(e,t)=>{if(Te(e)!==void 0)throw new f(`Attempted to check equality of the typed model value ${H(e)} and the non-model value\n${H(t)}`);return!1},Je=(e,t)=>{let n=Te(e);if(n===void 0)return j(t)?je(e.name,t.name):-1;if(!j(t))throw new f(`Attempted to compare the typed model value ${H(e)} and non-model value\n${H(t)}`);let r=Te(t);if(r!==void 0&&r!==n)throw new f(`Attempted to compare the differently-typed model values ${H(e)} and ${H(t)}`);return je(e.name,t.name)},Ye=(e,t)=>{let n=Te(e);if(n===void 0)return j(t)&&e.name===t.name;if(!j(t))throw new f(`Attempted to check equality of typed model value ${H(e)} and non-model value\n${H(t)}`);let r=Te(t);if(r!==void 0&&r!==n)throw new f(`Attempted to check equality of the differently-typed model values ${H(e)} and ${H(t)}`);return e.name===t.name},Xe={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`}},Ze=(e,t,n)=>{let r=Xe[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${H(e)} with ${r.other}:\n${H(t)}`},Qe=(e,t,n)=>{let r=We(n);if(!r){if(j(n))return Ke(n,t);throw new f(`Attempted to compare the function ${H(t)} with the value:\n${H(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>$e(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return $e(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new f(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${H(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},$e=(e,t)=>{for(let n=0;n<e.length;n++){let r=at(e[n],t[n]);if(r!==0)return r}return 0},et=(e,t)=>{let n=V(e);if(e.kind===`Function`&&Yt(n)!==void 0){let r=A(t)?Yt(t):void 0;return r?n.range.length-r.length||$e(n.range,r):Qe({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=Ge(t);if(!r){if(j(t))return Ke(t,e);throw new f(`Attempted to compare record:\n${H(e)}\nwith non-record\n${H(t)}`)}return n.domain.length-r.domain.length||$e(n.domain,r.domain)||$e(n.range,r.range)}return Qe({...n,low:Ue(n.domain)},e,t)},tt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),nt=(e,t)=>P(e)||P(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),rt=(e,t)=>{let n=tt(t)?t:R(t);return{elements:R(e).elements,otherElements:R(n).elements}},it=(e,t)=>{if(nt(e,t))return F(e,t);if(!tt(e))return it(R(e),t);if(!k(t)){if(j(t))return Ke(t,e);throw new f(`Attempted to compare the set ${H(e)} with the value:\n${H(t)}`)}let n=rt(e,t);return n.elements.length-n.otherElements.length||$e(n.elements,n.otherElements)},at=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return F(e,t);if(j(t))return Ke(t,e);throw new f(Ze(e,t,!1))}return e.kind===`ModelValue`?Je(e,t):A(e)?et(e,t):it(e,t)},ot=(e,t)=>e.every((e,n)=>ut(e,t[n])),st=(e,t,n)=>{let r=We(n);if(!r){if(j(n))return qe(n,t);throw new f(`Attempted to check equality of the function ${H(t)} with the value:\n${H(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&ot(e.range,r.range);let i=e.low??r.low;return i===void 0?ot(e.domain,r.domain)&&ot(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new f(`Attempted to compare an integer with non-integer:\n${H(e)}.`);return e===i+t})&&ot(e.range,r.range)},ct=(e,t)=>{let n=V(e);if(e.kind===`Function`&&Yt(n)!==void 0){let r=A(t)?Yt(t):void 0;return r?n.range.length===r.length&&ot(n.range,r):st({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=Ge(t);if(!r){if(j(t))return qe(t,e);throw new f(`Attempted to check equality of record:\n${H(e)}\nwith non-record\n${H(t)}`)}return n.domain.length===r.domain.length&&ot(n.domain,r.domain)&&ot(n.range,r.range)}return st({...n,low:Ue(n.domain)},e,t)},lt=(e,t)=>{if(nt(e,t))return Be(e,t);if(!tt(e))return lt(R(e),t);if(!k(t)){if(j(t))return qe(t,e);throw new f(`Attempted to check equality of the set ${H(e)} with the value:\n${H(t)}`)}let n=rt(e,t);return n.elements.length===n.otherElements.length&&ot(n.elements,n.otherElements)},ut=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(j(t))return qe(t,e);throw new f(Ze(e,t,!0))}return e.kind===`ModelValue`?Ye(e,t):A(e)?ct(e,t):lt(e,t)},dt=e=>{let t=[];for(let n of e){let e={low:0,high:t.length,comparison:1};for(;e.low<e.high;){let r=e.low+(e.high-e.low>>1);if(e.comparison=at(n,t[r]),e.comparison===0)break;e.comparison<0?e.high=r:e.low=r+1}e.comparison!==0&&t.splice(e.low,0,n)}return t},ft=(e,t)=>t.some(t=>ut(t,e)),pt=(e,t)=>{try{return Be(e,t)}catch(n){if(!(n instanceof f))throw n;return ut(e,t)}},mt=e=>{for(let t=1;t<e.length;t++)if(F(e[t-1],e[t])>=0)return!1;return!0},ht=e=>{if(e.length<2||mt(e))return Re(e);let t=[...e].sort(F),n=[t[0]];for(let e=1;e<t.length;e++)F(n[n.length-1],t[e])!==0&&n.push(t[e]);return Re(n)},gt=e=>{try{return ht(e)}catch(t){if(!(t instanceof f))throw t;return{kind:`MixedSet`,elements:e}}},_t=Re([]),vt=(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&&F(r[a],t)<0;)a++;a<r.length&&F(r[a],t)===0||i.push(t)}return i.length===n.length?e:Re(i)},yt=(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&&F(r[a],t)<0;)a++;a<r.length&&F(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Re(i)},bt=(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=F(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=Re(i);if(e.hash!==0){let t=e.hash;for(let e=0;e<a.length;e++)t=t+fn(a[e])|0;c.hash=t}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+yn(a[e])|0;c.fingerprint=t}return c},xt=e=>{let t=e.length<2?e:[...e].sort((e,t)=>F(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&F(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return ze(n,r)},St=e=>{let t=xt(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:ve(t,e.map(e=>e[0]))},Ct=[],wt=[],Tt=/* @__PURE__ */ new WeakMap,Et=e=>{let t=Ct[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Ct[e]=n,n},Dt=e=>{if(Gt(e),e.low===1&&e.high>=1)return Et(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Ot=e=>e.length>0&&(e===Ct[e.length]||Tt.has(e)),kt=e=>{let t=R(e).elements;return Ot(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},At=e=>{let t=wt[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return wt[e]=n,n},I=e=>ze(Et(e.length),e),jt=e=>xt(e),Mt=e=>k(e)&&!P(e),Nt=(e,t=!1)=>`UNION(${H(e.base,t)})`,Pt=e=>{if(!Mt(e.base))throw new f(`Attempted to enumerate the nonenumerable set:\n${Nt(e)}`);return R(e.base).elements},Ft=(e,t,n)=>{if(Mt(e))return e;throw new f(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${H(e)}\nwhen enumerating:\n${Nt(n)}`)},L=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return L(e.base);case`FunctionSet`:return L(e.domain)&&L(e.range)||It(e.domain)===!0||It(e)===!0;case`RecordSet`:return e.sets.every(L)||It(e)===!0;case`ProductSet`:return e.factors.every(L)||It(e)===!0;case`Union`:return L(e.base)&&R(e.base).elements.every(L);case`SetOperation`:return e.operator===`\\cup`?L(e.left)&&L(e.right):e.operator===`\\cap`?L(e.left)||L(e.right):L(e.left);default:return!1}},It=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=It(e.domain);return t===void 0?void 0:!t&&It(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=It(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return L(e)?R(e).elements.length===0:void 0;default:return}},Lt=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},Rt=(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},zt=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Re(r.map(t=>e[t])));while(Rt(r,e.length))}return t},Bt=e=>{if(typeof e!=`object`)throw new f(`Expected a set but found ${H(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return dt(e.elements);case`Interval`:{let t=Dt(e);return t!==Ct[t.length]&&Tt.set(t,e),t}case`Subset`:{P(e.base)&&Gt(e.base);let t=R(e.base).elements;if(t.length>30)throw new f(`SUBSET of a set with ${t.length} elements is too large to enumerate`);return zt(t)}case`FunctionSet`:{if(z(e))return[];if(P(e.domain))throw new f(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${H(e.domain)}\ncannot be enumerated.`);let t=kt(e.domain);if(t.length>0&&P(e.range))throw new f(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${H(e.range)}\ncannot be enumerated.`);let n=t.length===0?[]:R(e.range).elements;return Lt(t.map(()=>n)).map(e=>ze(t,e))}case`RecordSet`:{if(z(e))return[];let t=e.sets.map((t,n)=>{if(P(t))throw new f(`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${H(t)}`);return R(t).elements});return Lt(t).map(t=>jt(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(z(e))return[];let t=e.factors.map((e,t)=>{if(P(e))throw new f(`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${H(e)}`);return R(e).elements});return Lt(t).map(I)}case`FilteredSet`:if(P(e.base))throw new f(`Attempted to enumerate { x \\in S : p(x) } when S:\n${H(e.base)}\nis not enumerable`);return R(e.base).elements.filter(e.test);case`Union`:{let t=Pt(e).flatMap((t,n)=>R(Ft(t,n,e)).elements);return R(gt(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(P(e.left)||P(e.right)))throw new f(`Attempted to enumerate S \\cup T when S:\n${H(e.left)}\nand T:\n${H(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&P(e.left)&&P(e.right))throw new f(`Attempted to enumerate S \\cap T when neither S:\n${H(e.left)}\nnor T:\n${H(e.right)}\nis enumerable`);if(e.operator===`\\`&&P(e.left))throw new f(`Attempted to enumerate S \\ T when S:\n${H(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return bt(R(e.left),R(e.right)).elements;let t=e.operator===`\\`||L(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return R(n).elements.filter(t=>B(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new f(`Attempted to enumerate the non-enumerable set ${H(e)}`);default:throw new f(`Expected a set but found ${H(e)}`)}},Vt=/* @__PURE__ */ new WeakMap,R=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Re(Bt(e));let t=typeof e==`object`?Vt.get(e):void 0;if(t)return t;let n=Bt(e),r=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?Re(n):ht(n);return typeof e==`object`&&Vt.set(e,r),r},Ht=e=>{if(typeof e!=`object`||Vt.has(e))return R(e).elements;if(e.kind===`Union`)return Pt(e).flatMap((t,n)=>Ht(Ft(t,n,e)));if(e.kind===`FilteredSet`&&!P(e.base))return Ht(e.base).filter(e.test);if(e.kind!==`SetOperation`)return R(e).elements;if(e.operator===`\\cup`)return P(e.left)||P(e.right)?R(e).elements:[...Ht(e.left),...Ht(e.right)];let t=e.operator===`\\`||L(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return P(n)?R(e).elements:Ht(n).filter(t=>B(t,r)===(e.operator===`\\cap`))},z=e=>{if(typeof e!=`object`||!k(e))throw new f(`Shouldn't call isEmpty() on value ${H(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 f(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(z);case`RecordSet`:return e.sets.some(z);case`FunctionSet`:return!z(e.domain)&&z(e.range);case`Union`:return Pt(e).every((t,n)=>z(Ft(t,n,e)));default:return R(e).elements.length===0}},Ut=(e,t)=>e.reduce((e,n)=>{let r=e*Gt(n);if(r>2147483647)throw new f(t());return r},1),Wt=e=>`Overflow when computing the number of elements in:\n${H(e)}`,Gt=e=>{if(typeof e!=`object`)return R(e).elements.length;switch(e.kind){case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new f(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new f(`Attempted to compute the number of elements in the overridden value ${H(e)}.`);case`Subset`:{let t=Gt(e.base);if(t>=31)throw new f(Wt(e));return 2**t}case`FunctionSet`:{if(z(e.domain))return 1;if(z(e.range))return 0;let t=Gt(e.range);if(t===1)return 1;let n=Gt(e.domain),r={value:1};for(let i=0;i<n;i++)if(r.value*=t,r.value>2147483647)throw new f(Wt(e));return r.value}case`RecordSet`:return z(e)?0:Ut(e.sets,()=>Wt(e));case`ProductSet`:return z(e)?0:Ut(e.factors,()=>`Overflow when computing the number of elements in ${H(e)}`);default:return R(e).elements.length}},Kt=e=>`Attempted to check if the set ${H(e)}is finite.`,qt=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new f(`Attempted to check if the ${he(e)} ${H(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new f(`Attempted to check if the function:\n${H(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return qt(e.base)&&z(e.base);case`Subset`:return qt(e.base);case`FunctionSet`:{let t=qt(e.domain);if(t&&z(e.domain))return!0;let n=qt(e.range);return n&&z(e.range)?!0:n&&(t||Gt(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!qt(e))n.isAllFinite=!1;else if(z(e))return!0;return n.isAllFinite}case`Union`:if(!Mt(e.base))throw new f(`Attempted to check if the nonenumerable set:\n${Nt(e)}\nis a finite set.`);return R(e.base).elements.every(qt);case`SetOperation`:if(e.operator===`\\cup`)return qt(e.left)&&qt(e.right);if(e.operator===`\\cap`){if(!qt(e.left)&&!qt(e.right))throw new f(Kt(e));return!0}if(qt(e.left))return!0;if(!qt(e.right))throw new f(Kt(e));return!1;case`FilteredSet`:if(!qt(e.base))throw new f(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${H(e.base)}\nis finite.`);return!0}},Jt=(e,t)=>{let n={low:0,high:e.length-1};for(;n.low<=n.high;){let r=n.low+n.high>>1,i=F(e[r],t);if(i===0)return r;i<0?n.low=r+1:n.high=r-1}return-1},Yt=e=>{if(typeof e!=`object`||!A(e))return;let t=V(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Xt=(e,t)=>`Attempted to check if the value ${H(e)} is an element of ${H(t)}`,Zt=(e,t)=>{let n=`Attempted to check if the value:\n${H(e)}\nis an element of the`;if(!A(t))return`${n} ${he(t)} ${H(t)}`;let r=t.kind===`Function`||L(t.domain)?V(t).domain:[];return r.length>0&&r.every(e=>typeof e==`string`)?`Attempted to check if element:\n${H(e)}\nis in the record:\n${H(t)}`:r.every((e,t)=>e===t+1)?`Attempted to check set membership in a tuple value.`:`${n} function ${H(t)}`},B=(e,t)=>{if(!k(t))throw new f(Zt(e,t));switch(t.kind){case`Set`:try{return Jt(t.elements,e)!==-1}catch(n){if(!(n instanceof f))throw n;return ft(e,t.elements)}case`MixedSet`:return ft(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!j(e))throw new f(`Attempted to check if the value:\n${H(e)}\nis in the integer interval ${H(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(j(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new f(`Attempted to check if the value:\n${H(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!k(e))throw new f(Xt(e,t));return R(e).elements.every(e=>B(e,t.base));case`FunctionSet`:{if(!A(e)){if(j(e))return!1;throw new f(Xt(e,t))}let n=V(e),r=Ue(n.domain);return(r===void 0?pt(t.domain,Re(n.domain)):pt({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>B(e,t.range))}case`RecordSet`:{let n=A(e)?V(e):void 0;if(!n||!Se(n.domain)){if(j(e))return!1;throw new f(`Attempted to check if non-record\n${H(e)}\nis in the set of records:\n${H(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Jt(n.domain,e);return i!==-1&&B(n.range[i],t.sets[r])})}case`ProductSet`:{let n=A(e)?Yt(e):void 0;if(n===void 0){if(A(e)&&V(e).domain.every(e=>typeof e==`number`)||j(e))return!1;throw new f(`Attempted to check if non-tuple\n${H(e)}\nis in the set of tuples:\n${H(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>B(e,t.factors[n]))}case`FilteredSet`:return B(e,t.base)&&t.test(e);case`Union`:if(!Mt(t.base))throw new f(`Attempted to check if:\n ${H(e)}\nis an element of the non-enumerable set:\n ${Nt(t)}`);return R(t.base).elements.some(t=>B(e,t));case`SetOperation`:return t.operator===`\\cup`?B(e,t.left)||B(e,t.right):B(e,t.left)&&B(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Yt(e);if(n===void 0){if(j(e))return!1;throw new f(Xt(e,t))}return n.every(e=>B(e,t.base))}default:throw new f(Zt(e,t))}},Qt=(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?B(e,n):e.range.every((e,r)=>Qt(e,t.range[r],n.range)),V=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){L(e.domain)||Gt(e.domain);let t=kt(e.domain);return ze(t,t.map(t=>e.apply(t)))}throw new f(`Expected a function but found ${H(e)}`)},$t=/* @__PURE__ */ new WeakSet,en=e=>($t.add(e),e),tn=(e,t)=>typeof e==`object`&&$t.has(e)?`In applying the function\n${me(H(e))},\nthe first argument is:\n${me(H(t))}\nwhich is not in its domain.\n`:`Attempted to apply function ${H(e)} to ${H(t)}, which is not in its domain`,nn=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}if(e.length<=8){for(let n=0;n<e.length;n++)if(e[n]===t)return n}return Jt(e,t)},rn=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!B(t,e.domain))throw new f($t.has(e)?tn(e,t):`Attempted to apply a function to ${H(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new f(`Attempted to apply ${H(e)}, which is not a function`);let r=nn(e.domain,t);if(r===-1)throw new f(n?.(e)??tn(e,t));return e.range[r]},an=e=>Ot(e)?Tt.get(e)??At(e.length):void 0,on=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=V(e).domain;return an(t)??Re(t)},sn=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!L(e.domain))){if(!B(t,e.domain))return e;let r=n(e.apply(t));return{kind:`LazyFunction`,domain:e.domain,apply:n=>pt(t,n)?r:e.apply(n),source:e.source}}let i=V(e),a=nn(i.domain,t);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=ze(i.domain,o);if(l.writtenKeys=i.writtenKeys,i.hash!==0){let e=i.domain[a];l.hash=s===c?i.hash:i.hash-pn(e,s)+pn(e,c)|0}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-bn(e,s)+bn(e,c)|0}return l},cn=/* @__PURE__ */ new WeakMap,ln=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},un=(e,t)=>Math.imul(e^t,16777619),dn=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return ln(t)},fn=e=>ln(hn(e)+2654435769|0),pn=(e,t)=>ln(Math.imul(hn(e),668265261)+hn(t)|0),mn=e=>{if(e.kind===`ModelValue`)return ln(un(dn(e.name),109));if(k(e)){if(!L(e))return dn(wn(e));let t=R(e).elements,n=1940243425;for(let e=0;e<t.length;e++)n=n+fn(t[e])|0;return n}let t=V(e),n=1725019383;for(let e=0;e<t.domain.length;e++)n=n+pn(t.domain[e],t.range[e])|0;return n},hn=e=>{if(typeof e==`number`)return ln(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return dn(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=mn(e)),e.hash;let t=cn.get(e);if(t!==void 0)return t;let n=mn(e);return cn.set(e,n),n},gn=/* @__PURE__ */ new WeakMap,_n=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},vn=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return _n(t)},yn=e=>_n(Sn(e)+2135587861|0),bn=(e,t)=>_n(Math.imul(Sn(e),374761393)+Sn(t)|0),xn=e=>{if(e.kind===`ModelValue`)return _n(vn(e.name)^60);if(k(e)){if(!L(e))return vn(wn(e));let t=R(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+yn(t[e])|0;return n}let t=V(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+bn(t.domain[e],t.range[e])|0;return n},Sn=e=>{if(typeof e==`number`)return _n(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return vn(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=xn(e)),e.fingerprint;let t=gn.get(e);if(t!==void 0)return t;let n=xn(e);return gn.set(e,n),n},Cn=/* @__PURE__ */ new WeakMap,wn=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=Cn.get(e);if(t!==void 0)return t;let n=Tn(e);return Cn.set(e,n),n},Tn=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${wn(e.base)}>`;if(e.kind===`FilteredSet`&&!L(e))throw new f(`Attempted to compare the non-enumerable set ${H(e)} with another value`);if(k(e))return L(e)?`{${R(e).elements.map(wn).join(`,`)}}`:`<${e.kind} ${H(e)}>`;let t=V(e);return`(${t.domain.map((e,n)=>`${wn(e)}:${wn(t.range[n])}`).join(`,`)})`},En=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,Dn=e=>e.reduce((e,t)=>e===0?0:e*Gt(t),1),On=e=>{if(e.kind===`Subset`)return Gt(e.base)<=6?R(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return R(e);if(e.kind===`FunctionSet`&&L(e.domain)&&Gt(e.domain)===0)return Re([ze([],[])]);let t=e.kind===`FunctionSet`?Gt(e.range)**Gt(e.domain):Dn(e.kind===`RecordSet`?e.sets:e.factors);return t===0?_t:t<=1999?R(e):void 0},kn=(e,t)=>{if(t)return On(e);if(L(e))try{return On(e)}catch(e){if(e instanceof f)return;throw e}},An=(e,t)=>{let n=e=>H(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return`{x \\in ${n(e.base)} : ...}`;case`Union`:return Nt(e,t)}},jn=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),H=(e,t=!1,n=!1)=>{let r=e=>H(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return En(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(R(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=kn(e,t);return n?r(n):An(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{if(e.kind===`LazyFunction`&&!L(e.domain)){let t=e.source;return t?`[${t.parameters.map(e=>`${e.name} \\in ${H(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}let t=V(e);return t.domain.every((e,t)=>e===t+1)?`<<${t.range.map(r).join(`, `)}>>`:t.domain.every(e=>typeof e==`string`&&jn(e))?`[${(n||t.hash!==0||t.fingerprint!==0?t.domain.map((e,n)=>[e,t.range[n]]):ye(t)).map(e=>`${String(e[0])} |-> ${r(e[1])}`).join(`, `)}]`:`(${t.domain.map((e,n)=>`${r(e)} :> ${r(t.range[n])}`).join(` @@ `)})`}}},Mn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Nn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=hn(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||He(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||He(i[e],n))return i[e]}return n.kind===`Set`?Mn(n.elements,t):(Mn(n.domain,t),Mn(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}},Pn=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),Fn=(e,t)=>Pn.has(e)?new f(t):new p(t),In=e=>typeof e==`object`&&e.kind===`Operator`,U=(e,t,n)=>{let r=e[t];if(r===void 0||In(r))throw Fn(n,`${n} expects a value as argument ${t+1}`);return r},Ln=(e,t,n)=>{let r=U(e,t,n);if(typeof r!=`number`)throw Fn(n,`${n} expects an integer but received ${H(r)}`);return r},Rn=(e,t,n)=>{let r=U(e,t,n);if(typeof r!=`boolean`)throw Fn(n,`${n} expects a boolean but received ${H(r)}`);return r},zn=(e,t,n)=>{let r=U(e,t,n);if(!k(r))throw Fn(n,`${n} expects a set but received ${H(r)}`);return r},Bn=(e,t,n)=>{let r=zn(e,t,n);if(!L(r))throw Fn(n,`${n} cannot enumerate the non-enumerable set ${H(r)}`);return r},Vn=(e,t,n)=>R(Bn(e,t,n)),Hn=(e,t,n)=>Vn(e,t,n).elements,Un=(e,t,n)=>{let r=U(e,t,n),i=Yt(r);if(!i)throw Fn(n,`${n} expects a sequence but received ${H(r)}`);return i},Wn=(e,t,n)=>{let r=U(e,t,n);if(!A(r))throw Fn(n,`${n} expects a function but received ${H(r)}`);return V(r)},Gn=(e,t,n)=>{let r=e[t];if(r===void 0||!In(r))throw Fn(n,`${n} expects an operator as argument ${t+1}`);return r},Kn=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),W=(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}),qn=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Jn=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Yn=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(U(n,0,e),U(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Xn=e=>e>2147483647||e<-2147483648,Zn=e=>new p(`Overflow when computing ${e}`),Qn={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`},$n={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},er={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`},tr=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return $n[e.operator];if(e.kind!==`Function`)return Qn[e.kind];let t=e.domain;return t.every((e,t)=>e===t+1)?`TupleValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},nr=e=>er[tr(e)],rr=(e,t)=>new f(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),ir=(e,t)=>{let n=n=>(...r)=>{try{return n(...r)}catch(n){throw n instanceof f&&(e.isLazy===!0||!(n instanceof p))?rr(t,n.message):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},ar=(e,t)=>{if(typeof e!=`number`)throw rr(t,`Cannot cast tlc2.value.impl.${tr(e)} to tlc2.value.impl.IntValue`);return e},or=(e,t,n)=>`public static tlc2.value.impl.${t} tlc2.module.Integers.${e}(${Array.from({length:n},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,sr=(e,t,n)=>{let r=or(t,`IntValue`,2);return Yn(e,(t,i)=>{let a=ar(t,r),o=ar(i,r),s=n(a,o);if(Xn(s))throw Zn(`${a}${e}${o}`);return s})},cr=(e,t,n)=>{if(typeof e!=`number`)throw new p(`The ${t} argument of ${n} should be an integer, but instead it is:\n${H(e)}`);return e},lr=(e,t)=>Yn(e,(n,r)=>t(cr(n,`first`,e),cr(r,`second`,e))),ur=(e,t,n)=>({...Jn(e,t,n),isLazy:!0}),dr=(e,t,n)=>{let r=Gn(e,t,n);return()=>r.call([])},fr=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),pr=()=>({bool:qa,condition:(e,t)=>{if(typeof e!=`boolean`)throw Ia(t,e);return e},conjunct:(e,t,n)=>{if(typeof e!=`boolean`)throw La(t,n,e);return e},apply:rn,tuple:I,set:gt,record:ze,writtenRecord:be,equal:Be,enumerate:$a,unassigned:(e,t)=>{throw new f(`The variable ${e} is not assigned at ${q(t)}`)},primeOutsideAction:e=>{throw new f(`A primed expression appears outside an action at ${q(e)}`)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0}),extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Wa(e,t,n[r]),e.scope),state:e.state,next:e.next})}),mr={value:void 0},hr=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),gr=e=>`local${e.counter++}`,_r=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Ja(e).forEach(e=>_r(e,t)),t),vr=(e,t,n)=>{let r=hr(e,Y(t,e.environment)),i=_r(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=hr(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},yr=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>gr(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${xr(e,t.set,s)}, ${hr(e,t.set)});`),u=t.bounds.map(t=>{let n=gr(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${xr(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=gr(e);return`for (let ${i} = 0; ${i} < ${c[r]}.length; ${i}++) { const ${n} = ${c[r]}[${i}]; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},br=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${xr(e,r[0],n)}, "the left side of =>") ? bool(${xr(e,r[1],n)}, "the right side of =>") : true)`;if(J(t))return vr(e,t,n);let i=mo(t.operator,e.environment);if(i?.kind!==`Builtin`)return vr(e,t,n);if(i.name===`DOMAIN`)return`${hr(e,za(t))}(${xr(e,r[0],n)})`;if(i.name===`TLCEval`)return vr(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${hr(e,Ba(t,i))}(${xr(e,r[0],n)}, ${xr(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&rs(r[0],a))return`${hr(e,i.evaluateUnary)}(${xr(e,r[0],n)})`;let o=r.length===2&&rs(r[0],a)&&rs(r[1],a);return i.evaluateBinary&&o?`${hr(e,i.evaluateBinary)}(${xr(e,r[0],n)}, ${xr(e,r[1],n)})`:vr(e,t,n)},xr=(e,t,n)=>{let r=(t,r=n)=>xr(e,t,r);if(qo(t)&&Ho(t,e.environment))return vr(e,t,n);switch(t.kind){case`Number`:return Mo(t.value)?String(t.value):vr(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(J(t))return vr(e,t,n);let i=wo(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=hr(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?hr(e,i.value):vr(e,t,n)}case`Apply`:return br(e,t,n);case`And`:{let n=hr(e,t);return`(${t.operands.map((e,t)=>`conjunct(${r(e)}, ${n}, ${t})`).join(` && `)})`}case`Or`:return`(${t.operands.map(e=>`bool(${r(e)}, "a disjunct")`).join(` || `)})`;case`If`:return`(condition(${r(t.condition)}, ${hr(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{_s(t.function);let e=r(t.function);return t.args.length===1?`apply(${e}, ${r(t.args[0])})`:`apply(${e}, tuple([${t.args.map(e=>r(e)).join(`, `)}]))`}case`FieldAccess`:return`apply(${r(t.record)}, ${JSON.stringify(t.field)}, ${hr(e,Ra(t))})`;case`Record`:{let i=[...t.fields].sort((e,t)=>F(e.name,t.name));if(i.some((e,t)=>t>0&&i[t-1].name===e.name))return vr(e,t,n);let a=hr(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}, ${hr(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=hr(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?yr(e,t,n):vr(e,t,n);default:return vr(e,t,n)}},Sr=(e,t)=>{if(!fr.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=xr(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(`
|
|
19
|
-
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;mr.value??=pr();let o=mr.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Cr={kind:`Local`},wr=/* @__PURE__ */ new WeakMap,Tr=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Er=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2}])),Dr=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Or=e=>e.kind===`Operator`?e.params.length:0,kr=e=>e.name.includes(`!`),Ar=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},jr=(e,t,n=0)=>t.reduce((e,t)=>({name:t,arity:n,parent:e}),e),Mr=(e,t)=>t.reduce((e,t)=>({name:t.name,arity:t.arity,parent:e}),e),Nr=e=>e.kind===`Name`?[e.name]:e.names,Pr=e=>e.flatMap(e=>Nr(e.pattern)),Fr=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Dr(n.location,t.location))?n:void 0},Ir=(e,t)=>{let n=Fr(e,t);return n?{key:t.getKey(n),arity:Or(n)}:t.imported.get(e)},Lr=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),Rr=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),zr=(e,t,n,r)=>{let i=e.location,a=wr.get(e);if(a!==void 0)return a;if(Tr(t))return e.kind===`Apply`?e.args.length:0;if(Rr(t))return 0;let o=Ar(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=Cr),o)return o.arity;let s=Ir(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,wr.set(e,s.arity),s.arity;let c=t.slice(0,t.indexOf(`!`));if(c!==``&&(Ar(n,c)!==void 0||Ir(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=`at line ${i.line}, column ${i.column}`;throw new u(Lr(t)?`Could not find declaration or definition of symbol '${t}' ${l}`:`Unknown operator: \`${t}' ${l}`)},Br=(e,t,n)=>(e.forEach(e=>G(e.set,t,n)),e.reduce((e,t)=>jr(e,Nr(t.pattern)),t)),Vr=(e,t)=>e.kind===`Identifier`&&e.name===t&&J(e)||Ja(e).some(e=>Vr(e,t)),Hr=(e,t)=>{e.kind===`FunctionConstruction`&&Vr(e.body,t)&&(e.isRecursive=!0),Ja(e).forEach(e=>Hr(e,t))},Ur=(e,t,n)=>{let r=jr(t,e.kind===`Function`?[e.name]:[]);e.kind===`Function`?(G(e.body,Br(e.bounds,r,n),n),Hr(e.body,e.name)):G(e.body,Mr(r,e.params),n)},Wr=(e,t,n)=>{let r=e.filter(e=>e.isRecursive).reduce((e,t)=>({name:t.name,arity:Or(t),parent:e}),t);return e.reduce((e,t)=>(kr(t)||Ur(t,e,n),{name:t.name,arity:Or(t),parent:e}),r)},Gr=(e,t,n,r,i)=>{let a=e.kind===`Operator`?e.params[t]:void 0,o=n.location;if(a?.arity===0&&r>0)throw new u(`Operator used in argument number ${t+1} has incorrect number of arguments at line ${o.line}, column ${o.column}`);let s=i?.kind===`Operator`&&i.params.some(e=>e.arity>0);if(a!==void 0&&a.arity>0&&(r!==a.arity||s))throw new u(`Argument number ${t+1} to operator '${e.name}' should be a ${a.arity}-parameter operator at line ${o.line}, column ${o.column}`)},Kr=e=>e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:void 0,qr=(e,t,n)=>{let r=Ar(t,e.operator)?void 0:Fr(e.operator,n),i=zr(e,e.operator,t,n);if(i!==e.args.length)throw new u(`The operator ${e.operator} requires ${i} arguments at line ${e.location.line}, column ${e.location.column}`);e.args.forEach((e,i)=>{let a=Kr(e),o=a===void 0||Ar(t,a)?void 0:Fr(a,n),s=Jr(e,t,n);r&&Gr(r,i,e,s,o)})},Jr=(e,t,n)=>e.kind===`Identifier`?zr(e,e.name,t,n):e.kind===`OperatorReference`?zr(e,e.operator,t,n):(G(e,t,n),e.kind===`Lambda`?e.params.length:0),G=(e,t,n)=>{let r=e=>e.forEach(e=>G(e,t,n));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=zr(e,e.name,t,n);if(r>0)throw new u(`The operator ${e.name} requires ${r} arguments at line ${e.location.line}, column ${e.location.column}`);return}case`OperatorReference`:zr(e,e.operator,t,n);return;case`Apply`:qr(e,t,n);return;case`Lambda`:G(e.body,jr(t,e.params),n);return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:G(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&&G(e.other,t,n);return;case`Let`:G(e.body,Wr(e.definitions,t,n),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:G(e.body,Br(e.bounds,t,n),n);return;case`UnboundedQuantifier`:G(e.body,jr(t,e.names),n);return;case`Choose`:e.set&&G(e.set,t,n),G(e.body,jr(t,Nr(e.pattern)),n);return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:G(e.predicate,Br([e.bound],t,n),n);return;case`SetMap`:G(e.expression,Br(e.bounds,t,n),n);return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:if(new Set(e.fields.map(e=>e.name)).size<e.fields.length)throw new u(`Non-unique fields in constructor at line ${e.location.line}, column ${e.location.column}`);r(e.fields.map(e=>e.value));return;case`Except`:r([e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])]);return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:G(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`:G(e.body,t,n);return;case`Subexpression`:e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Jr(e,t,n))}},Yr=(e,t,n)=>(e.set&&G(e.set,t,n),{name:e.name,arity:e.arity,parent:t}),Xr=(e,t,n)=>{let r=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?Yr(t,e,n):(t.kind===`AssumeProve`?Xr(t,e,n):G(t,e,n),e),t);return G(e.conclusion,r,n),r},Zr=(e,t,n)=>e.kind===`AssumeProve`?Xr(e,t,n):(G(e,t,n),t),Qr=(e,t,n)=>{e?.kind===`Steps`&&e.steps.reduce((e,t)=>$r(t,e,n),t)},$r=(e,t,n)=>{let r=e.body;switch(r.kind){case`Assert`:{let i=Zr(r.statement,t,n);return Qr(e.proof,i,n),r.isSuffices?i:t}case`Define`:return Wr(r.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),t,n);case`Have`:case`Case`:return G(r.expression,t,n),Qr(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>G(e,t,n)),t;case`Take`:return jr(Br(r.bounds,t,n),r.names);case`Pick`:{let i=jr(Br(r.bounds,t,n),r.names);return G(r.body,i,n),Qr(e.proof,t,n),i}default:return Qr(e.proof,t,n),t}},ei=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Zr(e.statement,void 0,t);Qr(e.proof,n,t)},ti=(e,t)=>new u(`Multiply-defined symbol '${e}' at line ${t.line}, column ${t.column}`),ni=(e,t,n,r)=>t.reduce((e,t)=>{if(Ar(e,t)||n(t))throw ti(t,r);return{name:t,arity:0,parent:e}},e),ri=(e,t,n,r)=>(e.forEach(e=>ai(e.set,t,n)),e.reduce((e,t)=>ni(e,Nr(t.pattern),n,r),t)),ii=(e,t,n)=>{if(e.kind===`Function`){let r=jr(t,[e.name]),i=ri(e.bounds,r,n,e.location);ai(e.body,i,n);return}let r=ni(t,e.params.map(e=>e.name),n,e.location);ai(e.body,r,n)},ai=(e,t,n)=>{let r=e.location;switch(e.kind){case`Lambda`:ai(e.body,ni(t,e.params,n,r),n);return;case`Let`:{let i=e.definitions.filter(e=>e.isRecursive).map(e=>e.name),a=e.definitions.reduce((e,t)=>{if(Ar(e,t.name)||n(t.name))throw ti(t.name,t.location);return ii(t,jr(e,i),n),jr(e,[t.name])},t);ai(e.body,ni(a,(e.instances??[]).flatMap(e=>e.name===void 0?[]:[e.name]),n,r),n);return}case`Forall`:case`Exists`:case`FunctionConstruction`:ai(e.body,ri(e.bounds,t,n,r),n);return;case`SetFilter`:ai(e.predicate,ri([e.bound],t,n,r),n);return;case`SetMap`:ai(e.expression,ri(e.bounds,t,n,r),n);return;case`UnboundedQuantifier`:ai(e.body,ni(t,e.names,n,r),n);return;case`Choose`:e.set&&ai(e.set,t,n),ai(e.body,ni(t,Nr(e.pattern),n,r),n);return;default:Ja(e).forEach(e=>ai(e,t,n))}},oi=e=>[...e.definitions.map(e=>({name:e.name,kind:`Definition`,location:e.location,isRecursive:e.isRecursive})),...e.instances.flatMap(e=>e.name===void 0?[]:[{name:e.name,kind:`Definition`,location:e.location,isRecursive:!1}]),...e.constants.map(e=>({name:e.name,kind:`Constant`,location:e.location,isRecursive:!1})),...e.variables.map(e=>({name:e.name,kind:`Variable`,location:e.location,isRecursive:!1}))],si=(e,t)=>{let n=/* @__PURE__ */ new Map;oi(e).sort((e,t)=>Dr(e.location,t.location)?-1:1).forEach(e=>n.set(e.name,[...n.get(e.name)??[],e]));let r=(e,n)=>{if(!t.imported.has(e)&&!Er.has(e))return!1;let r=t.importedAt.get(e);return r===void 0||Dr(r,n)};n.forEach(e=>e.forEach((n,i)=>{let a=e.slice(0,i).some(e=>e.kind===`Definition`||n.kind===`Definition`||e.kind!==n.kind),o=t.imported.get(n.name)?.declaration===n.kind;if(a||!o&&r(n.name,n.location))throw ti(n.name,n.location)}));let i=e=>t=>(n.get(t)??[]).some(t=>t.isRecursive||Dr(t.location,e))||r(t,e);e.definitions.forEach(e=>ii(e,void 0,i(e.location))),e.assumptions.forEach(e=>ai(e.expression,void 0,i(e.location))),e.instances.forEach(e=>{let t=i(e.location),n=ni(void 0,e.params.map(e=>e.name),t,e.location);e.substitutions.forEach(e=>ai(e.expression,n,t))})},ci=(e,t)=>{let n=new Map([...Er,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0})),n},li=(e,t,n,r)=>{let i=Mr(void 0,e.params),a={imported:ci(n,r.imported),definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set},o=new Map(e.substitutions.map(e=>[e.name,e.expression])),s=`in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`;return o.forEach((e,n)=>{if(t.every(e=>e.name!==n))throw new u(`Identifier '${n}' is not a legal target of a substitution ${s}`)}),new Map(t.map(t=>{let n=t.name;if(!o.has(n)&&!Ar(i,n)&&!Ir(n,a))throw new u(`Substitution missing for symbol ${n} ${s}`);let r=o.get(n)??{kind:`Identifier`,name:n,location:e.location};if(t.arity===0||r.kind!==`Identifier`)return G(r,i,a),[n,r];if(zr(r,r.name,i,a)!==t.arity)throw new u(`An operator must be substituted for symbol '${n}', and it must have arity ${t.arity} ${s}`);return[n,r]}))},ui=(e,t)=>{let n=ci(e,t.imported),r=new Set([...e.theorems,...e.assumptions].flatMap(e=>e.name??[])),i=(e,i)=>({imported:n,definitions:t.definitions,getKey:t.getKey,location:e,self:i,facts:r});e.definitions.forEach(e=>Ur(e,void 0,i(e.location,e))),e.assumptions.forEach(e=>G(e.expression,void 0,i(e.location,void 0))),e.theorems.forEach(e=>ei(e,i(e.location,void 0)))},di=/* @__PURE__ */ new WeakSet,fi=/* @__PURE__ */ new WeakSet,pi=(e,t,n=/* @__PURE__ */ new Set)=>{let r=yi(e,(e,r)=>pi(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&J(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&J(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},mi=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),hi=/* @__PURE__ */ new WeakMap,gi=e=>hi.get(e)??e.name,_i=(e,t)=>(gi(t)!==e.name&&hi.set(e,gi(t)),e),vi=(e,t)=>_i(e.kind===`Function`?{...e,bounds:mi(e.bounds,e=>t(e,[])),body:t(e.body,Pr(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),yi=(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=>vi(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:mi(e.bounds,n),body:t(e.body,Pr(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,Nr(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,Nr(e.bound.pattern))};case`SetMap`:return{...e,bounds:mi(e.bounds,n),expression:t(e.expression,Pr(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({name:e.name,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},bi=`LAMBDA`,xi=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return yi(e,(e,n)=>(r.push(...xi(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Si=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}},Ci=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),wi=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Ti=(e,t)=>e.map(e=>({pattern:wi(e.pattern,t),set:e.set})),Ei=(e,t)=>e.kind===`Function`?{...e,bounds:Ti(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Di=(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=>_i({...Ei(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Ti(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:wi(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:wi(e.bound.pattern,n),set:e.bound.set}};default:return e}},Oi=e=>`${e}@ENABLED`,ki=(e,t)=>e.modes.get(t)??e,Ai=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!J(e)&&t.instantiation.variables.has(e.name),ji=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ji(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Ai(e,t,n))return[e.name];let r=J(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?ji(r.body,t,/* @__PURE__ */ new Map):void 0},Mi=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Ai(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Oi(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Li(e.expression,ki(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Li(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Li(e.subscript,ki(t,`Primed`),n),location:r},Li(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=ji(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:Oi(r),location:e.location},location:e.location},Li({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Ni=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),Pi=(e,t)=>e.map(e=>Ni(e.name,t)),Fi=(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:[...Pi(t,r),...i.map(e=>Ni(e,r))],location:r},location:r}},Ii=(e,t)=>e.instantiation.isParameterized(t)?zi(e,t):void 0,Li=(e,t,n)=>{let r=e=>Li(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!J(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Li(e.expression,ki(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Li(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},ki(t,`Enabled`),n)};let s=Mi(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return di.add(n),n;let r=Ii(t,e.name);if(r===void 0)return e;if(a.length===0)return{...e,name:r};let o=i.getDefinition(e.name);return o&&Or(o)>0?Fi(r,a,Or(o),e.location):{kind:`Apply`,operator:r,args:Pi(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),s=i.substitutions.size>0||a.length>0||fi.has(e),c=e=>(s&&fi.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return c({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return c({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:bi,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:bi,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new u(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=Ii(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...Pi(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=Ii(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?Fi(n,a,Or(r),e.location):{...e,operator:n}}let c=Si(t),l=yi(e,(e,i)=>i.length===0?r(e):Li(e,t,Ci(n,i,c)));return Di(l,n,c)},Ri=(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:Ni(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},zi=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(i.name,n=>{e.copies.set(t,n);let a=Si(e),o=Ei(vi(i,(t,n)=>Li(t,e,Ci(/* @__PURE__ */ new Map,n,a))),a);return Ri(o,r.params,i.location)}):t},Bi=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>xi(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=>Ii(i,e)??e,getQualifiedKey:t=>{let n=Ii(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(r.name,()=>Ri(r,e.params,r.location)):t}}},Vi=e=>e.kind===`Let`&&e.instances!==void 0||Ja(e).some(Vi),Hi=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=yi(e,e=>Hi(e,t,r));return i.kind!==`Let`||!i.instances?i:{kind:`Let`,definitions:i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Dr(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions),body:i.body,location:i.location}},Ui=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Wi=(e,t)=>e.definitions.some(e=>Vi(e.body))||e.assumptions.some(e=>Vi(e.expression))||e.theorems.some(e=>{let t=Ui(e);return t!==void 0&&Vi(t)})?{...e,definitions:e.definitions.map(e=>vi(e,e=>Hi(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Hi(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Ui(e);return n===void 0?e:{...e,statement:Hi(n,t,[])}})}:e,Gi=/* @__PURE__ */ new WeakMap,Ki=/* @__PURE__ */ new WeakMap,K=(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},qi=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Ji=(t,n)=>{let r=X(t,n);if(typeof r==`boolean`)return r;try{return qa(r,`the action at ${q(t)}`)}catch(t){throw n.next===void 0?t:a(t,e.error)}},Yi=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Xi=(e,t,n)=>{let r=n?Gi:Ki,i=r.get(e);if(i)return i;let a=wa(e,t,n);return r.set(e,a),a},Zi=(e,t)=>{if(t.constants.has(e))return;let n=Ya(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Qi=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Qi(e.expression,t,!1,r);if(e.kind!==`Identifier`||J(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Zi(e.name,t);if(a&&!r.has(a))return r.add(a),Qi(a.body,t,n,r)},$i=(e,t,n)=>Qi(e,t,!n),ea=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return ea(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Ao(e.definitions,K(r,t,n));return ea(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Ua(t,e.name);if(a?.kind===`Thunk`)return ea(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=Zi(e.name,r.environment);if(s)return ea(s.body,void 0,n,r,i)},ta=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||J(e))||!t&&e.kind===`Prime`,na=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>na(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=Zi(e.name,t);if(i)return n.add(e.name),na(i.body,t,n)},ra=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),ia=(e,t,n)=>ra.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Yi(e.operator)&&(ta(e.args[0],n)||$i(e.args[0],t,n)!==void 0)||J(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,aa=/* @__PURE__ */ new Set,oa=(e,t)=>{if(J(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return yi(e,(e,i)=>{let a=r.isReadOnly?oa(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},sa=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||J(e)?void 0:Ya(r,t);return i&&!n.has(i)&&(n.add(i),sa(i.body,t,n))?!0:Ja(e).some(e=>sa(e,t,n))},ca=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=$i(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=na(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return ia(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Xi(e,t,n)}},la=(e,t,n)=>{let r=e.map(e=>ca(e,t,n)),i=(e,t,n,a,o,s)=>{let c=a,l;for(let a=e;a<r.length;a++){if(a>0&&t.isInit&&Oa(c)){l??=K(t,n,c);for(let e=a;e<r.length;e++)if(!ua(r[e].expression,l))return;s(c,o);return}let e=r[a];if(e.kind===`Guard`){if(l??=K(t,n,c),!Ji(e.expression,l))return;continue}if(e.kind===`Assign`){l??=K(t,n,c);let r=X(e.value,l),i=c[e.index];if(i===void 0)c=qi(c,e.index,r),l=void 0;else if(!Be(i,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=c[t];if(e===void 0)c=qi(c,t,n[t]),l=void 0;else if(!Be(e,n[t]))return}continue}let u=a+1;e.runner(t,n,c,o,!0,(e,r)=>i(u,t,n,e,r,s));return}s(c,o)};return(e,t,n,r,a,o)=>i(0,e,t,n,r,o)},ua=(e,t)=>qa(X(e,t),`the initial predicate at ${q(e)}`),da=e=>(t,n,r,i,a,o)=>{Ji(e,K(t,n,r))&&o(r,i)},fa=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=K(r,i,a);if(a[l]!==void 0){Ji(e,u)&&c(a,o);return}let d=X(n,u),p=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!L(p))throw new f(`In computing next states, the right side of \\in is not enumerable: ${H(p)} at ${q(e)}`);let m=Ht(p);for(let e=0;e<m.length&&!r.isStopped;e++)c(qi(a,l,m[e]),o)}},pa=/* @__PURE__ */ new WeakMap,ma=e=>{let t=pa.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(ma),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return pa.set(e,n),n},ha=(e,t)=>{let n=e.args[0],r=da(e),i=(e,r,i)=>ea(n,r,i,e,!t)??-1,a=fa(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=X(e.args[1],K(t,n,o));l(qi(o,u,d),s)}},ga=(e,t,n,r)=>{if(e.kind===`FunctionConstruction`)return{bounds:e.bounds,body:e.body,scope:t};if(e.kind!==`Identifier`)return;let i=Ua(t,e.name);if(i?.kind===`Thunk`)return ga(i.expression,i.scope,n,r);let a=i?void 0:Ya(e.name,r.environment);if(a?.kind!==`Function`)return;let o=X(e,K(r,void 0,n));return{bounds:a.bounds,body:a.body,scope:Wa(void 0,a.name,o)}},_a=(e,t,n)=>{let r=da(e);return(i,a,o,s,c,l)=>{let u=ga(e.function,a,o,i);if(!u){r(i,a,o,s,c,l);return}let d=K(i,a,o),p=e.args.map(e=>X(e,d)),m=p.length===1?p[0]:I(p),h=to(u.bounds,K(i,u.scope,o));if(!B(m,h))throw new f(`Attempted to apply a function to ${H(m)}, which is not in its domain at ${q(e)}`);Xi(u.body,t,n)(i,no(u.bounds,u.scope,m),o,s,c,l)}},va=(e,t)=>{if(na(e,t))return la([ma(e)],t,!1);if(e.kind===`Tuple`)return Xi(ma(e),t,!1);let n=ma(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Ua(i,e.name):void 0;l?.kind===`Thunk`?Xi(ma(l.expression),t,!1)(r,l.scope,a,o,s,c):Ji(n,K(r,i,a))&&c(a,o)}},ya=(e,t,n)=>{let r=e.operator,i=da(e),a=J(e)?void 0:mo(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=os(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=Xi(a.body,t,n),o.body(e,i(K(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=K(a,o,s),f=go(e,d);f?.kind===`Closure`?Xi(f.body,t,n)(a,Oo(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},ba=(e,t,n)=>{let r=da(e),i=J(e)?void 0:Zi(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=Ua(s,e.name);f?.kind===`Thunk`?Xi(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=Xi(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},xa=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||J(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!J(a))return;let o=Qi(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>xa(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||J(e))return;let r=mo(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=xa(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(i&&o?.kind===`Identifier`&&J(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Sa=(e,t,n)=>{let r=Ua(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},Ca=(e,t,n)=>{let r=e.map(e=>Xi(e,t,n)),i=n?[]:e.map(e=>xa(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&Sa(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},wa=(e,t,n)=>{let r=e=>Xi(e,t,n);switch(e.kind){case`And`:return la(e.operands,t,n);case`Or`:return Ca(e.operands,t,n);case`Exists`:{let t=r(e.body),n=e.bounds[0];if(e.bounds.length===1&&n.pattern.kind===`Name`){let e=n.pattern.name;return(r,i,a,o,s,c)=>{let l=$a(X(n.set,K(r,i,a)),n.set);for(let n=0;n<l.length&&!r.isStopped;n++)t(r,Wa(i,e,l[n]),a,o,s,c)}}return(n,r,i,a,o,s)=>{eo(e.bounds,K(n,r,i),e=>(t(n,e,i,a,o,s),n.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Ts(e,t)!==void 0&&!sa(e.body,t,/* @__PURE__ */ new Set)?oa(e,aa):void 0;return(t,n,r,o,s,c)=>{let l=[];eo(e.bounds,K(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Ua(n,e)?.kind===`Value`)){u.every(n=>Ji(e.body,K(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Oa(r)?u.slice(n).every(n=>ua(e.body,K(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=X(e.condition,K(r,i,a));(qa(l,`an IF condition`)?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=K(r,i,a),u=t.find(e=>qa(X(e.condition,l),`a CASE guard`))?.body??n;if(!u)throw new f(`No CASE guard is true at ${q(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=zo(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Ao(e.definitions,K(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new f(`UNCHANGED appears in an initial predicate at ${q(e)}`)}:va(e.expression,t);case`AngleAction`:{let t=r(e.action),n=ma(e.subscript);return(e,r,i,a,o,s)=>t(e,r,i,a,o,(t,i)=>{Ji(n,K(e,r,t))||s(t,i)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,ma(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return ba(e,t,n);case`FunctionApplication`:return _a(e,t,n);case`Apply`:{let i=e.args;if(Yi(e.operator)){let r=$i(i[0],t,n);if(r!==void 0)return e.operator===`=`?la([e],t,n):fa(e,()=>r);if(ta(i[0],n))return ha(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=X(i[0],K(t,n,r));(typeof c==`boolean`?c:qa(c,`the left side of => at ${q(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return ya(e,t,n)}default:return da(e)}},Ta=/* @__PURE__ */ new WeakMap,Ea=e=>{let t=Ta.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Ta.set(e,n),n},Da=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Oa=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},ka=(e,t)=>{let n=t.state;if(!n||!Oa(n))throw new f(`ENABLED needs a complete state at ${q(e)}`);let r=t.environment,i={value:!1};return Xi(e,r,!1)({environment:r,isInit:!1,current:n,isStopped:!1},t.scope,Ea(r),void 0,!1,()=>{i.value=!0}),i.value},Aa=(t,n,r,i)=>{let o={environment:n,isInit:!0,current:void 0,isStopped:!1};Xi(t,n,!0)(o,i,Ea(n),void 0,!1,t=>{if(!o.isStopped){if(!Oa(t))throw a(new f(`The initial predicate does not assign ${Da(t,n).join(`, `)}`),e.error);o.isStopped=r(t)}})},ja=(e,t,n)=>{let r=[];return Aa(e,t,e=>(r.push(e),!1),n),r},Ma=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,current:t,isStopped:!1},o={successors:0};return Xi(e,n,!1)(a,i,Ea(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Oa(e))throw new f(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${Da(e,n).join(`, `)}`);o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Na=(e,t,n,r)=>{let i=[];return Ma(e,t,n,e=>(i.push(e),!1),r),i},q=e=>`line ${e.location.line}, column ${e.location.column}`,Pa=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,Fa=e=>{let t=e.location.range;return t?Pa(t):q(e)},Ia=(e,t)=>new f(`A non-boolean expression (${nr(t)}) was used as the condition of an IF.\n${Fa(e)}`),La=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r){let r=e.operands[t],i=r.kind===`Number`?String(r.value):Fa(r);return new f(`A non-boolean expression (${nr(n)}) was used as a formula in a conjunction.\n${i}`)}let i=e.operands[Math.max(t,1)].location.range?.end??r.end;return new f(`Attempted to evaluate an expression of form P /\\ Q when ${t===0?`P`:`Q`} was\n${nr(n)}.\n${Fa({...e,location:{...e.location,range:{...r,end:i}}})}`)},Ra=e=>t=>`Attempted to select nonexistent field "${e.field}" from the record\n${H(t)}\n${Fa(e)}`,za=e=>t=>{if(!A(t))throw new f(`Attempted to apply the operator DOMAIN to a non-function\n(${nr(t)})\n${Fa(e)}`);return on(t)},Ba=(e,t)=>(n,r)=>{if(!k(n)||P(n))throw new f(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Fa(e)}`);return t.evaluate([n,r])},Va=t=>a(new f(`TLC can't handle real numbers: ${t.text} at ${q(t)}`),e.configParseError),Ha=t=>a(new f(`TLC can't handle a number this big: ${t.text??t.value} at ${q(t)}`),e.error),Ua=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Wa=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Ga=(e,t,n)=>{if(t.kind===`Name`)return Wa(e,t.name,n);let r=Yt(n);if(!r||r.length!==t.names.length)throw new f(`Cannot bind <<${t.names.join(`, `)}>> to ${H(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>Wa(e,t,r[n]),e)},Ka=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next}),qa=(e,t)=>{if(typeof e!=`boolean`)throw new f(`Expected ${t} to be a boolean but found ${H(e)}`);return e},Ja=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},J=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Ya=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Xa=(e,t)=>{if(e.kind===`Prime`||e.kind===`Unchanged`||e.kind===`Enabled`)return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=Ya(n,t);if(e&&!t.constants.has(n)&&!Za(e,t))return!0}return Ja(e).some(e=>Xa(e,t))},Za=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!Xa(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>Xa(e.set,t)));return t.constantLevels.set(e,r),r},Qa=(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.`},$a=(e,t)=>{if(!k(e)||P(e)){let n=H(e),r=Qa(e,n);throw new f(r===void 0?`TLC encountered a non-enumerable quantifier bound\n${n}.\n${Fa(t)}`:`TLC encountered the non-enumerable quantifier bound\n${n}\n${Fa(t)}\n${r}`)}return typeof e==`object`&&e.kind===`Interval`?Dt(e):R(e).elements},eo=(e,t,n)=>{let r=e.map(e=>$a(X(e.set,t),e.set)),i=(t,a)=>t<0?n(a):r[t].some(n=>i(t-1,Ga(a,e[t].pattern,n)));return i(e.length-1,t.scope)},to=(e,t)=>{let n=e.map(e=>X(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},no=(e,t,n)=>{if(e.length===1)return Ga(t,e[0].pattern,n);let r=Yt(n)??[];return e.reduce((e,t,n)=>Ga(e,t.pattern,r[n]),t)},ro=/* @__PURE__ */ new WeakMap,io=(e,t)=>{let n=ro.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:Pa(r)};return ro.set(t,i),i},ao=(e,t,n)=>{let r=io(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},oo=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=hn(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(He(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},so=(e,t)=>{let n=to(e.bounds,t),r=oo(n,(n,r)=>X(e.body,Ka(t,no(e.bounds,Wa(void 0,e.name,r),n))),ao(e.bounds,e.body,n));return e.bounds.length===1?en(r):r},co=(e,t)=>e.kind===`Function`?so(e,t):X(e.body,t),lo=(e,t)=>{let n=Za(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new f(`Operator ${e.name} requires ${e.params.length} arguments`);let i=Ka(t,void 0);if(!n)return co(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>co(e,i));return t.environment.definitionValues.set(e,a),a},uo=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=X(e.expression,Ka(t,e.scope));return n&&(e.cache=r),r},fo=/* @__PURE__ */ new WeakMap,po=e=>{let t=fo.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return fo.set(e,n),n},mo=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return mo(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?po(r):t.builtins.get(e)},ho=/* @__PURE__ */ new WeakMap,go=(e,t)=>{if(J(e))return _o(e.operator,t);let n=ho.get(e),r=n===void 0?mo(e.operator,t.environment)??null:n;return n===void 0&&ho.set(e,r),r??_o(e.operator,t)},_o=(e,t)=>{let n=Ua(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return mo(e,t.environment)},vo=e=>e.kind===`Closure`?e.params.length:e.arity,yo=(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:_o(n,t);if(!r)throw new f(`Expected an operator argument at ${q(e)}`);return r},bo=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>Wa(e,n.name,t[r]),e.scope);return X(e.body,Ka(n,r))},xo=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:vo(e),call:n=>bo(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},So=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=_o(e.name,t);return n!==void 0&&vo(n)>0},Co=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),wo=(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 wo(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([])}},To=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Mo(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=J(e)?void 0:wo(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=Ua(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Co(e,t)}}return t=>Co(e,t)},Eo=/* @__PURE__ */ new WeakMap,Do=(e,t)=>{let n=Eo.get(e);if(n)return n;let r=To(e,t);return Eo.set(e,r),r},Oo=(e,t,n)=>{if(t.length!==e.params.length)throw new f(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`);let r=e.scope;for(let i=0;i<t.length;i++){let a=e.params[i],o=a.arity>0?{kind:`Operator`,operator:yo(t[i],n)}:Do(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},ko=(e,t,n)=>e.kind===`Closure`?X(e.body,Ka(n,Oo(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>X(e,n))):e.isLazy?e.evaluate(is(t,n),n):e.evaluate(t.map(e=>So(e,n)?xo(yo(e,n),n):X(e,n)),n),Ao=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0},i):r.params.length>0||n?.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0},i)},t.scope),jo=(e,t,n)=>{let r=Ua(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return uo(r,n);if(r?.kind===`Operator`){if(vo(r.operator)===0)return bo(r.operator,[],n);throw new f(`Operator ${e} is used without arguments`)}let i=wo(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw new f(`The variable ${e} is not assigned at ${q(t)}`);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return lo(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new f(`Unknown identifier ${e} at ${q(t)}`)},Mo=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,No=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Po=(e,t)=>No.has(e)||t.builtins.get(e)?.isStateLevel===!0,Fo=/* @__PURE__ */ new WeakMap,Io=(e,t)=>e.kind===`Operator`&&e.params.length===0&&Za(e,t),Lo=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(n!==void 0&&!J(e)){let e=Ya(n,t);if(!e&&Po(n,t)||e&&!Io(e,t)&&Ro(e,t))return!0}return Ja(e).some(e=>Lo(e,t))},Ro=(e,t)=>{let n=Fo.get(e);if(n!==void 0)return n;Fo.set(e,!1);let r=Lo(e.body,t)||e.kind===`Function`&&e.bounds.some(e=>Lo(e.set,t));return Fo.set(e,r),r},zo=(e,t)=>new Set(e.filter(e=>Ro(e,t))),Bo=e=>[...e.definitions.values()].some(t=>Ro(t,e)),Vo=/* @__PURE__ */ new WeakMap,Ho=(e,t)=>{let n=Vo.get(e);if(n!==void 0)return n;let r=Ko(e,t,Wo);return Vo.set(e,r),r},Uo=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),Wo=/* @__PURE__ */ new Set,Go=(e,t,n)=>n.size===0?Ho(e,t):Ko(e,t,n),Ko=(e,t,n)=>{if(!Uo.has(e.kind))return!1;if(e.kind===`Identifier`&&J(e))return n.has(e.name);if(J(e))return!1;if(e.kind===`Identifier`){let n=wo(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&Io(n.definition,t)}if(e.kind===`Apply`){if(Po(e.operator,t)||e.operator===`~>`)return!1;let r=mo(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=Ya(e.operator,t);if(!n||!Za(n,t)||Ro(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&Go(e,t,n))}let r={value:!0};return yi(e,(e,i)=>(r.value&&=Go(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},qo=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Jo=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},Yo=(e,t)=>{if(e.kind===`Identifier`&&J(e))return!t.has(e.name);if(J(e))return!0;let n={value:!1};return yi(e,(e,r)=>(n.value||=Yo(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Xo=(e,t)=>di.has(e)&&qo(e)&&Ts(e,t)!==void 0&&!Yo(e,Wo),Y=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Ss(e,t),i=qo(e)&&Ho(e,t)?Jo(r):Xo(e,t)?ts(r):r;return t.evaluators.set(e,i),i},Zo=/* @__PURE__ */ new WeakMap,Qo=(e,t)=>{let n=Zo.get(e);if(n)return n;let r=(qo(e)&&Ho(e,t)?void 0:Sr(e,t))??Y(e,t);return Zo.set(e,r),r},X=(e,t)=>Qo(e,t.environment)(t),$o=(e,t)=>{let n=e.name,r=J(e)?void 0:wo(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw new f(`The variable ${n} is not assigned at ${q(e)}`);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&Za(e,t))return t=>lo(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Qo(e.body,t),n.body(Ka(r,void 0)));return es(e,t)?ts(r):r}return t=>lo(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>lo(e,t);return Za(e,t)||!es(e,t)?n:ts(n)}return t=>jo(n,e,t)},es=(e,t)=>Ts(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Ts(e.set,t)!==void 0)),ts=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},ns=(e,t)=>{let n=mo(e,t);return n!==void 0&&vo(n)>0},rs=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!J(e)&&ns(e.name,t)),is=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>X(e,t),expression:e})),as=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(is(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&rs(t[0],n)){let e=Y(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&rs(t[0],n)&&rs(t[1],n);if(i&&a){let e=Y(t[0],n),r=Y(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>So(e,n)?xo(yo(e,n),n):X(e,n)),n)},os=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new f(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Do(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:yo(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},ss=/* @__PURE__ */ new WeakMap,cs=e=>{let t=ss.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return ss.set(e,n),n},ls=(e,t)=>{let n=[];for(let r=e;n.length<t;r=r?.parent){if(r?.binding.kind!==`Value`)return;n.push(r.binding.value)}return n},us=(e,t)=>e.every((e,n)=>He(e,t[n])),ds=(e,t)=>{let n=Ya(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&Za(n,t)&&!Ro(n,t)},fs=(e,t,n,r)=>{let i=os(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Qo(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next}));if(!r)return e=>o(i(e),e);let s=cs(e);return e=>{let n=i(e),r=ls(n,t.length);if(!r)return o(n,e);let a=r.length;for(let e of r)a=un(a,hn(e));let c=s.calls.get(a),l=c?.find(e=>us(e.args,r));if(l)return l.value;let u=o(n,e);return s.size<65536&&(s.size++,c?c.push({args:r,value:u}):s.calls.set(a,[{args:r,value:u}])),u}},ps=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Y(n[0],t),r=Y(n[1],t);return t=>!qa(e(t),`the left side of =>`)||qa(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new f(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=J(e)?void 0:mo(e.operator,t);if(r?.kind===`Closure`)return fs(r,n,t,ds(e,t));if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Y(n[0],t),i=za(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Y(n[0],t);return fi.has(e)||Xa(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=Y(n[0],t),a=Y(n[1],t),o=Ba(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?as(r,n,t):r=>{let i=_o(e.operator,r);if(i)return ko(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new f(`${e.operator} is a function; apply it with brackets`):new f(`Unknown operator ${e.operator} at ${q(e)}`)}},ms=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Y(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Y(a.set,t);return t=>{let s=$a(o(t),a.set);for(let a=0;a<s.length;a++){let o=qa(i(Ka(t,Wa(t.scope,e,s[a]))),r);if(o!==n)return o}return n}}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>Y(e.set,t));return t=>{let s=a.map((e,n)=>$a(e(t),o[n].set)),c=(a,o)=>{if(a<0)return qa(i(Ka(t,o)),r)!==n;let l=s[a];for(let t=0;t<l.length;t++)if(c(a-1,Wa(o,e[a],l[t])))return!0;return!1};return c(o.length-1,t.scope)?!n:n}}return e=>eo(o,e,t=>qa(i(Ka(e,t)),r)!==n)?!n:n},hs=(e,t)=>{if(e.kind===`Tuple`)return I(e.names.map(e=>{let n=Ua(t,e);return n?.kind===`Value`&&n.value}));let n=Ua(t,e.name);return n?.kind===`Value`?n.value:void 0},gs=/* @__PURE__ */ new WeakSet,_s=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&gs.add(e)},vs=(e,t)=>{let n=gs.has(e),r=Y(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Y(a.set,t);return t=>{let c=o?s(t):to(i,t);if(e.isRecursive||n||!L(c)){let n=oo(c,e=>r(Ka(t,no(i,t.scope,e))),ao(i,e.body,c));return i.length===1?en(n):n}if(o&&a.pattern.kind===`Name`){let e=a.pattern.name,n=kt(c);return en(ze(n,n.map(n=>r(Ka(t,Wa(t.scope,e,n))))))}let l=[];return eo(i,t,e=>{let n=i.length===1?hs(a.pattern,e)??!1:I(i.map(t=>hs(t.pattern,e)??!1));return l.push([n,r(Ka(t,e))]),!1}),xt(l)}},ys=(e,t)=>{let n=gs.has(e);n&&_s(e.function);let r=Y(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>Y(e,t))}),value:Y(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):I(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Ka(i,Wa(i.scope,`@`,e))):sn(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return e=>{let t=r(e);for(let n of i)t=o(t,n.path,0,e,n.value);return t}},bs=(e,t)=>{if(e.kind===`SetFilter`){let n=Y(e.predicate,t),r=Y(e.bound.set,t),i=e.bound.pattern;return t=>{let a=r(t),o=e=>qa(n(Ka(t,Ga(t.scope,i,e))),`a set filter predicate`);if(typeof a!=`object`||a.kind!==`Set`&&a.kind!==`MixedSet`&&a.kind!==`Interval`){if(k(a))return{kind:`FilteredSet`,base:a,test:o};throw new f(`TLC encountered a non-enumerable quantifier bound ${H(a)} at ${q(e.bound.set)}`)}return Re(R(a).elements.filter(o))}}if(e.kind===`SetMap`){let n=Y(e.expression,t);return t=>{let r=[];return eo(e.bounds,t,e=>(r.push(n(Ka(t,e))),!1)),gt(r)}}let n=e.set;if(!n)return()=>{throw new f(`TLC cannot evaluate an unbounded CHOOSE at ${q(e)}`)};let r=Y(e.body,t),i={pattern:e.pattern,set:n};return t=>{let n={value:void 0};if(eo([i],t,i=>qa(r(Ka(t,i)),`the body of CHOOSE`)?(n.value=hs(e.pattern,i),!0):!1),n.value===void 0)throw new f(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Fa(e)}`);return n.value}},xs=(e,t)=>{let n=[...e].sort((e,t)=>F(e.name,t.name)),r=n.some((e,t)=>t>0&&n[t-1].name===e.name),i=n.map(e=>Y(e.value,t));if(r)return e=>xt(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=>be(a,i.map(t=>t(e)),o):e=>ze(a,i.map(t=>t(e)))},Ss=(e,t)=>{let n=e=>Y(e,t);switch(e.kind){case`Number`:{let t=e.value;return Mo(t)?()=>t:()=>{throw Ha(e)}}case`Decimal`:return()=>{throw Va(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return $o(e,t);case`Apply`:return ps(e,t);case`OperatorReference`:case`Lambda`:return()=>{throw new f(`An operator cannot be used as a value at ${q(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw La(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return e=>{for(let n=0;n<t.length;n++)if(qa(t[n](e),`a disjunct`))return!0;return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw new f(`A primed expression appears outside an action at ${q(e)}`);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>Be(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Ia(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t)if(qa(e.condition(n),`a CASE guard`))return e.body(n);if(r)return r(n);throw new f(`No CASE guard is true at ${q(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Ka(n,Ao(e.definitions,n)))}case`Forall`:case`Exists`:return ms(e,t);case`UnboundedQuantifier`:return()=>{throw new f(`TLC cannot evaluate an unbounded quantifier at ${q(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return bs(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>gt(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>I(t.map(t=>t(e)))}case`FunctionConstruction`:return vs(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 xs(e.fields,t);case`RecordSet`:{let t=[...e.fields].sort((e,t)=>F(e.name,t.name)),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return ys(e,t);case`ExceptAt`:return t=>{let n=Ua(t.scope,`@`);if(n?.kind!==`Value`)throw new f(`@ appears outside an EXCEPT at ${q(e)}`);return n.value};case`FunctionApplication`:{_s(e.function);let t=n(e.function),r=e.args.map(n);if(r.length===1){let e=r[0];return n=>rn(t(n),e(n))}return e=>rn(t(e),I(r.map(t=>t(e))))}case`FieldAccess`:{let t=n(e.record),r=e.field,i=Ra(e);return e=>rn(t(e),r,i)}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?qa(t(e),`an action`)||r(e):qa(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>ka(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new f(`The subexpression reference at ${q(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new f(`TLC cannot evaluate a temporal formula in a state at ${q(e)}`)}}},Cs=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),ws=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Ts=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Cs.has(e.kind))return!1;let a=ws(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&Po(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return Ja(e).every(i)};return i(e)?[...n]:void 0},Es=/* @__PURE__ */ new Map([[`Reals`,`-------------------------------- MODULE Reals -------------------------------
|
|
9
|
+
import{B as e,D as t,E as n,F as r,G as i,H as a,I as o,L as s,M as c,N as l,O as u,P as d,R as f,S as p,U as m,_ as ee,g as h,h as te,k as g,l as _,m as v,v as y,z as ne}from"./worker.js";const re=/* @__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(`.`)),ie=/* @__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`]]),ae=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),oe=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),se=/* @__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`]]),ce=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,le=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),ue=e=>e.startsWith(`\\`)?parseInt(e.slice(2),le.get(e[1].toLowerCase())):Number(e),de=/-{4,}[ \t]*MODULE\b/,fe=e=>/[A-Za-z0-9_]/.test(e),b=(e,t)=>{let n=e[t];if(n===`\\`&&/[A-Za-z]/.test(e[t+1]??``)){let n=/^[A-Za-z]+/.exec(e.slice(t+1))?.[0]??``,r={value:n.length};for(;r.value>0&&!ie.has(n.slice(0,r.value));)r.value--;let i=ie.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=[e.slice(t,t+2),n].find(e=>se.has(e));if(r!==void 0)return{text:se.get(r)??``,length:r.length};let i=oe.find(n=>e.startsWith(n,t));return i?{text:ae.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},x=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),S=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>se.has(e)||x.has(e));return n===void 0?void 0:{text:n,length:n.length}},C=e=>e!==void 0&&e>=`0`&&e<=`9`,w=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},pe=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:w(e,t+1,C);if(n===t+1||e[n]!==`>`)return 0;let r=w(e,n+1,fe),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return w(e,i?r+1:r,e=>e===`.`)-t},me=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,he=(e,t)=>t===` `?e+8-e%8:e+1,ge=e=>{let n=de.exec(e);if(!n)throw new t(`Expected a module header such as ---- MODULE Name ----`);let r=[],i=/* @__PURE__ */ new Map,a=e.slice(0,n.index).split(`
|
|
10
|
+
`),o={index:n.index,line:a.length,lineStart:n.index-a[a.length-1].length,moduleDepth:0},s={lineStart:-1,position:0,width:0},c=()=>{for((s.lineStart!==o.lineStart||s.position>o.index)&&(s.lineStart=o.lineStart,s.position=o.lineStart,s.width=0);s.position<o.index;s.position++)s.width=he(s.width,e[s.position]);return he(s.width,e[o.index])},l=(e,t,n,i)=>{let a=c();r.push({kind:e,text:t,spelling:i,line:o.line,column:a,endColumn:a+n-1}),o.index+=n},u=t=>{for(let n=0;n<t;n++)e[o.index]===`
|
|
11
|
+
`&&(o.line++,o.lineStart=o.index+1),o.index++},d=n=>new t(`${n} at line ${o.line}, column ${c()}`,void 0,{reason:n,line:o.line,column:c(),isEnd:o.index>=e.length});for(;o.index<e.length;){let t=e[o.index];if(t===`
|
|
12
|
+
`||t===` `||t===` `||t===`\r`){u(1);continue}if(e.startsWith(`\\*`,o.index)){let t=e.indexOf(`
|
|
13
|
+
`,o.index);u((t===-1?e.length:t)-o.index);continue}if(e.startsWith(`(*`,o.index)){let t={value:0};do{if(o.index>=e.length)throw d(`Unterminated comment`);e.startsWith(`(*`,o.index)?(t.value++,u(2)):e.startsWith(`*)`,o.index)?(t.value--,u(2)):u(1)}while(t.value>0);continue}if(e.startsWith(`----`,o.index)){let t=w(e,o.index,e=>e===`-`)-o.index;e.slice(o.index+t).trimStart().startsWith(`MODULE`)&&o.moduleDepth++,l(`Separator`,`----`,t);continue}if(e.startsWith(`====`,o.index)){if(l(`ModuleEnd`,`====`,w(e,o.index,e=>e===`=`)-o.index),o.moduleDepth--,o.moduleDepth<=0)break;continue}if(t===`"`){let t=o.line,n=c(),i=[];for(u(1);e[o.index]!==`"`;){if(o.index>=e.length||`
|
|
14
|
+
\r`.includes(e[o.index]))throw d(`Unterminated string`);if(e[o.index]===`\\`){let t=e[o.index+1];if(t===void 0||!`ntrf\\"`.includes(t))throw d(`Invalid escape in string`);i.push({n:`
|
|
15
|
+
`,t:` `,r:`\r`,f:`\f`}[t]??t),u(2)}else i.push(e[o.index]),u(1)}u(1),r.push({kind:`String`,text:i.join(``),line:t,column:n,endColumn:c()-1});continue}let n=ce.exec(e.slice(o.index,o.index+64));if(n){l(`Number`,n[0],n[0].length);continue}if(fe(t)){let t=e.slice(o.index,w(e,o.index,fe));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(o.index))?.[0]??t;l(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}let n=/^(_|\d+)/.exec(t)?.[0];if(n!==void 0&&!/[A-Za-z]/.test(t)){l(n===`_`?`Operator`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){l(`Keyword`,t.slice(0,3),3);continue}let r=i.get(t)??t;i.set(r,r),l(re.has(t)?`Keyword`:`Identifier`,r,t.length);continue}if(`ℕℤℝ`.includes(t)){l(`Identifier`,i.get(t)??t,1),i.set(t,t);continue}let a=pe(e,o.index);if(a>0){l(`Step`,e.slice(o.index,o.index+a),a);continue}let s=b(e,o.index);if(s){let t=e.slice(o.index,o.index+s.length);l(`Operator`,s.text,s.length,t===s.text?void 0:t)}else throw d(`Unexpected character ${JSON.stringify(t)}`)}let f=c();return r.push({kind:`End`,text:``,line:o.line,column:f,endColumn:f}),r},_e=[[`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`]],ve=_e.map(e=>e[0]),ye=new Map(ve.map((e,t)=>[e,t]).reverse()),T=e=>{let t=ye.get(e);if(t===void 0)throw new te(`Unknown SANY token kind ${e}`);return t},E=new Map(_e.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),be=Math.max(...[...E.keys()].map(e=>e.length)),xe=Array.from({length:be},(e,t)=>be-t),Se=/----+ *MODULE/y,Ce=[/_\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],we=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`)),Te=we(String.raw`\.\/\\`),Ee=we(String.raw`\.\\\/`),De=String.raw`<(?:[0-9]+|\+|\*)>`,Oe=[[`_BM0`,[Se]],[`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`,Te],[`BOR`,Ee],[`IDENTIFIER`,Ce],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${De}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(De,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${De}(?:\*\.*|-\.*|\.+)`,`y`)]]],ke=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[Se]]],Ae=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[Se]],[`BAND`,Te],[`BOR`,Ee],[`IDENTIFIER`,Ce]],je=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Me=(e,t,n)=>e.map(([e,r])=>({kind:T(e),length:Math.max(...r.map(e=>je(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),Ne=(e,t)=>{let n=xe.find(n=>E.has(e.slice(t,t+n))),r=Me(Oe,e,t);if(n===void 0)return r;let i={kind:E.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},Pe=e=>e+8-e%8,Fe=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
|
|
16
|
+
`?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
|
|
17
|
+
`?r.isAfterLf=!0:i===` `&&(r.column=Pe(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},Ie=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Le=new Set([...E.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Re=(e,t)=>{let n=0;for(;Le.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,je(Ie,e,t)))},ze=e=>{let t=Fe(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(T(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?D(o,s,e[a],i):t.lines[n]===o?e[a]===`
|
|
18
|
+
`||e[a]===`\r`?D(o+1,0,void 0,i):D(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=Me(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,ve[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),ve[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(ke);if(n.mode===`PRAGMA`)return s(Ae);for(;n.offset<e.length;){let t=n.offset;if(`
|
|
19
|
+
\r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=Ne(e,t);if(i.length===0){let n=Re(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},Be=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
20
|
+
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Ve=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Be.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),D=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Ve(n)}" (${n.charCodeAt(0)}), `}after : "${Ve(r)}"`,He=e=>{let t=ze(e);for(let e=t();typeof e!=`string`&&e.kind!==T(`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===` `?Pe(e):e+1,e.beginColumn);return D(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Ue=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},O=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,We=`-------------------------------- MODULE Reals -------------------------------
|
|
20
21
|
(***************************************************************************)
|
|
21
22
|
(* This module provides dummy definitions of the operators that are *)
|
|
22
23
|
(* defined by the real Reals module. It is expected that any tool that *)
|
|
@@ -33,7 +34,7 @@ EXTENDS Integers
|
|
|
33
34
|
Real == "Reals"
|
|
34
35
|
a / b == CHOOSE m \\in Real : m * b = a
|
|
35
36
|
Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
|
|
36
|
-
|
|
37
|
+
=============================================================================`,Ge=`----------------------------- MODULE RealTime -------------------------------
|
|
37
38
|
(***************************************************************************)
|
|
38
39
|
(* This standard module is described in Chapter 9 of the book "Specifying *)
|
|
39
40
|
(* Systems". The type of specification described there cannot be handled *)
|
|
@@ -59,7 +60,7 @@ RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
|
|
|
59
60
|
IN /\\ now \\in Real
|
|
60
61
|
/\\ [][NowNext]_now
|
|
61
62
|
/\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
|
|
62
|
-
|
|
63
|
+
=============================================================================`,Ke=`----------------------------- MODULE Toolbox --------------------------------
|
|
63
64
|
(***************************************************************************)
|
|
64
65
|
(* *)
|
|
65
66
|
(***************************************************************************)
|
|
@@ -85,8 +86,60 @@ _TEPosition ==
|
|
|
85
86
|
THEN _TETraceLength
|
|
86
87
|
ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
|
|
87
88
|
|
|
88
|
-
=============================================================================`]]),Ds=`tlc2/value/impl/`,Os=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},ks=e=>[...e.slice(1,e.indexOf(`)`)).matchAll(/\[*(?:L[^;]*;|[BCDFIJSZ])/g)].length,As=e=>{let t=Os(e);if(t.readUint32()!==3405691582)throw new u(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===1?a.text=i.decode(t.readBytes(t.readUint16())):r===3?a.value=t.readInt32():r===4?t.readUint32():r===5||r===6?(t.readBytes(8),e++):r===7||r===8||r===16||r===19||r===20?a.first=t.readUint16():r===15?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16(),t.readUint16(),t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let a=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,o={name:r,arity:ks(i),code:void 0};for(let e=t.readUint16();e>0;e--){let e=n[t.readUint16()].text,r=t.readBytes(t.readUint32());if(e===`Code`){let e=new DataView(r.buffer,r.byteOffset+4,4).getUint32(0);o.code=r.subarray(8,8+e)}}e&1&&e&8&&a.push(o)}return{pool:n,methods:a}},js=(e,t)=>e[e[t].first].text,Ms=(e,t)=>{let n=e[t],r=e[n.second];return{className:js(e,n.first),name:e[r.first].text}},Ns=(e,t,n,r)=>{let i=()=>new g(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===3)return n.value;if(n.tag===8)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=2&&n<=8)o.push(n-3),e+=1;else if(n===16)o.push(a[e+1]<<24>>24),e+=2;else if(n===17)o.push(l()<<16>>16),e+=3;else if(n===18)o.push(c(a[e+1])),e+=2;else if(n===19)o.push(c(l())),e+=3;else if(n===89){let t=s();o.push(t,t),e+=1}else if(n===178){let n=Ms(t,l());if(n.className!==`${Ds}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===184){let n=Ms(t,l()),a=s();if(n.className!==`${Ds}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===187)o.push({className:js(t,l()),value:void 0}),e+=3;else if(n===183){let n=Ms(t,l()),a=s(),o=s();if(!(n.className===`${Ds}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===176){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},Ps=(e,t)=>{if(!t)return e;let n=As(t),r=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let r=n.methods.find(e=>e.name===t.name&&e.arity===t.params.length);return r?{...t,body:Ns(r,n.pool,e.name,t.location)}:t});return{...e,definitions:r}},Z=(e,t,n)=>({low:e,high:t,isAssociative:n}),Fs=new Map([[`=>`,Z(1,1,!1)],[`<=>`,Z(2,2,!1)],[`~>`,Z(2,2,!1)],[`-+->`,Z(2,2,!1)],[`/\\`,Z(3,3,!0)],[`\\/`,Z(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,Z(5,5,!1)]),[`\\cdot`,Z(5,14,!0)],[`@@`,Z(6,6,!0)],[`:>`,Z(7,7,!1)],[`<:`,Z(7,7,!1)],[`\\cup`,Z(8,8,!0)],[`\\cap`,Z(8,8,!0)],[`\\`,Z(8,8,!1)],[`..`,Z(9,9,!1)],[`...`,Z(9,9,!1)],[`##`,Z(9,13,!0)],[`$`,Z(9,13,!0)],[`$$`,Z(9,13,!0)],[`??`,Z(9,13,!0)],[`!!`,Z(9,13,!1)],[`\\sqcap`,Z(9,13,!0)],[`\\sqcup`,Z(9,13,!0)],[`\\uplus`,Z(9,13,!0)],[`\\wr`,Z(9,14,!1)],[`+`,Z(10,10,!0)],[`++`,Z(10,10,!0)],[`(+)`,Z(10,10,!0)],[`\\oplus`,Z(10,10,!0)],[`%`,Z(10,11,!1)],[`%%`,Z(10,11,!0)],[`|`,Z(10,11,!0)],[`||`,Z(10,11,!0)],[`\\X`,Z(10,13,!1)],[`-`,Z(11,11,!0)],[`--`,Z(11,11,!0)],[`(-)`,Z(11,11,!0)],[`\\ominus`,Z(11,11,!0)],[`*`,Z(13,13,!0)],[`**`,Z(13,13,!0)],[`/`,Z(13,13,!1)],[`//`,Z(13,13,!1)],[`\\div`,Z(13,13,!1)],[`\\o`,Z(13,13,!0)],[`(.)`,Z(13,13,!0)],[`\\odot`,Z(13,13,!0)],[`(/)`,Z(13,13,!1)],[`\\oslash`,Z(13,13,!1)],[`(\\X)`,Z(13,13,!0)],[`\\otimes`,Z(13,13,!0)],[`&`,Z(13,13,!0)],[`&&`,Z(13,13,!0)],[`\\star`,Z(13,13,!0)],[`\\bullet`,Z(13,13,!0)],[`\\bigcirc`,Z(13,13,!0)],[`^`,Z(14,14,!1)],[`^^`,Z(14,14,!1)]]),Is=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Ls=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Rs=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),zs=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Bs=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...Is]),Vs=e=>Fs.has(e)||Is.has(e)||e===`-.`,Hs=(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}}},Us=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Ws=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Gs=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Ks=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),qs=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Js=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Ys=/* @__PURE__ */ new Set([``,`*`,`-`]),Xs=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Zs=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Qs=/* @__PURE__ */ new Set([`NEW`,...Zs.keys()]),$s=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),ec=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),tc=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),nc=e=>RegExp(`^-{4,}\\s*MODULE\\s+${e}\\s*-{3,}$`),rc=(e,t)=>{let n=e.split(/\r?\n/),r=n.findIndex(e=>nc(t).test(e));if(r===-1)return;let i=n.findIndex((e,t)=>t>r&&e.startsWith(`====`));return n.slice(r,i===-1?void 0:i+1).join(`
|
|
89
|
-
`)},ic=(e,t)=>{let n=se(e),r={index:0,offsideColumns:[]},i=[],a=/* @__PURE__ */ new Set,o=[],s={index:-1},c=[],l=e=>i[i.length-1].has(e),d=e=>({line:e.line,column:t&&e.kind===`String`?e.endColumn:e.column,range:void 0}),f=[],p=[],m=[],h=e=>{let t=r.index-1,i=e===t?m[e]:void 0;if(i)return i;let a=n[t];f[e]??=d(n[e]),p[t]??={line:a.line,column:a.endColumn};let o={module:c[c.length-1].name,start:f[e],end:p[t]};return e===t&&(m[e]=o),o},g=(e,t)=>(e.location.range=h(t),e),_=(e=0)=>n[Math.min(r.index+e,n.length-1)],v=(e=0)=>{let t=_(e),n=r.offsideColumns[r.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},y=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),b={index:0},ee=e=>{let t=n.slice(b.index,r.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},x=e=>t&&(e.kind===`Keyword`||tc.has(e.text)),te=e=>{let t=n.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},ne=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Js.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):x(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,S=(e,t=_(),r)=>{let i=n[n.length-1],a=t.line===i.line&&t.column===i.column;return new u(`${e} at line ${t.line}, column ${t.column}`,void 0,ie(e,t,a,r))},ie=(e,r,i,a)=>{if(t&&i){let e=n[n.length-1];return{reason:`Unexpected EOF`,...ee(te(e)),isEnd:i}}return t&&a?{reason:`Unexpected ${ne(a)}`,...te(a),isEnd:i}:{reason:e,line:r.line,column:r.column,isEnd:i}},ae=(e,t=_())=>S(e,t,t),oe=e=>(e.kind===`Identifier`||e.kind===`Keyword`)&&!x(e),C=(e,t=0)=>{let n=v(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},w=()=>{let e=v();if(e.kind===`End`)throw S(`Unexpected end of expression`);return r.index++,e},T=e=>C(e)?(r.index++,!0):!1,E=e=>{if(!C(e))throw ae(`Expected ${JSON.stringify(e)} but found ${y(v())}`);return w()},D=()=>{let e=v();if(e.kind!==`Identifier`)throw ae(`Expected an identifier but found ${y(e)}`);if(x(e))throw ae(`Unexpected keyword ${e.text}`);return r.index++,e.text},ce=e=>{r.offsideColumns.push(-1);let t=e();return r.offsideColumns.pop(),t},O=(e,t=`,`)=>{let n=[e()];for(;T(t);)n.push(e());return n},le=()=>{if(C(`<<`)){let e={value:1};for(;v(e.value).kind===`Identifier`||C(`,`,e.value);)e.value++;return C(`>>`,e.value)&&C(`\\in`,e.value+1)}let e={value:0};for(;v(e.value).kind===`Identifier`;){if(C(`\\in`,e.value+1))return!0;if(!C(`,`,e.value+1))return!1;e.value+=2}return!1},ue=()=>{if(C(`::`))return!0;if(!C(`(`))return!1;let e={value:1};for(;v(e.value).kind===`Identifier`&&C(`,`,e.value+1);)e.value+=2;return v(e.value).kind===`Identifier`&&C(`)`,e.value+1)&&C(`::`,e.value+2)},de=()=>{if(!T(`<<`))return{kind:`Name`,name:D()};let e=O(D);return E(`>>`),{kind:`Tuple`,names:e}},fe=()=>O(()=>{let e=O(de);E(`\\in`);let t=M();return e.map(e=>({pattern:e,set:t}))}).flat(),pe=()=>{let e=v();if(e.kind===`Identifier`){let t=r.index,n=[w().text];for(;C(`!`)&&v(1).kind===`Identifier`;)w(),n.push(D());return g({kind:`Identifier`,name:n.join(`!`),location:d(e)},t)}if(C(`<<`)||C(`(`))return Ce();throw ae(`Expected a subscript but found ${y(e)}`)},me=e=>{let t=v(1),n=v(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&C(`==`,Is.has(n.text)?3:4))},k=e=>{if(!Rs.has(e.text))return!0;let t=v(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||C(`,`,1)||C(`)`,1)||t.kind===`Keyword`&&Ws.has(t.text)||me(e)},A=()=>{let e=v(),n=e.kind===`Operator`&&(Fs.has(e.text)||Ls.has(e.text))&&k(e);if(t&&e.kind!==`String`&&(Ls.has(e.text)||Bs.has(e.text)&&e.text!==`'`&&!Is.has(e.text)||zs.has(e.text)&&v(-1).text===`(`&&v(-1).line===e.line&&v(-1).endColumn+1===e.column&&v(1).text===`)`&&v(1).line===e.line&&v(1).column===e.endColumn+1)&&k(e))throw S(`incomplete expression`,e);if(n)return r.index++,g({kind:`OperatorReference`,operator:e.text,location:d(e)},r.index-1);if(e.kind!==`String`&&Bs.has(e.text)&&k(e)){r.index++;let t=d(e);if(Is.has(e.text))return{kind:`OperatorReference`,operator:e.text,location:t};let n={kind:`Identifier`,name:`argument`,location:t};return{kind:`Lambda`,params:[n.name],body:Hs(e.text,n,t),location:t}}if(C(`LAMBDA`)){let t=r.index;w();let n=O(D);E(`:`);let i=M();return g({kind:`Lambda`,params:n,body:i,location:d(e)},t)}return M()},j=()=>ce(()=>{E(`(`);let e=O(A);return E(`)`),e}),he=()=>{let e=w();r.offsideColumns.push(e.column);let t=[M()];for(;_().text===e.text&&_().column===e.column;)r.index++,t.push(M());return r.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:d(e)}},ge=e=>ce(()=>{let t=d(e);if(v().kind===`Identifier`&&(C(`|->`,1)||C(`:`,1))){let e=C(`|->`,1)?`Record`:`RecordSet`,n=O(()=>{let t=D();return E(e===`Record`?`|->`:`:`),{name:t,value:M()}});return E(`]`),{kind:e,fields:n,location:t}}if(le()){let e=fe();E(`|->`);let n=M();return E(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let n=M();if(T(`->`)){let e=M();return E(`]`),{kind:`FunctionSet`,domain:n,range:e,location:t}}if(T(`EXCEPT`)){let e=O(()=>{E(`!`);let e=[];for(;C(`.`)||C(`[`);)if(T(`.`)){if(!oe(v()))throw ae(`Expected a field name but found ${y(v())}`);e.push({kind:`Field`,name:w().text})}else E(`[`),e.push({kind:`Index`,args:O(()=>M())}),E(`]`);return E(`=`),{path:e,value:M()}});return E(`]`),{kind:`Except`,function:n,updates:e,location:t}}return E(`]_`),{kind:`BoxAction`,action:n,subscript:pe(),location:t}}),_e=e=>ce(()=>{let t=d(e);if(T(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(le()&&(v(1).text===`\\in`||C(`<<`))){let e=r.index,n=de();E(`\\in`);let i=M();if(T(`:`)){let e=M();return E(`}`),{kind:`SetFilter`,bound:{pattern:n,set:i},predicate:e,location:t}}r.index=e}let n=M();if(T(`:`)){let e=fe();return E(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let i=[n];for(;T(`,`);)i.push(M());return E(`}`),{kind:`SetEnumeration`,elements:i,location:t}}),ve=e=>{let t=d(e),n=ce(()=>C(`>>`)||C(`>>_`)?[]:O(()=>M()));if(T(`>>_`)){if(n.length!==1)throw S(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:pe(),location:t}}return E(`>>`),{kind:`Tuple`,elements:n,location:t}},ye=e=>{let t=d(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&le()){let e=fe();return E(`:`),{kind:n,bounds:e,body:M(),location:t}}let i=O(D);return E(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i,body:M(),isTemporal:r,location:t}},be=e=>{let t=[];do{if(T(`OTHER`))return E(`->`),{kind:`Case`,arms:t,other:M(),location:d(e)};let n=M();E(`->`),t.push({condition:n,body:M()})}while(T(`[]`));return{kind:`Case`,arms:t,other:void 0,location:d(e)}},xe=()=>{let e=v(1);return C(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Us.has(e.text)||e.kind===`Operator`&&(Fs.has(e.text)||Is.has(e.text)||Ls.has(e.text)))},Se=()=>{let e=w();if(e.kind===`Number`)return{kind:`Operand`,operand:re(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return r.index--,{kind:`Bound`,args:j()}}return{kind:`Name`,name:e.text,args:C(`(`)?j():[]}},Ce=()=>{let e=r.index===s.index,n=w(),a=d(n);if(t&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=O(D);return E(`:`),{kind:`Lambda`,params:e,body:M(),location:a}}if(n.kind===`Number`){if(t&&/^\\[BOH]/.test(n.text))throw S(`incomplete expression`,n);return{kind:`Number`,value:re(n.text),text:n.text,location:a}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:a};if(n.kind===`String`)return{kind:`String`,value:n.text,location:a};let o=n.kind===`Step`&&Ie(n);if(o&&Pe()<0&&Ne.length<=1)throw S(`Step number used outside proof`,n);if(o&&n.text[1]===`+`)throw S(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||o){let r=o?Le(n)??n.text:n.text;if(ue()){let e=T(`(`)?O(D):[];return e.length>0&&E(`)`),E(`::`),{kind:`Label`,name:r,params:e,body:M(),location:a}}let i=C(`(`),s=i?j():[];if(!xe())return i?{kind:`Apply`,operator:r,args:s,location:a}:{kind:`Identifier`,name:r,location:a};let l=c.flatMap(e=>e.instances).find(e=>e.name===r);if(l&&!e&&!t&&l.params.length!==s.length)throw S(`The operator ${r} requires ${l.params.length} arguments`,n);let u=[{kind:`Name`,name:r,args:s}];for(;xe();)w(),u.push(Se());let d=u.flatMap(e=>e.kind===`Name`?[e.name]:[]);if(d.length<u.length)return{kind:`Subexpression`,selectors:u,location:a};let f=d.join(`!`),p=u.flatMap(e=>`args`in e?e.args:[]);if(p.length===0)return{kind:`Identifier`,name:f,location:a};let m=u.map(e=>`args`in e?e.args.length:0);return m.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:f,args:p,argumentCounts:m,location:a}:{kind:`Apply`,operator:f,args:p,location:a}}if(n.kind===`Operator`&&Vs(n.text)&&C(`(`))return{kind:`Apply`,operator:n.text,args:j(),location:a};switch(n.text){case`(`:{let e=ce(()=>M());return E(`)`),e}case`[`:return ge(n);case`{`:return _e(n);case`<<`:return ve(n);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return ye(n);case`IF`:{let e=M();E(`THEN`);let t=M();return E(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:M(),location:a}}case`CASE`:return be(n);case`LET`:{let e=[],n=[];for(i.push(/* @__PURE__ */ new Set);!T(`IN`);){if(t&&C(`RECURSIVE`))throw S(`Unexpected keyword RECURSIVE`,ee(_()));if(T(`RECURSIVE`)){je();continue}let r=Ee(!1);r.kind===`Instance`?n.push(r):e.push(r)}i.pop();let r=M();return n.length===0?{kind:`Let`,definitions:e,body:r,location:a}:{kind:`Let`,definitions:e,instances:n,body:r,location:a}}case`CHOOSE`:{let e=de(),t=T(`\\in`)?M():void 0;return E(`:`),{kind:`Choose`,pattern:e,set:t,body:M(),location:a}}case`WF_`:case`SF_`:{let e=pe(),t=ce(()=>{E(`(`);let e=M();return E(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:a}}}throw ae(`Unexpected ${y(n)}`,n)},we=()=>{let e=v(),t=d(e);if(e.kind===`Operator`&&(e.text===`/\\`||e.text===`\\/`))return he();if(e.kind===`Operator`||e.kind===`Keyword`)switch(e.text){case`~`:return w(),{kind:`Apply`,operator:`~`,args:[M(5)],location:t};case`-`:return w(),{kind:`Apply`,operator:`-.`,args:[M(13)],location:t};case`[]`:return w(),{kind:`Always`,expression:M(16),location:t};case`<>`:return w(),{kind:`Eventually`,expression:M(16),location:t};case`ENABLED`:return w(),{kind:`Enabled`,expression:M(16),location:t};case`UNCHANGED`:return w(),{kind:`Unchanged`,expression:M(16),location:t};case`SUBSET`:case`UNION`:case`DOMAIN`:return w(),{kind:`Apply`,operator:e.text,args:[M(9)],location:t}}return Ce()},M=(e=0)=>{let t=r.index,n=we(),i={left:n.location.range?n:g(n,t),previous:void 0};for(;;){let n=v();if(n.kind!==`Operator`)break;let r=d(n);if(n.text===`'`&&e<=15){w(),i.left=g({kind:`Prime`,expression:i.left,location:r},t);continue}if(Is.has(n.text)&&e<=15){w(),i.left=g({kind:`Apply`,operator:n.text,args:[i.left],location:r},t);continue}if(n.text===`[`){w();let e=ce(()=>O(()=>M()));ce(()=>E(`]`)),i.left=g({kind:`FunctionApplication`,function:i.left,args:e,location:r},t);continue}if(n.text===`.`&&oe(v(1))){w();let e=w().text;i.left=g({kind:`FieldAccess`,record:i.left,field:e,location:r},t);continue}let a=Fs.get(n.text);if(!a||a.low<e)break;let o=i.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw S(`Precedence conflict between ${o.text} and ${n.text}`,n)}w();let s=M(a.high+1),c=i.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`;i.left=c.kind===e&&o?.text===n.text?{...c,operands:[...c.operands,s]}:{kind:e,operands:[c,s],location:r}}else i.left=n.text===`\\X`?c.kind===`Product`&&o?.text===`\\X`?{...c,factors:[...c.factors,s]}:{kind:`Product`,factors:[c,s],location:r}:{kind:`Apply`,operator:n.text,args:[c,s],location:r};i.left=g(i.left,t),i.previous={...a,text:n.text}}return i.left},Te=()=>{if(!T(`(`))return[];let e=Ae();return E(`)`),e},N=()=>{let e=d(v()),t=M(),i=n[r.index-1],a={line:i.line,column:i.endColumn};return{body:t,bodyRange:{module:c[c.length-1].name,start:e,end:a}}},Ee=e=>{let t=r.index;return g(De(e),t)},De=e=>{let t=v(),n=d(t),i=(t,r)=>({kind:`Operator`,name:t,params:r,...N(),isLocal:e,isRecursive:l(t),location:n});if(t.kind===`Identifier`&&v(1).kind===`Operator`&&Fs.has(v(1).text)&&v(2).kind===`Identifier`&&C(`==`,3)){let e=D(),t=w().text,n=D();return E(`==`),i(t,[{name:e,arity:0},{name:n,arity:0}])}let a=t.kind===`Operator`&&t.text===`-.`,o=t.kind===`Identifier`&&Is.has(v(1).text)&&C(`==`,2);if(a||o){let e=a?t.text:v(1).text;r.index+=a?1:2;let n=a?D():t.text;return E(`==`),i(e,[{name:n,arity:0}])}let s=D();if(T(`[`)){let t=ce(()=>fe());return E(`]`),E(`==`),{kind:`Function`,name:s,bounds:t,body:M(),isLocal:e,isRecursive:l(s),location:n}}let c=r.index,u=Te();return E(`==`),C(`INSTANCE`)?{...Oe(s,u,e,n),definitionRange:h(c)}:i(s,u)},Oe=(e,t,n,i)=>{let a=r.index;return E(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:D(),substitutions:T(`WITH`)?O(()=>{let e=w().text;return E(`<-`),{name:e,expression:A()}}):[],isLocal:n,location:i,instanceRange:h(a)}},ke=()=>{let e=d(v());if(C(`_`)&&v(1).kind===`Operator`)return w(),{name:w().text,arity:T(`_`)?2:1,location:e};if(v().kind===`Operator`&&C(`_`,1)){let t=w().text;return w(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=D();if(!T(`(`))return{name:t,arity:0,location:e};let n=O(()=>E(`_`));return E(`)`),{name:t,arity:n.length,location:e}},Ae=()=>O(ke),je=()=>{let e=Ae();return e.forEach(e=>i[i.length-1].add(e.name)),e},P=e=>{let t={value:0,offset:e};do{let e=v(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&$s.has(e.text)&&t.value++,e.kind===`Operator`&&ec.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Me=()=>{let e=v(),t=v(1);return e.kind===`Identifier`?C(`(`,1)||C(`[`,1)?C(`==`,P(1)):t.kind===`Operator`&&Is.has(t.text)?C(`==`,2):t.kind===`Operator`&&Fs.has(t.text)?v(2).kind===`Identifier`&&C(`==`,3):C(`==`,1):C(`-.`)&&t.kind===`Identifier`&&C(`==`,2)},Ne=[],Pe=()=>Ne[Ne.length-1]??-1,Fe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),F=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},Ie=e=>!e.text.endsWith(`.`)&&!Ys.has(F(e)),Le=e=>{let t=F(e);if(Ys.has(t))return;let n=Fe(e);if(n>=0)return`<${n}>${t}`;let r=Pe(),i=Ne[Ne.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Re=e=>{if(e.kind===`Keyword`)return Ks.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Ne.length===0;if(e.text[1]===`+`||Ne.length===0)return!0;let t=Pe();return t>=0&&Fe(e)>t},ze=e=>{let t=Fe(e),n=Ne.length-1,r=Ne[n-1]??-1,i=Ne[n]<0;return i&&(Ne[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Ne[n]===t},Be=e=>!a.has(e)&&c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),Ve=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!tc.has(e.name)&&!Be(e.name):!1,He=()=>{let e=v();return e.kind===`Step`?Ie(e):e.kind===`Keyword`?Xs.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Me()},Ue=()=>{let e=r.index;s.index=e;let t=v();return t.kind===`Operator`&&!Rs.has(t.text)&&Vs(t.text)?(r.index++,g({kind:`OperatorReference`,operator:t.text,location:d(t)},e)):T(`MODULE`)?g({kind:`ModuleFact`,name:D(),location:d(t)},e):M()},We=e=>o[o.length-1]?.add(e),Ge=e=>{o.push(/* @__PURE__ */ new Set);let t=e();return o.pop(),t},Ke=e=>o.some(t=>t.has(e))||c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),qe=()=>{let e=r.index,t=v(),n=O(()=>{let e=v();if((e.kind!==`Identifier`||x(e))&&e.kind!==`Operator`)throw ae(`Expected a definition name but found ${y(e)}`,e);return r.index++,e.text},`!`),i=d(t);return g(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:i}:{kind:`Identifier`,name:n.join(`!`),location:i},e)},Je=()=>{if(t)return O(qe);let e=O(Ue),n=e.find(e=>e.kind===`Identifier`&&Ke(e.name));if(n)throw S(`DEF clause entry should describe a defined operator`,n.location);return e},Ye=()=>({facts:He()?O(Ue):[],defs:T(`DEF`)||T(`DEFS`)?Je():[]}),Xe=()=>{let e=r.index,n=w(),i=n.text===`USE`&&T(`ONLY`),a=h(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:i,...Ye(),keyword:a,location:d(n)},s=o.kind===`Hide`&&!t?o.facts.find(e=>!Ve(e)):void 0;if(s)throw S(`The only expression allowed as a fact in a HIDE is the name of a theorem, assumption, or step`,s.location);return g(o,e)},Ze=()=>{let e=r.index,t=d(v()),n=T(`NEW`),i=v().kind===`Keyword`?Zs.get(v().text):void 0;if(!n&&i===void 0)throw ae(`Expected a declaration but found ${y(v())}`);if(i!==void 0&&w(),i===`Variable`){let n=D();return We(n),g({kind:`NewSymbol`,name:n,arity:0,level:i,set:void 0,location:t},e)}let a=ke();We(a.name);let o=(i??`Constant`)===`Constant`&&C(`\\in`);if(o&&a.arity>0)throw S(`declared symbol with arguments before \\in`);return o&&w(),g({kind:`NewSymbol`,name:a.name,arity:a.arity,level:i??`Constant`,set:o?M():void 0,location:t},e)},Qe=()=>{let e=r.index,t=d(E(`ASSUME`)),n=O(()=>C(`ASSUME`)?Ge(Qe):v().kind===`Keyword`&&Qs.has(v().text)?Ze():M());return E(`PROVE`),g({kind:`AssumeProve`,assumptions:n,conclusion:M(),location:t},e)},$e=e=>{let t={value:0};for(;v(t.value).kind===`Identifier`&&C(`,`,t.value+1);)t.value+=2;return v(t.value).kind===`Identifier`&&C(e,t.value+1)},et=(e,t)=>{e.forEach(We),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(We))},tt=()=>{let e=v();if(C(`USE`)||C(`HIDE`))return Xe();if(C(`INSTANCE`))return g(Oe(void 0,[],!1,d(e)),r.index);if(C(`DEFINE`)||Me()){let t=r.index;T(`DEFINE`);let n=[Ee(!1)];for(;Me();)n.push(Ee(!1));let i={kind:`Define`,definitions:n,location:d(e)};return g(i,t)}if(T(`HAVE`))return{kind:`Have`,expression:M()};if(T(`TAKE`)){let e=le(),t=e?[]:O(D),n=e?fe():[];return et(t,n),{kind:`Take`,names:t,bounds:n}}if(T(`WITNESS`))return{kind:`Witness`,expressions:O(()=>M())};if(T(`PICK`)){let e=$e(`:`),t=e?O(D):[],n=e?[]:fe();return et(t,n),E(`:`),{kind:`Pick`,names:t,bounds:n,body:M()}}return T(`CASE`)?{kind:`Case`,expression:M()}:{kind:`Assert`,isSuffices:T(`SUFFICES`),statement:C(`ASSUME`)?Qe():M()}},nt=e=>{let t=v();if(t.kind!==`Step`)throw ae(`Expected a step number but found ${y(t)}`,t);if(!ze(t))throw S(`${e?`QED step`:`step`}'s number has bad level`,t);if(Fe(t)<0&&Le(t)!==void 0)throw S(`<*> and <+> cannot be used for a named step`,t);return r.index++,{name:Le(t),token:t.text,location:d(t)}},rt=()=>{let e=r.index,t=nt(C(`QED`,1)),n=/* @__PURE__ */ new Set;o.push(n);let i=T(`QED`)?{kind:`Qed`}:tt(),a=h(e),s=Re(v());if(s&&!qs.has(i.kind))throw S(`Proof of a step that does not take a proof`);let c=s?at():void 0;return o.pop(),(i.kind!==`Assert`||i.isSuffices)&&n.forEach(We),g({...t,body:i,head:a,proof:c},e)},it=()=>{let e=d(v());if(C(`BY`)||C(`PROOF`)&&C(`BY`,1)){T(`PROOF`),w();let t=h(r.index-1);return{kind:`By`,isOnly:T(`ONLY`),...Ye(),keyword:t,location:e}}let t=v(+!!C(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){T(`PROOF`),w();let n=h(r.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}T(`PROOF`);let n=[rt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(rt());return{kind:`Steps`,level:Pe(),steps:n,location:e}},at=()=>{let e=r.index;Ne.push(-1);let t=Ge(it);return Ne.pop(),g(t,e)},ot=e=>{let t=r.index,n=w(),i=v().kind===`Identifier`&&C(`==`,1)?D():void 0;i!==void 0&&(a.add(i),w());let o=Ge(()=>({statement:C(`ASSUME`)?Qe():M(),proof:Re(v())?at():void 0})),s=o.statement,c=g({name:i,statement:s,proof:o.proof,location:d(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&s.kind!==`AssumeProve`&&e.definitions.push(g({kind:`Operator`,name:i,params:[],body:s,isLocal:!1,isRecursive:!1,location:d(n)},t))},st=()=>{let e=r.index;return g(ct(),e)},ct=()=>{let e=w(),t=d(e),n=e.text===`AXIOM`;if(v().kind===`Identifier`&&C(`==`,1)){let e=D();return a.add(e),w(),{name:e,expression:M(),isAxiom:n,location:t}}return{name:void 0,expression:M(),isAxiom:n,location:t}},lt=()=>{let e=d(E(`----`));E(`MODULE`);let t=D();E(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(c.push(n),i.push(/* @__PURE__ */ new Set),T(`EXTENDS`)&&O(()=>{let e=r.index;n.extends.push(D()),n.extendsRanges.push(h(e))});;){let a=r.index;b.index=a;let o=v();if(o.kind===`ModuleEnd`||o.kind===`End`)return o.kind===`ModuleEnd`&&(e.range={module:t,start:{line:e.line,column:e.column},end:{line:o.line,column:o.endColumn}}),c.pop(),i.pop(),n;if(o.kind===`Separator`){if(C(`MODULE`,1)){let e=lt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),E(`====`);continue}w()}else{switch(o.text){case`CONSTANT`:case`CONSTANTS`:{w();let e=Ae();n.constants.push(...e),n.units.push({kind:`Constants`,declarations:e});continue}case`VARIABLE`:case`VARIABLES`:{w();let e=O(()=>{let e=r.index,t=d(v());return g({name:D(),arity:0,location:t},e)});n.variables.push(...e),n.units.push({kind:`Variables`,declarations:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=st();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&n.definitions.push({kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{let e=Xe();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:w(),n.units.push({kind:`Recursive`,declarations:je()});continue;case`INSTANCE`:ut(n,g(Oe(void 0,[],!1,d(o)),a));continue;case`LOCAL`:if(w(),C(`INSTANCE`)){ut(n,g(Oe(void 0,[],!0,d(o)),a));continue}ut(n,Ee(!0));continue}o.kind===`Keyword`&&Gs.has(o.text)?ot(n):ut(n,Ee(!1))}}},ut=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))};return lt()},ac=e=>ic(e,!1),oc=e=>ic(e,!0),sc=25214903917n,cc=(1n<<48n)-1n,lc=2147483647,uc=e=>{let t={value:(BigInt.asUintN(64,e)^sc)&cc},n=e=>(t.value=t.value*sc+11n&cc,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^sc)&cc},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<=lc)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},dc=10454148508367108822n,fc=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:dc);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),pc=Int32Array.from(fc,e=>Number(BigInt.asIntN(32,e>>32n))),mc=Int32Array.from(fc,e=>Number(BigInt.asIntN(32,e))),hc=Number(BigInt.asIntN(32,dc>>32n)),gc=Number(BigInt.asIntN(32,dc));let _c=hc,vc=gc;const yc=e=>{let t=(e^vc)&255;vc=(vc>>>8|_c<<24)^mc[t],_c=_c>>>8^pc[t]},bc=e=>{for(let t=0;t<32;t+=8)yc(e>>>t)},xc=e=>{if(typeof e==`boolean`)yc(0),yc(e?116:102);else if(typeof e==`number`)yc(1),bc(e);else if(typeof e==`string`){yc(3),bc(e.length);for(let t=0;t<e.length;t++)yc(e.charCodeAt(t))}else if(j(e))yc(21),bc(Ae(e.name)+1);else if(A(e)){let t=V(e);yc(9),bc(t.domain.length);for(let e=0;e<t.domain.length;e++)xc(t.domain[e]),xc(t.range[e])}else{let t=R(e).elements;yc(5),bc(t.length);for(let e of t)xc(e)}},Sc=e=>{let t={high:_c,low:vc};_c=hc,vc=gc;for(let t of e)xc(t);let n=BigInt(_c>>>0)<<32n|BigInt(vc>>>0);return _c=t.high,vc=t.low,n},Cc=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||j(e))return 5;if(typeof e==`string`)return 5+e.length;if(A(e)){let t=V(e);return t.domain.reduce((e,n,r)=>e+Cc(n)+Cc(t.range[r]),5)}return R(e).elements.reduce((e,t)=>e+Cc(t),5)},wc=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){_c=n<32?0:1<<n-32,vc=n<32?1<<n:0;for(let t=0;t<e;t++)yc(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^_c,t[n+1]=t[a+1]^vc}}return t},Tc=()=>{let e=/* @__PURE__ */ new Map,t=/* @__PURE__ */ new Map,n=[],r=e=>{let r=t.get(e);if(r!==void 0)return r;let i=Cc(e);return _c=0,vc=0,xc(e),t.set(e,n.length),n.push(i,_c,vc),n.length-3},i=t=>{let n=e.get(t);if(n)return n;let r=wc(t);return e.set(t,r),r};return e=>{let t={high:_c,low:vc},a={high:hc,low:gc};for(let t of e){let e=r(t),o=i(n[e]),s={high:n[e+1],low:n[e+2]};for(let e=0;e<8;e++){let t=e<4?a.low:a.high,n=(e*256+(t>>>(e&3)*8&255))*2;s.high^=o[n],s.low^=o[n+1]}a.high=s.high,a.low=s.low}return _c=t.high,vc=t.low,BigInt(a.high>>>0)<<32n|BigInt(a.low>>>0)}},Ec=[],Dc=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Oc=()=>{for(let e=1277011;Ec.length<1341;e++)Dc(e)&&Ec.push(e);return Ec},kc=e=>{let t=Oc(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Ac=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},jc=e=>{for(let t=Math.max(e,9);;t++){let e=Ac(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)}}},Mc=(e,t,n)=>{if(t<=0)return[];let r=jc(t),i={index:BigInt(n.nextInt(t))},a=BigInt(kc(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Nc=(1n<<63n)-1n-24n,Pc=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Nc*BigInt(n)+i)%t;return r<0n?r+t:r})},Fc=(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,Ic=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=kt(e.domain),n=R(e.range).elements;return{lists:t.map(()=>n),create:e=>ze(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>R(e).elements),create:t=>jt(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>R(e).elements),create:I}}},Lc=(e,t,n)=>{if(z(t))return[];if(typeof t==`object`&&t.kind===`Interval`)return Mc(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let r=Ic(t);if(r){let t=r.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(lc)?Pc(e,t,n):Mc(e,Number(t),n)).map(e=>r.create(Fc(r.lists,e)))}let i=R(t).elements;return Mc(e,i.length,n).map(e=>i[Number(e)])},Rc=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new f(`RandomElement of the empty set`);return n},zc=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...kt(e.domain)];return ze(n,n.map(()=>zc(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return jt(e.names.map((n,r)=>[n,zc(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return I(e.factors.map(e=>zc(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 f(`RandomElement of the empty set`);return e.low+r}return Rc(R(e).elements,t)},Bc=(e,t=0n)=>{let n=uc(t),r={random:uc(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>jt([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Sc,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,checkDeadlock:e,startedAt:Date.now()};return a},Vc=e=>xt([...e.possibleCounts].map(([e,t])=>[e,t])),Hc=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Vc(e)]]),Uc=(e,t,n)=>new p(`Applying ${e} to the following value,\nwhich is not ${t}:\n${H(n)}`),Wc=(e,t,n,r)=>new p(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${H(r)}`),Gc=e=>A(e)?V(e):void 0,Kc=(e,t,n)=>{let r=U(e,t,n),i=Gc(r);if(!i)throw Uc(n,`a function with a finite domain`,r);return i},qc=(e,t,n)=>{let r=U(e,t,n),i=Gc(r);if(!i)throw Wc(t===0?`first`:`second`,n,`bag`,r);return i},Jc=(e,t)=>{if(!k(e)||!L(e))throw t();return R(e).elements},Yc=e=>e.range.every(e=>typeof e==`number`&&e>0),Xc=(e,t)=>{let n=e.domain.findIndex(e=>Be(e,t));return n===-1?void 0:e.range[n]},Zc=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Qc=Zc(`BagDiff`,`tlc2.value.impl.Value`,2),$c=Zc(`SqSubseteq`,`tlc2.value.IBoolValue`,2),el=Zc(`BagUnion`,`tlc2.value.impl.Value`,1),tl=Zc(`BagOfAll`,`tlc2.value.impl.Value`,2),nl=Zc(`BagCup`,`tlc2.value.impl.Value`,2),rl=Zc(`BagCardinality`,`tlc2.value.impl.IntValue`,1),il=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${tr(e)}`;throw rr(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},al=(e,t,n)=>{let r=il(e,n)+il(t,n);if(Xn(r))throw Zn(`${e}+${t}`);return r},ol=(e,t,n,r)=>{let i=Xc(n,e.domain[t]),a=il(e.range[t],r);return i===void 0?a:a-il(i,r)|0},sl=(e,t)=>xt(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Be(e[0],r));a?a[1]=al(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),cl=ze([],[]),ll=[Kn(`EmptyBag`,cl),W(`IsABag`,1,e=>{let t=Gc(U(e,0,`IsABag`));return t!==void 0&&Yc(t)}),W(`BagCardinality`,1,e=>{let t=U(e,0,`BagCardinality`);return Kc(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Uc(`BagCardinality`,`a bag`,t);return al(e,n,rl)},0)}),W(`BagIn`,2,e=>{let t=U(e,1,`BagIn`),n=Xc(Kc(e,1,`BagIn`),U(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Wc(`second`,`BagIn`,`bag`,t);return n>0}),W(`CopiesIn`,2,e=>{let t=U(e,1,`CopiesIn`),n=Xc(Kc(e,1,`CopiesIn`),U(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Wc(`second`,`CopiesIn`,`bag`,t);return n}),W(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=qc(e,t,`(+)`);if(!Yc(n))throw Wc(t===0?`first`:`second`,`(+)`,`bag`,U(e,t,`(+)`));return n});return sl(t,nl)}),W(`\\ominus`,2,e=>{let t=qc(e,0,`(-)`),n=qc(e,1,`(-)`);return xt(t.domain.flatMap((e,r)=>{let i=ol(t,r,n,Qc);return i>0?[[e,i]]:[]}))}),W(`BagUnion`,1,e=>{let t=U(e,0,`BagUnion`),n=Jc(t,()=>Uc(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??cl;let r=n.map(e=>{let n=Gc(e);if(!n)throw new p(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${H(t)}`);return n});return sl(r,el)}),W(`\\sqsubseteq`,2,e=>{let t=Kc(e,0,`\\sqsubseteq`),n=Kc(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>ol(t,r,n,$c)<=0)}),qn(`BagOfAll`,2,e=>{let t=Gn(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new p(`The first argument of BagOfAll should be an operator, but instead it is:\n${H(t.literalBody)}`);let n=U(e,1,`BagOfAll`),r=Gc(n);if(!r)throw Wc(`second`,`BagOfAll`,`function with a finite domain`,n);return sl(r.domain.map((e,n)=>ze([t.call([e])],[r.range[n]])),tl)}),W(`SubBag`,1,e=>{let t=U(e,0,`SubBag`);if(!A(t))throw new f(`DOMAIN expects a function but received ${H(t)}`);let n=V(t),r=ht(n.range).elements,i=r.find(e=>typeof e!=`number`);if(i!==void 0){let e=typeof r[0]!=`number`;throw new f(`The ${e?`first`:`second`} argument of >= should be an integer, but instead it is:\n${H(e?r[0]:i)}`)}let a=n.range.filter(e=>typeof e==`number`);if(a.some(e=>e<1))throw new f(`Attempted to apply a function to ${H(n)}, which is not in its domain`);return ht(n.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:a[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>ze(e.map(e=>e[0]),e.map(e=>e[1]))))}),W(`BagToSet`,1,e=>on(Kc(e,0,`BagToSet`))),W(`SetToBag`,1,e=>{let t=U(e,0,`SetToBag`),n=Jc(t,()=>Uc(`BagToSet`,`a function with a finite domain`,t));return ze([...n],n.map(()=>1))})],ul=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,dl=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,fl=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,pl=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,ml=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,hl=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,gl=e=>{if(!A(e))return!1;let t=V(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},_l=(e,t)=>rr(e,`Cannot convert value: unsupported value type tlc2.value.impl.${tr(t)}`),vl=(e,t)=>rr(e,`Cannot cast tlc2.value.impl.${tr(t)} to tlc2.value.impl.StringValue`),yl=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),bl=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw _l(t,e);return`[${R(e).elements.map(e=>Sl(e,t)).join(`,`)}]`},xl=(e,t)=>{let n=V(e),r=Yt(n);return r?`[${r.map(e=>Sl(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${yl(typeof e==`string`?e:H(e))}:${Sl(n.range[r],t)}`).join(`,`)}}`},Sl=(e,t)=>typeof e==`string`?yl(e):typeof e==`object`?e.kind===`ModelValue`?yl(e.name):k(e)?bl(e,t):xl(e,t):String(e),Cl=e=>{if(k(e))return bl(e,ul);if(!A(e)||gl(e))throw _l(ul,e);return xl(e,ul)},wl=e=>{if(!A(e))throw _l(dl,e);return xl(e,dl)},Tl=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},El=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Oe(e);if(Array.isArray(e))return I(e.map(e=>El(e,t)));if(typeof e==`object`&&e)return jt(Object.entries(e).map(([e,n])=>[Oe(e),El(n,t)]));throw rr(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Dl=(e,t)=>{if(e.trim()===``)return El(null,t);try{return El(JSON.parse(e,(e,t,n)=>typeof t==`number`?Tl(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?rr(t,e.message):e}},Ol=(e,t)=>{if(typeof e!=`string`)throw vl(t,e);return e},kl=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw rr(n,`${t} (No such file or directory)`);return r},Al=e=>[Jn(`ToJson`,1,e=>Oe(Sl(U(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Jn(`ToJsonArray`,1,e=>Oe(Cl(U(e,0,`ToJsonArray`)))),Jn(`ToJsonObject`,1,e=>Oe(wl(U(e,0,`ToJsonObject`)))),Jn(`JsonSerialize`,2,t=>{let n=Ol(U(t,0,`JsonSerialize`),fl),r=U(t,1,`JsonSerialize`);if(!Yt(r)&&!gl(r))throw new p(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${H(r)}`);return e.writeFile?.(n,Sl(r,fl)),!0}),Jn(`ndJsonSerialize`,2,t=>{let n=Ol(U(t,0,`ndJsonSerialize`),pl),r=U(t,1,`ndJsonSerialize`),i=Yt(r);if(!i)throw new p(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${H(r)}`);return e.writeFile?.(n,i.map(e=>`${Sl(e,pl)}\n`).join(``)),!0}),Jn(`JsonDeserialize`,1,t=>{let n=Ol(U(t,0,`JsonDeserialize`),ml);return Dl(kl(e,n,ml),ml)}),Jn(`ndJsonDeserialize`,1,t=>{let n=Ol(U(t,0,`ndJsonDeserialize`),hl);return I(kl(e,n,hl).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Dl(e,hl)))})],jl=(e,t,n,r)=>new p(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),Ml=(e,t,n)=>{if(typeof e!=`number`||e<0)throw jl(t,n,`nonnegative integer`,H(e));return e},Nl=(e,t,n,r)=>{if(!k(e)||!L(e))throw jl(t,n,r,H(e));return R(e).elements},Pl=(e,t,n,r)=>ht(Array.from({length:t},()=>ht(e.filter(()=>r.nextDouble()<n)))),Fl=(e,t)=>{let n=`RandomSetOfSubsets`,r=Ml(U(e,0,n),`first`,n),i=Ml(U(e,1,n),`second`,n),a=Nl(U(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw jl(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw jl(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Pl(a,r,a.length===0?0:i/a.length,t.getRandom())},Il=e=>[Jn(`RandomSubset`,2,t=>{let n=U(t,0,`RandomSubset`);if(typeof n!=`number`)throw jl(`first`,`RandomSubset`,`nonnegative integer`,H(n));if(n<0)throw new f(`Attempted to apply the operator overridden by the Java method\npublic static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value),\nbut it produced the following error:\n${n}`);let r=U(t,1,`RandomSubset`);if(!k(r)||!z(r)&&!L(r))throw jl(`second`,`RandomSubset`,`a finite set`,H(r));return ht(Lc(n,r,e.getRandom()))}),Jn(`RandomSetOfSubsets`,3,t=>Fl(t,e)),Jn(`TestRandomSetOfSubsets`,3,t=>I(Array.from({length:5},()=>R(Fl(t,e)).elements.length)))],Ll=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Rl=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Ll})`,zl=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Ll}) throws java.io.IOException`,Bl=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Ll})`,Vl=()=>jt([[`action`,ht([])],[`state`,ht([])]]),Hl=()=>jt([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Ul=e=>jt([[`name`,e??`UnnamedAction`],[`location`,Hl()]]),Wl=(e,t)=>{let n=e.map((e,t)=>I([t+1,jt(Object.entries(e.state))])),r=n.slice(1).map((t,r)=>I([n[r],Ul(e[r+1].action),t])),i=t?[I([n[n.length-1],Ul(t.action),n[t.start]])]:[];return jt([[`action`,ht([...r,...i])],[`state`,ht(n)]])},Gl=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Hc(e).get(t)},Kl=(e,t,n)=>{if(typeof t==`number`&&t>=0)e.registers.set(t,n);else if(typeof t==`string`&&t.startsWith(`s:`))e.namedRegisters.set(t,n);else throw new p(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${H(t)}`)},ql=e=>e.every(e=>e!==void 0),Jl=(e,t)=>jt(t.variables.map((t,n)=>[t,e[n]])),Yl=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!J(e)){if(t.variableIndex.has(r))return!0;let e=Ya(r,t);if(e&&!n.has(e)&&(n.add(e),Yl(e.body,t,n)))return!0}return Ja(e).some(e=>Yl(e,t,n))},Xl=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[W(`AssertEq`,2,t=>{let n=U(t,0,`AssertEq`),r=U(t,1,`AssertEq`),i=Be(n,r);return i||(e(H(`Assertion failed`,!0)),e(H(n,!0)),e(H(r,!0))),i}),ur(`AssertError`,2,e=>{let t=Gn(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw rr(Rl,`In computing AssertError, a non-string expression (line ${t.location.line}, col ${t.location.column}) was used as the err of an AssertError(err, exp).`);let n=dr(e,0,`AssertError`)();try{dr(e,1,`AssertError`)()}catch(e){if(e instanceof f)return e.message===n;throw e}return!1}),Jn(`TLCGetOrDefault`,2,e=>{let n=U(e,0,`TLCGetOrDefault`);return Gl(t,n)??U(e,1,`TLCGetOrDefault`)}),{...qn(`TLCGetAndSet`,4,e=>{let n=U(e,0,`TLCGetAndSet`),r=Gl(t,n)??U(e,3,`TLCGetAndSet`),i=Gn(e,1,`TLCGetAndSet`);return Kl(t,n,i.call([r,U(e,2,`TLCGetAndSet`)])),r}),isStateLevel:!0},Jn(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!ql(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw rr(zl,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return I(t.getBehavior(r).map(e=>Jl(e,n.environment)))}),Jn(`CounterExample`,0,()=>t.counterExample??Vl()),W(`ToTrace`,1,e=>{let t=U(e,0,`ToTrace`);if(!A(t)||!Be(on(t),ht([`action`,`state`])))throw new f(`The argument of ToTrace should be a CounterExample, but instead it is:\n${H(t)}`);let n=R(rn(t,`state`)).elements.map(e=>Yt(e)??[]);return I(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),W(`TLCModelValue`,1,e=>{let t=U(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new p(`The argument of ModelValue should be a string, but instead it is:\n${H(t)}`);return Le(t)}),ur(`TLCDefer`,1,()=>!0),W(`TLCNoOp`,1,e=>U(e,0,`TLCNoOp`)),ur(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!ql(r))throw rr(Bl,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||qa(dr(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new g(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),ur(`TLCCache`,2,(e,t)=>{let r=Gn(e,0,`TLCCache`),a=wn(dr(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Yl(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),W(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Sc([U(e,0,`TLCFP`)])))),Jn(`TLCEvalDefinition`,1,(e,t)=>{let n=U(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?Ya(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new p(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${H(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new p(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return X({kind:`Identifier`,name:n,location:r.location},t)})]},Zl=(e,t)=>[Jn(`_Track`,2,e=>{let n=String(U(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,U(e,0,`_Track`)===!0?r+1:r),!0}),Jn(`_Counts`,0,()=>Vc(t)),Jn(`_CheckName`,1,n=>{let r=String(U(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(H(Vc(t),!0)),!1)}),Jn(`_PrintCounts`,0,()=>(e(H(Vc(t),!0)),!0))],Ql=e=>String(e).padStart(2,`0`),$l=e=>`${e.getUTCFullYear()}.${Ql(e.getUTCMonth()+1)}.${Ql(e.getUTCDate())}.${Ql(e.getUTCHours())}${Ql(e.getUTCMinutes())}${Ql(e.getUTCSeconds())}`,eu=e=>xt([...e].map(([e,t])=>[e,I([t])])),tu=(e,t,n)=>{let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return jt([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return jt([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return jt([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Oe(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Oe($l(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Ul(void 0);case`all`:return eu(e.registers);case`all:named`:return eu(Hc(e))}if(t.startsWith(`s:`)){let n=Hc(e).get(t);if(n===void 0)throw new p(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Oe(e.properties.get(t.slice(2))??t);throw new p(`TLCGet(${t}) was undefined.`)},nu=e=>e.length===0?[[]]:e.flatMap((t,n)=>nu([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),ru=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&R(e).elements.forEach(ru),e.kind===`Function`&&e.range.forEach(ru))},iu=(t,n)=>[W(`Print`,2,e=>(t(`${me(H(U(e,0,`Print`),!0,!0))} ${me(H(U(e,1,`Print`),!0,!0))}`),U(e,1,`Print`))),W(`PrintT`,1,e=>(t(me(H(U(e,0,`PrintT`),!0,!0))),!0)),W(`Assert`,2,t=>{if(U(t,0,`Assert`)!==!0)throw new p(`The first argument of Assert evaluated to FALSE; the second argument was:\n${me(H(U(t,1,`Assert`)))}`,e.assertViolation);return!0}),W(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),W(`:>`,2,e=>xt([[U(e,0,`:>`),U(e,1,`:>`)]])),W(`@@`,2,e=>{let t=Wn(e,0,`@@`),n=Wn(e,1,`@@`);return St([...ye(t),...ye(n)])}),W(`ToString`,1,e=>Oe(H(U(e,0,`ToString`),!0))),W(`TLCEval`,1,e=>{let t=U(e,0,`TLCEval`);return ru(t),t}),W(`Permutations`,1,e=>{let t=Hn(e,0,`Permutations`);return ht(nu(t).map(e=>xt(t.map((t,n)=>[t,e[n]]))))}),qn(`SortSeq`,2,e=>{let t=Gn(e,1,`SortSeq`);return I(Un(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),Jn(`TLCGet`,1,(e,t)=>{let r=U(e,0,`TLCGet`);if(typeof r==`number`&&r>=0){let e=n.registers.get(r);if(e===void 0)throw new p(`TLCGet(${r}) was undefined.`);return e}if(typeof r!=`string`)throw new p(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${H(r)}`);return tu(n,r,t?.state)}),Jn(`TLCSet`,2,e=>{let r=U(e,0,`TLCSet`),i=U(e,1,`TLCSet`);if(typeof r==`number`&&r>=0)return n.registers.set(r,i),!0;if(r===`exit`)return i===!0&&(n.isStopped=!0),!0;if(r===`pause`)return i===!0&&(t(`Press enter to resume model checking.`),n.pause()),!0;if(typeof r==`string`&&r.startsWith(`s:`))return n.namedRegisters.set(r,i),!0;if(typeof r==`string`&&r.startsWith(`-D`))return n.properties.set(r.slice(2),H(i)),!0;throw new p(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${H(r)}`)}),Kn(`Any`,Pe),W(`RandomElement`,1,e=>zc(Bn(e,0,`RandomElement`),n.getRandom()))],au=/* @__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(`,`),ou=[[`\\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`,`≀`],[`^+`,`⁺`]],su=/* @__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(`,`),cu=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),lu=/* @__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(`.`),uu=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
89
|
+
=============================================================================`,qe=/* @__PURE__ */ new Map([[`Reals`,We],[`RealTime`,Ge],[`Toolbox`,Ke]]),Je={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:` `}},Ye=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},Xe=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ze=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Qe=e=>{let t=t=>{let n=w(e,t,Ye);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=w(e,t,Xe);if(e.startsWith(`..`,n)&&Xe(e[n+2]))return{kind:`Constant`,first:t,last:w(e,n+2,Xe)-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=Xe(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:w(e,t+1,Xe)-1,children:[]};if(Ze(n))return{kind:`Constant`,first:t,last:w(e,t,Ze)-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)},k=e=>{let t=e.length===0?void 0:Qe(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=Je[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 ee=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),h=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return ee===void 0||h===void 0?void 0:`${ee}${s.divider}\n${o}${s.dividerPad}${h}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},A=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,$e=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),j=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),M=e=>typeof e==`object`&&e.kind===`ModelValue`,et=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),tt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:A(e)?`set`:`function`,nt=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,rt={isUsed:!1},it=(e,t)=>(rt.isUsed=!0,e.writtenKeys=t,e),at=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[fr(e.domain,t)]]),ot=(e,t,n)=>it(Un(e,t),n),st=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(st);e.writtenKeys=void 0,e.range.forEach(st)}},ct=e=>e.every(e=>typeof e==`string`),lt=(e,t)=>e.length>0&&t.length>0&&ct(e)!==ct(t),ut=(e,t)=>{rt.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return lt(n,r)?dn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Dt(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:Dt(t,n);if(r!==0)return r}return 0},dt=(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=Dt(n[e],r[e]);if(t!==0)return t}return 0},ft=e=>M(e)?e.type:void 0,pt=(e,t,n)=>{let r=ft(e),i=ft(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(M(e)&&M(t)){if(r===void 0||i===void 0||r===i)return;throw new h(`Attempted to ${a} the differently-typed model values ${L(e)} and ${L(t)}`)}throw r===void 0?new h(`Attempted to ${a} the typed model value ${L(t)} and the non-model value\n${L(e)}`):new h(`Attempted to ${a}${n?``:` the`} typed model value ${L(e)} and non-model value\n${L(t)}`)},mt={ranks:Object.create(null),size:0},ht=e=>{mt.ranks=Object.create(null),mt.size=0,Ot.clear();for(let t of e)vt(t)},gt={is174:!1},_t=e=>{gt.is174=e===`1.7.4`},vt=e=>(mt.ranks[e]===void 0&&(mt.ranks[e]=mt.size++),e),yt=()=>mt.size,bt=e=>mt.ranks[vt(e)],xt=(e,t)=>{if(e===t)return 0;let n=mt.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},St=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Ct=(e,t)=>(St(e)||St(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),wt=(e,t,n)=>{if(!St(e))throw new h(`Attempted to ${n} the set ${L(N(e)?P(e):e,!0)} with the value:\n${L(t,!0)}`);if(!St(t))throw new h(`Attempted to compare overridden value ${L(e,!0)} with non-overridden value:\n${L(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new h(`Attempted to compare ${L(e,!0)} with the value\n${L(t,!0)}`)},Tt={kind:`InfiniteSet`,name:`Any`},Et=e=>{throw new h(`Attempted to compare ANY with the value\n${L(e)}`)},Dt=(e,t)=>{if(e===t)return rt.isUsed&&st(e),e===Tt?Et(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return ut(e,t);if(n===`Set`&&r===`Set`)return dt(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&&pt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return pt(e,t,!1),n===`ModelValue`?-1:1;if(e===Tt||t===Tt)return Et(e===Tt?t:e);if(A(e)&&A(t)&&Ct(e,t))return wt(e,t,`compare`);let i=A(e);if(i!==A(t))throw new h(`Attempted to compare ${tt(e)} ${L(e)} with ${tt(t)} ${L(t)}`);return i?dt(P(e),P(t)):ut(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return xt(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(pt(e,t,!1),M(e))return-1;if(M(t))return 1;throw new h(`Attempted to compare ${tt(e)} ${L(e)} with ${tt(t)} ${L(t)}`)},Ot=/* @__PURE__ */ new Map,kt=e=>{let t=Ot.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:bt(e)};return Ot.set(e,n),n},At=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),jt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),Mt={isPresent:!1},Nt=(e,t)=>(t===`lambda`&&(Mt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Pt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Ft=e=>Nt(e,`lambda`),It=/* @__PURE__ */ new WeakSet,Lt=/* @__PURE__ */ new WeakSet,Rt={isPresent:!1},zt=e=>(Rt.isPresent=!0,e),Bt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Vt=e=>{Rt.isPresent&&typeof e==`object`&&Bt.has(e.kind)&&Lt.add(e)},Ht=e=>{if((Mt.isPresent||Rt.isPresent)&&typeof e==`object`){if(e.kind===`Function`||e.kind===`Set`){if(e.isFingerprinted)return;e.isFingerprinted=!0}else{if(It.has(e))return;It.add(e)}e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Ht),e.range.forEach(Ht)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Ht):A(e)&&N(e)&&(Vt(e),P(e).elements.forEach(Ht))}},Ut=(e,t)=>{if(Vt(e),e===t)return rt.isUsed&&st(e),e!==Tt||Et(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&pt(e,t,!0),Dt(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return ut(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return dt(e,t)===0;if(M(e)||M(t))return pt(e,t,!0),M(e)&&M(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Ut(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=F(e.domain),r=F(t.domain);if(n||r)return n===r;let i=F(e.range),a=F(t.range);return i||a?i===a:Ut(e.domain,t.domain)&&Ut(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(F(e))return F(t);if(F(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]&&Ut(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return F(e)?F(t):!F(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Ut(e,t.factors[n]));let n=A(e)&&A(t)&&!(N(e)&&N(t));if(n&&Ct(e,t))return wt(e,t,`check equality of`)===0;if(n){if(!St(e)){let n=P(e);if(!St(t))return dt(n,P(t))===0}return Qr(e)===Qr(t)}return Dt(e,t)===0},Wt=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):Qr(n)===Qr(r);return n},Gt=Wt(!1),Kt=Wt(!0),qt=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Jt=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Ur(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Kt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Kt(i[e],n))return i[e]}return n.kind===`Set`?qt(n.elements,t):(qt(n.domain,t),qt(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}},Yt=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},Xt=e=>{if(!j(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:Yt(t.domain)}},Zt=e=>{if(!j(e))return;let t=I(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},Qt=(e,t)=>(pt(t,e,!1),1),$t=(e,t)=>(pt(t,e,!0),!1),en=(e,t)=>(e.type!==void 0&&pt(e,t,!1),M(t)?e.rank-t.rank:-1),tn=(e,t)=>(e.type!==void 0&&pt(e,t,!0),M(t)&&e.name===t.name),nn={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`}},rn=(e,t,n)=>{let r=nn[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)}`},an=(e,t,n)=>{let r=Xt(n);if(!r){if(M(n))return Qt(n,t);throw new h(`Attempted to compare the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>on(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return on(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new h(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${L(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},on=(e,t)=>{for(let n=0;n<e.length;n++){let r=dn(e[n],t[n]);if(r!==0)return r}return 0},sn=(e,t)=>{let n=I(e);if(e.kind===`Function`&&pr(n)!==void 0){let r=j(t)?pr(t):void 0;return r?n.range.length-r.length||on(n.range,r):an({...n,low:1},e,t)}if(Pt(e)===`record`){let r=Zt(t);if(!r){if(M(t))return Qt(t,e);throw new h(`Attempted to compare record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length-r.domain.length||on(n.domain,r.domain)||on(n.range,r.range)}return an({...n,low:Yt(n.domain)},e,t)},cn=(e,t)=>St(e)||St(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),ln=(e,t)=>{let n=et(t)?t:P(t);return{elements:P(e).elements,otherElements:P(n).elements}},un=(e,t)=>{if(cn(e,t))return Dt(e,t);if(!et(e))return un(P(e),t);if(!A(t)){if(M(t))return Qt(t,e);throw new h(`Attempted to compare the set ${L(e)} with the value:\n${L(t)}`)}let n=ln(e,t);return n.elements.length-n.otherElements.length||on(n.elements,n.otherElements)},dn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return Dt(e,t);if(M(t))return Qt(t,e);throw new h(rn(e,t,!1))}return e.kind===`ModelValue`?en(e,t):j(e)?sn(e,t):un(e,t)},fn=(e,t)=>e.every((e,n)=>gn(e,t[n])),pn=(e,t,n)=>{let r=Xt(n);if(!r){if(M(n))return $t(n,t);throw new h(`Attempted to check equality of the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&fn(e.range,r.range);let i=e.low??r.low;return i===void 0?fn(e.domain,r.domain)&&fn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new h(`Attempted to compare an integer with non-integer:\n${L(e)}.`);return e===i+t})&&fn(e.range,r.range)},mn=(e,t)=>{let n=I(e);if(e.kind===`Function`&&pr(n)!==void 0){let r=j(t)?pr(t):void 0;return r?n.range.length===r.length&&fn(n.range,r):pn({...n,low:1},e,t)}if(Pt(e)===`record`){let r=Zt(t);if(!r){if(M(t))return $t(t,e);throw new h(`Attempted to check equality of record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length===r.domain.length&&fn(n.domain,r.domain)&&fn(n.range,r.range)}return pn({...n,low:Yt(n.domain)},e,t)},hn=(e,t)=>{if(cn(e,t))return Ut(e,t);if(!et(e))return hn(P(e),t);if(!A(t)){if(M(t))return $t(t,e);throw new h(`Attempted to check equality of the set ${L(e)} with the value:\n${L(t)}`)}let n=ln(e,t);return n.elements.length===n.otherElements.length&&fn(n.elements,n.otherElements)},gn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(M(t))return $t(t,e);throw new h(rn(e,t,!0))}return e.kind===`ModelValue`?tn(e,t):j(e)?mn(e,t):hn(e,t)},_n=e=>{let t=[];for(let n of e){let e=yn(n,t);e.isFound||t.splice(e.index,0,n)}return t},vn=(e,t)=>{let n=hr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},yn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=vn(e,()=>dn(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},bn=(e,t)=>t.some(t=>vn(t,()=>gn(t,e))),xn=/* @__PURE__ */ new WeakSet,Sn=e=>{typeof e==`object`&&(e.kind===`Set`&&(xn.add(e),e.elements.forEach(Sn)),e.kind===`Function`&&(e.domain.forEach(Sn),e.range.forEach(Sn)))},Cn=(e,t)=>gr(Ut,gn,e,t),wn=e=>{for(let t=1;t<e.length;t++)if(Dt(e[t-1],e[t])>=0)return!1;return!0},Tn=e=>{for(let t=1;t<e.length;t++)Vt(e[t]);if(e.length<2||wn(e))return At(e);let t=[...e].sort(Dt),n=[t[0]];for(let e=1;e<t.length;e++)Dt(n[n.length-1],t[e])!==0&&n.push(t[e]);return At(n)},En=e=>gr(Tn,e=>({kind:`MixedSet`,elements:e}),e,void 0),Dn=At([]),On=(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&&Dt(r[a],t)<0;)a++;a<r.length&&Dt(r[a],t)===0||i.push(t)}return i.length===n.length?e:At(i)},kn=(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&&Dt(r[a],t)<0;)a++;a<r.length&&Dt(r[a],t)===0&&i.push(t)}return i.length===n.length?e:At(i)},An=(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=Dt(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=At(i);if(e.hash!==0&&e.hash!==Rr){let t=e.hash,n=0;for(;n<a.length;n++){let e=Ur(a[n]);if(e===Rr)break;t=t+Ir(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+qr(a[e])|0;c.fingerprint=t}return c},jn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Dt(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Dt(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return jt(n,r)},Mn=e=>{let t=jn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:it(t,e.map(e=>e[0]))},Nn=[],Pn=[],Fn=/* @__PURE__ */ new WeakMap,In=e=>{let t=Nn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Nn[e]=n,n},Ln=e=>{if(lr(e),e.low===1&&e.high>=1)return In(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Rn=e=>e.length>0&&(e===Nn[e.length]||Fn.has(e)),zn=e=>{let t=P(e).elements;return Rn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Bn=e=>{let t=Pn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Pn[e]=n,n},Vn=e=>Nt(jt(In(e.length),e),`tuple`),Hn=e=>Nt(jn(e),`record`),Un=(e,t)=>Nt(jt(e,t),`record`),Wn=e=>A(e)&&!St(e),Gn=(e,t=!1)=>`UNION(${L(e.base,t)})`,Kn=(e,t=e=>P(e).elements)=>{if(!Wn(e.base))throw new h(`Attempted to enumerate the nonenumerable set:\n${Gn(e)}`);return t(e.base)},qn=(e,t,n)=>{if(Wn(e))return e;throw new h(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(e)}\nwhen enumerating:\n${Gn(n)}`)},N=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 N(e.base);case`FunctionSet`:return N(e.domain)&&N(e.range)||Jn(e.domain)===!0||Jn(e)===!0;case`RecordSet`:return e.sets.every(N)||Jn(e)===!0;case`ProductSet`:return e.factors.every(N)||Jn(e)===!0;case`Union`:return N(e.base)&&nr(e.base).every(N);case`SetOperation`:return e.operator===`\\cup`?N(e.left)&&N(e.right):e.operator===`\\cap`?N(e.left)||N(e.right):N(e.left);default:return!1}},Jn=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=Jn(e.domain);return t===void 0?void 0:!t&&Jn(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Jn(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return N(e)?P(e).elements.length===0:void 0;default:return}},Yn=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},Xn=(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},Zn=e=>{if(typeof e!=`object`||e.kind!==`Subset`||St(e.base))return;let t=P(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:Xn(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return At(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},Qn=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(At(r.map(t=>e[t])));while(Xn(r,e.length))}return t},$n=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(St(a))throw new h(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},er=(e,t=e=>P(e).elements)=>{if(typeof e!=`object`)throw new h(`Expected a set but found ${L(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return _n(e.elements);case`Interval`:{let t=Ln(e);return t!==Nn[t.length]&&Fn.set(t,e),t}case`Subset`:{if(lr(e.base)===0)return Qn([]);if(!A(e.base))throw new h(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${k(L(e.base))}`);let t=P(e.base).elements;if(t.length>30)throw new h(cr(e));return Qn(t)}case`FunctionSet`:{if(!gt.is174&&F(e))return[];if(St(e.domain))throw new h(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(e.domain)}\ncannot be enumerated.`);let n=zn(e.domain);if((n.length>0||gt.is174)&&St(e.range))throw new h(`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 Yn(n.map(()=>r)).map(e=>jt(n,e))}case`RecordSet`:{if(!gt.is174&&F(e))return[];let n=$n(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 Yn(n).map(t=>Hn(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!gt.is174&&F(e))return[];let n=$n(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 Yn(n).map(Vn)}case`FilteredSet`:if(!A(e.base)||St(e.base))throw new h(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(e.base)}\nis not enumerable`);return P(e.base).elements.filter(e.test);case`Union`:{let t=Kn(e).flatMap((t,n)=>P(qn(t,n,e)).elements);return P(En(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Wn(e.left)||!Wn(e.right)))throw new h(`Attempted to enumerate S \\cup T when S:\n${L(e.left)}\nand T:\n${L(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Wn(e.left)&&!Wn(e.right))throw new h(`Attempted to enumerate S \\cap T when neither S:\n${L(e.left)}\nnor T:\n${L(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Wn(e.left))throw new h(`Attempted to enumerate S \\ T when S:\n${L(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return An(P(e.left),P(e.right)).elements;let t=e.operator===`\\`||Wn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return P(n).elements.filter(t=>_r(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new h(`Attempted to enumerate the non-enumerable set ${L(e)}`);default:throw new h(`Expected a set but found ${L(e)}`)}},tr=/* @__PURE__ */ new WeakMap,P=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return At(er(e));let t=typeof e==`object`?tr.get(e):void 0;if(t)return t;let n=hr.sets;n?.push(e);let r=er(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`)?At(r):Tn(r);return typeof e==`object`&&tr.set(e,i),i},nr=e=>{if(typeof e!=`object`||Lt.has(e))return P(e).elements;let t=hr.sets;t?.push(e);let n=or(e);return t?.pop(),n},rr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,ir=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(ir);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(ir)&&e.range.every(ir);case`SetOperation`:return e.operator!==`\\cup`&&ir(e.left)&&ir(e.right);case`FilteredSet`:return ir(e.base);case`ProductSet`:return e.factors.every(ir);default:return!1}},ar=e=>typeof e!=`object`||Lt.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?ar(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||ar(e.left)||ar(e.right):rr(e)?.some(ar)??!1,or=e=>{if(e.kind===`Union`)return Kn(e,nr).flatMap((t,n)=>nr(qn(t,n,e)));if(e.kind===`FilteredSet`&&!St(e.base))return nr(e.base).filter(e.test);if(rr(e)?.some(ar))return er(e,nr);if(e.kind!==`SetOperation`)return P(e).elements;if(e.operator===`\\cup`)return!Wn(e.left)||!Wn(e.right)?P(e).elements:[...nr(e.left),...nr(e.right)];let t=e.operator===`\\`||Wn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Wn(n)?nr(n).filter(t=>_r(t,r)===(e.operator===`\\cap`)):P(e).elements},F=e=>{if(typeof e!=`object`||!A(e))throw new h(`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 h(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(F);case`RecordSet`:return e.sets.some(F);case`FunctionSet`:return!F(e.domain)&&F(e.range);case`Union`:return Kn(e).every((t,n)=>F(qn(t,n,e)));default:return P(e).elements.length===0}},sr=(e,t,n)=>e.reduce((e,r)=>{let i=e*lr(r,t);if(i>2147483647)throw new h(n());return i},1),cr=e=>`Overflow when computing the number of elements in:\n${L(e)}`,lr=(e,t)=>{if(typeof e!=`object`)throw new h(`Attempted to compute the number of elements in the ${tt(e)} ${L(e)}.`);switch(e.kind){case`ModelValue`:throw new h(`Attempted to compute the number of elements in the model value ${L(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return lr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new h(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new h(`Attempted to compute the number of elements in the overridden value ${L(e)}.`);case`Subset`:{let n=lr(e.base,t);if(n>=31)throw new h(cr(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(F(e.domain))return 1;if(F(e.range))return 0;if(lr(e.range,t)===1)return 1}let n=lr(e.domain,t),r=lr(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new h(cr(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&F(e)?0:sr(e.sets,t,()=>cr(e));case`ProductSet`:return t!==`1.7.4`&&F(e)?0:sr(e.factors,t,()=>`Overflow when computing the number of elements in ${L(e)}`);default:return Vt(e),P(e).elements.length}},ur=e=>`Attempted to check if the set ${L(e)}is finite.`,dr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new h(`Attempted to check if the ${tt(e)} ${L(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new h(`Attempted to check if the function:\n${L(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return dr(e.base)&&F(e.base);case`Subset`:return dr(e.base);case`FunctionSet`:{let t=dr(e.domain);if(t&&F(e.domain))return!0;let n=dr(e.range);return n&&F(e.range)?!0:n&&(t||lr(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!dr(e))n.isAllFinite=!1;else if(F(e))return!0;return n.isAllFinite}case`Union`:if(!Wn(e.base))throw new h(`Attempted to check if the nonenumerable set:\n${Gn(e)}\nis a finite set.`);return P(e.base).elements.every(dr);case`SetOperation`:if(e.operator===`\\cup`)return dr(e.left)&&dr(e.right);if(e.operator===`\\cap`){if(!dr(e.left)&&!dr(e.right))throw new h(ur(e));return!0}if(dr(e.left))return!0;if(!dr(e.right))throw new h(ur(e));return!1;case`FilteredSet`:if(!dr(e.base))throw new h(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(e.base)}\nis finite.`);return!0}},fr=(e,t,n=Dt)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},pr=e=>{if(typeof e!=`object`||!j(e))return;let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},mr=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!j(t))return`${n} ${tt(t)} ${L(t)}`;let r=Pt(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)}`},hr={sets:void 0},gr=(e,t,n,r)=>{let i=hr.sets,a=hr.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof h))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)}},_r=(e,t)=>{let n=hr.sets;if(n===void 0)return br(e,t);n.push(t);let r=br(e,t);return n.pop(),r},vr=(e,t)=>fr(t.elements,e)!==-1,yr=(e,t)=>xn.has(t)?yn(e,t.elements).isFound:bn(e,t.elements),br=(e,t)=>{if(!A(t))throw new h(mr(e,t));switch(t.kind){case`Set`:return Vt(e),gr(vr,yr,e,t);case`MixedSet`:return bn(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!M(e))throw new h(`Attempted to check if the value:\n${L(e)}\nis in the integer interval ${L(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(M(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new h(`Attempted to check if the value:\n${L(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!A(e)||St(e))throw new h(`Attempted to check if the non-enumerable value\n${k(L(e))}\nis element of\n${k(L(t))}`);return P(e).elements.every(e=>_r(e,t.base));case`FunctionSet`:{if(!j(e)){if(M(e))return!1;throw new h(`Attempted to check if \n${L(e)}\nwhich is not a TLC function value, is in the set of functions:\n${k(L(t))}`)}let n=I(e),r=Yt(n.domain);return(r===void 0?Cn(t.domain,At(n.domain)):Cn({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>_r(e,t.range))}case`RecordSet`:{let n=j(e)?I(e):void 0;if(!n||!ct(n.domain)){if(M(e))return!1;throw new h(`Attempted to check if non-record\n${L(e)}\nis in the set of records:\n${L(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=fr(n.domain,e);return i!==-1&&_r(n.range[i],t.sets[r])})}case`ProductSet`:{let n=j(e)?pr(e):void 0;if(n===void 0){if(j(e)&&I(e).domain.every(e=>typeof e==`number`)||M(e))return!1;throw new h(`Attempted to check if non-tuple\n${L(e)}\nis in the set of tuples:\n${L(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>_r(e,t.factors[n]))}case`FilteredSet`:return _r(e,t.base)&&t.test(e);case`Union`:if(!Wn(t.base))throw new h(`Attempted to check if:\n ${L(e)}\nis an element of the non-enumerable set:\n ${Gn(t)}`);return P(t.base).elements.some(t=>_r(e,t));case`SetOperation`:return t.operator===`\\cup`?_r(e,t.left)||_r(e,t.right):_r(e,t.left)&&_r(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=pr(e);if(n===void 0){if(M(e))return!1;throw new h(`Attempted to check if the value:\n${k(L(e))}\nis an element of ${k(L(t))}.`)}return n.every(e=>_r(e,t.base))}default:throw new h(mr(e,t))}},xr=(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?_r(e,n):e.range.every((e,r)=>xr(e,t.range[r],n.range)),I=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){N(e.domain)||lr(e.domain);let t=zn(e.domain);return Nt(jt(t,t.map(t=>e.apply(t))),Pt(e))}throw new h(`Expected a function but found ${L(e)}`)},Sr=(e,t,n)=>{let r=k(L(e)),i=k(L(t)),a=n===`1.7.4`;switch(Pt(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.`}},Cr=(e,t)=>{if(!gt.is174)return Sr(e,t);let n=k(L(t));return Pt(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},wr=(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},Tr=e=>new h(`Attempted to apply function with integer domain to the non-integer argument ${k(L(e))}`),Er=(e,t,n)=>{throw gt.is174||e.length<32?e.forEach(e=>gn(e,t)):fr(e,t,dn),n},Dr=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Pt(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new h(n(e,t));if(a===void 0&&!gt.is174&&Rn(r))throw Tr(t)}let i=wr(r,t);return i===-1?gr(fr,Er,r,t):i},Or=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!_r(t,e.domain))throw new h(Pt(e)===`lambda`?Sr(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 h(`Attempted to apply ${L(e)}, which is not a function`);let r=n??Sr,i=Dr(e,t,r);if(i===-1)throw new h(r(e,t));return e.range[i]},kr=e=>Rn(e)?Fn.get(e)??Bn(e.length):void 0,Ar=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e).domain;return kr(t)??At(t)},jr=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!N(e.domain))){if(!_r(t,e.domain))return e;let r=n(e.apply(t));return Nt({kind:`LazyFunction`,domain:e.domain,apply:n=>Cn(t,n)?r:e.apply(n),source:e.source},Pt(e))}if(!j(e))throw new h(`Attempted to apply EXCEPT construct to the value ${k(L(e))}.`);let i=I(e),a=Dr(i,t,Cr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Nt(jt(i.domain,o),Pt(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Rr){let e=Ur(c);if(e!==Rr){let t=Ur(i.domain[a]);l.hash=s===c?i.hash:i.hash-Lr(t,Ur(s))+Lr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Jr(e,s)+Jr(e,c)|0}return l},Mr=/* @__PURE__ */ new WeakMap,Nr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Pr=(e,t)=>Math.imul(e^t,16777619),Fr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Nr(t)},Ir=e=>Nr(e+2654435769|0),Lr=(e,t)=>Nr(Math.imul(e,668265261)+t|0),Rr=795548749,zr=e=>{if(e.kind===`ModelValue`)return Nr(Pr(Fr(e.name),109));if(A(e)){if(!N(e))return Rr;let t=P(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Ur(t[e]);if(r===Rr)return Rr;n=n+Ir(r)|0}return n}if(e.kind===`LazyFunction`&&!N(e.domain))return Rr;let t=I(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=Ur(t.domain[e]),i=Ur(t.range[e]);if(r===Rr||i===Rr)return Rr;n=n+Lr(r,i)|0}return n},Br=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new h(`TLC has found a state in which the value of a variable contains ${L(e)}`);if(A(e)){P(e).elements.forEach(Br);return}let t=I(e);t.domain.forEach(Br),t.range.forEach(Br)},Vr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Ur(e)===Rr&&Br(e);return}catch(e){if(!(e instanceof h))throw e;return e}},Hr=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[]}},Ur=e=>{if(typeof e==`number`)return Nr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Fr(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=zr(e)),e.hash;let t=Mr.get(e);if(t!==void 0)return t;let n=zr(e);return Mr.set(e,n),n},Wr=/* @__PURE__ */ new WeakMap,Gr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Kr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Gr(t)},qr=e=>Gr(Xr(e)+2135587861|0),Jr=(e,t)=>Gr(Math.imul(Xr(e),374761393)+Xr(t)|0),Yr=e=>{if(e.kind===`ModelValue`)return Gr(Kr(e.name)^60);if(A(e)){if(!N(e))return Kr(Qr(e));let t=P(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+qr(t[e])|0;return n}let t=I(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Jr(t.domain[e],t.range[e])|0;return n},Xr=e=>{if(typeof e==`number`)return Gr(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return Kr(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Yr(e)),e.fingerprint;let t=Wr.get(e);if(t!==void 0)return t;let n=Yr(e);return Wr.set(e,n),n},Zr=/* @__PURE__ */ new WeakMap,Qr=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=Zr.get(e);if(t!==void 0)return t;let n=$r(e);return Zr.set(e,n),n},$r=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${Qr(e.base)}>`;if(e.kind===`FilteredSet`&&!N(e))throw new h(`Attempted to compare the non-enumerable set ${L(e)} with another value`);if(A(e))return N(e)?`{${P(e).elements.map(Qr).join(`,`)}}`:`<${e.kind} ${L(e)}>`;let t=I(e);return`(${t.domain.map((e,n)=>`${Qr(e)}:${Qr(t.range[n])}`).join(`,`)})`},ei=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,ti=e=>e.reduce((e,t)=>e===0?0:e*lr(t),1),ni=e=>{if(e.kind===`Subset`)return lr(e.base)<=6?P(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return P(e);if(e.kind===`FunctionSet`&&N(e.domain)&&lr(e.domain)===0)return At([jt([],[])]);let t=e.kind===`FunctionSet`?lr(e.range)**lr(e.domain):ti(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Dn:t<=1999?P(e):void 0},ri=(e,t)=>{if(t)return ni(e);if(N(e))try{return ni(e)}catch(e){if(e instanceof h)return;throw e}},ii=(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 Gn(e,t)}},ai=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),oi=e=>{if(N(e.domain))try{return I(e)}catch(e){if(e instanceof h)return;throw e}},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 ei(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(P(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=ri(e,t);return n?r(n):ii(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?oi(e):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&>.is174&&Pt(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&Pt(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Pt(e)===`record`||i.domain.every(e=>typeof e==`string`&&ai(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):at(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},si=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${k(L(n))}\n`).join(``)},ci=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),li=(e,t)=>ci.has(e)?new h(t):new p(t),ui=(e,t,n,r)=>new p(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${L(r)}`),di=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||di(r))throw li(n,`${n} expects a value as argument ${t+1}`);return r},fi=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`number`)throw li(n,`${n} expects an integer but received ${L(r)}`);return r},pi=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw li(n,`${n} expects a boolean but received ${L(r)}`);return r},mi=(e,t,n)=>{let r=R(e,t,n);if(!A(r))throw li(n,`${n} expects a set but received ${L(r)}`);return r},hi=(e,t,n)=>{let r=mi(e,t,n);if(!N(r))throw li(n,`${n} cannot enumerate the non-enumerable set ${L(r)}`);return r},gi=(e,t,n)=>P(hi(e,t,n)).elements,_i=(e,t,n)=>{let r=R(e,t,n),i=pr(r);if(!i)throw li(n,`${n} expects a sequence but received ${L(r)}`);return i},vi=(e,t,n)=>{let r=R(e,t,n);if(!j(r))throw li(n,`${n} expects a function but received ${L(r)}`);return I(r)},yi=(e,t,n)=>{let r=e[t];if(r===void 0||!di(r))throw li(n,`${n} expects an operator as argument ${t+1}`);return r},bi=(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}),xi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Si=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Ci=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),wi=e=>e>2147483647||e<-2147483648,Ti=e=>new p(`Overflow when computing ${e}`),Ei={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`},Di={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Oi={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`},ki={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ai=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Di[e.operator];if(e.kind!==`Function`)return Ei[e.kind];let t=Pt(e);return t===void 0?`FcnRcdValue`:ki[t]},ji=e=>Oi[Ai(e)],Mi=(e,t)=>new h(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Ni=(e,t)=>{let n=n=>(...r)=>{let i=hr.sets?.length??0;try{return n(...r)}catch(n){throw n instanceof h&&(e.isLazy===!0||!(n instanceof p))?(hr.sets&&(hr.sets.length=i),Mi(t,n.message)):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Pi=(e,t)=>{if(typeof e!=`number`)throw Mi(t,`Cannot cast tlc2.value.impl.${Ai(e)} to tlc2.value.impl.IntValue`);return e},Fi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Ii=(e,t,n,r)=>{let i=Fi(e,n,`IntValue`,2);return Ci(t,(e,n)=>{let a=Pi(e,i),o=Pi(n,i),s=r(a,o);if(wi(s))throw Ti(`${a}${t}${o}`);return s})},Li=(e,t,n)=>{if(typeof e!=`number`)throw new p(`The ${t} argument of ${n} should be an integer, but instead it is:\n${L(e)}`);return e},Ri=(e,t,n=e)=>Ci(e,(e,r)=>t(Li(e,`first`,n),Li(r,`second`,n))),zi=(e,t,n)=>({...Si(e,t,n),isLazy:!0}),Bi=(e,t,n)=>{let r=yi(e,t,n);return()=>r.call([])},Vi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Hi=()=>({bool:wl,condition:(e,t)=>{if(typeof e!=`boolean`)throw sl(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw cl(t,n,e);return e},apply:Or,expectFunction:xl,tuple:Vn,set:En,record:Un,writtenRecord:ot,equal:Ut,enumerate:Fl,unassigned:(e,t)=>{throw hl(e,t)},primeOutsideAction:e=>{throw _l(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:Sl,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>yl(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Ui={value:void 0},Wi=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Gi=e=>`local${e.counter++}`,Ki=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Ue(e).forEach(e=>Ki(e,t)),t),qi=(e,t,n)=>{let r=Wi(e,V(t,e.environment)),i=Ki(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Wi(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Ji=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>Gi(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Qi(e,t.set,s)}, ${Wi(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=Gi(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Qi(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Gi(e),a=Gi(e),o=Gi(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; let applied; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},Yi=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Qi(e,r[0],n)}, "the left side of =>") ? bool(${Qi(e,r[1],n)}, "the right side of =>") : true)`;if(O(t))return qi(e,t,n);let i=su(t.operator,e.environment);if(i?.kind!==`Builtin`)return qi(e,t,n);if(i.name===`DOMAIN`)return`${Wi(e,dl(t))}(${Qi(e,r[0],n)})`;if(i.name===`TLCEval`)return qi(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Wi(e,fl(t,i))}(${Qi(e,r[0],n)}, ${Qi(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&id(r[0],a))return`${Wi(e,i.evaluateUnary)}(${Qi(e,r[0],n)})`;let o=r.length===2&&id(r[0],a)&&id(r[1],a);return i.evaluateBinary&&o?`${Wi(e,i.evaluateBinary)}(${Qi(e,r[0],n)}, ${Qi(e,r[1],n)})`:qi(e,t,n)},Xi=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(O(e))return!1;let r=yu(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Xi(e.expression,t,n);case`FieldAccess`:return Xi(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Xi(e,t,n));default:return!1}},Zi=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Zi(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Zi);default:return!1}},Qi=(e,t,n)=>{let r=(t,r=n)=>Qi(e,t,r);if(Wu(t)&&zu(t,e.environment))return qi(e,t,n);switch(t.kind){case`Number`:return nt(t.value)?String(t.value):qi(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(O(t))return qi(e,t,n);let i=yu(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Wi(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Wi(e,i.value):qi(e,t,n)}case`Apply`:return Yi(e,t,n);case`And`:case`Or`:{let n=Wi(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)}, ${Wi(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Dd(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Xi(t.function,n,e.environment)?r(t.function):Zi(t.function)?r(t.function,i):qi(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Wi(e,t)}))`,o=ul(e.environment.runtime.version),s=o?`, ${Wi(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`${Wi(e,ll(t))}(${r(t.record)})`;case`Record`:{let i=jd(t.fields);if(Md(i))return qi(e,t,n);let a=Wi(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}, ${Wi(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=Wi(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Ji(e,t,n):qi(e,t,n);default:return qi(e,t,n)}},$i=(e,t)=>{if(!Vi.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=Qi(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(`
|
|
90
|
+
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;Ui.value??=Hi();let o=Ui.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ea={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},ta={none:0,error:1,warning:3,state:4},na={0:``,1:`Error: `,3:`Warning: `,4:`State `},ra=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===ta.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
|
|
91
|
+
(Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${na[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},ia=`The configuration file did not specify the initial state predicate.
|
|
92
|
+
Can also be caused by trying to run TLC on a specification from
|
|
93
|
+
a module imported with a parameterized INSTANCE statement.`,aa=[[1005,_,!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:
|
|
94
|
+
%1%`,!0],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
95
|
+
%1%,
|
|
96
|
+
but it produced the following error:
|
|
97
|
+
%2%`,!1],[2148,`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable %1% occurring in the state formula v.
|
|
98
|
+
`,!1],[2155,`Attempted to compare %1% with the value
|
|
99
|
+
%2%`,!0],[2158,`Attempted to check if the value:
|
|
100
|
+
%1%
|
|
101
|
+
is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
|
|
102
|
+
the following value:
|
|
103
|
+
%1%`,!0],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
|
|
104
|
+
%4%`,!0],[2176,`Applying %1% to the following value,
|
|
105
|
+
which is not %2%:
|
|
106
|
+
%3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
|
|
107
|
+
element is not a bag:
|
|
108
|
+
%1%`,!0],[2178,`Overflow when computing %1%`,!1],[2179,`The second argument of \\div is 0.`,!0],[2180,`0^0 is undefined.`,!0],[2181,`Attempted to compute cardinality of the value
|
|
109
|
+
%1%`,!0],[2182,`Evaluating an expression of the form %1% when s is not a %2%:
|
|
110
|
+
%3%`,!0],[2183,`The %1% argument of %2% must be in the domain of its %3% argument:
|
|
111
|
+
%4%
|
|
112
|
+
, but instead it is
|
|
113
|
+
%5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
|
|
114
|
+
on the right-hand side of a <- after already appearing on the
|
|
115
|
+
left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
|
|
116
|
+
is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,ia,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
|
|
117
|
+
%1%`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
|
|
118
|
+
%1%`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
|
|
119
|
+
but instead found %3%.
|
|
120
|
+
%4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
|
|
121
|
+
but didn't find one.
|
|
122
|
+
%3%`,!1],[2260,`In computing ENABLED, TLC encountered a temporal formula (%1%).
|
|
123
|
+
%2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
|
|
124
|
+
%2%`,!1],[2265,`TLC can't handle a number this big.
|
|
125
|
+
%1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
|
|
126
|
+
%4%`,!0],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
|
|
127
|
+
%2%`,!1],[2281,`The configuration file substitutes constant %1% with non-constant %2%%3%`,!1],[2283,`The argument of %1% should be a %2%, but instead it is:
|
|
128
|
+
%3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
|
|
129
|
+
The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
|
|
130
|
+
The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configuration file at line %1%
|
|
131
|
+
Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
|
|
132
|
+
It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
|
|
133
|
+
%1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
|
|
134
|
+
`,!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]],oa={value:void 0},sa=()=>oa.value??=aa.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),ca=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,la=e=>ca.test(e)?void 0:sa().find(t=>t.pattern.test(e))?.message,ua=e=>e instanceof p||la(e.message)?.isEvalException===!0,da=/* @__PURE__ */ new Map([[1e3,`
|
|
135
|
+
: `],[2105,`failed.
|
|
136
|
+
`],[2154,`but it produced the following error:
|
|
137
|
+
`],[2213,`:
|
|
138
|
+
`],[2281,` - specifically: `]]),fa=(e,t,n)=>{let r=n?da.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)}${pa(t.slice(a),n)}`},pa=(e,t)=>{let n=t?la(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${ta.none} @!@!@\n${fa(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},ma=e=>String(e).padStart(2,`0`),ha=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 ${ma(r%24)}h`:e>36e5?`${ma(r%24)}h ${ma(n)}min`:e>6e4?`${ma(n)}min ${ma(t)}s`:`${ma(t)}s`},ga=e=>`${e.getFullYear()}-${ma(e.getMonth()+1)}-${ma(e.getDate())} ${ma(e.getHours())}:${ma(e.getMinutes())}:${ma(e.getSeconds())}`,_a=/* @__PURE__ */ new WeakMap,va=(t,n,r)=>{if(!(t instanceof h))return t;let a=i(new h(`${r}\n${t.message}`,t),e(t));return _a.set(a,{code:n,headline:r,inner:t}),a},ya=e=>_a.has(e),ba=l.slice(0,l.indexOf(`
|
|
139
|
+
`)),xa=`${l}tlc2.tool.EvalException: `,Sa=`${l}util.Assert$TLCRuntimeException: `,Ca=e=>ua(e)?xa:Sa,wa=e=>{try{return e()}catch(e){throw e instanceof h?ua(e)?new h(`${c}${e.message}`):la(e.message)?e:new h(`${l}${e.message}`):e}},Ta=[xa,Sa,l,c],Ea=(e,t)=>{let n=_a.get(e);if(n)return`${n.headline}\n${Ea(n.inner,t)}`;let r=e.message,i=Ta.find(e=>r.startsWith(e))??``;return`${i}${pa(r.slice(i.length),t)}`},Da=(e,t)=>{let n=_a.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Ea(e,!0)};if(t&&ua(e))return{code:la(r)?.code??ea.general,message:r,toolMessage:r};let i=t&&!r.startsWith(ba)?l:``;return{code:ea.general,message:`${i}${r}`,toolMessage:`${i}${Ea(e,!0)}`}},Oa=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),ka=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Aa=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Oa.has(e.kind))return!1;let a=ka(e);if(a!==void 0&&!O(e)&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&Ou(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return Ue(e).every(i)};return i(e)?[...n]:void 0},ja={kind:`Local`},Ma=/* @__PURE__ */ new WeakSet,Na=/* @__PURE__ */ new WeakMap,Pa=/* @__PURE__ */ new WeakMap,Fa=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Ia=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),La=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Ra=e=>e.kind===`Operator`?e.params.length:0,za=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ba=e=>e.name.includes(`!`),Va=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Ha=(e,t,n)=>{let r=t.bindings.get(e);return r&&La(r.position,t.location)&&(!n||La(r.position,n.start))?r:void 0},Ua=(e,t)=>e!==void 0&&t!==void 0&&f(e)===f(t),Wa=(e,t,n,r)=>{if(t===void 0)return!0;if(Ua(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=f(i),o=t.range&&f(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},Ga=(e,t,n,r)=>Wa(t,Va(e,t)??Ha(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Ka=(e,t,n)=>{Wa(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},qa=(e,t,n,r)=>t.reduce((e,t,i)=>Ga(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Ja=(e,t,n)=>t.reduce((e,t)=>Ga(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ya=e=>e.kind===`Name`?[e.name]:e.names,Xa=e=>e.flatMap(e=>Ya(e.pattern)),Za=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||La(n.location,t.location))?n:void 0},Qa=(e,t)=>{let n=Za(e,t);return n?{key:t.getKey(n),arity:Ra(n),params:za(n),kind:`Definition`}:t.imported.get(e)},$a=(e,t,n)=>Va(t,e)??Qa(e,n),eo=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),to=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:eo(e.location,e.spelling??t)},no=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return La(e.location,e.args[0].location)?`prefix`:`postfix`}},ro=e=>!/^[\p{L}\d_]/u.test(e),io=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),ao=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,oo=(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])}})},so=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?oo(e.name,[],void 0):oo(e.operator,e.args,e.argumentCounts),co=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),lo=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Xa(e.bounds),body:e.body,sets:co(e.bounds)};case`SetMap`:return{names:Xa(e.bounds),body:e.expression,sets:co(e.bounds)};case`SetFilter`:return{names:Ya(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ya(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}},uo=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}},fo=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,po=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),mo=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?mo(e.body,t):Ue(e).reduce((e,n)=>e??mo(n,t),void 0)},ho=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??ho(i,t,n||po(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&mo(e.set,t):mo(e,t)},go=e=>e.kind===`Label`?go(e.body):e,_o=e=>typeof e==`number`?`argument selector ${e}`:e,vo=`within the scope of a declaration
|
|
140
|
+
from outside that declaration's scope.`,yo=(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:f(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`&&go(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:ho(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?mo(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&po(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${vo}`);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=_o(n.operand);if(l.isSufficesOpen){if(ao(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=go(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?$a(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=lo(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:uo(e);if(!c)return;let f=ao(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=ao(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(po(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${vo}`);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.`))},bo=(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:f(e.location.range),message:n}),!0)},xo=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=f(r),a=e.params.filter((r,i)=>{let a=Va(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:f(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)},So=(e,t,n,r)=>{if(!fo(e))return!1;let i=so(e),a=i[0],o=i.length>1&&a.kind===`Name`?Va(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&yo(e,i,o,t,n,r),o!==void 0},Co=(e,t,n,r)=>{let i=e.location;if(No(e,n,r))return;let a=Pa.get(e);if(a!==void 0)return a;if(Fa(t))return e.kind===`Apply`?e.args.length:0;let o=Va(n,t);if(o?.isNonFact){r.errors.push({location:f(to(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(So(e,n,r,!1)||io(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=ja),o)return o.arity;let s=Qa(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Pa.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(Va(n,c)!==void 0||Qa(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=f(e.kind===`Apply`&&l===`-.`?eo(i,`-`):to(e,t));if(!ro(t)||io(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=no(e);d&&i.range&&r.errors.push({location:f(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},wo=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>qa(e,Ya(t.pattern),t.pattern.ranges,n),t)),To=(e,t)=>e.kind===`Identifier`&&e.name===t&&O(e)||Ue(e).some(e=>To(e,t)),Eo=(e,t)=>{e.kind===`FunctionConstruction`&&To(e.body,t)&&(e.isRecursive=!0),Ue(e).forEach(e=>Eo(e,t))},Do=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Xa(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:f(o),message:e})},c=e.kind===`Function`?wo(e.bounds,t,i):Ja(t,e.params,i),l=Va(c,a)??Ha(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`?(B(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Eo(e.body,a),e.isSelfReferential=To(e.body,a)):B(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:Wa(a,Va(t,a)??Ha(a,i,o),{kind:`Definition`,arity:Ra(e),range:o},i)},Oo=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Va(e,t.name)?.isPending)return e;let n={name:t.name,arity:Ra(t),params:za(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)=>zo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Fa(t.name)?e:s(e,e=>!La(t.location,e.location)),o={name:t.name,arity:Ra(t),kind:`Definition`,range:t.location.range,parent:a};if(Ba(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Fa(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Do(t,a,u,i)?{...o,params:za(t)}:a},a),()=>!0)},ko=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Va(t,r)??Ha(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Ao=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=ko(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:f(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},jo=(e,t,n)=>{if(Ao(e,t,n))return;let r=e.operator,i=$a(r,t,n),a=Co(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:f(e.argumentsRange??to(e,r)),message:`The operator ${r} requires ${a-(ko(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Mo(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:f(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=Co(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else B(i,t,n);return!0}if(i.kind===`Lambda`){B(i,t,n);let o=i.params.length===c;return!o&&Ma.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)??to(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 B(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=$a(u,t,n)?.params??[],f=Co(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(to(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.`)})},Mo=(e,t,n)=>{e.kind===`Identifier`?Co(e,e.name,t,n):B(e,t,n)},No=(e,t,n)=>{let r=Na.get(e);return r?(r.args.forEach(e=>Mo(e,t,n)),n.errors.push(r.error),!0):!1},B=(e,t,n)=>{if(Ma.has(e)&&!n.isGenerated){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`:case`ExceptAt`:return;case`Identifier`:{if(Ao(e,t,n))return;let r=e.name,i=Co(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:f(to(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Co(e,e.operator,t,n);return;case`Apply`:jo(e,t,n);return;case`Lambda`:B(e.body,qa(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`: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,Oo(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(e.body,wo(e.bounds,t,n),i(Xa(e.bounds)));return;case`UnboundedQuantifier`:B(e.body,qa(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&B(e.set,t,n),B(e.body,qa(t,Ya(e.pattern),e.pattern.ranges,n),i(Ya(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:B(e.predicate,wo([e.bound],t,n),i(Ya(e.bound.pattern)));return;case`SetMap`:B(e.expression,wo(e.bounds,t,n),i(Xa(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:f(r.location.range??eo(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(bo(e,n))return;B(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),xo(e,t,n);return;case`Subexpression`:if(No(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Mo(e,t,n)),So(e,t,n,!1)}},Po=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Ao(e,t,n)||So(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&Va(t,r)?.isNonFact?n.errors.push({location:f(to(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||B(e,t,n)}),Fo=(e,t,n)=>(e.set&&B(e.set,t,n),Ga(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Io=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Fo(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Io(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},Lo=(e,t,n)=>e.kind===`AssumeProve`?Io(e,t,n):(B(e,t,n),t),Ro=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Po(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Bo(t,e,r),t)},zo=(e,t,n)=>{let r=Ko(e,t,n);return e.name===void 0?r:Ga(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Bo=(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=Lo(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Ro(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Ro(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 Po(r.facts,t,n),o(t);case`Instance`:return o(zo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?zo(t,e,i):Oo([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),Ro(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),a(t);case`Take`:return a(qa(wo(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=qa(wo(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,o,{...i,labelParams:[...i.labelParams,...Xa(r.bounds),...r.names]}),Ro(e.proof,a(t),n),a(o)}default:return Ro(e.proof,a(t),n),a(t)}},Vo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Lo(e.statement,void 0,t);e.name!==void 0&&Ka(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Ro(e.proof,n,t),r&&(r.isInProof=!1)},Ho={line:0,column:0},Uo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Wo=(e,t)=>{let n=new Map([...Ia,...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},Go=(e,n,r,i,a)=>{let o=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){B(r,o,a);return}let i=Co(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new t(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.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 t=e.name,r=n.find(e=>e.name===t);if(!r){a.errors.push({location:f(e.nameRange),message:`Identifier '${t}' 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(t)?o&&a.errors.push({location:f(o),message:`Multiple substitutions for symbol '${t}' in substitution.`}):c.set(t,i)});let l=n.filter(e=>!c.has(e.name)),u=e=>!Va(o,e.name)&&!Qa(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 n=e.location.range,i=t.location.range;n&&i&&a.errors.push({location:f(n),message:`Substitution missing for symbol ${t.name} declared at ${f(i)} \nand instantiated in module ${r}.`})}),c},Ko=(e,t,n)=>{let r=n.getInstance(e);return Go(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ga(e,t,r,n),t)},qo=(e,t,n,r)=>{let i=Wo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Go(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:Ho}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Jo=(e,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>La(e.location,t.location)?-1:+!!La(t.location,e.location)).forEach(e=>{let a=[],o=[];try{e.check(a,o)}catch(e){if(!(e instanceof t)||!e.sany&&a.length===0)throw e;a.push(...e.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},Yo=(e,t)=>{let n=Wo(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([...Ia,...t.bound].map(([e,t])=>[e,{...t,position:Ho}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>Ka(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return Jo([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=Wa(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);Uo(e,t)?B(t.body,void 0,i):Do(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:Ra(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);Ja(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>Ka(t,e,i)),e.name!==void 0&&Ka(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);B(e.expression,void 0,r),e.name!==void 0&&Ka(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>Vo(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Po(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:f(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Xo=/* @__PURE__ */ new WeakSet,Zo=/* @__PURE__ */ new WeakSet,Qo=(e,t,n=/* @__PURE__ */ new Set)=>{let r=is(e,(e,r)=>Qo(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&O(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&O(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},$o=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),es=/* @__PURE__ */ new WeakMap,ts=e=>es.get(e)??e.name,ns=(e,t)=>(ts(t)!==e.name&&es.set(e,ts(t)),e),rs=(e,t)=>ns(e.kind===`Function`?{...e,bounds:$o(e.bounds,e=>t(e,[])),body:t(e.body,Xa(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),is=(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=>rs(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:$o(e.bounds,n),body:t(e.body,Xa(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,Ya(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,Ya(e.bound.pattern))};case`SetMap`:return{...e,bounds:$o(e.bounds,n),expression:t(e.expression,Xa(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)}}},as=`LAMBDA`,os=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return is(e,(e,n)=>(r.push(...os(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},ss=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}},cs=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),ls=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},us=(e,t)=>e.map(e=>({pattern:ls(e.pattern,t),set:e.set})),ds=(e,t)=>e.kind===`Function`?{...e,bounds:us(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},fs=(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=>ns({...ds(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:us(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:ls(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:ls(e.bound.pattern,n),set:e.bound.set}};default:return e}},ps=e=>`${e}@ENABLED`,ms=(e,t)=>e.modes.get(t)??e,hs=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!O(e)&&t.instantiation.variables.has(e.name),gs=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>gs(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(hs(e,t,n))return[e.name];let r=O(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?gs(r.body,t,/* @__PURE__ */ new Map):void 0},_s=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return hs(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:ps(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Ss(e.expression,ms(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Ss(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Ss(e.subscript,ms(t,`Primed`),n),location:r},Ss(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=gs(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:ps(r),location:e.location},location:e.location},Ss({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},vs=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:ja}),ys=(e,t)=>e.map(e=>vs(e.name,t)),bs=(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:[...ys(t,r),...i.map(e=>vs(e,r))],location:r},location:r}},xs=(e,t)=>e.instantiation.isParameterized(t)?ws(e,t):void 0,Ss=(e,n,r)=>{let i=e=>Ss(e,n,r),a=n.instantiation,o=a.params,s=t=>!r.has(t)&&!O(e);if(e.kind===`Enabled`&&n.mode===`Normal`)return{...e,expression:Ss(e.expression,ms(n,`Enabled`),r)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&n.mode===`Normal`)return{...e,subscript:i(e.subscript),action:i(e.action),enabled:Ss(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},ms(n,`Enabled`),r)};let c=_s(e,n,r);if(c)return c;if(e.kind===`Identifier`&&s(e.name)){let t=a.substitutions.get(e.name);if(t)return Xo.add(t),t;let r=xs(n,e.name);if(r===void 0)return e;if(o.length===0)return{...e,name:r};let i=a.getDefinition(e.name);return i&&Ra(i)>0?bs(r,o,Ra(i),e.location):{kind:`Apply`,operator:r,args:ys(o,e.location),location:e.location}}if(e.kind===`Apply`&&s(e.operator)){let r=e.args.map(i),s=a.substitutions.get(e.operator),c=a.substitutions.size>0||o.length>0||Zo.has(e),l=e=>(c&&Zo.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:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...e,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:as,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...e,operator:as,args:r,resolution:ja},location:e.location};if(s)throw new t(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=xs(n,e.operator);return u===void 0?l({...e,args:r}):{...e,operator:u,args:[...ys(o,e.location),...r]}}if(e.kind===`OperatorReference`&&s(e.operator)){let t=xs(n,e.operator);if(t===void 0)return e;let r=a.getDefinition(e.operator);return o.length>0&&r?bs(t,o,Ra(r),e.location):{...e,operator:t}}let l=ss(n),u=is(e,(e,t)=>t.length===0?i(e):Ss(e,n,cs(r,t,l)));return fs(u,r,l)},Cs=(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:vs(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ws=(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=ss(e),o=ds(rs(i,(t,n)=>Ss(t,e,cs(/* @__PURE__ */ new Map,n,a))),a);return Cs(o,r.params,i.location)}):t},Ts=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>os(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=>xs(i,e)??e,getQualifiedKey:t=>{let n=xs(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Cs(r,e.params,r.location)):t}}},Es=e=>e.kind===`Let`&&e.instances!==void 0||Ue(e).some(Es),Ds=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=is(e,e=>Ds(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>La(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}},Os=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ks=(e,t)=>e.definitions.some(e=>Es(e.body))||e.assumptions.some(e=>Es(e.expression))||e.theorems.some(e=>{let t=Os(e);return t!==void 0&&Es(t)})?{...e,definitions:e.definitions.map(e=>rs(e,e=>Ds(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ds(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Os(e);return n===void 0?e:{...e,statement:Ds(n,t,[])}})}:e,As=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=hr.sets,a=i??[],o=a.length;hr.sets=a;try{return n()}catch(e){throw Xu(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,hr.sets=i}},js=(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},Ms=e=>!e.includes(void 0),Ns=e=>e.variables.map(()=>void 0),Ps=(e,t,n)=>{let r=[...e];return r[t]=n,r},Fs=(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}},Is=e=>e.kind===`Identifier`?e.name:void 0,Ls=(e,t,n)=>{if(t.kind===`Label`)return Ls(e,t.body,n);let r=Is(t);if(r===void 0)return;let i=vl(n,r);if(i?.kind===`Thunk`)return Ls(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=su(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Ls(e,o.body,o.scope):void 0},Rs=(e,t,n)=>{if(t.kind===`Prime`)return Ls(e,t.expression,n);if(t.kind===`Label`)return Rs(e,t.body,n);let r=Is(t);if(r===void 0)return;let i=vl(n,r);if(i?.kind===`Thunk`)return Rs(e,i.expression,i.scope);if(i)return;let a=su(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Rs(e,a.body,a.scope):void 0},zs=e=>{if(typeof e!=`boolean`)throw new h(`TLC expected a boolean expression.`);return e},Bs=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Vs=(e,t,n)=>{t===void 0?Ms(n)&&e.onState(n):Ms(n)&&Bs(e)?Us(e,t,n):t.kind===`Predicate`?Ws(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?$s(e,t.expression,t.rest,t.scope,n):Hs(e,t,n)&&Vs(e,t.rest,n)},Hs=(e,t,n)=>{let r=e.environment,i=H(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return H(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?gl(t,r.runtime.version):t}})();return!Ut(i,a)},Us=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){$s(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Hs(e,r,n):!zs(H(r.expression,js(e,r.scope,n))))return}e.onState(n)},Ws=(e,t,n,r,i)=>As(e,t,()=>{switch(t.kind){case`Let`:Ws(e,t.body,n,Tu(t.definitions,js(e,r,i)),i);return;case`Label`:Ws(e,t.body,n,r,i);return;default:if(Zs.has(t.kind))throw new h(`The state relation is not a boolean expression.`);As(e,t,()=>Qs(e,t,n,r,i))}}),Gs=(e,t,n,r)=>{zs(t)&&Vs(e,n,r)},Ks=(e,t,n,r,i)=>{let a=js(e,r,i);if(t.kind===`Identifier`){let o=vl(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Ws(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Ws(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:su(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&kl(s,e.environment))){Ws(e,c.body,n,c.scope,i);return}Gs(e,H(t,a),n,i);return}let o=lu(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Ws(e,o.body,n,Cu(o,t.args,a),i):Gs(e,H(t,a),n,i)},qs=(e,t,n,r,i)=>{let a=n[r];a===void 0?Vs(e,t,Ps(n,r,i)):Ut(a,i)&&Vs(e,t,n)},Js=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Ys=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?Ls(e,a,r):Rs(e,a,r),c=js(e,r,i);if(s===void 0){H(t,c)===!0&&Vs(e,n,i);return}let l=H(o,c),u=i[s];if(t.operator===`=`){qs(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)H(t,c)===!0&&Vs(e,n,i);else{if(!Wn(d))throw new h(`The right side of \\IN is not enumerable.`);for(let t of nr(d))Vs(e,n,Ps(i,s,t))}},Xs=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Zs=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Qs=(e,t,n,r,i)=>{let a=js(e,r,i);switch(t.kind){case`Identifier`:Ks(e,t,n,r,i);return;case`Apply`:if(Xs.has(t.operator)&&t.args.length===2){Ys(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(zs(H(t.args[0],a))){Ws(e,t.args[1],n,r,i);return}Vs(e,n,i);return}Ks(e,t,n,r,i);return;case`And`:{let a=t.operands;if(t.isBulleted||a.length===2){let t=a.slice(1).reduceRight((e,t)=>Js(`Predicate`,t,r,e),n);Ws(e,a[0],t,r,i);return}let o=a[a.length-1];Ws(e,Fs(t,a.length-1),Js(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>Ws(e,t,n,r,i));return}Ws(e,Fs(t,a.length-1),n,r,i),Ws(e,a[a.length-1],n,r,i);return}case`Exists`:Bl(t.bounds,a,r=>(Ws(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(Bl(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Vs(e,n,i);return}let o=r.slice(1).reduce((e,n)=>Js(`Predicate`,t.body,n,e),n);Ws(e,t.body,o,r[0],i);return}case`If`:Ws(e,zs(H(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>zs(H(e.condition,a)))?.body??t.other;if(o===void 0)throw new h(`TLC encountered a CASE with no conditions true.`);Ws(e,o,n,r,i);return}case`FunctionApplication`:{let r=Gl(H(t.function,e.isInit?a:Sl(a)));if(r){Ws(e,r.body,n,Kl(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){$s(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){Ws(e,t.action,n,r,i),$s(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){Ws(e,t.action,Js(`Changed`,t.subscript,r,n),r,i);return}}Gs(e,H(t,a),n,i)},$s=(e,t,n,r,i)=>As(e,t,()=>{let a=Ls(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&qs(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Vs(e,n,i);return}let s=o.reduceRight((e,t)=>Js(`Unchanged`,t,r,e),n);$s(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=vl(r,t.name);if(a?.kind===`Thunk`){$s(e,a.expression,n,a.scope,i);return}let o=a?void 0:su(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){$s(e,o.body,n,o.scope,i);return}}let o=e.environment,s=H(t,{environment:o,scope:r,state:e.current,next:void 0}),c=H(t,{environment:o,scope:r,state:i,next:void 0});Ut(s,c)&&Vs(e,n,i)}),ec=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},tc=/* @__PURE__ */ Error(`The replay found a successor`),nc=(e,t,n,r)=>{let i=ec(r,!1,n,()=>{throw tc},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Js(`Changed`,e.subscript,t,void 0);Ws(i,e.action,n,t,Ns(r))}else Ws(i,e,void 0,t,Ns(r));return!1}catch(e){if(e!==tc)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},rc=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=ec(t,!0,void 0,n),o=i.reduceRight((e,t)=>Js(`Predicate`,t.expression,t.scope,e),void 0);Ws(a,r.expression,o,r.scope,Ns(t))},ic=(e,t,n,r)=>{e.some(e=>Zs.has(e.expression.kind))||e.forEach(e=>{let i=[],a=ec(n,!1,t,e=>i.push(e));Ws(a,e.expression,void 0,e.scope,Ns(n)),i.forEach(t=>r(t,e))})},ac=/* @__PURE__ */ new WeakMap,oc=/* @__PURE__ */ new WeakMap,sc=(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},cc=(e,t,n)=>{let r=e.slice();return r[t]=n,r},lc=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,uc=(e,t)=>{let n=new h(t);return e.isInit?n:i(n,m.error)},dc=(e,t,n,r)=>{let i=ol(n);return r&&Zs.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 ${lc(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},fc=(e,t,n)=>{let r=ji(t),i=al(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 ${lc(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
141
|
+
`:``}${i}`},pc=(e,t,n)=>mc(e,t,H(t,n)),mc=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw uc(e,dc(e,n,t,r))},hc=(e,t,n,r)=>r.environment.callStack?H(n,r):(e[t]??=ed(n,r.environment))(r),gc=e=>e===`=`||e===`\\in`||e===`\\subseteq`,_c=(e,t,n)=>{let r=n?ac:oc,i=r.get(e);if(i)return i;let a=Wc(e,t,n);return r.set(e,a),a},vc=(e,t)=>{if(t.constants.has(e))return;let n=Tl(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},yc=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return yc(e.expression,t,!1,r);if(e.kind!==`Identifier`||O(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=vc(e.name,t);if(a&&!r.has(a))return r.add(a),yc(a.body,t,n,r)},bc=(e,t,n)=>yc(e,t,!n),xc=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return xc(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Tu(e.definitions,sc(r,t,n));return xc(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=vl(t,e.name);if(a?.kind===`Thunk`)return xc(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=vc(e.name,r.environment);if(s)return xc(s.body,void 0,n,r,i)},Sc=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||O(e))||!t&&e.kind===`Prime`,Cc=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Cc(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=vc(e.name,t);if(i)return n.add(e.name),Cc(i.body,t,n)},wc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Tc=(e,t,n)=>wc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||gc(e.operator)&&(Sc(e.args[0],n)||bc(e.args[0],t,n)!==void 0)||O(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Ec=/* @__PURE__ */ new Set,Dc=(e,t)=>{if(O(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return is(e,(e,i)=>{let a=r.isReadOnly?Dc(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Oc=(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||O(e)?void 0:Tl(r,t);return i&&!n.has(i)&&(n.add(i),Oc(i.body,t,n))?!0:Ue(e).some(e=>Oc(e,t,n))},kc=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=bc(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=Cc(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return Tc(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:_c(e,t,n)}},Ac=(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(Aa(e,t)===void 0||Oc(e,t,/* @__PURE__ */ new Set))return!0;let n=Dc(e,Ec);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)}},jc=(e,t,n)=>{let r=e.map(e=>kc(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Bs(t);for(let s=e;s<r.length;s++){if(s>0&&f&&qc(u)){d??=sc(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=hc(a,e,n,d);if(!mc(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=sc(t,n,u);let r=hc(i,s,e.expression,d);if(!mc(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=sc(t,n,u);let r=hc(i,s,e.value,d),a=u[e.index];if(a===void 0)u=cc(u,e.index,r),d=void 0;else if(!Ut(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=u[t];if(e===void 0)u=cc(u,t,n[t]),d=void 0;else if(!Ut(e,n[t]))return}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)},Mc=e=>(t,n,r,i,a,o)=>{pc(t,e,sc(t,n,r))&&o(r,i)},Nc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=sc(r,i,a);if(a[l]!==void 0){pc(r,e,u)&&c(a,o);return}let d=H(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Wn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${lc(r)}, the right side of \\IN is not enumerable.`;throw uc(r,`${t}\n${al(e)}`)}let p=nr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(cc(a,l,p[e]),o)}},Pc=/* @__PURE__ */ new WeakMap,Fc=e=>{let t=Pc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Fc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Pc.set(e,n),n},Ic=(e,t)=>{let n=e.args[0],r=Mc(e),i=(e,r,i)=>xc(n,r,i,e,!t)??-1,a=Nc(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=H(e.args[1],sc(t,n,o));l(cc(o,u,d),s)}},Lc=(e,t,n)=>{let r=al(e);return(i,a,o,s,c,l)=>{let u=sc(i,a,o),d=H(e.function,n?u:Sl(u)),f=Gl(d);if(f!==void 0){_c(f.body,t,n)(i,Kl(f,e,u),o,s,c,l);return}if(!j(d))throw uc(i,`In computing ${lc(i)}, a non-function (${ji(d)}) was applied as a function.\n${r}`);let p=H(e,u);if(typeof p!=`boolean`)throw uc(i,`In computing ${lc(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Rc=(e,t)=>{if(Cc(e,t))return jc([Fc(e)],t,!1);if(e.kind===`Tuple`)return _c(Fc(e),t,!1);let n=Fc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?vl(i,e.name):void 0;l?.kind===`Thunk`?_c(Fc(l.expression),t,!1)(r,l.scope,a,o,s,c):pc(r,n,sc(r,i,a))&&c(a,o)}},zc=(e,t,n)=>{let r=e.operator,i=Mc(e),a=O(e)?void 0:su(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=sd(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=_c(a.body,t,n),o.body(e,i(sc(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=sc(a,o,s),f=lu(e,d);f?.kind===`Closure`?_c(f.body,t,n)(a,Cu(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Bc=(e,t,n)=>{let r=Mc(e),i=O(e)?void 0:vc(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=vl(s,e.name);f?.kind===`Thunk`?_c(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=_c(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Vc=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||O(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!O(a))return;let o=yc(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>Vc(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||O(e))return;let r=su(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Vc(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`&&O(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Hc=(e,t,n)=>{let r=vl(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},Uc=(e,t,n)=>{let r=e.map(e=>_c(e,t,n)),i=n?[]:e.map(e=>Vc(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&Hc(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},Wc=(e,t,n)=>{let r=e=>_c(e,t,n);switch(e.kind){case`And`:return jc(e.operands,t,n);case`Or`:return Uc(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=Nl(H(a.set,sc(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,yl(r,e,u[t]),o,s,c,l)}}let o=n?void 0:Ac(e,t);if(o){let r=jc(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=sc(n,i,a),d=e.bounds.map(e=>Nl(H(e.set,u),e.set,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=yl(t,o.names[e],r);if(e===d.length-1){let e=sc(n,i,a);if(!o.guards.every(t=>pc(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Bl(e.bounds,sc(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Aa(e,t)!==void 0&&!Oc(e.body,t,/* @__PURE__ */ new Set)?Dc(e,Ec):void 0;return(t,n,r,o,s,c)=>{let l=[];Bl(e.bounds,sc(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>vl(n,e)?.kind===`Value`)){u.every(n=>pc(t,e.body,sc(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&qc(r)?u.slice(n).every(n=>pc(t,e.body,sc(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=H(e.condition,sc(r,i,a));if(typeof l!=`boolean`)throw uc(r,fc(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=sc(r,i,a),u=t.find(e=>{let t=H(e.condition,l);if(typeof t==`boolean`)return t;throw uc(r,`In computing ${lc(r)}, a non-boolean expression${r.isEnabled?``:` `}(${ji(t)}) was used as a guard condition of a CASE.\n${ol(e.source)}`)})?.body??n;if(!u)throw uc(r,`In computing ${lc(r)}, TLC encountered a CASE with no conditions true.\n${al(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Fu(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Tu(e.definitions,sc(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new h(`UNCHANGED appears in an initial predicate at ${rl(e)}`)}:Rc(e.expression,t);case`AngleAction`:{let n=r(e.action),i=Fc(e.subscript),a=(e,n,r)=>{try{return pc(e,i,sc(e,n,r))}catch(n){throw e.isEnabled?gl(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,Fc(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Bc(e,t,n);case`FunctionApplication`:return Lc(e,t,n);case`Apply`:{let i=e.args;if(gc(e.operator)){let r=bc(i[0],t,n);if(r!==void 0)return e.operator===`=`?jc([e],t,n):Nc(e,()=>r);if(Sc(i[0],n))return Ic(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=H(i[0],sc(t,n,r));(typeof c==`boolean`?c:wl(c,`the left side of => at ${rl(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return zc(e,t,n)}default:return Mc(e)}},Gc=/* @__PURE__ */ new WeakMap,Kc=e=>{let t=Gc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Gc.set(e,n),n},qc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Jc=(e,t)=>{let n=t.state;if(!n||!qc(n))throw new h(`ENABLED needs a complete state at ${rl(e)}`);let r=t.environment;if(r.callStack)return nc(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return _c(e,r,!1)(i,t.scope,Kc(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Yc=(e,t,n,r)=>{let a={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};_c(e,t,!0)(a,r,Kc(t),void 0,!1,e=>{if(!a.isStopped){if(!qc(e))throw i(new ee([...e]),m.error);a.isStopped=n(e)}})},Xc=(e,t,n)=>{let r=[];return Yc(e,t,e=>(r.push(e),!1),n),r},Zc=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return _c(e,n,!1)(a,i,Kc(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!qc(e)){let r=n.variables.filter((t,n)=>e[n]===void 0);throw new y(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Qc=(e,t,n,r)=>{let i=[];return Zc(e,t,n,e=>(i.push(e),!1),r),i},$c=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),el=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),tl=e=>el.has(e.kind)||e.kind===`Apply`&&$c.has(e.operator),nl=(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&&$e(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},rl=e=>`line ${e.location.line}, column ${e.location.column}`,il=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,al=e=>{let t=e.location.range;return t?il(t):rl(e)},ol=e=>e.kind===`Number`?e.text??String(e.value):al(e),sl=(e,t)=>new h(`A non-boolean expression (${ji(t)}) was used as the condition of an IF.\n${al(e)}`),cl=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new h(`A non-boolean expression (${ji(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${ol(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new h(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${ji(n)}.\n${al({...e,location:{...e.location,range:{...r,end:i}}})}`)},ll=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${L(n)}\n${al(e)}`,r=e=>`Attempted to apply function:\n${k(L(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!j(i))throw new h(`Attempted to select field "${t}" from a non-record value ${k(L(i))}\n${al(e)}`);let a=Pt(i);if(a===`tuple`)throw Tr(t);return Or(i,t,a===`record`?n:r)}},ul=e=>e===`1.7.4`?(t,n)=>Sr(t,n,e):void 0,dl=e=>t=>{if(!j(t))throw new h(`Attempted to apply the operator DOMAIN to a non-function\n(${ji(t)})\n${al(e)}`);return Ar(t)},fl=(e,t)=>(n,r)=>{if(!A(n)||St(n))throw new h(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${al(e)}`);return t.evaluate([n,r])},pl=e=>i(new h(`TLC can't handle real numbers: ${e.text} at ${rl(e)}`),m.configParseError),ml=e=>i(new h(`TLC can't handle a number this big: ${e.text??e.value} at ${rl(e)}`),m.error),hl=(e,t)=>new u(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${al(t)}`,e),gl=(e,t)=>e instanceof u&&t!==`1.7.4`?new h(`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,_l=e=>new h(`A primed expression appears outside an action at ${rl(e)}`),vl=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},yl=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),bl=(e,t,n)=>{if(t.kind===`Name`)return yl(e,t.name,n);let r=pr(n);if(!r||r.length!==t.names.length)throw new h(`Cannot bind <<${t.names.join(`, `)}>> to ${L(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>yl(e,t,r[n]),e)},xl=(e,t)=>{if(j(e))return e;throw new h(`A non-function (${ji(e)}) was applied as a function.\n${al(t)}`)},Sl=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Cl=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),wl=(e,t)=>{if(typeof e!=`boolean`)throw new h(`Expected ${t} to be a boolean but found ${L(e)}`);return e},Tl=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),El=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Dl=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),Ol=(e,t)=>{if(El.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&Dl.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=Tl(n,t);if(e&&!t.constants.has(n)&&!kl(e,t))return!0}return Ue(e).some(e=>Ol(e,t))},kl=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!Ol(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>Ol(e.set,t)));return t.constantLevels.set(e,r),r},Al=(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.`},jl=(e,t,n)=>{if(!A(e)||St(e)){let r=L(e),i=n===`1.7.4`?void 0:Al(e,r);throw new h(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${ol(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${ol(t)}\n${i}`)}},Ml=(e,t,n)=>(jl(e,t,n),typeof e==`object`&&e.kind===`Interval`?Ln(e):Zn(e)??P(e).elements),Nl=(e,t,n)=>n===`1.7.4`?(jl(e,t,n),Zn(e)??nr(e)):Ml(e,t,n),Pl=e=>{if(typeof e==`object`&&e.kind===`Interval`)return lr(e),e},Fl=(e,t,n)=>Pl(e)??Nl(e,t,n),Il=(e,t,n)=>Pl(e)??Ml(e,t,n),Ll=(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},Rl=(e,t)=>e.map(e=>Fl(H(e.set,t),e.set,t.environment.runtime.version)),zl=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Ll(t[n],t=>i(n-1,bl(a,e[n].pattern,t)));return i(e.length-1,n)},Bl=(e,t,n)=>zl(e,Rl(e,t),t.scope,n),Vl=(e,t)=>{let n=e.map(e=>H(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Hl=(e,t,n)=>{if(e.length===1)return bl(t,e[0].pattern,n);let r=pr(n)??[];return e.reduce((e,t,n)=>bl(e,t.pattern,r[n]),t)},Ul=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Wl=e=>Object.assign(e.value,{lambda:e}),Gl=e=>Ul(e)?e.lambda:void 0,Kl=(e,t,n)=>{let r=e.value,i=t.args.map(e=>H(e,n)),a=i.length===1?i[0]:Vn(i),o=(e,n,i)=>`In applying the function\n${k(L(r))},\nthe ${e} is:\n${k(L(n))}${i}.\n${al(t.function)}`,s=e.bounds;if(s.length===1){if(!_r(a,r.domain))throw new h(o(`first argument`,a,`which is not in its domain`));return Hl(s,e.scope,a)}let c=pr(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new h(`Attempted to apply a function to an argument not in its domain.\n${al(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!_r(n,l[t]))throw new h(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
142
|
+
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&pr(n)?.length!==e.pattern.names.length)throw new h(o(r,n,`which does not match its formal parameter`))}),Hl(s,e.scope,Vn(c.slice(0,s.length)))},ql=/* @__PURE__ */ new WeakMap,Jl=(e,t)=>{let n=ql.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:il(r)};return ql.set(t,i),i},Yl=(e,t,n)=>{let r=Jl(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},Xl=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Ur(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(Gt(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},Zl=/* @__PURE__ */ new WeakMap,Ql=e=>{let t=Zl.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return Zl.set(e,n),n},$l=(e,t)=>{let n=Vl(e.bounds,t),r=Xl(n,(n,r)=>H(e.body,Cl(t,Hl(e.bounds,yl(void 0,e.name,r),n))),Yl(e.bounds,e.body,n));return Wl({value:r,bounds:e.bounds,body:e.body,scope:yl(void 0,e.name,r)}),e.bounds.length===1?Ft(r):r},eu=(e,t)=>{if(typeof t!=`object`||Pt(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!$e(t.domain))return t;try{let e=I(t);return jt(e.domain,e.range)}catch(e){if(e instanceof h)return t;throw e}},tu=(e,t)=>e.kind===`Function`?e.isSelfReferential?$l(e,t):H(Ql(e),t):H(e.body,t),nu=(e,t)=>{let n=kl(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new h(`Operator ${e.name} requires ${e.params.length} arguments`);let i=Cl(t,void 0);if(!n)return tu(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>eu(e,tu(e,i)));return t.environment.definitionValues.set(e,a),a},ru=(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))&&kl(e,t))try{Sn(nu(e,{environment:t,scope:void 0,state:void 0,next:void 0}))}catch(e){if(!(e instanceof h)&&!a(e))throw e}}),iu=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=H(e.expression,Cl(t,e.scope));return n&&(!e.isStreamed||ir(r))&&(e.cache=r),r},au=/* @__PURE__ */ new WeakMap,ou=e=>{let t=au.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return au.set(e,n),n},su=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return su(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?ou(r):t.builtins.get(e)},cu=/* @__PURE__ */ new WeakMap,lu=(e,t)=>{if(O(e))return uu(e.operator,t);let n=cu.get(e),r=n===void 0?su(e.operator,t.environment)??null:n;return n===void 0&&cu.set(e,r),r??uu(e.operator,t)},uu=(e,t)=>{let n=vl(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return su(e,t.environment)},du=e=>e.kind===`Closure`?e.params.length:e.arity,fu=(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:uu(n,t);if(!r)throw new h(`Expected an operator argument at ${rl(e)}`);return r},pu=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>yl(e,n.name,t[r]),e.scope);return H(e.body,Cl(n,r))},mu=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:du(e),call:n=>pu(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},hu=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=uu(e.name,t);return n!==void 0&&du(n)>0},gu=(e,t)=>e.map(e=>hu(e,t)?mu(fu(e,t),t):H(e,t)),_u=(e,t)=>new h(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),vu=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),yu=(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 yu(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([])}},bu=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&nt(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=O(e)?void 0:yu(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=vl(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:vu(e,t)}}return t=>vu(e,t)},xu=/* @__PURE__ */ new WeakMap,Su=(e,t)=>{let n=xu.get(e);if(n)return n;let r=bu(e,t);return xu.set(e,r),r},Cu=(e,t,n,r)=>{if(t.length!==e.params.length)throw _u(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:fu(t[a],n)}:(r?.[a]??Su(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},wu=(e,t,n,r,i)=>{if(e.kind===`Closure`){let a=Cl(n,Cu(e,t,n,i));return n.environment.callStack?H(e.body,a):(r.entry?.body===e.body?r.entry:r.entry={body:e.body,evaluator:ed(e.body,n.environment)}).evaluator(a)}return e.kind===`Operator`?e.call(t.map(e=>H(e,n))):e.isLazy?e.evaluate(ad(t,n),n):e.evaluate(gu(t,n),n)},Tu=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1},i):r.params.length>0||n?.impure.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(r)??!1},i)},t.scope),Eu=(e,t,n)=>{let r=vl(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return iu(r,n);if(r?.kind===`Operator`){if(du(r.operator)===0)return pu(r.operator,[],n);throw new h(`Operator ${e} is used without arguments`)}let i=yu(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw hl(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return nu(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new h(`Unknown identifier ${e} at ${rl(t)}`)},Du=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Ou=(e,t)=>Du.has(e)||t.builtins.get(e)?.isStateLevel===!0,ku={builtins:Du,definitions:/* @__PURE__ */ new WeakMap},Au={builtins:new Set([...Du].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},ju=(e,t)=>e.kind===`Operator`&&e.params.length===0&&kl(e,t),Mu=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!O(e)){let e=Tl(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!ju(e,t)&&Nu(e,t,n))return!0}return Ue(e).some(e=>Mu(e,t,n))},Nu=(e,t,n=ku)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Mu(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Mu(e.set,t,n));return n.definitions.set(e,i),i},Pu={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},Fu=(e,t)=>({impure:new Set(e.filter(e=>Nu(e,t))),streamed:new Set(e.filter(e=>Nu(e,t,Pu)))}),Iu=e=>[...e.definitions.values()].some(t=>Nu(t,e)),Lu=e=>[...e.definitions.values()].some(t=>Nu(t,e,Au)),Ru=/* @__PURE__ */ new WeakMap,zu=(e,t)=>{let n=Ru.get(e);if(n!==void 0)return n;let r=Uu(e,t,Vu);return Ru.set(e,r),r},Bu=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),Vu=/* @__PURE__ */ new Set,Hu=(e,t,n)=>n.size===0?zu(e,t):Uu(e,t,n),Uu=(e,t,n)=>{if(!Bu.has(e.kind))return!1;if(e.kind===`Identifier`&&O(e))return n.has(e.name);if(O(e))return!1;if(e.kind===`Identifier`){let n=yu(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&ju(n.definition,t)}if(e.kind===`Apply`){if(Ou(e.operator,t)||Pu.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=su(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=Tl(e.operator,t);if(!n||!kl(n,t)||Nu(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&Hu(e,t,n))}let r={value:!0};return is(e,(e,i)=>(r.value&&=Hu(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Wu=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Gu=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},Ku=(e,t)=>{if(e.kind===`Identifier`&&O(e))return!t.has(e.name);if(O(e))return!0;let n={value:!1};return is(e,(e,r)=>(n.value||=Ku(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},qu=(e,t)=>Xo.has(e)&&Wu(e)&&Aa(e,t)!==void 0&&!Ku(e,Vu),Ju=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,Yu=(e,t,n,r)=>i=>{r.expressions.push(e);let a=hr.sets,o=hr.callStack,s=a??[],c=s.length;hr.sets=s,hr.callStack=r;try{let a=t(i),o=Ju(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&tl(e)&&r.sources.set(o,e),o}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=nl(e,r.values),a=i&&!Ue(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!j(a)?void 0:a;throw Xu(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,hr.sets=a,hr.callStack=o}},Xu=(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 h){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},Zu=(e,t,n)=>{if(!(n instanceof h))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}},Qu=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),V=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Pd(e,t),i=t.callStack,a=i?Yu(e,r,t,i):Wu(e)&&zu(e,t)?Gu(r):qu(e,t)?rd(r):r;return t.evaluators.set(e,a),a},$u=/* @__PURE__ */ new WeakMap,ed=(e,t)=>{if(t.callStack)return V(e,t);let n=$u.get(e);if(n)return n;let r=(Wu(e)&&zu(e,t)?void 0:$i(e,t))??V(e,t);return $u.set(e,r),r},H=(e,t)=>ed(e,t.environment)(t),td=(e,t)=>{let n=e.name,r=O(e)?void 0:yu(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw hl(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&kl(e,t))return t=>nu(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=ed(e.body,t),n.body(Cl(r,void 0)));return nd(e,t)?rd(r):r}return t=>nu(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>nu(e,t);return kl(e,t)||!nd(e,t)?n:rd(n)}return t=>Eu(n,e,t)},nd=(e,t)=>Aa(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Aa(e.set,t)!==void 0)),rd=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},id=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||O(e))return!0;let n=su(e.name,t);return n===void 0||du(n)===0},ad=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>H(e,t),expression:e})),od=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(ad(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&id(t[0],n)){let e=V(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&id(t[0],n)&&id(t[1],n);if(i&&a){let e=V(t[0],n),r=V(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(gu(t,n),n)},sd=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw _u(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Su(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:fu(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},cd=()=>({calls:/* @__PURE__ */ new Map,size:0,state:void 0}),ld=/* @__PURE__ */ new WeakMap,ud=e=>{let t=ld.get(e);if(t)return t;let n={constant:cd(),state:cd()};return ld.set(e,n),n},dd=e=>e.kind===`ExceptAt`||Ue(e).some(dd),fd=/* @__PURE__ */ new WeakMap,pd=(e,t)=>{let n=fd.get(e);if(n!==void 0)return n;let r=Aa(e,t)!==void 0&&Dc(e,Vu),i=r&&[...new Set(dd(e)?[...r,`@`]:r)];return fd.set(e,i??!1),i??!1},md=e=>typeof e!=`object`||e.kind===`ModelValue`||e.kind===`Set`||e.kind===`Function`||e.kind===`Interval`,U={sources:[],sourceCount:0,args:[],argCount:0,hash:0,isStateKeyed:!1},hd=e=>typeof e==`object`&&e.kind===`ModelValue`?e.rank:Ur(e),gd=e=>md(e)?(U.sources[U.sourceCount++]=void 0,U.args[U.argCount++]=e,U.hash=Pr(U.hash,hd(e)),!0):!1,_d=(e,t,n)=>{if(!t)return!1;U.sources[U.sourceCount++]=e,U.isStateKeyed=!0;for(let e=0;e<t.length;e++){let r=vl(n,t[e]);if(r?.kind!==`Value`||!md(r.value))return!1;U.args[U.argCount++]=r.value,U.hash=Pr(U.hash,hd(r.value))}return!0},vd=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&nt(e.value))return()=>gd(e.value);if(e.kind===`Identifier`){let n=O(e)?void 0:yu(e.name,t);if(n?.kind===`Value`)return()=>gd(n.value);if(n===void 0)return n=>{let r=vl(n.scope,e.name);return r?.kind===`Value`?gd(r.value):r?.kind!==`Thunk`||r.state!==n.state?!1:_d(r.expression,pd(r.expression,t),r.scope)}}let n=pd(e,t);return t=>_d(e,n,t.scope)},yd=e=>{if(e.args.length!==U.argCount||e.sources.length!==U.sourceCount)return!1;for(let t=0;t<U.sourceCount;t++)if(e.sources[t]!==U.sources[t])return!1;for(let t=0;t<U.argCount;t++)if(!Gt(e.args[t],U.args[t]))return!1;return!0},bd=e=>{if(e!==void 0){for(let t=0;t<e.length;t++)if(yd(e[t]))return e[t]}},xd=(e,t)=>{let n=Tl(e.operator,t);if(n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&!Nu(n,t))return kl(n,t)?`constant`:nd(n,t)?`state`:void 0},Sd=(e,t,n,r)=>{let i=sd(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=ed(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r||t.length!==e.params.length)return e=>o(i(e),e);let s=ud(e),c=t.map(e=>vd(e,n)),l={hits:0,misses:0};return e=>{if(e.isKeepLazy)return o(i(e),e);U.sourceCount=0,U.argCount=0,U.hash=t.length,U.isStateKeyed=!1;for(let t=0;t<c.length;t++)if(!c[t](e))return o(i(e),e);let n=r===`state`||U.isStateKeyed;if(n&&l.misses>1024&&l.hits<l.misses)return o(i(e),e);let a=n?s.state:s.constant;n&&a.state!==e.state&&(a.state=e.state,a.calls.clear(),a.size=0);let u=U.hash&1073741823,d=a.calls.get(u),f=bd(d);if(f)return n&&l.hits++,f.value;n&&l.misses++;let p=U.sources.slice(0,U.sourceCount),m=U.args.slice(0,U.argCount),ee=o(i(e),e);if(a.size<65536){a.size++;let e={sources:p,args:m,value:ee};d?d.push(e):a.calls.set(u,[e])}return ee}},Cd=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=V(n[0],t),r=V(n[1],t);return t=>!wl(e(t),`the left side of =>`)||wl(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new h(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=O(e)?void 0:su(e.operator,t);if(r?.kind===`Closure`){let i=t.callStack?void 0:xd(e,t);return Sd(r,n,t,i)}if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=V(n[0],t),i=dl(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=V(n[0],t);return Zo.has(e)||Ol(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=V(n[0],t),a=V(n[1],t),o=fl(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return od(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new h(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={entry:void 0},a=n.map(e=>Su(e,t));return r=>{let o=uu(e.operator,r);if(o)return wu(o,n,r,i,a);throw t.definitions.get(e.operator)?.kind===`Function`?new h(`${e.operator} is a function; apply it with brackets`):new h(`Unknown operator ${e.operator} at ${rl(e)}`)}},wd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=V(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=V(a.set,t);return s=>Ll(Fl(o(s),a.set,t.runtime.version),t=>wl(i(Cl(s,yl(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>V(e.set,t));return s=>{let c=a.map((e,n)=>Fl(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?wl(i(Cl(s,a)),r)!==n:Ll(c[t],n=>l(t-1,yl(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Bl(o,e,t=>wl(i(Cl(e,t)),r)!==n)?!n:n},Td=(e,t)=>{if(e.kind===`Tuple`)return Vn(e.names.map(e=>{let n=vl(t,e);return n?.kind===`Value`&&n.value}));let n=vl(t,e.name);return n?.kind===`Value`?n.value:void 0},Ed=/* @__PURE__ */ new WeakSet,Dd=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Ed.add(e)},Od=(e,t)=>{let n=Ed.has(e),r=V(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=V(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=zn(e),o=jt(i,i.map(e=>r(Cl(t,yl(t.scope,n,e)))));return $e(e)?o:Ft(o)}let n=[],s=i.map(e=>Il(H(e.set,t),e.set,t.environment.runtime.version));return zl(i,s,t.scope,e=>{let o=i.length===1?Td(a.pattern,e)??!1:Vn(i.map(t=>Td(t.pattern,e)??!1));return n.push([o,r(Cl(t,e))]),!1}),jn(n)},l=(t,n)=>{let a=Wl({value:Xl(t,e=>r(Cl(n,Hl(i,n.scope,e))),Yl(i,e.body,t)),bounds:i,body:e.body,scope:n.scope});return i.length===1?Ft(a):a},u=t.callStack;return t=>{let r=o?s(t):Vl(i,t);if(e.isRecursive||n||t.isKeepLazy||!N(r))return l(r,t);if(!$e(r)){if(u)return l(r,t);try{return c(r,t)}catch(e){if(!(e instanceof h))throw e;return l(r,t)}}if(!u)return c(r,t);try{return c(r,t)}catch(t){throw Zu(u,e,t),t}}},kd=(e,t)=>{let n=Ed.has(e);n&&Dd(e.function);let r=V(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=>V(e,t))}),value:V(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Vn(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Cl(i,yl(i.scope,`@`,e))):jr(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(ea.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${al(e.function)}`)}return n}},Ad=(e,t)=>{if(e.kind===`SetFilter`){let n=V(e.predicate,t),r=V(e.bound.set,t),i=e.bound.pattern,a=e.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:il(a)},s=(e,t)=>n=>wl(e(Cl(t,bl(t.scope,i,n))),`a set filter predicate`),c=(t,n,r)=>({kind:`FilteredSet`,base:t,test:s(r,n),source:o,rebind:r=>c(t,{...n,environment:r},V(e.predicate,r))});return e=>{let t=r(e);return $e(t)?At(P(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=V(e.expression,t);return t=>{let r=[];return Bl(e.bounds,t,e=>(r.push(n(Cl(t,e))),!1)),En(r)}}let n=e.set;if(!n)return()=>{throw new h(`TLC cannot evaluate an unbounded CHOOSE at ${rl(e)}`)};let r=V(e.body,t),i=V(n,t);return t=>{let a=i(t);if(!A(a)||St(a))throw new h(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${al(e)}`);let o={value:void 0},s=Il(a,n,t.environment.runtime.version);if(Ll(s,n=>{let i=bl(t.scope,e.pattern,n);return wl(r(Cl(t,i)),`the body of CHOOSE`)?(o.value=Td(e.pattern,i),!0):!1}),o.value===void 0)throw new h(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${al(e)}`);return o.value}},jd=e=>[...e].sort((e,t)=>Dt(e.name,t.name)),Md=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Nd=(e,t)=>{let n=jd(e),r=Md(n),i=n.map(e=>V(e.value,t));if(r)return e=>Hn(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=>ot(a,i.map(t=>t(e)),o):e=>Un(a,i.map(t=>t(e)))},Pd=(e,t)=>{let n=e=>V(e,t);switch(e.kind){case`Number`:{let t=e.value;return nt(t)?()=>t:()=>{throw ml(e)}}case`Decimal`:return()=>{throw pl(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return td(e,t);case`Apply`:return Cd(e,t);case`Bracket`:return()=>{throw new h(`A bracket without a function or subscript is not an expression at ${rl(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new h(`An operator cannot be used as a value at ${rl(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 cl(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 cl(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw _l(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>Ut(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw sl(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 h(`A non-boolean expression (${ji(t)}) was used as a condition of a CASE. ${ol(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new h(`Attempted to evaluate a CASE with no conditions true.\n${al(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Cl(n,Tu(e.definitions,n)))}case`Forall`:case`Exists`:return wd(e,t);case`UnboundedQuantifier`:return()=>{throw new h(`TLC cannot evaluate an unbounded quantifier at ${rl(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Ad(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>En(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Vn(t.map(t=>t(e)))}case`FunctionConstruction`:return Od(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return Nd(e.fields,t);case`RecordSet`:{let t=jd(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 kd(e,t);case`ExceptAt`:return t=>{let n=vl(t.scope,`@`);if(n?.kind!==`Value`)throw new h(`@ appears outside an EXCEPT at ${rl(e)}`);return n.value};case`FunctionApplication`:{Dd(e.function);let r=n(e.function),i=t=>xl(r(Sl(t)),e),a=e.args.map(n),o=ul(t.runtime.version);if(a.length===1){let e=a[0];return t=>Or(i(t),e(t),o)}return e=>Or(i(e),Vn(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=ll(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?wl(t(e),`an action`)||r(e):wl(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Jc(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new h(`The subexpression reference at ${rl(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new h(`TLC cannot evaluate a temporal formula in a state at ${rl(e)}`)}}},Fd=`tlc2/value/impl/`,Id={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},Ld={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},Rd=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},zd=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Bd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Vd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??zd.get(e[3])}${`[]`.repeat(e[1].length)}`),Hd=(e,t)=>e[e[t].first].text,Ud=(e,t)=>Hd(e,t).replaceAll(`/`,`.`),Wd=e=>{let n=Rd(e);if(n.readUint32()!==3405691582)throw new t(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===Id.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===Id.integer?i.value=n.readInt32():t===Id.float?n.readUint32():t===Id.long||t===Id.double?(n.readBytes(8),e++):t===Id.class||t===Id.string||t===Id.methodType||t===Id.module||t===Id.package?i.first=n.readUint16():t===Id.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=Ud(r,n.readUint16());n.readUint16(),n.readBytes(n.readUint16()*2);for(let e=n.readUint16();e>0;e--){n.readBytes(6);for(let e=n.readUint16();e>0;e--)n.readUint16(),n.readBytes(n.readUint32())}let s=[];for(let e=n.readUint16();e>0;e--){let e=n.readUint16(),t=r[n.readUint16()].text,i=r[n.readUint16()].text,a=i.indexOf(`)`),c=Vd(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:Rd(n.readBytes(n.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()},()=>Ud(r,d.readUint16())):[],p=Bd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Vd(i.slice(a+1))[0],ee=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:t,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${t}(${c.join(`,`)})${ee}`})}return{pool:r,methods:s}},Gd=(e,t)=>{let n=e[t],r=e[n.second];return{className:Hd(e,n.first),name:e[r.first].text}},Kd=(e,t,n,r)=>{let i=()=>new g(`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===Id.integer)return n.value;if(n.tag===Id.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>=Ld.iconstM1&&n<=Ld.iconst5)o.push(n-Ld.iconst0),e+=1;else if(n===Ld.bipush)o.push(a[e+1]<<24>>24),e+=2;else if(n===Ld.sipush)o.push(l()<<16>>16),e+=3;else if(n===Ld.ldc)o.push(c(a[e+1])),e+=2;else if(n===Ld.ldcW)o.push(c(l())),e+=3;else if(n===Ld.dup){let t=s();o.push(t,t),e+=1}else if(n===Ld.getstatic){let n=Gd(t,l());if(n.className!==`${Fd}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===Ld.invokestatic){let n=Gd(t,l()),a=s();if(n.className!==`${Fd}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===Ld.new)o.push({className:Hd(t,l()),value:void 0}),e+=3;else if(n===Ld.invokespecial){let n=Gd(t,l()),a=s(),o=s();if(!(n.className===`${Fd}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===Ld.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()},qd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Wd(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:Kd(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)}))}},Jd=/* @__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(`,`),Yd=[[`\\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`,`≀`],[`^+`,`⁺`]],Xd=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),Zd=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),Qd=/* @__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(`.`),$d=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),ef=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
90
143
|
Nat == { }
|
|
91
144
|
a+b == {a, b}
|
|
92
145
|
a-b == CHOOSE n : b + n = a
|
|
@@ -402,8 +455,1314 @@ _CheckName(name) ==
|
|
|
402
455
|
=> (PrintT(counts) /\\ FALSE)
|
|
403
456
|
_PrintCounts == PrintT(_Counts)
|
|
404
457
|
=============================================================================
|
|
405
|
-
`]]),du=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),fu=(e,t)=>e.every(e=>B(e,t)),pu=ht([!1,!0]),mu=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return bt(mu(e,t,r),mu(e,r,n))},hu=[`\\cup`,`\\cap`,`\\`],gu=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),_u=e=>typeof e==`object`&&e.kind===`MixedSet`,vu=e=>e.kind===`Interval`?R(e).elements:e.elements,yu=(e,t,n)=>{let r=vu(t);if(e!==`\\cup`){let t=e===`\\cap`;return gt(r.filter(e=>B(e,n)===t))}if(r.length===0)return n;if(!gu(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=R(n).elements.filter(e=>!B(e,t));return gt([...r,...i])},bu=[Kn(`TRUE`,!0),Kn(`FALSE`,!1),Kn(`BOOLEAN`,pu),Kn(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Yn(`=`,pt),Yn(`#`,(e,t)=>!pt(e,t)),W(`~`,1,e=>!Rn(e,0,`~`)),W(`<=>`,2,e=>Rn(e,0,`<=>`)===Rn(e,1,`<=>`)),W(`/\\`,2,e=>Rn(e,0,`/\\`)&&Rn(e,1,`/\\`)),W(`\\/`,2,e=>Rn(e,0,`\\/`)||Rn(e,1,`\\/`)),W(`=>`,2,e=>!Rn(e,0,`=>`)||Rn(e,1,`=>`)),W(`\\in`,2,e=>B(U(e,0,`\\in`),U(e,1,`\\in`))),W(`\\notin`,2,e=>!B(U(e,0,`\\notin`),U(e,1,`\\notin`))),W(`\\subseteq`,2,e=>{let t=zn(e,0,`\\subseteq`),n=zn(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&L(t.base)?fu(R(t.base).elements,n.base):fu(R(t).elements,n)}),...hu.map(e=>W(e,2,t=>{let n=zn(t,0,e),r=zn(t,1,e);return gu(n)&&gu(r)&&!_u(n)&&!_u(r)?e===`\\cup`&&z(n)?r:(e===`\\cup`?bt:e===`\\cap`?yt:vt)(R(n),R(r)):gu(n)?yu(e,n,r):e!==`\\`&&gu(r)?yu(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),W(`SUBSET`,1,e=>({kind:`Subset`,base:zn(e,0,`SUBSET`)})),W(`UNION`,1,e=>{let t=zn(e,0,`UNION`),n=tt(t)?t.elements.filter(tt):[];if(!tt(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(_u(t)||n.some(_u)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{B(t,e)||e.elements.push(t)})),gt(e.elements)}return n.length===0?_t:mu(n.map(R),0,n.length)}),W(`DOMAIN`,1,e=>{let t=U(e,0,`DOMAIN`);if(!A(t))throw new f(`DOMAIN expects a function but received ${H(t)}`);return on(t)})],xu=or(`DotDot`,`IntervalValue`,2),Su=or(`Neg`,`IntValue`,1),Cu=[Kn(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),sr(`+`,`Plus`,(e,t)=>e+t),sr(`-`,`Minus`,(e,t)=>e-t),sr(`*`,`Times`,(e,t)=>e*t),sr(`^`,`Expt`,(e,t)=>{if(t<0)throw new p(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new p(`0^0 is undefined.`);return e**t}),sr(`\\div`,`Divide`,(e,t)=>{if(t===0)throw new p(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(Xn(n))throw Zn(`${e} \\div ${t}`);return n}),sr(`%`,`Mod`,(e,t)=>{if(t<=0)throw new p(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),lr(`<`,(e,t)=>e<t),lr(`>`,(e,t)=>e>t),lr(`<=`,(e,t)=>e<=t),lr(`>=`,(e,t)=>e>=t),W(`..`,2,e=>({kind:`Interval`,low:ar(U(e,0,`..`),xu),high:ar(U(e,1,`..`),xu)}))],wu=[Kn(`Int`,{kind:`InfiniteSet`,name:`Int`}),W(`-.`,1,e=>{let t=ar(U(e,0,`-`),Su);if(Xn(-t))throw Zn(`-${t}`);return-t})],Tu=(e,t,n)=>{let r=U(e,t,n),i=Yt(r);if(!i)throw new p(`${n}\n${H(r)}`);return i},Eu=(e,t,n)=>{let r=U(e,t,n);return typeof r==`string`?r:Tu(e,t,n)},Du=(e,t,n)=>typeof e==`string`?Oe(e.slice(t,n)):I(e.slice(t,n)),Ou=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,ku=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Au=(e,t)=>{let n=du.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?ir(e,t):e}):t},ju=Au(`Sequences`,[W(`Seq`,1,e=>({kind:`SequenceSet`,base:U(e,0,`Seq`)})),W(`Len`,1,e=>Eu(e,0,Ou(``,`Len`)).length),W(`\\o`,2,e=>{let t=Eu(e,0,ku(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Tu(e,1,ku(`t \\o s`,`sequence`));return I([...t,...n])}let n=U(e,1,`\\o`);if(typeof n!=`string`)throw new p(`${ku(`t \\o s`,`string`)}\n${H(n)}`);return Oe(t+n)}),W(`Append`,2,e=>I([...Tu(e,0,ku(`Append(s, v)`,`sequence`)),U(e,1,`Append`)])),W(`Head`,1,e=>{let t=Tu(e,0,Ou(``,`Head`));if(t.length===0)throw new p(`Attempted to apply Head to the empty sequence.`);return t[0]}),W(`Tail`,1,e=>{let t=Eu(e,0,Ou(``,`Tail`));if(t.length===0)throw new p(`Attempted to apply Tail to the empty sequence.`);return Du(t,1)}),W(`SubSeq`,3,e=>{let t=Eu(e,0,Ou(`first `,`SubSeq`)),n=Ln(e,1,`SubSeq`),r=Ln(e,2,`SubSeq`);if(n>r)return Du(t,0,0);let i=n<1?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new p(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${H(U(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Du(t,n-1,r)}),qn(`SelectSeq`,2,e=>{let t=Gn(e,1,`SelectSeq`);return I(Tu(e,0,Ou(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new p(`The second argument of SelectSeq should be a operator, but instead it is:\n${H(n)}`);return n}))})]),Mu=Au(`FiniteSets`,[W(`IsFiniteSet`,1,e=>{let t=U(e,0,`IsFiniteSet`);if(k(t))return qt(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new f(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${H(t)}\nis a finite set.`:`Attempted to check if the ${he(t)} ${H(t)} is a finite set.`)}),W(`Cardinality`,1,e=>{let t=U(e,0,`Cardinality`);if(!k(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new p(`Attempted to compute cardinality of the value\n${H(t)}`);return Gt(t)})]),Nu=/* @__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`]]]),Pu=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:Cu};case`Integers`:return{extends:[`Naturals`],operators:wu};case`Sequences`:return{extends:[],operators:ju};case`FiniteSets`:return{extends:[],operators:Mu};case`TLC`:return{extends:[],operators:Au(`TLC`,iu(t,n))};case`Randomization`:return{extends:[],operators:Il(n)};case`_Possible`:return{extends:[],operators:Zl(t,n)};case`Json`:return{extends:[],operators:Al(r)};case`Bags`:return{extends:[],operators:ll};case`TLCExt`:return{extends:[],operators:Xl(t,n)};default:return}},Fu=`$subexpression`,Iu=(e,t)=>new u(`${e} at line ${t.line}, column ${t.column}`),Lu=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Ru=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,zu=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}},Bu=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Pr(e.bounds),body:e.body,sets:Lu(e.bounds)};case`SetMap`:return{names:Pr(e.bounds),body:e.expression,sets:Lu(e.bounds)};case`SetFilter`:return{names:Nr(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Nr(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}},Vu=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Vu(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Ja(e)){let e=Vu(r,t,n);if(e)return e}},Hu=(e,t,n)=>e.length===0&&n.length>0?n.splice(0,t):e,Uu=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Wu=(e,t)=>{let n=e.location,r=Uu(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 Iu(`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 Iu(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Fu,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Fu,args:e.args,location:n,resolution:Cr},location:n}},Gu=(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:Cr})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Cr}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Cr};return Wu({...t,params:[...t.params,...r]},a)},Ku=(e,t,n,r)=>{let i={params:[],args:[],lets:[],location:n},a={index:0,current:void 0},o=i=>{let o=[],s=[];for(;a.index<e.length;){let c=e[a.index];if(c.kind!==`Name`)throw Iu(`Expected an operator name`,n);o.push(c.name),s.push(...c.args);let l=o.join(`!`),u=i?i.find(e=>gi(e)===l):t(l);if(u)return{definition:u,args:Hu(s,Or(u),r)};a.index++}throw Iu(`Unknown operator ${o.join(`!`)}`,n)},s=t=>{let r=o(t),s=r.definition,c=Or(s),l=a.index===e.length-1;if(r.args.length!==c&&r.args.length!==0)throw Iu(`The operator ${s.name} requires ${c} arguments`,n);if(l)return{definition:s,args:r.args};if(s.kind!==`Operator`)throw Iu(`Cannot select a subexpression of ${s.name}`,n);i.params.push(...s.params),i.args.push(...r.args),a.current=s.body,a.index++},c=()=>{for(;a.index<e.length;){let t=e[a.index];if(t.kind!==`Name`)return;let o=a.current&&Vu(a.current,t.name,[]);if(!o)throw Iu(`Cannot find label ${t.name}`,n);i.lets.push(...o.lets),i.params.push(...o.label.params.map(e=>({name:e,arity:0}))),i.args.push(...Hu(t.args,o.label.params.length,r)),a.current=o.label.body,a.index++}},l=t=>{let o=a.current;if(!o)throw Iu(`Subexpression selection failed`,n);if(t.kind===`Colon`)return;if(o.kind===`Label`){a.current=o.body,l(t);return}if(o.kind===`Let`){if(t.kind!==`Operand`||Ru(t.operand,1)!==0)throw Iu(`A LET/IN expression has only one operand`,n);i.lets.push(o.definitions),a.current=o.body;return}let s=Bu(o);if(s&&(t.kind===`Bound`||t.kind===`At`)){i.params.push(...s.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&i.args.push(...Hu(t.args,s.names.length,r)),a.current=s.body;return}if(o.kind===`Case`&&t.kind===`Operand`){let r=[...o.arms,...o.other?[{condition:void 0,body:o.other}]:[]],i=r[Ru(t.operand,r.length)],s=e[a.index+1];if(!i||s?.kind!==`Operand`)throw Iu(`A subexpression of CASE must have the form !i!j`,n);a.index++;let c=Ru(s.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw Iu(`Nonexistent CASE operand`,n);a.current=l;return}if(t.kind!==`Operand`)throw Iu(`Unexpected subexpression selector`,n);let c=s?s.sets:zu(o),u=c?.[Ru(t.operand,c.length)];if(!u)throw Iu(`Nonexistent operand specified by the selector`,n);a.current=u},u=s(void 0);if(u)return Gu(u.definition,{...i,args:u.args});for(c();a.index<e.length;){let t=e[a.index];if(t.kind===`Name`){for(;a.current?.kind===`Label`;)a.current=a.current.body;if(a.current?.kind!==`Let`)throw Iu(`A name selector here must be from a LET clause`,n);i.lets.push(a.current.definitions);let e=s(a.current.definitions);if(e)return Gu(e.definition,{...i,args:[...i.args,...e.args]});c()}else l(t),a.index++}if(!a.current)throw Iu(`Subexpression selection failed`,n);return Wu(i,a.current)},qu=(e,t)=>{if(!e.includes(`!`)||t(e))return;let n=e.split(`!`),r=n.findIndex((e,r)=>t(n.slice(0,r+1).join(`!`)));if(r!==-1)return[{kind:`Name`,name:n.slice(0,r+1).join(`!`),args:[]},...n.slice(r+1).map(e=>({kind:`Name`,name:e,args:[]}))]},Ju=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Ja(e).some(Ju),Yu=(e,t)=>{if(!Ju(e))return e;if(e.kind===`Let`){let n=n=>e.definitions.find(e=>e.name===n)??t(n);return yi(e,e=>Yu(e,n))}let n=yi(e,e=>Yu(e,t));if(n.kind===`Subexpression`)return Ku(n.selectors,t,n.location,[]);let r=n.kind===`Identifier`?n.name:n.kind===`Apply`?n.operator:``,i=qu(r,t);if(!i)return n;let a=n.kind===`Apply`?[...n.args]:[],o=Ku(i,t,n.location,a);if(a.length>0)throw Iu(`Too many arguments for ${r}`,n.location);return o},Xu=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Zu=(e,t)=>{let n=Xu(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({name:e.name,expression:Yu(e.expression,n)}))}},Qu=(e,t)=>{let n=Xu([...t,...e.definitions]);return e.definitions.some(e=>Ju(e.body))||e.assumptions.some(e=>Ju(e.expression))?{...e,definitions:e.definitions.map(e=>vi(e,e=>Yu(e,n))),assumptions:e.assumptions.map(e=>({...e,expression:Yu(e.expression,n)}))}:e},$u=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),ed=(e,t)=>`${e}${t}`,td=(e,t,n)=>`${e}${t}${n}`,nd=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},rd=(e,t,n)=>`${e},${t},${n}`,id=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),ad=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),od=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),sd=(e,t,n,r)=>({...id(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),cd=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,ld=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,ud=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,{...sd(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),dd=sd(`$Set`,0,[2],[1]),fd=sd(`$Junction`,0,[3],[1]),pd=sd(`$Choose`,0,[2],[1]),md=sd(`$Function`,0,[3],[1]),hd=sd(`$FcnApply`,0,[2,2],[1,1]),gd=sd(`$RcdSelect`,0,[2,0],[1,1]),_d=sd(`'`,2,[1],[0]),vd=sd(`ENABLED`,1,[2],[0]),yd=sd(`[]`,3,[3],[0]),bd=sd(`$SquareAct`,2,[2,1],[0,0]),xd=sd(`$WF`,3,[1,2],[0,0]),Sd=sd(`$TemporalExists`,3,[3],[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)=>new u(`${e} at line ${t.line}, column ${t.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:_(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i)return{kind:`Defined`,levels:_(i,/* @__PURE__ */ new Map)};let a=ud.get(t)??$u.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=id(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(td(e,n,t))}),t.data.constraints.forEach((e,t)=>ad(r.constraints,t,e)),od(r.argConstraints,ed(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>od(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>cd(e,n))throw new u(`Level error in applying operator ${e.name}: The level of argument ${n+1} exceeds the maximum level allowed by the operator.`)}),n.some(e=>e.level>2))throw new u(`Level error in applying operator ${e.name}: The level of the range for a bounded variable exceeds the maximum level allowed by the operator.`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(rd(t,n,r)),s=id(Math.max(e.level,...t.filter((t,n)=>ld(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{ld(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>ad(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||ad(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>ad(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||ad(s.constraints,t,cd(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>ad(s.constraints,e,cd(r,a)))}))}),e.argParams.forEach(e=>{let t=nd(e),n=a(t.operator)?.operator;n&&ad(s.constraints,t.param,cd(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>od(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>od(s.argConstraints,ed(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&od(s.argConstraints,ed(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=nd(e),n=a(t.operator);n&&od(s.argConstraints,ed(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(nd(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=nd(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(td(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(td(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(td(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=g(`LAMBDA`,wd(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=id();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=Cd(n,wd(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),l=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Td(`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 Td(`Action used where only temporal formula or state predicate allowed`,e.location);Ed.has(e.operator)&&l(t,e.location)},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.location)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=_(e,n);t.constraints.forEach((e,t)=>ad(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>od(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return id();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return l(n,e.location),i(fd,n)}case`Prime`:case`Unchanged`:return s(_d,[e.expression],t);case`Enabled`:return s(vd,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(yd,[n])}case`If`:return s(fd,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(fd,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=s(fd,[e.body],t,e.bounds.map(e=>e.set),Pr(e.bounds));if(n.level===3&&e.bounds.some(e=>m(e.set,t).level===2))throw Td(`Action-level bound of quantified temporal formula`,e.location);return n}case`UnboundedQuantifier`:return s(e.isTemporal?Sd:fd,[e.body],t,[],e.names);case`Choose`:return s(pd,[e.body],t,e.set?[e.set]:[],Nr(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(dd,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(dd,[e.predicate],t,[e.bound.set],Nr(e.bound.pattern));case`SetMap`:return s(dd,[e.expression],t,e.bounds.map(e=>e.set),Pr(e.bounds));case`FunctionConstruction`:return s(md,[e.body],t,e.bounds.map(e=>e.set),Pr(e.bounds));case`Record`:return s(md,e.fields.map(e=>e.value),t);case`RecordSet`:return s(dd,e.fields.map(e=>e.value),t);case`Except`:return s(dd,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(hd,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(dd,e.args,t)}]);case`FieldAccess`:return i(gd,[a(e.record,t),{data:id()}]);case`BoxAction`:case`AngleAction`:return s(bd,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(xd,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return id()}},h=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>h(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return Ja(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 yi(e,(e,n)=>(a(e,r,Cd(t,wd(n))),e)),i}},g=(e,t,n,r)=>{let i=Cd(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=h(n,i),c={...id(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(ed(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(td(e.name,n,t.name))).map(e=>rd(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(nd(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=nd(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},_=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...id(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=g(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:_,toOperand:a}},kd=(e,t,n)=>{let r=new Map(t);e.assumptions.forEach(e=>{e.kind===`NewSymbol`?(e.set&&n.analyze(e.set,r),r.set(e.name,{kind:`Formal`,arity:e.arity})):e.kind===`AssumeProve`?kd(e,r,n):n.analyze(e,r)}),n.analyze(e.conclusion,r)},Ad=(e,t)=>{let n=Od(t);e.definitions.filter(e=>!e.name.includes(`!`)).forEach(e=>n.analyzeDefinition(e,/* @__PURE__ */ new Map)),e.assumptions.forEach(e=>n.analyze(e.expression,/* @__PURE__ */ new Map)),e.theorems.forEach(e=>e.statement.kind===`AssumeProve`?kd(e.statement,/* @__PURE__ */ new Map,n):n.analyze(e.statement,/* @__PURE__ */ new Map))},jd=(e,t)=>e.maxLevels[t]??3,Md=(e,t)=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Od({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>ad(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>ad(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>od(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=nd(e);t(n.operator,n.param)&&c.argParams.add(e)})};return s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n))),a.assumptions.forEach(e=>l(o.analyze(e,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c},o=/* @__PURE__ */ new Set;if(e.forEach(e=>{let n=`at line ${e.location.line}, column ${e.location.column}`,i=e=>o.add(`${e} ${n}`),s=t(e.module),c=a(e.module),l=r(e.instancer),u=/* @__PURE__ */ new Map;e.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(t=>{let n=e.substitutions.get(t.name);if(!n)return[];if(t.arity===0){let e=l.analyze(n,u);return[{...t,level:e.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...t,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(t,n)=>`Level error in instantiating module '${e.module}': the level of the expression or operator substituted for '${t}' must be at most ${n}`;d.forEach(t=>{!c.isConstant&&t.level>t.maximumLevel&&i(f(t.name,t.maximumLevel)),t.isLeibniz||i(`Error in instantiating module '${e.module}': a non-Leibniz operator substituted for '${t.name}'`)}),d.forEach(t=>{let n=c.constraints.get(t.name);n!==void 0&&t.level>n&&i(f(t.name,n));let r=t.operator;r&&Array.from({length:t.arity},(n,a)=>{let o=c.argConstraints.get(ed(t.name,a));o!==void 0&&jd(r,a)<o&&i(`Level error in instantiating module '${e.module}': the level of the argument ${a+1} of the operator ${r.name} must be at least ${o}`)})}),c.argParams.forEach(t=>{let n=nd(t),r=d.find(e=>e.name===n.operator)?.operator,a=d.find(e=>e.name===n.param);if(!r||!a)return;let o=jd(r,n.index);a.level>o&&i(`Level error when instantiating module '${e.module}': the level of the argument ${n.index} of the operator ${n.operator}' must be at most ${o}`)})}),o.size>0)throw new u([...o].join(`
|
|
406
|
-
`))},Nd=t=>{switch(t.kind){case`Number`:try{return ge(t.value)}catch(t){throw a(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Le(t.name);case`Set`:return ht(t.elements.map(Nd))}},Pd=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],Fd=e=>new u(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Id=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Cr},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),Ld=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>H(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 f(`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`)&&Be(t,r)})});if(t)return t[1];throw new f(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:H(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Rd=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Ja(e).some(e=>Rd(e,t)),zd=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Oi(e),n.get(e)??n.size)),n},Bd=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Vd=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Va(e);if(e.kind===`Number`&&!Mo(e.value))throw Ha(e);Vd(e.kind===`Let`?[...Ja(e),...Bd(e.instances??[])]:Ja(e))}),Hd=(e,t)=>{let n=ac(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=new Map(bu.map(e=>[e.name,e])),o=/* @__PURE__ */ new Map,s=Bc(e.checkDeadlock,t.seed),c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,f=[],p=/* @__PURE__ */ new Map,m=[],h=[],g=(e,t)=>m.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),_={value:0},v=e=>`${e}#${_.value++}`,y=[],b=/* @__PURE__ */ new Map,ee=e=>{let n=o.get(e);if(n)return n;let r=Pu(e,t.print,s,t.files);if(!r)return;let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>ee(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(e=>{a.set(e.name,e),i.set(e.name,{key:e.name,arity:e.arity})}),o.set(e,i),i},x=e=>{let t=ee(e);return t&&g(e,Nu.get(e)??[]),t},te=e=>(Vd([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...Bd(e.instances)]),e.modules.forEach(te),e);te(n);let ne=(e,n)=>{let r=t.loadModule?.(e)??Es.get(e)??rc(t.source,e);if(r===void 0)throw new u(`Cannot find source file for module ${e} imported in module ${n}.`);let i=ac(r);if(i.name!==e)throw new u(`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`);return te(i)},re=e=>{let t=h.indexOf(e.name);if(t!==-1)throw new u(`Circular dependency among .tla files; dependency cycle is: ${[...h.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];h.push(e.name),m.push(n);let i=E(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});m.pop(),h.pop();let a=r.find(e=>n.has(e.name));if(a)throw Fd(a);return{linked:i,closure:n}},S=(e,t)=>{let n=c.get(e);if(n)return g(e,p.get(e)??[]),n;let r=re(ne(e,t));return c.set(e,r.linked),p.set(e,r.closure),g(e,r.closure),r.linked},ie=(e,t,n,a,o)=>{let s=o?void 0:x(e.module);if(s)return e.name===void 0?s:new Map([...s].map(([t,n])=>[`${e.name}!${t}`,n]));let c=o??S(e.module,t.name),l=Pd(c),u=`#${_.value++}`,d=new Map(e.params.map(e=>[e.name,`${e.name}${u}`])),f=li(Zu(e,t),l,t,n);y.push({module:e.module,instancer:t.name,lets:[],substitutions:f,location:e.location});let p=Bi({params:e.params.map(e=>({...e,name:`${e.name}${u}`})),substitutions:new Map([...f].map(([e,t])=>[e,pi(t,d)])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(e,n)=>{let o=v(`${e}@${t.name}`);return r.set(o,n(o)),i.set(o,!a),o},createName:v}),m=new Set(l.map(e=>e.name)),h=/* @__PURE__ */ new Map;return c.exported.forEach((t,n)=>{if(m.has(n))return;if(e.name===void 0){let r=p.getKey(t.key);l.length>0&&b.set(r,{name:n,location:e.location}),h.set(n,{key:r,arity:t.arity});return}let r=p.getQualifiedKey(t.key);l.length>0&&b.set(r,{name:`${e.name}!${n}`,location:e.location}),h.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length})}),h},ae=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Cr})),oe=(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:ae(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),C=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),w=(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=C(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:ae(r,n),location:n}}},T=(e,t,n,a)=>{let o=e.location,s=a?void 0:x(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=C(n.arity);return oe(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??S(e.module,n),l=`#${_.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Pd(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};y.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>Rd(f(e),p),h=d.map(t=>{let n=w(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=[],b=Bi({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:ae(e.params,o),location:o,resolution:Cr}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Cr}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n)=>{let r=`${t}@${e.module}${l}.${g.length}`,i=n(r);return g.push(i.kind===`Operator`?{...i,name:r}:Id(i,r)),r},createName:v}),ee=new Set(d.map(e=>e.name)),te=[...c.exported].filter(([e])=>!ee.has(e)).map(([t,n])=>{let r=b.getKey(n.key),i=C(n.arity),a=[...e.params,...i];return oe(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...te]},se=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),E=(e,a)=>{let o=Ps(e,t.loadClass?.(e.name)),s=new Map([...bu.map(e=>[e.name,{key:e.name,arity:e.arity}]),...a.symbols]),c=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=[],p=[...o.constants],m=o.variables.map(e=>e.name),h=o.variables.map(e=>e.location),g=(e,t)=>e.forEach((e,n)=>{s.set(n,e),t&&c.set(n,e)});o.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:x(e);if(n){g(n,!0);return}let r=t??S(e,o.name);p.push(...r.constants.filter(e=>p.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{m.includes(e)||(m.push(e),h.push(r.variableLocations[t]))}),g(r.exported,!0),r.modules.forEach((e,t)=>u.set(t,e)),d.push(r)}),o.constants.forEach(e=>c.set(e.name,{key:e.name,arity:e.arity,declaration:`Constant`})),o.variables.forEach(e=>c.set(e.name,{key:e.name,arity:0,declaration:`Variable`}));let _=p.length===0&&m.length===0,v=e=>o===n?e.name:`${e.name}@${a.id}`,y=/* @__PURE__ */ new Map,b=e=>({imported:s,importedAt:y,definitions:new Map(e.definitions.map(e=>[e.name,e])),getKey:v}),ee=()=>new Map([...a.modules,...u]),te=e=>new Map([...s,...[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))].filter(t=>Dr(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>Dr(t.location,e)).map(e=>[e.name,{key:v(e),arity:Or(e)}])]),ne=e=>{let t=ee();if(t.has(e.name))throw Fd(e);a.nested.push(e);let n=E(e,{id:`${a.id}/${e.name}`,symbols:te(e.location),modules:t,nested:a.nested});u.set(e.name,n),l.has(e.name)||l.set(e.name,n)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=ie(e,o,b(o),_,ee().get(e.module));t.forEach((t,n)=>{s.has(n)||y.set(n,e.location)}),g(t,!e.isLocal)}})),...o.modules.map(e=>({location:e.location,link:()=>ne(e)}))].sort((e,t)=>Dr(e.location,t.location)?-1:1).forEach(e=>e.link()),si(o,b(o));let re=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&Dr(e.location,t.location)},ae=e=>{let t=o.modules.find(t=>t.name===e.module);return t?re(t)?u.get(t.name):void 0:ee().get(e.module)},oe=Qu(Wi(o,(e,t)=>T(e,t,o.name,ae(e))),se(s));ui(oe,b(oe)),oe.definitions.forEach(e=>{let t=v(e);r.set(t,e),i.set(t,!_);let n={key:t,arity:Or(e)};s.set(e.name,n),e.isLocal||c.set(e.name,n)}),Ad(oe,{constants:new Set(p.map(e=>e.name)),variables:new Set(m),getDefinition:e=>r.get(s.get(e)?.key??e)});let C={module:oe,constants:p,variables:m,variableLocations:h,visible:s,exported:c,modules:u,extended:d};return f.push(C),C},D=re(n).linked,ce=e=>D.visible.get(e)?.key??e;D.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let O=[],le=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>le(e,t)),O.push(...e.module.assumptions))};le(D,/* @__PURE__ */ new Set);let ue=D.constants.map(e=>e.name),de=D.variables,fe=e=>e.module===void 0?[e.name,ce(e.name)]:e.module===n.name||ue.includes(e.name)?[]:[(c.get(e.module)??l.get(e.module))?.visible.get(e.name)?.key??e.name],pe=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:D.constants.find(t=>t.name===e)?.arity??0},me=/* @__PURE__ */ new Map,k=/* @__PURE__ */ new Set,A=(e,t)=>{a.set(e,t),r.delete(e),me.delete(e),k.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Nd(e.value);fe(e).forEach(e=>{let n=pe(e);n===0?me.set(e,t):A(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let j=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=j.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new d(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(Nd),Nd(e.value)]),j.set(t,n)}),j.forEach(e=>fe(e).forEach(t=>A(t,Ld(e.name,pe(t)||e.rows[0][0].length,e.rows))));let he=new Map(e.substitutions.flatMap(e=>fe(e).map(t=>[t,ce(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!ue.includes(n)&&!D.visible.has(n))throw new d(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new d(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let o=ce(i),s=r.get(o);if(!(s!==void 0||a.has(o)||me.has(o)||ue.includes(i)||de.includes(i)))throw new d(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(D.constants.find(e=>e.name===n)?.arity??D.visible.get(n)?.arity))throw new d(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)}),ue.forEach(e=>{if(!me.has(e)&&!he.has(e)&&!k.has(e))throw new d(`The constant ${e} is not assigned a value by the configuration`)});let ge={runtime:s,definitions:r,builtins:a,constants:me,substitutions:he,variables:de,variableIndex:zd(de,f.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap};return Md(y,e=>{let t=c.get(e)??l.get(e)??D;return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),getDefinition:e=>r.get(t.visible.get(e)?.key??e)}}),he.forEach((e,t)=>{let n=r.get(e);if(ue.includes(t)&&n&&!Za(n,ge))throw new d(`The configuration file substitutes constant ${t} with non-constant ${e}`)}),{environment:ge,assumptions:O,variableLocations:D.variableLocations,instanceActions:b}},Ud={kind:`Boolean`,value:!0},Wd={kind:`Boolean`,value:!1},Gd=e=>e?Ud:Wd,Kd=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,qd=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Q=(e,t)=>({kind:e,body:t}),Jd=(e,t,n)=>({kind:e,operands:[t,n]}),Yd=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Yd(e,t.operands).operands:[t])}),Xd=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Xd(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Xd(t)),0)}},Zd=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 Zd(e.body);case`And`:case`Or`:return e.operands.some(Zd)}},Qd=(e,t)=>e.kind===t.kind?e.kind===`Boolean`&&t.kind===`Boolean`?e.value===t.value:Kd(e)?e===t:`body`in e&&`body`in t?Qd(e.body,t.body):`operands`in e&&`operands`in t&&e.operands.length===t.operands.length&&e.operands.every((e,n)=>Qd(e,t.operands[n])):!1,$d=(e,t)=>e.some(e=>Qd(e,t)),ef=e=>e===`And`?`Or`:`And`,tf=(e,t)=>{switch(e.kind){case`Boolean`:return t?Gd(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Q(`Not`,e):e;case`Not`:return tf(e.body,!t);case`And`:case`Or`:return Yd(t?ef(e.kind):e.kind,e.operands.map(e=>tf(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Q(n,tf(e.body,t))}}},nf=e=>{switch(e.kind){case`Boolean`:return Gd(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Yd(ef(e.kind),e.operands.map(nf));case`Always`:return Q(`Eventually`,nf(e.body));case`Eventually`:return Q(`Always`,nf(e.body));default:return Q(`Not`,e)}},rf=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=rf(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Gd(t)}return n.length===0?Gd(!t):n.length===1?n[0]:Yd(e.kind,n)}case`Not`:{let t=rf(e.body);return t.kind===`Boolean`?Gd(!t.value):Q(`Not`,t)}case`Always`:case`Eventually`:{let t=rf(e.body);return Q(e.kind,t.kind===e.kind?t.body:t)}default:return e}},af=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,of=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=of(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new f(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>Yd(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=of(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=af(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:Yd(`Or`,t);n.push(Q(`Always`,Q(`Eventually`,e)))}return Yd(`Or`,n)}case`Not`:return Kd(e.body)?e:of(nf(e.body));default:return e}},sf=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?sf(e.operands[0]):Yd(e.kind,e.operands.map(sf));case`Not`:return e.body.kind===`Not`?sf(e.body.body):Q(`Not`,sf(e.body));case`Always`:case`Eventually`:case`Next`:return Q(e.kind,sf(e.body));default:return e}},cf=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return cf(e.operands[0]);let t=Math.floor(e.operands.length/2);return Jd(e.kind,cf(Yd(e.kind,e.operands.slice(0,t))),cf(Yd(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Q(e.kind,cf(e.body));default:return e}},lf=(e,t)=>{e.kind===`Eventually`&&!$d(t,e)&&t.push(e),`body`in e&&lf(e.body,t),`operands`in e&&e.operands.forEach(e=>lf(e,t))},uf=e=>{let t=e.filter(qd),n=e.flatMap(e=>e.kind===`Not`&&qd(e.body)?[e.body]:[]);return!t.some(e=>$d(n,e))},df=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,Q(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new f(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},ff=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Q(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},pf=(e,t,n)=>e.flatMap(e=>{let r=ff(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),mf=(e,t)=>e.every(e=>$d(t,e))&&t.every(t=>$d(e,t)),hf=(e,t)=>[...e.filter(e=>!t.some(t=>mf(e,t))),...t],gf=e=>{let t=df(e),n=pf(t,`Always`,`And`),r=pf(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=ff(t,`Eventually`,`Or`);if(n&&!($d(e,n.first)||$d(e,n.second)))return hf(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>($d(e,t.first)||$d(e,t.second))&&!$d(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!uf(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=ff(t[e],`Always`,`And`);n&&($d(t,n.first)||t.push(n.first),$d(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)$d(t,e.first)&&$d(t,e.second)&&!$d(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!uf(t)?[]:i(t)};return a(e)},_f=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Xd(e)<=1)}),vf=e=>{let t=gf([e]).map(_f),n=t.length;for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let r of gf(n)){let n=t.findIndex(e=>mf(e.particle,r));n===-1&&t.push(_f(r)),t[e].successors.push(n===-1?t.length-1:n)}}return{nodes:t,initialCount:n}},yf=(e,t)=>!$d(e,t)||$d(e,t.body),bf=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&Xd(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=af(e);if(n){let e=Xd(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Zd(e))throw new f(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},xf=(e,t)=>{let n=e.findIndex(e=>Qd(e,t));return n===-1?(e.push(t),e.length-1):n},Sf=e=>{let t=of(rf(tf(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=sf(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])bf(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Yd(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Qd(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&cf(e.formula),n=[];t&&lf(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>xf(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>xf(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>xf(i,e))}));return{tableau:t&&vf(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Cf=/* @__PURE__ */ new Set([`~>`,`-+->`]),wf=/* @__PURE__ */ new WeakMap,Tf=/* @__PURE__ */ new WeakSet,Ef=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Df=e=>new f(`TLC cannot handle the temporal formula at ${q(e)}`),$=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Ua(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return $(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?$(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Ya(e,n);if(t)return Of(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?+!!r.isStateLevel:void 0},o=(e,t)=>r.has(e)?0:J(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return yi(e,(e,a)=>(i.value=Math.max(i.value,$(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Cf.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Of=(e,t)=>{let n=wf.get(e);if(n!==void 0)return n;wf.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max($(e.body,void 0,t),...r.map(e=>$(e.set,void 0,t)));return wf.set(e,i),i},kf=(e,t,n,r,i=/* @__PURE__ */ new Set)=>{let a=(e,t,a=i)=>kf(e,t,n,r,a);if(e.kind===`And`)return e.operands.flatMap(e=>a(e,t));if(e.kind===`Label`)return a(e.body,t);if(e.kind===`Let`)return a(e.body,Af(e,t,n));if(e.kind===`Identifier`){let r=J(e)?Ua(t,e.name):void 0;if(r?.kind===`Thunk`)return a(r.expression,r.scope);let o=n.constants.has(e.name)?void 0:Ya(e.name,n);if(!r&&o?.kind===`Operator`&&o.params.length===0&&Of(o,n)>0){if(i.has(o))throw new d(`The definition of ${e.name} refers to itself`);return a(o.body,void 0,/* @__PURE__ */ new Set([...i,o]))}}let o=Ef(n,t);if(e.kind===`Apply`&&$(e,t,n)===3){let t=go(e,o),r=J(e)?void 0:Ya(e.operator,n);if(t?.kind===`Closure`&&!r?.isRecursive)return a(t.body,Oo(t,e.args,o))}if(r&&e.kind===`Forall`&&$(e.body,t,n)===3&&e.bounds.every(e=>$(e.set,t,n)===0)){let t=[];return eo(e.bounds,o,n=>(t.push(...a(e.body,n)),!1)),t}return[{expression:e,scope:t}]},Af=(e,t,n)=>{let r=Ao(e.definitions,Ef(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Tf.add(e.binding);return r},jf=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),Mf=(e,t,n)=>{let r=(e,t,r)=>{let i=r===0?$(e,t,n):r;if(i===0){let r=X(e,Ef(n,t));if(typeof r!=`boolean`)throw new f(`TLC expected a boolean in the temporal formula at ${q(e)}`);return Gd(r)}return i===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},i={depth:0},a=(e,t,n,a)=>{if(i.depth>=100)throw new f(`TLC overflowed the stack while expanding the temporal formula at ${q(n)}`);i.depth++;let o=c(e,t);i.depth--;let s=Xd(o);return s>2?o:r(n,a,s)},o=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,i=Ef(n,t),o=J(e)||Ya(r,n)===void 0?Ua(t,r):void 0;if(o?.kind===`Thunk`&&Tf.has(o))return a(o.expression,o.scope,e,t);let s=o?.kind===`Operator`?o.operator:o?void 0:J(e)?_o(r,i):mo(r,n);if(s?.kind!==`Closure`)throw Df(e);let c=e.kind===`Apply`?e.args:[];return a(s.body,Oo(s,c,i),e,t)},s=(e,t)=>{if(!e.bounds.every(e=>$(e.set,t,n)===0))throw Df(e);let i=[];eo(e.bounds,Ef(n,t),t=>(i.push(c(e.body,t)),!1));let a=e.kind===`Forall`;if(i.length===0)return Gd(a);let o=Yd(a?`And`:`Or`,i),s=Xd(o);return s>2?o:r(e,t,s)},c=(e,t)=>{let i=$(e,t,n);if(i<=2)return r(e,t,i);switch(e.kind){case`Label`:return c(e.body,t);case`Let`:return c(e.body,Af(e,t,n));case`Identifier`:return o(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Q(`Always`,Jd(`Or`,Q(`Not`,c(n[0],t)),Q(`Eventually`,c(n[1],t)))):e.operator===`~`&&!J(e)?Q(`Not`,c(n[0],t)):e.operator===`=>`?Jd(`Or`,Q(`Not`,c(n[0],t)),c(n[1],t)):o(e,t)}case`And`:case`Or`:return Yd(e.kind,e.operands.map(e=>c(e,t)));case`Forall`:case`Exists`:return s(e,t);case`If`:{if($(e.condition,t,n)===0){let r=X(e.condition,Ef(n,t));if(typeof r==`boolean`)return c(r?e.consequent:e.alternative,t)}let r=c(e.condition,t);return Jd(`Or`,Jd(`And`,r,c(e.consequent,t)),Jd(`And`,Q(`Not`,r),c(e.alternative,t)))}case`Always`:case`Eventually`:return Q(e.kind,c(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=jf(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Q(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?Q(`Always`,Q(`Eventually`,Jd(`Or`,i,a))):Jd(`Or`,Q(`Eventually`,Q(`Always`,i)),Q(`Always`,Q(`Eventually`,a)))}default:throw Df(e)}};return c(e,t)},Nf=(e,t,n,r,i)=>{let a=e=>Nf(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?qa(X(e.expression,a),`a temporal property predicate`):ka(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&qa(X(e.unchanged,a),`a subscript`)?!1:qa(X(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return Nf(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new f(`TLC cannot evaluate a temporal formula in a single step`)}},Pf=(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)=>Pf(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 Nf(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Ff=/* @__PURE__ */ new WeakMap,If={value:0},Lf=e=>{let t=Ff.get(e);if(t!==void 0)return t;let n=e.kind===`Boolean`?String(e.value):`body`in e?`${e.kind}(${Lf(e.body)})`:`operands`in e?`${e.kind}(${e.operands.map(Lf).join(`,`)})`:`${e.kind}#${If.value++}`;return Ff.set(e,n),n},Rf=(e,t)=>e.every((e,n)=>He(e,t[n])),zf=(e,t,n)=>{let r=new Int32Array(e).fill(-1),i=new Int32Array(e),a=new Uint8Array(e),o=[],s={value:0},c=/* @__PURE__ */ new Map,l=e=>{let n=c.get(e);if(n)return n;let r=t(e);return c.set(e,r),r};for(let t=0;t<e;t++){if(r[t]!==-1)continue;let e=[],u=t=>{r[t]=s.value,i[t]=s.value++,o.push(t),a[t]=1,e.push({node:t,position:0})};for(u(t);e.length>0;){let t=e[e.length-1],s=l(t.node);if(t.position<s.length){let e=s[t.position++];r[e]===-1?u(e):a[e]&&(i[t.node]=Math.min(i[t.node],r[e]));continue}e.pop();let d=e[e.length-1];if(d&&(i[d.node]=Math.min(i[d.node],i[t.node])),i[t.node]!==r[t.node])continue;let f=[];for(;;){let e=o.pop();if(e===void 0||(a[e]=0,f.push(e),e===t.node))break}let p=n(f,l);if(f.forEach(e=>c.delete(e)),p)return}}},Bf=(e,t,n,r)=>{if(e===t)return[e];let i=/* @__PURE__ */ new Map([[e,-1]]),a=[e];for(let e=0;e<a.length;e++)for(let o of r(a[e]))if(!i.has(o)&&n.has(o)){if(i.set(o,a[e]),o===t){let e=[];for(let n=t;n!==-1;n=i.get(n)??-1)e.push(n);return e.reverse()}a.push(o)}return[e]},Vf=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Hf=(e,t,n)=>{if(e.length===0)return;let r=t.map(e=>Mf(e.expression,e.scope,n)),i=e.map(e=>Q(`Not`,Mf(e.expression,e.scope,n))),a=i.length===1?i[0]:Yd(`Or`,i),o=r.length===0?a:Yd(`And`,[...r,a]),s=Sf(o);if(s.length===0)throw new f(`Temporal formula is a tautology (its negation is unsatisfiable)`);let c=s.map(e=>({solution:e,stateResults:[],actionResults:[],consistency:[],product:e.tableau&&{states:[],tableauNodes:[],edges:[],initial:[],parents:[]},productNodes:/* @__PURE__ */ new Map,nodesByState:/* @__PURE__ */ new Map})),l=/* @__PURE__ */ new Map,u=c.map(e=>e.solution.actionChecks.map(e=>{let t=Lf(e),n=l.get(t);return n===void 0?(l.set(t,l.size),l.size-1):n})),d=[],p=[],m=[],h=[],g=(e,t,r)=>e.every(e=>Nf(e,t,void 0,n,r)),_=(e,t,n,r,i)=>{let a=n*(e.solution.tableau?.nodes.length??1)+r,o=e.productNodes.get(a);if(o!==void 0)return{node:o,isNew:!1};let s=t.states.length;e.productNodes.set(a,s),t.states.push(n),t.tableauNodes.push(r),t.edges.push([]),t.parents.push(i);let c=e.nodesByState.get(n);return c?c.push(s):e.nodesByState.set(n,[s]),{node:s,isNew:!0}},v=(t,r)=>{let a=t.map(e=>d[e]);return(e.find((e,t)=>!Pf(i[t].body,a,r,0,n))??e[0]).name},y=(e,t,n,r)=>{let i=e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),a=n.nodes.length,o=(e.nodesByState.get(r)??[]).map(e=>({node:e,isDone:!1}));for(;o.length>0;){let r=o.pop();if(!r)break;let s=t.states[r.node],c=n.nodes[t.tableauNodes[r.node]].successors;if(r.isDone&&i&&c.some(e=>{let t=n.nodes[e];return t.particle.length===0&&t.successors.every(t=>t===e)})){let e=Vf(re(t,r.node).map(e=>t.states[e]));return{name:v(e,e.length-1),path:e}}let l=e.consistency[s];p[s].forEach((n,i)=>{for(let s of c){if(!l[i*a+s])continue;let c=_(e,t,n,s,r.node);t.edges[r.node].push(c.node,i),c.isNew&&p[n]!==void 0&&o.push({node:c.node,isDone:!0})}})}},b=(e,t)=>{h.push(e),d[e]=t;for(let n of c){let r=n.solution.tableau,i=n.product;if(!r||!i)continue;let a=/* @__PURE__ */ new Map;for(let o=0;o<r.initialCount;o++)g(r.nodes[o].statePredicates,t,a)&&i.initial.push(_(n,i,e,o,-1).node)}},ee=(e,t,r)=>{n.runtime.setLivenessSource(e),d[e]=t;let i=[],a=/* @__PURE__ */ new Map;for(let n of[...r,{index:e,state:t}]){let t=a.get(n.index);t!==void 0&&(n.index<e||t.some(e=>Rf(e.state,n.state)))||(i.push(n),t?t.push(n):a.set(n.index,[n]))}p[e]=i.map(e=>e.index),m[e]=i.map(e=>e.state);let o=/* @__PURE__ */ new Map,s=i.map(()=>/* @__PURE__ */ new Map);for(let r of c){let a=r.solution;r.stateResults[e]=Uint8Array.from(a.stateChecks,e=>+!!Nf(e,t,void 0,n,o));let c=a.tableau,l=r.product;if(!c||!l)continue;let u=c.nodes.length,d=new Uint8Array(i.length*u);i.forEach((e,t)=>{c.nodes.forEach((n,r)=>{let i=g(n.statePredicates,e.state,s[t]);d[t*u+r]=+!!i})}),r.consistency[e]=d;let f=y(r,l,c,e);if(f)return f}},x=e=>{n.runtime.setLivenessSource(e);let t=d[e],r=m[e],i=r.map(()=>new Int8Array(l.size).fill(-1));c.forEach((a,o)=>{let s=a.solution,c=u[o],l=a.stateResults[e],d=new Map(s.stateChecks.map((e,t)=>[e,l[t]===1])),f=s.actionChecks.length,p=new Uint8Array(r.length*f);r.forEach((e,r)=>{let a=i[r];for(let i=0;i<f;i++){let o=c[i];if(a[o]===-1){let r=s.actionChecks[i];a[o]=+!!Nf(r,t,e,n,d)}p[r*f+i]=a[o]}}),a.actionResults[e]=p})},te=(e,t)=>(e.actionResults[t]===void 0&&x(t),e.actionResults[t]),ne=e=>e.product??{states:d.map((e,t)=>t),tableauNodes:d.map(()=>-1),edges:Array.from({length:d.length},(e,t)=>(p[t]??[]).flatMap((e,t)=>[e,t])),initial:h,parents:[]},re=(e,t)=>{if(e.parents.length>0){let n=[];for(let r=t;r!==-1;r=e.parents[r])n.push(r);return n.reverse()}let n=new Map(e.initial.map(e=>[e,-1])),r=[...e.initial];for(let i=0;i<r.length&&!n.has(t);i++){let t=e.edges[r[i]];for(let e=0;e<t.length;e+=2)n.has(t[e])||(n.set(t[e],r[i]),r.push(t[e]))}let i=[];for(let e=t;e!==-1;e=n.get(e)??-1)i.push(e);return i.reverse()},S=e=>{let t=e.solution,n=t.tableau,r=ne(e),i=t.actionChecks.length,a=(t,n,a)=>te(e,r.states[t])[n*i+a]===1;for(let i of t.models){let o=(e,t)=>i.eventuallyAlways.every(n=>a(e,t,n)),s=e=>{let t=r.edges[e],n=[];for(let r=0;r<t.length;r+=2)o(e,t[r+1])&&n.push(t[r]);return n},c={value:void 0};if(zf(r.states.length,s,(s,l)=>{let u=new Set(s);if(s.length===1&&!l(s[0]).includes(s[0]))return!1;let d=i.infinitelyOftenStates.map(t=>s.find(n=>e.stateResults[r.states[n]][t]===1)),f=i.infinitelyOftenActions.map(e=>{for(let t of s){let n=r.edges[t];for(let r=0;r<n.length;r+=2)if(u.has(n[r])&&o(t,n[r+1])&&a(t,n[r+1],e))return[t,n[r]]}}),p=t.promises.map(e=>s.find(t=>n!==void 0&&yf(n.nodes[r.tableauNodes[t]].particle,e)));if(!(d.every(e=>e!==void 0)&&f.every(e=>e!==void 0)&&p.every(e=>e!==void 0)))return!1;let m=s[s.length-1],h=[...d.flatMap(e=>e??[]),...f.flatMap(e=>e??[]),...p.flatMap(e=>e??[])],g=[m];for(let e of h)g.push(...Bf(g[g.length-1],e,u,l).slice(1));g.length===1&&!l(m).includes(m)&&g.push(l(m).find(e=>u.has(e))??m);let _=Bf(g[g.length-1],m,u,l);g.push(..._.slice(1,-1));let y=Vf(re(r,m).map(e=>r.states[e])),b=Vf(g.map(e=>r.states[e]));return b.length>1&&b[b.length-1]===b[0]&&b.pop(),y.pop(),c.value={name:v([...y,...b],y.length),prefix:y,cycle:b},!0}),c.value)return c.value}};return{addInitialState:b,addState:ee,findViolation:()=>{for(let e of c){let t=S(e);if(t)return t}}}},Uf=`UnnamedAction`,Wf={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Gf=e=>{let t=e.range??Wf;return jt([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Kf=e=>{let t=[[`name`,e.name],[`location`,Gf(e.location)]];return e.parameters.length===0?jt(t):jt([...t,[`context`,jt(e.parameters)],[`parameters`,I(e.parameters.map(e=>e[0]))]])},qf=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),Jf=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Yf=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Xf=e=>e.kind===`Apply`?e.args:[],Zf=(e,t,n)=>{let r=Yf(e);if(r===void 0)return;if(J(e)){let e=Ua(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=mo(r,n);return i?.kind===`Closure`?i:void 0},Qf=(e,t)=>{try{return X(e,Jf(t,void 0)),!0}catch(e){if(e instanceof l)return!1;throw e}},$f=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Za(e,t)&&Qf(e.body,t),ep=(e,t)=>{let n=Ya(e.name,t);return n?.body===e.body&&$f(n,t)},tp=(e,t)=>{if(e.kind!==`Identifier`||!J(e))return;let n=Ua(t,e.name);return n?.kind===`Thunk`?n:void 0},np=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Ua(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),rp=(e,t)=>{try{return e()}catch(e){if(e instanceof l)return t();throw e}},ip=(e,t,n,r,i)=>{let a=Xf(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>$(e,n,i)!==0)?o():rp(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),X(e,Jf(i,n))]),expression:t,scope:n}],o)},ap=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Uf,location:e.location,parameters:np(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return ap(e.body,Ao(e.definitions,Jf(r,t)),n,r,i);case`Label`:return ap(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>ap(e,t,n,r,i));case`Exists`:return rp(()=>{let o=[];return eo(e.bounds,Jf(r,t),t=>(o.push(...ap(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=J(e)?void 0:i.get(Yf(e)??``),s=Zf(e,t,r);if(o)return ip(o,e,t,s,r);if(!s)return[a()];let c=Xf(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return ep(s,r)||c.some(e=>$(e,t,r)!==0)?l():rp(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:X(n,Jf(r,t))},parent:e}),s.scope);return ap(s.body,e,s,r,i)},l)},op=(e,t,n,r,i)=>{let a=(e,t)=>op(e,t,n,r,i);if(e.kind===`Let`){a(e.body,Ao(e.definitions,Jf(n,t)));return}let o=tp(e,t);if(o){a(o.expression,o.scope);return}let s=Zf(e,t,n);if(s&&ep(s,n))return;if(s&&s.params.length===0){if($(s.body,s.scope,n)===1){r.inits.push(qf(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,Oo(s,e.args,Jf(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(qf(Uf,e));return}let c=$(e,t,n);c<=1?r.inits.push(qf(Uf,e)):c===3&&r.temporals.push(qf(Uf,e))},sp=(e,t,n,r,i)=>{let a=(t,n)=>sp(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Ao(t.definitions,Jf(r,n)));return}let o=tp(t,n);if(o){a(o.expression,o.scope);return}let s=Zf(t,n,r);if(s&&ep(s,r))return;if(s&&s.params.length===Xf(t).length){a(s.body,t.kind===`Apply`?Oo(s,t.args,Jf(r,n)):s.scope);return}if(t.kind===`Forall`&&rp(()=>(eo(t.bounds,Jf(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(qf(e,a)):$(a,n,r)<2?i.invariants.push(qf(e,a)):i.impliedTemporals.push(qf(e,t));return}let c=$(t,n,r);c<=1?i.impliedInits.push(qf(e,t)):c===3&&i.impliedTemporals.push(qf(e,t))},cp=(e,t)=>{let n=Ya(e,t);return n?.kind===`Operator`&&!$f(n,t)?n:void 0},lp=e=>jt([[`name`,e.name],[`location`,Gf(e.location)]]),up=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:cp(e.specification,t);a&&(op(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...ap(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:mo(e.init,t);o?.kind===`Closure`&&r.inits.push(qf(e.init??``,o.body));let s=e.next===void 0?void 0:mo(e.next,t);return s?.kind===`Closure`&&r.actions.push(...ap(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=cp(e,t);n&&r.invariants.push(qf(e,n.body))}),e.properties.forEach(e=>{let n=cp(e,t);n&&sp(e,n.body,void 0,t,r)}),r},dp=(e,t,n)=>up(e,t,n).actions,fp=e=>{let t=e.parameters.map(e=>H(e[1]));return`${e.name===Uf?`Action`:e.name}${t.length===0?``:`(${t.join(`,`)})`} ${Pa(e.location.range??Wf)}`},pp=(e,t,n,r)=>{let i=up(e,t,r),a=e=>ht(e.map(Kf)),o=e=>ht(e.flatMap(e=>{let n=cp(e,t);return n?[lp(n)]:[]}));return jt([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,ht(t.variables.map((e,t)=>jt([[`name`,e],[`location`,Gf(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},mp=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),hp=(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},gp=(e,t)=>{if(!A(e))throw new d(`The symmetry values of ${t} must be functions`);let n=V(e),r=/* @__PURE__ */ new Map;return n.domain.forEach((e,t)=>{let i=n.range[t];if(!j(e)||!j(i))throw new d(`Symmetry function must have model values as domain and range`);e.name!==i.name&&r.set(e.name,i)}),r},_p=(e,t)=>{let n=t.definitions.get(e);if(n?.kind!==`Operator`||n.params.length>0)throw new d(`The symmetry function ${e} must specify a set of permutations`);let r=X(n.body,{environment:t,scope:void 0,state:void 0,next:void 0});if(!k(r)||!L(r))throw new d(`The symmetry operator must specify a set of functions`);let i=R(r).elements.map(t=>gp(t,e));if(n.body.kind===`Apply`&&n.body.args.length>=i.length)return[];let a=/* @__PURE__ */ new Map;i.forEach(e=>{e.size>0&&a.set(mp(e),e)});let o=[...a.values()],s={start:0};for(;s.start<a.size;){let e=[...a.values()],t=e.length;o.forEach(n=>e.slice(s.start,t).forEach(e=>{let t=hp(n,e),r=mp(t);t.size>0&&!a.has(r)&&a.set(r,t)})),s.start=t}let c=Math.max(256,Math.floor(4194304/a.size));return[...a.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:c}))},vp=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=xp(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(xp(e[r],t));return a}},yp=(e,t)=>{let n=[],r=[];for(let i of e){let e=xp(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(F);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(F(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},bp=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,xp=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=bp(e);if(n===0||n>64)return Sp(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=Sp(e,t);return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,i),t.cacheSize++,i},Sp=(e,t)=>{let n=e.kind;if(n===`Set`){let n=yp(e.elements,t);return n?Re(n):e}if(n===`Function`||n===`LazyFunction`&&L(e.domain)){let n=V(e),r=vp(n.domain,t),i=vp(n.range,t)??n.range;return r?xt(r.map((e,t)=>[e,i[t]])):i===n.range?n:ze(n.domain,i)}if(n===`Interval`||!k(e)||!L(e))return e;let r=R(e),i=vp(r.elements,t);return i?ht(i):r},Cp=(e,t,n)=>{for(let r=t.length;r<e.length;r++)t.push(xp(e[r],n));return t},wp=(e,t,n,r)=>{let i=[];for(let a=0;a<e.length;a++){let o=r?r[a]:a,s=xp(e[o],n),c=F(s,t[o]);if(c>0)return;if(r||i.push(s),c<0)return r?e.map(e=>xp(e,n)):Cp(e,i,n)}},Tp=(e,t,n)=>t.reduce((t,r)=>wp(e,t,r,n)??t,e),Ep=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Dp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Op=new Map(ou.flatMap(e=>e.map(t=>[t,e[0]]))),kp=e=>Op.get(e)??e,Ap=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},jp=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(Ap(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},Mp=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),Np=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:kp(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:kp(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},Pp=(e,t)=>{let n=[];for(let r=t;;){let t=Np(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},Fp=e=>({line:e.line,column:e.column}),Ip=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(a.text===`EXTENDS`){let n=Pp(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},Lp=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,Rp=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];if(r.text===`<`&&Lp(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&Lp(e[n+1],e[n+2])){n+=Lp(e[n+2],e[n+3])?3:2;continue}let i=r.text===`MODULE`&&e[n-1]?.kind===`Separator`;r.kind!==`String`&&!i&&t.push(r.text)}return t},zp=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},Bp=(e,t)=>e.find(e=>e.name===t)??e.map(e=>Bp(e.modules,t)).find(Boolean),Vp=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:uu.get(i)??t?.(i)??rc(e,i),s=o===void 0?[]:se(o),c=zp(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=ac(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>Bp(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},Hp=(e,t)=>{let n=Vp(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],o=(e,n)=>{let i=Pp(t,e+1);r.push({location:Fp(t[e]),apply:e=>i.forEach(t=>e.put(Mp(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,a)=>{let l=e.start+a,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:Fp(u),apply:t=>t.put(Mp(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&Pp(t,l+1).every(e=>s.has(e))&&o(l,`definition`),Dp.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(Fp(u)),r.push({location:Fp(u),apply:e=>e.put(Mp(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(Mp(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=kp(e.name);r.push({location:e.location,apply:n=>n.put(Mp(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=a(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...i,...o].forEach(n=>{n.isLocal||t.put(Mp(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(Mp(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Dr(e.location,t.location)?-1:+!!Dr(t.location,e.location))},i=/* @__PURE__ */ new Map,a=e=>{let t=i.get(e??``);if(t)return t;let o=jp();i.set(e??``,o),au.toReversed().forEach(e=>o.put(Mp(e,`builtin`,!1)));let s=n(e);return s.getModule().extends.forEach(e=>a(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),r(s).forEach(e=>e.apply(o)),o};return a(void 0).enumerate().filter(e=>e.kind===`variable`).map(e=>e.name).reverse()},Up=(e,t,n)=>{let r=Vp(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),su.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=Ip(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),m=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?m(n,r,t):[n,i]};return t},g=h(e=>e.extends),_=h(e=>e.instances),v=/* @__PURE__ */ new Set([void 0]),y=/* @__PURE__ */ new Map;Rp(s(void 0)).forEach((e,t)=>{t===3&&lu.forEach(a),a(e)});let b=u(void 0);for(;;){let e=g(b,/* @__PURE__ */ new Set)??_(b,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;f.add(`${t.key}>${n}`),y.set(t.unit,[...y.get(t.unit)??[],n]),!v.has(n)&&(v.add(n),Rp(s(n)).forEach(a))}Ep.forEach(a);let ee=/* @__PURE__ */ new Set,x=e=>{if(ee.has(e))return;ee.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(x),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return x(void 0),cu.forEach(a),[...i]},Wp=(e,t)=>e*((t-e)/2**64),Gp=e=>e.includes(`.`)?e:`${e}.0`,Kp=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Gp(String(e));let[n,r]=e.toExponential().split(`e`);return`${Gp(n)}E${r.replace(`+`,``)}`},qp=e=>e!==void 0&&e>=`0`&&e<=`9`,Jp=e=>{if(e===0)return`0.0`;let t=Kp(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;qp(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;qp(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;qp(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(qp(t[n.next])&&Number(t[n.next])>=5&&(n.result=Yp(n.result));qp(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Yp=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Yp(r)}.`:n===`9`?`${Yp(r)}0`:`${r}${Number(n)+1}`},Xp=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},Zp=(e,t,n)=>{if(Wp(e,t)<1e-10)return;let r=n().sort();return r.reduce((e,t,n)=>{let i=r[n-1];return n>0&&i<0n==t<0n&&t-i<e?t-i:e},9223372036854775807n)},Qp=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},$p={line:0,column:0},em=`Failed to recover the initial state from its fingerprint.`,tm=`Failed to recover the next state from its fingerprint.`,nm=e=>({kind:`Identifier`,name:e,location:$p}),rm=/* @__PURE__ */ new Set([`name`,`property`]),im=(e,t,n)=>{let r=Ya(t,n);if(!r)throw new d(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new d(rm.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},am=(e,t,n)=>{let r=im(e,t,n);if(Za(r,n))throw new d(`The ${e} ${t} cannot be a constant.`);return r},om=(e,t,n)=>{if(Za(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return X(nm(e),Tm(n,void 0,void 0))}catch(e){if(e instanceof f)return;throw e}},sm=(e,t,n)=>{let r=im(e,t,n),i=om(t,r,n);if(i!==void 0&&i!==!0)throw new d(`The ${e} of ${t} is equal to ${H(i)}`);return i===void 0?r:void 0},cm=(e,t)=>{let n=Od({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>Ya(e,t)});return e.flatMap(e=>{let r=sm(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2)throw new d(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${i.params.size===0?``:`
|
|
458
|
+
`]]),tf=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),nf=T(`EOF`),rf=T(`IDENTIFIER`),af=T(`DEFBREAK`),of=(e,t)=>Array.from({length:T(t)-T(e)+1},(t,n)=>T(e)+n),sf=new Set(of(`op_57`,`op_119`)),cf=new Set(of(`op_1`,`op_119`)),lf=new Set(of(`op_57`,`op_70`)),uf=/* @__PURE__ */ new Set([...of(`ACTION`,`EXCEPT`),T(`EXTENDS`),...of(`IF`,`SF`),T(`STATE`),...of(`THEN`,`WITH`),T(`US`),...of(`op_112`,`op_116`)]),df=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),ff=new Map([...df(`postfix`,160,160,!0,`[`),...df(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...df(`prefix`,120,120,!1,`-.`),...df(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...df(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...df(`prefix`,40,40,!0,`\\lnot`),...df(`nfix`,100,130,!0,`\\times`),...df(`infix`,140,140,!1,`^`,`^^`),...df(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...df(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...df(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...df(`infix`,100,110,!0,`|`,`||`,`%%`),...df(`infix`,100,110,!1,`%`),...df(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...df(`infix`,90,140,!1,`\\wr`),...df(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...df(`infix`,90,130,!1,`!!`),...df(`infix`,90,90,!1,`...`,`..`),...df(`infix`,80,80,!0,`\\intersect`,`\\union`),...df(`infix`,80,80,!1,`\\`),...df(`infix`,70,70,!1,`<:`,`:>`),...df(`infix`,60,60,!0,`@@`),...df(`infix`,50,140,!0,`\\cdot`),...df(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...df(`infix`,30,30,!0,`\\land`,`\\lor`),...df(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...df(`infix`,10,10,!1,`=>`)]),pf=new Map([...ff,...Yd.flatMap(e=>e.slice(1).map(t=>[t,ff.get(e[0])]))]),mf=pf.get(`[`),hf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},gf=e=>({type:`tokens`,kinds:new Set(e)}),_f=e=>typeof e==`string`?e.startsWith(`<`)?gf([T(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(_f)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),vf=e=>(...t)=>({type:e,body:W(...t)}),K=vf(`zeroOrMore`),yf=vf(`oneOrMore`),q=vf(`optional`),J=e=>({type:`action`,run:t=>e(t)??void 0}),Y=e=>J(t=>{t.expecting=e}),X=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&W(...e.expansion),semantic:e.semantic}),bf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),xf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=bf(e,n);return n},Sf=(...e)=>{let t=e.map(T);return e=>t.includes(xf(e,1).kind)},Cf=(e,t=xf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},wf=e=>{let t=xf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Tf=e=>Sf(`CASESEP`)(e)&&Cf(e),Ef=e=>{let t=xf(e,1);uf.has(t.kind)&&(t.kind=rf)},Df=(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}`,Of=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),kf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Af=e=>e.operatorStacks[e.operatorStacks.length-1],jf=(e,t)=>e.low>t.high,Mf=(e,t)=>e.high<t.low,Nf=e=>e.fix===`prefix`?e:pf.get(`${e.name}.`),Pf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===mf?Of(`FcnAppl`,[n,...r.node.heirs]):Of(`PostfixExpr`,[n,r.node]),operator:void 0})},Ff=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Of(`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:Of(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},If=e=>{let t=Af(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 Pf(t,n),If(e);if(i.operator!==void 0){let t=Nf(r.operator);return t!==void 0&&jf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Df(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 ${Df(e,a.node.first,a.node.last)} and expression at location ${Df(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Mf(a.operator,r.operator)?void 0:jf(a.operator,r.operator)?(Ff(t,a.operator),If(e)):`Precedence conflict between ops ${a.operator.name} in block ${Df(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Nf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Mf(s,r.operator))return;if(!jf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Df(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Ff(t,s),If(e);let c=Df(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===hf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Lf=e=>J(t=>{let n=Af(t),r=kf(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:If(t)}),Rf=Lf(()=>!1),zf=Lf(()=>!0),Bf=J(e=>{e.lastOperator=pf.get(e.token.image)}),Vf=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},Hf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Vf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Uf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Cf(e,n.first.beginColumn))return n;let t=Uf(e,n);if(t!==void 0)return t}},Wf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(T),n=(e,...t)=>t.some(t=>e.kind===T(t)),r=e=>e!==void 0&&sf.has(e.kind),i=e.token,a=bf(e,i);i.next=void 0;let o=bf(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===rf&&(e=e.next)}else if(e.kind===rf){let t=e.next;!r(t)||lf.has(t.kind)||cf.has(t.kind)&&t.next?.kind!==rf||(e=t.next?.kind===T(`SUBSTITUTE`)?i:cf.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==af&&(e.next={kind:af,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=bf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Gf=e=>{let t=xf(e,1);if(t.kind===T(`LAB`)){let n=1;for(;n!==0;)if(t=bf(e,t),t.kind===T(`LAB`)&&n++,t.kind===T(`RAB`)&&n--,t.kind===nf)return!1;return bf(e,t).kind===T(`IN`)}if(t.kind!==rf)return!1;for(t=bf(e,t);t.kind===T(`COMMA`);){if(t=bf(e,t),t.kind!==rf)return!1;t=bf(e,t)}return t.kind===T(`IN`)},Kf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),qf=e=>e.proofLevels.at(-1)??-1,Jf=e=>{let t=xf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Sf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||qf(e)>=0&&Kf(t)>qf(e):Sf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Yf=(e,t)=>{let n=Kf(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},Xf=e=>J(t=>Yf(t,t.token)?void 0:`${Df(t,t.token)}: ${e}`),Zf=gf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(T)),Qf=gf([...Zf.kinds,T(`op_76`)]),$f=gf(cf),ep=gf(lf),tp=gf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(T)),np=()=>K(X({expansion:[G(Zf,`<op_77>`)],semantic:Cf}),G(`PrefixOp`,`InfixOp`),zf),rp=()=>G(W(X({expansion:[`OpenStart`],semantic:Cf}),`OpenExpression`,Rf),W(X({semantic:Cf}),`ExtendableExpr`)),ip=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),ap=()=>G(W(X({semantic:e=>Sf(`ASSUME`,`BOXASSUME`)(e)||xf(e,2).kind===T(`COLONCOLON`)&&[T(`ASSUME`),T(`BOXASSUME`)].includes(xf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),op=()=>[`JuncItem`,K(X({semantic:wf}),`JuncItem`)],sp=e=>J(t=>{t.expecting=e,Ef(t)}),cp=e=>J(t=>{t.isTerminalProof=e}),lp=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{Wf(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),up={CompilationUnit:Z(void 0,[J(Wf),q(`Prelude`),`Module`]),Prelude:Z(void 0,[`<BEGIN_PRAGMA>`,K(G(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Z(`Module definition`,[Y(`---- MODULE`),`BeginModule`,Y(`EXTENDS clause or module body`),`Extends`,Y(`Module body`),`Body`,Y(`==== or more Module body`),`EndModule`]),BeginModule:Z(`Begin module`,[Y(`---- MODULE (beginning of module)`),G(`<_BM0>`,`<_BM1>`,`<_BM2>`),sp(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,sp(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,sp(`Identifier`),`Identifier`))]),Body:Z(`Module body`,[Y(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),K(G(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,W(X({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,W(X({amount:2}),`Instance`),W(X({amount:2}),`Assumption`),W(X({amount:2}),`Theorem`),W(X({amount:1}),`Module`,J(Wf)),W(X({semantic:e=>Sf(`USE`)(e)&&xf(e,2).kind!==T(`ONLY`)||Sf(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Z(`variable declaration`,[`<VARIABLE>`,Y(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Y(`Identifier`),`Identifier`)]),ParamDeclaration:Z(`Parameter declaration`,[Y(`CONSTANT`),`ParamSubDecl`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Z(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Z(`Recursive`,[Y(`RECURSIVE`),`<RECURSIVE>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y("`,' or `)'"))]),ConstantDeclarationItems:Z(`Constant declaration items`,[Y(`Identifier, _ or prefix op`),G(W(`Identifier`,Y(`(, comma, or Module Body`),q(X({amount:2}),`<LBR>`,Y(`_`),`<US>`,Y(`comma or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`comma or )`)),`<RBR>`)),W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`prefix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Z(`Definition`,[Y(`LOCAL, Identifier or Operator Symbol`),q(`<LOCAL>`),`<DEFBREAK>`,Y(`LOCAL, Identifier or Operator Symbol`),G(lp(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),lp(`Expression`,X({expansion:[`<IDENTIFIER>`,ep]}),`PostfixLHS`,`Expression`),lp(`Expression`,X({expansion:[`<IDENTIFIER>`,$f]}),`InfixLHS`,`Expression`),lp(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),lp(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Z(`Identifier tuple`,[`<LAB>`,Y(`Identifier or >>`),q(`Identifier`,Y(`COMMA or >>`),K(`<COMMA>`,Y(`COMMA or >>`),`Identifier`,Y(`COMMA or >>`))),`<RAB>`]),IdentLHS:Z(`Identifier LHS`,[`Identifier`,Y(`( or ==`),q(`<LBR>`,Y(`Identifier Declaration, prefix op, _ or )`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`),K(`<COMMA>`,Y(`Identifier Declaration, prefix op or _`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Z(`Prefix LHS`,[Qf,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,$f,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,ep]),IdentDecl:Z(`Identifier Declation`,[`Identifier`,Y(`( or ...`),q(`<LBR>`,Y(`_`),`<US>`,Y(`COMMA or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Z(`Op. Symbol Declaration`,[G(W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`infix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),Instance:Z(`Instance`,[Y(`LOCAL or instance`),q(`<LOCAL>`),`Instantiation`,Y(`COMMA or Module Body`)]),Instantiation:Z(`NonLocalInstance`,[`<INSTANCE>`,sp(`Module identifier`),`Identifier`,Y(`WITH or another definition.`),q(`<WITH>`,Y(``),`Substitution`,Y(``),K(X({amount:3}),`<COMMA>`,Y(``),`Substitution`,Y(``)))]),Substitution:Z(`Substitution`,[G(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),Y(`<-`),`<SUBSTITUTE>`,Y(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Z(void 0,[Zf,Bf]),NonExpPrefixOp:Z(void 0,[Qf,Bf]),InfixOp:Z(`Infix Op`,[$f,Bf]),PostfixOp:Z(void 0,[ep,Bf]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{Wf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),ap(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),ap(),Y("PROVE or `,'")),G(`<PROVE>`,`<BOXPROVE>`),Y(`Expression`),`Expression`))]),NewSymb:Z(`NEW symbol declaration`,[Y(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),G(W(X({amount:2}),G(W(X({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),Y(`Constant declaration`),G(W(X({amount:2}),`IdentDecl`,q(`<IN>`,J(e=>{let t=kf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Df(e,t.first,t.last)}`:void 0}),Y(`Expression`),`Expression`)),`SomeFixDecl`)),W(X({amount:2}),q(`<NEW>`),`<VARIABLE>`,Y(`Identifier`),`Identifier`),W(X({amount:2}),q(`<NEW>`),G(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),Y(`Declaration`),G(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Z(`Domain binding`,[q(`<IN>`,Y(`Expression`),`Expression`)]),Theorem:Z(`Theorem`,[Y(`THEOREM, PROPOSITION`),G(`<THEOREM>`,`<PROPOSITION>`),Y(`Identifier, Assume-Prove or Expression`),q(X({amount:2}),`Identifier`,Y(`==`),`<DEF>`),J(Wf),G(W(X({amount:3}),X({semantic:Sf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:Jf}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>Sf(`BY`)(e)||xf(e,2).kind===T(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>xf(e,2).kind!==T(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,cp(!0),q(`<ONLY>`)),W(`<USE>`,cp(!1),q(`<ONLY>`)),W(`<HIDE>`,cp(!1))),Y("an expression, `MODULE' or `DEF'"),q(ip(),K(`<COMMA>`,Y(`MODULE or expression`),ip(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),ip(),K(`<COMMA>`,Y(`MODULE or expression`),ip(),J(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),J(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Z(`QED step`,[Y(`Step number`),tp,Xf(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:Jf}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),tp,Xf(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:Sf(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:Sf(`INSTANCE`)}),`Instantiation`),W(X({semantic:Sf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:Jf}),J(e=>{let t=kf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Df(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),yf(X({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Z(`HaveStep`,[`<HAVE>`,Y(`expression`),`Expression`]),TakeStep:Z(`TakeStep`,[`<TAKE>`,Y(`identifier`),G(W(X({expansion:[G(W(`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,Y(`comma or step`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or proof step`))),W(`Identifier`,Y(`comma or proof step`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or proof step`))))]),WitnessStep:Z(`WitnessStep`,[`<WITNESS>`,Y(`expression`),`Expression`,K(`<COMMA>`,Y(`expression`),`Expression`,Y(`comma or colon`))]),PickStep:Z(`PickStep`,[`<PICK>`,Y(`identifier`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,Y(`comma, or colon`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or colon`))),W(`QuantBound`,Y(`comma or colon`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or colon`)))),`<COLON>`,Y(`expression`),`Expression`]),CaseStep:Z(`CaseStep`,[`<CASE>`,Y(`expression`),`Expression`]),AssertStep:Z(`AssertStep`,[q(`<SUFFICES>`,Y(`expression or ASSUME/PROVE`)),G(`Expression`,W(X({semantic:Sf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Z(void 0,[G(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Z(void 0,[G(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Z(`String`,[`<STRING_LITERAL>`]),Number:Z(void 0,[`<NUMBER_LITERAL>`,q(X({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Z(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,K(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Z(void 0,[G(W(X({amount:2,expansion:[G(Qf,$f,ep),gf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(T))],semantic:Cf}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Df(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:Cf}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Z(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Z(`Quantified form`,[G(`<EXISTS>`,`<FORALL>`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,K(`<COMMA>`,`Identifier`)),W(`QuantBound`,K(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Z(`Bound Quantified Expression`,[G(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,K(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Z(`Quant Bound`,[G(`IdentifierTuple`,W(`Identifier`,K(`<COMMA>`,`Identifier`,Y(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Z(`Some { } form`,[`<LBC>`,q(G(W(X({semantic:Gf}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),yf(`<COMMA>`,`Expression`)))),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,K(`<COMMA>`,`Expression`)),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,K(`<COMMA>`,`QuantBound`)),W(`Expression`,q(G(W(`<COLON>`,J(e=>{let t=kf(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`,K(`<COMMA>`,`QuantBound`)),yf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:Gf}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>xf(e,2).kind===T(`MAPTO`)&&uf.has(xf(e,1).kind)}),J(e=>{xf(e,1).kind=rf}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,K(`<COMMA>`,`FieldSet`),`<RSB>`),W(`Expression`,G(W(K(`<COMMA>`,`Expression`),`<RSB>`,J(e=>{let t=e.frames[e.frames.length-1];t.node=Of(`FcnAppl`,t.heirs),e.lastOperator=mf})),W(`<ARROW>`,`Expression`,`<RSB>`),W(`<EXCEPT>`,`ExceptSpec`,K(`<COMMA>`,`ExceptSpec`),`<RSB>`),W(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Z(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Z(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Z(`Except Spec`,[`<BANG>`,yf(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(Ef),`Identifier`),W(`<LSB>`,`Expression`,K(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Z(`Some << -- >> or >>_ Form`,[`<LAB>`,q(`Expression`,K(`<COMMA>`,`Expression`)),G(`<RAB>`,W(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Z(void 0,[`Identifier`,q(X({amount:2}),`OpArgs`),G(W(`<BANG>`,`NoOpExtension`),J(e=>{e.isFairnessHooked=e.token.kind===T(`RBR`)}))]),ReducedExpression:Z(`restricted form of expression`,[G(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Z(`Fairness Expression`,[J(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),G(`<WF>`,`<SF>`),`ReducedExpression`,q(X({amount:2}),`<LBR>`,`Expression`,`<RBR>`,J(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:Z(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Z(`CASE Expression`,[`<CASE>`,`CaseArm`,K(X({semantic:e=>Tf(e)&&xf(e,2).kind!==T(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:Tf}),`<CASESEP>`,`OtherArm`)]),CaseArm:Z(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Z(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Z(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Z(`Let Definitions`,[yf(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=xf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...op()),W(X({expansion:[`<AND>`]}),...op())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Uf(t,e.heirs[1]);return n&&`Item at ${Df(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Df(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Z(`(Un)Bounded Choose`,[`<CHOOSE>`,G(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Z(`Lambda`,[`<LAMBDA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'"),K(`<COMMA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'")),`<COLON>`,Y(`Expression`),`Expression`]),Expression:Z(`Expression`,[J(e=>{e.operatorStacks.push([])}),np(),rp()],(e,t)=>{let n=Af(t);n.push({node:e.heirs[0],operator:hf});let r=If(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Z(`ExtendableExpr`,[G(W(X({expansion:[G(`<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`),Rf,K(G(W(X({expansion:[`PostfixOp`],semantic:Cf}),`PostfixOp`,zf),W(X({expansion:[`<DOT>`],semantic:Cf}),`<DOT>`,J(Ef),X({semantic:Cf}),`Identifier`,J(e=>{let t=Af(e);t[t.length-1].operator!==void 0&&Pf(t,t.length),t[t.length-1]={node:Of(`RecordComponent`,[t[t.length-1].node,kf(e,2),kf(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:Cf}),Y(`function argument`),`SBracketCases`,Lf(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:Cf}),`InfixOp`,zf,np(),rp()),W(X({expansion:[`<COLONCOLON>`],semantic:Cf}),`<COLONCOLON>`,J(e=>{let t=Af(e);if(!Hf(t[t.length-1].node))return`\`::' at ${Df(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=Af(e),n=kf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Mf(r,e.lastOperator)){let t=kf(e,3);return`Removing label at ${Df(e,t.first,t.last)} would change expression parsing.`}t.push({node:Of(`Label`,[kf(e,3),kf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:Cf}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:Cf}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>qf(e)<0&&e.proofLevels.length<=1?`${Df(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Df(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,W(X({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),q(X({amount:2}),`OpArgs`),K(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Vf(e.heirs)===void 0?e.heirs.length===1?Of(`GeneralId`,e.heirs):void 0:Of(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>xf(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),q(X({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Z(`StructOp`,[Y("`<<' , `>>' , `:' , `@' , or number"),G(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,W(X({semantic:e=>xf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Df(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},dp=/* @__PURE__ */ new Map,fp=e=>{let t=dp.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=fp(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,fp(up[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 dp.set(e,n),n},pp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},mp=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=bf(e,e.scanPosition)),e.scanPosition=bf(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`},hp=(e,t)=>{if(t.type===`tokens`)return mp(e,t.kinds);if(t.type===`call`)return hp(e,up[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||pp(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=hp(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||pp(e,t.semantic)?hp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=hp(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=hp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},gp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=hp(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},_p=(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||fp(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!fp(a).hasSemanticStart?fp(a).first.has(xf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):gp(e,i,a)&&(o===void 0||o(e))}),vp=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,hp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=bf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===nf){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=bf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ve(e.token.image)}" `},yp=(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??vp(e)}\n\nResidual stack trace follows:\n${r}`,!1},bp=(e,t)=>{let n=bf(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,yp(e))},xp=(e,t)=>{let n=up[t];n.message!==void 0&&(e.messages.push({name:n.message,token:xf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Sp(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return yp(e,i);let a=r.node??(r.heirs.length===0?void 0:Of(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Sp=(e,t)=>{if(t.type===`tokens`)return bp(e,t.kinds);if(t.type===`call`)return xp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||yp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||yp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Sp(e,t));if(t.type===`choice`){let n=_p(e,t.alternatives);return n===-1?yp(e):Sp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Sp(e,t.body))return!1;if(t.type===`optional`)return _p(e,[t.body])===-1||Sp(e,t.body);for(;_p(e,[t.body])===0;)if(!Sp(e,t.body))return!1;return!0},Cp=e=>{let t=ze(e),n={kind:nf,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Sp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},wp={low:15,high:15},Tp={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),Ep=new Map([[`=>`,Q(1,1,!1)],[`<=>`,Q(2,2,!1)],[`~>`,Q(2,2,!1)],[`-+->`,Q(2,2,!1)],[`/\\`,Q(3,3,!0)],[`\\/`,Q(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,Q(5,5,!1)]),[`\\cdot`,Q(5,14,!0)],[`@@`,Q(6,6,!0)],[`:>`,Q(7,7,!1)],[`<:`,Q(7,7,!1)],[`\\cup`,Q(8,8,!0)],[`\\cap`,Q(8,8,!0)],[`\\`,Q(8,8,!1)],[`..`,Q(9,9,!1)],[`...`,Q(9,9,!1)],[`##`,Q(9,13,!0)],[`$`,Q(9,13,!0)],[`$$`,Q(9,13,!0)],[`??`,Q(9,13,!0)],[`!!`,Q(9,13,!1)],[`\\sqcap`,Q(9,13,!0)],[`\\sqcup`,Q(9,13,!0)],[`\\uplus`,Q(9,13,!0)],[`\\wr`,Q(9,14,!1)],[`+`,Q(10,10,!0)],[`++`,Q(10,10,!0)],[`(+)`,Q(10,10,!0)],[`\\oplus`,Q(10,10,!0)],[`%`,Q(10,11,!1)],[`%%`,Q(10,11,!0)],[`|`,Q(10,11,!0)],[`||`,Q(10,11,!0)],[`\\X`,Q(10,13,!1)],[`-`,Q(11,11,!0)],[`--`,Q(11,11,!0)],[`(-)`,Q(11,11,!0)],[`\\ominus`,Q(11,11,!0)],[`*`,Q(13,13,!0)],[`**`,Q(13,13,!0)],[`/`,Q(13,13,!1)],[`//`,Q(13,13,!1)],[`\\div`,Q(13,13,!1)],[`\\o`,Q(13,13,!0)],[`(.)`,Q(13,13,!0)],[`\\odot`,Q(13,13,!0)],[`(/)`,Q(13,13,!1)],[`\\oslash`,Q(13,13,!1)],[`(\\X)`,Q(13,13,!0)],[`\\otimes`,Q(13,13,!0)],[`&`,Q(13,13,!0)],[`&&`,Q(13,13,!0)],[`\\star`,Q(13,13,!0)],[`\\bullet`,Q(13,13,!0)],[`\\bigcirc`,Q(13,13,!0)],[`^`,Q(14,14,!1)],[`^^`,Q(14,14,!1)]]),Dp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Op=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),kp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Ap=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),jp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Mp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...Dp]),Np=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Pp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Fp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Ip=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Lp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Rp=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),zp=/* @__PURE__ */ new Set([``,`*`,`-`]),Bp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Vp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Hp=/* @__PURE__ */ new Set([`NEW`,...Vp.keys()]),Up=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Wp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Gp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Kp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Ep.has(e.operator):Dp.has(e.operator)),qp=e=>Ep.has(e)||Dp.has(e)||e===`-.`,Jp=(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}}},Yp=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
|
|
459
|
+
`)}\n`},Xp=(e,n)=>{let i=n===`tlapm`,a=i?ge(e):ge(e).map(me),o={index:0,offsideColumns:[]},s={},c=[],l=/* @__PURE__ */ new Set,u=[],d=[],p=e=>c[c.length-1].has(e),m=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),ee=[],h=[],te=[],g=(e,t=o.index-1)=>{let n=e===t?te[e]:void 0;if(n)return n;let r=a[t];ee[e]??=m(a[e]),h[t]??={line:r.line,column:r.endColumn};let i={module:d[0].name,start:ee[e],end:h[t]};return e===t&&(te[e]=i),i},_=(e,t)=>(e.location.range=g(t),e),v=(e=0)=>a[Math.min(o.index+e,a.length-1)],y=(e=0)=>{let t=v(e),n=o.offsideColumns[o.offsideColumns.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),re={index:0},ie=e=>{let t=a.slice(re.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ae=e=>i&&(e.kind===`Keyword`||Gp.has(e.text)),oe=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},se=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Rp.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ae(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,ce=(e,n=v(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column;return new t(`${e} at line ${n.line}, column ${n.column}`,void 0,le(e,n,o,r))},le=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...ie(oe(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${se(r)}`,...oe(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},de=(e,t=v())=>ce(e,t,t),fe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ae(e),b=(e,t=0)=>{let n=y(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},x=()=>{let e=y();if(e.kind===`End`)throw ce(`Unexpected end of expression`);return o.index++,e},S=e=>b(e)?(o.index++,!0):!1,C=e=>{if(!b(e))throw de(`Expected ${JSON.stringify(e)} but found ${ne(y())}`);return x()},w=()=>{let e=y();if(e.kind!==`Identifier`)throw de(`Expected an identifier but found ${ne(e)}`);if(ae(e))throw de(`Unexpected keyword ${e.text}`);return o.index++,e.text},pe=()=>{let e=o.index;return{name:w(),range:g(e)}},he=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),_e=()=>{let e=y();return e.kind!==`String`&&(kp.has(e.text)||Ep.has(e.text)||Dp.has(e.text)||e.text===`'`)?(o.index++,e.text):w()},ve={isUsed:!1},ye=()=>y().kind===`Identifier`||!fe(y())?w():(ve.isUsed=!0,x().text),T=e=>{if(!i)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},E=(e,t=`,`)=>{let n=[e()];for(;S(t);)n.push(e());return n},be=()=>{if(b(`<<`)){let e={value:1};for(;y(e.value).kind===`Identifier`||b(`,`,e.value);)e.value++;return b(`>>`,e.value)&&b(`\\in`,e.value+1)}let e={value:0};for(;y(e.value).kind===`Identifier`;){if(b(`\\in`,e.value+1))return!0;if(!b(`,`,e.value+1))return!1;e.value+=2}return!1},xe=()=>{if(b(`::`))return!0;if(!b(`(`))return!1;let e={value:1};for(;y(e.value).kind===`Identifier`&&b(`,`,e.value+1);)e.value+=2;return y(e.value).kind===`Identifier`&&b(`)`,e.value+1)&&b(`::`,e.value+2)},Se=()=>{if(!S(`<<`)){let e=pe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(E(pe));return C(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>E(()=>{let e=E(Se);C(`\\in`);let t=D();return e.map(e=>({pattern:e,set:t}))}).flat(),we=()=>{let e=y();if(e.kind===`Identifier`){let t=o.index,n=[x().text];for(;b(`!`)&&y(1).kind===`Identifier`;)x(),n.push(w());return _({kind:`Identifier`,name:n.join(`!`),location:m(e)},t)}if(b(`<<`)||b(`(`))return ze();throw de(`Expected a subscript but found ${ne(e)}`)},Te=e=>{let t=y(1),n=y(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`&&b(`==`,Dp.has(n.text)?3:4))},Ee=e=>{let t=y(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||b(`,`,1)||b(`)`,1)||t.kind===`Keyword`&&Pp.has(t.text)||Te(e)},De=()=>{let e=y(),t=e.kind===`Operator`&&(Ep.has(e.text)||Op.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(Op.has(e.text)||Mp.has(e.text)&&e.text!==`'`&&!Dp.has(e.text)||jp.has(e.text)&&y(-1).text===`(`&&y(-1).line===e.line&&y(-1).endColumn+1===e.column&&y(1).text===`)`&&y(1).line===e.line&&y(1).column===e.endColumn+1)&&Ee(e))throw ce(`incomplete expression`,e);if(t)return o.index++,_({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:m(e)},o.index-1);if(e.kind!==`String`&&Mp.has(e.text)&&Ee(e)){o.index++;let t=m(e);if(Dp.has(e.text))return _({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return _({kind:`Lambda`,params:[n.name],body:Jp(e.text,n,t),operator:e.text,location:m(e)},o.index-1)}if(b(`LAMBDA`)){let t=o.index;x();let n=he(E(pe));C(`:`);let r=D();return _({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:m(e)},t)}return D()},Oe={range:void 0},ke=()=>T(()=>{let e=o.index;C(`(`);let t=E(De);return C(`)`),Oe.range=g(e),t}),Ae=()=>{let e=x();o.offsideColumns.push(e.column);let t=[D()];for(;v().text===e.text&&v().column===e.column;)o.index++,t.push(D());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:m(e)}},je=e=>T(()=>{let t=m(e),n=y().kind===`Identifier`,r=b(`|->`,1)&&(n||fe(y()));if(r||n&&b(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o.index,n=m(y()),i=e();return n.range=g(t),C(r?`|->`:`:`),{name:i,value:D(),location:n}},a=[i(()=>n?w():x().text),...S(`,`)?E(()=>i(w)):[]];return C(`]`),{kind:e,fields:a,location:t}}if(be()){let e=Ce();C(`|->`);let n=D();return C(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let a=D();if(S(`->`)){let e=D();return C(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(S(`EXCEPT`)){let e=E(()=>{C(`!`);let e=[];for(;b(`.`)||b(`[`);)if(S(`.`)){if(!fe(y()))throw de(`Expected a field name but found ${ne(y())}`);e.push({kind:`Field`,name:x().text})}else C(`[`),e.push({kind:`Index`,args:E(()=>D())}),C(`]`);return C(`=`),{path:e,value:D()}});return C(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!b(`]_`)){let e=[a];for(;S(`,`);)e.push(D());return C(`]`),{kind:`Bracket`,args:e,location:t}}return C(`]_`),{kind:`BoxAction`,action:a,subscript:we(),location:t}}),Me=()=>{let e=o.index,t=_(Ve(),e),n=m(x());return _({kind:`Apply`,operator:`\\in`,args:[t,D()],location:n},e)},Ne=e=>T(()=>{let t=m(e);if(S(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(be()&&(y(1).text===`\\in`||b(`<<`))){let e=o.index,n=Se();C(`\\in`);let r=D();if(S(`:`)){let e=D();return C(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=y().kind===`Identifier`&&b(`\\in`,1)?Me():D();if(S(`:`)){let e=Ce();return C(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;S(`,`);)r.push(D());return C(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=m(e),n=T(()=>b(`>>`)||b(`>>_`)?[]:E(()=>D()));if(S(`>>_`)){if(n.length!==1)throw ce(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:we(),location:t}}return C(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=m(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&be()){let e=Ce();return C(`:`),{kind:n,bounds:e,body:D(),location:t}}let i=he(E(pe));return C(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:D(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{if(S(`OTHER`))return C(`->`),{kind:`Case`,arms:t,other:D(),location:m(e)};let n=D();C(`->`),t.push({condition:n,body:D()})}while(S(`[]`));return{kind:`Case`,arms:t,other:void 0,location:m(e)}},Le=()=>{let e=y(1);return b(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Np.has(e.text)||e.kind===`Operator`&&(Ep.has(e.text)||Dp.has(e.text)||Op.has(e.text)))},Re=()=>{let e=x();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 o.index--,{kind:`Bound`,args:ke()}}return{kind:`Name`,name:e.text,args:b(`(`)?ke():[]}},ze=e=>{let t=o.index,n=x(),r=m(n);if(i&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=E(w);return C(`:`),{kind:`Lambda`,params:e,body:D(),location:r}}if(n.kind===`Number`){if(i&&/^\\[BOH]/.test(n.text))throw ce(`incomplete expression`,n);return{kind:`Number`,value:ue(n.text),text:n.text,location:r}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:r};if(n.kind===`String`)return{kind:`String`,value:n.text,location:r};let a=n.kind===`Step`&&M(n);if(a&&A()<0&&k.length<=1)throw ce(`Step number used outside proof`,n);if(a&&n.text[1]===`+`)throw ce(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||a){let c=a?et(n)??n.text:n.text;if(xe()){let t=he(S(`(`)?E(pe):[]);t.names.length>0&&C(`)`),C(`::`);let a=D();if(!i&&e!==void 0&&s.last!==void 0&&Kp(a)&&e.high>=s.last.low)throw ce(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:c,params:t.names,paramRanges:t.ranges,body:a,location:r}}let l=b(`(`);if(c===`@`&&!l&&!Le())return{kind:`ExceptAt`,location:r};let u=l?ke():[],d=[l?Oe.range:void 0];if(!Le())return l?{kind:`Apply`,operator:c,args:u,argumentsRange:Oe.range,location:r}:{kind:`Identifier`,name:c,location:r};let f=[{kind:`Name`,name:c,args:u}],p=[g(t,t)];for(;Le();)x(),p.push(g(o.index,o.index)),Oe.range=void 0,f.push(Re()),d.push(Oe.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),ee=m.join(`!`),h=f.flatMap(e=>`args`in e?e.args:[]),te=f.map(e=>`args`in e?e.args.length:0),_=d.at(-1)??g(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:r}:h.length===0?{kind:`Identifier`,name:ee,selectorRanges:p,location:r}:{kind:`Apply`,operator:ee,args:h,...te.slice(0,-1).some(e=>e>0)&&{argumentCounts:te},argumentsRange:_,selectorRanges:p,argumentRanges:d,location:r}}if(n.kind===`Operator`&&qp(n.text)&&b(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:ke(),location:r};if(n.kind===`Operator`&&qp(n.text)&&!i)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:r};switch(n.text){case`(`:{let e=T(()=>D());return C(`)`),e}case`[`:return je(n);case`{`:return Ne(n);case`<<`:return Pe(n);case`@`:return{kind:`ExceptAt`,location:r};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Fe(n);case`IF`:{let e=D();C(`THEN`);let t=D();return C(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:D(),location:r}}case`CASE`:return Ie(n);case`LET`:{let e=[],t=[];for(c.push(/* @__PURE__ */ new Set);!S(`IN`);){if(i&&b(`RECURSIVE`))throw ce(`Unexpected keyword RECURSIVE`,ie(v()));if(S(`RECURSIVE`)){Xe();continue}let n=O(!1);n.kind===`Instance`?t.push(n):e.push(n)}c.pop();let n=D();return t.length===0?{kind:`Let`,definitions:e,body:n,location:r}:{kind:`Let`,definitions:e,instances:t,body:n,location:r}}case`CHOOSE`:{let e=Se(),t=S(`\\in`)?D():void 0;return C(`:`),{kind:`Choose`,pattern:e,set:t,body:D(),location:r}}case`WF_`:case`SF_`:{let e=we(),t=T(()=>{C(`(`);let e=D();return C(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:r}}}throw de(`Unexpected ${ne(n)}`,n)},Be=(e,t,n)=>{s.last=s.preceding={low:t,high:n};let r=D(n+1),a=y(),o=a.text===`'`||Dp.has(a.text)?wp.high:Ep.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw ce(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},Ve=()=>{let e=s.preceding;s.preceding=void 0;let t=y(),n=m(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return Ae();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return x(),{kind:`Apply`,operator:`~`,args:[Be(t,4,4)],location:n};case`-`:return x(),{kind:`Apply`,operator:`-.`,args:[Be(t,12,12)],location:n};case`[]`:return x(),{kind:`Always`,expression:Be(t,4,15),location:n};case`<>`:return x(),{kind:`Eventually`,expression:Be(t,4,15),location:n};case`ENABLED`:return x(),{kind:`Enabled`,expression:Be(t,4,15),location:n};case`UNCHANGED`:return x(),{kind:`Unchanged`,expression:Be(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return x(),{kind:`Apply`,operator:t.text,args:[i?D(9):Be(t,10,13)],location:n}}return ze(e)},D=(e=0)=>{let t=o.index,n=Ve(),r={left:n.location.range?n:_(n,t),previous:void 0};for(;;){let n=y();if(n.kind!==`Operator`)break;let i=m(n);if(n.text===`'`&&e<=15){x(),s.last=wp,r.left=_({kind:`Prime`,expression:r.left,location:i},t);continue}if(Dp.has(n.text)&&e<=15){x(),s.last=wp,r.left=_({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){x();let e=T(()=>E(()=>D()));T(()=>C(`]`)),s.last=Tp,r.left=_({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&fe(y(1))){x();let e=x().text;r.left=_({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=Ep.get(n.text);if(!a||a.low<e)break;let o=r.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw ce(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(x(),a.low>12&&b(`-`))throw ce(`Precedence conflict between ${n.text} and -`,y());s.last=s.preceding=a;let c=D(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[g(t).end];r.left=l.kind===e&&o?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&o?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=_(r.left,t),r.previous={...a,text:n.text}}return r.left},He=()=>{if(!S(`(`))return[];let e=Ye();return C(`)`),e},Ue=()=>{let e=m(y()),t=D(),n=a[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},O=e=>{let t=o.index;return _(Ge(e),t)},We=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),Ge=e=>{let t=y(),n=m(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...Ue(),isLocal:e,isRecursive:p(t),location:n});if(t.kind===`Identifier`&&y(1).kind===`Operator`&&Ep.has(y(1).text)&&y(2).kind===`Identifier`&&b(`==`,3)){let e=pe(),t=x().text,n=pe();return C(`==`),r(t,[We(e),We(n)])}let i=t.kind!==`String`&&kp.has(t.text),a=t.kind===`Identifier`&&Dp.has(y(1).text)&&b(`==`,2);if(i||a){let e=i?t.text:y(1).text;i&&x();let n=pe();return a&&x(),C(`==`),r(e,[We(n)])}let s=w();if(S(`[`)){let t=T(()=>Ce());return C(`]`),C(`==`),{kind:`Function`,name:s,bounds:t,body:D(),isLocal:e,isRecursive:p(s),location:n}}let c=o.index,l=He();return C(`==`),b(`INSTANCE`)?{...Ke(s,l,e,n),definitionRange:g(c)}:r(s,l)},Ke=(e,t,n,r)=>{let i=o.index;return C(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ye(),substitutions:S(`WITH`)?E(()=>{let e=o.index,t=_e(),n=g(e);return C(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:g(i)}},qe=()=>{let e=o.index;return _(Je(),e)},Je=()=>{let e=m(y());if(b(`_`)&&y(1).kind===`Operator`)return x(),{name:x().text,arity:S(`_`)?2:1,location:e};if(y().kind===`Operator`&&b(`_`,1)){let t=x().text;return x(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=w();if(!S(`(`))return{name:t,arity:0,location:e};let n=E(()=>C(`_`));return C(`)`),{name:t,arity:n.length,location:e}},Ye=()=>E(qe),Xe=()=>{let e=Ye();return e.forEach(e=>c[c.length-1].add(e.name)),e},Ze=e=>{let t={value:0,offset:e};do{let e=y(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Up.has(e.text)&&t.value++,e.kind===`Operator`&&Wp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Qe=()=>{let e=y(),t=y(1);return e.kind===`Identifier`?b(`(`,1)||b(`[`,1)?b(`==`,Ze(1)):t.kind===`Operator`&&Dp.has(t.text)?b(`==`,2):t.kind===`Operator`&&Ep.has(t.text)?y(2).kind===`Identifier`&&b(`==`,3):b(`==`,1):e.kind!==`String`&&kp.has(e.text)&&t.kind===`Identifier`&&b(`==`,2)},k=[],A=()=>k[k.length-1]??-1,$e=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),j=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},M=e=>!e.text.endsWith(`.`)&&!zp.has(j(e)),et=e=>{let t=j(e);if(zp.has(t))return;let n=$e(e);if(n>=0)return`<${n}>${t}`;let r=A(),i=k[k.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},tt=e=>{if(e.kind===`Keyword`)return Ip.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return k.length===0;if(e.text[1]===`+`||k.length===0)return!0;let t=A();return t>=0&&$e(e)>t},nt=e=>{let t=$e(e),n=k.length-1,r=k[n-1]??-1,i=k[n]<0;return i&&(k[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:k[n]===t},rt=e=>!l.has(e)&&d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),it=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Gp.has(e.name)&&!rt(e.name):!1,at=()=>{let e=y();return e.kind===`Step`?M(e):e.kind===`Keyword`?Bp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Qe()},ot=()=>{let e=o.index,t=y();return t.kind===`Operator`&&!Ap.has(t.text)&&qp(t.text)?(o.index++,_({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:m(t)},e)):S(`MODULE`)?_({kind:`ModuleFact`,name:w(),location:m(t)},e):D()},st=e=>u[u.length-1]?.add(e),ct=e=>{u.push(/* @__PURE__ */ new Set);let t=e();return u.pop(),t},lt=e=>u.some(t=>t.has(e))||d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ut=()=>{let e=o.index,t=y(),n=E(()=>{let e=y();if((e.kind!==`Identifier`||ae(e))&&e.kind!==`Operator`)throw de(`Expected a definition name but found ${ne(e)}`,e);return o.index++,e.text},`!`),r=m(t);return _(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},dt=()=>{if(i)return E(ut);let e=E(ot),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&<(e.name)):void 0;if(t)throw ce(`DEF clause entry should describe a defined operator`,t.location);return e},ft=()=>({facts:at()?E(ot):[],defs:S(`DEF`)||S(`DEFS`)?dt():[]}),pt=()=>{let e=o.index,t=x(),i=t.text===`USE`&&S(`ONLY`),a=g(e),s={kind:t.text===`USE`?`Use`:`Hide`,isOnly:i,...ft(),keyword:a,location:m(t)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!it(e)):[];if(c.length>0)throw r(c.map(t=>({location:f(t.location.range??g(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
460
|
+
the name of a theorem, assumption, or step.`})));return _(s,e)},mt=()=>{let e=o.index,t=m(y()),n=S(`NEW`),r=y().kind===`Keyword`?Vp.get(y().text):void 0;if(!n&&r===void 0)throw de(`Expected a declaration but found ${ne(y())}`);if(r!==void 0&&x(),r===`Variable`){let n=pe();return st(n.name),_({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=qe();st(i.name);let a=(r??`Constant`)===`Constant`&&b(`\\in`);if(a&&i.arity>0)throw ce(`declared symbol with arguments before \\in`);return a&&x(),_({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:a?D():void 0,nameRange:i.location.range,location:t},e)},ht=()=>{let e=o.index,t=m(C(`ASSUME`)),n=E(()=>b(`ASSUME`)?ct(ht):y().kind===`Keyword`&&Hp.has(y().text)?mt():D());return C(`PROVE`),_({kind:`AssumeProve`,assumptions:n,conclusion:D(),location:t},e)},gt=e=>{let t={value:0};for(;y(t.value).kind===`Identifier`&&b(`,`,t.value+1);)t.value+=2;return y(t.value).kind===`Identifier`&&b(e,t.value+1)},_t=(e,t)=>{e.forEach(st),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(st))},vt=()=>{let e=y();if(b(`USE`)||b(`HIDE`))return pt();if(b(`INSTANCE`)){let t=o.index;return _(Ke(void 0,[],!1,m(e)),t)}if(b(`DEFINE`)||Qe()){let t=o.index;S(`DEFINE`);let n=[O(!1)];for(;Qe();)n.push(O(!1));let r={kind:`Define`,definitions:n,location:m(e)};return _(r,t)}if(S(`HAVE`))return{kind:`Have`,expression:D()};if(S(`TAKE`)){let e=be(),t=he(e?[]:E(pe)),n=e?Ce():[];return _t(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(S(`WITNESS`))return{kind:`Witness`,expressions:E(()=>D())};if(S(`PICK`)){let e=gt(`:`),t=he(e?E(pe):[]),n=e?[]:Ce();return _t(t.names,n),C(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:D()}}return S(`CASE`)?{kind:`Case`,expression:D()}:{kind:`Assert`,isSuffices:S(`SUFFICES`),statement:b(`ASSUME`)?ht():D()}},yt=e=>{let t=y();if(t.kind!==`Step`)throw de(`Expected a step number but found ${ne(t)}`,t);if(!nt(t))throw ce(`${e?`QED step`:`step`}'s number has bad level`,t);if($e(t)<0&&et(t)!==void 0)throw ce(`<*> and <+> cannot be used for a named step`,t);return o.index++,{name:et(t),token:t.text,location:m(t)}},bt=()=>{let e=o.index,t=yt(b(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;u.push(r);let i=S(`QED`)?{kind:`Qed`}:vt(),a=g(e),s=g(n),c=tt(y());if(c&&!Lp.has(i.kind))throw ce(`Proof of a step that does not take a proof`);let l=c?St():void 0;return u.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(st),_({...t,body:i,head:a,statement:s,proof:l},e)},xt=()=>{let e=m(y());if(b(`BY`)||b(`PROOF`)&&b(`BY`,1)){S(`PROOF`),x();let t=g(o.index-1);return{kind:`By`,isOnly:S(`ONLY`),...ft(),keyword:t,location:e}}let t=y(+!!b(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){S(`PROOF`),x();let n=g(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}S(`PROOF`);let n=[bt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(bt());return{kind:`Steps`,level:A(),steps:n,location:e}},St=()=>{let e=o.index;k.push(-1);let t=ct(xt);return k.pop(),_(t,e)},Ct=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},wt=e=>{let t=o.index,n=x(),r=y().kind===`Identifier`&&b(`==`,1)?w():void 0;r!==void 0&&(l.add(r),x());let i=ct(()=>({statement:b(`ASSUME`)?ht():D(),proof:tt(y())?St():void 0})),a=i.statement,s=_({name:r,statement:a,proof:i.proof,location:m(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&a.kind!==`AssumeProve`&&Ct(e,_({kind:`Operator`,name:r,params:[],body:a,isLocal:!1,isRecursive:!1,location:m(n)},t))},Tt=()=>{let e=o.index,t=x(),n=y().kind===`Identifier`&&b(`==`,1)?w():void 0;return n!==void 0&&(l.add(n),x()),_({name:n,expression:D(),isAxiom:t.text===`AXIOM`,location:m(t)},e)},Et=()=>{let e=m(C(`----`));C(`MODULE`);let t=ye();C(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),c.push(/* @__PURE__ */ new Set),S(`EXTENDS`)&&E(()=>{let e=o.index;n.extends.push(ye()),n.extendsRanges.push(g(e))});;){let t=o.index;re.index=t;let r=y();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(),c.pop(),n;if(r.kind===`Separator`){if(b(`MODULE`,1)){let e=Et();n.modules.push(e),n.units.push({kind:`Module`,module:e}),C(`====`);continue}x()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=m(x()),r=Ye();n.constants.push(...r),e.range=g(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=m(x()),r=E(()=>{let e=o.index,t=m(y());return _({name:w(),arity:0,location:t},e)});n.variables.push(...r),e.range=g(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Tt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Ct(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(b(`USE`)&&b(`ONLY`,1))throw de(`Expected a module unit but found ${ne(r)}`);let e=pt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:x(),n.units.push({kind:`Recursive`,declarations:Xe()});continue;case`INSTANCE`:Dt(n,_(Ke(void 0,[],!1,m(r)),t));continue;case`LOCAL`:if(x(),b(`INSTANCE`)){Dt(n,_(Ke(void 0,[],!0,m(r)),t));continue}Dt(n,_(Ge(!0),t));continue}r.kind===`Keyword`&&Fp.has(r.text)?wt(n):Dt(n,O(!1))}}},Dt=(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}))},Ot=Et(),kt=ve.isUsed?Cp(e):void 0;if(kt!==void 0)throw new t(kt);return Ot},Zp=e=>Xp(e,`tlc`),Qp=e=>Xp(e,`tlapm`),$p=e=>Xp(e,`sany`),em=10454148508367108822n,tm=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:em);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),nm=Int32Array.from(tm,e=>Number(BigInt.asIntN(32,e>>32n))),rm=Int32Array.from(tm,e=>Number(BigInt.asIntN(32,e))),im=Number(BigInt.asIntN(32,em>>32n)),am=Number(BigInt.asIntN(32,em));let om=im,sm=am;const cm=e=>{let t=(e^sm)&255;sm=(sm>>>8|om<<24)^rm[t],om=om>>>8^nm[t]},lm=e=>{for(let t=0;t<32;t+=8)cm(e>>>t)},um=e=>{if(typeof e==`boolean`)cm(0),cm(e?116:102);else if(typeof e==`number`)cm(1),lm(e);else if(typeof e==`string`){cm(3),lm(e.length);for(let t=0;t<e.length;t++)cm(e.charCodeAt(t))}else if(M(e))cm(21),lm(bt(e.name)+1);else if(j(e)){let t=I(e);cm(9),lm(t.domain.length);for(let e=0;e<t.domain.length;e++)um(t.domain[e]),um(t.range[e])}else{let t=P(e).elements;cm(5),lm(t.length);for(let e of t)um(e)}},dm=e=>{let t={high:om,low:sm};om=im,sm=am;for(let t of e)um(t);let n=BigInt(om>>>0)<<32n|BigInt(sm>>>0);return om=t.high,sm=t.low,n},fm=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||M(e))return 5;if(typeof e==`string`)return 5+e.length;if(j(e)){let t=I(e);return t.domain.reduce((e,n,r)=>e+fm(n)+fm(t.range[r]),5)}return P(e).elements.reduce((e,t)=>e+fm(t),5)},pm=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){om=n<32?0:1<<n-32,sm=n<32?1<<n:0;for(let t=0;t<e;t++)cm(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^om,t[n+1]=t[a+1]^sm}}return t},mm=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=n.get(e);if(t)return t;let r=pm(e);return n.set(e,r),r},o=e=>{if(typeof e!=`object`||M(e))return um(e),fm(e);let t=s(e),n={high:om,low:sm},r=a(i[t]);om=i[t+1],sm=i[t+2];for(let e=0;e<8;e++){let t=e<4?n.low:n.high,i=(e*256+(t>>>(e&3)*8&255))*2;om^=r[i],sm^=r[i+1]}return i[t]},s=e=>{let t=r.get(e);if(t!==void 0)return t;let n={high:om,low:sm};om=0,sm=0;let a={value:5};if(j(e)){let t=I(e);cm(9),lm(t.domain.length);for(let e=0;e<t.domain.length;e++)a.value+=o(t.domain[e]),a.value+=o(t.range[e])}else{let t=P(e).elements;cm(5),lm(t.length);for(let e of t)a.value+=o(e)}let s=i.length;return r.set(e,s),i.push(a.value,om,sm),om=n.high,sm=n.low,s};return(n,r)=>{let i={high:om,low:sm};om=im,sm=am;for(let t of e)o(n[t]);t[2*r]=sm,t[2*r+1]=om,om=i.high,sm=i.low}},hm=25214903917n,gm=(1n<<48n)-1n,_m=2147483647,vm=e=>{let t={value:(BigInt.asUintN(64,e)^hm)&gm},n=e=>(t.value=t.value*hm+11n&gm,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^hm)&gm},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<=_m)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},ym=[],bm=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},xm=()=>{for(let e=1277011;ym.length<1341;e++)bm(e)&&ym.push(e);return ym},Sm=e=>{let t=xm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Cm=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},wm=e=>{for(let t=Math.max(e,9);;t++){let e=Cm(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},Tm=(e,t,n)=>{if(t<=0)return[];let r=wm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Sm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Em=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:_m),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Dm=(1n<<63n)-1n-24n,Om=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Dm*BigInt(n)+i)%t;return r<0n?r+t:r})},km=(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,Am=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=zn(e.domain),n=P(e.range).elements;return{lists:t.map(()=>n),create:e=>jt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>P(e).elements),create:t=>Hn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>P(e).elements),create:Vn}}},jm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Mm=(e,t,n,r)=>{if(F(t))return[];let i=r===`1.7.4`?Em:Tm;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=jm(t,r)?void 0:Am(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(_m)?Om(e,t,n):i(e,Number(t),n)).map(e=>a.create(km(a.lists,e)))}let o=P(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Nm=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new h(`RandomElement of the empty set`);return n},Pm=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...zn(e.domain)];return jt(n,n.map(()=>Pm(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Hn(e.names.map((n,r)=>[n,Pm(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Vn(e.factors.map(e=>Pm(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new h(`RandomElement of the empty set`);return e.low+r}return Nm(P(e).elements,t)},Fm=(e,t=0n)=>{let n=vm(t),r={random:vm(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Hn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:dm,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.seededState&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.seededState=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},Im=e=>jn([...e.possibleCounts].map(([e,t])=>[e,t])),Lm=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Im(e)]]),Rm=`----------------------------- MODULE Bags --------------------------------
|
|
461
|
+
(**************************************************************************)
|
|
462
|
+
(* A bag, also called a multiset, is a set that can contain multiple *)
|
|
463
|
+
(* copies of the same element. A bag can have infinitely many elements, *)
|
|
464
|
+
(* but only finitely many copies of any single element. *)
|
|
465
|
+
(* *)
|
|
466
|
+
(* We represent a bag in the usual way as a function whose range is a *)
|
|
467
|
+
(* subset of the positive integers. An element e belongs to bag B iff e *)
|
|
468
|
+
(* is in the domain of B, in which case bag B contains B[e] copies of e. *)
|
|
469
|
+
(**************************************************************************)
|
|
470
|
+
(**************************************************************************)
|
|
471
|
+
(* All these definitions other than SubBag are overridden by TLC in the *)
|
|
472
|
+
(* Java class tlc2.module.Bags. Each operator is overridden by the Java *)
|
|
473
|
+
(* method with the same name, except that the mapping for TLA+ infix *)
|
|
474
|
+
(* operators is defined in the static block at the beginning of the Java *)
|
|
475
|
+
(* class. *)
|
|
476
|
+
(**************************************************************************)
|
|
477
|
+
LOCAL INSTANCE Naturals
|
|
478
|
+
|
|
479
|
+
IsABag(B) ==
|
|
480
|
+
(************************************************************************)
|
|
481
|
+
(* True iff B is a bag. *)
|
|
482
|
+
(************************************************************************)
|
|
483
|
+
B \\in [DOMAIN B -> {n \\in Nat : n > 0}]
|
|
484
|
+
|
|
485
|
+
BagToSet(B) == DOMAIN B
|
|
486
|
+
(************************************************************************)
|
|
487
|
+
(* The set of elements at least one copy of which is in B. *)
|
|
488
|
+
(************************************************************************)
|
|
489
|
+
|
|
490
|
+
SetToBag(S) == [e \\in S |-> 1]
|
|
491
|
+
(************************************************************************)
|
|
492
|
+
(* The bag that contains one copy of every element of the set S. *)
|
|
493
|
+
(************************************************************************)
|
|
494
|
+
|
|
495
|
+
BagIn(e,B) == e \\in BagToSet(B)
|
|
496
|
+
(************************************************************************)
|
|
497
|
+
(* The \\in operator for bags. *)
|
|
498
|
+
(************************************************************************)
|
|
499
|
+
|
|
500
|
+
EmptyBag == SetToBag({})
|
|
501
|
+
|
|
502
|
+
B1 (+) B2 ==
|
|
503
|
+
(************************************************************************)
|
|
504
|
+
(* The union of bags B1 and B2. *)
|
|
505
|
+
(************************************************************************)
|
|
506
|
+
[e \\in (DOMAIN B1) \\cup (DOMAIN B2) |->
|
|
507
|
+
(IF e \\in DOMAIN B1 THEN B1[e] ELSE 0)
|
|
508
|
+
+ (IF e \\in DOMAIN B2 THEN B2[e] ELSE 0) ]
|
|
509
|
+
|
|
510
|
+
B1 (-) B2 ==
|
|
511
|
+
(************************************************************************)
|
|
512
|
+
(* The bag B1 with the elements of B2 removed--that is, with one copy *)
|
|
513
|
+
(* of an element removed from B1 for each copy of the same element in *)
|
|
514
|
+
(* B2. If B2 has at least as many copies of e as B1, then B1 (-) B2 *)
|
|
515
|
+
(* has no copies of e. *)
|
|
516
|
+
(************************************************************************)
|
|
517
|
+
LET B == [e \\in DOMAIN B1 |-> IF e \\in DOMAIN B2 THEN B1[e] - B2[e]
|
|
518
|
+
ELSE B1[e]]
|
|
519
|
+
IN [e \\in {d \\in DOMAIN B : B[d] > 0} |-> B[e]]
|
|
520
|
+
|
|
521
|
+
LOCAL Sum(f) ==
|
|
522
|
+
(******************************************************************)
|
|
523
|
+
(* The sum of f[x] for all x in DOMAIN f. The definition assumes *)
|
|
524
|
+
(* that f is a Nat-valued function and that f[x] equals 0 for all *)
|
|
525
|
+
(* but a finite number of elements x in DOMAIN f. *)
|
|
526
|
+
(******************************************************************)
|
|
527
|
+
LET DSum[S \\in SUBSET DOMAIN f] ==
|
|
528
|
+
LET elt == CHOOSE e \\in S : TRUE
|
|
529
|
+
IN IF S = {} THEN 0
|
|
530
|
+
ELSE f[elt] + DSum[S \\ {elt}]
|
|
531
|
+
IN DSum[DOMAIN f]
|
|
532
|
+
|
|
533
|
+
BagUnion(S) ==
|
|
534
|
+
(************************************************************************)
|
|
535
|
+
(* The bag union of all elements of the set S of bags. *)
|
|
536
|
+
(************************************************************************)
|
|
537
|
+
[e \\in UNION {BagToSet(B) : B \\in S} |->
|
|
538
|
+
Sum( [B \\in S |-> IF BagIn(e, B) THEN B[e] ELSE 0] ) ]
|
|
539
|
+
|
|
540
|
+
B1 \\sqsubseteq B2 ==
|
|
541
|
+
(************************************************************************)
|
|
542
|
+
(* The subset operator for bags. B1 \\sqsubseteq B2 iff, for all e, bag *)
|
|
543
|
+
(* B2 has at least as many copies of e as bag B1 does. *)
|
|
544
|
+
(************************************************************************)
|
|
545
|
+
/\\ (DOMAIN B1) \\subseteq (DOMAIN B2)
|
|
546
|
+
/\\ \\A e \\in DOMAIN B1 : B1[e] \\leq B2[e]
|
|
547
|
+
|
|
548
|
+
SubBag(B) ==
|
|
549
|
+
(************************************************************************)
|
|
550
|
+
(* The set of all subbags of bag B. *)
|
|
551
|
+
(* *)
|
|
552
|
+
(* The following definition is not the one described in the TLA+ book, *)
|
|
553
|
+
(* but rather one that TLC can evaluate. *)
|
|
554
|
+
(************************************************************************)
|
|
555
|
+
|
|
556
|
+
LET RemoveFromDom(x, f) == [y \\in (DOMAIN f) \\ {x} |-> f[y]]
|
|
557
|
+
Combine(x, BagSet) ==
|
|
558
|
+
BagSet \\cup
|
|
559
|
+
{[y \\in (DOMAIN f) \\cup {x} |-> IF y = x THEN i ELSE f[y]] :
|
|
560
|
+
f \\in BagSet, i \\in 1..B[x]}
|
|
561
|
+
Biggest == LET Range == {B[x] : x \\in DOMAIN B}
|
|
562
|
+
IN IF Range = {} THEN 0
|
|
563
|
+
ELSE CHOOSE r \\in Range :
|
|
564
|
+
\\A s \\in Range : r \\geq s
|
|
565
|
+
RSB[BB \\in UNION {[S -> 1..Biggest] : S \\in SUBSET DOMAIN B}] ==
|
|
566
|
+
IF BB = << >> THEN {<< >>}
|
|
567
|
+
ELSE LET x == CHOOSE x \\in DOMAIN BB : TRUE
|
|
568
|
+
IN Combine(x, RSB[RemoveFromDom(x, BB)])
|
|
569
|
+
IN RSB[B]
|
|
570
|
+
|
|
571
|
+
(******************* Here is the definition from the TLA+ book. ********
|
|
572
|
+
LET AllBagsOfSubset ==
|
|
573
|
+
(******************************************************************)
|
|
574
|
+
(* The set of all bags SB such that BagToSet(SB) \\subseteq *)
|
|
575
|
+
(* BagToSet(B). *)
|
|
576
|
+
(******************************************************************)
|
|
577
|
+
UNION {[SB -> {n \\in Nat : n > 0}] : SB \\in SUBSET BagToSet(B)}
|
|
578
|
+
IN {SB \\in AllBagsOfSubset : \\A e \\in DOMAIN SB : SB[e] \\leq B[e]}
|
|
579
|
+
***************************************************************************)
|
|
580
|
+
|
|
581
|
+
BagOfAll(F(_), B) ==
|
|
582
|
+
(************************************************************************)
|
|
583
|
+
(* The bag analog of the set {F(x) : x \\in B} for a set B. It's the bag *)
|
|
584
|
+
(* that contains, for each element e of B, one copy of F(e) for every *)
|
|
585
|
+
(* copy of e in B. This defines a bag iff, for any value v, the set of *)
|
|
586
|
+
(* e in B such that F(e) = v is finite. *)
|
|
587
|
+
(************************************************************************)
|
|
588
|
+
[e \\in {F(d) : d \\in BagToSet(B)} |->
|
|
589
|
+
Sum( [d \\in BagToSet(B) |-> IF F(d) = e THEN B[d] ELSE 0] ) ]
|
|
590
|
+
|
|
591
|
+
BagCardinality(B) ==
|
|
592
|
+
(************************************************************************)
|
|
593
|
+
(* If B is a finite bag (one such that BagToSet(B) is a finite set), *)
|
|
594
|
+
(* then this is its cardinality (the total number of copies of elements *)
|
|
595
|
+
(* in B). Its value is unspecified if B is infinite. *)
|
|
596
|
+
(************************************************************************)
|
|
597
|
+
Sum(B)
|
|
598
|
+
|
|
599
|
+
CopiesIn(e, B) ==
|
|
600
|
+
(************************************************************************)
|
|
601
|
+
(* If B is a bag, then CopiesIn(e, B) is the number of copies of e in *)
|
|
602
|
+
(* B. If ~BagIn(e, B), then CopiesIn(e, B) = 0. *)
|
|
603
|
+
(************************************************************************)
|
|
604
|
+
IF BagIn(e, B) THEN B[e] ELSE 0
|
|
605
|
+
=============================================================================
|
|
606
|
+
|
|
607
|
+
(* Last modified on Fri 26 Jan 2007 at 8:45:03 PST by lamport *)
|
|
608
|
+
|
|
609
|
+
6 Apr 99 : Modified version for standard module set
|
|
610
|
+
7 Dec 98 : Corrected error found by Stephan Merz.
|
|
611
|
+
6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
|
|
612
|
+
5 Dec 98 : Initial version.
|
|
613
|
+
`,zm=/* @__PURE__ */ new Map([[`Bags`,Rm],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
|
|
614
|
+
(***************************************************************************)
|
|
615
|
+
(* The two definitions in this standard module are overridden by TLC in *)
|
|
616
|
+
(* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
|
|
617
|
+
(* the Java method with the same name. *)
|
|
618
|
+
(***************************************************************************)
|
|
619
|
+
LOCAL INSTANCE Naturals
|
|
620
|
+
LOCAL INSTANCE Sequences
|
|
621
|
+
(*************************************************************************)
|
|
622
|
+
(* Imports the definitions from Naturals and Sequences, but doesn't *)
|
|
623
|
+
(* export them. *)
|
|
624
|
+
(*************************************************************************)
|
|
625
|
+
|
|
626
|
+
IsFiniteSet(S) ==
|
|
627
|
+
(*************************************************************************)
|
|
628
|
+
(* A set S is finite iff there is a finite sequence containing all its *)
|
|
629
|
+
(* elements. *)
|
|
630
|
+
(*************************************************************************)
|
|
631
|
+
\\E seq \\in Seq(S) : \\A s \\in S : \\E n \\in 1..Len(seq) : seq[n] = s
|
|
632
|
+
|
|
633
|
+
Cardinality(S) ==
|
|
634
|
+
(*************************************************************************)
|
|
635
|
+
(* Cardinality is defined only for finite sets. *)
|
|
636
|
+
(*************************************************************************)
|
|
637
|
+
LET CS[T \\in SUBSET S] == IF T = {} THEN 0
|
|
638
|
+
ELSE 1 + CS[T \\ {CHOOSE x : x \\in T}]
|
|
639
|
+
IN CS[S]
|
|
640
|
+
=============================================================================
|
|
641
|
+
`],[`Integers`,`-------------------------------- MODULE Integers ----------------------------
|
|
642
|
+
(***************************************************************************)
|
|
643
|
+
(* This module provides dummy definitions of the operators that are *)
|
|
644
|
+
(* defined by the real Integers module. It is expected that any tool will *)
|
|
645
|
+
(* provide its own implementations of these operators. See the book *)
|
|
646
|
+
(* "Specifying Systems" for the real Integers module. *)
|
|
647
|
+
(***************************************************************************)
|
|
648
|
+
(***************************************************************************)
|
|
649
|
+
(* The two definitions here and the definitions imported from the Naturals *)
|
|
650
|
+
(* module are overridden by TLC in the Java class tlc2.module.Integers. *)
|
|
651
|
+
(* Each operator is overridden by the Java method with the same name, *)
|
|
652
|
+
(* except that the mappings for the prefix - operator and the TLA+ infix *)
|
|
653
|
+
(* operators are defined in the static block at the beginning of the Java *)
|
|
654
|
+
(* class. *)
|
|
655
|
+
(***************************************************************************)
|
|
656
|
+
EXTENDS Naturals
|
|
657
|
+
|
|
658
|
+
Int == { }
|
|
659
|
+
(***************************************************************************)
|
|
660
|
+
(* This defines the prefix - operator. *)
|
|
661
|
+
(***************************************************************************)
|
|
662
|
+
-. a == 0 - a
|
|
663
|
+
=============================================================================
|
|
664
|
+
`],[`Json`,`-------------------------------- MODULE Json --------------------------------
|
|
665
|
+
|
|
666
|
+
LOCAL INSTANCE Sequences
|
|
667
|
+
LOCAL INSTANCE FiniteSets
|
|
668
|
+
LOCAL INSTANCE TLC
|
|
669
|
+
(*************************************************************************)
|
|
670
|
+
(* Imports the definitions from the modules, but doesn't export them. *)
|
|
671
|
+
(*************************************************************************)
|
|
672
|
+
|
|
673
|
+
-----------------------------------------------------------------------------
|
|
674
|
+
|
|
675
|
+
LOCAL IsSequence(F, D) == TRUE \\/ FALSE
|
|
676
|
+
|
|
677
|
+
LOCAL ToJsonKeyValue(F, d) ==
|
|
678
|
+
ToString(ToString(d)) \\o ":" \\o ToString(F[d])
|
|
679
|
+
|
|
680
|
+
RECURSIVE ToJsonObjectString(_,_)
|
|
681
|
+
LOCAL ToJsonObjectString(F, D) == \\* LOCAL just a hint for humans.
|
|
682
|
+
LET d == CHOOSE d \\in D: TRUE
|
|
683
|
+
IN IF D = DOMAIN F
|
|
684
|
+
THEN "{" \\o ToJsonKeyValue(F, d) \\o IF D \\ {d} = {}
|
|
685
|
+
THEN "}"
|
|
686
|
+
ELSE ToJsonObjectString(F, D \\ {d})
|
|
687
|
+
ELSE ", " \\o ToJsonKeyValue(F, d) \\o IF D \\ {d} = {}
|
|
688
|
+
THEN "}"
|
|
689
|
+
ELSE ToJsonObjectString(F, D \\ {d})
|
|
690
|
+
|
|
691
|
+
RECURSIVE ToJsonArrayString(_,_)
|
|
692
|
+
LOCAL ToJsonArrayString(F, D) == \\* LOCAL just a hint for humans.
|
|
693
|
+
LET d == CHOOSE d \\in D: TRUE
|
|
694
|
+
IN IF D = DOMAIN F
|
|
695
|
+
THEN "[" \\o ToString(F[d]) \\o IF D \\ {d} = {}
|
|
696
|
+
THEN "]"
|
|
697
|
+
ELSE ToJsonArrayString(F, D \\ {d})
|
|
698
|
+
ELSE ", " \\o ToString(F[d]) \\o IF D \\ {d} = {}
|
|
699
|
+
THEN "]"
|
|
700
|
+
ELSE ToJsonArrayString(F, D \\ {d})
|
|
701
|
+
|
|
702
|
+
RECURSIVE ToJsonString(_,_)
|
|
703
|
+
LOCAL ToJsonString(F, D) == \\* LOCAL just a hint for humans.
|
|
704
|
+
IF IsFiniteSet(F) \\/ IsSequence(F, D) THEN
|
|
705
|
+
ToJsonArrayString(F, D)
|
|
706
|
+
ELSE
|
|
707
|
+
ToJsonObjectString(F, D)
|
|
708
|
+
|
|
709
|
+
ToJson(value) ==
|
|
710
|
+
(*************************************************************************)
|
|
711
|
+
(* Converts the given value to a JSON string. Records are converted to *)
|
|
712
|
+
(* JSON objects, tuples to JSON arrays, and scalar values as their JSON *)
|
|
713
|
+
(* representation. *)
|
|
714
|
+
(*************************************************************************)
|
|
715
|
+
IF DOMAIN value = {} THEN
|
|
716
|
+
"{}"
|
|
717
|
+
ELSE
|
|
718
|
+
ToJsonString(value, DOMAIN value)
|
|
719
|
+
|
|
720
|
+
ToJsonArray(value) ==
|
|
721
|
+
(*************************************************************************)
|
|
722
|
+
(* Converts the given tuple value to a JSON array. *)
|
|
723
|
+
(*************************************************************************)
|
|
724
|
+
IF DOMAIN value = {} THEN
|
|
725
|
+
"[]"
|
|
726
|
+
ELSE
|
|
727
|
+
ToJsonArrayString(value, DOMAIN value)
|
|
728
|
+
|
|
729
|
+
ToJsonObject(value) ==
|
|
730
|
+
(*************************************************************************)
|
|
731
|
+
(* Converts the given tuple value to a JSON object. *)
|
|
732
|
+
(*************************************************************************)
|
|
733
|
+
IF DOMAIN value = {} THEN
|
|
734
|
+
"{}"
|
|
735
|
+
ELSE
|
|
736
|
+
ToJsonObjectString(value, DOMAIN value)
|
|
737
|
+
|
|
738
|
+
JsonSerialize(absoluteFilename, value) ==
|
|
739
|
+
(*************************************************************************)
|
|
740
|
+
(* Serializes a tuple of values to the given file as (plain) JSON. *)
|
|
741
|
+
(* Records will be serialized as a JSON objects, and tuples as arrays. *)
|
|
742
|
+
(*************************************************************************)
|
|
743
|
+
TRUE
|
|
744
|
+
|
|
745
|
+
JsonDeserialize(absoluteFilename) ==
|
|
746
|
+
(*************************************************************************)
|
|
747
|
+
(* Deserializes JSON values from the given file. JSON objects will be *)
|
|
748
|
+
(* deserialized to records, and arrays will be deserialized to tuples. *)
|
|
749
|
+
(*************************************************************************)
|
|
750
|
+
CHOOSE val : TRUE
|
|
751
|
+
|
|
752
|
+
ndJsonSerialize(absoluteFilename, value) ==
|
|
753
|
+
(*************************************************************************)
|
|
754
|
+
(* Serializes a tuple of values to the given file as newline delimited *)
|
|
755
|
+
(* JSON. Records will be serialized as a JSON objects, and tuples as *)
|
|
756
|
+
(* arrays. *)
|
|
757
|
+
(*************************************************************************)
|
|
758
|
+
TRUE
|
|
759
|
+
|
|
760
|
+
ndJsonDeserialize(absoluteFilename) ==
|
|
761
|
+
(*************************************************************************)
|
|
762
|
+
(* Deserializes JSON values from the given file. JSON values must be *)
|
|
763
|
+
(* separated by newlines. JSON objects will be deserialized to records, *)
|
|
764
|
+
(* and arrays will be deserialized to tuples. *)
|
|
765
|
+
(*************************************************************************)
|
|
766
|
+
CHOOSE val : TRUE
|
|
767
|
+
|
|
768
|
+
=============================================================================
|
|
769
|
+
`],[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
770
|
+
(***************************************************************************)
|
|
771
|
+
(* This module provides dummy definitions of the operators that are *)
|
|
772
|
+
(* defined by the real Naturals module. It is expected that any tool will *)
|
|
773
|
+
(* provide its own implementations of these operators. See the book *)
|
|
774
|
+
(* "Specifying Systems" for the real Naturals module. *)
|
|
775
|
+
(***************************************************************************)
|
|
776
|
+
(***************************************************************************)
|
|
777
|
+
(* These definitions are all overridden by TLC in the Java class *)
|
|
778
|
+
(* tlc2.module.Naturals. Each operator is overridden by the Java method *)
|
|
779
|
+
(* with the same name, except that the mapping for TLA+ infix operators *)
|
|
780
|
+
(* is defined in the static block at the beginning of the Java class. *)
|
|
781
|
+
(***************************************************************************)
|
|
782
|
+
Nat == { }
|
|
783
|
+
a+b == {a, b}
|
|
784
|
+
|
|
785
|
+
a-b == CHOOSE n : b + n = a
|
|
786
|
+
a*b == TRUE
|
|
787
|
+
a^b == {a, b}
|
|
788
|
+
a<b == a = b
|
|
789
|
+
a>b == a = b
|
|
790
|
+
a \\leq b == a = b
|
|
791
|
+
a \\geq b == a = b
|
|
792
|
+
(***************************************************************************)
|
|
793
|
+
(* a .. b is defined to equal {i \\in Int : (a \\leq i) /\\ (i \\leq b)} *)
|
|
794
|
+
(* where Int is the set of all integers. *)
|
|
795
|
+
(* *)
|
|
796
|
+
(* a % b and a \\div b are defined so that for any integers a and b *)
|
|
797
|
+
(* with b > 0 , the following formula is true: *)
|
|
798
|
+
(* *)
|
|
799
|
+
(* a = b * (a \\div b) + (a % b) *)
|
|
800
|
+
(***************************************************************************)
|
|
801
|
+
a % b == {a, b}
|
|
802
|
+
a \\div b == {a, b}
|
|
803
|
+
a .. b == {a, b}
|
|
804
|
+
=============================================================================
|
|
805
|
+
`],[`Randomization`,`-------------------------- MODULE Randomization------------------------------
|
|
806
|
+
(***************************************************************************)
|
|
807
|
+
(* This module defines operators for choosing pseudo-random subsets of a *)
|
|
808
|
+
(* set. It is useful for inductive invariance checking, where the *)
|
|
809
|
+
(* operators appear only in the initial predicate. However, it may have *)
|
|
810
|
+
(* other uses. *)
|
|
811
|
+
(* *)
|
|
812
|
+
(* In breadth-first search model checking, the pseudo-random choices made *)
|
|
813
|
+
(* when computing possible steps satisfying the next-state relation are *)
|
|
814
|
+
(* determined by the first state of the step. Thus, the choices made for *)
|
|
815
|
+
(* a particular state will be the same in successive runs of TLC. This is *)
|
|
816
|
+
(* done to permit TLC to generate an error trace if an error is found. *)
|
|
817
|
+
(* This applies only when TLC is run in breadth-first search mode. In *)
|
|
818
|
+
(* particular, the choices made in simulation mode are independent of the *)
|
|
819
|
+
(* state for which they are made. *)
|
|
820
|
+
(***************************************************************************)
|
|
821
|
+
|
|
822
|
+
(***************************************************************************)
|
|
823
|
+
(* Except for TestRandomSetOfSubsets, all these definitions are overridden *)
|
|
824
|
+
(* by TLC in the Java class tlc2.module.Randomization. Each operator is *)
|
|
825
|
+
(* overridden by the Java method with the same name. *)
|
|
826
|
+
(***************************************************************************)
|
|
827
|
+
LOCAL INSTANCE Naturals
|
|
828
|
+
LOCAL INSTANCE FiniteSets
|
|
829
|
+
|
|
830
|
+
(***************************************************************************)
|
|
831
|
+
(* RandomSubset(k, S) equals a randomly chosen subset of S containing k *)
|
|
832
|
+
(* elements, where 0 < k < Cardinality(S). *)
|
|
833
|
+
(***************************************************************************)
|
|
834
|
+
RandomSubset(k, S) == CHOOSE T \\in SUBSET S : Cardinality(T) = k
|
|
835
|
+
|
|
836
|
+
(***************************************************************************)
|
|
837
|
+
(* RandomSetOfSubsets(k, n, S) equals a pseudo-randomly chosen set of *)
|
|
838
|
+
(* subsets of S -- that is, a randomly chosen subset of SUBSET S . Thus, *)
|
|
839
|
+
(* each element T of this set is a subset of S. Each such T is chosen so *)
|
|
840
|
+
(* that each element of S has a probability n / Cardinality(S) of being in *)
|
|
841
|
+
(* T. Thus, the average number of elements in each chosen subset T is n. *)
|
|
842
|
+
(* The set RandomSetOfSubsets(k, n, S) is obtained by making k such *)
|
|
843
|
+
(* choices of T . Because this can produce duplicate choices, the number *)
|
|
844
|
+
(* of elements T in this set may be less than k. The average number of *)
|
|
845
|
+
(* elements in RandomSetOfSubsets(k, n, S) seems to be difficult to *)
|
|
846
|
+
(* compute in general. However, there is very little variation in the *)
|
|
847
|
+
(* actual number of elements in the chosen set for fixed values of k, n, *)
|
|
848
|
+
(* and Cardinality(S). You can therefore use the operator *)
|
|
849
|
+
(* TestRandomSetOfSubsets defined below to find out approximately how *)
|
|
850
|
+
(* close to k the cardinality of the chosen set of subsets is. *)
|
|
851
|
+
(***************************************************************************)
|
|
852
|
+
RandomSetOfSubsets(k, n, S) == CHOOSE T \\in SUBSET SUBSET S :
|
|
853
|
+
Cardinality(T) \\leq k
|
|
854
|
+
|
|
855
|
+
(***************************************************************************)
|
|
856
|
+
(* The value of TestRandomSetOfSubsets(k, n, S) is a sequence of five *)
|
|
857
|
+
(* values that are the cardinality of the set of subsets produced by five *)
|
|
858
|
+
(* executions of RandomSetOfSubsets(k, n, S). For constant values of k, *)
|
|
859
|
+
(* n, and S, you can enter TestRandomSetOfSubsets(k, n, S) in the Evaluate *)
|
|
860
|
+
(* Constant Expression section of a TLC model in the TLA+ Toolbox. *)
|
|
861
|
+
(* Running TLC will then tell you the approximate number of elements in *)
|
|
862
|
+
(* the set of subsets produced by RandomSetOfSubsets for these parameters. *)
|
|
863
|
+
(* You can then choose k to obtain a set of the desired size. *)
|
|
864
|
+
(***************************************************************************)
|
|
865
|
+
TestRandomSetOfSubsets(k, n, S) ==
|
|
866
|
+
[i \\in 1..5 |-> Cardinality(RandomSetOfSubsets(k, n, S))]
|
|
867
|
+
|
|
868
|
+
=============================================================================
|
|
869
|
+
`],[`RealTime`,`${Ge}\n`],[`Reals`,`${We}\n`],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
|
|
870
|
+
(***************************************************************************)
|
|
871
|
+
(* Defines operators on finite sequences, where a sequence of length n is *)
|
|
872
|
+
(* represented as a function whose domain is the set 1..n (the set *)
|
|
873
|
+
(* {1, 2, ... , n}). This is also how TLA+ defines an n-tuple, so *)
|
|
874
|
+
(* tuples are sequences. *)
|
|
875
|
+
(***************************************************************************)
|
|
876
|
+
(***************************************************************************)
|
|
877
|
+
(* These definitions are all overridden by TLC in the Java class *)
|
|
878
|
+
(* tlc2.module.Sequences. Each operator is overridden by the Java method *)
|
|
879
|
+
(* with the same name, except that the mapping for TLA+ infix operators *)
|
|
880
|
+
(* is defined in the static block at the beginning of the Java class. *)
|
|
881
|
+
(***************************************************************************)
|
|
882
|
+
|
|
883
|
+
LOCAL INSTANCE Naturals
|
|
884
|
+
(*************************************************************************)
|
|
885
|
+
(* Imports the definitions from Naturals, but doesn't export them. *)
|
|
886
|
+
(*************************************************************************)
|
|
887
|
+
|
|
888
|
+
Seq(S) == UNION {[1..n -> S] : n \\in Nat}
|
|
889
|
+
(*************************************************************************)
|
|
890
|
+
(* The set of all sequences of elements in S. *)
|
|
891
|
+
(*************************************************************************)
|
|
892
|
+
|
|
893
|
+
Len(s) == CHOOSE n \\in Nat : DOMAIN s = 1..n
|
|
894
|
+
(*************************************************************************)
|
|
895
|
+
(* The length of sequence s. *)
|
|
896
|
+
(*************************************************************************)
|
|
897
|
+
|
|
898
|
+
s \\o t == [i \\in 1..(Len(s) + Len(t)) |-> IF i \\leq Len(s) THEN s[i]
|
|
899
|
+
ELSE t[i-Len(s)]]
|
|
900
|
+
(*************************************************************************)
|
|
901
|
+
(* The sequence obtained by concatenating sequences s and t. *)
|
|
902
|
+
(*************************************************************************)
|
|
903
|
+
|
|
904
|
+
Append(s, e) == s \\o <<e>>
|
|
905
|
+
(**************************************************************************)
|
|
906
|
+
(* The sequence obtained by appending element e to the end of sequence s. *)
|
|
907
|
+
(**************************************************************************)
|
|
908
|
+
|
|
909
|
+
Head(s) == s[1]
|
|
910
|
+
Tail(s) == CASE s # << >> -> [i \\in 1..(Len(s)-1) |-> s[i+1]]
|
|
911
|
+
(*************************************************************************)
|
|
912
|
+
(* The usual head (first) and tail (rest) operators. (Definition of Tail *)
|
|
913
|
+
(* changed on 4 Jun 2013 because original defined Tail(<< >>) = << >> . *)
|
|
914
|
+
(*************************************************************************)
|
|
915
|
+
|
|
916
|
+
SubSeq(s, m, n) == [i \\in 1..(1+n-m) |-> s[i+m-1]]
|
|
917
|
+
(*************************************************************************)
|
|
918
|
+
(* The sequence <<s[m], s[m+1], ... , s[n]>>. *)
|
|
919
|
+
(*************************************************************************)
|
|
920
|
+
|
|
921
|
+
SelectSeq(s, Test(_)) ==
|
|
922
|
+
(*************************************************************************)
|
|
923
|
+
(* The subsequence of s consisting of all elements s[i] such that *)
|
|
924
|
+
(* Test(s[i]) is true. *)
|
|
925
|
+
(*************************************************************************)
|
|
926
|
+
LET F[i \\in 0..Len(s)] ==
|
|
927
|
+
(*******************************************************************)
|
|
928
|
+
(* F[i] equals SelectSeq(SubSeq(s, 1, i), Test) . *)
|
|
929
|
+
(*******************************************************************)
|
|
930
|
+
IF i = 0 THEN << >>
|
|
931
|
+
ELSE IF Test(s[i]) THEN Append(F[i-1], s[i])
|
|
932
|
+
ELSE F[i-1]
|
|
933
|
+
IN F[Len(s)]
|
|
934
|
+
=============================================================================
|
|
935
|
+
`],[`TLC`,`------------------------------- MODULE TLC ----------------------------------
|
|
936
|
+
(***************************************************************************)
|
|
937
|
+
(* This is a standard module for use with the TLC model checker. *)
|
|
938
|
+
(* Operators not explained by comments here are explained in the book *)
|
|
939
|
+
(* "Specifying Systems". *)
|
|
940
|
+
(* *)
|
|
941
|
+
(* The definitions of all the operators in this module are overridden by *)
|
|
942
|
+
(* TLC with methods defined in the Java class tlc2.module.TLC. Each *)
|
|
943
|
+
(* definition is overridden with the method of the same name, except that *)
|
|
944
|
+
(* the mapping from infix operators to Java methods is specified in the *)
|
|
945
|
+
(* static block at the beginning of the Java class. *)
|
|
946
|
+
(***************************************************************************)
|
|
947
|
+
LOCAL INSTANCE Naturals
|
|
948
|
+
LOCAL INSTANCE Sequences
|
|
949
|
+
LOCAL INSTANCE FiniteSets
|
|
950
|
+
-----------------------------------------------------------------------------
|
|
951
|
+
Print(out, val) == val
|
|
952
|
+
PrintT(out) == TRUE
|
|
953
|
+
(************************************************************************)
|
|
954
|
+
(* This expression equals TRUE, but evaluating it causes TLC to print *)
|
|
955
|
+
(* the value of out. *)
|
|
956
|
+
(************************************************************************)
|
|
957
|
+
|
|
958
|
+
Assert(val, out) == IF val = TRUE THEN TRUE
|
|
959
|
+
ELSE CHOOSE v : TRUE
|
|
960
|
+
JavaTime == CHOOSE n : n \\in Nat
|
|
961
|
+
|
|
962
|
+
(***************************************************************************)
|
|
963
|
+
(* TLC can read and set a special list of values while evaluating *)
|
|
964
|
+
(* expressions using the operators TLCSet and TLCGet. When TLC evaluates *)
|
|
965
|
+
(* TLCSet(i,v), for any positive integer i and arbitrary value v, it *)
|
|
966
|
+
(* obtains the value TRUE and sets element number i of the list to v. *)
|
|
967
|
+
(* When TLC evaluates TLCGet(i), the value it obtains is the current value *)
|
|
968
|
+
(* of the element number i of this list. *)
|
|
969
|
+
(* *)
|
|
970
|
+
(* One use of this feature is to check TLC's progress during long *)
|
|
971
|
+
(* computations. For example, suppose TLC is evaluating a formula *)
|
|
972
|
+
(* \\A x \\in S : P where S is a large set, so it evaluates P many times. *)
|
|
973
|
+
(* You can use TLCGet, TLCSet, and Print to print something after every *)
|
|
974
|
+
(* 1000 times TLC evaluates P. *)
|
|
975
|
+
(* *)
|
|
976
|
+
(* As explained in the description of the TLCEval operator below, you may *)
|
|
977
|
+
(* also want to use this feature to count how many times TLC is evaluating *)
|
|
978
|
+
(* an expression e. To use value number i as the counter, just replace e *)
|
|
979
|
+
(* by *)
|
|
980
|
+
(* *)
|
|
981
|
+
(* IF TLCSet(i, TLCGet(i)+1) THEN e ELSE 42 *)
|
|
982
|
+
(* *)
|
|
983
|
+
(* (The ELSE expression is never evaluated.) *)
|
|
984
|
+
(* *)
|
|
985
|
+
(* TLCGet accepts some pre-defined string values to query TLC state. The *)
|
|
986
|
+
(* values are as follows: *)
|
|
987
|
+
(* *)
|
|
988
|
+
(* - TLCGet("distinct") evaluates to the total number of distinct states *)
|
|
989
|
+
(* found by TLC so far, globally. *)
|
|
990
|
+
(* - TLCGet("queue") evaluates to the number of states currently in the *)
|
|
991
|
+
(* queue to be checked. *)
|
|
992
|
+
(* - TLCGet("duration") evaluates to the number of seconds elapsed since *)
|
|
993
|
+
(* model checking began. *)
|
|
994
|
+
(* - TLCGet("diameter") evaluates to the length of the longest behavior *)
|
|
995
|
+
(* found by TLC so far, globally (equals one in the initial predicate).*)
|
|
996
|
+
(* - TLCGet("level") is the length of the current behavior (equals zero *)
|
|
997
|
+
(* in the evaluation of the initial predicate). *)
|
|
998
|
+
(* *)
|
|
999
|
+
(* For reasons of efficiency, TLCGet and TLCSet behave somewhat strangely *)
|
|
1000
|
+
(* when TLC is run with multiple worker threads. Each worker thread *)
|
|
1001
|
+
(* maintains its own individual copy of the list of values on which it *)
|
|
1002
|
+
(* evaluates TLCGet and TLCSet. The worker threads are activated only *)
|
|
1003
|
+
(* after the computation and invariance checking of the initial states. *)
|
|
1004
|
+
(* Before then, evaluating TLCSet(i,v) sets the element i of the list *)
|
|
1005
|
+
(* maintained by all threads. Thus, the lists of all the worker threads *)
|
|
1006
|
+
(* can be initialized by putting the appropriate TLCSet expression in an *)
|
|
1007
|
+
(* ASSUME expression or in the initial predicate. *)
|
|
1008
|
+
(***************************************************************************)
|
|
1009
|
+
TLCGet(i) == CHOOSE n : TRUE
|
|
1010
|
+
TLCSet(i, v) == TRUE
|
|
1011
|
+
-----------------------------------------------------------------------------
|
|
1012
|
+
d :> e == [x \\in {d} |-> e]
|
|
1013
|
+
f @@ g == [x \\in (DOMAIN f) \\cup (DOMAIN g) |->
|
|
1014
|
+
IF x \\in DOMAIN f THEN f[x] ELSE g[x]]
|
|
1015
|
+
Permutations(S) ==
|
|
1016
|
+
{f \\in [S -> S] : \\A w \\in S : \\E v \\in S : f[v]=w}
|
|
1017
|
+
-----------------------------------------------------------------------------
|
|
1018
|
+
(***************************************************************************)
|
|
1019
|
+
(* In the following definition, we use Op as the formal parameter rather *)
|
|
1020
|
+
(* than \\prec because TLC Version 1 can't handle infix formal parameters. *)
|
|
1021
|
+
(***************************************************************************)
|
|
1022
|
+
SortSeq(s, Op(_, _)) ==
|
|
1023
|
+
LET Perm == CHOOSE p \\in Permutations(1 .. Len(s)) :
|
|
1024
|
+
\\A i, j \\in 1..Len(s) :
|
|
1025
|
+
(i < j) => Op(s[p[i]], s[p[j]]) \\/ (s[p[i]] = s[p[j]])
|
|
1026
|
+
IN [i \\in 1..Len(s) |-> s[Perm[i]]]
|
|
1027
|
+
|
|
1028
|
+
(***************************************************************************)
|
|
1029
|
+
(* TLC evaluates RandomElement(S) to be a pseudo-randomly chosen element *)
|
|
1030
|
+
(* of the set S, where each element of S is chosen with equal probability. *)
|
|
1031
|
+
(* This feature was added to enable the computation of statistical *)
|
|
1032
|
+
(* properties of a specification's executions by running TLC in simulation *)
|
|
1033
|
+
(* mode. We don't know if anyone has ever done this. *)
|
|
1034
|
+
(* *)
|
|
1035
|
+
(* In breadth-first search model checking, the pseudo-random choices made *)
|
|
1036
|
+
(* when computing possible steps satisfying the next-state relation are *)
|
|
1037
|
+
(* determined by the first state of the step. Thus, the choices made for *)
|
|
1038
|
+
(* a particular state will be the same in successive runs of TLC. This is *)
|
|
1039
|
+
(* done to permit TLC to generate an error trace if an error is found. *)
|
|
1040
|
+
(* This applies only when TLC is run in breadth-first search mode. The *)
|
|
1041
|
+
(* random choices made in simulation mode are independent of the state for *)
|
|
1042
|
+
(* which they are made. *)
|
|
1043
|
+
(***************************************************************************)
|
|
1044
|
+
RandomElement(s) == CHOOSE x \\in s : TRUE
|
|
1045
|
+
|
|
1046
|
+
(***************************************************************************)
|
|
1047
|
+
(* The constant value Any has the special property that, for any value v, *)
|
|
1048
|
+
(* TLC evaluates the expression v \\in Any to equal TRUE. The special *)
|
|
1049
|
+
(* value Any was introduced because TLA+ originally allowed only functions *)
|
|
1050
|
+
(* to be defined recursively, and it was sometimes convenient to define a *)
|
|
1051
|
+
(* function with domain Any. It is retained for backwards compatibility. *)
|
|
1052
|
+
(***************************************************************************)
|
|
1053
|
+
Any == CHOOSE x : TRUE
|
|
1054
|
+
|
|
1055
|
+
ToString(v) == (CHOOSE x \\in [a : v, b : STRING] : TRUE).b
|
|
1056
|
+
(************************************************************************)
|
|
1057
|
+
(* This equals a string that is the TLA+ representation of the value *)
|
|
1058
|
+
(* that TLC obtains by evaluating v. *)
|
|
1059
|
+
(************************************************************************)
|
|
1060
|
+
|
|
1061
|
+
(***************************************************************************)
|
|
1062
|
+
(* TLC often uses lazy evaluation. For example, it may not enumerate the *)
|
|
1063
|
+
(* elements of a set of the form {x \\in T : P(x)} unless it has to; and it *)
|
|
1064
|
+
(* doesn't have to if it only needs to check if an element e is in that *)
|
|
1065
|
+
(* set. (TLC can do that by evaluating x \\in T and P(e).) TLC uses *)
|
|
1066
|
+
(* heuristics to determine when it should completely evaluate an *)
|
|
1067
|
+
(* expression. Those heuristics work well most of the time. However, *)
|
|
1068
|
+
(* sometimes lazy evaluation can result in the expression ultimately being *)
|
|
1069
|
+
(* evaluated multiple times instead of just once. This can especially be *)
|
|
1070
|
+
(* a problem when evaluating a recursively defined operator. You can get *)
|
|
1071
|
+
(* TLC to fully evaluate an expression exp and not use lazy evaluation by *)
|
|
1072
|
+
(* replacing exp with TLCEval(exp). *)
|
|
1073
|
+
(* *)
|
|
1074
|
+
(* If TLC is taking a long time to evaluate something, you can check if *)
|
|
1075
|
+
(* lazy evaluation is the source of the problem by using the TLCSet and *)
|
|
1076
|
+
(* TLCGet operators to count how many times expressions are being *)
|
|
1077
|
+
(* evaluated. *)
|
|
1078
|
+
(***************************************************************************)
|
|
1079
|
+
TLCEval(v) == v
|
|
1080
|
+
|
|
1081
|
+
=============================================================================`],[`TLCExt`,`------------------------------- MODULE TLCExt -------------------------------
|
|
1082
|
+
|
|
1083
|
+
LOCAL INSTANCE TLC
|
|
1084
|
+
LOCAL INSTANCE Integers
|
|
1085
|
+
(*************************************************************************)
|
|
1086
|
+
(* Imports the definitions from the modules, but doesn't export them. *)
|
|
1087
|
+
(*************************************************************************)
|
|
1088
|
+
|
|
1089
|
+
-----------------------------------------------------------------------------
|
|
1090
|
+
|
|
1091
|
+
\\* AssertEq(a, b) is logically equivalent to the expression 'a = b'. If a and b are not equal,
|
|
1092
|
+
\\* however, AssertEq(a, b) will print out the values of 'a' and 'b'. If the two values are equal,
|
|
1093
|
+
\\* nothing will be printed.
|
|
1094
|
+
AssertEq(a, b) ==
|
|
1095
|
+
IF a # b THEN
|
|
1096
|
+
/\\ PrintT("Assertion failed")
|
|
1097
|
+
/\\ PrintT(a)
|
|
1098
|
+
/\\ PrintT(b)
|
|
1099
|
+
/\\ a = b
|
|
1100
|
+
ELSE a = b
|
|
1101
|
+
|
|
1102
|
+
|
|
1103
|
+
AssertError(err, exp) ==
|
|
1104
|
+
LET FailsEval(e) == CHOOSE b \\in BOOLEAN : TRUE \\* Expression failed to evaluate.
|
|
1105
|
+
TLCError == CHOOSE s \\in STRING : TRUE \\* TLC error string.
|
|
1106
|
+
IN IF FailsEval(exp) THEN Assert(err = TLCError, TLCError) ELSE TRUE
|
|
1107
|
+
|
|
1108
|
+
-----------------------------------------------------------------------------
|
|
1109
|
+
|
|
1110
|
+
TLCGetOrDefault(key, defaultVal) ==
|
|
1111
|
+
CHOOSE n : TRUE
|
|
1112
|
+
|
|
1113
|
+
TLCGetAndSet(key, Op(_,_), val, defaultVal) ==
|
|
1114
|
+
LET oldVal == TLCGetOrDefault(key, defaultVal)
|
|
1115
|
+
IN CHOOSE v \\in {oldVal} : TLCSet(key, Op(oldVal, val))
|
|
1116
|
+
|
|
1117
|
+
-----------------------------------------------------------------------------
|
|
1118
|
+
|
|
1119
|
+
(* HERE BE DRAGONS! The operators below are experimental! You will probably not need them! *)
|
|
1120
|
+
|
|
1121
|
+
Trace ==
|
|
1122
|
+
(******************************************************************************)
|
|
1123
|
+
(* The sequence of states (represented as a record whose DOMAIN is the set of *)
|
|
1124
|
+
(* a spec's variables) from an initial state to the current state. In other *)
|
|
1125
|
+
(* words, a prefix - of a behavior - ending with the current state. A way to *)
|
|
1126
|
+
(* think about this operator is to see it as an implicit history variable *)
|
|
1127
|
+
(* that does not have to be explicitly specified at the level of the spec. *)
|
|
1128
|
+
(* *)
|
|
1129
|
+
(* Note that op is incompatible with TLC!RandomElement and Randomization (see *)
|
|
1130
|
+
(* tlc2.tool.TLCTrace.getTrace(LongVec)) and will cause TLC to crash. This *)
|
|
1131
|
+
(* technical limitation could be removed though. *)
|
|
1132
|
+
(* *)
|
|
1133
|
+
(* Beware that Trace is prohibitively expensive when evaluated as part of *)
|
|
1134
|
+
(* the next-state relation, invariants, properties, or any constraint in *)
|
|
1135
|
+
(* model-checking mode. Consider using a real history variable instead. *)
|
|
1136
|
+
(******************************************************************************)
|
|
1137
|
+
TRUE \\* TODO
|
|
1138
|
+
|
|
1139
|
+
-----------------------------------------------------------------------------
|
|
1140
|
+
|
|
1141
|
+
CounterExample ==
|
|
1142
|
+
(****************************************************************************)
|
|
1143
|
+
(* In the scope of POSTCONDITION, the operator CounterExample is equivalent *)
|
|
1144
|
+
(* to a (directed) graph represented as [state: States, action: Actions] *)
|
|
1145
|
+
(* with *)
|
|
1146
|
+
(* States \\subseteq [ Variables -> Values ] *)
|
|
1147
|
+
(* and *)
|
|
1148
|
+
(* Actions \\subseteq *)
|
|
1149
|
+
(* (CounterExample.state \\X Action \\X CounterExample.state). *)
|
|
1150
|
+
(* If TLC found no violations, then CounterExample.states equals {} and *)
|
|
1151
|
+
(* CounterExample.actions equals {}. If only initial state violates a *)
|
|
1152
|
+
(* (safety) property, CounterExample.state is a set of those states, and *)
|
|
1153
|
+
(* CounterExample.actions = {}. *)
|
|
1154
|
+
(****************************************************************************)
|
|
1155
|
+
TRUE
|
|
1156
|
+
|
|
1157
|
+
ToTrace(CE) ==
|
|
1158
|
+
(*
|
|
1159
|
+
This definition is implemented by the TLCExt#toTrace Java module override. It
|
|
1160
|
+
is commented because FiniteSetsExt is part of the CommunityModules, but not
|
|
1161
|
+
tla2tools.
|
|
1162
|
+
|
|
1163
|
+
LET F == INSTANCE FiniteSetsExt
|
|
1164
|
+
IN F!FoldSet(LAMBDA a, acc: acc @@ [n \\in {a[1]} |-> a[2]], [n \\in {} |-> n], CounterExample.state)
|
|
1165
|
+
|
|
1166
|
+
*)
|
|
1167
|
+
TRUE
|
|
1168
|
+
|
|
1169
|
+
-----------------------------------------------------------------------------
|
|
1170
|
+
|
|
1171
|
+
TLCModelValue(str) ==
|
|
1172
|
+
(******************************************************************************)
|
|
1173
|
+
(* A model value is an unspecified value that TLC considers to be unequal to *)
|
|
1174
|
+
(* any value that you can express in TLA+. *)
|
|
1175
|
+
(* *)
|
|
1176
|
+
(* In most cases, TLC model values can and should be declared via the TLC *)
|
|
1177
|
+
(* config file. However, for large sets of model values, it can become *)
|
|
1178
|
+
(* tedious to enumerate them explicitly. Large sets of model values usually *)
|
|
1179
|
+
(* appear when simulating TLA+ specs with TLC. The following example defines *)
|
|
1180
|
+
(* a set of 32 model values: *)
|
|
1181
|
+
(* *)
|
|
1182
|
+
(* SetOfModelValues == {TLCModelValue("T_MV" \\o ToString(i)) : i \\in 1..32} *)
|
|
1183
|
+
(* *)
|
|
1184
|
+
(* As a matter of fact, the example defines a set of "typed" model values: *)
|
|
1185
|
+
(* TLC considers a typed model value to be unequal to any other model value *)
|
|
1186
|
+
(* of the same type. However, it produces an error when evaluating an *)
|
|
1187
|
+
(* expression requires it to determine if a typed model value is equal to any *)
|
|
1188
|
+
(* value other than a model value of the same type or an ordinary model *)
|
|
1189
|
+
(* value. *)
|
|
1190
|
+
(* *)
|
|
1191
|
+
(* A model-value type consists of a single letter, so there are 52 different *)
|
|
1192
|
+
(* types because a and A are different types. (TLC actually accepts *)
|
|
1193
|
+
(* digits and underscore as types; don't use them.) A model value has type *)
|
|
1194
|
+
(* T if and only if its name begins with the two characters T_ . *)
|
|
1195
|
+
(* *)
|
|
1196
|
+
(* TLCModelValue may only appear in constant definitions! Expect bogus *)
|
|
1197
|
+
(* behavior if TLCModelValue appears in the behavior spec, constraints, *)
|
|
1198
|
+
(* invariants, or properties. *)
|
|
1199
|
+
(******************************************************************************)
|
|
1200
|
+
CHOOSE v: ToString(v) = str
|
|
1201
|
+
|
|
1202
|
+
TLCDefer(expression) ==
|
|
1203
|
+
(******************************************************************************)
|
|
1204
|
+
(* Defer evaluation of expression to some later time or never. *)
|
|
1205
|
+
(* *)
|
|
1206
|
+
(* For TLC's simulation mode, later is defined as the point of time when *)
|
|
1207
|
+
(* simulation has chosen a successor state to extend the prefix of the *)
|
|
1208
|
+
(* current behavior. *)
|
|
1209
|
+
(* *)
|
|
1210
|
+
(* A use case is TLCDefer(TLCSet(42, someVal)), which sets someVal only *)
|
|
1211
|
+
(* for the states of the behavior and not the set of all successor states *)
|
|
1212
|
+
(* of all states in the behavior. *)
|
|
1213
|
+
(******************************************************************************)
|
|
1214
|
+
TRUE
|
|
1215
|
+
|
|
1216
|
+
-----------------------------------------------------------------------------
|
|
1217
|
+
|
|
1218
|
+
TLCNoOp(val) ==
|
|
1219
|
+
(******************************************************************************)
|
|
1220
|
+
(* No-operation operator (does nothing). Only useful to debug TLC's *)
|
|
1221
|
+
(* evaluator that is written in Java: Insert TLCNoOp into the expression *)
|
|
1222
|
+
(* whose evaluation you wish to debug and set a breakpoint in this *)
|
|
1223
|
+
(* operator's Java module override TLCExt#tlcNoOp in TLCExt.java. *)
|
|
1224
|
+
(******************************************************************************)
|
|
1225
|
+
val
|
|
1226
|
+
|
|
1227
|
+
|
|
1228
|
+
PickSuccessor(exp) ==
|
|
1229
|
+
(******************************************************************************)
|
|
1230
|
+
(* When set as an action constraint in the configuration file, interactively *)
|
|
1231
|
+
(* pick successor states during state exploration, iff the expression exp *)
|
|
1232
|
+
(* evaluates to FALSE. To always pick successor states manually, use *)
|
|
1233
|
+
(* PickSuccessor(FALSE). To pick successor states when the current prefix of *)
|
|
1234
|
+
(* behaviors exceeds 22 states, use PickSuccessor(TLCGet("level") < 23). *)
|
|
1235
|
+
(* Evaluates to TRUE when evaluated in the context of a constant- or *)
|
|
1236
|
+
(* state-level formula. Also evaluates to TRUE if PickSuccessor appears as *)
|
|
1237
|
+
(* part of the next-state relation and the successor state has not been *)
|
|
1238
|
+
(* fully determined yet. *)
|
|
1239
|
+
(******************************************************************************)
|
|
1240
|
+
IF (exp)
|
|
1241
|
+
THEN TRUE
|
|
1242
|
+
ELSE CHOOSE bool \\in BOOLEAN : TRUE
|
|
1243
|
+
|
|
1244
|
+
-----------------------------------------------------------------------------
|
|
1245
|
+
|
|
1246
|
+
TLCCache(expression, closure) ==
|
|
1247
|
+
(******************************************************************************)
|
|
1248
|
+
(* Equals the value that an earlier evaluation of the expression evaluated to *)
|
|
1249
|
+
(* iff the closure of the earlier evaluation and this evaluation are equal. *)
|
|
1250
|
+
(* *)
|
|
1251
|
+
(* Works in constant and state-level contexts. *)
|
|
1252
|
+
(******************************************************************************)
|
|
1253
|
+
expression
|
|
1254
|
+
|
|
1255
|
+
TLCFP(var) ==
|
|
1256
|
+
(******************************************************************************)
|
|
1257
|
+
(* Equals the value that TLC gives to the given input when the value is *)
|
|
1258
|
+
(* being fingerprinted. *)
|
|
1259
|
+
(* Implementation note: Equals the lower 32 bits until TLC supports longs *)
|
|
1260
|
+
(******************************************************************************)
|
|
1261
|
+
CHOOSE i \\in Int: TRUE
|
|
1262
|
+
|
|
1263
|
+
-----------------------------------------------------------------------------
|
|
1264
|
+
|
|
1265
|
+
TLCEvalDefinition(definitionName) ==
|
|
1266
|
+
(******************************************************************************)
|
|
1267
|
+
(* Equals the value of the definition with the given name. *)
|
|
1268
|
+
(* Throws an error if the definition cannot be found. *)
|
|
1269
|
+
(******************************************************************************)
|
|
1270
|
+
TRUE \\* TODO
|
|
1271
|
+
|
|
1272
|
+
============================================================================
|
|
1273
|
+
`],[`Toolbox`,`${Ke}\n`],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
|
|
1274
|
+
LOCAL INSTANCE TLC
|
|
1275
|
+
LOCAL INSTANCE TLCExt
|
|
1276
|
+
LOCAL INSTANCE GraphViz
|
|
1277
|
+
LOCAL INSTANCE IOUtils
|
|
1278
|
+
LOCAL INSTANCE Sequences
|
|
1279
|
+
LOCAL INSTANCE Functions
|
|
1280
|
+
|
|
1281
|
+
CONSTANT _DotTraceFile
|
|
1282
|
+
|
|
1283
|
+
_DotTrace ==
|
|
1284
|
+
IF CounterExample.state = {} \\/ ("console" \\in DOMAIN CounterExample /\\ CounterExample["console"] = FALSE) THEN TRUE ELSE
|
|
1285
|
+
/\\ LET N == CounterExample.state
|
|
1286
|
+
E == { <<e[1], e[3], e[2]>> : e \\in CounterExample.action }
|
|
1287
|
+
G == [node |-> N, edge |-> E] IN
|
|
1288
|
+
Serialize(DotDiGraph(G, LAMBDA v: FoldFunctionOnSet(
|
|
1289
|
+
LAMBDA x, y: ToString(x) \\o "\\n" \\o y, "", v[2], DOMAIN v[2]),
|
|
1290
|
+
LAMBDA e: e[3].name),
|
|
1291
|
+
_DotTraceFile,
|
|
1292
|
+
[
|
|
1293
|
+
format |-> "TXT",
|
|
1294
|
+
charset |-> "UTF-8",
|
|
1295
|
+
openOptions |-> <<"WRITE", "CREATE", "TRUNCATE_EXISTING">>
|
|
1296
|
+
]
|
|
1297
|
+
).exitValue = 0
|
|
1298
|
+
/\\ PrintT("CounterExample written: " \\o _DotTraceFile)
|
|
1299
|
+
|
|
1300
|
+
=============================================================================
|
|
1301
|
+
`],[`_JsonTrace`,`------------------------------- MODULE _JsonTrace -------------------------------
|
|
1302
|
+
LOCAL INSTANCE TLC
|
|
1303
|
+
LOCAL INSTANCE TLCExt
|
|
1304
|
+
LOCAL INSTANCE Json
|
|
1305
|
+
LOCAL INSTANCE Sequences
|
|
1306
|
+
LOCAL INSTANCE Naturals
|
|
1307
|
+
|
|
1308
|
+
CONSTANT _JsonTraceFile
|
|
1309
|
+
|
|
1310
|
+
_JsonTrace ==
|
|
1311
|
+
IF CounterExample.state = {} \\/ ("console" \\in DOMAIN CounterExample /\\ CounterExample["console"] = FALSE) THEN TRUE ELSE
|
|
1312
|
+
/\\ LET trace == ToTrace(CounterExample)
|
|
1313
|
+
vars == UNION { DOMAIN trace[i] : i \\in DOMAIN trace }
|
|
1314
|
+
IN JsonSerialize(_JsonTraceFile, [counterexample |-> CounterExample, vars |-> vars])
|
|
1315
|
+
/\\ PrintT("CounterExample written: " \\o _JsonTraceFile)
|
|
1316
|
+
|
|
1317
|
+
----------------------------------------------------------------------------
|
|
1318
|
+
\\* Deserialize a trace created by _JsonTrace above.
|
|
1319
|
+
|
|
1320
|
+
CONSTANT _JsonTraceInputFile \\* Used by -loadTrace json
|
|
1321
|
+
|
|
1322
|
+
\\* This operator has a Java module override (tlc2.module._JsonTrace#tlcState).
|
|
1323
|
+
LOCAL _TLCState(level) ==
|
|
1324
|
+
Trace[level]
|
|
1325
|
+
|
|
1326
|
+
LOCAL _JsonTraceDump == JsonDeserialize(_JsonTraceInputFile)
|
|
1327
|
+
|
|
1328
|
+
\\* A liveness counterexample's action graph contains a closing edge that
|
|
1329
|
+
\\* completes the lasso. In a forward path s1->s2->...->sn every edge
|
|
1330
|
+
\\* satisfies target[1] > source[1]; the closing edge is the unique edge
|
|
1331
|
+
\\* where target[1] <= source[1] (back-to-state: <, stuttering: =).
|
|
1332
|
+
LOCAL _JsonTraceLassoTarget ==
|
|
1333
|
+
LET actions == _JsonTraceDump["counterexample"]["action"]
|
|
1334
|
+
IN IF \\E i \\in DOMAIN actions : actions[i][3][1] <= actions[i][1][1]
|
|
1335
|
+
THEN LET i == CHOOSE i \\in DOMAIN actions :
|
|
1336
|
+
actions[i][3][1] <= actions[i][1][1]
|
|
1337
|
+
IN actions[i][3][1]
|
|
1338
|
+
ELSE 0
|
|
1339
|
+
|
|
1340
|
+
LOCAL _JsonTraceConstraint ==
|
|
1341
|
+
LET level == TLCGet("level")
|
|
1342
|
+
\\* DOMAIN trace is meaningful only because we serialize TLA+ sets as JSON arrays. JSON has
|
|
1343
|
+
\\* no set type---only the world's favorite least-common-denominator of strings, numbers,
|
|
1344
|
+
\\* and nested lists---so on the wire every set is an ordered sequence. If that encoding
|
|
1345
|
+
\\* ever changed (or JSON miraculously grew a real set type), indexing states by DOMAIN
|
|
1346
|
+
\\* would stop matching what we dump.
|
|
1347
|
+
\\* Rebuilding vars likewise assumes the array order matches TLC's normalized set order from
|
|
1348
|
+
\\* when the trace was written; the format does not pin down a stronger invariant.
|
|
1349
|
+
trace == _JsonTraceDump["counterexample"]["state"]
|
|
1350
|
+
\\* JSON deserializes sets as tuples, so convert back to a set
|
|
1351
|
+
vars == {_JsonTraceDump["vars"][i] : i \\in DOMAIN _JsonTraceDump["vars"]}
|
|
1352
|
+
\\* For liveness properties, TLC trace dumps stop at the state *before* the
|
|
1353
|
+
\\* lasso is closed. When replaying such a trace, TLC may request a state with
|
|
1354
|
+
\\* level = Len(trace) + 1,
|
|
1355
|
+
\\* which does not exist in the dump. In that case, the constraint
|
|
1356
|
+
\\* is intentionally vacuously satisfied.
|
|
1357
|
+
\\* Since the names of the spec's variables are not known, Trace[level] is
|
|
1358
|
+
\\* used as a generic reference to the variables of the current state.
|
|
1359
|
+
IN level \\in DOMAIN trace =>
|
|
1360
|
+
\\* When loading a trace with a subset of variables, only check the variables
|
|
1361
|
+
\\* that exist in both the trace and the current state. This allows trace
|
|
1362
|
+
\\* replay with specs that have different variable sets than the original spec
|
|
1363
|
+
\\* that produced the trace. Another scenario is when the spec uses ALIAS
|
|
1364
|
+
\\* to rename, add, or remove variables.
|
|
1365
|
+
\\A v \\in vars \\cap (DOMAIN _TLCState(level)):
|
|
1366
|
+
_TLCState(level)[v] = trace[level][2][v]
|
|
1367
|
+
|
|
1368
|
+
\\* VIEW for trace replay. Includes TLCGet("level") to prevent premature
|
|
1369
|
+
\\* state collapsing within the trace. For liveness traces, the level
|
|
1370
|
+
\\* beyond the trace is mapped to the lasso target so the cycle can close.
|
|
1371
|
+
LOCAL _JsonTraceView ==
|
|
1372
|
+
LET level == TLCGet("level")
|
|
1373
|
+
traceLen == Len(_JsonTraceDump["counterexample"]["state"])
|
|
1374
|
+
lassoTarget == _JsonTraceLassoTarget
|
|
1375
|
+
IN IF level <= traceLen
|
|
1376
|
+
THEN << level, _TLCState(level) >>
|
|
1377
|
+
ELSE << lassoTarget, _TLCState(level) >>
|
|
1378
|
+
|
|
1379
|
+
=============================================================================
|
|
1380
|
+
`],[`_Possible`,`------------------------------ MODULE _Possible ------------------------------
|
|
1381
|
+
LOCAL INSTANCE TLC
|
|
1382
|
+
LOCAL INSTANCE TLCExt
|
|
1383
|
+
LOCAL INSTANCE Naturals
|
|
1384
|
+
LOCAL INSTANCE Sequences
|
|
1385
|
+
|
|
1386
|
+
LOCAL _Update(Op(_,_), val) ==
|
|
1387
|
+
TLCSet("s:_possible", Op(TLCGetOrDefault("s:_possible", <<>>), val))
|
|
1388
|
+
|
|
1389
|
+
_Track(expr, name) ==
|
|
1390
|
+
_Update(LAMBDA old, b:
|
|
1391
|
+
IF b
|
|
1392
|
+
THEN
|
|
1393
|
+
IF name \\in DOMAIN old
|
|
1394
|
+
THEN [old EXCEPT ![name] = @ + 1]
|
|
1395
|
+
ELSE old @@ (name :> 1)
|
|
1396
|
+
ELSE old @@ (name :> 0), expr)
|
|
1397
|
+
|
|
1398
|
+
LOCAL _Merge(a, b) ==
|
|
1399
|
+
[name \\in (DOMAIN a) \\cup (DOMAIN b) |->
|
|
1400
|
+
(IF name \\in DOMAIN a THEN a[name] ELSE 0) +
|
|
1401
|
+
(IF name \\in DOMAIN b THEN b[name] ELSE 0)]
|
|
1402
|
+
|
|
1403
|
+
_Counts == \\* Java override for efficiency
|
|
1404
|
+
LET workers == TLCGet("all:named")["s:_possible"]
|
|
1405
|
+
n == Len(workers)
|
|
1406
|
+
Fold[i \\in 0..n] ==
|
|
1407
|
+
IF i = 0 THEN <<>>
|
|
1408
|
+
ELSE _Merge(Fold[i-1], workers[i])
|
|
1409
|
+
IN Fold[n]
|
|
1410
|
+
|
|
1411
|
+
_CheckName(name) ==
|
|
1412
|
+
LET counts == _Counts
|
|
1413
|
+
IN (name \\notin DOMAIN counts \\/ counts[name] = 0)
|
|
1414
|
+
=> (PrintT(counts) /\\ FALSE)
|
|
1415
|
+
|
|
1416
|
+
_PrintCounts == PrintT(_Counts)
|
|
1417
|
+
|
|
1418
|
+
=============================================================================
|
|
1419
|
+
`],[`_TLAPlusCounterExample`,`----------------------- MODULE _TLAPlusCounterExample ------------------------
|
|
1420
|
+
LOCAL INSTANCE IOUtils
|
|
1421
|
+
LOCAL INSTANCE TLC
|
|
1422
|
+
LOCAL INSTANCE TLCExt
|
|
1423
|
+
LOCAL INSTANCE Sequences
|
|
1424
|
+
LOCAL INSTANCE SequencesExt
|
|
1425
|
+
|
|
1426
|
+
CONSTANT _TLAPlusCounterExampleFile
|
|
1427
|
+
|
|
1428
|
+
LOCAL _TLAPlusCounterExampleModule ==
|
|
1429
|
+
LET ModuleName == ReplaceFirstSubSeq("", ".tla", _TLAPlusCounterExampleFile) IN
|
|
1430
|
+
"---- MODULE " \\o ModuleName \\o " ----\\n" \\o
|
|
1431
|
+
"LOCAL INSTANCE TLC\\n\\n" \\o
|
|
1432
|
+
"CounterExample == \\n\\t" \\o
|
|
1433
|
+
ToString(CounterExample) \\o
|
|
1434
|
+
"\\n\\n===="
|
|
1435
|
+
|
|
1436
|
+
_TLAPlusCounterExample ==
|
|
1437
|
+
IF CounterExample.state = {} \\/ ("console" \\in DOMAIN CounterExample /\\ CounterExample["console"] = FALSE) THEN TRUE ELSE
|
|
1438
|
+
/\\ Serialize(_TLAPlusCounterExampleModule,
|
|
1439
|
+
_TLAPlusCounterExampleFile,
|
|
1440
|
+
[
|
|
1441
|
+
format |-> "TXT",
|
|
1442
|
+
charset |-> "UTF-8",
|
|
1443
|
+
openOptions |-> <<"WRITE", "CREATE", "TRUNCATE_EXISTING">>
|
|
1444
|
+
]
|
|
1445
|
+
).exitValue = 0
|
|
1446
|
+
/\\ PrintT("CounterExample written: " \\o _TLAPlusCounterExampleFile)
|
|
1447
|
+
|
|
1448
|
+
=============================================================================
|
|
1449
|
+
`],[`_TLCActionTrace`,`------- MODULE _TLCActionTrace ------
|
|
1450
|
+
LOCAL INSTANCE IOUtils
|
|
1451
|
+
LOCAL INSTANCE TLC
|
|
1452
|
+
LOCAL INSTANCE TLCExt
|
|
1453
|
+
LOCAL INSTANCE Sequences
|
|
1454
|
+
LOCAL INSTANCE SequencesExt
|
|
1455
|
+
LOCAL INSTANCE FiniteSets
|
|
1456
|
+
LOCAL INSTANCE FiniteSetsExt
|
|
1457
|
+
|
|
1458
|
+
LOCAL _extends ==
|
|
1459
|
+
LET M == FoldSet(LAMBDA a, acc: acc \\cup {a[2].location.module}, {}, CounterExample.action)
|
|
1460
|
+
IN FoldSet(LAMBDA module, acc: acc \\o (IF acc = "" THEN "EXTENDS " ELSE ", ") \\o module, "", M)
|
|
1461
|
+
|
|
1462
|
+
LOCAL _next ==
|
|
1463
|
+
LET Params(r) == FoldLeft(LAMBDA acc, p: acc \\o (IF acc = "" THEN "" ELSE ", ") \\o ToString(r.context[p]),
|
|
1464
|
+
"", r.parameters)
|
|
1465
|
+
Signature(r) == IF "parameters" \\in DOMAIN r THEN r.name \\o "(" \\o Params(r) \\o ")" ELSE r.name
|
|
1466
|
+
ToDisjunct(i, r) == "\\\\/ " \\o ToString(i) \\o " = _idx /\\\\ " \\o Signature(r) \\o "\\n"
|
|
1467
|
+
IN FoldSet(LAMBDA a, acc: acc \\o ToDisjunct(a[1][1], a[2]), "", CounterExample.action)
|
|
1468
|
+
|
|
1469
|
+
CONSTANT _TLCTraceFile
|
|
1470
|
+
|
|
1471
|
+
LOCAL _TLCTraceModule ==
|
|
1472
|
+
LET ModuleName == ReplaceFirstSubSeq("", ".tla", _TLCTraceFile)
|
|
1473
|
+
L == ToString(Cardinality(CounterExample.action)) IN
|
|
1474
|
+
"---- MODULE " \\o ModuleName \\o " ----\\n" \\o
|
|
1475
|
+
\\*TODO callsignature symbols may not be defined in the same modules where the actions are defined.
|
|
1476
|
+
\\*TODO E.g., model values are typically defined in the MC file.
|
|
1477
|
+
_extends \\o "\\n\\n" \\o
|
|
1478
|
+
"_length == " \\o L \\o "\\n\\n" \\o
|
|
1479
|
+
"_next(_idx) ==\\n" \\o _next \\o "\\n" \\o
|
|
1480
|
+
"_actionConstraint ==\\n" \\o
|
|
1481
|
+
"_next(LET T == INSTANCE TLC IN T!TLCGet(\\"level\\"))\\n" \\o
|
|
1482
|
+
"\\n===="
|
|
1483
|
+
|
|
1484
|
+
_TLCTrace ==
|
|
1485
|
+
IF CounterExample.action = {} \\/ ("console" \\in DOMAIN CounterExample /\\ CounterExample["console"] = FALSE) THEN TRUE ELSE
|
|
1486
|
+
/\\ Serialize(_TLCTraceModule,
|
|
1487
|
+
_TLCTraceFile,
|
|
1488
|
+
[
|
|
1489
|
+
format |-> "TXT",
|
|
1490
|
+
charset |-> "UTF-8",
|
|
1491
|
+
openOptions |-> <<"WRITE", "CREATE", "TRUNCATE_EXISTING">>
|
|
1492
|
+
]
|
|
1493
|
+
).exitValue = 0
|
|
1494
|
+
/\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
|
|
1495
|
+
|
|
1496
|
+
======`],[`_TLCTESpec`,`----------------------- MODULE _TLCTESpec ------------------------
|
|
1497
|
+
LOCAL INSTANCE IOUtils
|
|
1498
|
+
LOCAL INSTANCE TLC
|
|
1499
|
+
LOCAL INSTANCE TLCExt
|
|
1500
|
+
LOCAL INSTANCE Sequences
|
|
1501
|
+
LOCAL INSTANCE SequencesExt
|
|
1502
|
+
LOCAL INSTANCE FiniteSets
|
|
1503
|
+
LOCAL INSTANCE FiniteSetsExt
|
|
1504
|
+
|
|
1505
|
+
LOCAL _extends ==
|
|
1506
|
+
LET M == FoldSet(LAMBDA a, acc: acc \\cup {a[2].location.module}, {}, CounterExample.action)
|
|
1507
|
+
IN FoldSet(LAMBDA module, acc: acc \\o (IF acc = "" THEN "EXTENDS " ELSE ", ") \\o module, "", M)
|
|
1508
|
+
|
|
1509
|
+
LOCAL _Vars ==
|
|
1510
|
+
UNION { DOMAIN pair[2] : pair \\in CounterExample.state }
|
|
1511
|
+
|
|
1512
|
+
LOCAL _ToConjunt(v, prime, idx) ==
|
|
1513
|
+
"/\\\\ " \\o v \\o prime \\o " = Trace[" \\o idx \\o "]." \\o v \\o "\\n"
|
|
1514
|
+
|
|
1515
|
+
CONSTANT _TLCTraceFile
|
|
1516
|
+
|
|
1517
|
+
LOCAL _conjunct(prime, idx) ==
|
|
1518
|
+
FoldSet(LAMBDA v, acc: acc \\o _ToConjunt(v, prime, idx), "", _Vars)
|
|
1519
|
+
|
|
1520
|
+
LOCAL _subVars ==
|
|
1521
|
+
FoldSet(LAMBDA v, acc: acc \\o (IF acc = "" THEN "" ELSE ", ") \\o v, "", _Vars)
|
|
1522
|
+
|
|
1523
|
+
LOCAL _TLCTraceModule ==
|
|
1524
|
+
LET ModuleName == ReplaceFirstSubSeq("", ".tla", _TLCTraceFile) IN
|
|
1525
|
+
"---- MODULE " \\o ModuleName \\o " ----\\n" \\o
|
|
1526
|
+
\\*TODO E.g., model values are typically defined in the MC file.
|
|
1527
|
+
_extends \\o "\\n\\n" \\o
|
|
1528
|
+
"LOCAL INSTANCE TLC\\n\\n" \\o
|
|
1529
|
+
"Trace == \\n\\t" \\o
|
|
1530
|
+
ToString(ToTrace(CounterExample)) \\o
|
|
1531
|
+
"\\n\\n" \\o
|
|
1532
|
+
"_init ==\\n" \\o _conjunct("", "1") \\o
|
|
1533
|
+
"\\n" \\o
|
|
1534
|
+
"_next ==\\n\\\\E i,j \\\\in DOMAIN Trace:\\n/\\\\ i = TLCGet(\\"level\\")\\n/\\\\ j = i + 1\\n" \\o
|
|
1535
|
+
_conjunct("", "i") \\o _conjunct("'", "j") \\o
|
|
1536
|
+
"\\n(* Allow infinite stuttering to prevent deadlock on termination. *)" \\o
|
|
1537
|
+
"\\n_terminating ==\\n\\tUNCHANGED <<" \\o _subVars \\o ">>" \\o
|
|
1538
|
+
"\\n\\n_spec == \\n\\t_init /\\\\ [][_next \\\\/ _terminating]_<<" \\o _subVars \\o ">>\\n" \\o
|
|
1539
|
+
"\\n===="
|
|
1540
|
+
\\* TODO: Append in-file config here.
|
|
1541
|
+
|
|
1542
|
+
_TLCTrace ==
|
|
1543
|
+
IF CounterExample.state = {} \\/ ("console" \\in DOMAIN CounterExample /\\ CounterExample["console"] = FALSE) THEN TRUE ELSE
|
|
1544
|
+
/\\ Serialize(_TLCTraceModule,
|
|
1545
|
+
_TLCTraceFile,
|
|
1546
|
+
[
|
|
1547
|
+
format |-> "TXT",
|
|
1548
|
+
charset |-> "UTF-8",
|
|
1549
|
+
openOptions |-> <<"WRITE", "CREATE", "TRUNCATE_EXISTING">>
|
|
1550
|
+
]
|
|
1551
|
+
).exitValue = 0
|
|
1552
|
+
/\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
|
|
1553
|
+
|
|
1554
|
+
=============================================================================
|
|
1555
|
+
`],[`_TLCTrace`,`---------------------------- MODULE _TLCTrace ----------------------------
|
|
1556
|
+
LOCAL INSTANCE TLC
|
|
1557
|
+
LOCAL INSTANCE TLCExt
|
|
1558
|
+
LOCAL INSTANCE Sequences
|
|
1559
|
+
LOCAL INSTANCE Naturals
|
|
1560
|
+
|
|
1561
|
+
\\* This operator has a Java module override (tlc2.module._TLCTrace#ioDeserialize).
|
|
1562
|
+
LOCAL _TLCTraceDeserialize(absoluteFilename) ==
|
|
1563
|
+
TRUE
|
|
1564
|
+
|
|
1565
|
+
\\* This operator has a Java module override (tlc2.module._TLCTrace#ioSerialize).
|
|
1566
|
+
LOCAL _TLCTraceSerialize(val, absoluteFilename) ==
|
|
1567
|
+
TRUE
|
|
1568
|
+
|
|
1569
|
+
----------------------------------------------------------------------------
|
|
1570
|
+
\\* Serialize a trace to a file.
|
|
1571
|
+
|
|
1572
|
+
CONSTANT _TLCTraceFile
|
|
1573
|
+
|
|
1574
|
+
LOCAL _TLCTrace0(verbose) ==
|
|
1575
|
+
IF CounterExample.state = {} \\/ ("console" \\in DOMAIN CounterExample /\\ CounterExample["console"] = FALSE) THEN TRUE ELSE
|
|
1576
|
+
/\\ LET trace == ToTrace(CounterExample)
|
|
1577
|
+
vars == UNION { DOMAIN trace[i] : i \\in DOMAIN trace }
|
|
1578
|
+
IN _TLCTraceSerialize([counterexample |-> CounterExample, vars |-> vars], _TLCTraceFile)
|
|
1579
|
+
/\\ IF verbose THEN PrintT("CounterExample written: " \\o _TLCTraceFile) ELSE TRUE
|
|
1580
|
+
|
|
1581
|
+
LOCAL _TLCTraceSilent ==
|
|
1582
|
+
_TLCTrace0(FALSE)
|
|
1583
|
+
|
|
1584
|
+
_TLCTrace ==
|
|
1585
|
+
_TLCTrace0(TRUE)
|
|
1586
|
+
|
|
1587
|
+
----------------------------------------------------------------------------
|
|
1588
|
+
\\* Deserialize a trace created by _TLCTrace above.
|
|
1589
|
+
|
|
1590
|
+
CONSTANT _TLCTraceInputFile \\* Used by -loadTrace tlc
|
|
1591
|
+
|
|
1592
|
+
LOCAL _TLCTraceFileDeserialized ==
|
|
1593
|
+
_TLCTraceDeserialize(_TLCTraceInputFile)
|
|
1594
|
+
|
|
1595
|
+
\\* This operator has a Java module override (tlc2.module._TLCTrace#tlcState).
|
|
1596
|
+
LOCAL _TLCState(level) ==
|
|
1597
|
+
Trace[level]
|
|
1598
|
+
|
|
1599
|
+
\\* A liveness counterexample's action graph contains a closing edge that
|
|
1600
|
+
\\* completes the lasso. In a forward path s1->s2->...->sn every edge
|
|
1601
|
+
\\* satisfies target[1] > source[1]; the closing edge is the unique edge
|
|
1602
|
+
\\* where target[1] <= source[1] (back-to-state: <, stuttering: =).
|
|
1603
|
+
LOCAL _TLCTraceLassoTarget ==
|
|
1604
|
+
LET actions == _TLCTraceFileDeserialized["counterexample"]["action"]
|
|
1605
|
+
IN IF \\E e \\in actions : e[3][1] <= e[1][1]
|
|
1606
|
+
THEN (CHOOSE e \\in actions : e[3][1] <= e[1][1])[3][1]
|
|
1607
|
+
ELSE 0
|
|
1608
|
+
|
|
1609
|
+
LOCAL _TLCTraceConstraint ==
|
|
1610
|
+
LET level == TLCGet("level")
|
|
1611
|
+
dump == _TLCTraceFileDeserialized
|
|
1612
|
+
trace == dump["counterexample"]["state"]
|
|
1613
|
+
vars == dump["vars"]
|
|
1614
|
+
\\* The trace (CounterExample.state) is a set of <<level, state>> pairs,
|
|
1615
|
+
\\* not a function/sequence.
|
|
1616
|
+
\\* For liveness properties, TLC trace dumps stop at the state *before* the
|
|
1617
|
+
\\* lasso is closed. When replaying such a trace, TLC may request a state with
|
|
1618
|
+
\\* a level that does not exist in the dump. In that case, no pair matches and
|
|
1619
|
+
\\* the implication is vacuously satisfied.
|
|
1620
|
+
IN \\A pair \\in trace:
|
|
1621
|
+
pair[1] = level =>
|
|
1622
|
+
\\* When loading a trace with a subset of variables, only check the
|
|
1623
|
+
\\* variables that exist in both the trace and the current state.
|
|
1624
|
+
\\* This allows trace replay with specs that have different variable
|
|
1625
|
+
\\* sets than the original spec that produced the trace. Another
|
|
1626
|
+
\\* scenario is when the spec uses ALIAS to rename, add, or remove
|
|
1627
|
+
\\* variables.
|
|
1628
|
+
\\A v \\in vars \\cap DOMAIN _TLCState(level):
|
|
1629
|
+
_TLCState(level)[v] = pair[2][v]
|
|
1630
|
+
|
|
1631
|
+
\\* VIEW for trace replay. Includes TLCGet("level") to prevent premature
|
|
1632
|
+
\\* state collapsing within the trace. For liveness traces, the level
|
|
1633
|
+
\\* beyond the trace is mapped to the lasso target so the cycle can close.
|
|
1634
|
+
LOCAL _TLCTraceView ==
|
|
1635
|
+
LET level == TLCGet("level")
|
|
1636
|
+
trace == _TLCTraceFileDeserialized["counterexample"]["state"]
|
|
1637
|
+
lassoTarget == _TLCTraceLassoTarget
|
|
1638
|
+
IN IF \\E pair \\in trace : pair[1] = level
|
|
1639
|
+
THEN << level, _TLCState(level) >>
|
|
1640
|
+
ELSE << lassoTarget, _TLCState(level) >>
|
|
1641
|
+
|
|
1642
|
+
=============================================================================
|
|
1643
|
+
`],[`_TLCTracePlain`,`----------------------- MODULE _TLCTracePlain ------------------------
|
|
1644
|
+
LOCAL INSTANCE IOUtils
|
|
1645
|
+
LOCAL INSTANCE TLC
|
|
1646
|
+
LOCAL INSTANCE TLCExt
|
|
1647
|
+
LOCAL INSTANCE Sequences
|
|
1648
|
+
LOCAL INSTANCE SequencesExt
|
|
1649
|
+
|
|
1650
|
+
CONSTANT _TLCTraceFile
|
|
1651
|
+
|
|
1652
|
+
LOCAL _TLCTraceModule ==
|
|
1653
|
+
LET ModuleName == ReplaceFirstSubSeq("", ".tla", _TLCTraceFile) IN
|
|
1654
|
+
"---- MODULE " \\o ModuleName \\o " ----\\n" \\o
|
|
1655
|
+
"LOCAL INSTANCE TLC\\n\\n" \\o
|
|
1656
|
+
"Trace == \\n\\t" \\o
|
|
1657
|
+
ToString(ToTrace(CounterExample)) \\o
|
|
1658
|
+
"\\n\\n===="
|
|
1659
|
+
|
|
1660
|
+
_TLCTrace ==
|
|
1661
|
+
IF CounterExample.state = {} \\/ ("console" \\in DOMAIN CounterExample /\\ CounterExample["console"] = FALSE) THEN TRUE ELSE
|
|
1662
|
+
/\\ Serialize(_TLCTraceModule,
|
|
1663
|
+
_TLCTraceFile,
|
|
1664
|
+
[
|
|
1665
|
+
format |-> "TXT",
|
|
1666
|
+
charset |-> "UTF-8",
|
|
1667
|
+
openOptions |-> <<"WRITE", "CREATE", "TRUNCATE_EXISTING">>
|
|
1668
|
+
]
|
|
1669
|
+
).exitValue = 0
|
|
1670
|
+
/\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
|
|
1671
|
+
|
|
1672
|
+
=============================================================================
|
|
1673
|
+
`]]),Bm=new Map([...[...zm].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,Rm.replace(`
|
|
1674
|
+
LOCAL INSTANCE Naturals
|
|
1675
|
+
`,`
|
|
1676
|
+
EXTENDS TLC
|
|
1677
|
+
LOCAL INSTANCE Naturals
|
|
1678
|
+
`)],[`Randomization`,`-------------------------- MODULE Randomization------------------------------
|
|
1679
|
+
(***************************************************************************)
|
|
1680
|
+
(* This module defines operators for choosing pseudo-random subsets of a *)
|
|
1681
|
+
(* set. It is useful for inductive invariance checking, where the *)
|
|
1682
|
+
(* operators appear only in the initial predicate. However, it may have *)
|
|
1683
|
+
(* other uses. *)
|
|
1684
|
+
(* *)
|
|
1685
|
+
(* In breadth-first search model checking, the pseudo-random choices made *)
|
|
1686
|
+
(* when computing possible steps satisfying the next-state relation are *)
|
|
1687
|
+
(* determined by the first state of the step. Thus, the choices made for *)
|
|
1688
|
+
(* a particular state will be the same in successive runs of TLC. This is *)
|
|
1689
|
+
(* done to permit TLC to generate an error trace if an error is found. *)
|
|
1690
|
+
(* This applies only when TLC is run in breadth-first search mode. In *)
|
|
1691
|
+
(* particular, the choices made in simulation mode are independent of the *)
|
|
1692
|
+
(* state for which they are made. *)
|
|
1693
|
+
(***************************************************************************)
|
|
1694
|
+
|
|
1695
|
+
(***************************************************************************)
|
|
1696
|
+
(* Except for TestRandomSetOfSubsets, all these definitions are overridden *)
|
|
1697
|
+
(* by TLC in the Java class tlc2.module.Randomization. Each operator is *)
|
|
1698
|
+
(* overridden by the Java method with the same name. *)
|
|
1699
|
+
(***************************************************************************)
|
|
1700
|
+
LOCAL INSTANCE Naturals
|
|
1701
|
+
LOCAL INSTANCE FiniteSets
|
|
1702
|
+
|
|
1703
|
+
(***************************************************************************)
|
|
1704
|
+
(* RandomSubset(k, S) equals a randomly chosen subset of S containing k *)
|
|
1705
|
+
(* elements, where 0 < k < Cardinality(S). *)
|
|
1706
|
+
(***************************************************************************)
|
|
1707
|
+
RandomSubset(k, S) == CHOOSE T \\in SUBSET S : Cardinality(T) = T
|
|
1708
|
+
|
|
1709
|
+
(***************************************************************************)
|
|
1710
|
+
(* RandomSetOfSubsets(k, n, S) equals a pseudo-randomly chosen set of *)
|
|
1711
|
+
(* subsets of S -- that is, a randomly chosen subset of SUBSET S . Thus, *)
|
|
1712
|
+
(* each element T of this set is a subset of S. Each such T is chosen so *)
|
|
1713
|
+
(* that each element of S has a probability n / Cardinality(S) of being in *)
|
|
1714
|
+
(* T. Thus, the average number of elements in each chosen subset T is n. *)
|
|
1715
|
+
(* The set RandomSetOfSubsets(k, n, S) is obtained by making k such *)
|
|
1716
|
+
(* choices of T . Because this can produce duplicate choices, the number *)
|
|
1717
|
+
(* of elements T in this set may be less than k. The average number of *)
|
|
1718
|
+
(* elements in RandomSetOfSubsets(k, n, S) seems to be difficult to *)
|
|
1719
|
+
(* compute in general. However, there is very little variation in the *)
|
|
1720
|
+
(* actual number of elements in the chosen set for fixed values of k, n, *)
|
|
1721
|
+
(* and Cardinality(S). You can therefore use the operator *)
|
|
1722
|
+
(* TestRandomSetOfSubsets defined below to find out approximately how *)
|
|
1723
|
+
(* close to k the cardinality of the chosen set of subsets is. *)
|
|
1724
|
+
(***************************************************************************)
|
|
1725
|
+
RandomSetOfSubsets(k, n, S) == CHOOSE T \\in SUBSET SUBSET S :
|
|
1726
|
+
Cardinality(T) \\leq k
|
|
1727
|
+
|
|
1728
|
+
(***************************************************************************)
|
|
1729
|
+
(* The value of TestRandomSetOfSubsets(k, n, S) is a sequence of five *)
|
|
1730
|
+
(* values that are the cardinality of the set of subsets produced by five *)
|
|
1731
|
+
(* executions of RandomSetOfSubsets(k, n, S). For constant values of k, *)
|
|
1732
|
+
(* n, and S, you can enter TestRandomSetOfSubsets(k, n, S) in the Evaluate *)
|
|
1733
|
+
(* Constant Expression section of a TLC model in the TLA+ Toolbox. *)
|
|
1734
|
+
(* Running TLC will then tell you the approximate number of elements in *)
|
|
1735
|
+
(* the set of subsets produced by RandomSetOfSubsets for these parameters. *)
|
|
1736
|
+
(* You can then choose k to obtain a set of the desired size. *)
|
|
1737
|
+
(***************************************************************************)
|
|
1738
|
+
TestRandomSetOfSubsets(k, n, S) ==
|
|
1739
|
+
[i \\in 1..5 |-> Cardinality(RandomSetOfSubsets(k, n, S))]
|
|
1740
|
+
|
|
1741
|
+
=============================================================================
|
|
1742
|
+
`],[`Toolbox`,`----------------------------- MODULE Toolbox --------------------------------
|
|
1743
|
+
(***************************************************************************)
|
|
1744
|
+
(* *)
|
|
1745
|
+
(***************************************************************************)
|
|
1746
|
+
LOCAL INSTANCE Naturals \\* a + b
|
|
1747
|
+
LOCAL INSTANCE FiniteSets \\* Cardinality
|
|
1748
|
+
LOCAL INSTANCE TLC \\* TLCGet
|
|
1749
|
+
|
|
1750
|
+
-----------------------------------------------------------------------------
|
|
1751
|
+
|
|
1752
|
+
(* Trace Exploration *)
|
|
1753
|
+
|
|
1754
|
+
_TETrace ==
|
|
1755
|
+
CHOOSE f \\in [ (Nat \\ {0}) -> STRING ] : TRUE
|
|
1756
|
+
|
|
1757
|
+
LOCAL _TETraceLength == Cardinality(DOMAIN _TETrace)
|
|
1758
|
+
|
|
1759
|
+
_TEPosition ==
|
|
1760
|
+
IF TLCGet("level") >= _TETraceLength
|
|
1761
|
+
THEN _TETraceLength
|
|
1762
|
+
ELSE TLCGet("level") + 1
|
|
1763
|
+
|
|
1764
|
+
=============================================================================
|
|
1765
|
+
`]]),Vm=(e=`master`)=>e===`1.7.4`?Bm:zm,Hm=(e,t,n)=>new p(`Applying ${e} to the following value,\nwhich is not ${t}:\n${L(n)}`),Um=e=>j(e)?I(e):void 0,Wm=(e,t,n)=>{let r=R(e,t,n),i=Um(r);if(!i)throw Hm(n,`a function with a finite domain`,r);return i},Gm=(e,t,n)=>{let r=R(e,t,n),i=Um(r);if(!i)throw ui(t===0?`first`:`second`,n,`bag`,r);return i},Km=(e,t)=>{if(!A(e)||!N(e))throw t();return P(e).elements},qm=e=>e.range.every(e=>typeof e==`number`&&e>0),Jm=(e,t)=>{let n=e.domain.findIndex(e=>Ut(e,t));return n===-1?void 0:e.range[n]},Ym=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Xm=Ym(`BagDiff`,`tlc2.value.impl.Value`,2),Zm=Ym(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Qm=Ym(`BagUnion`,`tlc2.value.impl.Value`,1),$m=Ym(`BagOfAll`,`tlc2.value.impl.Value`,2),eh=Ym(`BagCup`,`tlc2.value.impl.Value`,2),th=Ym(`BagCardinality`,`tlc2.value.impl.IntValue`,1),nh=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Ai(e)}`;throw Mi(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},rh=(e,t,n)=>{let r=nh(e,n)+nh(t,n);if(wi(r))throw Ti(`${e}+${t}`);return r},ih=(e,t,n,r)=>{let i=Jm(n,e.domain[t]),a=nh(e.range[t],r);return i===void 0?a:a-nh(i,r)|0},ah=(e,t)=>jn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Ut(e[0],r));a?a[1]=rh(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),oh=jt([],[]),sh=e=>[bi(`EmptyBag`,oh),z(`IsABag`,1,e=>{let t=Um(R(e,0,`IsABag`));return t!==void 0&&qm(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return Wm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Hm(`BagCardinality`,`a bag`,t);return rh(e,n,th)},0)}),z(`BagIn`,2,e=>{let t=R(e,1,`BagIn`),n=Jm(Wm(e,1,`BagIn`),R(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw ui(`second`,`BagIn`,`bag`,t);return n>0}),z(`CopiesIn`,2,e=>{let t=R(e,1,`CopiesIn`),n=Jm(Wm(e,1,`CopiesIn`),R(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw ui(`second`,`CopiesIn`,`bag`,t);return n}),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Gm(e,t,`(+)`);if(!qm(n))throw ui(t===0?`first`:`second`,`(+)`,`bag`,R(e,t,`(+)`));return n});return ah(t,eh)}),z(`\\ominus`,2,e=>{let t=Gm(e,0,`(-)`),n=Gm(e,1,`(-)`);return jn(t.domain.flatMap((e,r)=>{let i=ih(t,r,n,Xm);return i>0?[[e,i]]:[]}))}),z(`BagUnion`,1,e=>{let t=R(e,0,`BagUnion`),n=Km(t,()=>Hm(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??oh;let r=n.map(e=>{let n=Um(e);if(!n)throw new p(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(t)}`);return n});return ah(r,Qm)}),z(`\\sqsubseteq`,2,e=>{let t=Wm(e,0,`\\sqsubseteq`),n=Wm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>ih(t,r,n,Zm)<=0)}),xi(`BagOfAll`,2,e=>{let t=yi(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new p(`The first argument of BagOfAll should be an operator, but instead it is:\n${L(t.literalBody)}`);let n=R(e,1,`BagOfAll`),r=Um(n);if(!r)throw ui(`second`,`BagOfAll`,`function with a finite domain`,n);return ah(r.domain.map((e,n)=>jt([t.call([e])],[r.range[n]])),$m)}),z(`SubBag`,1,t=>{let n=R(t,0,`SubBag`);if(!j(n))throw new h(`DOMAIN expects a function but received ${L(n)}`);let r=I(n),i=Tn(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 h(`Attempted to apply a function to ${L(r)}, which is not in its domain`);return Tn(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>jt(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>Ar(Wm(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=Km(t,()=>Hm(`BagToSet`,`a function with a finite domain`,t));return jt([...n],n.map(()=>1))})],ch=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,lh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,uh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,dh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,fh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,ph=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,mh=e=>{if(!j(e))return!1;let t=I(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},hh=(e,t)=>Mi(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Ai(t)}`),gh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),_h=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw hh(t,e);return`[${P(e).elements.map(e=>yh(e,t)).join(`,`)}]`},vh=(e,t)=>{let n=I(e),r=pr(n);return r?`[${r.map(e=>yh(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${gh(typeof e==`string`?e:L(e))}:${yh(n.range[r],t)}`).join(`,`)}}`},yh=(e,t)=>typeof e==`string`?gh(e):typeof e==`object`?e.kind===`ModelValue`?gh(e.name):A(e)?_h(e,t):vh(e,t):String(e),bh=e=>{if(A(e))return _h(e,ch);if(!j(e)||mh(e))throw hh(ch,e);return vh(e,ch)},xh=e=>{if(!j(e))throw hh(lh,e);return vh(e,lh)},Sh=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},Ch=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return vt(e);if(Array.isArray(e))return Vn(e.map(e=>Ch(e,t)));if(typeof e==`object`&&e)return Hn(Object.entries(e).map(([e,n])=>[vt(e),Ch(n,t)]));throw Mi(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},wh=(e,t)=>{if(e.trim()===``)return Ch(null,t);try{return Ch(JSON.parse(e,(e,t,n)=>typeof t==`number`?Sh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Mi(t,e.message):e}},Th=(e,t)=>{if(typeof e!=`string`)throw Mi(t,`Cannot cast tlc2.value.impl.${Ai(e)} to tlc2.value.impl.StringValue`);return e},Eh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Mi(n,`${t} (No such file or directory)`);return r},Dh=e=>[Si(`ToJson`,1,e=>vt(yh(R(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Si(`ToJsonArray`,1,e=>vt(bh(R(e,0,`ToJsonArray`)))),Si(`ToJsonObject`,1,e=>vt(xh(R(e,0,`ToJsonObject`)))),Si(`JsonSerialize`,2,t=>{let n=Th(R(t,0,`JsonSerialize`),uh),r=R(t,1,`JsonSerialize`);if(!pr(r)&&!mh(r))throw ui(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,yh(r,uh)),!0}),Si(`ndJsonSerialize`,2,t=>{let n=Th(R(t,0,`ndJsonSerialize`),dh),r=R(t,1,`ndJsonSerialize`),i=pr(r);if(!i)throw ui(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${yh(e,dh)}\n`).join(``)),!0}),Si(`JsonDeserialize`,1,t=>{let n=Th(R(t,0,`JsonDeserialize`),fh);return wh(Eh(e,n,fh),fh)}),Si(`ndJsonDeserialize`,1,t=>{let n=Th(R(t,0,`ndJsonDeserialize`),ph);return Vn(Eh(e,n,ph).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>wh(e,ph)))})],Oh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,kh=1e6,Ah=(e,t,n)=>{if(typeof e!=`number`||e<0)throw ui(t,n,`nonnegative integer`,e);return e},jh=(e,t,n,r)=>Tn(Array.from({length:t},()=>Tn(e.filter(()=>r.nextDouble()<n)))),Mh=(e,t)=>{let n=`RandomSetOfSubsets`,r=Ah(R(e,0,n),`first`,n),i=Ah(R(e,1,n),`second`,n),a=R(e,2,n);if(!A(a)||!N(a))throw ui(`third`,n,`finite set`,a);let o=P(a).elements;if(o.length<31&&r>2**o.length)throw ui(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw ui(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return jh(o,r,o.length===0?0:i/o.length,t.getRandom())},Nh=e=>[Si(`RandomSubset`,2,t=>{let n=R(t,0,`RandomSubset`);if(typeof n!=`number`)throw ui(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw Mi(Oh,String(n));let r=R(t,1,`RandomSubset`);if(!A(r)||!F(r)&&!N(r))throw ui(`second`,`RandomSubset`,`a finite set`,r);let i=jm(r,e.version);if(i&&i.reduce((e,t)=>e*P(t).elements.length,1)>kh)throw Mi(Oh,`Attempted to construct a set with too many elements (>${kh}).`);return Tn(Mm(n,r,e.getRandom(),e.version))}),Si(`RandomSetOfSubsets`,3,t=>Mh(t,e)),Si(`TestRandomSetOfSubsets`,3,t=>Vn(Array.from({length:5},()=>P(Mh(t,e)).elements.length)))],Ph=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Fh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Ph})`,Ih=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Ph}) throws java.io.IOException`,Lh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Ph})`,Rh=e=>Hn([[`name`,e??`UnnamedAction`],[`location`,Hn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),zh=(e,t,n)=>{let r=e.map((e,t)=>Vn([t+1,Hn(Object.entries(e))])),i=r.slice(1).map((e,n)=>Vn([r[n],t[n],e])),a=n?[Vn([r[r.length-1],n.action,r[n.start]])]:[];return Hn([[`action`,Tn([...i,...a])],[`state`,Tn(r)]])},Bh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Lm(e).get(t)},Vh=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),L(r));else throw new p(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(n)}`)},Hh=e=>e.every(e=>e!==void 0),Uh=(e,t)=>Hn(t.variables.map((t,n)=>[t,e[n]])),Wh=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!O(e)){if(t.variableIndex.has(r))return!0;let e=Tl(r,t);if(e&&!n.has(e)&&(n.add(e),Wh(e.body,t,n)))return!0}return Ue(e).some(e=>Wh(e,t,n))},Gh=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[z(`AssertEq`,2,t=>{let n=R(t,0,`AssertEq`),r=R(t,1,`AssertEq`),i=Ut(n,r);return i||(e(L(`Assertion failed`,!0)),e(L(n,!0)),e(L(r,!0))),i}),zi(`AssertError`,2,e=>{let n=yi(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Mi(Fh,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=Bi(e,0,`AssertError`)();try{Bi(e,1,`AssertError`)()}catch(e){if(e instanceof h)return pa(e.message,t.isTool)===r;throw e}return!1}),Si(`TLCGetOrDefault`,2,e=>{let n=R(e,0,`TLCGetOrDefault`);return Bh(t,n)??R(e,1,`TLCGetOrDefault`)}),{...xi(`TLCGetAndSet`,4,n=>{let r=R(n,0,`TLCGetAndSet`),i=Bh(t,r)??R(n,3,`TLCGetAndSet`),a=yi(n,1,`TLCGetAndSet`);return Vh(t,e,r,a.call([i,R(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Si(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!Hh(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Mi(Ih,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Vn(t.getBehavior(r).map(e=>Uh(e,n.environment)))}),Si(`CounterExample`,0,()=>t.counterExample??Hn([[`action`,Tn([])],[`state`,Tn([])]])),z(`ToTrace`,1,e=>{let t=R(e,0,`ToTrace`);if(!j(t)||!Ut(Ar(t),Tn([`action`,`state`])))throw new h(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(t)}`);let n=P(Or(t,`state`)).elements.map(e=>pr(e)??[]);return Vn(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let t=R(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new p(`The argument of ModelValue should be a string, but instead it is:\n${L(t)}`);return kt(t)}),zi(`TLCDefer`,1,()=>!0),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),zi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!Hh(r))throw Mi(Lh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||wl(Bi(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new g(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),zi(`TLCCache`,2,(e,t)=>{let r=yi(e,0,`TLCCache`),a=Qr(Bi(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Wh(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),z(`TLCFP`,1,e=>Number(BigInt.asIntN(32,dm([R(e,0,`TLCFP`)])))),Si(`TLCEvalDefinition`,1,(e,t)=>{let n=R(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?Tl(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new p(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${L(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new p(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return H({kind:`Identifier`,name:n,location:r.location},t)})]},Kh=(e,t)=>[Si(`_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}),Si(`_Counts`,0,()=>Im(t)),Si(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(Im(t),!0)),!1)}),Si(`_PrintCounts`,0,()=>(e(L(Im(t),!0)),!0))],qh=e=>String(e).padStart(2,`0`),Jh=e=>`${e.getUTCFullYear()}.${qh(e.getUTCMonth()+1)}.${qh(e.getUTCDate())}.${qh(e.getUTCHours())}${qh(e.getUTCMinutes())}${qh(e.getUTCSeconds())}`,Yh=e=>jn([...e].map(([e,t])=>[e,Vn([t])])),Xh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Zh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Qh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),$h=(e,t,n)=>{if(e.version===`1.7.4`?!Zh.has(t)||!e.isStarted&&Qh.has(t):!e.isStarted&&Xh.has(t))throw new p(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return Hn([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Hn([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Hn([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,vt(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,vt(Jh(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Rh(void 0);case`all`:return Yh(e.registers);case`all:named`:return Yh(Lm(e))}if(t.startsWith(`s:`)){let n=Lm(e).get(t);if(n===void 0)throw new p(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return vt(e.properties.get(t.slice(2))??t);throw new p(`TLCGet(${t}) was undefined.`)},eg=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new p(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new p(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(t)}`);return $h(e,t,n?.state)},tg=e=>e.length===0?[[]]:e.flatMap((t,n)=>tg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),ng=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&P(e).elements.forEach(ng),e.kind===`Function`&&e.range.forEach(ng))},rg=(e,t)=>[z(`Print`,2,t=>(e(`${k(L(R(t,0,`Print`),!0,!0))} ${k(L(R(t,1,`Print`),!0,!0))}`),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(k(L(R(t,0,`PrintT`),!0,!0))),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new p(`The first argument of Assert evaluated to FALSE; the second argument was:\n${k(L(R(e,1,`Assert`)))}`,m.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>jn([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=vi(e,0,`@@`),n=vi(e,1,`@@`);return Mn([...at(t),...at(n)])}),z(`ToString`,1,e=>vt(L(R(e,0,`ToString`),!0))),z(`TLCEval`,1,e=>{let t=R(e,0,`TLCEval`);return ng(t),t}),z(`Permutations`,1,e=>{let t=gi(e,0,`Permutations`);return Tn(tg(t).map(e=>jn(t.map((t,n)=>[t,e[n]]))))}),xi(`SortSeq`,2,e=>{let t=yi(e,1,`SortSeq`);return Vn(_i(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),t.version===`1.7.4`?Ni({...Si(`TLCGet`,1,(e,n)=>eg(t,R(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Ni(zi(`TLCGet`,1,(e,n)=>eg(t,Bi(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)`),Si(`TLCSet`,2,n=>{let r=R(n,0,`TLCSet`);return Vh(t,e,r,R(n,1,`TLCSet`)),!0}),bi(`Any`,Tt),z(`RandomElement`,1,e=>Pm(hi(e,0,`RandomElement`),t.getRandom()))],ig=(e,t)=>e.every(e=>_r(e,t)),ag=Tn([!1,!0]),og=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return An(og(e,t,r),og(e,r,n))},sg=[`\\cup`,`\\cap`,`\\`],cg=e=>typeof e==`object`&&e.kind===`MixedSet`,lg=(e,t,n)=>{let r=t.kind===`Interval`?P(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return En(r.filter(e=>_r(e,n)===t))}if(r.length===0)return n;if(!$e(n))return zt({kind:`SetOperation`,operator:e,left:t,right:n});let i=P(n).elements.filter(e=>!_r(e,t));return En([...r,...i])},ug=[bi(`TRUE`,!0),bi(`FALSE`,!1),bi(`BOOLEAN`,ag),bi(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Ci(`=`,Cn),Ci(`#`,(e,t)=>!Cn(e,t)),z(`~`,1,e=>!pi(e,0,`~`)),z(`<=>`,2,e=>pi(e,0,`<=>`)===pi(e,1,`<=>`)),z(`/\\`,2,e=>pi(e,0,`/\\`)&&pi(e,1,`/\\`)),z(`\\/`,2,e=>pi(e,0,`\\/`)||pi(e,1,`\\/`)),z(`=>`,2,e=>!pi(e,0,`=>`)||pi(e,1,`=>`)),z(`\\in`,2,e=>_r(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!_r(R(e,0,`\\notin`),R(e,1,`\\notin`))),z(`\\subseteq`,2,e=>{let t=mi(e,0,`\\subseteq`),n=R(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&N(t.base)?ig(P(t.base).elements,n.base):ig(P(t).elements,n)}),...sg.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e);if($e(n)&&$e(r)&&!cg(n)&&!cg(r)){if(e===`\\cup`&&F(n))return r;let t=e===`\\cup`?An:e===`\\cap`?kn:On;return gr((e,n)=>t(P(e),P(n)),(t,n)=>lg(e,t,n),n,r)}return $e(n)?lg(e,n,r):e!==`\\`&&$e(r)?lg(e,r,n):zt({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=mi(e,0,`UNION`),n=et(t)?t.elements.filter(et):[];if(!et(t)||n.length!==t.elements.length)return zt({kind:`Union`,base:t});if(cg(t)||n.some(cg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{_r(t,e)||e.elements.push(t)})),En(e.elements)}return n.length===0?Dn:og(n.map(P),0,n.length)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!j(t))throw new h(`DOMAIN expects a function but received ${L(t)}`);return Ar(t)})],dg=Fi(`Integers`,`Neg`,`IntValue`,1),fg=e=>{let t=Fi(e,`DotDot`,`IntervalValue`,2);return[Ii(e,`+`,`Plus`,(e,t)=>e+t),Ii(e,`-`,`Minus`,(e,t)=>e-t),Ii(e,`*`,`Times`,(e,t)=>e*t),Ii(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new p(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new p(`0^0 is undefined.`);return e**t}),Ii(e,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new p(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/n)|0;return e<0&&Math.imul(e,n)!==t?e-1:e}let r=Math.floor(t/n);if(wi(r))throw Ti(`${t} \\div ${n}`);return r}),Ii(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new p(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),z(`..`,2,e=>({kind:`Interval`,low:Pi(R(e,0,`..`),t),high:Pi(R(e,1,`..`),t)}))]},pg=fg(`Naturals`),mg=fg(`Integers`),hg=e=>{let t=pg.indexOf(e);return t===-1?void 0:mg[t]},gg=[bi(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...pg,Ri(`<`,(e,t)=>e<t),Ri(`>`,(e,t)=>e>t),Ri(`<=`,(e,t)=>e<=t),Ri(`>=`,(e,t)=>e>=t,`>`)],_g=[bi(`Int`,{kind:`InfiniteSet`,name:`Int`}),...mg,Ri(`>=`,(e,t)=>e>=t),z(`-.`,1,e=>{let t=Pi(R(e,0,`-`),dg);if(wi(-t))throw Ti(`-${t}`);return-t})],vg=(e,t,n)=>{let r=R(e,t,n),i=pr(r);if(!i)throw new p(`${n}\n${L(r)}`);return i},yg=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:vg(e,t,n)},bg=(e,t,n)=>typeof e==`string`?vt(e.slice(t,n)):Vn(e.slice(t,n)),xg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Sg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Cg=(e,t)=>{let n=tf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Ni(e,t):e}):t},wg=e=>Cg(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>yg(e,0,xg(``,`Len`)).length),z(`\\o`,2,e=>{let t=yg(e,0,Sg(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=vg(e,1,Sg(`t \\o s`,`sequence`));return Vn([...t,...n])}let n=R(e,1,`\\o`);if(typeof n!=`string`)throw new p(`${Sg(`t \\o s`,`string`)}\n${L(n)}`);return vt(t+n)}),z(`Append`,2,t=>Vn([...vg(t,0,Sg(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let t=vg(e,0,xg(``,`Head`));if(t.length===0)throw new p(`Attempted to apply Head to the empty sequence.`);return t[0]}),z(`Tail`,1,e=>{let t=yg(e,0,xg(``,`Tail`));if(t.length===0)throw new p(`Attempted to apply Tail to the empty sequence.`);return bg(t,1)}),z(`SubSeq`,3,e=>{let t=yg(e,0,xg(`first `,`SubSeq`)),n=fi(e,1,`SubSeq`),r=fi(e,2,`SubSeq`);if(n>r)return bg(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 p(`The ${i.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${i.value}`);return bg(t,n-1,r)}),xi(`SelectSeq`,2,e=>{let t=yi(e,1,`SelectSeq`);return Vn(vg(e,0,xg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw ui(`second`,`SelectSeq`,`operator`,n);return n}))})]),Tg=e=>Cg(`FiniteSets`,[z(`IsFiniteSet`,1,e=>{let t=R(e,0,`IsFiniteSet`);if(A(t))return dr(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new h(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${L(t)}\nis a finite set.`:`Attempted to check if the ${tt(t)} ${L(t)} is a finite set.`)}),z(`Cardinality`,1,t=>{let n=R(t,0,`Cardinality`);if(!A(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new p(`Attempted to compute cardinality of the value\n${L(n)}`);return lr(n,e)})]),Eg=/* @__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`]]]),Dg=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:gg};case`Integers`:return{extends:[`Naturals`],operators:_g};case`Sequences`:return{extends:[],operators:wg(n.version)};case`FiniteSets`:return{extends:[],operators:Tg(n.version)};case`TLC`:return{extends:[],operators:Cg(`TLC`,rg(t,n))};case`Randomization`:return{extends:[],operators:Nh(n)};case`_Possible`:return{extends:[],operators:Kh(t,n)};case`Json`:return{extends:[],operators:Dh(r)};case`Bags`:return{extends:[],operators:sh(i)};case`TLCExt`:return{extends:[],operators:Gh(t,n)};default:return}},Og=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),kg={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]}},Ag=(e,t)=>{let n=kg[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},jg=`$subexpression`,Mg=(e,n)=>new t(`${e} at line ${n.line}, column ${n.column}`),Ng=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Ng(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Ue(e)){let e=Ng(r,t,n);if(e)return e}},Pg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Fg=(e,t)=>{let n=e.location,r=Pg(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 Mg(`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 Mg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:jg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:jg,args:e.args,location:n,resolution:ja},location:n}},Ig=(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:ja})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ja}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ja};return Fg({...t,params:[...t.params,...r]},a)},Lg=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw Mg(r,i);Na.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:f(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw Mg(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>ts(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw Mg(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=Ra(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw Mg(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&Ng(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw Mg(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||ao(t.operand,1)!==0)throw Mg(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=lo(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[ao(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw Mg(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=ao(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw Mg(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw Mg(`Unexpected subexpression selector`,i);let s=r?r.sets:uo(n),c=s?.[ao(t.operand,s.length)];if(!c)throw Mg(`Nonexistent operand specified by the selector`,i);o.current=c},p=l(void 0);if(o.isFailed)return n;if(p)return Ig(p.definition,{...a,args:p.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw Mg(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return Ig(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw Mg(`Subexpression selection failed`,i);return Fg(a,o.current)},Rg=(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 oo(e,t,n)},zg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Ue(e).some(zg),Bg=(e,t,n,r=!1)=>{if(!zg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=is(e,e=>Bg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Vg(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)=>Bg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:is(e,e=>Bg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Rg(a.name,[],void 0,t):a.kind===`Apply`?Rg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Lg(o,t,a,r);return c!==a&&Ma.add(c),c},Vg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Bg(e.expression,t,n,!0)}))}),Hg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Ug=(e,t)=>Vg(e,Hg(t.definitions),()=>!1),Wg=(e,t)=>{let n=Hg([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>Bg(e,n,i),o=e=>i(e)||!n(e),s=e=>Bg(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return Vg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Vg(e,n,o):rs(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>zg(e.body))||e.assumptions.some(e=>zg(e.expression))?{...p,definitions:e.definitions.map(e=>rs(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Gg=(e,t)=>`${e}${t}`,Kg=(e,t,n)=>`${e}${t}${n}`,qg=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Jg=(e,t,n)=>`${e},${t},${n}`,Yg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Xg=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Zg=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Qg=(e,t,n,r)=>({...Yg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),$g=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,e_=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,t_=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,{...Qg(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),n_=Qg(`$Set`,0,[2],[1]),r_=Qg(`$Junction`,0,[3],[1]),i_=Qg(`$Choose`,0,[2],[1]),a_=Qg(`$Function`,0,[3],[1]),o_=Qg(`$FcnApply`,0,[2,2],[1,1]),s_=Qg(`$RcdSelect`,0,[2,0],[1,1]),c_=Qg(`'`,2,[1],[0]),l_=Qg(`ENABLED`,1,[2],[0]),u_=Qg(`[]`,3,[3],[0]),d_=Qg(`$SquareAct`,2,[2,1],[0,0]),f_=Qg(`$WF`,3,[1,2],[0,0]),p_=Qg(`$TemporalExists`,3,[3],[0]),m_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),h_=e=>e.map(e=>({name:e,arity:0})),g_=(e,n)=>n.location.range?o(`${e}.`,n.location.range):new t(`${e} at line ${n.location.line}, column ${n.location.column}`),__=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),v_=e=>e.kind!==`Let`&&e.kind!==`Label`,y_=e=>{let n=/* @__PURE__ */ new Map,r=(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:g(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=g(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=t_.get(t)??Og.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},i=(e,t,n)=>{let r=Yg(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(Kg(e,n,t))}),t.data.constraints.forEach((e,t)=>Xg(r.constraints,t,e)),Zg(r.argConstraints,Gg(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Zg(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(e,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(!(n.operator||n.declared)&&n.data.level>$g(e,r))throw new t(`Level error in applying operator ${e.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new t(`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=t=>{let r=e.formals.findIndex(e=>e.name===t);return r===-1?void 0:n[r]},s=(t,n,r)=>e.conditions.has(Jg(t,n,r)),c=Yg(Math.max(e.level,...n.filter((t,n)=>e_(e,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),n.forEach((t,n)=>{e_(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>Xg(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Xg(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Xg(c.constraints,t,e))),n.forEach((t,n)=>t.data.params.forEach(t=>{a(t)||Xg(c.constraints,t,$g(e,n))})),n.forEach((e,t)=>{let r=e.operator;r&&n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Xg(c.constraints,e,$g(r,a)))}))}),e.argParams.forEach(e=>{let t=qg(e),n=o(t.operator)?.operator;n&&Xg(c.constraints,t.param,$g(n,t.index))}),[e.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Zg(c.argConstraints,t,e))),n.forEach((t,r)=>{let i=t.declared;i&&(Array.from({length:i.arity},(t,n)=>Zg(c.argConstraints,Gg(i.name,n),e.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Zg(c.argConstraints,Gg(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=qg(e),n=o(t.operator);n&&Zg(c.argConstraints,Gg(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(qg(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=qg(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(Kg(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(Kg(t.operator,t.index,e)))}}),n.forEach((e,t)=>{let r=e.declared;r&&n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(Kg(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=te(`LAMBDA`,h_(e.params),e.body,t);return{data:n,operator:n}}let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Yg();return e.params.add(n),{data:e,declared:{name:n,arity:i.arity}}}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=m_(n,h_(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 g_(`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 g_(`Action used where only temporal formula or state predicate allowed`,e);__.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&v_(n)&&n.kind!==r)throw g_(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=g(e,n);t.constraints.forEach((e,t)=>Xg(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Zg(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,n)=>{try{return ee(e,n)}catch(n){throw!(n instanceof t)||n.sany?n:g_(n.message,e)}},ee=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Yg();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(r_,n)}case`Prime`:case`Unchanged`:return c(c_,[e.expression],t);case`Enabled`:return c(l_,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(u_,[n])}case`If`:return c(r_,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(r_,[...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(r_,[e.body],t,e.bounds.map(e=>e.set),Xa(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw g_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?p_:r_,[e.body],t,[],e.names);case`Choose`:return c(i_,[e.body],t,e.set?[e.set]:[],Ya(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(n_,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(n_,[e.predicate],t,[e.bound.set],Ya(e.bound.pattern));case`SetMap`:return c(n_,[e.expression],t,e.bounds.map(e=>e.set),Xa(e.bounds));case`FunctionConstruction`:return c(a_,[e.body],t,e.bounds.map(e=>e.set),Xa(e.bounds));case`Record`:return c(a_,e.fields.map(e=>e.value),t);case`RecordSet`:return c(n_,e.fields.map(e=>e.value),t);case`Except`:return c(n_,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(o_,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(n_,e.args,t)}]);case`Bracket`:return Yg();case`FieldAccess`:return a(s_,[o(e.record,t),{data:Yg()}]);case`BoxAction`:case`AngleAction`:return c(d_,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(f_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Yg()}},h=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>h(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||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 Ue(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,m_(t,h_(e.names))),i;default:return is(e,(e,r)=>(a(e,n,m_(t,h_(r))),e)),i}},te=(e,t,n,r)=>{let i=m_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=h(n,i),c={...Yg(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(Gg(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(Kg(e.name,n,t.name))).map(e=>Jg(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(qg(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=qg(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},g=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...Yg(),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=te(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:g,toOperand:o}},b_=(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`?b_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Yg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Xg(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Zg(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},x_=(e,t,n,i)=>{let a=y_(t),o=e=>Math.max(0,...e.map(e=>a.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?b_(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=f(e.statement),n=()=>s(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.`}],...c(e.proof)]:e.body.kind===`Qed`?c(e.proof):[]}):[],l=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>s(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>o([e.set])!==0).flatMap(e=>e.set.location.range?[{location:f(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(e.proof),...r,...e.proof?.kind===`Steps`&&n()?c(e.proof):[]]}):[],u=Jo([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?b_(e.statement,/* @__PURE__ */ new Map,a):a.analyze(e.statement,/* @__PURE__ */ new Map),n=[...l(e.proof),...t.level===3?c(e.proof):[]];if(n.length>0)throw r(n)}})),...n],i);if(u.length>0)throw r(u,!1,void 0,i)},S_=(e,t)=>e.maxLevels[t]??3,C_=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=y_({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},i=/* @__PURE__ */ new Map,a=t=>{let r=i.get(t);if(r)return r;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=>Xg(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Xg(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Zg(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=qg(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)&&Xg(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(b_(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(t,c),c};return t=>{let i=/* @__PURE__ */ new Map,o=f(t.location.range??{module:t.instancer,start:t.location,end:t.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=e(t.module),l=a(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 p=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.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);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),m=(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(p.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(m(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),p.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&s(m(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=l.argConstraints.get(Gg(e.name,i));a!==void 0&&S_(r,i)<a&&s(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let n=qg(e),r=p.find(e=>e.name===n.operator)?.operator,i=p.find(e=>e.name===n.param);if(!r||!i)return;let a=S_(r,n.index);i.level>a&&s(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),i.size>0)throw r([...i.values()])}},w_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],T_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),E_=new Map(Yd.flatMap(e=>e.map(t=>[t,e[0]]))),D_=e=>E_.get(e)??e,O_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},k_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(O_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},A_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),j_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:D_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:D_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},M_=(e,t)=>{let n=[];for(let r=t;;){let t=j_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},N_=e=>({line:e.line,column:e.column}),P_=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=M_(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},F_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,I_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},L_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&F_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&F_(e[n+1],e[n+2])?n+=F_(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=>I_[e])}"`:r.text)}return t},R_=e=>e[2]?.text,z_=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},B_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>B_(e.modules,t)).find(Boolean),V_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:($d.has(i)?t?.(i):void 0)??ef.get(i)??t?.(i)??Yp(e,i),s=o===void 0?[]:ge(o),c=z_(s),l=c.get(R_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Zp(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>B_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},H_=(e,t)=>{let n=V_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=M_(t,e+1);r.push({location:N_(t[e]),apply:e=>i.forEach(t=>e.put(A_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:N_(u),apply:t=>t.put(A_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&M_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),T_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(N_(u)),r.push({location:N_(u),apply:e=>e.put(A_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(A_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=D_(e.name);r.push({location:e.location,apply:n=>n.put(A_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(A_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(A_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>La(e.location,t.location)?-1:+!!La(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=k_();i.set(e??``,s),Jd.toReversed().forEach(e=>s.put(A_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},U_=(e,t,n)=>H_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),W_=(e,t)=>{let n=H_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},G_=(e,t)=>U_(e,t,`variable`),K_=(e,t,n)=>{let r=V_(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),Xd.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=P_(s(e),e,c);return l.set(e,n),n},f=e=>c.get(e)??u(e),p=/* @__PURE__ */ new Set,m=(e,t)=>c.has(t)||p.has(`${e.key}>${t}`),ee=(e,t,n)=>{let r=[...e.extends.map(f),...e.instances.filter(t=>m(e,t)).map(f),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!m(n,e));return i===void 0?ee(n,r,t):[n,i]};return t},te=h(e=>e.extends),g=h(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;L_(s(void 0)).forEach((e,t)=>{t===3&&Qd.forEach(a),a(e)});let y=u(void 0);for(;;){let e=te(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;if(p.add(`${t.key}>${n}`),v.set(t.unit,[...v.get(t.unit)??[],n]),!_.has(n)){if(_.add(n),r(n).tokens.length===0){let e=t.unit??R_(r(void 0).tokens);throw d(n,e)}L_(s(n)).forEach(a)}}w_.forEach(a);let ne=/* @__PURE__ */ new Set,re=e=>{if(ne.has(e))return;ne.add(e);let t=v.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(re),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return re(void 0),Zd.forEach(a),[...i]},q_=e=>{switch(e.kind){case`Number`:if(!nt(e.value))throw i(new p(`Integer overflow: ${e.value} is outside TLC's 32-bit range`),m.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return kt(e.name);case`Set`:return Tn(e.elements.map(q_))}},J_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],Y_=(e,n)=>{try{return Zp(e)}catch(i){if(!(i instanceof t))throw i;let a=Cp(e);throw a===void 0?i:r([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,a)}},X_=e=>new t(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Z_=(e,t)=>e.location.range&&t.location.range&&{location:f(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${f(t.location.range)}.`},Q_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,$_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:Q_(e),ev=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:vs(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),tv=(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 h(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Ut(t,r)})});if(t)return t[1];throw new h(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},nv=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Ue(e).some(e=>nv(e,t)),rv=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ps(e),n.get(e)??n.size)),n},iv=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),av=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw pl(e);if(e.kind===`Number`&&!nt(e.value))throw ml(e);av(e.kind===`Let`?[...Ue(e),...iv(e.instances??[])]:Ue(e))}),ov=(e,n)=>{let i=Zp(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=new Map(ug.map(e=>[e.name,e])),u=/* @__PURE__ */ new Map,p=Fm(e.checkDeadlock,n.seed);p.isWarningEnabled=n.isWarningEnabled??!0,p.isTool=n.isTool??!1,p.version=n.version??`master`;let m=/* @__PURE__ */ new Map,ee=/* @__PURE__ */ new Map,te=/* @__PURE__ */ new Map,g=[],_=/* @__PURE__ */ new Map,y=[],re=[],ie=(e,t)=>y.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ae={value:0},oe=e=>`${e}#${ae.value++}`,se=[],ce=[],le=C_(e=>{let t=te.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)}}),ue=/* @__PURE__ */ new Map,de=/* @__PURE__ */ new Map,fe=/* @__PURE__ */ new Map,b=e=>{let t=u.get(e);if(t)return t;let r=Dg(e,n.print,p,n.files,l);if(!r)return;Eg.get(e)?.forEach(b);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>b(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{l.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Og.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Ag(e,t.name)??i.get(t.name)?.range})}),u.set(e,i),i},x=e=>{if($d.has(e)&&n.loadModule?.(e)!==void 0)return;let t=b(e),r=Eg.get(e)??[];return t&&ie(e,r),t&&r.includes(`Integers`)&&b(`Integers`),t},S=e=>(av([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...iv(e.instances)]),e.modules.forEach(S),e);S(i);let C=(e,t)=>{let i=n.loadModule?.(e)??qe.get(e)??Yp(n.source,e);if(i===void 0)throw d(e,t);let a=Y_(i,e);if(a.name!==e)throw r([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return S(a)},w=e=>{let n=re.indexOf(e.name);if(n!==-1){let r=[...re.slice(n),e.name].map(e=>`${e}.tla`);throw new t(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let i=/* @__PURE__ */ new Set,a=[],o=[],s=[];re.push(e.name),y.push(i);let c=xe(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:a,errors:o,warnings:ce,levelChecks:s});if(y.pop(),re.pop(),o.length>0)throw r(o,!1,void 0,ce);let l=a.find(e=>i.has(e.name)),u=l&&m.get(l.name),d=u&&Z_(l,u.module);if(d)throw r([d],!1,void 0,ce);if(l)throw X_(l);return s.forEach(e=>e()),{linked:c,closure:i}},pe=(e,t)=>{let r=m.get(e);if(r)return ie(e,_.get(e)??[]),r;let i=w(C(e,t));return(Vm(p.version).has(e)?Dg(e,n.print,p,n.files,l):void 0)?.operators.forEach(e=>{let t=i.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(l.set(t.key,e),a.delete(t.key))}),m.set(e,i.linked),_.set(e,i.closure),ie(e,i.closure),i.linked},me=(e,t,n,r,i)=>{let l=i?void 0:x(e.module);if(l)return he(e,l);let u=i??pe(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=J_(u),f=`#${ae.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=qo(Ug(e,t),d,t,n);se.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let ee=Ts({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Qo(t,p)])),variables:new Set(u.variables),getDefinition:e=>a.get(e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=oe(`${i}@${t.name}`),f=l(u);return a.set(u,f),d.length>0&&c.add(f),e.name!==void 0&&de.set(u,`${e.name}!${de.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:oe});return ge(e,u.exported,d,(t,n)=>{let r=e.name===void 0?ee.getKey(t):ee.getQualifiedKey(t);return d.length>0&&ue.set(r,{name:n,location:e.location}),e.name!==void 0&&fe.set(r,n),r})},he=(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}])),ge=(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:o.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}]}))},_e=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:ys(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ve=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ye=(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=ve(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:ys(r,n),location:n}}},T=(e,t,n,r)=>{let i=e.location,s=r?void 0:x(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=ve(n.arity);return _e(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${ae.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=J_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};se.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=>nv(f(e),p),ee=d.map(t=>{let n=ye(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}}),h=[],te=Ts({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:ys(e.params,i),location:i,resolution:ja}:vs(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${h.length}`,a=r(i);return h.push(a.kind===`Operator`?{...a,name:i}:ev(a,i)),i},createName:oe}),g=new Set(d.map(e=>e.name)),_=[...c.exported].filter(([e])=>!g.has(e)).map(([t,n])=>{let r=te.getKey(n.key),a=ve(n.arity),o=[...e.params,...a];return _e(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...ee,...h,..._]},E=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),be=/* @__PURE__ */ new Map,xe=(e,t)=>{let r=qd(e,n.loadClass?.(e.name),e===i);be.set(e.name,r.overrides);let s=r.module,c=se.length,l=new Map([...ug.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...t.symbols]),u=/* @__PURE__ */ new Map,d={location:Ho,errors:[],warnings:[]},p=[d],m=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||f(n.range)===f(e.range))return;let r=f(e.range),i=f(n.range);$_(n.kind)===$_(e.kind)?d.warnings.push({location:r,message:`Warning: the ${Q_(n.kind)} of '${t}' conflicts with \nits ${Q_(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${Q_(e.kind)} of '${t}' conflicts with \nits ${Q_(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Set,v=/* @__PURE__ */ new Map,y=[],ne=[...s.constants],re=s.variables.map(e=>e.name),ie=s.variables.map(e=>e.location);s.extends.forEach(e=>{let n=t.modules.get(e),r=n?void 0:x(e);if(r){m(r);return}let i=n??pe(e,s.name);ne.push(...i.constants.filter(e=>ne.every(t=>t.name!==e.name))),i.variables.forEach((e,t)=>{re.includes(e)||(re.push(e),ie.push(i.variableLocations[t]))}),m(i.exported),i.facts.forEach(e=>_.add(e)),i.modules.forEach((e,t)=>v.set(t,e)),y.push(i)});let ae=new Map(l),oe=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],ue=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});oe.forEach(e=>h.set(e.name,ue(e)));let de=e=>({key:S(e),arity:Ra(e),params:za(e),kind:Uo(s,e)?`Theorem`:`Definition`,range:e.location.range}),b=ne.length===0&&re.length===0,S=e=>s===i?e.name:`${e.name}@${t.id}`,C=/* @__PURE__ */ new Map,w=()=>new Map([...t.modules,...v]),_e=e=>{let t=s.instances.find(t=>t.module===e.name);return t!==void 0&&La(e.location,t.location)},ve=e=>{let t=s.modules.find(t=>t.name===e.module);return t?_e(t)?v.get(t.name):void 0:w().get(e.module)},ye=e=>({imported:l,getInstance:e=>{let t=ve(e),n=t?void 0:x(e.module);if(n)return{declarations:[],symbols:he(e,n),instancer:s.name};let r=t??pe(e.module,s.name),i=J_(r);return{declarations:i,symbols:ge(e,r.exported,i,e=>e),instancer:s.name}},bound:ae,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:S,instanced:C,facts:_,reports:p,warnings:t.warnings}),Se=e=>[...oe.filter(t=>La(t.location,e)).map(e=>[e.name,ue(e)]),...s.definitions.filter(t=>La(t.location,e)).map(e=>[e.name,de(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),Ce=e=>{let n=w(),r=n.get(e.name),i=r&&Z_(e,r.module);if(r&&!i)throw X_(e);t.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=xe(e,{id:`${t.id}/${e.name}`,symbols:Se(e.location),modules:n,nested:t.nested,errors:a.errors,warnings:a.warnings,levelChecks:t.levelChecks});i&&a.errors.push(i),r||v.set(e.name,o),ee.has(e.name)||ee.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=me(e,s,ye(s),b,w().get(e.module));C.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>Ce(e)}))].sort((e,t)=>La(e.location,t.location)?-1:1).forEach(e=>e.link());let we=Wg(ks(s,(e,t)=>T(e,t,s.name,ve(e))),E(l));t.errors.push(...Yo(we,ye(we))),we.definitions.forEach(e=>{let t=S(e);a.set(t,e),o.set(t,!b);let n=de(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!La(r,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let Te={module:we,constants:ne,variables:re,variableLocations:ie,visible:l,exported:h,modules:v,extended:y,facts:/* @__PURE__ */ new Set([..._,...[...we.theorems,...we.assumptions].flatMap(e=>e.name??[])])};te.has(s.name)||te.set(s.name,Te);let Ee=se.splice(c).map(e=>({location:e.location,check:()=>le(e)}));return t.levelChecks.push(()=>x_(we,{constants:new Set(ne.map(e=>e.name)),variables:new Set(re),getDefinition:e=>a.get(l.get(e)?.key??e),getQualifiedName:e=>fe.get(l.get(e)?.key??e)},Ee,ce)),g.push(Te),Te},Se=w(i).linked;ce.length>0&&!n.isSanyReported&&n.print(ne(ce));let Ce=e=>Se.visible.get(e)?.key??e;Se.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)});let we=[],Te=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Te(e,t)),we.push(...e.module.assumptions))};Te(Se,/* @__PURE__ */ new Set);let Ee=Se.constants.map(e=>e.name),De=Se.variables,Oe=e=>e.module===void 0?[e.name,Ce(e.name)]:e.module===i.name||Ee.includes(e.name)?[]:[(m.get(e.module)??ee.get(e.module))?.visible.get(e.name)?.key??e.name],ke=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:Se.constants.find(t=>t.name===e)?.arity??0},Ae=/* @__PURE__ */ new Map,je=/* @__PURE__ */ new Set,Me=(e,t)=>{l.set(e,t),a.delete(e),Ae.delete(e),je.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=q_(e.value);Sn(t),Oe(e).forEach(e=>{let n=ke(e);n===0?Ae.set(e,t):Me(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ne=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ne.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new v(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(q_),q_(e.value)]),Ne.set(t,n)}),Ne.forEach(e=>Oe(e).forEach(t=>Me(t,tv(e.name,ke(t)||e.rows[0][0].length,e.rows))));let Pe=new Map(e.substitutions.flatMap(e=>Oe(e).map(t=>[t,Ce(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,r=t.target;if(!Ee.includes(n)&&!Se.visible.has(n))throw new v(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===r))throw new v(`In the configuration file, the identifier ${r} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let i=Ce(r),o=a.get(i);if(!(o!==void 0||l.has(i)||Ae.has(i)||Ee.includes(r)||De.includes(r)))throw new v(`The configuration file substitutes for ${n} with the undefined identifier ${r}.`);if(o?.kind===`Operator`&&o.params.length!==(Se.constants.find(e=>e.name===n)?.arity??Se.visible.get(n)?.arity))throw new v(`The configuration file substitutes for ${n} with ${r} of different number of arguments.`)});let Fe=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(Oe)),Ie=(e,t)=>{if(Fe.has(e))return{key:e,prefix:t};let n=s.get(e);return n&&Ie(n.source,t+n.prefix)};s.forEach((e,t)=>{let n=Ie(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=_e(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),Se.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})});let Le=Ee.filter(e=>!Ae.has(e)&&!Pe.has(e)&&!je.has(e));if(Le.length>0&&!n.isUnconfigured){let e=U_(n.source,n.loadModule,`constant`).find(e=>Le.includes(e))??Le[0];throw new v(`The constant parameter ${e} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&l.forEach((e,t)=>{let n=hg(e);n&&l.set(t,n)});let Re={runtime:p,definitions:a,builtins:l,constants:Ae,substitutions:Pe,instanceNames:de,variables:De,variableIndex:rv(De,g.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:c,evaluators:/* @__PURE__ */ new WeakMap},ze=y_({constants:new Set(Ae.keys()),variables:/* @__PURE__ */ new Set([...De,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>l.has(e))]),getDefinition:e=>Tl(e,Re)}),Be=e=>{try{H(e,{environment:Re,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof h)return e;throw e}};Pe.forEach((e,t)=>{let n=a.get(e),r=Ee.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&ze.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Be(n.body):void 0;if(r){let n=ua(r)?``:` - specifically: ${r.message}`;throw new v(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),p.version!==`1.7.4`&&(p.isStarted=!0);let Ve=new Set(g.flatMap(e=>e.module.instances.map(e=>e.module))),D=W_(n.source,n.loadModule);return{environment:Re,assumptions:we,variableLocations:Se.variableLocations,instanceActions:ue,startupDefinitions:g.filter(e=>!Ve.has(e.module.name)||J_(e).length===0).flatMap(e=>D(e===Se?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:Se.constants,rootSymbols:Se.visible,javaOverrides:g.flatMap(e=>be.get(e.module.name)??[])}},sv={kind:`Boolean`,value:!0},cv={kind:`Boolean`,value:!1},lv=e=>e?sv:cv,uv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,dv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),fv=(e,t,n)=>({kind:e,operands:[t,n]}),pv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?pv(e,t.operands).operands:[t])}),mv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return mv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,mv(t)),0)}},hv=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 hv(e.body);case`And`:case`Or`:return e.operands.some(hv)}},gv=/* @__PURE__ */ new WeakMap,_v={count:0},vv=e=>{let t=gv.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`#${_v.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(vv).join(`,`)})`;default:return`${e.kind}(${vv(e.body)})`}})();return gv.set(e,n),n},yv=(e,t)=>e===t||vv(e)===vv(t),bv=(e,t)=>{let n=vv(t);return e.some(e=>e===t||vv(e)===n)},xv=e=>e===`And`?`Or`:`And`,Sv=(e,t)=>{switch(e.kind){case`Boolean`:return t?lv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return Sv(e.body,!t);case`And`:case`Or`:return pv(t?xv(e.kind):e.kind,e.operands.map(e=>Sv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,Sv(e.body,t))}}},Cv=e=>{switch(e.kind){case`Boolean`:return lv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return pv(xv(e.kind),e.operands.map(Cv));case`Always`:return $(`Eventually`,Cv(e.body));case`Eventually`:return $(`Always`,Cv(e.body));default:return $(`Not`,e)}},wv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=wv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return lv(t)}return n.length===0?lv(!t):n.length===1?n[0]:pv(e.kind,n)}case`Not`:{let t=wv(e.body);return t.kind===`Boolean`?lv(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=wv(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Tv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Ev=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Ev(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new h(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>pv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Ev(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Tv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:pv(`Or`,t);n.push($(`Always`,$(`Eventually`,e)))}return pv(`Or`,n)}case`Not`:return uv(e.body)?e:Ev(Cv(e.body));default:return e}},Dv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Dv(e.operands[0]):pv(e.kind,e.operands.map(Dv));case`Not`:return e.body.kind===`Not`?Dv(e.body.body):$(`Not`,Dv(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,Dv(e.body));default:return e}},Ov=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Ov(e.operands[0]);let t=Math.floor(e.operands.length/2);return fv(e.kind,Ov(pv(e.kind,e.operands.slice(0,t))),Ov(pv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,Ov(e.body));default:return e}},kv=(e,t)=>{e.kind===`Eventually`&&!bv(t,e)&&t.push(e),`body`in e&&kv(e.body,t),`operands`in e&&e.operands.forEach(e=>kv(e,t))},Av=e=>{let t=e.filter(dv),n=e.flatMap(e=>e.kind===`Not`&&dv(e.body)?[e.body]:[]);return!t.some(e=>bv(n,e))},jv=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,$(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new h(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Mv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:$(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Nv=(e,t,n)=>e.flatMap(e=>{let r=Mv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Pv=e=>[...new Set(e.map(vv))].sort().join(`|`),Fv=(e,t)=>{let n=new Set(t.map(Pv));return[...e.filter(e=>!n.has(Pv(e))),...t]},Iv=e=>{let t=jv(e),n=Nv(t,`Always`,`And`),r=Nv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Mv(t,`Eventually`,`Or`);if(n&&!(bv(e,n.first)||bv(e,n.second)))return Fv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(bv(e,t.first)||bv(e,t.second))&&!bv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Av(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Mv(t[e],`Always`,`And`);n&&(bv(t,n.first)||t.push(n.first),bv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)bv(t,e.first)&&bv(t,e.second)&&!bv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Av(t)?[]:i(t)};return a(e)},Lv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>mv(e)<=1)}),Rv=e=>{let t=Iv([e]).map(Lv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Pv(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 Iv(n)){let n=Pv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Lv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},zv=(e,t)=>!bv(e,t)||bv(e,t.body),Bv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&mv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Tv(e);if(n){let e=mv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(hv(e))throw new h(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Vv=(e,t)=>{let n=e.findIndex(e=>yv(e,t));return n===-1?(e.push(t),e.length-1):n},Hv=e=>{let t=Ev(wv(Sv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Dv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Bv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:pv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:yv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Ov(e.formula),n=[];t&&kv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Vv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Vv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Vv(i,e))}));return{tableau:t&&Rv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Uv=()=>i(new h(`Temporal formula is a tautology (its negation is unsatisfiable).`),m.livenessEvaluationFailure),Wv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Gv=/* @__PURE__ */ new WeakMap,Kv=/* @__PURE__ */ new WeakSet,qv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Jv=(e,t)=>new h(`TLC cannot handle the temporal formula ${al(e)}${t===void 0?``:`:\n${t}`}`),Yv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=vl(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Yv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Yv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Tl(e,n);if(t)return Xv(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isStateLevel&&!r.isLevelConstant?1:0},o=(e,t)=>r.has(e)?0:O(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return is(e,(e,a)=>(i.value=Math.max(i.value,Yv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Wv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Xv=(e,t)=>{let n=Gv.get(e);if(n!==void 0)return n;Gv.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(Yv(e.body,void 0,t),...r.map(e=>Yv(e.set,void 0,t)));return Gv.set(e,i),i},Zv=(e,t)=>{try{return Rl(e,t)}catch(e){if(!(e instanceof h))throw e;if(!ua(e))return;throw i(new h(`${c}${e.message}`),m.error)}},Qv=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let c=(e,t,s=o,c=i,l)=>Qv(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>c(e,t,al(e)));if(e.kind===`Label`)return c(e.body,t);if(e.kind===`Let`)return c(e.body,$v(e,t,n));if(e.kind===`Identifier`){let r=O(e)?vl(t,e.name):void 0;if(r?.kind===`Thunk`)return c(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:Tl(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Xv(a,n)>0){if(i.has(a))throw s();return c(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let l=qv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Yv(e,t,n)===3)){let t=lu(e,l),r=O(e)?void 0:Tl(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return c(t.body,Cu(t,e.args,l),e.operator,i,r)}let u=r&&e.kind===`Forall`&&e.bounds.every(e=>Yv(e.set,t,n)===0),d=u?Zv(e.bounds,l):void 0;if(u&&d){let n=[];if(zl(e.bounds,d,t,t=>(n.push(...c(e.body,t,al(e.body))),!1)),n.length===0)throw Uv();return n}return[{expression:e,scope:t,name:o}]},$v=(e,t,n)=>{let r=Tu(e.definitions,qv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Kv.add(e.binding);return r},ey=(e,t,r)=>{let i=r.runtime.version===`1.7.4`,a=(e,t,n)=>{let a=n===0&&!i?Yv(e,t,r):n;if(a===0){let n=H(e,qv(r,t));if(typeof n!=`boolean`)throw new h(`TLC expected a boolean value, but did not find one. ${ol(e)}`);return lv(n)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},c=(e,t,n,r)=>{if(o.depth>=100)throw s();o.depth++;let i=m(e,t);o.depth--;let c=mv(i);return c>2?i:a(n,r,c)},l=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=qv(r,t),o=O(e)||Tl(n,r)===void 0?vl(t,n):void 0;if(o?.kind===`Thunk`&&Kv.has(o))return u(e,()=>c(o.expression,o.scope,e,t));let s=o?.kind===`Operator`?o.operator:o?void 0:O(e)?uu(n,a):su(n,r);if(s?.kind!==`Closure`)throw Jv(e);let l=e.kind===`Apply`?e.args:[],d=!O(e)&&Tl(n,r)?.isRecursive===!0;return u(e,()=>(i&&l.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>H(e,a)),c(s.body,Cu(s,l,a),e,t)),d)},u=(e,t,r=!1)=>{try{return t()}catch(t){let a=t instanceof n||r&&!i;throw!(t instanceof h)||a?t:Jv(e)}},d=(e,t)=>{let i=Yv(e,t,r);if(!e.bounds.every(e=>Yv(e.set,t,r)===0)){if(i<=2)return a(e,t,i);throw Jv(e)}let o=[],s=e.kind===`Forall`;try{Bl(e.bounds,qv(r,t),t=>(o.push(m(e.body,t)),!1))}catch(r){if(!(r instanceof h)||r instanceof n)throw r;if(i<=2)return a(e,t,i);throw Jv(e,s&&!ua(r)?r.message:void 0)}return o.length===0?lv(s):f(e,t,pv(s?`And`:`Or`,o))},f=(e,t,n)=>{let r=mv(n);return r>2?n:a(e,t,r)},p=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!O(e)||e.operator===`=>`),m=(e,t)=>{let n=Yv(e,t,r);if(n<=2&&!p(e))return a(e,t,n);switch(e.kind){case`Label`:return m(e.body,t);case`Let`:return m(e.body,$v(e,t,r));case`Identifier`:return l(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,fv(`Or`,$(`Not`,m(n[0],t)),$(`Eventually`,m(n[1],t)))):e.operator===`~`&&!O(e)?f(e,t,$(`Not`,m(n[0],t))):e.operator===`=>`?f(e,t,fv(`Or`,$(`Not`,m(n[0],t)),m(n[1],t))):l(e,t)}case`And`:case`Or`:return f(e,t,pv(e.kind,e.operands.map(e=>m(e,t))));case`Forall`:case`Exists`:return d(e,t);case`If`:{if(!i&&Yv(e.condition,t,r)===0){let n=H(e.condition,qv(r,t));if(typeof n==`boolean`)return m(n?e.consequent:e.alternative,t)}let n=m(e.condition,t);return f(e,t,fv(`Or`,fv(`And`,n,m(e.consequent,t)),fv(`And`,$(`Not`,n),m(e.alternative,t))))}case`Always`:case`Eventually`:return $(e.kind,m(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=$(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?$(`Always`,$(`Eventually`,fv(`Or`,i,a))):fv(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Jv(e)}};return m(e,t)},ty=(e,t,n,r,i)=>{let a=e=>ty(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?wl(H(e.expression,a),`a temporal property predicate`):Jc(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&wl(H(e.unchanged,a),`a subscript`)?!1:wl(H(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return ty(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new h(`TLC cannot evaluate a temporal formula in a single step`)}},ny=(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)=>ny(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 ty(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},ry=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),iy=(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},ay=e=>i(new h(`${l}${e}`),m.error),oy=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!M(e)||!M(i))throw ay(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},sy=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(sy);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},cy=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,ly=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new v(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw ay(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>H(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!A(a)||!N(a))throw ay(`The symmetry operator must specify a set of functions.`);let o=P(a).elements;if(!o.every(j))throw ay(`The symmetry values must be function records.`);let s=o.map(oy),c=r.body.kind===`Apply`?r.body.args:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=sy(cy(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(ea.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;s.forEach(e=>{e.size>0&&d.set(ry(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=iy(n,e),r=ry(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),ee=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!cy(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||ee.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>M(e)&&m.has(e.name))})),d.size===0)return;let h=Math.max(256,Math.floor(4194304/d.size));return{permutations:[...d.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:h})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:h}},uy=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=py(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(py(e[r],t));return a}},dy=(e,t)=>{let n=[],r=[];for(let i of e){let e=py(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Dt);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Dt(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},fy=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,py=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=fy(e);if(n===0||n>64)return my(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=my(e,t),a=i!==e&&Gt(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},my=(e,t)=>{let n=e.kind;if(n===`Set`){let n=dy(e.elements,t);return n?At(n):e}if(n===`Function`||n===`LazyFunction`&&N(e.domain)){let n=I(e),r=uy(n.domain,t),i=uy(n.range,t)??n.range;if(r){let e=jn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?jt(n.domain,e.range):e}return i===n.range?n:jt(n.domain,i)}if(n===`Interval`||!A(e)||!N(e))return e;let r=P(e),i=uy(r.elements,t);return i?Tn(i):r},hy=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},gy=(e,t,n)=>e.images[t]??=py(e.images[0],n.permutations[t-1]),_y=(e,t,n,r)=>{let i=hy(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=Dt(gy(i,t,r),gy(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},vy=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?_y(i,t,n,r):0;if(o!==0)return o<0}return!1},yy=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>vy(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?gy(hy(e,t),r,t):e)},by={line:0,column:0},xy=e=>({kind:`Identifier`,name:e,location:by}),Sy=/* @__PURE__ */ new Set([`name`,`property`]),Cy=(e,t,n)=>{let r=Tl(t,n);if(!r)throw new v(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new v(Sy.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},wy=(e,t,n)=>{if(kl(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return H(xy(e),Ky(n,void 0,void 0))}catch(e){if(e instanceof h||a(e))return;throw e}},Ty=(e,t,n)=>{let r=Cy(e,t,n);if(wy(t,r,n)!==void 0)throw new v(`The ${e} ${t} cannot be a constant.`);return r},Ey=(e,t,n)=>{let r=n.constants.has(t)?void 0:Cy(e,t,n),i=r?wy(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new v(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},Dy=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Oy=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),ru(e.startupDefinitions,r),t.invariants.forEach(e=>{Ey(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},ky=(e,t)=>{let n=y_({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>Tl(e,t)});return e.flatMap(e=>{let r=Ey(`invariant`,e,t);if(!r)return[];let a=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(a.level>=2){let t=a.params.size===0?``:`
|
|
407
1766
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
408
1767
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
409
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`}`);return[{name:e,expression:nm(e),scope:void 0}]})},lm=(e,t)=>{if(!A(e))return;let n=V(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},um=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>um(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Ya(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return um(n.body,t)}return[e]},dm=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||$(r,e.scope,t)>0)return!1;let i=X(r,Tm(t,void 0,void 0,e.scope));if(i===!1)throw new d(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new d(`The operator ${r.name}, which equals ${H(i)},\ncannot be used as a ${n}`);return!0},fm=(t,n)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let r=im(t,e,n).body,i=nm(e);if(r.kind!==`Number`&&r.kind!==`String`&&$(i,void 0,n)===0)throw new d(`The ${t} ${e} cannot be a constant.`);return i};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}let r=[],i=[],o=[],s=im(`name`,t.specification,n),c=om(t.specification,s,n);if(c!==void 0)throw new d(`The value of ${t.specification} is equal to ${H(c)}`);if(kf(s.body,void 0,n,!1).forEach(s=>{let c=s.expression;if(dm(s,n,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw a(new d(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){i.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&$(c.expression,s.scope,n)<2)throw new d(`TLC cannot handle []P in the specification ${t.specification} when P is a state predicate`);let l=$(c,s.scope,n);if(l===3)o.push(s);else{if(l===2)throw new d(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);r.push(s)}}),i.length>1)throw new d(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...r,...i],u=e=>`$specification${e}`,f=l.reduce((e,t,n)=>t.scope===void 0?e:{name:u(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),p=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:u(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:r.length===0?void 0:{kind:`And`,operands:r.map(p),location:$p},next:i.length===0?void 0:p(i[0],r.length),scope:f,temporals:o}},pm=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=sm(`property`,e,t);r&&kf(r.body,void 0,t,!0).forEach(r=>{let i=r.expression;if(dm(r,t,`property`))return;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){n.actionProperties.push({name:e,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:r.scope});return}if(i.kind===`Always`&&$(i.expression,r.scope,t)<=1){n.invariants.push({name:e,expression:i.expression,scope:r.scope});return}let a=$(i,r.scope,t);if(a<2)n.initialPredicates.push({name:e,expression:i,scope:r.scope});else{if(a===2)throw new d(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},mm=(e,t,n)=>t.flatMap(t=>sm(e,t,n)?[{name:t,expression:nm(t),scope:void 0}]:[]),hm=(e,t)=>{let n=Ya(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},gm=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new d(`_POSSIBLE lists ${n} more than once`);am(`possible`,n,t);let i=nm(n);if($(i,void 0,t)===3)throw new d(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),_m=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||J(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},vm=(e,t)=>e.flatMap(e=>um(e.expression,t).map(n=>{let r=Ts(n,t);return{name:e.name,expression:n,scope:e.scope,variables:r,membership:_m(n,r,t)}})),ym=(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},bm=/[\u0100-\uffff]/,xm=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Sm=e=>e.kind===`String`?bm.test(e.value):e.kind===`Set`&&e.elements.some(Sm),Cm=e=>e.kind===`String`&&bm.test(e.value)||e.kind===`Apply`&&xm.has(e.operator)||Ja(e).some(Cm),wm=(e,t)=>e.constants.some(e=>Sm(e.value)||(e.args??[]).some(Sm))||[...t.definitions.values()].some(e=>Cm(e.body)||e.kind===`Function`&&e.bounds.some(e=>Cm(e.set))),Tm=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),Em=(e,t,n)=>qa(X(e,t),n),Dm=(e,t,n=Om)=>{let r=X(e,t);if(typeof r!=`boolean`)throw new f(n(e,t.environment));return r},Om=(e,t)=>{let n=e.kind===`Identifier`?Ya(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${r.kind===`Number`?r.text??String(r.value):i?Pa(i):Fa(r)}`},km=()=>{},Am=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=Em(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),jm=(e,t,n)=>{try{return Em(e,Tm(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof f)return{message:e.message};throw e}},Mm=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=jm(n.expression,t,`an assumption`);if(e)return{name:Fa(n.expression),trace:[],message:e.message}}},Nm=(t,n,r)=>{let i=cm(t.invariants,n),o=fm(t,n),s=pm(t,n),c=vm([...i,...s.invariants],n),l=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(l||s.initialPredicates.length>0||n.variables.length>0))throw new d(`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&l)throw new d(`The configuration file did not specify the next state predicate.`);let u=vm(mm(`constraint`,t.constraints,n),n),f=mm(`action constraint`,t.actionConstraints,n);t.rlReward!==void 0&&im(`rlreward`,t.rlReward,n),t.periodic!==void 0&&im(`periodic`,t.periodic,n);let p=gm(t.possible,n);if(n.variables.length===0)return;let m=t.symmetry===void 0?[]:_p(t.symmetry,n);t.view!==void 0&&im(`view function`,t.view,n);let h=t.view===void 0?void 0:{name:t.view,expression:nm(t.view),scope:void 0},g=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:$p};return{...e,unchanged:t}}),_=e=>$(e.expression,void 0,n)>=2,v=p.filter(e=>!_(e)),y=p.filter(_),b=n.runtime,ee={indices:void 0},x=()=>{if(ee.indices)return ee.indices;let e=r(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return ee.indices=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ee.indices},te=m.length>0?x():void 0,ne=(e,t)=>X(e,Tm(n,t,void 0)),re=e=>{let t=x(),n=m.length===0?e:Tp(e,m,t);return Sc(h===void 0?t.map(e=>n[e]):[ne(h.expression,n)])},S=wm(t,n);b.getFingerprint=re;let ie=()=>{let e=p.find(e=>!b.possibleCounts.get(e.name));if(!e)return;let t=hm(e.name,n),r=t?` at ${Pa(t)}`:``;return{name:e.name,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:me(H(Vc(b),!0))}};return{properties:s,spec:o,isSymmetric:m.length>0,getTlcOrder:x,getStoredFingerprints:(e,t)=>{if(h!==void 0||S)return BigInt64Array.from(e,re);let n=x(),r=Tc();return BigInt64Array.from(t,e=>r(n.map(t=>e[t])))},getFingerprintState:e=>{if(S)return[String(re(e))];let t=m.length===0?e:Tp(e,m,te);return h===void 0?t:[ne(h.expression,t)]},findViolatedInvariant:(t,r)=>c.find(i=>{if(ym(i,t,r))return!1;try{let e=Tm(n,t,void 0,i.scope),a=i.membership;return r&&a?!Qt(t[a.variable],r[a.variable],X(a.set,e)):!Dm(i.expression,e)}catch(t){throw r?Pm(a(t,e.safetyEvaluationFailure),`Evaluating invariant ${i.name} failed.`):t}}),satisfiesConstraints:(e,t)=>u.every(r=>ym(r,e,t)||Dm(r.expression,Tm(n,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!Dm(t.expression,Tm(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>g.find(r=>{try{return!Dm(r.action,Tm(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Fa(r.box)}`)&&!Em(r.unchanged,Tm(n,e,t,r.scope),`a subscript`)}catch(e){throw Pm(e,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>f.every(r=>Dm(r.expression,Tm(n,e,t),e=>`TLC threw an unexpected exception.\nThis was probably caused by an error in the spec or model.\nSee the User Output or TLC Console for clues to what happened.\nThe exception was a java.lang.RuntimeException\n: ${Om(e,n)}`)),trackStatePossible:v.length===0?km:e=>Am(v,b,Tm(n,e,void 0)),trackActionPossible:y.length===0?km:(e,t)=>Am(y,b,Tm(n,e,t)),findUnwitnessedPossible:ie,findPostconditionViolation:()=>{let e=ie();if(e)return e;for(let e of t.postconditions){let t=jm(nm(e),n,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},Pm=(e,t)=>e instanceof f?a(new f(`${t}\n${e.message}`,e),_(e)):e,Fm=e=>{i(!1);let t=typeof e.config==`string`?O(e.config):e.config,n=e.onPrint??console.log,r={isMuted:!1},a=e=>{r.isMuted||n(e)},o=e=>{r.isMuted=!0;let t=e();return r.isMuted=!1,t};De(Up(e.source,t,e.loadModule));let s=Hd(t,{source:e.source,loadModule:e.loadModule,loadClass:e.loadClass,print:a,files:{readFile:e.readFile,writeFile:e.writeFile},seed:e.seed}),l=s.environment,u=l.runtime;u.pause=e.onPause??(()=>{}),u.getSpecification=()=>pp(t,l,s.variableLocations,s.instanceActions);let m={depth:0},h=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:u.generatedStates,distinctStates:u.distinctStates,queuedStates:u.queueSize,depth:u.generatedStates===0?0:Math.max(m.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),g=Array.from({length:32},()=>0),v={newStates:0},y=()=>Math.min(v.newStates,31),b=()=>g.map((e,t)=>t===y()?e+1:e),ee=()=>({...h(`success`),outDegrees:[...g],fingerprintDistance:Zp(u.distinctStates,u.generatedStates,()=>x?x.getStoredFingerprints(T,se):BigInt64Array.from(T,u.getFingerprint))}),x=Nm(t,l,()=>Hp(e.source,e.loadModule)),te=Mm(s.assumptions,l);if(te)return h(`assumption-violation`,te);if(!x)return ee();let ne=t.postconditions.length>0||t.possible.length>0,re=(e,t,n)=>{if(ne){let e=t.loopStart;u.counterExample=Wl(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=x.findUnwitnessedPossible();return r||x.findPostconditionViolation(),h(e,r?{...t,unwitnessed:r}:t)},S=x.spec,ie=x.getFingerprintState,ae={value:void 0},oe=t.view!==void 0||t.symmetry!==void 0,C=c(()=>Hf(x.properties.liveness,S.temporals,l)),w=x.isSymmetric||C!==void 0,T=[],se=[],E=[],D=[],ce=[],le=/* @__PURE__ */ new Map,ue=Nn(),de=e=>Object.fromEntries(x.getTlcOrder().map(t=>[l.variables[t],e[t]])),fe=(e,t,n,r)=>{let i=t[n].state,a=(t[n+1]??t[r??n]).state;u.getLevel=()=>n+1,u.getBehavior=()=>t.slice(0,n+1).map(e=>e.state);try{let t=am(`alias`,e,l).body,n=X(nm(e),Tm(l,i,a)),r=t.kind===`Record`?t.fields.map(e=>e.name):[];return lm(n,r)??de(i)}catch(e){if(!(e instanceof d||e instanceof f))throw e;return{...de(i),_ALIASEvalError:e.message}}},pe=(e,n,r)=>{ae.value??=dp(t,l,s.instanceActions);let i={...N};Object.assign(N,{index:e,isExpanding:!0,candidate:void 0});let a=ie(r),o=ae.value.find(e=>Na(e.expression,n,l,e.scope).some(e=>Se(ie(e.state),a)));return Object.assign(N,i),o&&fp(o)},me=(e,n,r)=>{let i=t.alias,a=o(()=>(e.length>1&&Bo(l)&&k(),e.map((t,r)=>r===0||t.action===`Stuttering`?void 0:pe(n[r-1],e[r-1].state,t.state))));return e.map((t,n)=>({action:t.action,label:a[n],state:i===void 0?de(t.state):fe(i,e,n,r)}))},k=()=>S.init===void 0?[]:ja(S.init,l,S.scope),A=e=>S.next===void 0?[]:Na(S.next,e,l,S.scope),j=(e,t)=>Se(ie(e),se[t]),he=(e,t)=>A(e).find(e=>j(e.state,t)),ge=(e,t)=>{let n=oe||Bo(l)?k().find(t=>j(t,e[0])):T[e[0]];if(!n)throw new f(em);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=he(i,e[n]);if(!a)throw new f(t);r.push(a)}return r},_e=(e,t)=>{let n=[];for(let t=e;t!==-1;t=E[t])n.unshift(t);let r=oe&&n.length>1?ge(n,em):n.map(e=>({state:T[e],action:D[e]}));if(!t)return me(r,n);let i=oe?A(T[e]).find(e=>Se(e.state,t.state))?.action:t.action;return me([...r,{state:t.state,action:i}],n)},ve=e=>E[e]===-1?[{action:void 0,label:void 0,state:de(T[e])}]:_e(e),ye=(e,t,n,r)=>{if(!(e instanceof f))throw e;return{...h(`error`,void 0,{message:e.message,trace:t,initialState:n&&!(e instanceof p)?de(n):void 0,exitCode:_(e)}),outDegrees:r}},be=(e,t)=>{let n=ge(e,tm),r=n[n.length-1].state;if(oe&&t!==void 0&&t!==e.length-1&&he(r,e[t])===void 0)throw new f(tm);return me(n,e,t)},xe=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=un(t,hn(e[n]));return t&1073741823},Se=(e,t)=>{for(let n=0;n<t.length;n++)if(!He(e[n],t[n]))return!1;return!0},Ce=(e,t)=>{let n=le.get(e);return n===void 0?-1:typeof n==`number`?Se(se[n],t)?n:-1:n.find(e=>Se(se[e],t))??-1},we=(e,t)=>{let n=le.get(e);n===void 0?le.set(e,t):typeof n==`number`?le.set(e,[n,t]):n.push(t)},M=e=>{u.distinctStates=T.length+1,m.depth=Math.max(m.depth,e),u.diameter=Math.max(u.diameter,e)},Te=(e,t,n,r)=>{let i=n===-1?1:ce[n]+1;T.push(e),se.push(t),E.push(n),D.push(r),ce.push(i)},N={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},Ee=e=>e===-1?[]:[...Ee(E[e]),T[e]];u.isSeen=e=>{let t=ie(e);return Ce(xe(t),t)!==-1},u.getBehavior=e=>{let t=e===N.candidate?-1:T.indexOf(e);return t===-1?[...Ee(N.index),e]:Ee(t)},u.getCurrentState=()=>N.index===-1?void 0:T[N.index],u.setLivenessSource=e=>{N.livenessSource=e},u.getLevel=e=>{let t=N.livenessSource;return t===-1?e===N.candidate?N.candidateLevel:N.index===-1?0:e===T[N.index]?ce[N.index]:N.isExpanding?ce[N.index]+1:0:e===T[t]?ce[t]:ce[t]+1};let Oe=e=>{ue(e),u.generatedStates++,u.initialStates++,N.candidate=e,N.candidateLevel=1;let t=ie(e),n=xe(t),r=x.satisfiesConstraints(e);if(r&&x.trackStatePossible(e),r&&Ce(n,t)!==-1)return;r&&(M(1),u.queueSize++,C?.addInitialState(T.length,e));let i=x.findViolatedInvariant(e);if(i)return re(`invariant-violation`,{name:i.name,trace:me([{action:void 0,state:e}],[])});let a=x.findFailedInitialPredicate(e);if(a)return re(`liveness-violation`,{name:a.name,trace:me([{action:void 0,state:e}],[])});r&&(we(n,T.length),Te(e,t,-1,void 0))},ke=(e,t,n)=>{let r=T[e];u.generatedStates++,N.candidate=t.state,N.candidateLevel=ce[e]+1,w&&ue(t.state);let i=ie(t.state),a=xe(i),o=Ce(a,i),s=x.satisfiesConstraints(t.state,r);s&&x.trackStatePossible(t.state);let c=s&&x.satisfiesActionConstraints(r,t.state);c&&x.trackActionPossible(r,t.state);let l=c?o:-1;if(l!==-1&&C){let e=T[l],r=e.every((e,n)=>e===t.state[n]);n.push({index:l,state:r?e:t.state})}let d=c&&l===-1;if(d&&(M(ce[e]+1),v.newStates++),l===-1)try{let n=x.findViolatedInvariant(t.state,r);if(n)return re(`invariant-violation`,{name:n.name,trace:_e(e,t)})}catch(n){return ye(n,_e(e,t),void 0,b())}let f=x.findViolatedActionProperty(r,t.state);if(f)return re(`liveness-violation`,{name:f.name,trace:_e(e,t)});d&&(w||ue(t.state),we(a,T.length),C&&n.push({index:T.length,state:t.state}),Te(t.state,i,e,t.action),u.queueSize++)},Ae={result:void 0};if(S.init!==void 0)try{Aa(S.init,l,e=>{try{Ae.result=Oe(e)}catch(t){Ae.result=ye(t,[],e)}return Ae.result!==void 0},S.scope)}catch(e){return ye(e,[])}if(Ae.result)return Ae.result;let je=S.next;if(je===void 0){if(T.length>0)throw new f(`No next state actions defined to generate successor states from.`);return ee()}let P=e=>{let n=T[e],r=[],i=Ma(je,n,l,t=>{try{Ae.result=ke(e,t,r)}catch(n){Ae.result=ye(n,_e(e,t))}return Ae.result!==void 0},S.scope);if(N.isExpanding=!1,Ae.result)return Ae.result;if(i===0&&t.checkDeadlock)return re(`deadlock`,{name:`deadlock`,trace:ve(e)});try{let t=C?.addState(e,n,r);return N.livenessSource=-1,t?re(`property-violation`,{name:t.name,trace:be(t.path)}):void 0}catch(t){return ye(t,ve(e),void 0,b())}},Me=e=>{let t=[...e.prefix,...e.cycle],n=be(t,e.prefix.length),r=t[e.prefix.length],i=t[t.length-1],a=r===i?void 0:o(()=>pe(i,T[i],T[r]));return re(`liveness-violation`,{name:e.name,trace:n,loopStart:e.prefix.length,loopLabel:a},()=>r===i?n[n.length-1].action:A(T[i]).find(e=>Se(e.state,T[r]))?.action)},Ne=C!==void 0&&e.livenessCheck!==`final`,Pe=performance.now(),Fe={at:Pe+3e3,size:1,time:0},F=e=>{let t=performance.now();if(Fe.at=t+6e4,!((e-Fe.size)/Fe.size>.1)||Fe.time>(t-Pe)*.2)return;Fe.size=e;let n=C?.findViolation();return N.livenessSource=-1,Fe.time+=performance.now()-t,n};i(!0);for(let e=0;e<T.length&&!u.isStopped;e++){N.index=e,N.candidate=void 0,u.queueSize=T.length-e-1,N.isExpanding=!0;try{Ae.result=P(e)}catch(t){Ae.result=ye(t,ve(e))}if(Ae.result)return Ae.result;if(g[y()]++,v.newStates=0,Ne&&performance.now()>=Fe.at){let t=F(e+1);if(t)return Me(t)}}N.index=-1,N.candidate=void 0;let Ie=C?.findViolation();if(N.livenessSource=-1,Ie)return Me(Ie);let Le=x.findPostconditionViolation();return Le?h(`postcondition-violation`,{...Le,trace:[]}):ee()},Im=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Lm=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^hn(e[t]),16777619),r=Math.imul(r^Sn(e[t]),1540483477);t[0]=Im(n)||1,t[1]=Im(r)},Rm=(e,t)=>(e>>>0)%t,zm=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0&&e[i*2+1]===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)},remove:(n,r)=>{let i=t(e.slots,n,r);e.slots[i*2]===n&&(e.slots[i*2]=0,e.slots[i*2+1]=1)}}},Bm=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=an(e.domain);return t?(r(7),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},Vm=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Le(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=kt({kind:`Interval`,low:e,high:e+t-1});return ze(a,i(t))}let a=n[r.index++];if(e===5)return Re(i(a));let o=i(a);return ze(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{l as A,H as C,O as D,me as E,h as F,_ as I,e as L,m as M,u as N,se as O,g as P,Nn as S,De as T,ac as _,Lm as a,ja as b,Mm as c,Zp as d,Wp as f,Hd as g,Hp as h,Rm as i,f as j,d as k,Jp as l,Up as m,Bm as n,Fm as o,Qp as p,zm as r,Nm as s,Vm as t,Xp as u,oc as v,ke as w,Na as x,Bo as y};
|
|
1768
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw i(new v(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),m.safetyEvaluationFailure)}return[{name:e,expression:xy(e),scope:void 0}]})},Ay=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Ay(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Tl(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Ay(n.body,t)}return[e]},jy=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Yv(r,e.scope,t)>0)return!1;let i=H(r,Ky(t,void 0,void 0,e.scope));if(i===!1)throw new v(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new v(`The operator ${r.name}, which equals ${L(i)},\ncannot be used as a ${n}`);return!0},My=(e,t)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return Ty(n,e,t),xy(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[]}}if(e.init!==void 0||e.next!==void 0)throw new v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let n=[],r=[],a=[],o=Cy(`name`,e.specification,t),s=wy(e.specification,o,t);if(s!==void 0)throw new v(`The value of ${e.specification} is equal to ${L(s)}`);if(Qv(o.body,void 0,t,!1).forEach(o=>{let s=o.expression;if(jy(o,t,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw i(new v(`TLC does not support temporal existential, nor universal, quantification over state variables.`),m.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){r.push({expression:s.expression.action,scope:o.scope});return}if(s.kind===`Always`&&Yv(s.expression,o.scope,t)<2)throw i(new h(`TLC cannot handle the temporal formula ${al(s.expression)}`),m.error);let c=Yv(s,o.scope,t);if(c===3)a.push(o);else{if(c===2)throw new v(`TLC cannot handle the action-level conjunct of the specification ${e.specification}`);n.push(o)}}),r.length>1)throw new v(`The specification ${e.specification} must contain at most one [][Next]_vars`);let c=[...n,...r],l=e=>`$specification${e}`,u=c.reduce((e,t,n)=>t.scope===void 0?e:{name:l(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),d=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:l(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:n.length===0?void 0:{kind:`And`,operands:n.map(d),location:by},next:r.length===0?void 0:d(r[0],n.length),scope:u,temporals:a}},Ny=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=Ey(`property`,e,t);if(!i)return;Yv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Qv(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(jy(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`&&Yv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!O(e)?Tl(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=Yv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new v(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},Py=(e,t,n)=>t.flatMap(t=>Ey(e,t,n)?[{name:t,expression:xy(t),scope:void 0}]:[]),Fy=(e,t)=>{let n=Tl(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Iy=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);Ty(`possible`,n,t);let i=xy(n);if(Yv(i,void 0,t)===3)throw new v(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Ly=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||O(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Ry=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Tl(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},zy=(e,t)=>e.flatMap(e=>Ay(e.expression,t).map(n=>{let r=e.scope===void 0?Aa(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Ly(n,r,t),predicate:Ry(e.expression,t)}})),By=(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},Vy=/[\u0100-\uffff]/,Hy=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Uy=e=>e.kind===`String`?Vy.test(e.value):e.kind===`Set`&&e.elements.some(Uy),Wy=e=>e.kind===`String`&&Vy.test(e.value)||e.kind===`Apply`&&Hy.has(e.operator)||Ue(e).some(Wy),Gy=(e,t)=>e.constants.some(e=>Uy(e.value)||(e.args??[]).some(Uy))||[...t.definitions.values()].some(e=>Wy(e.body)||e.kind===`Function`&&e.bounds.some(e=>Wy(e.set))),Ky=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),qy=(e,t,n)=>wl(H(e,t),n),Jy=(e,t,n=Yy)=>{let r=H(e,t);if(typeof r!=`boolean`)throw new h(n(e,t.environment));return r},Yy=(e,t)=>{let n=e.kind===`Identifier`?Tl(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?il(i):ol(r)}`},Xy=(e,t)=>Jy(e.expression,t,(n,r)=>(Jy(e.predicate,t),Yy(n,r))),Zy=()=>{},Qy=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=qy(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),$y=(e,t,n)=>{try{return qy(e,Ky(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof h)return{message:e.message};throw e}},eb=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=$y(n.expression,t,`an assumption`);if(e)return{name:al(n.expression),trace:[],message:e.message}}},tb=(e,t,n,r)=>{let a=ky(e.invariants,t),o=My(e,t),s=Ny(e,t,r),c=zy([...a,...s.invariants],t),u=[...new Map(c.map(e=>[e.predicate,e])).values()],d=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(d||s.initialPredicates.length>0||t.variables.length>0))throw new v(t.runtime.version===`1.7.4`?ia:`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&d)throw new v(`The configuration file did not specify the next state predicate.`);let f=zy(Py(`constraint`,e.constraints,t),t),p=Py(`action constraint`,e.actionConstraints,t);e.rlReward!==void 0&&Cy(`rlreward`,e.rlReward,t),e.periodic!==void 0&&Cy(`periodic`,e.periodic,t);let ee=Iy(e.possible,t);if(t.variables.length===0)return;let te=e.symmetry===void 0?void 0:ly(e.symmetry,t,e.substitutions);e.view!==void 0&&Cy(`view function`,e.view,t);let g=e.view===void 0?void 0:{name:e.view,expression:xy(e.view),scope:void 0},_=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:by};return{...e,unchanged:t}}),y=e=>Yv(e.expression,void 0,t)>=2,ne=ee.filter(e=>!y(e)),re=ee.filter(y),ie=t.runtime,ae={indices:void 0},oe=()=>{if(ae.indices)return ae.indices;let e=n(),r=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return ae.indices=t.variables.map((e,t)=>t).sort((e,t)=>r(e)-r(t)),ae.indices},se=(e,n)=>H(e,Ky(t,n,void 0)),ce=e=>{let t=oe(),n=te===void 0?e:yy(e,te,t);return dm(g===void 0?t.map(e=>n[e]):[se(g.expression,n)])},le=Gy(e,t);ie.getFingerprint=ce;let ue=()=>{let e=ee.find(e=>!ie.possibleCounts.get(e.name));if(!e)return;let n=Fy(e.name,t),r=n?` at ${il(n)}`:``;return{name:e.name,code:ea.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:k(L(Im(ie),!0))}};return{properties:s,spec:o,isSymmetric:te!==void 0,isConstrained:f.length>0||p.length>0,getTlcOrder:oe,getStoredFingerprints:(e,t)=>{if(g!==void 0||le)return BigInt64Array.from(e,ce);let n=new BigInt64Array(t.length),r=mm(oe(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(le)return[String(ce(e))];let t=te===void 0?e:yy(e,te,oe());return g===void 0?t:[se(g.expression,t)]},findViolatedInvariant:(e,n)=>c.find(r=>{if(By(r,e,n))return!1;try{let i=Ky(t,e,void 0,r.scope),a=r.membership;return n&&a?!xr(e[a.variable],n[a.variable],H(a.set,i)):!Xy(r,i)}catch(e){throw n?va(i(e,m.safetyEvaluationFailure),ea.invariantEvaluationFailed,`Evaluating invariant ${r.name} failed.`):e}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Jy(n,Ky(t,e,void 0,r));f.every(e=>r(e.predicate,e.scope))&&n();let i=u.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=s.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(f.every(e=>Jy(e.predicate,Ky(n,t,void 0,e.scope)))&&p.every(r=>Jy(r.expression,Ky(n,e,t,r.scope))))||r())||u.every(e=>Jy(e.predicate,Ky(n,t,void 0,e.scope))))&&_.every(r=>Jy(r.box,Ky(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>f.every(r=>By(r,e,n)||Xy(r,Ky(t,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(n=>!Jy(n.expression,Ky(t,e,void 0,n.scope))),findViolatedActionProperty:(e,n)=>_.find(r=>{try{return!Jy(r.action,Ky(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${al(r.box)}`)&&!qy(r.unchanged,Ky(t,e,n,r.scope),`a subscript`)}catch(e){throw va(nb(e),ea.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,n)=>p.every(r=>Jy(r.expression,Ky(t,e,n),e=>`${l}${Yy(e,t)}`)),trackStatePossible:ne.length===0?Zy:e=>Qy(ne,ie,Ky(t,e,void 0)),trackActionPossible:re.length===0?Zy:(e,n)=>Qy(re,ie,Ky(t,e,n)),findUnwitnessedPossible:ue,findPostconditionViolation:(n=!1)=>{let r=e.postconditions.find(e=>{let n=Tl(e,t);return n!==void 0&&t.definitionValues.has(n)});if(r!==void 0){if(n)return;throw i(new h(`${l}The post condition ${r} cannot be a constant.`),m.error)}let a=ue();if(a)return a;for(let n of e.postconditions){let e=$y(xy(n),t,`a postcondition`);if(!e)continue;let r=Fy(n,t),i=r?` at ${il(r)}`:``;return e.message===void 0?{name:n,code:ea.postconditionFalse,message:`Postcondition ${n}${i} is false.`}:{name:n,code:ea.postconditionFailed,message:`Evaluating postcondition ${n}${i} failed.\n${e.message}`}}}}},nb=e=>e instanceof p?i(e,e.exitCode):e,rb=(e,t)=>e*((t-e)/2**64),ib=e=>e.includes(`.`)?e:`${e}.0`,ab=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return ib(String(e));let[n,r]=e.toExponential().split(`e`);return`${ib(n)}E${r.replace(`+`,``)}`},ob=e=>e!==void 0&&e>=`0`&&e<=`9`,sb=e=>{if(e===0)return`0.0`;let t=ab(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;ob(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;ob(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;ob(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(ob(t[n.next])&&Number(t[n.next])>=5&&(n.result=cb(n.result));ob(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},cb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${cb(r)}.`:n===`9`?`${cb(r)}0`:`${r}${Number(n)+1}`},lb=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},ub=(e,t,n)=>{if(rb(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},db=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},fb=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},pb=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Ur(e[t]),16777619),r=Math.imul(r^Xr(e[t]),1540483477);t[0]=fb(n)||1,t[1]=fb(r)},mb=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},hb=(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}},gb=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),_b=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return hb(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},vb=e=>Atomics.load(e.used,0)*2>=e.slots.length,yb=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&hb(t,n);return{slots:t,used:e.used}},bb=[void 0,`lambda`,`tuple`,`record`],xb=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=kr(e.domain);return t?(r(7),r(bb.indexOf(Pt(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(bb.indexOf(Pt(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},Sb=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return kt(t.strings[n[r.index++]]);if(e===5)return At(i(n[r.index++]));let a=bb[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=zn({kind:`Interval`,low:e,high:e+t-1});return Nt(jt(o,i(t)),a)}let o=n[r.index++],s=i(o);return Nt(jt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{il as $,vv as A,Vn as At,dm as B,ht as Bt,ty as C,ya as Ct,pv as D,kt as Dt,ey as E,Jt as Et,Rh as F,yt as Ft,Cp as G,D as Gt,Zp as H,I as Ht,zh as I,Ur as It,Cu as J,b as Jt,Yd as K,He as Kt,Bm as L,j as Lt,ov as M,L as Mt,K_ as N,Vr as Nt,$ as O,Hn as Ot,G_ as P,Hr as Pt,Bl as Q,zm as R,Gt as Rt,Uv as S,ua as St,Yv as T,Pr as Tt,$p as U,Ue as Ut,Yp as V,_t as Vt,Qp as W,O as Wt,al as X,me as Xt,Qu as Y,S as Yt,H as Z,ge as Zt,Ty as _,ga as _t,yb as a,su as at,Oy as b,Da as bt,pb as c,Xc as ct,ub as d,ic as dt,Tl as et,rb as f,ea as ft,eb as g,pa as gt,tb as h,fa as ht,gb as i,vl as it,zv as j,si as jt,Hv as k,Tn as kt,sb as l,Qc as lt,xy as m,ra as mt,xb as n,kl as nt,_b as o,Yc as ot,db as p,ta as pt,Tu as q,Pe as qt,mb as r,Iu as rt,vb as s,Zc as st,Sb as t,Lu as tt,lb as u,rc as ut,Ky as v,ha as vt,ny as w,wa as wt,nb as x,Ca as xt,Dy as y,la as yt,Vm as z,Ht as zt};
|