tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (538) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +58 -54
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +4 -1
  8. package/dist/index.d.ts +4 -1
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +45 -44
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +43 -40
  21. package/dist/transfer.js +43 -40
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +3 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +336 -88
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/dependencies.ts +23 -2
  36. package/src/dfid.ts +9 -2
  37. package/src/environment.ts +27 -5
  38. package/src/errors.ts +30 -3
  39. package/src/evaluate.ts +9 -3
  40. package/src/exit-codes.ts +5 -2
  41. package/src/instances.ts +1 -1
  42. package/src/levels.ts +3 -2
  43. package/src/lexer.ts +5 -3
  44. package/src/liveness-checker.ts +572 -204
  45. package/src/liveness.ts +47 -32
  46. package/src/obligations/action.ts +10 -6
  47. package/src/obligations/anonymize.ts +33 -14
  48. package/src/obligations/enabled-axioms.ts +218 -0
  49. package/src/obligations/equality.ts +1 -3
  50. package/src/obligations/expression.ts +18 -6
  51. package/src/obligations/format.ts +0 -2
  52. package/src/obligations/generate.ts +22 -17
  53. package/src/obligations/index.ts +36 -6
  54. package/src/obligations/levels.ts +24 -11
  55. package/src/obligations/module.ts +1 -3
  56. package/src/obligations/normalize.ts +24 -13
  57. package/src/obligations/operators.ts +0 -2
  58. package/src/obligations/pragma.ts +53 -16
  59. package/src/obligations/printer.ts +43 -13
  60. package/src/obligations/proof.ts +3 -2
  61. package/src/obligations/regroup.ts +0 -2
  62. package/src/obligations/simplify.ts +17 -7
  63. package/src/obligations/source.ts +71 -17
  64. package/src/obligations/subexpression.ts +45 -18
  65. package/src/obligations/substitution.ts +1 -3
  66. package/src/obligations/temporal.ts +0 -2
  67. package/src/obligations/tuples.ts +0 -2
  68. package/src/parallel-worker.ts +8 -2
  69. package/src/parallel.ts +7 -2
  70. package/src/parser.ts +633 -186
  71. package/src/pretty-print.ts +1 -1
  72. package/src/prover/deciders.ts +11 -8
  73. package/src/prover/isabelle/decide.ts +3 -25
  74. package/src/prover/isabelle/encode.ts +71 -41
  75. package/src/prover/isabelle/isar/attrib.ts +250 -0
  76. package/src/prover/isabelle/isar/context.ts +335 -0
  77. package/src/prover/isabelle/isar/induct.ts +382 -0
  78. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  79. package/src/prover/isabelle/isar/method.ts +506 -198
  80. package/src/prover/isabelle/isar/proof.ts +570 -14
  81. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  82. package/src/prover/isabelle/isar/theory.ts +479 -69
  83. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  84. package/src/prover/isabelle/isar/type-check.ts +83 -8
  85. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  86. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  88. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  91. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  92. package/src/prover/isabelle/provers/classical.ts +45 -20
  93. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  94. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  95. package/src/prover/isabelle/pure/consts.ts +0 -2
  96. package/src/prover/isabelle/pure/conv.ts +0 -2
  97. package/src/prover/isabelle/pure/drule.ts +63 -4
  98. package/src/prover/isabelle/pure/envir.ts +0 -2
  99. package/src/prover/isabelle/pure/goal.ts +1 -3
  100. package/src/prover/isabelle/pure/logic.ts +0 -2
  101. package/src/prover/isabelle/pure/name.ts +0 -2
  102. package/src/prover/isabelle/pure/net.ts +0 -2
  103. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  104. package/src/prover/isabelle/pure/pattern.ts +0 -2
  105. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  106. package/src/prover/isabelle/pure/rewriter.ts +1 -8
  107. package/src/prover/isabelle/pure/search.ts +0 -2
  108. package/src/prover/isabelle/pure/seq.ts +0 -2
  109. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  110. package/src/prover/isabelle/pure/table.ts +0 -2
  111. package/src/prover/isabelle/pure/tactic.ts +0 -2
  112. package/src/prover/isabelle/pure/tactical.ts +0 -2
  113. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  114. package/src/prover/isabelle/pure/term.ts +0 -2
  115. package/src/prover/isabelle/pure/thm.ts +0 -2
  116. package/src/prover/isabelle/pure/type.ts +0 -2
  117. package/src/prover/isabelle/pure/unify.ts +0 -2
  118. package/src/prover/isabelle/pure/variable.ts +0 -2
  119. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  120. package/src/prover/isabelle/tla/context.ts +51 -9
  121. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  122. package/src/prover/isabelle/tla/logic.ts +40 -1
  123. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  124. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  125. package/src/prover/ocaml.ts +4 -1
  126. package/src/prover/prep/action.ts +19 -12
  127. package/src/prover/prep/enabled-axioms.ts +11 -2
  128. package/src/prover/prep/methods.ts +159 -50
  129. package/src/prover/prep/normalize.ts +38 -9
  130. package/src/prover/prove.ts +343 -65
  131. package/src/prover/ptl/decide.ts +95 -50
  132. package/src/prover/ptl/encode.ts +2 -3
  133. package/src/prover/ptl/tableau.ts +28 -2
  134. package/src/prover/smt/arithmetic.ts +310 -0
  135. package/src/prover/smt/axioms.ts +12 -8
  136. package/src/prover/smt/context.ts +42 -6
  137. package/src/prover/smt/data.ts +191 -84
  138. package/src/prover/smt/encode.ts +122 -43
  139. package/src/prover/smt/extensionality.ts +5 -3
  140. package/src/prover/smt/flatten.ts +4 -6
  141. package/src/prover/smt/format.ts +28 -4
  142. package/src/prover/smt/instances.ts +7 -1
  143. package/src/prover/smt/layout.ts +91 -0
  144. package/src/prover/smt/rewrite.ts +483 -116
  145. package/src/prover/smt/simplify.ts +441 -0
  146. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  147. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  148. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  149. package/src/prover/smt/solver/act-cache.ts +0 -1
  150. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  151. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  152. package/src/prover/smt/solver/aig.ts +889 -0
  153. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  154. package/src/prover/smt/solver/arith-terms.ts +121 -0
  155. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  156. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  157. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  158. package/src/prover/smt/solver/ast-lt.ts +165 -11
  159. package/src/prover/smt/solver/ast-util.ts +160 -2
  160. package/src/prover/smt/solver/ast.ts +1448 -41
  161. package/src/prover/smt/solver/auf-solver.ts +0 -1
  162. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  163. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  164. package/src/prover/smt/solver/bound-manager.ts +196 -0
  165. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  166. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  167. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  168. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  169. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  170. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  171. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  172. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  173. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  174. package/src/prover/smt/solver/card2bv.ts +109 -0
  175. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  176. package/src/prover/smt/solver/cg-table.ts +39 -25
  177. package/src/prover/smt/solver/check-logic.ts +330 -0
  178. package/src/prover/smt/solver/clause.ts +0 -1
  179. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  180. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  181. package/src/prover/smt/solver/context.ts +533 -114
  182. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  183. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  184. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  185. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  186. package/src/prover/smt/solver/demodulator.ts +786 -0
  187. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  188. package/src/prover/smt/solver/der.ts +38 -10
  189. package/src/prover/smt/solver/diff-neq.ts +205 -0
  190. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  191. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  192. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  193. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  194. package/src/prover/smt/solver/e-matching.ts +6 -7
  195. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  196. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  197. package/src/prover/smt/solver/enode.ts +100 -3
  198. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  199. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  200. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  201. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  202. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  203. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  204. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  205. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  206. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  207. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  208. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  209. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  210. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  211. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  212. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  213. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  214. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  215. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  216. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  217. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  218. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  219. package/src/prover/smt/solver/expr-ref.ts +0 -1
  220. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  221. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  222. package/src/prover/smt/solver/factor.ts +163 -0
  223. package/src/prover/smt/solver/fd-solver.ts +267 -0
  224. package/src/prover/smt/solver/fingerprints.ts +15 -15
  225. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  226. package/src/prover/smt/solver/flat-literals.ts +0 -1
  227. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  228. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  229. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  230. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  231. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  232. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  233. package/src/prover/smt/solver/goal.ts +177 -15
  234. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  235. package/src/prover/smt/solver/guard-set.ts +219 -0
  236. package/src/prover/smt/solver/hash.ts +0 -1
  237. package/src/prover/smt/solver/hashtable.ts +30 -16
  238. package/src/prover/smt/solver/inf-eps.ts +63 -0
  239. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  240. package/src/prover/smt/solver/internalizer.ts +109 -36
  241. package/src/prover/smt/solver/lackr.ts +381 -0
  242. package/src/prover/smt/solver/lbool.ts +0 -1
  243. package/src/prover/smt/solver/lia2card.ts +268 -0
  244. package/src/prover/smt/solver/lia2pb.ts +154 -0
  245. package/src/prover/smt/solver/literal.ts +0 -1
  246. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  247. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  248. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  249. package/src/prover/smt/solver/lp/containers.ts +7 -2
  250. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  251. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  252. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  253. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  254. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  255. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  256. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  257. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  258. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  259. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  260. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  261. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  262. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  263. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  264. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  265. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  266. package/src/prover/smt/solver/lp/nex.ts +2 -2
  267. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  268. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  269. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  270. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  271. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  272. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  273. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  274. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  278. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  281. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  282. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  283. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  284. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  286. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  287. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  288. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  289. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  290. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  291. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  292. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  293. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  294. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  295. package/src/prover/smt/solver/macro-finder.ts +530 -0
  296. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  297. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  298. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  299. package/src/prover/smt/solver/max-cliques.ts +105 -0
  300. package/src/prover/smt/solver/maxcore.ts +309 -0
  301. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  302. package/src/prover/smt/solver/maxlex.ts +115 -0
  303. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  304. package/src/prover/smt/solver/maxsmt.ts +92 -0
  305. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  306. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  307. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  308. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  309. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  310. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  311. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  312. package/src/prover/smt/solver/model-checker.ts +17 -26
  313. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  314. package/src/prover/smt/solver/model-finder.ts +0 -1
  315. package/src/prover/smt/solver/model-generator.ts +59 -30
  316. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  317. package/src/prover/smt/solver/model-printer.ts +214 -0
  318. package/src/prover/smt/solver/mpf.ts +709 -0
  319. package/src/prover/smt/solver/mus.ts +50 -0
  320. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  321. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  322. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  323. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  324. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  325. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  326. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  327. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  328. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  329. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  330. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  331. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  332. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  333. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  334. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  335. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  336. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  337. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  338. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  339. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  340. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  341. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  342. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  343. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  344. package/src/prover/smt/solver/nlqsat.ts +484 -0
  345. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  346. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  347. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  348. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  349. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  350. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  351. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  352. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  353. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  354. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  355. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  356. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  357. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  358. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  359. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  360. package/src/prover/smt/solver/nnf.ts +105 -23
  361. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  362. package/src/prover/smt/solver/occf.ts +97 -0
  363. package/src/prover/smt/solver/opt-context.ts +792 -0
  364. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  365. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  366. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  367. package/src/prover/smt/solver/opt-solver.ts +311 -0
  368. package/src/prover/smt/solver/opt-value.ts +55 -0
  369. package/src/prover/smt/solver/optsmt.ts +692 -0
  370. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  371. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  372. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  373. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  374. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  375. package/src/prover/smt/solver/probes.ts +511 -0
  376. package/src/prover/smt/solver/propagate-values.ts +37 -21
  377. package/src/prover/smt/solver/proto-model.ts +650 -17
  378. package/src/prover/smt/solver/pull-quant.ts +28 -12
  379. package/src/prover/smt/solver/purify-arith.ts +632 -0
  380. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  381. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  382. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  383. package/src/prover/smt/solver/qe-lite.ts +37 -17
  384. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  385. package/src/prover/smt/solver/qe.ts +1499 -0
  386. package/src/prover/smt/solver/qel.ts +25 -0
  387. package/src/prover/smt/solver/qi-queue.ts +0 -1
  388. package/src/prover/smt/solver/qsat.ts +814 -0
  389. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  390. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  391. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  392. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  393. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  394. package/src/prover/smt/solver/random-gen.ts +0 -1
  395. package/src/prover/smt/solver/rational.ts +45 -1
  396. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  397. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  398. package/src/prover/smt/solver/reduce-args.ts +225 -0
  399. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  400. package/src/prover/smt/solver/ref-vector.ts +0 -1
  401. package/src/prover/smt/solver/relevancy.ts +1 -2
  402. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  403. package/src/prover/smt/solver/rewriter.ts +475 -36
  404. package/src/prover/smt/solver/rlimit.ts +38 -2
  405. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  406. package/src/prover/smt/solver/sat/big.ts +177 -0
  407. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  408. package/src/prover/smt/solver/sat/clause.ts +203 -0
  409. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  410. package/src/prover/smt/solver/sat/config.ts +122 -0
  411. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  412. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  413. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  414. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  415. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  416. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  417. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  418. package/src/prover/smt/solver/sat/probing.ts +170 -0
  419. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  420. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  421. package/src/prover/smt/solver/sat/scc.ts +142 -0
  422. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  423. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  424. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  425. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  426. package/src/prover/smt/solver/search-tree.ts +284 -0
  427. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  428. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  429. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  430. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  431. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  432. package/src/prover/smt/solver/seq-factory.ts +89 -0
  433. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  434. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  435. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  436. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  437. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  438. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  439. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  440. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  441. package/src/prover/smt/solver/seq-subset.ts +165 -0
  442. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  443. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  444. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  445. package/src/prover/smt/solver/smt-logics.ts +66 -0
  446. package/src/prover/smt/solver/smt-setup.ts +496 -0
  447. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  448. package/src/prover/smt/solver/smtlib-parser.ts +3154 -326
  449. package/src/prover/smt/solver/smtlib-script.ts +1702 -0
  450. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  451. package/src/prover/smt/solver/solver.ts +113 -22
  452. package/src/prover/smt/solver/static-features.ts +314 -0
  453. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  454. package/src/prover/smt/solver/tactic.ts +1995 -0
  455. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  456. package/src/prover/smt/solver/theory-array.ts +1240 -0
  457. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  458. package/src/prover/smt/solver/theory-char.ts +355 -0
  459. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  460. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  461. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  462. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  463. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  464. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  465. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  466. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  467. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  468. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  469. package/src/prover/smt/solver/theory-lra.ts +188 -2
  470. package/src/prover/smt/solver/theory-pb.ts +933 -0
  471. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  472. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  473. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  474. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  475. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  476. package/src/prover/smt/solver/theory-seq.ts +961 -0
  477. package/src/prover/smt/solver/theory.ts +189 -0
  478. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  479. package/src/prover/smt/solver/var-subst.ts +36 -14
  480. package/src/prover/smt/table.ts +3 -2
  481. package/src/prover/smt/types.ts +146 -0
  482. package/src/prover/tlapm/cache.ts +29 -8
  483. package/src/prover/tlapm-library.ts +3208 -0
  484. package/src/prover/verdict.ts +2 -0
  485. package/src/prover/zenon/decide.ts +10 -7
  486. package/src/prover/zenon/encode.ts +0 -2
  487. package/src/prover/zenon/eqrel.ts +0 -2
  488. package/src/prover/zenon/equality-rules.ts +24 -2
  489. package/src/prover/zenon/expr.ts +21 -2
  490. package/src/prover/zenon/index-table.ts +7 -4
  491. package/src/prover/zenon/isar-case.ts +1 -3
  492. package/src/prover/zenon/isar.ts +2 -4
  493. package/src/prover/zenon/llproof.ts +0 -2
  494. package/src/prover/zenon/mltoll.ts +0 -2
  495. package/src/prover/zenon/node.ts +20 -5
  496. package/src/prover/zenon/parse.ts +6 -2
  497. package/src/prover/zenon/phrase.ts +1 -3
  498. package/src/prover/zenon/proof.ts +0 -2
  499. package/src/prover/zenon/propositional-rules.ts +0 -2
  500. package/src/prover/zenon/rules.ts +2 -3
  501. package/src/prover/zenon/search.ts +7 -5
  502. package/src/prover/zenon/tla/functions.ts +0 -2
  503. package/src/prover/zenon/tla/llproof.ts +0 -2
  504. package/src/prover/zenon/tla/records.ts +0 -2
  505. package/src/prover/zenon/tla/rewrites.ts +0 -2
  506. package/src/prover/zenon/tla/sets.ts +7 -8
  507. package/src/prover/zenon/tla/terms.ts +0 -2
  508. package/src/prover/zenon/tla/tla.ts +0 -2
  509. package/src/resolve.ts +72 -36
  510. package/src/runtime.ts +6 -0
  511. package/src/sany/generation.ts +1 -13
  512. package/src/sany/generator-definitions.ts +1 -1
  513. package/src/sany/generator-expressions.ts +9 -17
  514. package/src/sany/generator-proofs.ts +1 -1
  515. package/src/sany/generator.ts +1 -1
  516. package/src/sany/levels.ts +0 -2
  517. package/src/sany/linter.ts +0 -2
  518. package/src/search.ts +198 -45
  519. package/src/simulate.ts +3 -0
  520. package/src/standard-definitions.ts +4 -0
  521. package/src/state-graph.ts +0 -2
  522. package/src/subexpressions.ts +4 -2
  523. package/src/successors.ts +1 -1
  524. package/src/symmetry.ts +2 -2
  525. package/src/tableau.ts +2 -2
  526. package/src/tlc/fingerprint.ts +81 -9
  527. package/src/tlc/jar-data.ts +12 -0
  528. package/src/tlc/order.ts +14 -3
  529. package/src/tlc/summary.ts +29 -14
  530. package/src/tlc/tlcext-operators.ts +61 -16
  531. package/src/tlc/trace-spec.ts +2 -3
  532. package/src/typed-tier.ts +6541 -0
  533. package/src/typescript/types.ts +2 -2
  534. package/src/values.ts +1 -1
  535. package/src/prover/isabelle/isar/statement.ts +0 -52
  536. package/src/prover/smt/solver/z3-license.txt +0 -10
  537. package/src/prover/tlaps-module.ts +0 -510
  538. package/src/prover/zenon/LICENSE +0 -32
package/dist/transfer.js CHANGED
@@ -6,20 +6,20 @@
6
6
  * This source code is licensed under the MIT license found in the
7
7
  * LICENSE file in the root directory of this source tree.
8
8
  */
9
- import{B as e,C as t,G as n,J as r,K as i,L as a,M as o,N as s,O as c,P as l,Q as u,R as d,S as f,U as p,W as m,X as h,Y as g,Z as _,_ as v,b as y,et as ee,g as b,h as x,it as S,q as C,tt as w,u as te,v as ne,x as re,y as ie,z as ae}from"./worker.js";import{gzipSync as oe}from"node:zlib";const se=/* @__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(`.`)),ce=/* @__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`]]),le=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),T=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),E=/* @__PURE__ */ new Map([[`∃`,`\\E`],[`∀`,`\\A`],[`∷`,`::`],[`≜`,`==`],[`⟨`,`<<`],[`⟩_`,`>>_`],[`⟩`,`>>`],[`→`,`->`],[`←`,`<-`],[`↦`,`|->`],[`⁺`,`^+`],[`¬`,`~`],[`□`,`[]`],[`◇`,`<>`],[`∧`,`/\\`],[`∨`,`\\/`],[`∈`,`\\in`],[`≈`,`\\approx`],[`≔`,`:=`],[`≍`,`\\asymp`],[`◯`,`\\bigcirc`],[`⩴`,`::=`],[`●`,`\\bullet`],[`∩`,`\\cap`],[`⋅`,`\\cdot`],[`∘`,`\\o`],[`≅`,`\\cong`],[`∪`,`\\cup`],[`÷`,`\\div`],[`≐`,`\\doteq`],[`‥`,`..`],[`…`,`...`],[`≡`,`<=>`],[`‼`,`!!`],[`≥`,`>=`],[`≫`,`\\gg`],[`⇔`,`<=>`],[`⇒`,`=>`],[`⫤`,`=|`],[`↝`,`~>`],[`≤`,`<=`],[`≪`,`\\ll`],[`⊣`,`-|`],[`≠`,`#`],[`∉`,`\\notin`],[`⊙`,`\\odot`],[`⊖`,`\\ominus`],[`⊕`,`\\oplus`],[`⊘`,`\\oslash`],[`⊗`,`\\otimes`],[`⇸`,`-+->`],[`≺`,`\\prec`],[`⪯`,`\\preceq`],[`∝`,`\\propto`],[`⁇`,`??`],[`⊨`,`|=`],[`⊢`,`|-`],[`∼`,`\\sim`],[`≃`,`\\simeq`],[`⊓`,`\\sqcap`],[`⊔`,`\\sqcup`],[`⊏`,`\\sqsubset`],[`⊑`,`\\sqsubseteq`],[`⊐`,`\\sqsupset`],[`⊒`,`\\sqsupseteq`],[`⋆`,`\\star`],[`⊂`,`\\subset`],[`⊆`,`\\subseteq`],[`≻`,`\\succ`],[`⪰`,`\\succeq`],[`⊃`,`\\supset`],[`⊇`,`\\supseteq`],[`×`,`\\X`],[`⊎`,`\\uplus`],[`‖`,`||`],[`≀`,`\\wr`]]),D=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),ue=e=>e.startsWith(`\\`)?parseInt(e.slice(2),D.get(e[1].toLowerCase())):Number(e),O=/-{4,} *MODULE\b/,de=/* @__PURE__ */ new Uint8Array(128);(/* @__PURE__ */ new Map([[`0123456789`,33],[`abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ`,2],[`_`,4],[`01`,8],[`01234567`,16],[`abcdefABCDEF`,32]])).forEach((e,t)=>{for(let n of t)de[n.charCodeAt(0)]|=e});const fe=(e,t)=>e<128&&(de[e]&t)!==0,pe=(e,t,n)=>{let r=t;for(;fe(e.charCodeAt(r),n);)r++;return r},me=/* @__PURE__ */ new Map;T.forEach(e=>{let t=e.charCodeAt(0),n=me.get(t)??[];n.push(e),me.set(t,n)});const he=(e,t)=>{let n=me.get(e.charCodeAt(t));if(n!==void 0){for(let r=0;r<n.length;r++)if(e.startsWith(n[r],t))return n[r]}},ge=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(E.has(n))return n;let r=e[t];return E.has(r)?r:void 0},_e=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&fe(e.charCodeAt(t+1),2)){let n=e.slice(t+1,pe(e,t+1,2)),r=n.length;for(;r>0&&!ce.has(n.slice(0,r));)r--;let i=ce.get(n.slice(0,r));return{text:i??`\\`,length:i===void 0?1:r+1}}let r=ge(e,t);if(r!==void 0)return{text:E.get(r)??``,length:r.length};let i=he(e,t);return i?{text:le.get(i)??i,length:i.length}:n===92?{text:`\\`,length:1}:void 0},k=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),ve=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>E.has(e)||k.has(e));return n===void 0?void 0:{text:n,length:n.length}},ye=(e,t,n)=>{let r=t;for(;r<e.length&&n(e[r]);)r++;return r},be=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:pe(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?pe(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return ye(e,s?o+1:o,e=>e===`.`)-t},xe=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,Se={n:`
10
- `,t:` `,r:`\r`,f:`\f`},Ce=(e,t)=>t===9?e+8-e%8:e+1,we=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),Te=(e,t)=>{if(e.charCodeAt(t)!==92)return 0;let n=we.get(e.charAt(t+1).toLowerCase());if(n===void 0)return 0;let r=pe(e,t+2,n);return r===t+2?0:r-t},Ee=(e,t=!1)=>{let n=O.exec(e);if(!n)throw new l(`Expected a module header such as ---- MODULE Name ----`);let r=[],i=/* @__PURE__ */ new Map,a=e.slice(0,n.index).split(`
11
- `),o=n.index,s=a.length,c=n.index-a[a.length-1].length,u=0,d=-1,f=0,p=0,m=()=>{for((d!==c||f>o)&&(d=c,f=c,p=0);f<o;f++)p=Ce(p,e.charCodeAt(f));return Ce(p,e.charCodeAt(o))},h=(e,t,n,i)=>{let a=m();r.push({kind:e,text:t,spelling:i,line:s,column:a,endColumn:a+n-1}),o+=n},g=t=>{for(let n=0;n<t;n++)e.charCodeAt(o)===10&&(s++,c=o+1),o++},_=t=>new l(`${t} at line ${s}, column ${m()}`,void 0,{reason:t,line:s,column:m(),isEnd:o>=e.length});for(;o<e.length;){let n=e.charCodeAt(o);if(n===10||n===32||n===9||n===13){g(1);continue}if(n===92&&e.charCodeAt(o+1)===42){g(ye(e,o,e=>e!==`
12
- `&&e!==`\r`)-o);continue}if(n===40&&e.charCodeAt(o+1)===42){let t=0;do{if(o>=e.length)throw _(`Unterminated comment`);e.startsWith(`(*`,o)?(t++,g(2)):e.startsWith(`*)`,o)?(t--,g(2)):g(1)}while(t>0);continue}if(n===45&&e.startsWith(`----`,o)){let t=ye(e,o,e=>e===`-`)-o,n=ye(e,o+t,e=>e===` `);e.startsWith(`MODULE`,n)&&u++,h(`Separator`,`----`,t);continue}if(n===61&&e.startsWith(`====`,o)){if(h(`ModuleEnd`,`====`,ye(e,o,e=>e===`=`)-o),u--,u<=0)break;continue}if(n===34){let t=s,n=m(),i=[];for(g(1);e.charCodeAt(o)!==34;){let t=e.charCodeAt(o);if(o>=e.length||t===10||t===13)throw _(`Unterminated string`);if(t===92){let t=e[o+1];if(t===void 0||!`ntrf\\"`.includes(t))throw _(`Invalid escape in string`);i.push(Se[t]??t),g(2)}else i.push(e[o]),g(1)}g(1),r.push({kind:`String`,text:i.join(``),line:t,column:n,endColumn:m()-1});continue}let a=Te(e,o);if(a>0){h(`Number`,e.slice(o,o+a),a);continue}if(fe(n,7)){let t=pe(e,o,7),r=e.slice(o,t),a=pe(e,o,1);if(a===t){let n=e.charCodeAt(t)===46?pe(e,t+1,1):t,i=n>t+1,a=i?e.slice(o,n):r;h(i?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(r)){let t=n===95?`_`:e.slice(o,a);h(t===`_`?`Operator`:`Number`,t,t.length);continue}if(r.startsWith(`WF_`)||r.startsWith(`SF_`)){h(`Keyword`,r.slice(0,3),3);continue}let s=i.get(r)??r;i.set(s,s),h(se.has(r)?`Keyword`:`Identifier`,s,r.length);continue}let c=e[o];if(n>=128&&k.has(c)){h(`Identifier`,i.get(c)??c,1),i.set(c,c);continue}if(n===60){let n=be(e,o,t);if(n>0){h(`Step`,e.slice(o,o+n),n);continue}}let l=_e(e,o);if(l){let t=e.slice(o,o+l.length);h(`Operator`,l.text,l.length,t===l.text?void 0:t)}else throw _(`Unexpected character ${JSON.stringify(c)}`)}let v=m();return r.push({kind:`End`,text:``,line:s,column:v,endColumn:v}),r},De=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],Oe=De.map(e=>e[0]),ke=new Map(Oe.map((e,t)=>[e,t]).reverse()),A=e=>{let t=ke.get(e);if(t===void 0)throw new ie(`Unknown SANY token kind ${e}`);return t},Ae=new Map(De.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),je=Math.max(...[...Ae.keys()].map(e=>e.length)),Me=Array.from({length:je},(e,t)=>je-t),Ne=/----+ *MODULE/y,Pe=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],Fe=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),Ie=Fe(String.raw`\.\/\\`),Le=Fe(String.raw`\.\\\/`),Re=String.raw`<(?:[0-9]+|\+|\*)>`,ze=[[`_BM0`,[Ne]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,Ie],[`BOR`,Le],[`IDENTIFIER`,Pe],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Re}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Re,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Re}(?:\*\.*|-\.*|\.+)`,`y`)]]],Be=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[Ne]]],j=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[Ne]],[`BAND`,Ie],[`BOR`,Le],[`IDENTIFIER`,Pe]],Ve=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),He=(e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,Ue=(e,t,n)=>e.map(([e,r])=>({kind:A(e),length:Math.max(...r.map(e=>Ve(e,t,n)))})).reduce(He,{kind:-1,length:0}),We=(e,t)=>{let n=Me.find(n=>Ae.has(e.slice(t,t+n))),r=Ue(ze,e,t);return n===void 0?r:He(r,{kind:Ae.get(e.slice(t,t+n))??-1,length:n})},Ge=e=>e+8-e%8,Ke=e=>{let t=[],n=[],r=1,i=0,a=!1,o=!1;for(let s of e)for(let e=0;e<s.length;e++)i++,o?(o=!1,r++,i=1):a&&(a=!1,s===`
9
+ import{$ as e,B as t,C as n,F as r,G as i,J as a,K as o,N as s,P as c,Q as l,R as u,S as d,V as f,W as p,X as m,Y as h,Z as g,_,at as v,b as y,g as b,h as ee,k as x,nt as S,q as te,tt as C,u as w,v as ne,x as T,y as E,z as re}from"./worker.js";import{gzipSync as ie}from"node:zlib";const ae=/* @__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(`.`)),oe=/* @__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`]]),se=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),ce=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),le=/* @__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`]]),ue=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),de=e=>e.startsWith(`\\`)?parseInt(e.slice(2),ue.get(e[1].toLowerCase())):Number(e),fe=/-{4,} *MODULE\b/,pe=/* @__PURE__ */ new Uint8Array(128);(/* @__PURE__ */ new Map([[`0123456789`,33],[`abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ`,2],[`_`,4],[`01`,8],[`01234567`,16],[`abcdefABCDEF`,32]])).forEach((e,t)=>{for(let n of t)pe[n.charCodeAt(0)]|=e});const D=(e,t)=>e<128&&(pe[e]&t)!==0,O=(e,t,n)=>{let r=t;for(;D(e.charCodeAt(r),n);)r++;return r},k=/* @__PURE__ */ new Map;ce.forEach(e=>{let t=e.charCodeAt(0),n=k.get(t)??[];n.push(e),k.set(t,n)});const A=(e,t)=>{let n=k.get(e.charCodeAt(t));if(n!==void 0){for(let r=0;r<n.length;r++)if(e.startsWith(n[r],t))return n[r]}},me=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(le.has(n))return n;let r=e[t];return le.has(r)?r:void 0},he=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&D(e.charCodeAt(t+1),2)){let n=e.slice(t+1,O(e,t+1,2)),r=n.length;for(;r>0&&!oe.has(n.slice(0,r));)r--;let i=oe.get(n.slice(0,r));return{text:i??`\\`,length:i===void 0?1:r+1}}let r=me(e,t);if(r!==void 0)return{text:le.get(r)??``,length:r.length};let i=A(e,t);return i?{text:se.get(i)??i,length:i.length}:n===92?{text:`\\`,length:1}:void 0},ge=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),_e=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>le.has(e)||ge.has(e));return n===void 0?void 0:{text:n,length:n.length}},ve=(e,t,n)=>{let r=t;for(;r<e.length&&n(e[r]);)r++;return r},ye=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:O(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?O(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return ve(e,s?o+1:o,e=>e===`.`)-t},be=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,xe={n:`
10
+ `,t:` `,r:`\r`,f:`\f`},Se=(e,t)=>t===9?e+8-e%8:e+1,Ce=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),we=(e,t,n=!1)=>{if(e.charCodeAt(t)!==92)return 0;let r=e.charAt(t+1),i=Ce.get(n?r:r.toLowerCase());if(i===void 0)return 0;let a=O(e,t+2,i);return a===t+2?0:a-t},Te=(e,t=!1)=>{let n=fe.exec(e);if(!n)throw new r(`Expected a module header such as ---- MODULE Name ----`);let i=[],a=/* @__PURE__ */ new Map,o=e.slice(0,n.index).split(`
11
+ `),s=n.index,c=o.length,l=n.index-o[o.length-1].length,u=0,d=-1,f=0,p=0,m=()=>{for((d!==l||f>s)&&(d=l,f=l,p=0);f<s;f++)p=Se(p,e.charCodeAt(f));return Se(p,e.charCodeAt(s))},h=(e,t,n,r)=>{let a=m();i.push({kind:e,text:t,spelling:r,line:c,column:a,endColumn:a+n-1}),s+=n},g=t=>{for(let n=0;n<t;n++)e.charCodeAt(s)===10&&(c++,l=s+1),s++},_=t=>new r(`${t} at line ${c}, column ${m()}`,void 0,{reason:t,line:c,column:m(),isEnd:s>=e.length});for(;s<e.length;){let n=e.charCodeAt(s);if(n===10||n===32||n===9||n===13){g(1);continue}if(n===92&&e.charCodeAt(s+1)===42){g(ve(e,s,e=>e!==`
12
+ `&&e!==`\r`)-s);continue}if(n===40&&e.charCodeAt(s+1)===42){let t=0;do{if(s>=e.length)throw _(`Unterminated comment`);e.startsWith(`(*`,s)?(t++,g(2)):e.startsWith(`*)`,s)?(t--,g(2)):g(1)}while(t>0);continue}if(n===45&&e.startsWith(`----`,s)){let t=ve(e,s,e=>e===`-`)-s,n=ve(e,s+t,e=>e===` `);e.startsWith(`MODULE`,n)&&u++,h(`Separator`,`----`,t);continue}if(n===61&&e.startsWith(`====`,s)){if(h(`ModuleEnd`,`====`,ve(e,s,e=>e===`=`)-s),u--,u<=0)break;continue}if(n===34){let t=c,n=m(),r=[];for(g(1);e.charCodeAt(s)!==34;){let t=e.charCodeAt(s);if(s>=e.length||t===10||t===13)throw _(`Unterminated string`);if(t===92){let t=e[s+1];if(t===void 0||!`ntrf\\"`.includes(t))throw _(`Invalid escape in string`);r.push(xe[t]??t),g(2)}else r.push(e[s]),g(1)}g(1),i.push({kind:`String`,text:r.join(``),line:t,column:n,endColumn:m()-1});continue}let r=we(e,s,t);if(r>0){h(`Number`,e.slice(s,s+r),r);continue}if(D(n,7)){let t=O(e,s,7),r=e.slice(s,t),i=O(e,s,1);if(i===t){let n=e.charCodeAt(t)===46?O(e,t+1,1):t,i=n>t+1,a=i?e.slice(s,n):r;h(i?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(r)){let t=n===95?`_`:e.slice(s,i);h(t===`_`?`Operator`:`Number`,t,t.length);continue}if(r.startsWith(`WF_`)||r.startsWith(`SF_`)){h(`Keyword`,r.slice(0,3),3);continue}let o=a.get(r)??r;a.set(o,o),h(ae.has(r)?`Keyword`:`Identifier`,o,r.length);continue}let o=e[s];if(n>=128&&ge.has(o)){h(`Identifier`,a.get(o)??o,1),a.set(o,o);continue}if(n===60){let n=ye(e,s,t);if(n>0){h(`Step`,e.slice(s,s+n),n);continue}}let l=he(e,s);if(l){let t=e.slice(s,s+l.length);h(`Operator`,l.text,l.length,t===l.text?void 0:t)}else throw _(`Unexpected character ${JSON.stringify(o)}`)}let v=m();return i.push({kind:`End`,text:``,line:c,column:v,endColumn:v}),i},Ee=[[`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`]],De=Ee.map(e=>e[0]),Oe=new Map(De.map((e,t)=>[e,t]).reverse()),j=e=>{let t=Oe.get(e);if(t===void 0)throw new E(`Unknown SANY token kind ${e}`);return t},ke=new Map(Ee.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),Ae=Math.max(...[...ke.keys()].map(e=>e.length)),je=Array.from({length:Ae},(e,t)=>Ae-t),Me=/----+ *MODULE/y,Ne=[/_\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],Pe=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`)),Fe=Pe(String.raw`\.\/\\`),Ie=Pe(String.raw`\.\\\/`),Le=String.raw`<(?:[0-9]+|\+|\*)>`,Re=[[`_BM0`,[Me]],[`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`,Fe],[`BOR`,Ie],[`IDENTIFIER`,Ne],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Le}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Le,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Le}(?:\*\.*|-\.*|\.+)`,`y`)]]],ze=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[Me]]],Be=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[Me]],[`BAND`,Fe],[`BOR`,Ie],[`IDENTIFIER`,Ne]],Ve=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),He=(e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,Ue=(e,t,n)=>e.map(([e,r])=>({kind:j(e),length:Math.max(...r.map(e=>Ve(e,t,n)))})).reduce(He,{kind:-1,length:0}),We=(e,t)=>{let n=je.find(n=>ke.has(e.slice(t,t+n))),r=Ue(Re,e,t);return n===void 0?r:He(r,{kind:ke.get(e.slice(t,t+n))??-1,length:n})},Ge=e=>e+8-e%8,Ke=e=>{let t=[],n=[],r=1,i=0,a=!1,o=!1;for(let s of e)for(let e=0;e<s.length;e++)i++,o?(o=!1,r++,i=1):a&&(a=!1,s===`
13
13
  `?o=!0:(r++,i=1)),s===`\r`?a=!0:s===`
14
- `?o=!0:s===` `&&(i=Ge(i-1)),t.push(r),n.push(i);return{lines:t,columns:n}},qe=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Je=new Set([...Ae.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Ye=(e,t)=>{let n=0;for(;Je.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,Ve(qe,e,t)))},Xe=e=>{let t=Ke(e),n=0,r=`DEFAULT`,i=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),a=()=>i(A(`EOF`),e.length-1,0),o=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?$e(o,s,e[a],i):t.lines[n]===o?e[a]===`
15
- `||e[a]===`\r`?$e(o+1,0,void 0,i):$e(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},s=()=>{let t=n;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return o(t,e.length,``);n+=r+1;return}let r=0,i=t,a=t;for(;a<e.length;)if(e.startsWith(`(*`,a))r++,a+=2,r>1&&(i=a);else if(e.startsWith(`*)`,a)){if(r--,a+=2,i=a,r===0){n=a;return}}else a++;return n=a,i===e.length?void 0:o(i,a,``)},c=t=>{for(;n<e.length;){let a=Ue(t,e,n);if(a.length>0){let e=i(a.kind,n,a.length);return n+=a.length,Oe[a.kind].startsWith(`_BM`)&&(r=`SPEC`),Oe[a.kind]===`BEGIN_PRAGMA`&&(r=`PRAGMA`),e}n++}return a()};return()=>{if(r===`DEFAULT`)return c(Be);if(r===`PRAGMA`)return c(j);for(;n<e.length;){let t=n;if(`
14
+ `?o=!0:s===` `&&(i=Ge(i-1)),t.push(r),n.push(i);return{lines:t,columns:n}},qe=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Je=new Set([...ke.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Ye=(e,t)=>{let n=0;for(;Je.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,Ve(qe,e,t)))},Xe=e=>{let t=Ke(e),n=0,r=`DEFAULT`,i=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),a=()=>i(j(`EOF`),e.length-1,0),o=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?$e(o,s,e[a],i):t.lines[n]===o?e[a]===`
15
+ `||e[a]===`\r`?$e(o+1,0,void 0,i):$e(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},s=()=>{let t=n;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return o(t,e.length,``);n+=r+1;return}let r=0,i=t,a=t;for(;a<e.length;)if(e.startsWith(`(*`,a))r++,a+=2,r>1&&(i=a);else if(e.startsWith(`*)`,a)){if(r--,a+=2,i=a,r===0){n=a;return}}else a++;return n=a,i===e.length?void 0:o(i,a,``)},c=t=>{for(;n<e.length;){let a=Ue(t,e,n);if(a.length>0){let e=i(a.kind,n,a.length);return n+=a.length,De[a.kind].startsWith(`_BM`)&&(r=`SPEC`),De[a.kind]===`BEGIN_PRAGMA`&&(r=`PRAGMA`),e}n++}return a()};return()=>{if(r===`DEFAULT`)return c(ze);if(r===`PRAGMA`)return c(Be);for(;n<e.length;){let t=n;if(`
16
16
  \r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=s();if(e!==void 0)return e}else{let r=We(e,t);if(r.length===0){let n=Ye(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),a=r<e.length?n:i.length>1?i:``;return o(t,r,a)}let a=i(r.kind,t,r.length);return n+=r.length,a}}return a()}},Ze=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
17
- `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Qe=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Ze.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),$e=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Qe(n)}" (${n.charCodeAt(0)}), `}after : "${Qe(r)}"`,et=e=>{let t=Xe(e);for(let e=t();typeof e!=`string`&&e.kind!==A(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?Ge(e):e+1,e.beginColumn);return $e(e.beginLine,n,e.image[t],e.image.slice(0,t))}},tt=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],nt=/* @__PURE__ */ new Set([...tt,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),rt=[`TYPE`,`TYPE_CONSTRAINT`],it=/* @__PURE__ */ new Set([...tt,...rt]),at=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],ot=e=>{let t=0,n=0;do{if(t>=e.length)return;let r=e.slice(t,t+2),i=r===`(*`?1:r===`*)`?-1:0;n+=i,t+=i===0?1:2}while(n>0);return t},st=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:$e(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:$e(r+1,0,void 0,e),line:r})},s=e=>{let t=e.split(`
17
+ `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Qe=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Ze.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),$e=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Qe(n)}" (${n.charCodeAt(0)}), `}after : "${Qe(r)}"`,et=e=>{let t=Xe(e);for(let e=t();typeof e!=`string`&&e.kind!==j(`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===` `?Ge(e):e+1,e.beginColumn);return $e(e.beginLine,n,e.image[t],e.image.slice(0,t))}},tt=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],nt=/* @__PURE__ */ new Set([...tt,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),rt=[`TYPE`,`TYPE_CONSTRAINT`],it=/* @__PURE__ */ new Set([...tt,...rt]),at=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],ot=e=>{let t=0,n=0;do{if(t>=e.length)return;let r=e.slice(t,t+2),i=r===`(*`?1:r===`*)`?-1:0;n+=i,t+=i===0?1:2}while(n>0);return t},st=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:$e(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:$e(r+1,0,void 0,e),line:r})},s=e=>{let t=e.split(`
18
18
  `);t.length>1&&(r+=t.length-1,i=n+e.length-t[t.length-1].length),n+=e.length};for(;n<e.length;){let i=e.slice(n),c=/^\s+/.exec(i)?.[0];if(c){s(c);continue}if(i.startsWith(`\\*`)){let e=i.indexOf(`
19
- `);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=ot(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=Te(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=ve(e,n)??_e(e,n),m=at.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},ct=(e,t)=>new v(`TLC found an error in the configuration file at line ${e}\n${t}`),lt=(e,t)=>ct(e,`The keyword ${t} appeared twice.`),ut=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),dt=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),ft=(e,t=`master`)=>{let n=t===`1.7.4`?it:nt,r=st(e),i=0,a={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},o=!1,s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i++,r.length-1)];if(e.kind===`Error`)throw new v(`TLC found an error in the configuration file:\n${e.text}`);return e},l=e=>{if(e.kind===`Number`&&e.text.startsWith(`\\`))throw S(new v(`${u(`java.lang.NumberFormatException`)}For input string: "${e.text}"`),w.error);if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`&&e.text.includes(`\\`))throw new v(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${e.line}`);if(e.kind===`String`)return{kind:`String`,value:e.text.slice(1,-1)};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t=c();if(t.text!==`}`)for(;e.push(l(t)),t=c(),t.text===`,`;)t=c();if(t.text!==`}`)throw ct(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw ct(e.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=c();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw ct(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=c();for(;r.text===`!`;)n=`${n}!${c().text}`,r=c();if(r.text===`<-`){if(r=c(),r.text===`[`){let e=d(`<-`),t=c();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw ct(r.line,`Expected an identifier after <-.`);a.substitutions.push({name:n,target:r.text});return}let i=[],o=r.text===`(`;if(o){for(;i.push(l(c())),r=c(),r.text===`,`;);if(r.text!==`)`)throw ct(t,``);r=c()}if(r.text!==`=`)throw ct(r.line,`It was expecting = or <-, but did not find it.`);r=c();let s=r.text===`[`?d(`=`):void 0,u=l(s===void 0?r:c());a.constants.push({name:n,value:u,...o&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let o=i-1;f(t,e),a.rawConstants.push(r.slice(o,i).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},h=c();for(;h.kind!==`End`;){let e=h.text,t=h.line,r=n.has(e)?ut.get(e):void 0,i=n.has(e)?dt.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw ct(t,`The keyword ${e} was not followed by an identifier.`);return n};if(r!==void 0){let n=l();if(a[r]!==void 0)throw lt(t,e);a[r]=n.text,h=c()}else if(i!==void 0)h=m(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw ct(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o)throw lt(t,e);o=!0,a.checkDeadlock=n.text===`TRUE`,h=c()}else{if(!n.has(e)||!rt.includes(e))throw ct(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw lt(t,e);s.add(e),h=c()}}return a},pt=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],mt=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(pt),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},ht=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},M=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,gt=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},_t={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},vt=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},yt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),bt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),xt=e=>{let t=t=>{let n=ye(e,t,vt);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=ye(e,t,yt);if(e.startsWith(`..`,n)&&yt(e[n+2]))return{kind:`Constant`,first:t,last:ye(e,n+2,yt)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=yt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:ye(e,t+1,yt)-1,children:[]};if(bt(n))return{kind:`Constant`,first:t,last:ye(e,t,bt)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},N=e=>{let t=e.length===0?void 0:xt(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=_t[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},St={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},Ct={none:0,error:1,warning:3,state:4},wt={0:``,1:`Error: `,3:`Warning: `,4:`State `},Tt=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${wt[n]}${r}`,Et=t=>{let n=/* @__PURE__ */ new Set;return{isTool:t.isTool,isDiffTrace:t.isDiffTrace??!1,version:t.version??`master`,print:(r,i,a)=>{let o=i===Ct.warning;if(o&&t.errorCodes?.includes(r))throw new e(r,a);if(o&&t.isWarningEnabled===!1||i!==Ct.error&&t.suppressedCodes?.includes(r))return;let s=o&&!t.isTool&&n.size===0?`
20
- (Use the -nowarning option to disable this warning.)`:``,c=Tt(t.isTool,r,i,`${a}${s}`);o&&n.has(c)||(o&&n.add(c),console.log(c))}}},Dt=`The configuration file did not specify the initial state predicate.
19
+ `);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=ot(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=we(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=_e(e,n)??he(e,n),m=at.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},ct=(e,t)=>new _(`TLC found an error in the configuration file at line ${e}\n${t}`),lt=(e,t)=>ct(e,`The keyword ${t} appeared twice.`),M=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),ut=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),dt=(t,n=`master`)=>{let r=n===`1.7.4`?it:nt,i=st(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let e=i[Math.min(a++,i.length-1)];if(e.kind===`Error`)throw new _(`TLC found an error in the configuration file:\n${e.text}`);return e},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw v(new _(`${e(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),S.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new _(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw ct(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(t.kind!==`End`)return{kind:`ModelValue`,name:t.text};throw ct(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw ct(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=l();for(;r.text===`!`;)n=`${n}!${l().text}`,r=l();if(r.text===`<-`){if(r=l(),r.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw ct(r.line,`Expected an identifier after <-.`);o.substitutions.push({name:n,target:r.text});return}let i=[],a=r.text===`(`;if(a){for(;i.push(u(l())),r=l(),r.text===`,`;);if(r.text!==`)`)throw ct(t,``);r=l()}if(r.text!==`=`)throw ct(r.line,`It was expecting = or <-, but did not find it.`);r=l();let s=r.text===`[`?d(`=`):void 0,c=u(s===void 0?r:l());o.constants.push({name:n,value:c,...a&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n=a-1;f(t,e),o.rawConstants.push(i.slice(n,a).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},h=l();for(;h.kind!==`End`;){let e=h.text,t=h.line,n=r.has(e)?M.get(e):void 0,i=r.has(e)?ut.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw ct(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw lt(t,e);o[n]=r.text,h=l()}else if(i!==void 0)h=m(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw ct(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw lt(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!rt.includes(e))throw ct(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw lt(t,e);c.add(e),h=l()}}return o},ft=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],pt=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(ft),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:[])}},mt=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},N=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,ht=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},gt={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:` `}},_t=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},vt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),yt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),bt=e=>{let t=t=>{let n=ve(e,t,_t);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=ve(e,t,vt);if(e.startsWith(`..`,n)&&vt(e[n+2]))return{kind:`Constant`,first:t,last:ve(e,n+2,vt)-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=vt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:ve(e,t+1,vt)-1,children:[]};if(yt(n))return{kind:`Constant`,first:t,last:ve(e,t,yt)-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)},P=e=>{let t=e.length===0?void 0:bt(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=gt[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},xt={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},St={none:0,error:1,warning:3,state:4},Ct={0:``,1:`Error: `,3:`Warning: `,4:`State `},wt=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${Ct[n]}${r}`,Tt=e=>{let t=/* @__PURE__ */ new Set;return{isTool:e.isTool,isDiffTrace:e.isDiffTrace??!1,version:e.version??`master`,print:(n,r,i)=>{let a=r===St.warning;if(a&&e.errorCodes?.includes(n))throw new f(n,i);if(a&&e.isWarningEnabled===!1||r!==St.error&&e.suppressedCodes?.includes(n))return;let o=a&&!e.isTool&&t.size===0?`
20
+ (Use the -nowarning option to disable this warning.)`:``,s=wt(e.isTool,n,r,`${i}${o}`);a&&t.has(s)||(a&&t.add(s),console.log(s))}}},Et=`The configuration file did not specify the initial state predicate.
21
21
  Can also be caused by trying to run TLC on a specification from
22
- a module imported with a parameterized INSTANCE statement.`,Ot=[[1005,te,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
22
+ a module imported with a parameterized INSTANCE statement.`,Dt=[[1005,w,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
23
23
  %1%`,!0],[2143,`The variable %1% was changed while it is specified as UNCHANGED at
24
24
  %2%`,!1],[2144,`The EXCEPT was applied to non-existing fields of the value at
25
25
  %1%`,!1],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
@@ -32,7 +32,7 @@ but it produced the following error:
32
32
  is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
33
33
  the following value:
34
34
  %1%`,!0],[2156,`TLC supports at most %1% model values, but model value %2% exceeds this limit.`,!1],[2156,`tla-ts can't recover a model check from the checkpoint in %1%.`,!1],[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:
35
- %4%`,!0],[2170,`Argument mismatch in operator application.%1%`,!1],[2171,`Parsing or semantic analysis failed.%1%`,!1],[2172,x,!1],[2176,`Applying %1% to the following value,
35
+ %4%`,!0],[2170,`Argument mismatch in operator application.%1%`,!1],[2171,`Parsing or semantic analysis failed.%1%`,!1],[2172,ee,!1],[2176,`Applying %1% to the following value,
36
36
  which is not %2%:
37
37
  %3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
38
38
  element is not a bag:
@@ -44,7 +44,7 @@ element is not a bag:
44
44
  %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
45
45
  on the right-hand side of a <- after already appearing on the
46
46
  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
47
- 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,Dt,!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],[2236,`The operator %1%, which equals %2%,
47
+ 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,Et,!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],[2236,`The operator %1%, which equals %2%,
48
48
  cannot be used as a %3%`,!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:
49
49
  %1%`,!1],[2240,`The specification contains more than one conjunct of the form [][Next]_v,
50
50
  but TLC can handle only specifications with one next-state relation.`,!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.
@@ -64,27 +64,17 @@ The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configurat
64
64
  Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
65
65
  It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
66
66
  %1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
67
- `,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]];let kt;const At=()=>kt??=Ot.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),jt=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,Mt=e=>jt.test(e)?void 0:At().find(t=>t.pattern.test(e))?.message,Nt=e=>e instanceof c||Mt(e.message)?.isEvalException===!0,Pt=/* @__PURE__ */ new Map([[1e3,`
67
+ `,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]];let Ot;const kt=()=>Ot??=Dt.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),At=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,jt=e=>At.test(e)?void 0:kt().find(t=>t.pattern.test(e))?.message,Mt=e=>e instanceof x||jt(e.message)?.isEvalException===!0,Nt=/* @__PURE__ */ new Map([[1e3,`
68
68
  : `],[2105,`failed.
69
69
  `],[2154,`but it produced the following error:
70
70
  `],[2171,`Parsing or semantic analysis failed.`],[2213,`:
71
71
  `],[2281,` - specifically: `],[2405,`failed.
72
- `]]),Ft=(e,t,n)=>{let r=n?Pt.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${It(t.slice(a),n)}`},It=(e,t)=>{let n=t?Mt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Ct.none} @!@!@\n${Ft(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Lt=(e,t=2)=>String(e).padStart(t,`0`),Rt=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${Lt(r%24)}h`:e>36e5?`${Lt(r%24)}h ${Lt(n)}min`:e>6e4?`${Lt(n)}min ${Lt(t)}s`:`${Lt(t)}s`},zt=e=>`${e.getFullYear()}-${Lt(e.getMonth()+1)}-${Lt(e.getDate())} ${Lt(e.getHours())}:${Lt(e.getMinutes())}:${Lt(e.getSeconds())}`,Bt=/* @__PURE__ */ new WeakMap,Vt=(e,t,n)=>{if(!(e instanceof y))return e;let r=S(new y(`${n}\n${e.message}`,e),_(e));return Bt.set(r,{code:t,headline:n,inner:e}),r},Ht=e=>Bt.has(e),Ut=u(`util.WrongInvocationException`),Wt=m.slice(0,m.indexOf(`
73
- `)),Gt=`${m}tlc2.tool.EvalException: `,Kt=`${m}util.Assert$TLCRuntimeException: `,qt=e=>Nt(e)?Gt:Kt,Jt=e=>{try{return e()}catch(e){throw e instanceof y?Nt(e)?new y(`${p}${e.message}`):Mt(e.message)?e:new y(`${m}${e.message}`):e}},Yt=[Gt,Kt,m,p],Xt=(e,t)=>{let n=Bt.get(e);if(n)return`${n.headline}\n${Xt(n.inner,t)}`;let r=e.message;if(e instanceof d)return r;let i=Yt.find(e=>r.startsWith(e))??``;return`${i}${It(r.slice(i.length),t)}`},Zt=(e,t)=>{let n=Bt.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Xt(e,!0)};if(e instanceof s)return{code:t?St.stackOverflow:St.general,message:r,toolMessage:r};if(t&&Nt(e))return{code:Mt(r)?.code??St.general,message:r,toolMessage:r};let i=t&&!r.startsWith(Wt)&&!(e instanceof d),a=e instanceof o?Ut:m,c=i?a:``;return{code:St.general,message:`${c}${r}`,toolMessage:`${c}${Xt(e,!0)}`}},Qt=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,$t=2147483647,en=1e6;let tn=en;const nn=()=>tn,rn=()=>Math.max(tn,10),an=()=>`Attempted to construct a set with too many elements (>${tn}).`,on=(e,t)=>{if(e.length===rn())throw new o(an());e.push(t)},sn=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=rn(),cn=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},P=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,ln=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),un=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),dn=e=>typeof e==`object`&&e.kind===`ModelValue`,fn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),pn=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:P(e)?`set`:`function`,mn=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let hn=!1;const gn=(e,t)=>(hn=!0,e.writtenKeys=t,e),_n=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,vn=e=>_n(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),yn=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):vn(e),bn=(e,t,n)=>gn(di(e,t),n),xn=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(xn);e.writtenKeys=void 0,e.range.forEach(xn)}},Sn=e=>e.every(e=>typeof e==`string`),Cn=(e,t)=>e.length>0&&t.length>0&&Sn(e)!==Sn(t),wn=(e,t)=>{hn&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Cn(n,r)?Pr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Xn(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:Xn(t,n);if(r!==0)return r}return 0},Tn=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=Xn(n[e],r[e]);if(t!==0)return t}return 0},En=e=>dn(e)?e.type:void 0,Dn=(e,t,n)=>{let r=En(e),i=En(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(dn(e)&&dn(t)){if(r===void 0||i===void 0||r===i)return;throw new y(`Attempted to ${a} the differently-typed model values ${R(e)} and ${R(t)}`)}throw r===void 0?new y(`Attempted to ${a} the typed model value ${R(t)} and the non-model value\n${R(e)}`):new y(`Attempted to ${a}${n?``:` the`} typed model value ${R(e)} and non-model value\n${R(t)}`)},On=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),kn=On(),An=e=>{Object.assign(kn,On()),Zn.clear();for(let t of e)Bn(t)},jn=()=>{kn.searchRank=kn.size},Mn=()=>kn.unorderedString;let Nn=!1;const Pn={isExpanded:!0,isViewPrinted:!1},Fn=e=>{Nn=e.version===`1.7.4`,tn=e.maxSetSize??en,Pn.isExpanded=e.isLazyValueExpanded??!0,Pn.isViewPrinted=e.isViewPrinted??!1},In=/* @__PURE__ */ new WeakMap,Ln=(e,t)=>(Pn.isViewPrinted&&In.set(e,t),e),Rn=/* @__PURE__ */ new WeakMap,zn=(e,t)=>(Rn.set(e,t),e),Bn=e=>(kn.ranks[e]===void 0&&(kn.ranks[e]=kn.size++),e),Vn=e=>kn.ranks[Bn(e)],Hn=(e,t)=>{if(e===t)return 0;let n=kn.ranks,r=n[e],i=n[t],a=kn.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(kn.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Un=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Wn=(e,t)=>(Un(e)||Un(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Gn=(e,t)=>new y(Un(e)?`Attempted to compare overridden value ${R(e,!0)} with non-overridden value:\n${R(t)}`:`Attempted to compare ${pn(e)} ${R(e)} with ${pn(t)} ${R(t)}`),Kn=(e,t,n)=>{if(!Un(e))throw new y(`Attempted to ${n} the set ${R(F(e)?I(e):e,!0)} with the value:\n${R(t,!0)}`);if(!Un(t))throw Gn(e,t);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new c(`Attempted to compare ${R(e,!0)} with the value\n${R(t,!0)}`)},qn={kind:`InfiniteSet`,name:`Any`},Jn=e=>{throw new c(`Attempted to compare ANY with the value\n${R(e)}`)},Yn=e=>{hn&&xn(e),e===qn&&Jn(e),typeof e==`object`&&e.kind===`LazyFunction`&&L(e)},Xn=(e,t)=>{if(e===t)return Yn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return wn(e,t);if(n===`Set`&&r===`Set`)return Tn(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&Dn(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Dn(e,t,!1),n===`ModelValue`?-1:1;if(e===qn||t===qn)return Jn(e===qn?t:e);if(P(e)&&P(t)&&Wn(e,t))return Kn(e,t,`compare`);let i=P(e);if(i!==P(t))throw Gn(e,t);if(n===`Interval`&&r===`Set`){let n=Fi(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-Fi(t);if(n!==0)return n}return i?Tn(I(e),I(t)):wn(L(e),L(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Hn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Dn(e,t,!1),dn(e))return-1;if(dn(t))return 1;throw Gn(e,t)},Zn=/* @__PURE__ */ new Map,Qn=32768,$n=e=>{let t=Zn.get(e);if(t)return t;if(Zn.size===Qn)throw new re(`TLC supports at most ${Qn} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Vn(e),hash:fa(pa(ma(e),109)),fingerprint:Ca(wa(e)^60)};return Zn.set(e,n),n},er=()=>[...Zn.values()],tr=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),nr=e=>{let t=tr(e);return t.isNormalized=!0,t},rr=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let ir=!1;const ar=(e,t)=>(t===`lambda`&&(ir=!0),t!==void 0&&(e.functionClass=t),e),or=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,sr=e=>ar(e,`lambda`),cr=e=>Qt(e)&&e.isCached===!0;let lr=!1;const ur=e=>(lr=!0,e),dr=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),fr=e=>{lr&&typeof e==`object`&&Qt(e)&&dr.has(e.kind)&&(e.isCached=!0)},pr=e=>{(ir||lr)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(pr),e.range.forEach(pr)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(pr):P(e)&&F(e)&&(fr(e),I(e).elements.forEach(pr))))},mr=(e,t)=>{if(fr(e),e===t)return Yn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Dn(e,t,!0),Xn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return wn(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Tn(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&Fi(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==Fi(t))return!1;if(dn(e)||dn(t))return e.kind===`LazyFunction`&&L(e),Dn(e,t,!0),dn(e)&&dn(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return mr(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=Mi(e.domain),r=Mi(t.domain);if(n||r)return n===r;let i=Mi(e.range),a=Mi(t.range);return i||a?i===a:mr(e.domain,t.domain)&&mr(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(Mi(e))return Mi(t);if(Mi(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&mr(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return Mi(e)?Mi(t):!Mi(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>mr(e,t.factors[n]));let n=P(e)&&P(t)&&!(F(e)&&F(t));if(n&&Wn(e,t))return Kn(e,t,`check equality of`)===0;if(n){if(!Un(e)){let n=I(e);if(!Un(t))return Tn(n,I(t))===0}return ka(e)===ka(t)}return Xn(e,t)===0},hr=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):ka(n)===ka(r);return n},gr=hr(!1),_r=hr(!0),vr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},yr=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Sa(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||_r(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||_r(i[e],n))return i[e]}return n.kind===`Set`?vr(n.elements,t):(vr(n.domain,t),vr(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},br=(e,t)=>t.length===0||or(e)===`tuple`?1:la(t)?.low,xr=e=>{if(!un(e))return;let t=L(e);return{domain:t.domain,range:t.range,low:br(e,t.domain)}},Sr=e=>{if(!un(e))return;let t=L(e);return Sn(t.domain)?t:void 0},Cr=(e,t,n)=>(Dn(t,e,n),1),wr={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Tr=(e,t,n)=>{let r=wr[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${R(e)} with ${r.other}:\n${R(t)}`},Er=e=>e?`check equality of`:`compare`,Dr=(e,t,n,r)=>{let i=xr(n);if(!i){if(dn(n))return Cr(n,t,r);throw new y(`Attempted to ${Er(r)} the function ${R(t)} with the value:\n${R(n)}`)}if(e.range.length!==i.range.length)return e.range.length-i.range.length;let a=()=>Or(e.range,i.range,r);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&i.low!==void 0)return e.low===i.low?a():e.low-i.low;let o=e.low??i.low;if(o===void 0)return Or(e.domain,i.domain,r)||a();let s=e.low===void 0?e.domain:i.domain;for(let t=0;t<s.length;t++){let n=s[t];if(typeof n!=`number`)throw new y(`Attempted to compare ${r?`an `:``}integer with non-integer${r||e.low!==void 0?`:`:``}\n${R(n)}.`);let i=e.low===void 0?n-(o+t):o+t-n;if(i!==0)return i}return a()},Or=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=Nr(e[r],t[r],n);if(i!==0)return i}return 0},kr=(e,t,n)=>{let r=L(e);if(or(e)===`tuple`){let i=un(t)?Bi(t):void 0;return i?r.range.length-i.length||Or(r.range,i,n):Dr({...r,low:1},e,t,n)}if(or(e)===`record`){let i=Sr(t);if(!i){if(dn(t))return Cr(t,e,n);throw new y(`Attempted to ${Er(n)} record:\n${R(e)}\nwith non-record\n${R(t)}`)}return r.domain.length-i.domain.length||Or(r.domain,i.domain,n)||Or(r.range,i.range,n)}return Dr({...r,low:br(e,r.domain)},e,t,n)},Ar=(e,t)=>Un(e)||Un(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),jr=(e,t)=>{let n=fn(t)?t:I(t);return{elements:I(e).elements,otherElements:I(n).elements}},Mr=(e,t,n)=>{if(Ar(e,t))return n?+!mr(e,t):Xn(e,t);if(!fn(e))return Mr(I(e),t,n);if(!P(t)){if(dn(t))return Cr(t,e,n);throw new y(`Attempted to ${Er(n)} the set ${R(e)} with the value:\n${R(t)}`)}let r=jr(e,t);return r.elements.length-r.otherElements.length||Or(r.elements,r.otherElements,n)},Nr=(e,t,n)=>{if(typeof e!=`object`){if(typeof t==typeof e)return n?e===t?0:1:Xn(e,t);if(dn(t))return Cr(t,e,n);throw new y(Tr(e,t,n))}return e.kind===`ModelValue`?(e.type!==void 0&&Dn(e,t,n),dn(t)?n?e.name===t.name?0:1:e.rank-t.rank:-1):un(e)?kr(e,t,n):Mr(e,t,n)},Pr=(e,t)=>Nr(e,t,!1),Fr=(e,t)=>Nr(e,t,!0)===0,Ir=e=>{let t=[];for(let n of e){let e=Rr(n,t);e.isFound||t.splice(e.index,0,n)}return t},Lr=(e,t)=>{let n=Hi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Rr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=Lr(e,()=>Pr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},zr=(e,t)=>t.some(t=>Lr(t,()=>Fr(t,e))),Br=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Vr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Vr)),e.kind===`Function`&&(e.domain.forEach(Vr),e.range.forEach(Vr)))},Hr=e=>{if(!(typeof e!=`object`||cr(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:I(e);return;case`FilteredSet`:case`Subset`:return Hr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(Hr(e.left),Hr(e.right));case`FunctionSet`:return Hr(e.domain),Hr(e.range);case`RecordSet`:return e.sets.forEach(Hr);case`ProductSet`:return e.factors.forEach(Hr)}},Ur=(e,t)=>Ui(mr,Fr,e,t),Wr=e=>{for(let t=1;t<e.length;t++)if(Xn(e[t-1],e[t])>=0)return!1;return!0},Gr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},Kr=e=>{for(let t=1;t<e.length;t++)fr(e[t]);if(e.length<2||Wr(e))return tr(e);let t=[...e].sort(Xn),n=[t[0]];for(let e=1;e<t.length;e++)Xn(n[n.length-1],t[e])!==0&&n.push(t[e]);return tr(n)},qr=e=>{if(Gr(e))return tr(e);let t=Ui(Kr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Jr=tr([]),Yr=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Xn(r[a],t)<0;)a++;a<r.length&&Xn(r[a],t)===0||i.push(t)}return i.length===n.length?e:tr(i)},Xr=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Xn(r[a],t)<0;)a++;a<r.length&&Xn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:tr(i)},Zr=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=Xn(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=tr(i);if(e.hash!==0&&e.hash!==_a){let t=e.hash,n=0;for(;n<a.length;n++){let e=Sa(a[n]);if(e===_a)break;t=t+ha(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Ta(a[e])|0;c.fingerprint=t}return c},Qr=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Xn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Xn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return rr(n,r)},$r=e=>{let t=Qr(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:gn(t,e.map(e=>e[0]))},ei=[],ti=/* @__PURE__ */ new Map,ni=[],ri=/* @__PURE__ */ new WeakMap,ii=e=>{let t=ei[e]??ti.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?ti.set(e,new WeakRef(n)):ei[e]=n,n},ai=e=>{if(Fi(e),e.low===1&&e.high>=1)return ii(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},oi=e=>e.length>0&&(e===ei[e.length]||e===ti.get(e.length)?.deref())||ri.has(e),si=e=>{let t=I(e).elements;return oi(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},ci=e=>{let t=ni[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return ni[e]=n,n},li=e=>ar(rr(ii(e.length),e),`tuple`),ui=e=>ar(Qr(e),`record`),di=(e,t)=>ar(rr(e,t),`record`),fi=e=>P(e)&&!Un(e),pi=(e,t=!1)=>`UNION(${R(e.base,t)})`,mi=(e,t=e=>I(e).elements)=>{if(!fi(e.base))throw new y(`Attempted to enumerate the nonenumerable set:\n${pi(e)}`);return t(e.base)},hi=(e,t,n)=>{if(fi(e))return e;throw new y(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${R(e)}\nwhen enumerating:\n${pi(n)}`)},F=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return F(e.base);case`FunctionSet`:return F(e.domain)&&F(e.range)||gi(e.domain)===!0||gi(e)===!0;case`RecordSet`:return e.sets.every(F)||gi(e)===!0;case`ProductSet`:return e.factors.every(F)||gi(e)===!0;case`Union`:return F(e.base)&&(fn(e.base)?Br(e.base):Di(e.base)).every(F);case`SetOperation`:return e.operator===`\\cup`?F(e.left)&&F(e.right):e.operator===`\\cap`?F(e.left)||F(e.right):F(e.left);default:return!1}},gi=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=gi(e.domain);return t===void 0?void 0:!t&&gi(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=gi(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return F(e)?I(e).elements.length===0:void 0;default:return}},_i=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},vi=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},yi=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Un(e.base))return;let t=I(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:vi(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return tr(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},bi=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(tr(r.map(t=>e[t])));while(vi(r,e.length))}return t},xi=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Un(a))throw new y(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},Si=(e,t=e=>I(e).elements)=>{if(typeof e!=`object`)throw new y(`Expected a set but found ${R(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Ir(e.elements);case`Interval`:{let t=ai(e);return t!==ei[t.length]&&ri.set(t,e),t}case`Subset`:{if(Fi(e.base)===0)return bi([]);if(!P(e.base))throw new y(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${N(R(e.base))}`);let t=I(e.base).elements;if(t.length>30)throw new y(Pi(e));return bi(t)}case`FunctionSet`:{if(!Nn&&Mi(e))return[];if(Un(e.domain))throw new y(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${R(e.domain)}\ncannot be enumerated.`);let n=si(e.domain);if((n.length>0||Nn)&&Un(e.range))throw new y(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${R(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return _i(n.map(()=>r)).map(e=>rr(n,e))}case`RecordSet`:{if(!Nn&&Mi(e))return[];let n=xi(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${R(t)}`);return _i(n).map(t=>ui(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Nn&&Mi(e))return[];let n=xi(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${R(e)}`);return _i(n).map(li)}case`FilteredSet`:if(!P(e.base)||Un(e.base))throw new y(`Attempted to enumerate { x \\in S : p(x) } when S:\n${R(e.base)}\nis not enumerable`);return I(qr(Di(e.base).filter(t=>e.test(t,!1)))).elements;case`Union`:{let t=[];return mi(e).forEach((n,r)=>{let i=hi(n,r,e);if(sn(i))throw new o(an());Di(i).forEach(e=>on(t,e))}),I(qr(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!fi(e.left)&&!fi(e.right))throw new y(`Attempted to enumerate S \\cap T when neither S:\n${R(e.left)}\nnor T:\n${R(e.right)}\nis enumerable`);if(e.operator===`\\`&&!fi(e.left))throw new y(`Attempted to enumerate S \\ T when S:\n${R(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return I(qr(wi(e))).elements;let t=e.operator===`\\`||fi(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return cn(typeof n==`object`&&n.kind===`Interval`?n:Di(n),t=>{Gi(t,r)===(e.operator===`\\cap`)&&on(i,t)}),I(qr(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to enumerate the non-enumerable set ${R(e)}`);default:throw new y(`Expected a set but found ${R(e)}`)}},I=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return tr(Si(e));let t=typeof e==`object`&&Qt(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Hi.sets;n?.push(e);let r=Si(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?tr(r):Kr(r);return t&&(t.enumerated=i),i},Ci=e=>{if(!(typeof e!=`object`||cr(e)))switch(e.kind){case`MixedSet`:I(e);return;case`FilteredSet`:return fi(e.base)||I(e),Ci(e.base);case`Union`:if(!fn(e.base)&&fi(e.base))return Ci(e.base);mi(e).slice(0,1).forEach(t=>Ci(hi(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!fi(e.left)&&I(e),e.operator!==`\\cup`||fi(e.left)&&fi(e.right)||I(e),e.operator!==`\\cap`||fi(e.left)?Ci(e.left):Ci(e.right),e.operator===`\\cup`&&Ci(e.right)}},wi=e=>{if(!fi(e.left)||!fi(e.right))throw new y(`Attempted to enumerate S \\cup T when S:\n${R(e.left)}\nand T:\n${R(e.right)}\nare not both enumerable`);if(Ci(e.left),Ci(e.right),sn(e.left))throw new o(an());let t=Di(e.left),n=sn(e.right)?void 0:Di(e.right);if(!n||t.length+n.length>rn())throw new o(an());return[...t,...n]},Ti=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return I(e).elements;let t=Lr(e,()=>wi(e)),n=I(qr(t)).elements;return e.enumerated=tr(n),n},Ei=(e,t)=>{if(typeof e!=`object`||cr(e))return I(e).elements.some(t);let n=Hi.sets;n?.push(e),Ci(e);let r=ji(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Di=e=>{let t=[];return Ei(e,e=>(t.push(e),!1)),t},Oi=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,ki=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(ki);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(ki)&&e.range.every(ki);case`SetOperation`:return e.operator!==`\\cup`&&ki(e.left)&&ki(e.right);case`FilteredSet`:return ki(e.base);case`ProductSet`:return e.factors.every(ki);default:return!1}},Ai=e=>typeof e!=`object`||cr(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Ai(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Ai(e.left)||Ai(e.right):Oi(e)?.some(Ai)??!1,ji=(e,t)=>{if(e.kind===`Union`)return mi(e,Di).some((n,r)=>Ei(hi(n,r,e),t));if(e.kind===`FilteredSet`&&fi(e.base))return Ei(e.base,n=>e.test(n,!1)&&t(n));if(Oi(e)?.some(Ai))return Si(e,Di).some(t);if(e.kind!==`SetOperation`)return I(e).elements.some(t);if(e.operator===`\\cup`)return!fi(e.left)||!fi(e.right)?I(e).elements.some(t):Ei(e.left,t)||Ei(e.right,t);let n=e.operator===`\\`||fi(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return fi(r)?Ei(r,n=>Gi(n,i)===(e.operator===`\\cap`)&&t(n)):I(e).elements.some(t)},Mi=e=>{if(typeof e!=`object`||!P(e))throw new y(`Shouldn't call isEmpty() on value ${R(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new y(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(Mi);case`RecordSet`:return e.sets.some(Mi);case`FunctionSet`:return!Mi(e.domain)&&Mi(e.range);case`Union`:return mi(e).every((t,n)=>Mi(hi(t,n,e)));default:return I(e).elements.length===0}},Ni=(e,t,n)=>e.reduce((e,r)=>{let i=e*Fi(r,t);if(i>2147483647)throw new y(n());return i},1),Pi=e=>`Overflow when computing the number of elements in:\n${R(e)}`,Fi=(e,t)=>{if(typeof e!=`object`)throw new y(`Attempted to compute the number of elements in the ${pn(e)} ${R(e)}.`);switch(e.kind){case`ModelValue`:throw new y(`Attempted to compute the number of elements in the model value ${R(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return Fi(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new y(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to compute the number of elements in the overridden value ${R(e)}.`);case`Subset`:{let n=Fi(e.base,t);if(n>=31)throw new y(Pi(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(Mi(e.domain))return 1;if(Mi(e.range))return 0;if(Fi(e.range,t)===1)return 1}let n=Fi(e.domain,t),r=Fi(e.range,t);if(r<=1)return n===0?1:r;let i=1;for(let t=0;t<n;t++)if(i*=r,i>2147483647)throw new y(Pi(e));return i}case`RecordSet`:return t!==`1.7.4`&&Mi(e)?0:Ni(e.sets,t,()=>Pi(e));case`ProductSet`:return t!==`1.7.4`&&Mi(e)?0:Ni(e.factors,t,()=>`Overflow when computing the number of elements in ${R(e)}`);default:return fr(e),I(e).elements.length}},Ii=e=>`Attempted to check if the set ${R(e)}is finite.`,Li=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new y(`Attempted to check if the ${pn(e)} ${R(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new y(`Attempted to check if the function:\n${R(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Li(e.base)&&Mi(e.base);case`Subset`:return Li(e.base);case`FunctionSet`:{let t=Li(e.domain);if(t&&Mi(e.domain))return!0;let n=Li(e.range);return n&&Mi(e.range)?!0:n&&(t||Fi(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n=!0;for(let e of t)if(!Li(e))n=!1;else if(Mi(e))return!0;return n}case`Union`:if(!fi(e.base))throw new y(`Attempted to check if the nonenumerable set:\n${pi(e)}\nis a finite set.`);return I(e.base).elements.every(Li);case`SetOperation`:if(e.operator===`\\cup`)return Li(e.left)&&Li(e.right);if(e.operator===`\\cap`){if(!Li(e.left)&&!Li(e.right))throw new y(Ii(e));return!0}if(Li(e.left))return!0;if(!Li(e.right))throw new y(Ii(e));return!1;case`FilteredSet`:if(!Li(e.base))throw new y(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${R(e.base)}\nis finite.`);return!0}},Ri=(e,t,n=Xn)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},zi=(e,t)=>{let n=e.elements;if(n.length>rn())throw new o(an());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=Ri(n,e);return!r[t]&&(r[t]=!0,!0)}),a=tr(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},Bi=e=>{if(typeof e!=`object`||!un(e))return;if(e.kind===`LazyFunction`&&(!P(e.domain)||Un(e.domain)))throw new y(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=L(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Vi=(e,t)=>{let n=`Attempted to check if the value:\n${R(e)}\nis an element of the`;if(!un(t))return`${n} ${pn(t)} ${R(t)}`;let r=or(t);return r===`record`?`Attempted to check if element:\n${R(e)}\nis in the record:\n${R(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${R(t)}`},Hi={sets:void 0},Ui=(e,t,n,r)=>{let i=Hi.sets,a=Hi.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof y))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Wi=e=>(Hi.sets??[]).slice(e).some(e=>typeof e==`object`&&Hi.callStack?.sources.has(e)===!0),Gi=(e,t)=>{let n=Hi.sets;if(n===void 0)return Xi(e,t);n.push(t);let r=Xi(e,t);return n.pop(),r},Ki=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},qi=(e,t)=>Ri(t.elements,e)!==-1,Ji=(e,t)=>t.isNormalized?Rr(e,t.elements).isFound:zr(e,Br(t)),Yi=(e,t)=>{if(e.type!==void 0)throw new y(`Attempted to check if the typed model value ${N(R(e))} is an element of\n${N(R(t))}`);return!1},Xi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return Ki(e,t)??Zi(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return Zi(e,t)},Zi=(e,t)=>{if(!P(t))throw new y(Vi(e,t));switch(t.kind){case`Set`:return fr(e),Ui(qi,Ji,e,t);case`MixedSet`:return zr(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&(!dn(e)||e.type!==void 0))throw new y(`Attempted to check if the value:\n${R(e)}\nis in the integer interval ${R(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(dn(e))return Yi(e,t);if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new c(`Attempted to check if the value:\n${R(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!P(e)||Un(e))throw new y(`Attempted to check if the non-enumerable value\n${N(R(e))}\nis element of\n${N(R(t))}`);return I(e).elements.every(e=>Gi(e,t.base));case`FunctionSet`:{if(!un(e)){if(dn(e))return Yi(e,t);throw new y(`Attempted to check if \n${R(e)}\nwhich is not a TLC function value, is in the set of functions:\n${N(R(t))}`)}let n=L(e),r=br(e,n.domain);return(r===void 0?Ur(t.domain,tr(n.domain)):Ur({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Gi(e,t.range))}case`RecordSet`:{let n=un(e)?L(e):void 0;if(!n||!Sn(n.domain)){if(dn(e))return Yi(e,t);throw new y(`Attempted to check if non-record\n${R(e)}\nis in the set of records:\n${R(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Ri(n.domain,e);return i!==-1&&Gi(n.range[i],t.sets[r])})}case`ProductSet`:{let n=un(e)?Bi(e):void 0;if(n===void 0){let n=un(e)&&L(e).domain.every(e=>typeof e==`number`);if(dn(e))return Yi(e,t);if(n)return!1;throw new y(`Attempted to check if non-tuple\n${R(e)}\nis in the set of tuples:\n${R(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>Gi(e,t.factors[n]))}case`FilteredSet`:try{return Gi(e,t.base)&&t.test(e,!0)}catch(n){throw!(n instanceof y)||!Nt(n)?n:new y(`Cannot decide if element:\n${N(R(e))}\n is element of:\n${N(R(t.base))}\nand satisfies the predicate ${t.source?.predicate}`)}case`Union`:{if(!fi(t.base))throw new y(`Attempted to check if:\n ${R(e)}\nis an element of the non-enumerable set:\n ${pi(t)}`);let n=I(t.base).elements;return n.length>1&&n.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),n.some(t=>Gi(e,t))}case`SetOperation`:return t.operator===`\\cup`?Gi(e,t.left)||Gi(e,t.right):Gi(e,t.left)&&Gi(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Bi(e);if(n===void 0){if(dn(e))return Yi(e,t);throw new c(`Attempted to check if the value:\n${N(R(e))}\nis an element of ${N(R(t))}.`)}return n.every(e=>Gi(e,t.base))}default:throw new y(Vi(e,t))}},Qi=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?Gi(e,n):e.range.every((e,r)=>Qi(e,t.range[r],n.range)),L=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(F(e.domain)||Fi(e.domain),!P(e.domain))throw new y(`The domains of formal parameters must be enumerable.`);let t=si(e.domain);return e.enumerated=ar(rr(t,t.map(t=>e.apply(t))),or(e)),e.enumerated}throw new y(`Expected a function but found ${R(e)}`)},$i=(e,t,n)=>{let r=N(R(e)),i=N(R(t)),a=n===`1.7.4`;switch(or(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},ea=(e,t)=>{if(!Nn)return $i(e,t);let n=N(R(t));return or(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},ta=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},na=e=>new y(`Attempted to apply function with integer domain to the non-integer argument ${N(R(e))}`),ra=(e,t)=>Ri(e.domain,t),ia=(e,t,n)=>{let r=_n(e);throw Nn||r!==e.domain||r.length<32?r.forEach(e=>Fr(e,t)):Ri(r,t,Pr),n},aa=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=or(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new y(n(e,t));if(a===void 0&&!Nn&&typeof t!=`number`&&oi(r))throw na(t)}let i=ta(r,t);return i===-1?Ui(ra,ia,e,t):i},oa=(e,t,n)=>{let r=e.domain,i=Bi(n),a=(t,n,r)=>`In applying the function\n${N(R(e))},\nthe ${t} is:\n${N(R(n))}\nwhich ${r}.\n`,o=()=>new y(a(`argument list`,n,`does not match its formal parameter`));if(i===void 0)throw o();if(typeof r!=`object`||r.kind!==`ProductSet`)throw new y(`Attempted to apply a function to ${R(n)}, which is not in its domain`);if(t.forEach((e,t)=>{if(t>=i.length)throw o();let n=i[t],s=`argument number ${t+1}`;if(!Gi(n,r.factors[t]))throw new y(a(s,n,e===void 0?`is not in the function's domain ${R(r)}`:`is not in its domain`));if(e!==void 0&&Bi(n)?.length!==e)throw new y(a(s,n,`does not match its formal parameter`))}),i.length>t.length)throw o()},sa=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!Gi(t,e.lambdaDomain),ca=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return ca(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return oa(e,r,t),e.apply(t);if(!Gi(t,e.domain))throw new y(or(e)===`lambda`?$i(e,t):`Attempted to apply a function to ${R(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new y(`Attempted to apply ${R(e)}, which is not a function`);let r=n??$i;if(sa(e,t))throw new y(r(e,t));let i=aa(e,t,r);if(i===-1)throw new y(r(e,t));return e.range[i]},la=e=>oi(e)?ri.get(e)??ci(e.length):void 0,ua=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=L(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=la(t.domain);if(n)return n;let r=tr(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},da=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(!Gi(t,e.domain))return e;let r=n(e.apply(t));return ar({kind:`LazyFunction`,domain:e.domain,apply:n=>Ur(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},or(e))}if(!un(e))throw new y(`Attempted to apply EXCEPT construct to the value ${N(R(e))}.`);let i=L(e);if(sa(i,t))return i;let a=aa(i,t,ea);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=ar(rr(i.domain,o),or(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==_a){let e=Sa(c);if(e!==_a){let t=Sa(i.domain[a]);l.hash=s===c?i.hash:i.hash-ga(t,Sa(s))+ga(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Ea(e,s)+Ea(e,c)|0}return l},fa=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},pa=(e,t)=>Math.imul(e^t,16777619),ma=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return fa(t)},ha=e=>fa(e+2654435769|0),ga=(e,t)=>fa(Math.imul(e,668265261)+t|0),_a=795548749,va=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Sa(t[e]);if(r===_a)return _a;n=n+ha(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Sa(e.domain[n]),i=Sa(e.range[n]);if(r===_a||i===_a)return _a;t=t+ga(r,i)|0}return t},ya=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new y(`TLC has found a state in which the value of a variable contains ${R(e)}`);if(P(e)){I(e).elements.forEach(ya);return}let t=L(e);t.domain.forEach(ya),t.range.forEach(ya)},ba=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Sa(e)===_a&&ya(e);return}catch(e){if(!(e instanceof y))throw e;return e}},xa=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Sa=e=>typeof e==`number`?fa(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?ma(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=va(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?F(e.domain)?Sa(L(e)):_a:F(e)?Sa(I(e)):_a,Ca=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},wa=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Ca(t)},Ta=e=>Ca(Oa(e)+2135587861|0),Ea=(e,t)=>Ca(Math.imul(Oa(e),374761393)+Oa(t)|0),Da=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Ta(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Ea(e.domain[n],e.range[n])|0;return t},Oa=e=>typeof e==`number`?Ca(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?wa(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Da(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Oa(L(e)):F(e)?Oa(I(e)):wa(ka(e)),ka=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Aa(e),Aa=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ka(e.base)}>`;if(e.kind===`FilteredSet`&&!F(e))throw new y(`Attempted to compare the non-enumerable set ${R(e)} with another value`);if(P(e))return F(e)?`{${I(e).elements.map(ka).join(`,`)}}`:`<${e.kind} ${R(e)}>`;let t=L(e);return`(${t.domain.map((e,n)=>`${ka(e)}:${ka(t.range[n])}`).join(`,`)})`},ja={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},Ma=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>ja[e])}"`,Na=1999,Pa=e=>e.reduce((e,t)=>e===0?0:e*Fi(t),1),Fa=e=>{if(e.kind===`Subset`)return Fi(e.base)<=6?I(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return I(e);if(e.kind===`FunctionSet`){let t=Mi(e.domain)?0:Fi(e.domain);return(t===0?1:Fi(e.range)**t)<=Na?I(e):void 0}return Pa(e.kind===`RecordSet`?e.sets:e.factors)<=Na?I(e):void 0},Ia=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&un(e.base)&&(e.base.kind===`Function`||F(e.base.domain)))return Fa(e);if(F(e))try{return Fa(e)}catch(e){if(e instanceof y)return;throw e}},La=(e,t)=>{let n=e=>R(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return pi(e,t)}},Ra=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),za=e=>{if(F(e.domain))try{return L(e)}catch(e){if(e instanceof y||ee(e))return;throw e}},Ba=e=>{let t=[],n=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:if(e.elements.forEach(n),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(n),I(e);return;case`Function`:e.range.forEach(n);return;case`LazyFunction`:n(e.enumerated??e.domain);return;case`SetOperation`:n(e.left),n(e.right);return;case`FunctionSet`:n(e.domain),n(e.range);return;case`RecordSet`:e.sets.forEach(n);return;case`ProductSet`:e.factors.forEach(n);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:n(e.base);return;default:return}};try{return e.forEach(n),e.map(e=>R(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1})}},R=(e,t=!1,n=!1)=>{let r=e=>R(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Ma(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(I(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Pn.isExpanded?Ia(e,t):void 0;return n?r(n):La(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Pn.isExpanded||!e.source?za(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${R(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Nn&&or(e)!==`tuple`)return`<< >>`;let a=r=>R(r,t,n&&or(e)!==`lambda`);if(i.domain.length===0&&or(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):yn(i);return or(e)===`record`||i.domain.every(e=>typeof e==`string`&&Ra(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},Va=(e,t)=>{if(e===void 0)return!1;try{return mr(e,t)}catch(e){if(e instanceof y)return!1;throw e}},Ha=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Ua=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(Ha,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
74
- `;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(gt(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},Wa=(e,t)=>{let n=t?void 0:In.get(e);if(n)return n();let r=Object.entries(e),i=Rn.get(e),a=i!==void 0&&`_format`in e,o=a?e._format:r.length===1?`%s = %s
72
+ `]]),Pt=(e,t,n)=>{let r=n?Nt.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)}${Ft(t.slice(a),n)}`},Ft=(e,t)=>{let n=t?jt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${St.none} @!@!@\n${Pt(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},It=(e,t=2)=>String(e).padStart(t,`0`),Lt=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 ${It(r%24)}h`:e>36e5?`${It(r%24)}h ${It(n)}min`:e>6e4?`${It(n)}min ${It(t)}s`:`${It(t)}s`},Rt=e=>`${e.getFullYear()}-${It(e.getMonth()+1)}-${It(e.getDate())} ${It(e.getHours())}:${It(e.getMinutes())}:${It(e.getSeconds())}`,zt=/* @__PURE__ */ new WeakMap,Bt=(e,t,n)=>{if(!(e instanceof y))return e;let r=v(new y(`${n}\n${e.message}`,e),l(e));return zt.set(r,{code:t,headline:n,inner:e}),r},Vt=e=>zt.has(e),Ht=e(`util.WrongInvocationException`),Ut=i.slice(0,i.indexOf(`
73
+ `)),Wt=`${i}tlc2.tool.EvalException: `,Gt=`${i}util.Assert$TLCRuntimeException: `,Kt=e=>Mt(e)?Wt:Gt,qt=e=>{try{return e()}catch(e){throw e instanceof y?Mt(e)?new y(`${p}${e.message}`):jt(e.message)?e:new y(`${i}${e.message}`):e}},Jt=[Wt,Gt,i,p],Yt=(e,t)=>{let n=zt.get(e);if(n)return`${n.headline}\n${Yt(n.inner,t)}`;let r=e.message;if(e instanceof re)return r;let i=Jt.find(e=>r.startsWith(e))??``;return`${i}${Ft(r.slice(i.length),t)}`},Xt=(e,t)=>{let n=zt.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Yt(e,!0)};if(e instanceof c)return{code:t?xt.stackOverflow:xt.general,message:r,toolMessage:r};if(t&&Mt(e))return{code:jt(r)?.code??xt.general,message:r,toolMessage:r};let a=t&&!r.startsWith(Ut)&&!(e instanceof re),o=e instanceof s?Ht:i,l=a?o:``;return{code:xt.general,message:`${l}${r}`,toolMessage:`${l}${Yt(e,!0)}`}},Zt=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,Qt=2147483647,$t=1e6;let en=$t;const tn=()=>en,nn=()=>Math.max(en,10),rn=()=>`Attempted to construct a set with too many elements (>${en}).`,an=(e,t)=>{if(e.length===nn())throw new s(rn());e.push(t)},on=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=nn(),sn=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},cn=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,ln=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),un=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),dn=e=>typeof e==`object`&&e.kind===`ModelValue`,fn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),pn=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:cn(e)?`set`:`function`,mn=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let hn=!1;const gn=(e,t)=>(hn=!0,e.writtenKeys=t,e),_n=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,vn=e=>_n(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),yn=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):vn(e),bn=(e,t,n)=>gn(di(e,t),n),xn=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(xn);e.writtenKeys=void 0,e.range.forEach(xn)}},Sn=e=>e.every(e=>typeof e==`string`),Cn=(e,t)=>e.length>0&&t.length>0&&Sn(e)!==Sn(t),wn=(e,t)=>{hn&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Cn(n,r)?Pr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Xn(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:Xn(t,n);if(r!==0)return r}return 0},Tn=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=Xn(n[e],r[e]);if(t!==0)return t}return 0},En=e=>dn(e)?e.type:void 0,Dn=(e,t,n)=>{let r=En(e),i=En(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(dn(e)&&dn(t)){if(r===void 0||i===void 0||r===i)return;throw new y(`Attempted to ${a} the differently-typed model values ${R(e)} and ${R(t)}`)}throw r===void 0?new y(`Attempted to ${a} the typed model value ${R(t)} and the non-model value\n${R(e)}`):new y(`Attempted to ${a}${n?``:` the`} typed model value ${R(e)} and non-model value\n${R(t)}`)},On=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),kn=On(),An=e=>{Object.assign(kn,On()),Zn.clear();for(let t of e)Bn(t)},jn=()=>{kn.searchRank=kn.size},Mn=()=>kn.unorderedString;let Nn=!1;const Pn={isExpanded:!0,isViewPrinted:!1},Fn=e=>{Nn=e.version===`1.7.4`,en=e.maxSetSize??$t,Pn.isExpanded=e.isLazyValueExpanded??!0,Pn.isViewPrinted=e.isViewPrinted??!1},In=/* @__PURE__ */ new WeakMap,Ln=(e,t)=>(Pn.isViewPrinted&&In.set(e,t),e),Rn=/* @__PURE__ */ new WeakMap,zn=(e,t)=>(Rn.set(e,t),e),Bn=e=>(kn.ranks[e]===void 0&&(kn.ranks[e]=kn.size++),e),Vn=e=>kn.ranks[Bn(e)],Hn=(e,t)=>{if(e===t)return 0;let n=kn.ranks,r=n[e],i=n[t],a=kn.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(kn.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Un=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Wn=(e,t)=>(Un(e)||Un(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Gn=(e,t)=>new y(Un(e)?`Attempted to compare overridden value ${R(e,!0)} with non-overridden value:\n${R(t)}`:`Attempted to compare ${pn(e)} ${R(e)} with ${pn(t)} ${R(t)}`),Kn=(e,t,n)=>{if(!Un(e))throw new y(`Attempted to ${n} the set ${R(F(e)?I(e):e,!0)} with the value:\n${R(t,!0)}`);if(!Un(t))throw Gn(e,t);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new x(`Attempted to compare ${R(e,!0)} with the value\n${R(t,!0)}`)},qn={kind:`InfiniteSet`,name:`Any`},Jn=e=>{throw new x(`Attempted to compare ANY with the value\n${R(e)}`)},Yn=e=>{hn&&xn(e),e===qn&&Jn(e),typeof e==`object`&&e.kind===`LazyFunction`&&L(e)},Xn=(e,t)=>{if(e===t)return Yn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return wn(e,t);if(n===`Set`&&r===`Set`)return Tn(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&Dn(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Dn(e,t,!1),n===`ModelValue`?-1:1;if(e===qn||t===qn)return Jn(e===qn?t:e);if(cn(e)&&cn(t)&&Wn(e,t))return Kn(e,t,`compare`);let i=cn(e);if(i!==cn(t))throw Gn(e,t);if(n===`Interval`&&r===`Set`){let n=Fi(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-Fi(t);if(n!==0)return n}return i?Tn(I(e),I(t)):wn(L(e),L(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Hn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Dn(e,t,!1),dn(e))return-1;if(dn(t))return 1;throw Gn(e,t)},Zn=/* @__PURE__ */ new Map,Qn=32768,$n=e=>{let t=Zn.get(e);if(t)return t;if(Zn.size===Qn)throw new T(`TLC supports at most ${Qn} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Vn(e),hash:fa(pa(ma(e),109)),fingerprint:Ca(wa(e)^60)};return Zn.set(e,n),n},er=()=>[...Zn.values()],tr=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),nr=e=>{let t=tr(e);return t.isNormalized=!0,t},rr=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let ir=!1;const ar=(e,t)=>(t===`lambda`&&(ir=!0),t!==void 0&&(e.functionClass=t),e),or=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,sr=e=>ar(e,`lambda`),cr=e=>Zt(e)&&e.isCached===!0;let lr=!1;const ur=e=>(lr=!0,e),dr=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),fr=e=>{lr&&typeof e==`object`&&Zt(e)&&dr.has(e.kind)&&(e.isCached=!0)},pr=e=>{(ir||lr)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(pr),e.range.forEach(pr)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(pr):cn(e)&&F(e)&&(fr(e),I(e).elements.forEach(pr))))},mr=(e,t)=>{if(fr(e),e===t)return Yn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Dn(e,t,!0),Xn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return wn(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Tn(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&Fi(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==Fi(t))return!1;if(dn(e)||dn(t))return e.kind===`LazyFunction`&&L(e),Dn(e,t,!0),dn(e)&&dn(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return mr(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=Mi(e.domain),r=Mi(t.domain);if(n||r)return n===r;let i=Mi(e.range),a=Mi(t.range);return i||a?i===a:mr(e.domain,t.domain)&&mr(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(Mi(e))return Mi(t);if(Mi(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&mr(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return Mi(e)?Mi(t):!Mi(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>mr(e,t.factors[n]));let n=cn(e)&&cn(t)&&!(F(e)&&F(t));if(n&&Wn(e,t))return Kn(e,t,`check equality of`)===0;if(n){if(!Un(e)){let n=I(e);if(!Un(t))return Tn(n,I(t))===0}return ka(e)===ka(t)}return Xn(e,t)===0},hr=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):ka(n)===ka(r);return n},gr=hr(!1),_r=hr(!0),vr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},yr=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Sa(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||_r(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||_r(i[e],n))return i[e]}return n.kind===`Set`?vr(n.elements,t):(vr(n.domain,t),vr(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},br=(e,t)=>t.length===0||or(e)===`tuple`?1:la(t)?.low,xr=e=>{if(!un(e))return;let t=L(e);return{domain:t.domain,range:t.range,low:br(e,t.domain)}},Sr=e=>{if(!un(e))return;let t=L(e);return Sn(t.domain)?t:void 0},Cr=(e,t,n)=>(Dn(t,e,n),1),wr={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Tr=(e,t,n)=>{let r=wr[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${R(e)} with ${r.other}:\n${R(t)}`},Er=e=>e?`check equality of`:`compare`,Dr=(e,t,n,r)=>{let i=xr(n);if(!i){if(dn(n))return Cr(n,t,r);throw new y(`Attempted to ${Er(r)} the function ${R(t)} with the value:\n${R(n)}`)}if(e.range.length!==i.range.length)return e.range.length-i.range.length;let a=()=>Or(e.range,i.range,r);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&i.low!==void 0)return e.low===i.low?a():e.low-i.low;let o=e.low??i.low;if(o===void 0)return Or(e.domain,i.domain,r)||a();let s=e.low===void 0?e.domain:i.domain;for(let t=0;t<s.length;t++){let n=s[t];if(typeof n!=`number`)throw new y(`Attempted to compare ${r?`an `:``}integer with non-integer${r||e.low!==void 0?`:`:``}\n${R(n)}.`);let i=e.low===void 0?n-(o+t):o+t-n;if(i!==0)return i}return a()},Or=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=Nr(e[r],t[r],n);if(i!==0)return i}return 0},kr=(e,t,n)=>{let r=L(e);if(or(e)===`tuple`){let i=un(t)?Bi(t):void 0;return i?r.range.length-i.length||Or(r.range,i,n):Dr({...r,low:1},e,t,n)}if(or(e)===`record`){let i=Sr(t);if(!i){if(dn(t))return Cr(t,e,n);throw new y(`Attempted to ${Er(n)} record:\n${R(e)}\nwith non-record\n${R(t)}`)}return r.domain.length-i.domain.length||Or(r.domain,i.domain,n)||Or(r.range,i.range,n)}return Dr({...r,low:br(e,r.domain)},e,t,n)},Ar=(e,t)=>Un(e)||Un(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),jr=(e,t)=>{let n=fn(t)?t:I(t);return{elements:I(e).elements,otherElements:I(n).elements}},Mr=(e,t,n)=>{if(Ar(e,t))return n?+!mr(e,t):Xn(e,t);if(!fn(e))return Mr(I(e),t,n);if(!cn(t)){if(dn(t))return Cr(t,e,n);throw new y(`Attempted to ${Er(n)} the set ${R(e)} with the value:\n${R(t)}`)}let r=jr(e,t);return r.elements.length-r.otherElements.length||Or(r.elements,r.otherElements,n)},Nr=(e,t,n)=>{if(typeof e!=`object`){if(typeof t==typeof e)return n?e===t?0:1:Xn(e,t);if(dn(t))return Cr(t,e,n);throw new y(Tr(e,t,n))}return e.kind===`ModelValue`?(e.type!==void 0&&Dn(e,t,n),dn(t)?n?e.name===t.name?0:1:e.rank-t.rank:-1):un(e)?kr(e,t,n):Mr(e,t,n)},Pr=(e,t)=>Nr(e,t,!1),Fr=(e,t)=>Nr(e,t,!0)===0,Ir=e=>{let t=[];for(let n of e){let e=Rr(n,t);e.isFound||t.splice(e.index,0,n)}return t},Lr=(e,t)=>{let n=Hi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Rr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=Lr(e,()=>Pr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},zr=(e,t)=>t.some(t=>Lr(t,()=>Fr(t,e))),Br=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Vr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Vr)),e.kind===`Function`&&(e.domain.forEach(Vr),e.range.forEach(Vr)))},Hr=e=>{if(!(typeof e!=`object`||cr(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:I(e);return;case`FilteredSet`:case`Subset`:return Hr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(Hr(e.left),Hr(e.right));case`FunctionSet`:return Hr(e.domain),Hr(e.range);case`RecordSet`:return e.sets.forEach(Hr);case`ProductSet`:return e.factors.forEach(Hr)}},Ur=(e,t)=>Ui(mr,Fr,e,t),Wr=e=>{for(let t=1;t<e.length;t++)if(Xn(e[t-1],e[t])>=0)return!1;return!0},Gr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},Kr=e=>{for(let t=1;t<e.length;t++)fr(e[t]);if(e.length<2||Wr(e))return tr(e);let t=[...e].sort(Xn),n=[t[0]];for(let e=1;e<t.length;e++)Xn(n[n.length-1],t[e])!==0&&n.push(t[e]);return tr(n)},qr=e=>{if(Gr(e))return tr(e);let t=Ui(Kr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Jr=tr([]),Yr=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Xn(r[a],t)<0;)a++;a<r.length&&Xn(r[a],t)===0||i.push(t)}return i.length===n.length?e:tr(i)},Xr=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Xn(r[a],t)<0;)a++;a<r.length&&Xn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:tr(i)},Zr=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=Xn(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=tr(i);if(e.hash!==0&&e.hash!==_a){let t=e.hash,n=0;for(;n<a.length;n++){let e=Sa(a[n]);if(e===_a)break;t=t+ha(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Ta(a[e])|0;c.fingerprint=t}return c},Qr=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Xn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Xn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return rr(n,r)},$r=e=>{let t=Qr(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:gn(t,e.map(e=>e[0]))},ei=[],ti=/* @__PURE__ */ new Map,ni=[],ri=/* @__PURE__ */ new WeakMap,ii=e=>{let t=ei[e]??ti.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?ti.set(e,new WeakRef(n)):ei[e]=n,n},ai=e=>{if(Fi(e),e.low===1&&e.high>=1)return ii(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},oi=e=>e.length>0&&(e===ei[e.length]||e===ti.get(e.length)?.deref())||ri.has(e),si=e=>{let t=I(e).elements;return oi(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},ci=e=>{let t=ni[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return ni[e]=n,n},li=e=>ar(rr(ii(e.length),e),`tuple`),ui=e=>ar(Qr(e),`record`),di=(e,t)=>ar(rr(e,t),`record`),fi=e=>cn(e)&&!Un(e),pi=(e,t=!1)=>`UNION(${R(e.base,t)})`,mi=(e,t=e=>I(e).elements)=>{if(!fi(e.base))throw new y(`Attempted to enumerate the nonenumerable set:\n${pi(e)}`);return t(e.base)},hi=(e,t,n)=>{if(fi(e))return e;throw new y(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${R(e)}\nwhen enumerating:\n${pi(n)}`)},F=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return F(e.base);case`FunctionSet`:return F(e.domain)&&F(e.range)||gi(e.domain)===!0||gi(e)===!0;case`RecordSet`:return e.sets.every(F)||gi(e)===!0;case`ProductSet`:return e.factors.every(F)||gi(e)===!0;case`Union`:return F(e.base)&&(fn(e.base)?Br(e.base):Di(e.base)).every(F);case`SetOperation`:return e.operator===`\\cup`?F(e.left)&&F(e.right):e.operator===`\\cap`?F(e.left)||F(e.right):F(e.left);default:return!1}},gi=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=gi(e.domain);return t===void 0?void 0:!t&&gi(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=gi(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return F(e)?I(e).elements.length===0:void 0;default:return}},_i=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},vi=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},yi=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Un(e.base))return;let t=I(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:vi(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return tr(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},bi=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(tr(r.map(t=>e[t])));while(vi(r,e.length))}return t},xi=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Un(a))throw new y(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},Si=(e,t=e=>I(e).elements)=>{if(typeof e!=`object`)throw new y(`Expected a set but found ${R(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Ir(e.elements);case`Interval`:{let t=ai(e);return t!==ei[t.length]&&ri.set(t,e),t}case`Subset`:{if(Fi(e.base)===0)return bi([]);if(!cn(e.base))throw new y(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${P(R(e.base))}`);let t=I(e.base).elements;if(t.length>30)throw new y(Pi(e));return bi(t)}case`FunctionSet`:{if(!Nn&&Mi(e))return[];if(Un(e.domain))throw new y(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${R(e.domain)}\ncannot be enumerated.`);let n=si(e.domain);if((n.length>0||Nn)&&Un(e.range))throw new y(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${R(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return _i(n.map(()=>r)).map(e=>rr(n,e))}case`RecordSet`:{if(!Nn&&Mi(e))return[];let n=xi(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${R(t)}`);return _i(n).map(t=>ui(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Nn&&Mi(e))return[];let n=xi(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${R(e)}`);return _i(n).map(li)}case`FilteredSet`:if(!cn(e.base)||Un(e.base))throw new y(`Attempted to enumerate { x \\in S : p(x) } when S:\n${R(e.base)}\nis not enumerable`);return I(qr(Di(e.base).filter(t=>e.test(t,!1)))).elements;case`Union`:{let t=[];return mi(e).forEach((n,r)=>{let i=hi(n,r,e);if(on(i))throw new s(rn());Di(i).forEach(e=>an(t,e))}),I(qr(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!fi(e.left)&&!fi(e.right))throw new y(`Attempted to enumerate S \\cap T when neither S:\n${R(e.left)}\nnor T:\n${R(e.right)}\nis enumerable`);if(e.operator===`\\`&&!fi(e.left))throw new y(`Attempted to enumerate S \\ T when S:\n${R(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return I(qr(wi(e))).elements;let t=e.operator===`\\`||fi(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return sn(typeof n==`object`&&n.kind===`Interval`?n:Di(n),t=>{Gi(t,r)===(e.operator===`\\cap`)&&an(i,t)}),I(qr(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to enumerate the non-enumerable set ${R(e)}`);default:throw new y(`Expected a set but found ${R(e)}`)}},I=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return tr(Si(e));let t=typeof e==`object`&&Zt(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Hi.sets;n?.push(e);let r=Si(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?tr(r):Kr(r);return t&&(t.enumerated=i),i},Ci=e=>{if(!(typeof e!=`object`||cr(e)))switch(e.kind){case`MixedSet`:I(e);return;case`FilteredSet`:return fi(e.base)||I(e),Ci(e.base);case`Union`:if(!fn(e.base)&&fi(e.base))return Ci(e.base);mi(e).slice(0,1).forEach(t=>Ci(hi(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!fi(e.left)&&I(e),e.operator!==`\\cup`||fi(e.left)&&fi(e.right)||I(e),e.operator!==`\\cap`||fi(e.left)?Ci(e.left):Ci(e.right),e.operator===`\\cup`&&Ci(e.right)}},wi=e=>{if(!fi(e.left)||!fi(e.right))throw new y(`Attempted to enumerate S \\cup T when S:\n${R(e.left)}\nand T:\n${R(e.right)}\nare not both enumerable`);if(Ci(e.left),Ci(e.right),on(e.left))throw new s(rn());let t=Di(e.left),n=on(e.right)?void 0:Di(e.right);if(!n||t.length+n.length>nn())throw new s(rn());return[...t,...n]},Ti=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return I(e).elements;let t=Lr(e,()=>wi(e)),n=I(qr(t)).elements;return e.enumerated=tr(n),n},Ei=(e,t)=>{if(typeof e!=`object`||cr(e))return I(e).elements.some(t);let n=Hi.sets;n?.push(e),Ci(e);let r=ji(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Di=e=>{let t=[];return Ei(e,e=>(t.push(e),!1)),t},Oi=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,ki=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(ki);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(ki)&&e.range.every(ki);case`SetOperation`:return e.operator!==`\\cup`&&ki(e.left)&&ki(e.right);case`FilteredSet`:return ki(e.base);case`ProductSet`:return e.factors.every(ki);default:return!1}},Ai=e=>typeof e!=`object`||cr(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Ai(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Ai(e.left)||Ai(e.right):Oi(e)?.some(Ai)??!1,ji=(e,t)=>{if(e.kind===`Union`)return mi(e,Di).some((n,r)=>Ei(hi(n,r,e),t));if(e.kind===`FilteredSet`&&fi(e.base))return Ei(e.base,n=>e.test(n,!1)&&t(n));if(Oi(e)?.some(Ai))return Si(e,Di).some(t);if(e.kind!==`SetOperation`)return I(e).elements.some(t);if(e.operator===`\\cup`)return!fi(e.left)||!fi(e.right)?I(e).elements.some(t):Ei(e.left,t)||Ei(e.right,t);let n=e.operator===`\\`||fi(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return fi(r)?Ei(r,n=>Gi(n,i)===(e.operator===`\\cap`)&&t(n)):I(e).elements.some(t)},Mi=e=>{if(typeof e!=`object`||!cn(e))throw new y(`Shouldn't call isEmpty() on value ${R(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new y(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(Mi);case`RecordSet`:return e.sets.some(Mi);case`FunctionSet`:return!Mi(e.domain)&&Mi(e.range);case`Union`:return mi(e).every((t,n)=>Mi(hi(t,n,e)));default:return I(e).elements.length===0}},Ni=(e,t,n)=>e.reduce((e,r)=>{let i=e*Fi(r,t);if(i>2147483647)throw new y(n());return i},1),Pi=e=>`Overflow when computing the number of elements in:\n${R(e)}`,Fi=(e,t)=>{if(typeof e!=`object`)throw new y(`Attempted to compute the number of elements in the ${pn(e)} ${R(e)}.`);switch(e.kind){case`ModelValue`:throw new y(`Attempted to compute the number of elements in the model value ${R(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return Fi(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new y(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to compute the number of elements in the overridden value ${R(e)}.`);case`Subset`:{let n=Fi(e.base,t);if(n>=31)throw new y(Pi(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(Mi(e.domain))return 1;if(Mi(e.range))return 0;if(Fi(e.range,t)===1)return 1}let n=Fi(e.domain,t),r=Fi(e.range,t);if(r<=1)return n===0?1:r;let i=1;for(let t=0;t<n;t++)if(i*=r,i>2147483647)throw new y(Pi(e));return i}case`RecordSet`:return t!==`1.7.4`&&Mi(e)?0:Ni(e.sets,t,()=>Pi(e));case`ProductSet`:return t!==`1.7.4`&&Mi(e)?0:Ni(e.factors,t,()=>`Overflow when computing the number of elements in ${R(e)}`);default:return fr(e),I(e).elements.length}},Ii=e=>`Attempted to check if the set ${R(e)}is finite.`,Li=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new y(`Attempted to check if the ${pn(e)} ${R(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new y(`Attempted to check if the function:\n${R(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Li(e.base)&&Mi(e.base);case`Subset`:return Li(e.base);case`FunctionSet`:{let t=Li(e.domain);if(t&&Mi(e.domain))return!0;let n=Li(e.range);return n&&Mi(e.range)?!0:n&&(t||Fi(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n=!0;for(let e of t)if(!Li(e))n=!1;else if(Mi(e))return!0;return n}case`Union`:if(!fi(e.base))throw new y(`Attempted to check if the nonenumerable set:\n${pi(e)}\nis a finite set.`);return I(e.base).elements.every(Li);case`SetOperation`:if(e.operator===`\\cup`)return Li(e.left)&&Li(e.right);if(e.operator===`\\cap`){if(!Li(e.left)&&!Li(e.right))throw new y(Ii(e));return!0}if(Li(e.left))return!0;if(!Li(e.right))throw new y(Ii(e));return!1;case`FilteredSet`:if(!Li(e.base))throw new y(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${R(e.base)}\nis finite.`);return!0}},Ri=(e,t,n=Xn)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},zi=(e,t)=>{let n=e.elements;if(n.length>nn())throw new s(rn());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=Ri(n,e);return!r[t]&&(r[t]=!0,!0)}),a=tr(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},Bi=e=>{if(typeof e!=`object`||!un(e))return;if(e.kind===`LazyFunction`&&(!cn(e.domain)||Un(e.domain)))throw new y(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=L(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Vi=(e,t)=>{let n=`Attempted to check if the value:\n${R(e)}\nis an element of the`;if(!un(t))return`${n} ${pn(t)} ${R(t)}`;let r=or(t);return r===`record`?`Attempted to check if element:\n${R(e)}\nis in the record:\n${R(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${R(t)}`},Hi={sets:void 0},Ui=(e,t,n,r)=>{let i=Hi.sets,a=Hi.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof y))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Wi=e=>(Hi.sets??[]).slice(e).some(e=>typeof e==`object`&&Hi.callStack?.sources.has(e)===!0),Gi=(e,t)=>{let n=Hi.sets;if(n===void 0)return Xi(e,t);n.push(t);let r=Xi(e,t);return n.pop(),r},Ki=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},qi=(e,t)=>Ri(t.elements,e)!==-1,Ji=(e,t)=>t.isNormalized?Rr(e,t.elements).isFound:zr(e,Br(t)),Yi=(e,t)=>{if(e.type!==void 0)throw new y(`Attempted to check if the typed model value ${P(R(e))} is an element of\n${P(R(t))}`);return!1},Xi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return Ki(e,t)??Zi(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return Zi(e,t)},Zi=(e,t)=>{if(!cn(t))throw new y(Vi(e,t));switch(t.kind){case`Set`:return fr(e),Ui(qi,Ji,e,t);case`MixedSet`:return zr(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&(!dn(e)||e.type!==void 0))throw new y(`Attempted to check if the value:\n${R(e)}\nis in the integer interval ${R(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(dn(e))return Yi(e,t);if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new x(`Attempted to check if the value:\n${R(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!cn(e)||Un(e))throw new y(`Attempted to check if the non-enumerable value\n${P(R(e))}\nis element of\n${P(R(t))}`);return I(e).elements.every(e=>Gi(e,t.base));case`FunctionSet`:{if(!un(e)){if(dn(e))return Yi(e,t);throw new y(`Attempted to check if \n${R(e)}\nwhich is not a TLC function value, is in the set of functions:\n${P(R(t))}`)}let n=L(e),r=br(e,n.domain);return(r===void 0?Ur(t.domain,tr(n.domain)):Ur({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Gi(e,t.range))}case`RecordSet`:{let n=un(e)?L(e):void 0;if(!n||!Sn(n.domain)){if(dn(e))return Yi(e,t);throw new y(`Attempted to check if non-record\n${R(e)}\nis in the set of records:\n${R(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Ri(n.domain,e);return i!==-1&&Gi(n.range[i],t.sets[r])})}case`ProductSet`:{let n=un(e)?Bi(e):void 0;if(n===void 0){let n=un(e)&&L(e).domain.every(e=>typeof e==`number`);if(dn(e))return Yi(e,t);if(n)return!1;throw new y(`Attempted to check if non-tuple\n${R(e)}\nis in the set of tuples:\n${R(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>Gi(e,t.factors[n]))}case`FilteredSet`:try{return Gi(e,t.base)&&t.test(e,!0)}catch(n){throw!(n instanceof y)||!Mt(n)?n:new y(`Cannot decide if element:\n${P(R(e))}\n is element of:\n${P(R(t.base))}\nand satisfies the predicate ${t.source?.predicate}`)}case`Union`:{if(!fi(t.base))throw new y(`Attempted to check if:\n ${R(e)}\nis an element of the non-enumerable set:\n ${pi(t)}`);let n=I(t.base).elements;return n.length>1&&n.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),n.some(t=>Gi(e,t))}case`SetOperation`:return t.operator===`\\cup`?Gi(e,t.left)||Gi(e,t.right):Gi(e,t.left)&&Gi(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Bi(e);if(n===void 0){if(dn(e))return Yi(e,t);throw new x(`Attempted to check if the value:\n${P(R(e))}\nis an element of ${P(R(t))}.`)}return n.every(e=>Gi(e,t.base))}default:throw new y(Vi(e,t))}},Qi=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?Gi(e,n):e.range.every((e,r)=>Qi(e,t.range[r],n.range)),L=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(F(e.domain)||Fi(e.domain),!cn(e.domain))throw new y(`The domains of formal parameters must be enumerable.`);let t=si(e.domain);return e.enumerated=ar(rr(t,t.map(t=>e.apply(t))),or(e)),e.enumerated}throw new y(`Expected a function but found ${R(e)}`)},$i=(e,t,n)=>{let r=P(R(e)),i=P(R(t)),a=n===`1.7.4`;switch(or(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},ea=(e,t)=>{if(!Nn)return $i(e,t);let n=P(R(t));return or(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},ta=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},na=e=>new y(`Attempted to apply function with integer domain to the non-integer argument ${P(R(e))}`),ra=(e,t)=>Ri(e.domain,t),ia=(e,t,n)=>{let r=_n(e);throw Nn||r!==e.domain||r.length<32?r.forEach(e=>Fr(e,t)):Ri(r,t,Pr),n},aa=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=or(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new y(n(e,t));if(a===void 0&&!Nn&&typeof t!=`number`&&oi(r))throw na(t)}let i=ta(r,t);return i===-1?Ui(ra,ia,e,t):i},oa=(e,t,n)=>{let r=e.domain,i=Bi(n),a=(t,n,r)=>`In applying the function\n${P(R(e))},\nthe ${t} is:\n${P(R(n))}\nwhich ${r}.\n`,o=()=>new y(a(`argument list`,n,`does not match its formal parameter`));if(i===void 0)throw o();if(typeof r!=`object`||r.kind!==`ProductSet`)throw new y(`Attempted to apply a function to ${R(n)}, which is not in its domain`);if(t.forEach((e,t)=>{if(t>=i.length)throw o();let n=i[t],s=`argument number ${t+1}`;if(!Gi(n,r.factors[t]))throw new y(a(s,n,e===void 0?`is not in the function's domain ${R(r)}`:`is not in its domain`));if(e!==void 0&&Bi(n)?.length!==e)throw new y(a(s,n,`does not match its formal parameter`))}),i.length>t.length)throw o()},sa=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!Gi(t,e.lambdaDomain),ca=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return ca(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return oa(e,r,t),e.apply(t);if(!Gi(t,e.domain))throw new y(or(e)===`lambda`?$i(e,t):`Attempted to apply a function to ${R(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new y(`Attempted to apply ${R(e)}, which is not a function`);let r=n??$i;if(sa(e,t))throw new y(r(e,t));let i=aa(e,t,r);if(i===-1)throw new y(r(e,t));return e.range[i]},la=e=>oi(e)?ri.get(e)??ci(e.length):void 0,ua=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=L(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=la(t.domain);if(n)return n;let r=tr(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},da=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(!Gi(t,e.domain))return e;let r=n(e.apply(t));return ar({kind:`LazyFunction`,domain:e.domain,apply:n=>Ur(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},or(e))}if(!un(e))throw new y(`Attempted to apply EXCEPT construct to the value ${P(R(e))}.`);let i=L(e);if(sa(i,t))return i;let a=aa(i,t,ea);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=ar(rr(i.domain,o),or(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==_a){let e=Sa(c);if(e!==_a){let t=Sa(i.domain[a]);l.hash=s===c?i.hash:i.hash-ga(t,Sa(s))+ga(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Ea(e,s)+Ea(e,c)|0}return l},fa=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},pa=(e,t)=>Math.imul(e^t,16777619),ma=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return fa(t)},ha=e=>fa(e+2654435769|0),ga=(e,t)=>fa(Math.imul(e,668265261)+t|0),_a=795548749,va=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Sa(t[e]);if(r===_a)return _a;n=n+ha(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Sa(e.domain[n]),i=Sa(e.range[n]);if(r===_a||i===_a)return _a;t=t+ga(r,i)|0}return t},ya=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new y(`TLC has found a state in which the value of a variable contains ${R(e)}`);if(cn(e)){I(e).elements.forEach(ya);return}let t=L(e);t.domain.forEach(ya),t.range.forEach(ya)},ba=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Sa(e)===_a&&ya(e);return}catch(e){if(!(e instanceof y))throw e;return e}},xa=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Sa=e=>typeof e==`number`?fa(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?ma(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=va(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?F(e.domain)?Sa(L(e)):_a:F(e)?Sa(I(e)):_a,Ca=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},wa=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Ca(t)},Ta=e=>Ca(Oa(e)+2135587861|0),Ea=(e,t)=>Ca(Math.imul(Oa(e),374761393)+Oa(t)|0),Da=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Ta(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Ea(e.domain[n],e.range[n])|0;return t},Oa=e=>typeof e==`number`?Ca(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?wa(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Da(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Oa(L(e)):F(e)?Oa(I(e)):wa(ka(e)),ka=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Aa(e),Aa=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ka(e.base)}>`;if(e.kind===`FilteredSet`&&!F(e))throw new y(`Attempted to compare the non-enumerable set ${R(e)} with another value`);if(cn(e))return F(e)?`{${I(e).elements.map(ka).join(`,`)}}`:`<${e.kind} ${R(e)}>`;let t=L(e);return`(${t.domain.map((e,n)=>`${ka(e)}:${ka(t.range[n])}`).join(`,`)})`},ja={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},Ma=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>ja[e])}"`,Na=1999,Pa=e=>e.reduce((e,t)=>e===0?0:e*Fi(t),1),Fa=e=>{if(e.kind===`Subset`)return Fi(e.base)<=6?I(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return I(e);if(e.kind===`FunctionSet`){let t=Mi(e.domain)?0:Fi(e.domain);return(t===0?1:Fi(e.range)**t)<=Na?I(e):void 0}return Pa(e.kind===`RecordSet`?e.sets:e.factors)<=Na?I(e):void 0},Ia=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&un(e.base)&&(e.base.kind===`Function`||F(e.base.domain)))return Fa(e);if(F(e))try{return Fa(e)}catch(e){if(e instanceof y)return;throw e}},La=(e,t)=>{let n=e=>R(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return pi(e,t)}},Ra=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),za=e=>{if(F(e.domain))try{return L(e)}catch(e){if(e instanceof y||C(e))return;throw e}},Ba=e=>{let t=[],n=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:if(e.elements.forEach(n),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(n),I(e);return;case`Function`:e.range.forEach(n);return;case`LazyFunction`:n(e.enumerated??e.domain);return;case`SetOperation`:n(e.left),n(e.right);return;case`FunctionSet`:n(e.domain),n(e.range);return;case`RecordSet`:e.sets.forEach(n);return;case`ProductSet`:e.factors.forEach(n);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:n(e.base);return;default:return}};try{return e.forEach(n),e.map(e=>R(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1})}},R=(e,t=!1,n=!1)=>{let r=e=>R(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Ma(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(I(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Pn.isExpanded?Ia(e,t):void 0;return n?r(n):La(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Pn.isExpanded||!e.source?za(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${R(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Nn&&or(e)!==`tuple`)return`<< >>`;let a=r=>R(r,t,n&&or(e)!==`lambda`);if(i.domain.length===0&&or(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):yn(i);return or(e)===`record`||i.domain.every(e=>typeof e==`string`&&Ra(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},Va=(e,t)=>{if(e===void 0)return!1;try{return mr(e,t)}catch(e){if(e instanceof y)return!1;throw e}},Ha=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Ua=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(Ha,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
74
+ `;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(ht(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},Wa=(e,t)=>{let n=t?void 0:In.get(e);if(n)return n();let r=Object.entries(e),i=Rn.get(e),a=i!==void 0&&`_format`in e,o=a?e._format:r.length===1?`%s = %s
75
75
  `:`/\\ %s = %s
76
- `;if(typeof o!=`string`)throw new b(`The _format field of the ALIAS ${i} is ${R(o)}, but it must be a string.`);return r.filter(([e])=>!(a&&e===`_format`)).filter(([e,n])=>!t||!Va(t[e],n)).map(([e,t])=>{let n=Ua(o,[e,N(R(t))]);if(n===void 0)throw new b(`The _format field of the ALIAS ${i} is ${R(o)}, but it must format two strings, the name and the value of a field.`);return n}).join(``)},Ga=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let Ka=Ga[0];const qa=()=>Ka,Ja=/* @__PURE__ */ new Int32Array(256),Ya=/* @__PURE__ */ new Int32Array(256),Xa=/* @__PURE__ */ new Int32Array(256),Za=/* @__PURE__ */ new Int32Array(256),Qa=/* @__PURE__ */ new Int32Array(256),$a=/* @__PURE__ */ new Int32Array(256),eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256);let no=0,ro=0,io=0,ao=0;const oo=e=>{let t=(e^ao)&255;ao=(ao>>>8|io<<24)^Qa[t],io=io>>>8^Ja[t]},so=e=>{let t=Ga[e];Ka=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);Ja[e]=Number(BigInt.asIntN(32,t>>32n)),Qa[e]=Number(BigInt.asIntN(32,t))}let i=[Ja,Ya,Xa,Za],a=[Qa,$a,eo,to];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^Qa[o],i[e][r]=t[r]>>>8^Ja[o]}}no=Number(BigInt.asIntN(32,t>>32n)),ro=Number(BigInt.asIntN(32,t))};so(0);const co=e=>{let t=ao^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;ao=io^to[n]^eo[r]^$a[i]^Qa[a],io=Za[n]^Xa[r]^Ya[i]^Ja[a]},lo=e=>{if(typeof e==`boolean`)return oo(0),oo(e?116:102),2;if(typeof e==`number`)return oo(1),co(e),5;if(typeof e==`string`){oo(3),co(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)co(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)oo(e.charCodeAt(n));return 5+e.length}return oo(21),co(Vn(e.name)+1),5},uo=e=>{if(typeof e!=`object`||dn(e))lo(e);else if(un(e)){let t=L(e);oo(9),co(t.domain.length);for(let e=0;e<t.domain.length;e++)uo(t.domain[e]),uo(t.range[e])}else{let t=I(e).elements;oo(5),co(t.length);for(let e of t)uo(e)}},fo=e=>{let t=io,n=ao;io=no,ao=ro;for(let t of e)uo(t);let r=BigInt(io>>>0)<<32n|BigInt(ao>>>0);return io=t,ao=n,r},po=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=io,a=ao;return e.forEach((e,n)=>{io=no,ao=ro;for(let n of t)uo(e[n]);r[2*n]=ao,r[2*n+1]=io}),io=i,ao=a,n},mo=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),ho=1024,go=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*ho),relations:[]}),_o=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},vo=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,yo=(e,t,n,r,i)=>{let a=t===`next`?vo(e,t,r):void 0;if(a!==void 0)return a;let o=_o(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},bo=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,xo=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?g(a):`Unknown location`}`:bo(r.body.location.range,a)||!a?`${r.name} ${g(i)}`:`${r.name} ${g(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},So=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,Co=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,wo=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},To=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(gt(t.name)&2147483647)%e.length].unshift(t));t=e}t[(gt(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Eo=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Do=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Oo=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),ko=(e,t,n)=>{let r=new Set(n.map(So)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(M(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!mo.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=_o(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(So(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?Oo(t.bounds):t.params.map(e=>e.name);m(t.body,Do(n,e.scope)),t.kind===`Function`&&Eo(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Do(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,Do(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),To(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,Co(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,wo(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,Co(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Do(Oo(e.bounds),t)),r(Eo(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Do(Oo(e.bounds),t)),r(Eo(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Do(Oo([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Do(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Do(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},Ao=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=Ao(e,r,n);if(t!==-1)return t}}return-1},jo=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=Ao(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:Ao(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Mo=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},No=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Po=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Fo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},Io=(e,t)=>t.forEach((t,n)=>{let r=fo([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*ho+i;e.registers[o]=Math.max(e.registers[o],Fo(a)+1)}),Lo=(e,t)=>{let n=e.registers.subarray(t*ho,(t+1)*ho),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*ho*ho/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*ho?a===0?i:ho*Math.log(ho/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},Ro=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},zo=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>Ro(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},Bo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},Vo=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],Ho=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},Uo=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},Wo=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||Vo(e,t))&&Bo(n,a),Ho(e,t).forEach(e=>i(e).forEach(e=>Bo(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?g(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=Ho(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>Bo(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=Vo(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,zo(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return Ho(e,t).forEach(e=>{i(e),s(e,0)}),n},Go=[`init`,`next`,`invariant`,`constraint`,`implied`],Ko=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,qo=e=>Go.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>Ko(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||Ko(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),Jo=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?g(i):`Unknown location`}`,distinct:Lo(e,r)}}),relations:qo(e).map(t=>({kind:t.kind,label:t.label,...Uo(e,t),expressions:Wo(e,t.node)}))}),Yo=(e,t,n)=>{let r=vo(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},Xo=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),Zo=(e,t)=>Xo.has(e)?new y(t):new c(t),Qo=(e,t,n,r)=>new c(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${R(r)}`),$o=(e,t,n=e)=>{if(!P(e)||Un(e))throw new c(`Applying ${t} to the following value,\nwhich is not a finite set:\n${R(n)}`);return I(e)},es=e=>typeof e==`object`&&e.kind===`Operator`,z=(e,t,n)=>{let r=e[t];if(r===void 0||es(r))throw Zo(n,`${n} expects a value as argument ${t+1}`);return r},ts=(e,t,n)=>{let r=z(e,t,n);if(typeof r!=`boolean`)throw Zo(n,`${n} expects a boolean but received ${R(r)}`);return r},ns=(e,t,n)=>{let r=e[t];if(r===void 0||!es(r))throw Zo(n,`${n} expects an operator as argument ${t+1}`);return r},rs=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),B=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),is=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),as=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),os=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(z(n,0,e),z(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),ss=e=>e>2147483647||e<-2147483648,cs=e=>new c(`Overflow when computing ${e}`),ls={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`},us={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},ds={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`},fs={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},ps=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return us[e.operator];if(e.kind!==`Function`)return ls[e.kind];let t=or(e);return t===void 0?`FcnRcdValue`:fs[t]},ms=e=>ds[ps(e)],hs=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),gs=(e,t)=>{let n=n=>(...r)=>{let i=Hi.sets?.length??0;try{return n(...r)}catch(n){if(!(n instanceof y)||n instanceof ne)throw n;let r=Wi(i);throw Hi.sets&&(Hi.sets.length=i),e.isLazy!==!0&&n instanceof c&&!r?n:hs(t,n.message)}},r=n(e.evaluate);return{...e,evaluate:(n,i)=>{if(n.length!==e.arity)throw hs(t,`array is not of length ${e.arity}`);return r(n,i)},evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},_s=(e,t)=>{if(typeof e!=`number`)throw hs(t,`Cannot cast tlc2.value.impl.${ps(e)} to tlc2.value.impl.IntValue`);return e},vs=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,ys=(e,t,n,r)=>{let i=vs(e,n,`IntValue`,2);return os(t,(e,n)=>{let a=_s(n,i),o=_s(e,i),s=r(o,a);if(ss(s))throw cs(`${o}${t}${a}`);return s})},bs=(e,t,n)=>{if(typeof e!=`number`)throw new c(`The ${t} argument of ${n} should be an integer, but instead it is:\n${R(e)}`);return e},xs=(e,t,n=e)=>os(e,(e,r)=>t(bs(e,`first`,n),bs(r,`second`,n))),Ss=(e,t,n)=>({...as(e,t,n),isLazy:!0}),Cs=(e,t,n)=>{let r=ns(e,t,n);return()=>r.call([])},ws=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),Ts=()=>({implication:Qh,negate:$h,equivalent:eg,body:tg,condition:(e,t)=>{if(typeof e!=`boolean`)throw Fh(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Ih(t,n,e);return e},apply:ca,expectFunction:Jh,tuple:li,set:qr,record:di,writtenRecord:bn,equal:mr,enumerate:cg,choiceElements:P_,noChoice:e=>{throw F_(e)},filterPredicate:N_,isReducible:ln,finiteElements:e=>I(e).elements,addBounded:on,normalizedSet:nr,isBeyondBound:sn,cardinality:Fi,functionDomain:si,sortedFunction:rr,unassigned:(e,t)=>{throw Uh(e,t)},prime:i_,keepLazyContext:Yh,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Kh(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Es,Ds;const Os=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},ks=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),As=e=>`local${e.counter++}`,js=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e);return n!==void 0&&t.add(n),mt(e).forEach(e=>js(e,t)),t},Ms=(e,t,n)=>{let r=js(t),i=[...n.locals].filter(([e])=>r.has(e));if(i.length===0)return n.context;let a=ks(e,i.map(([e])=>e));return`extend(${n.context}, ${a}, [${i.map(([,e])=>e).join(`, `)}])`},Ns=(e,t,n)=>`${ks(e,f_(t,e.environment))}(${Ms(e,t,n)})`,Ps=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},Fs=(e,t,n,r)=>{let i=As(e),a=As(e),o=As(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},Is=(e,t,n)=>{let r=t.kind===`Forall`;return Ps(e,n,n=>{let i=t.bounds.map(()=>As(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${Us(e,r.set,n)}, ${ks(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=As(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${Us(e,t.body,n)}, ${ks(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>Fs(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Ls=(e,t,n,r,i)=>Ps(e,i,i=>{let a=As(e),o=As(e),s=ks(e,t),c=`choiceElements(${Us(e,n,i)}, ${s}, ${ks(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${Us(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${Fs(e,a,o,l)} return noChoice(${s});`}),Rs=(e,t,n,r)=>Ps(e,r,r=>{let i=As(e),a=As(e),o=As(e),s=As(e),c=ks(e,t),l=`if (!isReducible(${i})) return ${ks(e,M_(t,e.environment))}(${i}, ${Ms(e,t,r)});`,u=Us(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${Us(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${Fs(e,a,s,d)} return normalizedSet(${o});`}),zs=(e,t,n,r)=>Ps(e,r,r=>{let i=As(e),a=As(e),o=As(e),s=As(e),c=As(e),l=As(e),u=ks(e,k_(t,e.environment)),d=Ms(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=Us(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${Us(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${Fs(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),Bs=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=Us(e,r[0],n),a=Us(e,r[1],n),o=ks(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${Us(e,r[0],n)}, ${ks(e,t)})`;if(t.operator===`<=>`)return`equivalent(${Us(e,r[0],n)}, ${Us(e,r[1],n)}, ${ks(e,t)})`;if(M(t))return Ns(e,t,n);let i=Fg(t.operator,e.environment);if(i?.kind!==`Builtin`)return Ns(e,t,n);if(i.name===`DOMAIN`)return`${ks(e,zh(t))}(${Us(e,r[0],n)})`;if(i.name===`TLCEval`)return Ns(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${ks(e,Bh(t,i))}(${Us(e,r[0],n)}, ${Us(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&h_(r[0],a))return`${ks(e,i.evaluateUnary)}(${Us(e,r[0],n)})`;let o=r.length===2&&h_(r[0],a)&&h_(r[1],a);return i.evaluateBinary&&o?`${ks(e,i.evaluateBinary)}(${Us(e,r[0],n)}, ${Us(e,r[1],n)})`:Ns(e,t,n)},Vs=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(M(e))return!1;let r=Kg(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Vs(e.expression,t,n);case`FieldAccess`:return Vs(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Vs(e,t,n));default:return!1}},Hs=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Hs(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Hs);default:return!1}},Us=(e,t,n)=>{let r=(t,r=n)=>Us(e,t,r);switch(t.kind){case`Number`:return mn(t.value)?String(t.value):Ns(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(M(t))return Ns(e,t,n);let i=Kg(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=ks(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?ks(e,i.value):Ns(e,t,n)}case`Apply`:return Bs(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=ks(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)}, ${ks(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{w_(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Vs(t.function,n,e.environment)?r(t.function):Hs(t.function)?r(t.function,i):Ns(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${ks(e,t)}))`,o=Rh(e.environment.runtime.version),s=o?`, ${ks(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`${ks(e,Lh(t))}(${r(t.record)})`;case`Record`:{let i=L_(t.fields);if(R_(i))return Ns(e,t,n);let a=ks(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}, ${ks(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?Ns(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Is(e,t,n):Ns(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Ls(e,t,t.set,t.pattern.name,n):Ns(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!O_(t)?zs(e,t,r.pattern.name,n):Ns(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Rs(e,t,t.bound.pattern.name,n):Ns(e,t,n);default:return Ns(e,t,n)}},Ws=(e,t)=>{if(!ws.has(e.kind)||(Ds??=Os(),!Ds))return;let n={environment:t,references:[],helpers:[],counter:0},r=Us(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
77
- `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return Es??=Ts(),Function(...Object.keys(Es),...i,a)(...Object.values(Es),...n.references)},Gs={kind:`Local`},Ks=/* @__PURE__ */ new WeakSet,qs=/* @__PURE__ */ new WeakMap,Js=/* @__PURE__ */ new WeakMap,Ys=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Xs=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),Zs=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Qs=e=>e.kind===`Operator`?e.params.length:0,$s=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],ec=e=>e.name.includes(`!`),tc=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},nc=(e,t,n)=>{let r=t.bindings.get(e);return r&&Zs(r.position,t.location)&&(!n||Zs(r.position,n.start))?r:void 0},rc=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),ic=(e,t,n,r)=>{if(t===void 0)return!0;if(rc(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=g(i),o=t.range&&g(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},ac=(e,t,n,r)=>ic(t,tc(e,t)??nc(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,oc=(e,t,n)=>{ic(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},sc=(e,t,n,r)=>t.reduce((e,t,i)=>ac(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),cc=(e,t,n)=>t.reduce((e,t)=>ac(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),lc=e=>e.kind===`Name`?[e.name]:e.names,uc=e=>e.flatMap(e=>lc(e.pattern)),dc=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Zs(n.location,t.location))?n:void 0},fc=(e,t)=>{let n=dc(e,t);return n?{key:t.getKey(n),arity:Qs(n),params:$s(n),kind:`Definition`}:t.imported.get(e)},pc=(e,t,n)=>tc(t,e)??fc(e,n),mc=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),hc=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:mc(e.location,e.spelling??t)},gc=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return Zs(e.location,e.args[0].location)?`prefix`:`postfix`}},_c=e=>!/^[\p{L}\d_]/u.test(e),vc=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),yc=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,bc=(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])}})},xc=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?bc(e.name,[],void 0):bc(e.operator,e.args,e.argumentCounts),Sc=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Cc=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:uc(e.bounds),body:e.body,sets:Sc(e.bounds)};case`SetMap`:return{names:uc(e.bounds),body:e.expression,sets:Sc(e.bounds)};case`SetFilter`:return{names:lc(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:lc(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}},wc=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}},Tc=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Ec=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Dc=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Dc(e.body,t):mt(e).reduce((e,n)=>e??Dc(n,t),void 0)},Oc=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Oc(i,t,n||Ec(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Dc(e.set,t):Dc(e,t)},kc=e=>e.kind===`Label`?kc(e.body):e,Ac=e=>typeof e==`number`?`argument selector ${e}`:e,jc=`within the scope of a declaration
78
- from outside that declaration's scope.`,Mc=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:g(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&kc(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:Oc(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?Dc(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&Ec(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${jc}`);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=Ac(n.operand);if(l.isSufficesOpen){if(yc(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=kc(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?pc(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=Cc(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:wc(e);if(!c)return;let f=yc(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=yc(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(Ec(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${jc}`);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.`))},Nc=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:g(e.location.range),message:n}),!0)},Pc=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=g(r),a=e.params.filter((r,i)=>{let a=tc(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:g(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},Fc=(e,t,n,r)=>{if(!Tc(e))return!1;let i=xc(e),a=i[0],o=i.length>1&&a.kind===`Name`?tc(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Mc(e,i,o,t,n,r),o!==void 0},Ic=(e,t,n,r)=>{let i=e.location;if(Kc(e,n,r))return;let a=Js.get(e);if(a!==void 0)return a;if(Ys(t))return e.kind===`Apply`?e.args.length:0;let o=tc(n,t);if(o?.isNonFact){r.errors.push({location:g(hc(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(Fc(e,n,r,!1)||vc(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=Gs),o)return o.arity;let s=fc(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Js.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(tc(n,c)!==void 0||fc(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=g(e.kind===`Apply`&&l===`-.`?mc(i,`-`):hc(e,t));if(!_c(t)||vc(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=gc(e);d&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},Lc=(e,t,n)=>(e.forEach(e=>V(e.set,t,n)),e.reduce((e,t)=>sc(e,lc(t.pattern),t.pattern.ranges,n),t)),Rc=(e,t)=>e.kind===`Identifier`&&e.name===t&&M(e)||mt(e).some(e=>Rc(e,t)),zc=(e,t)=>{e.kind===`FunctionConstruction`&&Rc(e.body,t)&&(e.isRecursive=!0),mt(e).forEach(e=>zc(e,t))},Bc=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?uc(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:g(o),message:e})},c=e.kind===`Function`?Lc(e.bounds,t,i):cc(t,e.params,i),l=tc(c,a)??nc(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(V(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),zc(e.body,a),e.isSelfReferential=Rc(e.body,a)):V(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:ic(a,tc(t,a)??nc(a,i,o),{kind:`Definition`,arity:Qs(e),range:o},i)},Vc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(tc(e,t.name)?.isPending)return e;let n={name:t.name,arity:Qs(t),params:$s(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)=>Qc(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Ys(t.name)?e:s(e,e=>!Zs(t.location,e.location)),o={name:t.name,arity:Qs(t),kind:`Definition`,range:t.location.range,parent:a};if(ec(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Ys(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Bc(t,a,u,i)?{...o,params:$s(t)}:a},a),()=>!0)},Hc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:tc(t,r)??nc(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Uc=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=Hc(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:g(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},Wc=(e,t,n)=>{if(Uc(e,t,n))return;let r=e.operator,i=pc(r,t,n),a=Ic(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:g(e.argumentsRange??hc(e,r)),message:`The operator ${r} requires ${a-(Hc(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Gc(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:g(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=Ic(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else V(i,t,n);return!0}if(i.kind===`Lambda`){V(i,t,n);let o=i.params.length===c;return!o&&Ks.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)??hc(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return V(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=pc(u,t,n)?.params??[],f=Ic(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(hc(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.`)})},Gc=(e,t,n)=>{e.kind===`Identifier`?Ic(e,e.name,t,n):V(e,t,n)},Kc=(e,t,n)=>{let r=qs.get(e);return r?(r.args.forEach(e=>Gc(e,t,n)),n.errors.push(r.error),!0):!1},V=(e,t,n)=>{if(Ks.has(e)&&!n.isGenerated){V(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>V(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Uc(e,t,n))return;let r=e.name,i=Ic(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:g(hc(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Ic(e,e.operator,t,n);return;case`Apply`:Wc(e,t,n);return;case`Lambda`:V(e.body,sc(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:V(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&V(e.other,t,n);return;case`Let`:V(e.body,Vc(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:V(e.body,Lc(e.bounds,t,n),i(uc(e.bounds)));return;case`UnboundedQuantifier`:V(e.body,sc(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&V(e.set,t,n),V(e.body,sc(t,lc(e.pattern),e.pattern.ranges,n),i(lc(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:V(e.predicate,Lc([e.bound],t,n),i(lc(e.bound.pattern)));return;case`SetMap`:V(e.expression,Lc(e.bounds,t,n),i(uc(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:g(r.location.range??mc(r.location,r.name)),message:`Non-unique fields in constructor.`}),V(r.value,t,n)});return;case`Except`:V(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),V(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:V(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(Nc(e,n))return;V(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Pc(e,t,n);return;case`Subexpression`:if(Kc(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Gc(e,t,n)),Fc(e,t,n,!1)}},qc=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Uc(e,t,n)||Fc(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&tc(t,r)?.isNonFact?n.errors.push({location:g(hc(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||V(e,t,n)}),Jc=(e,t,n)=>(e.set&&V(e.set,t,n),ac(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Yc=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Jc(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Yc(t,e.scope,e.unit,!0):V(t,e.scope,e.unit),e),{scope:t,unit:n});return V(e.conclusion,i.scope,i.unit),i.scope},Xc=(e,t,n)=>e.kind===`AssumeProve`?Yc(e,t,n):(V(e,t,n),t),Zc=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&qc(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>$c(t,e,r),t)},Qc=(e,t,n)=>{let r=al(e,t,n);return e.name===void 0?r:ac(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},$c=(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=Xc(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Zc(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Zc(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 qc(r.facts,t,n),o(t);case`Instance`:return o(Qc(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Qc(t,e,i):Vc([t],e,n),t));case`Have`:case`Case`:return V(r.expression,t,i),Zc(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>V(e,t,i)),a(t);case`Take`:return a(sc(Lc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=sc(Lc(r.bounds,t,i),r.names,r.nameRanges,i);return V(r.body,o,{...i,labelParams:[...i.labelParams,...uc(r.bounds),...r.names]}),Zc(e.proof,a(t),n),a(o)}default:return Zc(e.proof,a(t),n),a(t)}},el=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Xc(e.statement,void 0,t);e.name!==void 0&&oc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Zc(e.proof,n,t),r&&(r.isInProof=!1)},tl={line:0,column:0},nl=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),rl=(e,t)=>{let n=new Map([...Xs,...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},il=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){V(n,a,i);return}let r=Ic(n,n.name,a,i);if(r!==void 0&&r!==t.arity)throw new l(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},s=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:g(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;o(r,a);let c=a.location.range;s.has(n)?c&&i.errors.push({location:g(c),message:`Multiple substitutions for symbol '${n}' in substitution.`}):s.set(n,a)});let c=t.filter(e=>!s.has(e.name)),u=e=>!tc(a,e.name)&&!fc(e.name,i);return c.filter(e=>!u(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};o(t,n),s.set(t.name,n)}),c.filter(u).forEach(t=>{let r=e.location.range,a=t.location.range;r&&a&&i.errors.push({location:g(r),message:`Substitution missing for symbol ${t.name} declared at ${g(a)} \nand instantiated in module ${n}.`})}),s},al=(e,t,n)=>{let r=n.getInstance(e);return il(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>ac(e,t,r,n),t)},ol=(e,t,n,r)=>{let i=rl(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),il(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:tl}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},sl=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>Zs(e.location,t.location)?-1:+!!Zs(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof l)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},cl=(e,t)=>{let n=rl(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([...Xs,...t.bound].map(([e,t])=>[e,{...t,position:tl}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c)=>({location:e,check:(l,u)=>c({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:l,warnings:u,hasLabelScope:s,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),l=(e,t)=>e.map(e=>c(e.location,void 0,!1,n=>oc(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return sl([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>c(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},r=ic(e.name,a.get(e.name),n,t);r&&(a.set(e.name,n),o.add(n)),s.push({declaration:e,binding:r?n:void 0})})),...e.definitions.map(t=>c(t.location,t,!0,n=>{nl(e,t)?V(t.body,void 0,n):Bc(t,void 0,n,o)&&a.set(t.name,{kind:`Definition`,arity:Qs(t),range:t.location.range,position:t.location})})),...e.instances.map(e=>c(e.location,void 0,!1,n=>{cc(void 0,e.params,n),t.instanced.get(e)?.forEach((e,t)=>oc(t,e,n)),e.name!==void 0&&oc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)})),...e.assumptions.map(e=>c(e.location,void 0,e.name!==void 0,t=>{V(e.expression,void 0,t),e.name!==void 0&&oc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...e.theorems.map(e=>c(e.location,void 0,e.name!==void 0,t=>el(e,t))),...e.uses.map(e=>c(e.location,void 0,!1,t=>qc(e.facts,void 0,t))),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:g(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},ll=/* @__PURE__ */ new WeakSet,ul=/* @__PURE__ */ new WeakMap,dl=(e,t)=>{if(t.length===0)return e;let n={...e};return ll.has(e)&&ll.add(n),ul.set(n,[...t,...ul.get(e)??[]]),n},fl=(e,t,n=/* @__PURE__ */ new Set)=>{let r=vl(e,(e,r)=>fl(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&M(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&M(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},pl=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),ml=/* @__PURE__ */ new WeakMap,hl=e=>ml.get(e)??e.name,gl=(e,t)=>(hl(t)!==e.name&&ml.set(e,hl(t)),e),_l=(e,t)=>gl(e.kind===`Function`?{...e,bounds:pl(e.bounds,e=>t(e,[])),body:t(e.body,uc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),vl=(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=>_l(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:pl(e.bounds,n),body:t(e.body,uc(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,lc(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,lc(e.bound.pattern))};case`SetMap`:return{...e,bounds:pl(e.bounds,n),expression:t(e.expression,uc(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)}}},yl=(e,t)=>{vl(e,(e,n)=>(t(e,n),e))},bl=`LAMBDA`,xl=e=>`${e}@SUBSTITUTION`,Sl=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(Sl),Cl=(e,t)=>{if(e.kind!==`Identifier`)return!Sl(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=M(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!Sl(n.body)},wl=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e),r=n===void 0||t.has(n)?[]:[n];return yl(e,(e,n)=>r.push(...wl(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},Tl=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}},El=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Dl=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Ol=(e,t)=>e.map(e=>({pattern:Dl(e.pattern,t),set:e.set})),kl=(e,t)=>e.kind===`Function`?{...e,bounds:Ol(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Al=(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=>gl({...kl(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Ol(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Dl(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Dl(e.bound.pattern,n),set:e.bound.set}};default:return e}},jl=e=>`${e}@ENABLED`,Ml=(e,t)=>e.modes.get(t)??e,Nl=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!M(e)&&t.instantiation.variables.has(e.name),Pl=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Pl(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Nl(e,t,n))return[e.name];let r=M(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Pl(r.body,t,/* @__PURE__ */ new Map):void 0},Fl=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Nl(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:jl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Vl(e.expression,Ml(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Vl(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Vl(e.subscript,Ml(t,`Primed`),n),location:r},Vl(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Pl(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:jl(r),location:e.location},location:e.location},Vl({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Il=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:Gs}),Ll=(e,t)=>e.map(e=>Il(e.name,t)),Rl=(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:Ll(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),zl=(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:[...Ll(t,r),...i.map(e=>Il(e,r))],location:r},location:r}},Bl=(e,t)=>e.instantiation.isParameterized(t)?Ul(e,t):void 0,Vl=(e,t,n)=>{let r=e=>Vl(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!M(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Vl(e.expression,Ml(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Vl(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Ml(t,`Enabled`),n)};let s=Fl(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!Cl(n,i)))return dl(n,[e]);if(n&&r){let t=xl(e.name);return r.set(t,n),Il(t,e.location)}let o=Bl(t,e.name);if(o===void 0)return e;if(a.length===0)return{...e,name:o};let s=i.getDefinition(e.name);return s&&Qs(s)>0?zl(o,a,Qs(s),e.location):{kind:`Apply`,operator:o,args:Ll(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||ll.has(e),c=e=>(s&&ll.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:bl,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:bl,args:n,resolution:Gs},location:e.location};if(o)throw new l(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Bl(t,e.operator);return u===void 0?c({...e,args:n}):{...e,operator:u,args:[...Ll(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=i.substitutions.get(e.operator);if(n?.kind===`Identifier`||n?.kind===`OperatorReference`||n?.kind===`Lambda`)return dl(n,[e]);let r=Bl(t,e.operator);if(r===void 0)return e;let o=i.getDefinition(e.operator);return a.length>0&&o?zl(r,a,Qs(o),e.location):{...e,operator:r}}let c=Tl(t),u=vl(e,(e,i)=>i.length===0?r(e):Vl(e,t,El(n,i,c)));return Al(u,n,c)},Hl=(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:Il(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ul=(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=Tl(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=kl(_l(i,(e,t)=>Vl(e,s,El(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&ul.set(l,[u,...ul.get(i.body)??[]]),Hl({...c,body:l},r.params,i.location)}):t},Wl=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>wl(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=>Bl(i,e)??e,getQualifiedKey:t=>{let n=Bl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Hl(r,e.params,r.location)):t}}},Gl=e=>e.kind===`Let`&&e.instances!==void 0||mt(e).some(Gl),Kl=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=vl(e,e=>Kl(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Zs(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}},ql=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Jl=(e,t)=>e.definitions.some(e=>Gl(e.body))||e.assumptions.some(e=>Gl(e.expression))||e.theorems.some(e=>{let t=ql(e);return t!==void 0&&Gl(t)})?{...e,definitions:e.definitions.map(e=>_l(e,e=>Kl(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Kl(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=ql(e);return n===void 0?e:{...e,statement:Kl(n,t,[])}})}:e,Yl=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}])),Xl={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]}},Zl=(e,t)=>{let n=Xl[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Ql=(e,t)=>`${e}${t}`,$l=(e,t,n)=>`${e}${t}${n}`,eu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},tu=(e,t,n)=>`${e},${t},${n}`,nu=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),ru=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),iu=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),au=(e,t)=>{t.constraints.forEach((t,n)=>ru(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>iu(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},ou=(e,t,n,r)=>({...nu(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),su=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,cu=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,lu=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,{...ou(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),uu=ou(`$Set`,0,[2],[1]),du=ou(`$Junction`,0,[3],[1]),fu=ou(`$Choose`,0,[2],[1]),pu=ou(`$Function`,0,[3],[1]),mu=ou(`$FcnApply`,0,[2,2],[1,1]),hu=ou(`$RcdSelect`,0,[2,0],[1,1]),gu=ou(`'`,2,[1],[0]),_u=ou(`ENABLED`,1,[2],[0]),vu=ou(`[]`,3,[3],[0]),yu=ou(`$SquareAct`,2,[2,1],[0,0]),bu=ou(`$WF`,3,[1,2],[0,0]),xu=ou(`$TemporalExists`,3,[3],[0]),Su=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Cu=e=>e.map(e=>({name:e,arity:0})),wu=(e,t)=>t.location.range?C(`${e}.`,t.location.range):new l(`${e} at line ${t.location.line}, column ${t.location.column}`),Tu=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Eu=e=>e.kind!==`Let`&&e.kind!==`Label`,Du=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=v(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=lu.get(t)??Yl.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=nu(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($l(e,n,t))}),iu(r.argConstraints,Ql(e,n),t.data.level),au(r,t.data)}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(t.kind===`Value`&&t.data.level>su(e,n))throw new l(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new l(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(tu(t,n,r)),s=nu(Math.max(e.level,...t.filter((t,n)=>cu(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)=>{cu(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)=>ru(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||ru(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>ru(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||ru(s.constraints,t,su(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>ru(s.constraints,e,su(r,a)))}))}),e.argParams.forEach(e=>{let t=eu(e),n=a(t.operator);n?.kind===`Operator`&&ru(s.constraints,t.param,su(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>iu(s.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>iu(s.argConstraints,Ql(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&iu(s.argConstraints,Ql(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=eu(e),n=a(t.operator);n&&iu(s.argConstraints,Ql(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(eu(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=eu(e),n=a(t.operator);if(n)n.kind===`Declared`&&s.argParams.add($l(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($l(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add($l(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:_(`LAMBDA`,Cu(e.params),e.body,t)};let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{kind:`Operator`,data:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=nu();return e.params.add(r),{kind:`Declared`,data:e,declared:{name:r,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:nu()}}return{kind:`Value`,data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=Su(n,Cu(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),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw wu(`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 wu(`Action used where only temporal formula or state predicate allowed`,e);Tu.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Eu(n)&&n.kind!==r)throw wu(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=>au(i,v(e,n))),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof l)||t.sany?t:wu(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return nu();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 u(n,e),i(du,n)}case`Prime`:case`Unchanged`:return s(gu,[e.expression],t);case`Enabled`:return s(_u,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(vu,[n])}case`If`:return s(du,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(du,[...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(du,[e.body],t,e.bounds.map(e=>e.set),uc(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw wu(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?xu:du,[e.body],t,[],e.names);case`Choose`:return s(fu,[e.body],t,e.set?[e.set]:[],lc(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(uu,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(uu,[e.predicate],t,[e.bound.set],lc(e.bound.pattern));case`SetMap`:return s(uu,[e.expression],t,e.bounds.map(e=>e.set),uc(e.bounds));case`FunctionConstruction`:return s(pu,[e.body],t,e.bounds.map(e=>e.set),uc(e.bounds));case`Record`:return s(pu,e.fields.map(e=>e.value),t);case`RecordSet`:return s(uu,e.fields.map(e=>e.value),t);case`Except`:return s(uu,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(mu,[a(e.function,t),e.args.length===1?a(e.args[0],t):{kind:`Value`,data:s(uu,e.args,t)}]);case`Bracket`:return nu();case`FieldAccess`:return i(hu,[a(e.record,t),{kind:`Value`,data:nu()}]);case`BoxAction`:case`AngleAction`:return s(yu,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(bu,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return nu()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return mt(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Su(t,Cu(e.names))),i;default:return yl(e,(e,n)=>a(e,r,Su(t,Cu(n)))),i}},_=(e,t,n,r)=>{let i=Su(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...nu(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(Ql(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($l(e.name,n,t.name))).map(e=>tu(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(eu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=eu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...nu(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:a}},Ou=(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`?Ou(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=nu(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),au(a,e)}),a},ku=(e,t,n,r)=>{let a=Du(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`?Ou(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(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:g(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=sl([...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`?Ou(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 i(n)}})),...n],r);if(u.length>0)throw i(u,!1,void 0,r)},Au=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),ju=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Mu=/* @__PURE__ */ new Set([...Au,...ju,`Enabled`]),Nu=/* @__PURE__ */ new Set([`~>`,`-+->`]),Pu=/* @__PURE__ */ new Set([...Nu,`\\cdot`]),Fu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Iu=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Lu=(e,t)=>Fu.has(e)||t.builtins.get(e)?.isStateLevel===!0,Ru=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(Au.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(ju.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Nu.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(Mu.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&Pu.has(e.operator))&&(r[0]|=1),Mu.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=ht(e);if(u!==void 0&&!M(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{Lu(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),Iu.has(u)&&(r[0]|=8),!a&&Lu(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}mt(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},zu=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Bu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),Vu=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=Ru(pt(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&14,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=zu(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=zu(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!Bu(t[e],l[e*r])))),p=zu(a,r,f,14);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&14:e),words:r}},Hu=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Uu(pt(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Uu=(e,t)=>{let n=t.facts.words,r=Ru(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Hu(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Bu(e.callee,r[0])||(i[0]|=r[0]&14)}),i},Wu=(e,t)=>!(Hu(e,t)[0]&1),Gu={any:2,repeated:4,streamed:8},Ku=(e,t,n=`any`)=>(Hu(e,t)[0]&Gu[n])!==0,qu=(e,t)=>{let n=Hu(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},Ju=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},Yu=(e,t)=>{let n=Uu([e],t);return n[0]&16?void 0:Ju(n)},Xu=(e,t)=>!!(Uu([e],t)[0]&1),Zu=(e,t,n)=>new c(`Applying ${e} to the following value,\nwhich is not ${t}:\n${R(n)}`),Qu=e=>un(e)?L(e):void 0,$u=`a function with a finite domain`,ed=(e,t,n)=>{let r=z(e,t,n),i=Qu(r);if(!i)throw Zu(n,$u,r);return i},td=(e,t)=>{let n=z(e,1,t),r=Qu(n),i=r&&ad(r,z(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw Qo(`second`,t,`bag`,n);return i},nd=(e,t,n)=>{let r=t[n];if(!r||!id(r))throw Qo(n===0?`first`:`second`,`(+)`,`bag`,z(e,n,`(+)`));return r},rd=(e,t)=>{if(!P(e)||!F(e))throw t();return I(e).elements},id=e=>e.range.every(e=>typeof e==`number`&&e>0),ad=(e,t)=>{let n=e.domain.findIndex(e=>Ur(t,e));return n===-1?void 0:e.range[n]},od=e=>{if(typeof e==`number`)return e;let t=`tlc2.value.impl.${ps(e)}`;throw new y(`class ${t} cannot be cast to class tlc2.value.impl.IntValue (${t} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},sd=(e,t)=>{let n=od(e)+od(t);if(ss(n))throw cs(`${e}+${t}`);return n},cd=(e,t,n)=>{let r=od(e.range[t]),i=ad(n,e.domain[t]);if(i===void 0)return r;let a=r-od(i);if(ss(a))throw cs(`${r}-${i}`);return a},ld=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>Ur(t,e[0]));i?i[1]=sd(i[1],n):e.push([t,n])},ud=e=>e.domain.map((t,n)=>[t,e.range[n]]),dd=rr([],[]),fd=e=>[rs(`EmptyBag`,dd),B(`IsABag`,1,e=>{let t=Qu(z(e,0,`IsABag`));return t!==void 0&&id(t)}),B(`BagCardinality`,1,e=>{let t=z(e,0,`BagCardinality`);return ed(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Zu(`BagCardinality`,`a bag`,t);return sd(e,n)},0)}),B(`BagIn`,2,e=>{let t=td(e,`BagIn`);return t!==void 0&&t>0}),B(`CopiesIn`,2,e=>td(e,`CopiesIn`)??0),B(`\\oplus`,2,e=>{let t=[0,1].map(t=>Qu(z(e,t,`(+)`))),n=nd(e,t,0),r=nd(e,t,1),i=ud(n);return r.domain.forEach((e,t)=>ld(i,e,r.range[t],n.domain.length)),Qr(i)}),B(`\\ominus`,2,e=>{let t=z(e,0,`(-)`),n=z(e,1,`(-)`),r=Qu(t),i=Qu(n);if(!r)throw Qo(`first`,`(-)`,`bag`,t);if(!i)throw Qo(`second`,`(-)`,`bag`,n);return Qr(r.domain.flatMap((e,t)=>{let n=cd(r,t,i);return n>0?[[e,n]]:[]}))}),B(`BagUnion`,1,e=>{let t=z(e,0,`BagUnion`),n=rd(t,()=>Zu(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??dd;let r=e=>{let n=Qu(e);if(!n)throw new c(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${R(t)}`);return n},i=ud(r(n[0]));return n.slice(1).forEach(e=>{let t=r(e);t.domain.forEach((e,n)=>ld(i,e,t.range[n]))}),Qr(i)}),B(`\\sqsubseteq`,2,e=>{let t=z(e,0,`\\sqsubseteq`),n=z(e,1,`\\sqsubseteq`),r=Qu(t),i=Qu(n);if(!r)throw Zu(`\\sqsubseteq`,$u,t);if(!i)throw Zu(`\\sqsubseteq`,$u,n);return r.domain.every((e,t)=>{let n=ad(i,e);return od(r.range[t])<=(n===void 0?0:od(n))})}),is(`BagOfAll`,2,e=>{let t=ns(e,0,`BagOfAll`),n=z(e,1,`BagOfAll`),r=Qu(n);if(!r)throw Qo(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>ld(i,t.call([e]),r.range[n])),Qr(i)}),B(`SubBag`,1,t=>{let n=z(t,0,`SubBag`);if(!un(n))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${ms(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=L(n),i=I(qr(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new y(`Attempted to apply a function to ${R(r)}, which is not in its domain`);return Kr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>rr(e.map(e=>e[0]),e.map(e=>e[1]))))}),B(`BagToSet`,1,e=>ua(ed(e,0,`BagToSet`))),B(`SetToBag`,1,e=>{let t=z(e,0,`SetToBag`),n=rd(t,()=>Zu(`BagToSet`,$u,t));return rr([...n],n.map(()=>1))})],pd={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},H={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},md={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},hd=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],gd=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
79
- `],[`r`,`\r`],[`f`,`\f`]]),_d=1024,vd=e=>{let t=+!!e.startsWith(``),n=t,r=0,i=t,a=!0,o=H.none,s=0,c=[pd.emptyDocument],l=[void 0],u=[0],d=()=>`$${c.map((e,t)=>e===pd.emptyArray||e===pd.nonemptyArray?`[${u[t]}]`:e===pd.emptyDocument||e===pd.nonemptyDocument?``:`.${l[t]??``}`).join(``)}`,f=()=>` at line ${r+1} column ${n-i+1} path ${d()}`,p=e=>new y(`com.google.gson.stream.MalformedJsonException: ${e}${f()}
80
- See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),m=()=>new y(`java.io.EOFException: End of input${f()}`),h=()=>{if(!a)throw p(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},g=e=>`/\\;#=`.includes(e)?(h(),!1):!`{}[]:, \f\r
81
- `.includes(e),_=()=>{for(;n<e.length;){let t=e[n++];if(t===`
82
- `){r++,i=n;return}if(t===`\r`)return}},v=t=>{for(;n+t.length<=e.length;n++)if(e[n]===`
83
- `)r++,i=n+1;else if(e.startsWith(t,n))return!0;return!1},ee=()=>{for(;n<e.length;){let t=e[n++];if(t===`
84
- `)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)_();else if(v(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),_();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},b=()=>{let e=ee();if(e===void 0)throw m();return e},x=()=>{let t=hd.find(t=>e[n]===t.lower[0]||e[n]===t.upper[0]);if(!t)return H.none;let r=t.lower.length;for(let i=0;i<r;i++){let r=e[n+i];if(r!==t.lower[i]&&r!==t.upper[i])return H.none}return n+r<e.length&&g(e[n+r])?H.none:(n+=r,t.token)},S=()=>{let t=md.none,r=!1,i=0;for(;n+i<e.length;i++){if(i===_d)return H.none;let a=e[n+i];if(a===`-`){if(t===md.none)t=md.sign;else if(t===md.exponentE)t=md.exponentSign;else return H.none}else if(a===`+`){if(t!==md.exponentE)return H.none;t=md.exponentSign}else if(a===`e`||a===`E`){if(t!==md.digit&&t!==md.fractionDigit)return H.none;t=md.exponentE}else if(a===`.`){if(t!==md.digit)return H.none;t=md.decimal}else if(a<`0`||a>`9`){if(g(a))return H.none;break}else if(t===md.sign||t===md.none)r=a===`0`,t=md.digit;else if(t===md.digit){if(r)return H.none}else t===md.decimal?t=md.fractionDigit:(t===md.exponentE||t===md.exponentSign)&&(t=md.exponentDigit)}return i===_d||t!==md.digit&&t!==md.fractionDigit&&t!==md.exponentDigit?H.none:(s=i,H.number)},C=()=>{let t=c.length-1,r=c[t];if(r===pd.emptyArray)c[t]=pd.nonemptyArray;else if(r===pd.nonemptyArray){let e=b();if(e===`]`)return H.endArray;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated array`)}else if(r===pd.emptyObject||r===pd.nonemptyObject){if(c[t]=pd.danglingName,r===pd.nonemptyObject){let e=b();if(e===`}`)return H.endObject;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated object`)}let e=b();if(e===`"`)return H.doubleQuotedName;if(e===`'`)return h(),H.singleQuotedName;if(e===`}`){if(r!==pd.nonemptyObject)return H.endObject;throw p(`Expected name`)}if(h(),n--,g(e))return H.unquotedName;throw p(`Expected name`)}else if(r===pd.danglingName){c[t]=pd.nonemptyObject;let r=b();if(r===`=`)h(),e[n]===`>`&&n++;else if(r!==`:`)throw p(`Expected ':'`)}else if(r===pd.emptyDocument){if(ee()===void 0)return H.eof;n--,e.startsWith(`)]}'
85
- `,n)&&(n+=5),c[t]=pd.nonemptyDocument}else if(r===pd.nonemptyDocument){if(ee()===void 0)return H.eof;h(),n--}let i=ee();if(i===void 0){if(r===pd.emptyDocument)return H.eof;throw m()}if(i===`]`&&r===pd.emptyArray)return H.endArray;if(i===`]`||i===`;`||i===`,`){if(r!==pd.emptyArray&&r!==pd.nonemptyArray)throw p(`Unexpected value`);return h(),n--,H.null}if(i===`'`)return h(),H.singleQuoted;if(i===`"`)return H.doubleQuoted;if(i===`[`)return H.beginArray;if(i===`{`)return H.beginObject;n--;let a=x();if(a!==H.none)return a;let o=S();if(o!==H.none)return o;if(!g(e[n]))throw p(`Expected value`);return h(),H.unquoted},w=()=>(o===H.none&&(o=C()),o),te=()=>{if(n===e.length)throw p(`Unterminated escape sequence`);let t=e[n++];if(t===`u`){if(n+4>e.length)throw p(`Unterminated escape sequence`);let t=e.slice(n,n+4);if(!/^[\da-fA-F]{4}$/.test(t))throw p(`Malformed Unicode escape \\u${t}`);return n+=4,String.fromCharCode(Number.parseInt(t,16))}let a=gd.get(t);if(a!==void 0)return a;if(t===`
86
- `)return r++,i=n,t;if(`'"\\/`.includes(t))return t;throw p(`Invalid escape sequence`)},ne=t=>{let a=``,o=n;for(;n<e.length;){let s=e[n++];if(s===t)return a+e.slice(o,n-1);s===`\\`?(a+=e.slice(o,n-1)+te(),o=n):s===`
87
- `&&(r++,i=n)}throw p(`Unterminated string`)},re=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},ie=e=>{if(c.length-1>=255)throw new y(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=H.none},ae=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=H.none},oe=()=>{let e=w();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},se=()=>{let e=w(),t=e===H.unquotedName?re():ne(e===H.singleQuotedName?`'`:`"`);return o=H.none,l[c.length-1]=t,t},ce=t=>t===H.true||t===H.false?t===H.true:t===H.null?null:t===H.number?(n+=s,{literal:e.slice(n-s,n)}):t===H.unquoted?re():ne(t===H.singleQuoted?`'`:`"`),le=()=>{let e=w();if(e===H.beginArray){ie(pd.emptyArray);let e=[];for(;oe();)e.push(le());return ae(),e}if(e===H.beginObject){ie(pd.emptyObject);let e=/* @__PURE__ */ new Map;for(;oe();)e.set(se(),le());return ae(),e}let t=ce(e);return o=H.none,u[c.length-1]++,t};if(w()===H.eof)return null;let T=le();return a=!1,T!==null&&w(),T},yd=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),bd=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),xd=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Sd=e=>{if(!un(e))return;let t=L(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?ui(n):void 0},Cd=(e,t)=>{let n=`tlc2.value.impl.${ps(e)}`,r=`tlc2.value.impl.${t}`;return new y(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},wd=e=>new y(`Cannot convert value: unsupported value type tlc2.value.impl.${ps(e)}`),Td=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Ed=e=>`[${e.map(Ad).join(`,`)}]`,Dd=e=>`{${yn(e).map(e=>`${Td(typeof e[0]==`string`?e[0]:R(e[0]))}:${Ad(e[1])}`).join(`,`)}}`,Od=e=>{let t=L(e),n=Bi(t);return n?Ed(n):Dd(t)},kd=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Ad=e=>typeof e==`string`?Td(e):typeof e==`object`?e.kind===`ModelValue`?Td(e.name):ps(e)===`RecordValue`?Dd(L(e)):jd(e):String(e),jd=e=>{let t=ps(e);if(t===`TupleValue`)return Ed(L(e).range);if(kd(t))return Od(e);if(fi(e))return Ed(I(e).elements);throw wd(e)},Md=e=>e.map(e=>`${Ad(e)}\n`).join(``),Nd=e=>{let t=ps(e);if(t===`RecordValue`)return Dd(L(e));if(t===`TupleValue`)return`{${L(e).range.map((e,t)=>`"${t}":${Ad(e)}`).join(`,`)}}`;if(kd(t))return Od(e);throw wd(e)},Pd=e=>{if(e===null)throw new y(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Bn(e);if(Array.isArray(e))return li(e.map(Pd));if(e instanceof Map)return ui([...e].map(e=>[Bn(e[0]),Pd(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||ss(t))throw new y(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},Fd=e=>{if(typeof e!=`string`)throw new y(`Cannot cast tlc2.value.impl.${ps(e)} to tlc2.value.impl.StringValue`);return e},Id=(e,t)=>{let n=ca(e,t);if(typeof n!=`string`)throw Cd(n,`StringValue`);return n},Ld=e=>{if(!bd.has(e.toLowerCase()))throw xd.has(e.toLowerCase())?new ae(`IOUtils!Serialize does not support the charset ${e}`):new y(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},Rd=(e,t,n,r)=>{let i=n.find(e=>!yd.has(e));if(i!==void 0)throw new y(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${i}`);if(n.includes(`READ`))throw new y(`java.lang.IllegalArgumentException: READ not allowed`);let a=new Set(n.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:n);if(a.has(`APPEND`)&&a.has(`TRUNCATE_EXISTING`))throw new y(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(a.has(`DELETE_ON_CLOSE`))throw new ae(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let o=e.readFile?.(t);if(o===void 0&&!a.has(`CREATE`)&&!a.has(`CREATE_NEW`))throw new y(`java.nio.file.NoSuchFileException: ${t}`);if(o!==void 0&&a.has(`CREATE_NEW`))throw new y(`java.nio.file.FileAlreadyExistsException: ${t}`);o===void 0||a.has(`TRUNCATE_EXISTING`)?e.writeFile?.(t,r):e.writeFile?.(t,a.has(`APPEND`)?o+r:r+o.slice(r.length))},zd=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},Bd=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new y(`${t} (No such file or directory)`);return n},Vd=e=>[gs(as(`ToJson`,1,e=>Bn(Ad(z(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),gs(as(`ToJsonArray`,1,e=>Bn(jd(z(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),gs(as(`ToJsonObject`,1,e=>Bn(Nd(z(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),gs(as(`JsonSerialize`,2,t=>{let n=Fd(z(t,0,`JsonSerialize`)),r=z(t,1,`JsonSerialize`);if(!Bi(r)&&!Sd(r))throw Qo(`second`,`JsonSerialize`,`sequence or record`,r);return zd(e,n),e.writeFile?.(n,Ad(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),gs(as(`ndJsonSerialize`,2,t=>{let n=Fd(z(t,0,`ndJsonSerialize`)),r=z(t,1,`ndJsonSerialize`),i=Bi(r);if(!i)throw Qo(`second`,`ndJsonSerialize`,`sequence`,r);return zd(e,n),e.writeFile?.(n,Md(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),gs(as(`JsonDeserialize`,1,t=>Pd(vd(Bd(e,Fd(z(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),gs(as(`ndJsonDeserialize`,1,t=>li(Bd(e,Fd(z(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>Pd(vd(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],Hd=(e,t)=>[gs(Ss(`Serialize`,3,(n,r)=>{let i=Cs(n,2,`Serialize`)(),a=Sd(i);if(!a)throw Qo(`third`,`ndJsonSerialize`,`sequence`,i);if(Id(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Cs(n,0,`Serialize`)(),s=Bi(o);if(!s)throw Qo(`first`,`Serialize`,`sequence`,o);let c=Cs(n,1,`Serialize`)();if(typeof c!=`string`)throw Qo(`second`,`ndJsonSerialize`,`sequence`,c);let l=ca(a,`openOptions`);if(ps(l)!==`TupleValue`)throw Cd(l,`TupleValue`);let u=Id(a,`charset`),d=L(l).range.map(e=>{if(typeof e!=`string`)throw Cd(e,`StringValue`);return e});return Ld(u),Rd(e,c,d,Md(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],Ud={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Wd=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=er(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(Ud.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(Ud.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(Ud.boolean),o(+!!e);return}if(typeof e==`number`){o(Ud.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(Ud.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(Ud.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),P(e)){let t=I(e).elements;o(Ud.set),c(t.length),t.forEach(f);return}let p=L(e),m=or(e);m===`tuple`?(o(Ud.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(Ud.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(Ud.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),oe(Uint8Array.from(t))},Gd=e=>[gs(as(`_TLCTraceSerialize`,2,t=>{let n=Fd(z(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Wd(z(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],Kd=25214903917n,qd=(1n<<48n)-1n,Jd=e=>{let t=(BigInt.asUintN(64,e)^Kd)&qd,n=e=>(t=t*Kd+11n&qd,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^Kd)&qd},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Yd=[],Xd=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Zd=()=>{for(let e=1277011;Yd.length<1341;e++)Xd(e)&&Yd.push(e);return Yd},Qd=e=>{let t=Zd(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},$d=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},ef=e=>{for(let t=Math.max(e,9);;t++){let e=$d(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)}}},tf=(e,t,n)=>{if(t<=0)return[];let r=ef(t),i=BigInt(n.nextInt(t)),a=BigInt(Qd(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},nf=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:$t),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},rf=(1n<<63n)-1n-24n,af=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(rf*BigInt(n)+i)%t;return r<0n?r+t:r})},of=(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,sf=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=si(e.domain),n=I(e.range).elements;return{lists:t.map(()=>n),create:e=>rr(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>I(e).elements),create:t=>ui(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>I(e).elements),create:li}}},cf=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,lf=(e,t,n,r)=>{if(Mi(t))return[];let i=r===`1.7.4`?nf:tf;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=cf(t,r)?void 0:sf(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?af(e,t,n):i(e,Number(t),n)).map(e=>a.create(of(a.lists,e)))}let o=I(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},uf=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...$o(e.domain,`RandomElement`,e).elements];return rr(n,n.map(()=>uf(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return ui(e.names.map((n,r)=>[n,uf(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return li(e.factors.map(e=>uf(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new y(`Attempted to retrieve out-of-bounds element from the interval value ${R(e)}.`);return e.low+r}let n=$o(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new y(`Index ${r} out of bounds for length ${n.length}`);return n[r]},df=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Qo(t,n,`nonnegative integer`,e);return e},ff=(e,t,n,r)=>Kr(Array.from({length:t},()=>Kr(e.filter(()=>r.nextDouble()<n)))),pf=(e,t)=>{let n=`RandomSetOfSubsets`,r=df(z(e,0,n),`first`,n),i=df(z(e,1,n),`second`,n),a=z(e,2,n);if(!P(a)||!F(a))throw Qo(`third`,n,`finite set`,a);let o=I(a).elements;if(o.length<31&&r>2**o.length)throw Qo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Qo(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return ff(o,r,o.length===0?0:i/o.length,t.getRandom())},mf=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,hf=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,gf=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(mf.test(t))return Number(t.replace(/[fFdD]$/,``));let n=hf.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},_f=e=>B(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=df(z(t,0,n),`first`,n),i=z(t,1,n);if(typeof i!=`string`)throw Qo(`second`,n,`string literal representing a probability`,i);let a=gf(i);if(a===void 0||a<0||a>1)throw Qo(`second`,n,`string literal does not represent a parsable probability`,i);let o=z(t,2,n);if(!P(o)||Un(o)||!Li(o))throw Qo(`third`,n,`finite set`,o);let s=Fi(o);if(32-Math.clz32(r)>s&&r>1<<s)throw Qo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return ff(I(o).elements,r,a,e.getRandom())}),vf=e=>[gs(B(`RandomSubset`,2,t=>{let n=df(z(t,0,`RandomSubset`),`first`,`RandomSubset`),r=z(t,1,`RandomSubset`);if(!fi(r)||!Li(r))throw Qo(`second`,`RandomSubset`,`a finite set`,r);let i=cf(r,e.version);if(i&&i.reduce((e,t)=>e*I(t).elements.length,1)>rn())throw new y(an());return Kr(lf(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),B(`RandomSetOfSubsets`,3,t=>pf(t,e)),B(`TestRandomSetOfSubsets`,3,t=>li(Array.from({length:5},()=>I(pf(t,e)).elements.length)))],yf=(e,t=0n)=>{let n=Jd(t),r=Jd(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>ui([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:fo,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},bf=e=>Qr([...e.possibleCounts].map(([e,t])=>[e,t])),xf=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,bf(e)]]),Sf=e=>ui([[`name`,e??`UnnamedAction`],[`location`,ui([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Cf=/* @__PURE__ */ new WeakSet,wf=(e,t)=>{let n=ui([[`action`,Kr(e)],[`state`,Kr(t)]]);return Cf.add(n),n},Tf=(e,t,n)=>{let r=e.map((e,t)=>li([t+1,ui(Object.entries(e))])),i=r.slice(1).map((e,n)=>li([r[n],t[n],e])),a=n?[li([r[r.length-1],n.action,r[n.start]])]:[];return wf([...i,...a],r)},Ef=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return xf(e).get(t)},Df=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0||!e.pause)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),R(r));else throw new c(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${R(n)}`)},Of=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),kf=e=>e.every(e=>e!==void 0),Af=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!M(e);if(i&&t.variableIndex.has(r))return 1;let a=mt(e).map(e=>Af(e,t,n)),o=i?ng(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Af(o.body,t,n))),Math.max(0,...a)},jf=(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[Ss(`AssertError`,2,e=>{let n=ns(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw new y(`In computing AssertError, a non-string expression (${Of(n)}) was used as the err of an AssertError(err, exp).`);let r=Cs(e,0,`AssertError`)();try{Cs(e,1,`AssertError`)()}catch(e){if(e instanceof y)return It(e.message,t.isTool)===r;throw e}return!1}),as(`TLCGetOrDefault`,2,e=>Ef(t,z(e,0,`TLCGetOrDefault`))??z(e,1,`TLCGetOrDefault`)),as(`Trace`,0,(e,n)=>{let r=n?.environment.variables??[],i=n?.state??r.map(()=>void 0);if(!n||!kf(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new y(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return n.state?li(t.getBehavior(i).map(e=>{let r=n.environment.variables.map((t,n)=>[t,e[n]]),i=t.getSimulationValue?.(`action`,e);return ui(i===void 0?r:[[`_action`,i],...r])})):li([ui([])])}),as(`CounterExample`,0,()=>t.counterExample??wf([],[])),B(`ToTrace`,1,e=>{let t=z(e,0,`ToTrace`);if(typeof t!=`object`||!Cf.has(t))throw new c(`The argument of ToTrace should be a CounterExample, but instead it is:\n${R(t)}`);let n=I(ca(t,`state`)).elements.map(e=>Bi(e)??[]);return li(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),B(`TLCModelValue`,1,e=>{let t=z(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new c(`The argument of ModelValue should be a string, but instead it is:\n${R(t)}`);return $n(t)}),Ss(`TLCDefer`,1,(e,n)=>{let r=ns(e,0,`TLCDefer`).expression;return n&&r&&(t.deferred=e=>{W(r,{...n,next:e})}),!0}),B(`TLCNoOp`,1,e=>z(e,0,`TLCNoOp`)),{...Ss(`PickSuccessor`,1,(n,r)=>{let i=r?.next??(r?.environment.variables??[]).map(()=>void 0);if(!kf(i)||r?.next&&t.isSeen(i))return!0;let a=ns(n,0,`PickSuccessor`),o=a.call([]);if(typeof o!=`boolean`)throw new y(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${ms(o)}) was used as the condition of an IF.\n${a.expression?Of(a.expression):``}`);if(o||!r?.next||!r.state||!kf(r.state))return!0;let s=t.getSuccessorAction(r.state,i);throw e(Tt(t.isTool,St.moduleOverrideStdout,Ct.none,`Extend behavior of length ${t.getLevel(r.state)} with a "${s?.name}" step [<Action ${s?.location.range&&g(s.location.range)}>]? (Yes/no/explored/states/diff):`)),new ne}),isActionLevel:!0},Ss(`TLCCache`,2,(e,r)=>{let a=ns(e,0,`TLCCache`),o=ka(Cs(e,1,`TLCCache`)()),s=a.expression;if(!s||!r)return a.call([]);let c=Af(s,r.environment,/* @__PURE__ */ new Set);if(c===2)return a.call([]);let l=c===1;if(l&&r.state&&t.getSimulationValue===void 0)return a.call([]),a.call([]);let u=l&&r.state?i(r.state):n,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=a.call([]);return d.set(o,p),p}),B(`TLCFP`,1,e=>{let t=z(e,0,`TLCFP`),n=ba(t);if(n)throw n;return Number(BigInt.asIntN(32,fo([t])))}),Ss(`TLCEvalDefinition`,1,(e,t)=>{let n=Cs(e,0,`TLCEvalDefinition`)();if(typeof n!=`string`)throw new c(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${R(n)}`);let r=t?ng(n,t.environment):void 0,i=r?void 0:t?.environment.builtins.get(n);if(i?.arity===0)return i.evaluate([],t);if(!r||!t)throw new c(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${R(n)}`);if(r.kind===`Operator`&&r.params.length>0){let e=r.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new c(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${n}(${e.join(`, `)})`)}return r.kind===`Operator`?W(r.body,t):W({kind:`Identifier`,name:n,location:r.location},t)})]},Mf=(e,t)=>[as(`_Track`,2,e=>{let n=String(z(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,z(e,0,`_Track`)===!0?r+1:r),!0}),as(`_Counts`,0,()=>bf(t)),as(`_CheckName`,1,n=>{let r=String(z(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(R(bf(t),!0)),!1)}),as(`_PrintCounts`,0,()=>(e(R(bf(t),!0)),!0))],Nf=e=>`${e.getUTCFullYear()}.${Lt(e.getUTCMonth()+1)}.${Lt(e.getUTCDate())}.${Lt(e.getUTCHours())}${Lt(e.getUTCMinutes())}${Lt(e.getUTCSeconds())}`,Pf=e=>Qr([...e].map(([e,t])=>[e,li([t])])),Ff=e=>ar($r(e),`record`),If=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Lf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Rf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),zf=(e,t,n)=>{if(e.version===`1.7.4`?!Lf.has(t)||!e.isStarted&&Rf.has(t):!e.isStarted&&If.has(t))throw new c(`TLCGet(${t}) was undefined.`);let r=e.getSimulationValue?.(t,n);if(r!==void 0)return r;let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return Ff([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return Ff([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,qa()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Ff([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Bn(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Bn(Nf(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Sf(void 0);case`all`:return Pf(e.registers);case`all:named`:return Pf(xf(e))}if(t.startsWith(`s:`)){let n=xf(e).get(t);if(n===void 0)throw new c(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Bn(e.properties.get(t.slice(2))??t);throw new c(`TLCGet(${t}) was undefined.`)},Bf=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new c(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new c(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${R(t)}`);return zf(e,t,n?.state)},Vf=e=>e.length===0?[[]]:e.flatMap((t,n)=>Vf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Hf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&I(e).elements.forEach(Hf),e.kind===`Function`&&e.range.forEach(Hf))},Uf=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return L(e);default:return I(e)}},Wf=(e,t)=>[B(`Print`,2,t=>(e(Ba([z(t,0,`Print`),z(t,1,`Print`)]).map(N).join(` `)),z(t,1,`Print`))),B(`PrintT`,1,t=>(e(N(Ba([z(t,0,`PrintT`)])[0])),!0)),B(`Assert`,2,e=>{if(z(e,0,`Assert`)!==!0)throw new c(`The first argument of Assert evaluated to FALSE; the second argument was:\n${N(R(z(e,1,`Assert`)))}`,w.assertViolation);return!0}),B(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),B(`:>`,2,e=>Qr([[z(e,0,`:>`),z(e,1,`:>`)]])),B(`@@`,2,e=>{let t=z(e,0,`@@`),n=z(e,1,`@@`),r=un(t)?L(t):void 0,i=un(n)?L(n):void 0;if(!r)throw Qo(`first`,`@@`,`function`,t);if(!i)throw Qo(`second`,`@@`,`function`,n);let a=vn(r),o=vn(i).filter(e=>!a.some(t=>Ur(e[0],t[0])));return $r([...a,...o])}),B(`ToString`,1,e=>Bn(R(z(e,0,`ToString`),!0))),{...Ss(`TLCEval`,1,(e,t)=>{let n=Uf(Cs(e,0,`TLCEval`)());return t===void 0&&Hf(n),n}),isStateLevel:!1},B(`Permutations`,1,e=>{let t=$o(z(e,0,`Permutations`),`Permutations`).elements;return Kr(Vf(t).map(e=>Qr(t.map((t,n)=>[t,e[n]]))))}),is(`SortSeq`,2,e=>{let t=z(e,0,`SortSeq`),n=Bi(t);if(!n)throw Qo(`first`,`SortSeq`,`natural number`,t);let r=ns(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw Qo(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),li(a)}),t.version===`1.7.4`?gs({...as(`TLCGet`,1,(e,n)=>Bf(t,z(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):gs(Ss(`TLCGet`,1,(e,n)=>Bf(t,Cs(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)`),as(`TLCSet`,2,n=>(Df(t,e,z(n,0,`TLCSet`),z(n,1,`TLCSet`)),!0)),rs(`Any`,qn),B(`RandomElement`,1,e=>uf(z(e,0,`RandomElement`),t.getRandom()))],Gf=/* @__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(`,`),Kf=[[`\\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`,`≀`],[`^+`,`⁺`]],qf=/* @__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(`,`),Jf=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),Yf=/* @__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(`.`),Xf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
76
+ `;if(typeof o!=`string`)throw new b(`The _format field of the ALIAS ${i} is ${R(o)}, but it must be a string.`);return r.filter(([e])=>!(a&&e===`_format`)).filter(([e,n])=>!t||!Va(t[e],n)).map(([e,t])=>{let n=Ua(o,[e,P(R(t))]);if(n===void 0)throw new b(`The _format field of the ALIAS ${i} is ${R(o)}, but it must format two strings, the name and the value of a field.`);return n}).join(``)},Ga=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let Ka=Ga[0];const qa=()=>Ka,Ja=/* @__PURE__ */ new Int32Array(256),Ya=/* @__PURE__ */ new Int32Array(256),Xa=/* @__PURE__ */ new Int32Array(256),Za=/* @__PURE__ */ new Int32Array(256),Qa=/* @__PURE__ */ new Int32Array(256),$a=/* @__PURE__ */ new Int32Array(256),eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256);let no=0,ro=0,io=0,ao=0;const oo=e=>{let t=(e^ao)&255;ao=(ao>>>8|io<<24)^Qa[t],io=io>>>8^Ja[t]},so=e=>{let t=Ga[e];Ka=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);Ja[e]=Number(BigInt.asIntN(32,t>>32n)),Qa[e]=Number(BigInt.asIntN(32,t))}let i=[Ja,Ya,Xa,Za],a=[Qa,$a,eo,to];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^Qa[o],i[e][r]=t[r]>>>8^Ja[o]}}no=Number(BigInt.asIntN(32,t>>32n)),ro=Number(BigInt.asIntN(32,t))};so(0);const co=e=>{let t=ao^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;ao=io^to[n]^eo[r]^$a[i]^Qa[a],io=Za[n]^Xa[r]^Ya[i]^Ja[a]},lo=e=>{if(typeof e==`boolean`)return oo(0),oo(e?116:102),2;if(typeof e==`number`)return oo(1),co(e),5;if(typeof e==`string`){oo(3),co(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)co(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)oo(e.charCodeAt(n));return 5+e.length}return oo(21),co(Vn(e.name)+1),5},uo=e=>{let t=io,n=ao;io=0,ao=0;let r=[lo(e),io,ao];return io=t,ao=n,r},fo=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,po=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,mo={integer:e=>`${fo(`1`)} ${po(e)}`,boolean:e=>`${fo(`0`)} ${fo(`(${e} ? 116 : 102)`)}`,set:e=>`${fo(`5`)} ${po(e)}`,function:e=>`${fo(`9`)} ${po(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${po(`0`)} } for (; r > 0; r--) { ${fo(`0`)} } h ^= ${t}; l ^= ${n}; }`},ho=()=>({H0:Ja,H1:Ya,H2:Xa,H3:Za,L0:Qa,L1:$a,L2:eo,L3:to,initialHigh:no,initialLow:ro}),go=(e,t)=>{let n=io,r=ao;ao=e[0],io=e[1],yo(t),e[0]=ao,e[1]=io,io=n,ao=r},_o=e=>{oo(5),co(e)},vo=e=>{oo(9),co(e)},yo=e=>{if(typeof e!=`object`||dn(e))lo(e);else if(un(e)){let t=L(e);vo(t.domain.length);for(let e=0;e<t.domain.length;e++)yo(t.domain[e]),yo(t.range[e])}else{let t=I(e).elements;_o(t.length);for(let e of t)yo(e)}},bo=e=>{let t=io,n=ao;io=no,ao=ro;for(let t of e)yo(t);let r=BigInt(io>>>0)<<32n|BigInt(ao>>>0);return io=t,ao=n,r},xo=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=io,a=ao;for(let n=0;n<e;n++)io=no,ao=ro,t(n),r[2*n]=ao,r[2*n+1]=io;return io=i,ao=a,n},So=(e,t)=>xo(e.length,n=>{for(let r of t)yo(e[n][r])}),Co=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),wo=1024,To=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*wo),relations:[]}),Eo=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},Do=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,Oo=(e,t,n,r,i)=>{let a=t===`next`?Do(e,t,r):void 0;if(a!==void 0)return a;let o=Eo(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},ko=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Ao=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?m(a):`Unknown location`}`:ko(r.body.location.range,a)||!a?`${r.name} ${m(i)}`:`${r.name} ${m(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},jo=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,Mo=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,No=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Po=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(ht(t.name)&2147483647)%e.length].unshift(t));t=e}t[(ht(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Fo=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Io=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Lo=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),Ro=(e,t,n)=>{let r=new Set(n.map(jo)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(N(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Co.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=Eo(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(jo(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?Lo(t.bounds):t.params.map(e=>e.name);m(t.body,Io(n,e.scope)),t.kind===`Function`&&Fo(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Io(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,Io(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Po(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,Mo(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,No(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,Mo(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Io(Lo(e.bounds),t)),r(Fo(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Io(Lo(e.bounds),t)),r(Fo(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Io(Lo([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Io(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Io(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},zo=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=zo(e,r,n);if(t!==-1)return t}}return-1},Bo=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=zo(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:zo(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Vo=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},Ho=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Uo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Wo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},Go=(e,t)=>t.forEach((t,n)=>{let r=bo([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*wo+i;e.registers[o]=Math.max(e.registers[o],Wo(a)+1)}),Ko=(e,t)=>{let n=e.registers.subarray(t*wo,(t+1)*wo),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*wo*wo/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*wo?a===0?i:wo*Math.log(wo/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},qo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},Jo=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>qo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},Yo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},Xo=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],Zo=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},Qo=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},$o=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||Xo(e,t))&&Yo(n,a),Zo(e,t).forEach(e=>i(e).forEach(e=>Yo(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?m(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=Zo(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>Yo(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=Xo(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,Jo(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return Zo(e,t).forEach(e=>{i(e),s(e,0)}),n},es=[`init`,`next`,`invariant`,`constraint`,`implied`],ts=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,ns=e=>es.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>ts(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||ts(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),rs=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?m(i):`Unknown location`}`,distinct:Ko(e,r)}}),relations:ns(e).map(t=>({kind:t.kind,label:t.label,...Qo(e,t),expressions:$o(e,t.node)}))}),is=(e,t,n)=>{let r=Do(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},as=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),os=(e,t)=>as.has(e)?new y(t):new x(t),ss=(e,t,n,r)=>new x(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${R(r)}`),cs=(e,t,n=e)=>{if(!cn(e)||Un(e))throw new x(`Applying ${t} to the following value,\nwhich is not a finite set:\n${R(n)}`);return I(e)},ls=e=>typeof e==`object`&&e.kind===`Operator`,z=(e,t,n)=>{let r=e[t];if(r===void 0||ls(r))throw os(n,`${n} expects a value as argument ${t+1}`);return r},us=(e,t,n)=>{let r=z(e,t,n);if(typeof r!=`boolean`)throw os(n,`${n} expects a boolean but received ${R(r)}`);return r},ds=(e,t,n)=>{let r=e[t];if(r===void 0||!ls(r))throw os(n,`${n} expects an operator as argument ${t+1}`);return r},fs=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),B=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),ps=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ms=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),hs=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(z(n,0,e),z(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),gs=e=>e>2147483647||e<-2147483648,_s=e=>new x(`Overflow when computing ${e}`),vs={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},ys={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},bs={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},xs={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ss=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ys[e.operator];if(e.kind!==`Function`)return vs[e.kind];let t=or(e);return t===void 0?`FcnRcdValue`:xs[t]},Cs=e=>bs[Ss(e)],ws=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Ts=(e,t)=>{let n=n=>(...r)=>{let i=Hi.sets?.length??0;try{return n(...r)}catch(n){if(!(n instanceof y)||n instanceof ne)throw n;let r=Wi(i);throw Hi.sets&&(Hi.sets.length=i),e.isLazy!==!0&&n instanceof x&&!r?n:ws(t,n.message)}},r=n(e.evaluate);return{...e,evaluate:(n,i)=>{if(n.length!==e.arity)throw ws(t,`array is not of length ${e.arity}`);return r(n,i)},evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Es=(e,t)=>{if(typeof e!=`number`)throw ws(t,`Cannot cast tlc2.value.impl.${Ss(e)} to tlc2.value.impl.IntValue`);return e},Ds=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Os=(e,t,n,r)=>{let i=Ds(e,n,`IntValue`,2);return hs(t,(e,n)=>{let a=Es(n,i),o=Es(e,i),s=r(o,a);if(gs(s))throw _s(`${o}${t}${a}`);return s})},ks=(e,t,n)=>{if(typeof e!=`number`)throw new x(`The ${t} argument of ${n} should be an integer, but instead it is:\n${R(e)}`);return e},As=(e,t,n=e)=>hs(e,(e,r)=>t(ks(e,`first`,n),ks(r,`second`,n))),js=(e,t,n)=>({...ms(e,t,n),isLazy:!0}),Ms=(e,t,n)=>{let r=ds(e,t,n);return()=>r.call([])},Ns=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),Ps=()=>({implication:pg,negate:mg,equivalent:hg,body:gg,condition:(e,t)=>{if(typeof e!=`boolean`)throw Xh(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Zh(t,n,e);return e},apply:ca,expectFunction:lg,tuple:li,set:qr,record:di,writtenRecord:bn,equal:mr,enumerate:Cg,choiceElements:Y_,noChoice:e=>{throw X_(e)},filterPredicate:J_,isReducible:ln,finiteElements:e=>I(e).elements,addBounded:an,normalizedSet:nr,isBeyondBound:on,cardinality:Fi,functionDomain:si,sortedFunction:rr,unassigned:(e,t)=>{throw ig(e,t)},prime:y_,keepLazyContext:ug,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>sg(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Fs,Is;const Ls=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Rs=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),zs=e=>`local${e.counter++}`,Bs=(e,t=/* @__PURE__ */ new Set)=>{let n=mt(e);return n!==void 0&&t.add(n),pt(e).forEach(e=>Bs(e,t)),t},Vs=(e,t,n)=>{let r=Bs(t),i=[...n.locals].filter(([e])=>r.has(e));if(i.length===0)return n.context;let a=Rs(e,i.map(([e])=>e));return`extend(${n.context}, ${a}, [${i.map(([,e])=>e).join(`, `)}])`},Hs=(e,t,n)=>`${Rs(e,D_(t,e.environment))}(${Vs(e,t,n)})`,Us=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},Ws=(e,t,n,r)=>{let i=zs(e),a=zs(e),o=zs(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},Gs=(e,t,n)=>{let r=t.kind===`Forall`;return Us(e,n,n=>{let i=t.bounds.map(()=>zs(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${Qs(e,r.set,n)}, ${Rs(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=zs(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${Qs(e,t.body,n)}, ${Rs(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>Ws(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Ks=(e,t,n,r,i)=>Us(e,i,i=>{let a=zs(e),o=zs(e),s=Rs(e,t),c=`choiceElements(${Qs(e,n,i)}, ${s}, ${Rs(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${Qs(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${Ws(e,a,o,l)} return noChoice(${s});`}),qs=(e,t,n,r)=>Us(e,r,r=>{let i=zs(e),a=zs(e),o=zs(e),s=zs(e),c=Rs(e,t),l=`if (!isReducible(${i})) return ${Rs(e,q_(t,e.environment))}(${i}, ${Vs(e,t,r)});`,u=Qs(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${Qs(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${Ws(e,a,s,d)} return normalizedSet(${o});`}),Js=(e,t,n,r)=>Us(e,r,r=>{let i=zs(e),a=zs(e),o=zs(e),s=zs(e),c=zs(e),l=zs(e),u=Rs(e,W_(t,e.environment)),d=Vs(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=Qs(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${Qs(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${Ws(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),Ys=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=Qs(e,r[0],n),a=Qs(e,r[1],n),o=Rs(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${Qs(e,r[0],n)}, ${Rs(e,t)})`;if(t.operator===`<=>`)return`equivalent(${Qs(e,r[0],n)}, ${Qs(e,r[1],n)}, ${Rs(e,t)})`;if(N(t))return Hs(e,t,n);let i=Xg(t.operator,e.environment);if(i?.kind!==`Builtin`)return Hs(e,t,n);if(i.name===`DOMAIN`)return`${Rs(e,eg(t))}(${Qs(e,r[0],n)})`;if(i.name===`TLCEval`)return Hs(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Rs(e,tg(t,i))}(${Qs(e,r[0],n)}, ${Qs(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&A_(r[0],a))return`${Rs(e,i.evaluateUnary)}(${Qs(e,r[0],n)})`;let o=r.length===2&&A_(r[0],a)&&A_(r[1],a);return i.evaluateBinary&&o?`${Rs(e,i.evaluateBinary)}(${Qs(e,r[0],n)}, ${Qs(e,r[1],n)})`:Hs(e,t,n)},Xs=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(N(e))return!1;let r=s_(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Xs(e.expression,t,n);case`FieldAccess`:return Xs(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Xs(e,t,n));default:return!1}},Zs=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Zs(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Zs);default:return!1}},Qs=(e,t,n)=>{let r=(t,r=n)=>Qs(e,t,r);switch(t.kind){case`Number`:return mn(t.value)?String(t.value):Hs(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(N(t))return Hs(e,t,n);let i=s_(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Rs(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Rs(e,i.value):Hs(e,t,n)}case`Apply`:return Ys(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=Rs(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Rs(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{z_(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Xs(t.function,n,e.environment)?r(t.function):Zs(t.function)?r(t.function,i):Hs(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Rs(e,t)}))`,o=$h(e.environment.runtime.version),s=o?`, ${Rs(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${Rs(e,Qh(t))}(${r(t.record)})`;case`Record`:{let i=Q_(t.fields);if($_(i))return Hs(e,t,n);let a=Rs(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Rs(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?Hs(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Gs(e,t,n):Hs(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Ks(e,t,t.set,t.pattern.name,n):Hs(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!U_(t)?Js(e,t,r.pattern.name,n):Hs(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?qs(e,t,t.bound.pattern.name,n):Hs(e,t,n);default:return Hs(e,t,n)}},$s=(e,t)=>{if(!Ns.has(e.kind)||(Is??=Ls(),!Is))return;let n={environment:t,references:[],helpers:[],counter:0},r=Qs(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
77
+ `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return Fs??=Ps(),Function(...Object.keys(Fs),...i,a)(...Object.values(Fs),...n.references)},ec=/* @__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(`,`),tc=[[`\\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`,`≀`],[`^+`,`⁺`]],nc=new Map(tc.flatMap(([e,...t])=>t.map(t=>[t,e]))),rc=e=>e.split(`!`).map(e=>nc.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),ic=/* @__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(`,`),ac=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),oc=/* @__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(`.`),sc=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
88
78
  Nat == { }
89
79
  a+b == {a, b}
90
80
  a-b == CHOOSE n : b + n = a
@@ -400,7 +390,17 @@ _CheckName(name) ==
400
390
  => (PrintT(counts) /\\ FALSE)
401
391
  _PrintCounts == PrintT(_Counts)
402
392
  =============================================================================
403
- `]]),Zf=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),Qf=`----------------------------- MODULE Bags --------------------------------
393
+ `]]),cc=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),lc={kind:`Local`},uc=/* @__PURE__ */ new WeakSet,dc=/* @__PURE__ */ new WeakMap,fc=/* @__PURE__ */ new WeakMap,pc=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},mc=new Map([...[`~>`,`-+->`,`\\cdot`,`\\X`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}]),[`'`,{key:`'`,arity:1,kind:`Builtin`}]]),hc=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,gc=e=>e.kind===`Operator`?e.params.length:0,_c=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],vc=e=>e.name.includes(`!`),yc=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},bc=(e,t,n)=>{let r=t.bindings.get(e);return r&&hc(r.position,t.location)&&(!n||hc(r.position,n.start))?r:void 0},xc=(e,t)=>e!==void 0&&t!==void 0&&m(e)===m(t),Sc=(e,t,n,r)=>{if(t===void 0)return!0;if(xc(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=m(i),o=t.range&&m(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${rc(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 '${rc(e)}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${rc(e)}. \nThis duplicates the one at ${o}.`}),!1},Cc=(e,t,n,r)=>Sc(t,yc(e,t)??bc(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,wc=(e,t,n)=>{Sc(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Tc=(e,t,n,r)=>t.reduce((e,t,i)=>Cc(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Ec=(e,t,n)=>t.reduce((e,t)=>Cc(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Dc=e=>e.kind===`Name`?[e.name]:e.names,Oc=e=>e.flatMap(e=>Dc(e.pattern)),kc=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||hc(n.location,t.location))?n:void 0},Ac=(e,t)=>{let n=kc(e,t);return n?{key:t.getKey(n),arity:gc(n),params:_c(n),kind:`Definition`}:t.imported.get(e)},jc=(e,t,n)=>yc(t,e)??Ac(e,n),Mc=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Nc=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Mc(e.location,e.spelling??t)},Pc=e=>{if(!(e.kind!==`Apply`||e.argumentsRange)){if(e.args.length===2)return`infix`;if(e.args.length===1)return hc(e.location,e.args[0].location)?`prefix`:`postfix`}},Fc=/* @__PURE__ */ new Set([`Definition`,`Instance`,`Theorem`]),Ic=(e,t,n)=>n.errors.push({location:m(t),message:`Cannot take subexpression of \`${rc(e)}'.`}),Lc=e=>!/^[\p{L}\d_]/u.test(e),Rc=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),zc=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Bc=(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])}})},Vc=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Bc(e.name,[],void 0):Bc(e.operator,e.args,e.argumentCounts),Hc=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Uc=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Oc(e.bounds),body:e.body,sets:Hc(e.bounds)};case`SetMap`:return{names:Oc(e.bounds),body:e.expression,sets:Hc(e.bounds)};case`SetFilter`:return{names:Dc(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Dc(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}},Wc=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}},Gc=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Kc=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),qc=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?qc(e.body,t):pt(e).reduce((e,n)=>e??qc(n,t),void 0)},Jc=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Jc(i,t,n||Kc(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&qc(e.set,t):qc(e,t)},Yc=e=>e.kind===`Label`?Yc(e.body):e,Xc=e=>typeof e==`number`?`argument selector ${e}`:e,Zc=`within the scope of a declaration
394
+ from outside that declaration's scope.`,Qc=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:m(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&Yc(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:Jc(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?qc(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&Kc(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${Zc}`);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=Xc(n.operand);if(l.isSufficesOpen){if(zc(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=Yc(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?jc(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=Uc(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:Wc(e);if(!c)return;let f=zc(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=zc(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(Kc(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${Zc}`);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.`))},$c=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:m(e.location.range),message:n}),!0)},el=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=m(r),a=e.params.filter((r,i)=>{let a=yc(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:m(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},tl=(e,t,n,r)=>{if(!Gc(e))return!1;let i=Vc(e),a=i[0],o=i.length>1&&a.kind===`Name`?yc(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Qc(e,i,o,t,n,r),o!==void 0},nl=(e,t,n,r)=>{let i=e.location;if(fl(e,n,r))return;let a=fc.get(e);if(a!==void 0)return a;if(pc(t))return e.kind===`Apply`?e.args.length:0;let o=yc(n,t);if(o?.isNonFact){r.errors.push({location:m(Nc(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(tl(e,n,r,!1)||Rc(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=lc),o)return o.arity;let s=Ac(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,fc.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``,l=c===``?void 0:yc(n,c)??Ac(c,r);if(l&&!Fc.has(l.kind)){Ic(c,e.kind!==`OperatorReference`&&e.selectorRanges?.[0]||Nc(e,t),r);return}if(l||c!==``&&r.facts.has(c))return e.kind===`Apply`?e.args.length:0;let u=Pc(e),d=e.kind===`OperatorReference`||u!==void 0;if(!Lc(t)||Rc(t)||!d){r.errors.push({location:m(Nc(e,t)),message:`Unknown operator: \`${rc(t)}'.`});return}let f=e.spelling??t;r.errors.push({location:m(u===`prefix`&&f===`-.`?Mc(i,`-`):Nc(e,t)),message:`Could not find declaration or definition of symbol '${f}'.`}),u&&i.range&&r.errors.push({location:m(i.range),message:`Couldn't resolve ${u} operator symbol \`${f}'.`})},rl=(e,t,n)=>(e.forEach(e=>V(e.set,t,n)),e.reduce((e,t)=>Tc(e,Dc(t.pattern),t.pattern.ranges,n),t)),il=(e,t)=>e.kind===`Identifier`&&e.name===t&&N(e)||pt(e).some(e=>il(e,t)),al=(e,t)=>{e.kind===`FunctionConstruction`&&il(e.body,t)&&(e.isRecursive=!0),pt(e).forEach(e=>al(e,t))},ol=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Oc(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:m(o),message:e})},c=e.kind===`Function`?rl(e.bounds,t,i):Ec(t,e.params,i),l=yc(c,a)??bc(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${rc(a)} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${rc(a)} already defined or declared.`),e.kind===`Function`?(V(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),al(e.body,a),e.isSelfReferential=il(e.body,a)):V(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:Sc(a,yc(t,a)??bc(a,i,o),{kind:`Definition`,arity:gc(e),range:o},i)},sl=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(yc(e,t.name)?.isPending)return e;let n={name:t.name,arity:gc(t),params:_c(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)=>vl(t,e,n),e)};return s(e.reduce((e,t)=>{let a=pc(t.name)?e:s(e,e=>!hc(t.location,e.location)),o={name:t.name,arity:gc(t),kind:`Definition`,range:t.location.range,parent:a};if(vc(t))return{...o,params:_c(t)};let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||pc(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return ol(t,a,u,i)?{...o,params:_c(t)}:a},a),()=>!0)},cl=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:yc(t,r)??bc(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},ll=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=cl(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:m(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},ul=(e,t,n)=>{if(ll(e,t,n))return;let r=e.operator,i=jc(r,t,n),a=nl(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:m(e.argumentsRange??Nc(e,r)),message:`The operator ${rc(r)} requires ${a-(cl(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>dl(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:m(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${rc(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=nl(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${rc(i.operator)} requires ${e} arguments.`)}else V(i,t,n);return!0}if(i.kind===`Lambda`){V(i,t,n);let o=i.params.length===c;return!o&&uc.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)??Nc(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return V(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=jc(u,t,n)?.params??[],f=nl(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(Nc(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.`)})},dl=(e,t,n)=>{e.kind===`Identifier`?nl(e,e.name,t,n):V(e,t,n)},fl=(e,t,n)=>{let r=dc.get(e);return r?(r.args.forEach(e=>dl(e,t,n)),n.errors.push(r.error),!0):!1},V=(e,t,n)=>{if(uc.has(e)&&!n.isGenerated){V(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>V(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(ll(e,t,n))return;let r=e.name,i=nl(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:m(Nc(e,r)),message:`The operator ${rc(r)} requires ${i} arguments.`});return}case`OperatorReference`:nl(e,e.operator,t,n);return;case`Apply`:ul(e,t,n);return;case`Lambda`:V(e.body,Tc(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:V(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&V(e.other,t,n);return;case`Let`:V(e.body,sl(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:V(e.body,rl(e.bounds,t,n),i(Oc(e.bounds)));return;case`UnboundedQuantifier`:V(e.body,Tc(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&V(e.set,t,n),V(e.body,Tc(t,Dc(e.pattern),e.pattern.ranges,n),i(Dc(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:V(e.predicate,rl([e.bound],t,n),i(Dc(e.bound.pattern)));return;case`SetMap`:V(e.expression,rl(e.bounds,t,n),i(Oc(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:m(r.location.range??Mc(r.location,r.name)),message:`Non-unique fields in constructor.`}),V(r.value,t,n)});return;case`Except`:V(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),V(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:V(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if($c(e,n))return;V(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),el(e,t,n);return;case`Subexpression`:{if(fl(e,t,n)||(e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>dl(e,t,n)),tl(e,t,n,!1)))return;let r=e.selectors[0],i=e.selectorRanges?.[0];if(r.kind!==`Name`||e.selectors[1].kind===`Name`||!i)return;let a=yc(t,r.name)??Ac(r.name,n);a===void 0&&!n.facts.has(r.name)||a?.kind===`Instance`?n.errors.push({location:m(i),message:`Unknown operator: \`${rc(r.name)}'.`}):a&&!Fc.has(a.kind)&&Ic(r.name,i,n)}}},pl=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||ll(e,t,n)||tl(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&yc(t,r)?.isNonFact?n.errors.push({location:m(Nc(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||V(e,t,n)}),ml=(e,t,n)=>(e.set&&V(e.set,t,n),Cc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),hl=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:ml(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?hl(t,e.scope,e.unit,!0):V(t,e.scope,e.unit),e),{scope:t,unit:n});return V(e.conclusion,i.scope,i.unit),i.scope},gl=(e,t,n)=>e.kind===`AssumeProve`?hl(e,t,n):(V(e,t,n),t),_l=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&pl(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>yl(t,e,r),t)},vl=(e,t,n)=>{let r=Tl(e,t,n);return e.name===void 0?r:Cc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},yl=(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=gl(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return _l(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return _l(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 pl(r.facts,t,n),o(t);case`Instance`:return o(vl(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?vl(t,e,i):sl([t],e,n),t));case`Have`:case`Case`:return V(r.expression,t,i),_l(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>V(e,t,i)),a(t);case`Take`:return a(Tc(rl(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Tc(rl(r.bounds,t,i),r.names,r.nameRanges,i);return V(r.body,o,{...i,labelParams:[...i.labelParams,...Oc(r.bounds),...r.names]}),_l(e.proof,a(t),n),a(o)}default:return _l(e.proof,a(t),n),a(t)}},bl=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:gl(e.statement,void 0,t);e.name!==void 0&&wc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),_l(e.proof,n,t),r&&(r.isInProof=!1)},xl={line:0,column:0},Sl=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Cl=(e,t)=>{let n=new Map([...mc,...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},wl=(e,t,n,i,a)=>{let o=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){V(n,o,a);return}let i=nl(n,n.name,o,a);if(i!==void 0&&i!==t.arity)throw new r(`An operator must be substituted for symbol '${rc(t.name)}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},c=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){a.errors.push({location:m(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let i=e.expression;s(r,i);let o=i.location.range;c.has(n)?o&&a.errors.push({location:m(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):c.set(n,i)});let l=t.filter(e=>!c.has(e.name)),u=e=>!yc(o,e.name)&&!Ac(e.name,a);return l.filter(e=>!u(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};s(t,n),c.set(t.name,n)}),l.filter(u).forEach(t=>{let r=e.location.range,i=t.location.range;r&&i&&a.errors.push({location:m(r),message:`Substitution missing for symbol ${rc(t.name)} declared at ${m(i)} \nand instantiated in module ${n}.`})}),c},Tl=(e,t,n)=>{let r=n.getInstance(e);return wl(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Cc(e,t,r,n),t)},El=(e,t,n,r)=>{let i=Cl(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),wl(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:xl}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Dl=(e,t)=>{let n=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>hc(e.location,t.location)?-1:+!!hc(t.location,e.location)).forEach(e=>{let a=[],o=[];try{e.check(a,o)}catch(e){if(!(e instanceof r)||!e.sany&&a.length===0)throw e;a.push(...e.sany?.errors??[])}a.forEach(e=>i(n,e)),o.forEach(e=>i(t,e))}),n},Ol=(e,t)=>{let n=Cl(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([...mc,...t.bound].map(([e,t])=>[e,{...t,position:xl}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c)=>({location:e,check:(l,u)=>c({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:l,warnings:u,hasLabelScope:s,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),l=(e,t)=>e.map(e=>c(e.location,void 0,!1,n=>wc(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return Dl([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>c(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},r=Sc(e.name,a.get(e.name),n,t);r&&(a.set(e.name,n),o.add(n)),s.push({declaration:e,binding:r?n:void 0})})),...e.definitions.map(t=>c(t.location,t,!0,n=>{Sl(e,t)?V(t.body,void 0,n):ol(t,void 0,n,o)&&a.set(t.name,{kind:`Definition`,arity:gc(t),range:t.location.range,position:t.location})})),...e.instances.map(e=>c(e.location,void 0,!1,n=>{Ec(void 0,e.params,n),t.instanced.get(e)?.forEach((e,t)=>wc(t,e,n)),e.name!==void 0&&wc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)})),...e.assumptions.map(e=>c(e.location,void 0,e.name!==void 0,t=>{V(e.expression,void 0,t),e.name!==void 0&&wc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...e.theorems.map(e=>c(e.location,void 0,e.name!==void 0,t=>bl(e,t))),...e.uses.map(e=>c(e.location,void 0,!1,t=>pl(e.facts,void 0,t))),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:m(n),message:`Symbol ${rc(t.declaration.name)} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},kl=/* @__PURE__ */ new WeakSet,Al=/* @__PURE__ */ new WeakMap,jl=(e,t)=>{if(t.length===0)return e;let n={...e};return kl.has(e)&&kl.add(n),Al.set(n,[...t,...Al.get(e)??[]]),n},Ml=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Rl(e,(e,r)=>Ml(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&N(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&N(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Nl=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Pl=/* @__PURE__ */ new WeakMap,Fl=e=>Pl.get(e)??e.name,Il=(e,t)=>(Fl(t)!==e.name&&Pl.set(e,Fl(t)),e),Ll=(e,t)=>Il(e.kind===`Function`?{...e,bounds:Nl(e.bounds,e=>t(e,[])),body:t(e.body,Oc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Rl=(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=>Ll(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Nl(e.bounds,n),body:t(e.body,Oc(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,Dc(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,Dc(e.bound.pattern))};case`SetMap`:return{...e,bounds:Nl(e.bounds,n),expression:t(e.expression,Oc(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)}}},zl=(e,t)=>{Rl(e,(e,n)=>(t(e,n),e))},Bl=`LAMBDA`,Vl=e=>`${e}@SUBSTITUTION`,Hl=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(Hl),Ul=(e,t)=>{if(e.kind!==`Identifier`)return!Hl(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=N(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!Hl(n.body)},Wl=(e,t=/* @__PURE__ */ new Set)=>{let n=mt(e),r=n===void 0||t.has(n)?[]:[n];return zl(e,(e,n)=>r.push(...Wl(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},Gl=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}},Kl=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),ql=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Jl=(e,t)=>e.map(e=>({pattern:ql(e.pattern,t),set:e.set})),Yl=(e,t)=>e.kind===`Function`?{...e,bounds:Jl(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Xl=(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=>Il({...Yl(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Jl(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:ql(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:ql(e.bound.pattern,n),set:e.bound.set}};default:return e}},Zl=e=>`${e}@ENABLED`,Ql=(e,t)=>e.modes.get(t)??e,$l=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!N(e)&&t.instantiation.variables.has(e.name),eu=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>eu(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if($l(e,t,n))return[e.name];let r=N(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?eu(r.body,t,/* @__PURE__ */ new Map):void 0},tu=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return $l(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Zl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:su(e.expression,Ql(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[su(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:su(e.subscript,Ql(t,`Primed`),n),location:r},su(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=eu(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:Zl(r),location:e.location},location:e.location},su({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},nu=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:lc}),ru=(e,t)=>e.map(e=>nu(e.name,t)),iu=(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:ru(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),au=(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:[...ru(t,r),...i.map(e=>nu(e,r))],location:r},location:r}},ou=(e,t)=>e.instantiation.isParameterized(t)?lu(e,t):void 0,su=(e,t,n)=>{let i=e=>su(e,t,n),a=t.instantiation,o=a.params,s=t=>!n.has(t)&&!N(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:su(e.expression,Ql(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:i(e.subscript),action:i(e.action),enabled:su(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Ql(t,`Enabled`),n)};let c=tu(e,t,n);if(c)return c;if(e.kind===`Identifier`&&s(e.name)){let n=a.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!Ul(n,a)))return jl(n,[e]);if(n&&r){let t=Vl(e.name);return r.set(t,n),nu(t,e.location)}let i=ou(t,e.name);if(i===void 0)return e;if(o.length===0)return{...e,name:i};let s=a.getDefinition(e.name);return s&&gc(s)>0?au(i,o,gc(s),e.location):{kind:`Apply`,operator:i,args:ru(o,e.location),location:e.location}}if(e.kind===`Apply`&&s(e.operator)){let n=e.args.map(i),s=a.substitutions.get(e.operator),c=a.substitutions.size>0||o.length>0||kl.has(e),l=e=>(c&&kl.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let t=s.kind===`Identifier`?s.name:s.operator;return l({...e,operator:t,args:n,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...e,operator:s.operator,args:[...s.args,...n],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Bl,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...e,operator:Bl,args:n,resolution:lc},location:e.location};if(s)throw new r(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=ou(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...ru(o,e.location),...n]}}if(e.kind===`OperatorReference`&&s(e.operator)){let n=a.substitutions.get(e.operator);if(n?.kind===`Identifier`||n?.kind===`OperatorReference`||n?.kind===`Lambda`)return jl(n,[e]);let r=ou(t,e.operator);if(r===void 0)return e;let i=a.getDefinition(e.operator);return o.length>0&&i?au(r,o,gc(i),e.location):{...e,operator:r}}let l=Gl(t),u=Rl(e,(e,r)=>r.length===0?i(e):su(e,t,Kl(n,r,l)));return Xl(u,n,l)},cu=(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:nu(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},lu=(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=Gl(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=Yl(Ll(i,(e,t)=>su(e,s,Kl(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&Al.set(l,[u,...Al.get(i.body)??[]]),cu({...c,body:l},r.params,i.location)}):t},uu=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Wl(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=>ou(i,e)??e,getQualifiedKey:t=>{let n=ou(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>cu(r,e.params,r.location)):t}}},du=e=>e.kind===`Let`&&e.instances!==void 0||pt(e).some(du),fu=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Rl(e,e=>fu(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>hc(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}},pu=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,mu=(e,t)=>e.definitions.some(e=>du(e.body))||e.assumptions.some(e=>du(e.expression))||e.theorems.some(e=>{let t=pu(e);return t!==void 0&&du(t)})?{...e,definitions:e.definitions.map(e=>Ll(e,e=>fu(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:fu(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=pu(e);return n===void 0?e:{...e,statement:fu(n,t,[])}})}:e,hu=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),gu={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]}},_u=(e,t)=>{let n=gu[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},vu=(e,t)=>`${e}${t}`,yu=(e,t,n)=>`${e}${t}${n}`,bu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},xu=(e,t,n)=>`${e},${t},${n}`,Su=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Cu=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),wu=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Tu=(e,t)=>{t.constraints.forEach((t,n)=>Cu(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>wu(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},Eu=(e,t,n,r)=>({...Su(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Du=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Ou=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,ku=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,{...Eu(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Au=Eu(`$Set`,0,[2],[1]),ju=Eu(`$Junction`,0,[3],[1]),Mu=Eu(`$Choose`,0,[2],[1]),Nu=Eu(`$Function`,0,[3],[1]),Pu=Eu(`$FcnApply`,0,[2,2],[1,1]),Fu=Eu(`$RcdSelect`,0,[2,0],[1,1]),Iu=Eu(`'`,2,[1],[0]),Lu=Eu(`ENABLED`,1,[2],[0]),Ru=Eu(`[]`,3,[3],[0]),zu=Eu(`$SquareAct`,2,[2,1],[0,0]),Bu=Eu(`$WF`,3,[1,2],[0,0]),Vu=Eu(`$TemporalExists`,3,[3],[0]),Hu=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Uu=e=>e.map(e=>({name:e,arity:0})),Wu=(e,t)=>t.location.range?a(`${e}.`,t.location.range):new r(`${e} at line ${t.location.line}, column ${t.location.column}`),Gu=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Ku=e=>e.kind!==`Let`&&e.kind!==`Label`,qu=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=v(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=ku.get(t)??hu.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},i=(e,t,n)=>{let r=Su(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(yu(e,n,t))}),wu(r.argConstraints,vu(e,n),t.data.level),Tu(r,t.data)}),r},a=(e,t,n=[],i=[])=>{let a=e=>i.includes(e);if(t.forEach((t,n)=>{if(t.kind===`Value`&&t.data.level>Du(e,n))throw new r(`Level error in applying operator ${rc(e.name)}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new r(`Level error in applying operator ${rc(e.name)}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},s=(t,n,r)=>e.conditions.has(xu(t,n,r)),c=Su(Math.max(e.level,...t.filter((t,n)=>Ou(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),t.forEach((t,n)=>{Ou(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),n.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>Cu(c.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Cu(c.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Cu(c.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{a(t)||Cu(c.constraints,t,Du(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>Cu(c.constraints,e,Du(r,a)))}))}),e.argParams.forEach(e=>{let t=bu(e),n=o(t.operator);n?.kind===`Operator`&&Cu(c.constraints,t.param,Du(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>wu(c.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>wu(c.argConstraints,vu(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&wu(c.argConstraints,vu(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=bu(e),n=o(t.operator);n&&wu(c.argConstraints,vu(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{a(bu(e).param)||c.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=bu(e),n=o(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(yu(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(yu(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>c.argParams.add(yu(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:_(`LAMBDA`,Uu(e.params),e.body,t)};let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{kind:`Operator`,data:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Su();return e.params.add(r),{kind:`Declared`,data:e,declared:{name:r,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:Su()}}return{kind:`Value`,data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=Hu(n,Uu(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 Wu(`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 Wu(`Action used where only temporal formula or state predicate allowed`,e);Gu.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Ku(n)&&n.kind!==r)throw Wu(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=>Tu(i,v(e,n))),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof r)||t.sany?t:Wu(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Su();case`Identifier`:return l(n(e.name,t),[]);case`Apply`:{let r=s(e.args,t);return d(e,r),l(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(ju,n)}case`Prime`:case`Unchanged`:return c(Iu,[e.expression],t);case`Enabled`:return c(Lu,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Ru,[n])}case`If`:return c(ju,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(ju,[...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(ju,[e.body],t,e.bounds.map(e=>e.set),Oc(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Wu(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Vu:ju,[e.body],t,[],e.names);case`Choose`:return c(Mu,[e.body],t,e.set?[e.set]:[],Dc(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(Au,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(Au,[e.predicate],t,[e.bound.set],Dc(e.bound.pattern));case`SetMap`:return c(Au,[e.expression],t,e.bounds.map(e=>e.set),Oc(e.bounds));case`FunctionConstruction`:return c(Nu,[e.body],t,e.bounds.map(e=>e.set),Oc(e.bounds));case`Record`:return c(Nu,e.fields.map(e=>e.value),t);case`RecordSet`:return c(Au,e.fields.map(e=>e.value),t);case`Except`:return c(Au,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Pu,[o(e.function,t),e.args.length===1?o(e.args[0],t):{kind:`Value`,data:c(Au,e.args,t)}]);case`Bracket`:return Su();case`FieldAccess`:return a(Fu,[o(e.record,t),{kind:`Value`,data:Su()}]);case`BoxAction`:case`AngleAction`:return c(zu,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(Bu,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Su()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return pt(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Hu(t,Uu(e.names))),i;default:return zl(e,(e,n)=>a(e,r,Hu(t,Uu(n)))),i}},_=(e,t,n,r)=>{let i=Hu(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Su(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(vu(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(yu(e.name,n,t.name))).map(e=>xu(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(bu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=bu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...Su(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:o}},Ju=(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`?Ju(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Su(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),Tu(a,e)}),a},Yu=(e,t,n,r)=>{let i=qu(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Ju(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=m(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:m(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=Dl([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?Ju(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw te(n)}})),...n],r);if(l.length>0)throw te(l,!1,void 0,r)},Xu=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Zu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Qu=/* @__PURE__ */ new Set([...Xu,...Zu,`Enabled`]),$u=/* @__PURE__ */ new Set([`~>`,`-+->`]),ed=/* @__PURE__ */ new Set([...$u,`\\cdot`]),td=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),nd=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),rd=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),id=(e,t)=>td.has(e)||t.builtins.get(e)?.isStateLevel===!0,ad=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(Xu.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Zu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&$u.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(Qu.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&ed.has(e.operator))&&(r[0]|=1),Qu.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=mt(e);if(u!==void 0&&!N(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{id(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),nd.has(u)&&(r[0]|=8),rd.has(u)&&(r[0]|=256),!a&&id(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}pt(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},od=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},sd=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),cd=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=ad(ft(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&270,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=od(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=od(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!sd(t[e],l[e*r])))),p=od(a,r,f,270);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&270:e),words:r}},ld=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?ud(ft(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},ud=(e,t)=>{let n=t.facts.words,r=ad(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=ld(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}sd(e.callee,r[0])||(i[0]|=r[0]&270)}),i},dd=(e,t)=>!(ld(e,t)[0]&1),fd={any:2,repeated:4,streamed:8,replayed:260},pd=(e,t,n)=>(ud(e,t)[0]&fd[n])!==0,md=(e,t,n=`any`)=>(ld(e,t)[0]&fd[n])!==0,hd=(e,t)=>{let n=ld(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},gd=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},_d=(e,t)=>{let n=ud([e],t);return n[0]&16?void 0:gd(n)},vd=(e,t)=>!!(ud([e],t)[0]&1),yd=(e,t,n)=>new x(`Applying ${e} to the following value,\nwhich is not ${t}:\n${R(n)}`),bd=e=>un(e)?L(e):void 0,xd=`a function with a finite domain`,Sd=(e,t,n)=>{let r=z(e,t,n),i=bd(r);if(!i)throw yd(n,xd,r);return i},Cd=(e,t)=>{let n=z(e,1,t),r=bd(n),i=r&&Dd(r,z(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw ss(`second`,t,`bag`,n);return i},wd=(e,t,n)=>{let r=t[n];if(!r||!Ed(r))throw ss(n===0?`first`:`second`,`(+)`,`bag`,z(e,n,`(+)`));return r},Td=(e,t)=>{if(!cn(e)||!F(e))throw t();return I(e).elements},Ed=e=>e.range.every(e=>typeof e==`number`&&e>0),Dd=(e,t)=>{let n=e.domain.findIndex(e=>Ur(t,e));return n===-1?void 0:e.range[n]},Od=(e,t)=>{if(typeof e==`number`)return e;throw t()},kd=(e,t,n)=>{let r=Od(e,n)+Od(t,n);if(gs(r))throw _s(`${e}+${t}`);return r},Ad=(e,t,n,r,i)=>{let a=Od(e.range[t],r),o=Dd(n,e.domain[t]);if(o===void 0)return a;let s=a-Od(o,i);if(gs(s))throw _s(`${a}-${o}`);return s},jd=(e,t,n,r,i=e.length)=>{let a=e.slice(0,i).find(e=>Ur(t,e[0]));a?a[1]=kd(a[1],n,r):e.push([t,n])},Md=e=>e.domain.map((t,n)=>[t,e.range[n]]),Nd=rr([],[]),Pd=e=>[fs(`EmptyBag`,Nd),B(`IsABag`,1,e=>{let t=bd(z(e,0,`IsABag`));return t!==void 0&&Ed(t)}),B(`BagCardinality`,1,e=>{let t=z(e,0,`BagCardinality`),n=Sd(e,0,`BagCardinality`),r=()=>yd(`BagCardinality`,`a bag`,t);return n.range.reduce((e,t)=>{if(typeof t!=`number`||t<=0)throw r();return kd(e,t,r)},0)}),B(`BagIn`,2,e=>{let t=Cd(e,`BagIn`);return t!==void 0&&t>0}),B(`CopiesIn`,2,e=>Cd(e,`CopiesIn`)??0),B(`\\oplus`,2,e=>{let t=[0,1].map(t=>bd(z(e,t,`(+)`))),n=wd(e,t,0),r=wd(e,t,1),i=Md(n),a=()=>ss(`second`,`(+)`,`bag`,z(e,1,`(+)`));return r.domain.forEach((e,t)=>jd(i,e,r.range[t],a,n.domain.length)),Qr(i)}),B(`\\ominus`,2,e=>{let t=z(e,0,`(-)`),n=z(e,1,`(-)`),r=bd(t),i=bd(n);if(!r)throw ss(`first`,`(-)`,`bag`,t);if(!i)throw ss(`second`,`(-)`,`bag`,n);let a=()=>ss(`first`,`(-)`,`bag`,t),o=()=>ss(`second`,`(-)`,`bag`,n);return Qr(r.domain.flatMap((e,t)=>{let n=Ad(r,t,i,a,o);return n>0?[[e,n]]:[]}))}),B(`BagUnion`,1,e=>{let t=z(e,0,`BagUnion`),n=Td(t,()=>yd(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??Nd;let r=()=>new x(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${R(t)}`),i=e=>{let t=bd(e);if(!t)throw r();return t},a=Md(i(n[0]));return n.slice(1).forEach(e=>{let t=i(e);t.domain.forEach((e,n)=>jd(a,e,t.range[n],r))}),Qr(a)}),B(`\\sqsubseteq`,2,e=>{let t=z(e,0,`\\sqsubseteq`),n=z(e,1,`\\sqsubseteq`),r=bd(t),i=bd(n);if(!r)throw yd(`\\sqsubseteq`,xd,t);if(!i)throw yd(`\\sqsubseteq`,xd,n);let a=()=>yd(`\\sqsubseteq`,`a bag`,t),o=()=>yd(`\\sqsubseteq`,`a bag`,n);return r.domain.every((e,t)=>{let n=Dd(i,e);return Od(r.range[t],a)<=(n===void 0?0:Od(n,o))})}),ps(`BagOfAll`,2,e=>{let t=ds(e,0,`BagOfAll`),n=z(e,1,`BagOfAll`),r=bd(n);if(!r)throw ss(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[],a=()=>ss(`second`,`BagOfAll`,`bag`,n);return r.domain.forEach((e,n)=>jd(i,t.call([e]),r.range[n],a)),Qr(i)}),B(`SubBag`,1,t=>{let n=z(t,0,`SubBag`);if(!un(n))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${Cs(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=L(n),i=I(qr(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new y(`Attempted to apply a function to ${R(r)}, which is not in its domain`);return Kr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>rr(e.map(e=>e[0]),e.map(e=>e[1]))))}),B(`BagToSet`,1,e=>ua(Sd(e,0,`BagToSet`))),B(`SetToBag`,1,e=>{let t=z(e,0,`SetToBag`),n=Td(t,()=>yd(`BagToSet`,xd,t));return rr([...n],n.map(()=>1))})],Fd={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},H={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},Id={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Ld=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],Rd=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
395
+ `],[`r`,`\r`],[`f`,`\f`]]),zd=1024,Bd=e=>{let t=+!!e.startsWith(``),n=t,r=0,i=t,a=!0,o=H.none,s=0,c=[Fd.emptyDocument],l=[void 0],u=[0],d=()=>`$${c.map((e,t)=>e===Fd.emptyArray||e===Fd.nonemptyArray?`[${u[t]}]`:e===Fd.emptyDocument||e===Fd.nonemptyDocument?``:`.${l[t]??``}`).join(``)}`,f=()=>` at line ${r+1} column ${n-i+1} path ${d()}`,p=e=>new y(`com.google.gson.stream.MalformedJsonException: ${e}${f()}
396
+ See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),m=()=>new y(`java.io.EOFException: End of input${f()}`),h=()=>{if(!a)throw p(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},g=e=>`/\\;#=`.includes(e)?(h(),!1):!`{}[]:, \f\r
397
+ `.includes(e),_=()=>{for(;n<e.length;){let t=e[n++];if(t===`
398
+ `){r++,i=n;return}if(t===`\r`)return}},v=t=>{for(;n+t.length<=e.length;n++)if(e[n]===`
399
+ `)r++,i=n+1;else if(e.startsWith(t,n))return!0;return!1},b=()=>{for(;n<e.length;){let t=e[n++];if(t===`
400
+ `)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)_();else if(v(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),_();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},ee=()=>{let e=b();if(e===void 0)throw m();return e},x=()=>{let t=Ld.find(t=>e[n]===t.lower[0]||e[n]===t.upper[0]);if(!t)return H.none;let r=t.lower.length;for(let i=0;i<r;i++){let r=e[n+i];if(r!==t.lower[i]&&r!==t.upper[i])return H.none}return n+r<e.length&&g(e[n+r])?H.none:(n+=r,t.token)},S=()=>{let t=Id.none,r=!1,i=0;for(;n+i<e.length;i++){if(i===zd)return H.none;let a=e[n+i];if(a===`-`){if(t===Id.none)t=Id.sign;else if(t===Id.exponentE)t=Id.exponentSign;else return H.none}else if(a===`+`){if(t!==Id.exponentE)return H.none;t=Id.exponentSign}else if(a===`e`||a===`E`){if(t!==Id.digit&&t!==Id.fractionDigit)return H.none;t=Id.exponentE}else if(a===`.`){if(t!==Id.digit)return H.none;t=Id.decimal}else if(a<`0`||a>`9`){if(g(a))return H.none;break}else if(t===Id.sign||t===Id.none)r=a===`0`,t=Id.digit;else if(t===Id.digit){if(r)return H.none}else t===Id.decimal?t=Id.fractionDigit:(t===Id.exponentE||t===Id.exponentSign)&&(t=Id.exponentDigit)}return i===zd||t!==Id.digit&&t!==Id.fractionDigit&&t!==Id.exponentDigit?H.none:(s=i,H.number)},te=()=>{let t=c.length-1,r=c[t];if(r===Fd.emptyArray)c[t]=Fd.nonemptyArray;else if(r===Fd.nonemptyArray){let e=ee();if(e===`]`)return H.endArray;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated array`)}else if(r===Fd.emptyObject||r===Fd.nonemptyObject){if(c[t]=Fd.danglingName,r===Fd.nonemptyObject){let e=ee();if(e===`}`)return H.endObject;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated object`)}let e=ee();if(e===`"`)return H.doubleQuotedName;if(e===`'`)return h(),H.singleQuotedName;if(e===`}`){if(r!==Fd.nonemptyObject)return H.endObject;throw p(`Expected name`)}if(h(),n--,g(e))return H.unquotedName;throw p(`Expected name`)}else if(r===Fd.danglingName){c[t]=Fd.nonemptyObject;let r=ee();if(r===`=`)h(),e[n]===`>`&&n++;else if(r!==`:`)throw p(`Expected ':'`)}else if(r===Fd.emptyDocument){if(b()===void 0)return H.eof;n--,e.startsWith(`)]}'
401
+ `,n)&&(n+=5),c[t]=Fd.nonemptyDocument}else if(r===Fd.nonemptyDocument){if(b()===void 0)return H.eof;h(),n--}let i=b();if(i===void 0){if(r===Fd.emptyDocument)return H.eof;throw m()}if(i===`]`&&r===Fd.emptyArray)return H.endArray;if(i===`]`||i===`;`||i===`,`){if(r!==Fd.emptyArray&&r!==Fd.nonemptyArray)throw p(`Unexpected value`);return h(),n--,H.null}if(i===`'`)return h(),H.singleQuoted;if(i===`"`)return H.doubleQuoted;if(i===`[`)return H.beginArray;if(i===`{`)return H.beginObject;n--;let a=x();if(a!==H.none)return a;let o=S();if(o!==H.none)return o;if(!g(e[n]))throw p(`Expected value`);return h(),H.unquoted},C=()=>(o===H.none&&(o=te()),o),w=()=>{if(n===e.length)throw p(`Unterminated escape sequence`);let t=e[n++];if(t===`u`){if(n+4>e.length)throw p(`Unterminated escape sequence`);let t=e.slice(n,n+4);if(!/^[\da-fA-F]{4}$/.test(t))throw p(`Malformed Unicode escape \\u${t}`);return n+=4,String.fromCharCode(Number.parseInt(t,16))}let a=Rd.get(t);if(a!==void 0)return a;if(t===`
402
+ `)return r++,i=n,t;if(`'"\\/`.includes(t))return t;throw p(`Invalid escape sequence`)},ne=t=>{let a=``,o=n;for(;n<e.length;){let s=e[n++];if(s===t)return a+e.slice(o,n-1);s===`\\`?(a+=e.slice(o,n-1)+w(),o=n):s===`
403
+ `&&(r++,i=n)}throw p(`Unterminated string`)},T=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},E=e=>{if(c.length-1>=255)throw new y(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=H.none},re=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=H.none},ie=()=>{let e=C();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},ae=()=>{let e=C(),t=e===H.unquotedName?T():ne(e===H.singleQuotedName?`'`:`"`);return o=H.none,l[c.length-1]=t,t},oe=t=>t===H.true||t===H.false?t===H.true:t===H.null?null:t===H.number?(n+=s,{literal:e.slice(n-s,n)}):t===H.unquoted?T():ne(t===H.singleQuoted?`'`:`"`),se=()=>{let e=C();if(e===H.beginArray){E(Fd.emptyArray);let e=[];for(;ie();)e.push(se());return re(),e}if(e===H.beginObject){E(Fd.emptyObject);let e=/* @__PURE__ */ new Map;for(;ie();)e.set(ae(),se());return re(),e}let t=oe(e);return o=H.none,u[c.length-1]++,t};if(C()===H.eof)return null;let ce=se();return a=!1,ce!==null&&C(),ce},Vd=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Hd=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Ud=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Wd=e=>{if(!un(e))return;let t=L(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?ui(n):void 0},Gd=(e,t)=>{let n=`tlc2.value.impl.${Ss(e)}`,r=`tlc2.value.impl.${t}`;return new y(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Kd=e=>new y(`Cannot convert value: unsupported value type tlc2.value.impl.${Ss(e)}`),qd=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Jd=e=>`[${e.map(Qd).join(`,`)}]`,Yd=e=>`{${yn(e).map(e=>`${qd(typeof e[0]==`string`?e[0]:R(e[0]))}:${Qd(e[1])}`).join(`,`)}}`,Xd=e=>{let t=L(e),n=Bi(t);return n?Jd(n):Yd(t)},Zd=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Qd=e=>typeof e==`string`?qd(e):typeof e==`object`?e.kind===`ModelValue`?qd(e.name):Ss(e)===`RecordValue`?Yd(L(e)):$d(e):String(e),$d=e=>{let t=Ss(e);if(t===`TupleValue`)return Jd(L(e).range);if(Zd(t))return Xd(e);if(fi(e))return Jd(I(e).elements);throw Kd(e)},ef=e=>e.map(e=>`${Qd(e)}\n`).join(``),tf=e=>{let t=Ss(e);if(t===`RecordValue`)return Yd(L(e));if(t===`TupleValue`)return`{${L(e).range.map((e,t)=>`"${t}":${Qd(e)}`).join(`,`)}}`;if(Zd(t))return Xd(e);throw Kd(e)},nf=e=>{if(e===null)throw new y(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Bn(e);if(Array.isArray(e))return li(e.map(nf));if(e instanceof Map)return ui([...e].map(e=>[Bn(e[0]),nf(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||gs(t))throw new y(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},rf=e=>{if(typeof e!=`string`)throw new y(`Cannot cast tlc2.value.impl.${Ss(e)} to tlc2.value.impl.StringValue`);return e},af=(e,t)=>{let n=ca(e,t);if(typeof n!=`string`)throw Gd(n,`StringValue`);return n},of=e=>{if(!Hd.has(e.toLowerCase()))throw Ud.has(e.toLowerCase())?new t(`IOUtils!Serialize does not support the charset ${e}`):new y(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},sf=(e,n,r,i)=>{let a=r.find(e=>!Vd.has(e));if(a!==void 0)throw new y(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new y(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new y(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new t(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=e.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new y(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new y(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?e.writeFile?.(n,i):e.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},cf=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},lf=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new y(`${t} (No such file or directory)`);return n},uf=e=>[Ts(ms(`ToJson`,1,e=>Bn(Qd(z(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Ts(ms(`ToJsonArray`,1,e=>Bn($d(z(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Ts(ms(`ToJsonObject`,1,e=>Bn(tf(z(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Ts(ms(`JsonSerialize`,2,t=>{let n=rf(z(t,0,`JsonSerialize`)),r=z(t,1,`JsonSerialize`);if(!Bi(r)&&!Wd(r))throw ss(`second`,`JsonSerialize`,`sequence or record`,r);return cf(e,n),e.writeFile?.(n,Qd(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Ts(ms(`ndJsonSerialize`,2,t=>{let n=rf(z(t,0,`ndJsonSerialize`)),r=z(t,1,`ndJsonSerialize`),i=Bi(r);if(!i)throw ss(`second`,`ndJsonSerialize`,`sequence`,r);return cf(e,n),e.writeFile?.(n,ef(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Ts(ms(`JsonDeserialize`,1,t=>nf(Bd(lf(e,rf(z(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Ts(ms(`ndJsonDeserialize`,1,t=>li(lf(e,rf(z(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>nf(Bd(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],df=(e,t)=>[Ts(js(`Serialize`,3,(n,r)=>{let i=Ms(n,2,`Serialize`)(),a=Wd(i);if(!a)throw ss(`third`,`ndJsonSerialize`,`sequence`,i);if(af(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Ms(n,0,`Serialize`)(),s=Bi(o);if(!s)throw ss(`first`,`Serialize`,`sequence`,o);let c=Ms(n,1,`Serialize`)();if(typeof c!=`string`)throw ss(`second`,`ndJsonSerialize`,`sequence`,c);let l=ca(a,`openOptions`);if(Ss(l)!==`TupleValue`)throw Gd(l,`TupleValue`);let u=af(a,`charset`),d=L(l).range.map(e=>{if(typeof e!=`string`)throw Gd(e,`StringValue`);return e});return of(u),sf(e,c,d,ef(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],ff={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},pf=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=er(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(ff.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(ff.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(ff.boolean),o(+!!e);return}if(typeof e==`number`){o(ff.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(ff.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(ff.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),cn(e)){let t=I(e).elements;o(ff.set),c(t.length),t.forEach(f);return}let p=L(e),m=or(e);m===`tuple`?(o(ff.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(ff.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(ff.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ie(Uint8Array.from(t))},mf=e=>[Ts(ms(`_TLCTraceSerialize`,2,t=>{let n=rf(z(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,pf(z(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],hf=25214903917n,gf=(1n<<48n)-1n,_f=e=>{let t=(BigInt.asUintN(64,e)^hf)&gf,n=e=>(t=t*hf+11n&gf,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^hf)&gf},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},vf=[],yf=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},bf=()=>{for(let e=1277011;vf.length<1341;e++)yf(e)&&vf.push(e);return vf},xf=e=>{let t=bf(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},Sf=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},Cf=e=>{for(let t=Math.max(e,9);;t++){let e=Sf(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)}}},wf=(e,t,n)=>{if(t<=0)return[];let r=Cf(t),i=BigInt(n.nextInt(t)),a=BigInt(xf(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},Tf=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Qt),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Ef=(1n<<63n)-1n-24n,Df=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Ef*BigInt(n)+i)%t;return r<0n?r+t:r})},Of=(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,kf=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=si(e.domain),n=I(e.range).elements;return{lists:t.map(()=>n),create:e=>rr(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>I(e).elements),create:t=>ui(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>I(e).elements),create:li}}},Af=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,jf=(e,t,n,r)=>{if(Mi(t))return[];let i=r===`1.7.4`?Tf:wf;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=Af(t,r)?void 0:kf(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?Df(e,t,n):i(e,Number(t),n)).map(e=>a.create(Of(a.lists,e)))}let o=I(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Mf=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...cs(e.domain,`RandomElement`,e).elements];return rr(n,n.map(()=>Mf(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return ui(e.names.map((n,r)=>[n,Mf(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return li(e.factors.map(e=>Mf(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new y(`Attempted to retrieve out-of-bounds element from the interval value ${R(e)}.`);return e.low+r}let n=cs(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new y(`Index ${r} out of bounds for length ${n.length}`);return n[r]},Nf=(e,t,n)=>{if(typeof e!=`number`||e<0)throw ss(t,n,`nonnegative integer`,e);return e},Pf=(e,t,n,r)=>Kr(Array.from({length:t},()=>Kr(e.filter(()=>r.nextDouble()<n)))),Ff=(e,t)=>{let n=`RandomSetOfSubsets`,r=Nf(z(e,0,n),`first`,n),i=Nf(z(e,1,n),`second`,n),a=z(e,2,n);if(!cn(a)||!F(a))throw ss(`third`,n,`finite set`,a);let o=I(a).elements;if(o.length<31&&r>2**o.length)throw ss(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw ss(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Pf(o,r,o.length===0?0:i/o.length,t.getRandom())},If=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Lf=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Rf=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(If.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Lf.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},zf=e=>B(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=Nf(z(t,0,n),`first`,n),i=z(t,1,n);if(typeof i!=`string`)throw ss(`second`,n,`string literal representing a probability`,i);let a=Rf(i);if(a===void 0||a<0||a>1)throw ss(`second`,n,`string literal does not represent a parsable probability`,i);let o=z(t,2,n);if(!cn(o)||Un(o)||!Li(o))throw ss(`third`,n,`finite set`,o);let s=Fi(o);if(32-Math.clz32(r)>s&&r>1<<s)throw ss(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Pf(I(o).elements,r,a,e.getRandom())}),Bf=e=>[Ts(B(`RandomSubset`,2,t=>{let n=Nf(z(t,0,`RandomSubset`),`first`,`RandomSubset`),r=z(t,1,`RandomSubset`);if(!fi(r)||!Li(r))throw ss(`second`,`RandomSubset`,`a finite set`,r);let i=Af(r,e.version);if(i&&i.reduce((e,t)=>e*I(t).elements.length,1)>nn())throw new y(rn());return Kr(jf(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),B(`RandomSetOfSubsets`,3,t=>Ff(t,e)),B(`TestRandomSetOfSubsets`,3,t=>li(Array.from({length:5},()=>I(Ff(t,e)).elements.length)))],Vf=(e,t=0n)=>{let n=_f(t),r=_f(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>ui([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,markExplored:void 0,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:bo,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},Hf=e=>Qr([...e.possibleCounts].map(([e,t])=>[e,t])),Uf=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Hf(e)]]),Wf=e=>ui([[`name`,e??`UnnamedAction`],[`location`,ui([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Gf=/* @__PURE__ */ new WeakSet,Kf=(e,t)=>{let n=ui([[`action`,Kr(e)],[`state`,Kr(t)]]);return Gf.add(n),n},qf=(e,t,n)=>{let r=e.map((e,t)=>li([t+1,ui(Object.entries(e))])),i=r.slice(1).map((e,n)=>li([r[n],t[n],e])),a=n?[li([r[r.length-1],n.action,r[n.start]])]:[];return Kf([...i,...a],r)},Jf=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Uf(e).get(t)},Yf=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0||!e.pause)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),R(r));else throw new x(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${R(n)}`)},Xf=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),Zf=e=>e.every(e=>e!==void 0),Qf=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!N(e);if(i&&t.variableIndex.has(r))return 1;let a=pt(e).map(e=>Qf(e,t,n)),o=i?_g(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Qf(o.body,t,n))),Math.max(0,...a)},$f=(e,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[js(`AssertError`,2,e=>{let t=ds(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw new y(`In computing AssertError, a non-string expression (${Xf(t)}) was used as the err of an AssertError(err, exp).`);let r=Ms(e,0,`AssertError`)();try{Ms(e,1,`AssertError`)()}catch(e){if(e instanceof y)return Ft(e.message,n.isTool)===r;throw e}return!1}),ms(`TLCGetOrDefault`,2,e=>Jf(n,z(e,0,`TLCGetOrDefault`))??z(e,1,`TLCGetOrDefault`)),ms(`Trace`,0,(e,t)=>{let r=t?.environment.variables??[],i=t?.state??r.map(()=>void 0);if(!t||!Zf(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new y(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return t.state?li(n.getBehavior(i).map(e=>{let r=t.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return ui(i===void 0?r:[[`_action`,i],...r])})):li([ui([])])}),ms(`CounterExample`,0,()=>n.counterExample??Kf([],[])),B(`ToTrace`,1,e=>{let t=z(e,0,`ToTrace`);if(typeof t!=`object`||!Gf.has(t))throw new x(`The argument of ToTrace should be a CounterExample, but instead it is:\n${R(t)}`);let n=I(ca(t,`state`)).elements.map(e=>Bi(e)??[]);return li(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),B(`TLCModelValue`,1,e=>{let t=z(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new x(`The argument of ModelValue should be a string, but instead it is:\n${R(t)}`);return $n(t)}),js(`TLCDefer`,1,(e,t)=>{let r=ds(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),B(`TLCNoOp`,1,e=>z(e,0,`TLCNoOp`)),{...js(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(n.getSimulationValue===void 0&&(!Zf(a)||i?.next&&n.isSeen(a)))return!0;let o=ds(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new y(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Cs(s)}) was used as the condition of an IF.\n${o.expression?Xf(o.expression):``}`);if(s||!i?.next||!Zf(a)||!i.state||!Zf(i.state))return!0;let c=i.state,l=n.getSuccessorAction(c,a),u=t=>e(wt(n.isTool,xt.moduleOverrideStdout,St.none,t));for(;;){u(`Extend behavior of length ${n.getLevel(c)} with a "${l?.name}" step [<Action ${l?.location.range&&m(l.location.range)}>]? (Yes/no/explored/states/diff):`);let e=n.readLine?.();if(e===void 0)throw new ne;if(/^[\0-\x20]*$/.test(e)||e.toLowerCase().startsWith(`y`))return!0;if(e[0]===`s`)u(`${Wa(n.toRecord(c)).trimEnd()}\n~>\n${Wa(n.toRecord(a)).trimEnd()}`);else if(e[0]===`d`)u(Wa(n.toRecord(a),n.toRecord(c)));else if(e[0]===`e`){if(n.markExplored)return n.markExplored(a),!0;if(n.getSimulationValue===void 0)throw new t(`tla-ts can't mark a state explored while it searches depth first.`);u(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(e[0]===`n`)return!1}}),isActionLevel:!0},js(`TLCCache`,2,(e,t)=>{let i=ds(e,0,`TLCCache`),o=ka(Ms(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=Qf(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),B(`TLCFP`,1,e=>{let t=z(e,0,`TLCFP`),n=ba(t);if(n)throw n;return Number(BigInt.asIntN(32,bo([t])))}),js(`TLCEvalDefinition`,1,(e,t)=>{let n=Ms(e,0,`TLCEvalDefinition`)();if(typeof n!=`string`)throw new x(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${R(n)}`);let r=t?_g(n,t.environment):void 0,i=r?void 0:t?.environment.builtins.get(n);if(i?.arity===0)return i.evaluate([],t);if(!r||!t)throw new x(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${R(n)}`);if(r.kind===`Operator`&&r.params.length>0){let e=r.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new x(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${n}(${e.join(`, `)})`)}return r.kind===`Operator`?W(r.body,t):W({kind:`Identifier`,name:n,location:r.location},t)})]},ep=(e,t)=>[ms(`_Track`,2,e=>{let n=String(z(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,z(e,0,`_Track`)===!0?r+1:r),!0}),ms(`_Counts`,0,()=>Hf(t)),ms(`_CheckName`,1,n=>{let r=String(z(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(R(Hf(t),!0)),!1)}),ms(`_PrintCounts`,0,()=>(e(R(Hf(t),!0)),!0))],tp=e=>`${e.getUTCFullYear()}.${It(e.getUTCMonth()+1)}.${It(e.getUTCDate())}.${It(e.getUTCHours())}${It(e.getUTCMinutes())}${It(e.getUTCSeconds())}`,np=e=>Qr([...e].map(([e,t])=>[e,li([t])])),rp=e=>ar($r(e),`record`),ip=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),ap=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),op=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),sp=(e,t,n)=>{if(e.version===`1.7.4`?!ap.has(t)||!e.isStarted&&op.has(t):!e.isStarted&&ip.has(t))throw new x(`TLCGet(${t}) was undefined.`);let r=e.getSimulationValue?.(t,n);if(r!==void 0)return r;let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return rp([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return rp([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,qa()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return rp([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Bn(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Bn(tp(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Wf(void 0);case`all`:return np(e.registers);case`all:named`:return np(Uf(e))}if(t.startsWith(`s:`)){let n=Uf(e).get(t);if(n===void 0)throw new x(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Bn(e.properties.get(t.slice(2))??t);throw new x(`TLCGet(${t}) was undefined.`)},cp=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new x(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new x(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${R(t)}`);return sp(e,t,n?.state)},lp=e=>e.length===0?[[]]:e.flatMap((t,n)=>lp([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),up=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&I(e).elements.forEach(up),e.kind===`Function`&&e.range.forEach(up))},dp=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return L(e);default:return I(e)}},fp=(e,t)=>[B(`Print`,2,t=>(e(Ba([z(t,0,`Print`),z(t,1,`Print`)]).map(P).join(` `)),z(t,1,`Print`))),B(`PrintT`,1,t=>(e(P(Ba([z(t,0,`PrintT`)])[0])),!0)),B(`Assert`,2,e=>{if(z(e,0,`Assert`)!==!0)throw new x(`The first argument of Assert evaluated to FALSE; the second argument was:\n${P(R(z(e,1,`Assert`)))}`,S.assertViolation);return!0}),B(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),B(`:>`,2,e=>Qr([[z(e,0,`:>`),z(e,1,`:>`)]])),B(`@@`,2,e=>{let t=z(e,0,`@@`),n=z(e,1,`@@`),r=un(t)?L(t):void 0,i=un(n)?L(n):void 0;if(!r)throw ss(`first`,`@@`,`function`,t);if(!i)throw ss(`second`,`@@`,`function`,n);let a=vn(r),o=vn(i).filter(e=>!a.some(t=>Ur(e[0],t[0])));return $r([...a,...o])}),B(`ToString`,1,e=>Bn(R(z(e,0,`ToString`),!0))),{...js(`TLCEval`,1,(e,t)=>{let n=dp(Ms(e,0,`TLCEval`)());return t===void 0&&up(n),n}),isStateLevel:!1},B(`Permutations`,1,e=>{let t=cs(z(e,0,`Permutations`),`Permutations`).elements;return Kr(lp(t).map(e=>Qr(t.map((t,n)=>[t,e[n]]))))}),ps(`SortSeq`,2,e=>{let t=z(e,0,`SortSeq`),n=Bi(t);if(!n)throw ss(`first`,`SortSeq`,`natural number`,t);let r=ds(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw ss(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),li(a)}),t.version===`1.7.4`?Ts({...ms(`TLCGet`,1,(e,n)=>cp(t,z(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Ts(js(`TLCGet`,1,(e,n)=>cp(t,Ms(e,0,`TLCGet`)(),n)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),ms(`TLCSet`,2,n=>(Yf(t,e,z(n,0,`TLCSet`),z(n,1,`TLCSet`)),!0)),fs(`Any`,qn),B(`RandomElement`,1,e=>Mf(z(e,0,`RandomElement`),t.getRandom()))],pp=`----------------------------- MODULE Bags --------------------------------
404
404
  (**************************************************************************)
405
405
  (* A bag, also called a multiset, is a set that can contain multiple *)
406
406
  (* copies of the same element. A bag can have infinitely many elements, *)
@@ -553,7 +553,7 @@ CopiesIn(e, B) ==
553
553
  7 Dec 98 : Corrected error found by Stephan Merz.
554
554
  6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
555
555
  5 Dec 98 : Initial version.
556
- `,$f=/* @__PURE__ */ new Map([[`Bags`,Qf],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
556
+ `,mp=/* @__PURE__ */ new Map([[`Bags`,pp],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
557
557
  (***************************************************************************)
558
558
  (* The two definitions in this standard module are overridden by TLC in *)
559
559
  (* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
@@ -1685,7 +1685,7 @@ _TLCTrace ==
1685
1685
  /\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
1686
1686
 
1687
1687
  =============================================================================
1688
- `]]),ep=new Map([...[...$f].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,Qf.replace(`
1688
+ `]]),hp=new Map([...[...mp].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,pp.replace(`
1689
1689
  LOCAL INSTANCE Naturals
1690
1690
  `,`
1691
1691
  EXTENDS TLC
@@ -1777,14 +1777,17 @@ _TEPosition ==
1777
1777
  ELSE TLCGet("level") + 1
1778
1778
 
1779
1779
  =============================================================================
1780
- `]]),tp=(e=`master`)=>e===`1.7.4`?ep:$f,np=(e,t)=>e.every(e=>Gi(e,t)),rp=Kr([!1,!0]);Vr(rp);const ip=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Zr(ip(e,t,r),ip(e,r,n))},ap=[`\\cup`,`\\cap`,`\\`],op=e=>typeof e==`object`&&e.kind===`MixedSet`,sp=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,cp=(e,t,n)=>{t.kind===`Interval`&&Fi(t);let r=t.kind===`Interval`?t:Br(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return cn(r,e=>{Gi(e,n)===i&&on(a,e)}),sp(t)?nr(a):qr(a)}if(Mi(t))return n;if(!ln(n))return ur({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return cn(r,e=>on(i,e)),cn(n.kind===`Interval`?n:I(n).elements,e=>{Gi(e,t)||on(i,e)}),qr(i)},lp=(e,t)=>{let n=(t,n)=>ts([Cs(t,n,e)()],0,e);return{...B(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},up=[rs(`TRUE`,!0),rs(`FALSE`,!1),rs(`BOOLEAN`,rp),rs(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),os(`=`,Ur),os(`#`,(e,t)=>!Ur(e,t)),B(`~`,1,e=>!ts(e,0,`~`)),B(`<=>`,2,e=>ts(e,0,`<=>`)===ts(e,1,`<=>`)),lp(`/\\`,(e,t)=>e&&t()),lp(`\\/`,(e,t)=>e||t()),lp(`=>`,(e,t)=>!e||t()),B(`\\in`,2,e=>Gi(z(e,0,`\\in`),z(e,1,`\\in`))),B(`\\notin`,2,e=>!Gi(z(e,0,`\\notin`),z(e,1,`\\notin`))),os(`\\subseteq`,(e,t)=>{if(!P(e))throw new y(`\\subseteq expects a set but received ${R(e)}`);if(typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&F(e.base))return np(I(e.base).elements,t.base);if(typeof e==`object`&&e.kind===`Interval`){if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;for(let n=e.low;n<=e.high;n++)if(!Gi(n,t))return!1;return!0}return!Ei(e,e=>!Gi(e,t))}),...ap.map(e=>B(e,2,t=>{let n=z(t,0,e),r=z(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(ln(n)&&ln(r)&&!op(n)&&!op(r)&&!i&&!sn(n)&&!sn(r)){if(e===`\\cup`&&Mi(n))return r;let t=e===`\\cup`?Zr:e===`\\cap`?Xr:Yr;return Ui((n,r)=>{let i=I(n),a=I(r),s=t(i,a);if(e===`\\cup`){let e=Br(i),t=Yr(a,i).elements,n=e===i.elements&&(t.length===0||Xn(e[e.length-1],t[0])<0);if(e.length+t.length>rn())throw new o(an());if(n&&!i.isNormalized)return s;let r=s===i?tr(s.elements):s;return n||(r.writtenElements=[...e,...t]),r}return s===n||(s.isNormalized=sp(n),i.writtenElements&&!i.isNormalized&&(s.writtenElements=i.writtenElements.filter(e=>Gi(e,s)))),s},(t,n)=>cp(e,t,n),n,r)}return ln(n)?cp(e,n,r):e!==`\\`&&ln(r)?cp(e,r,n):ur({kind:`SetOperation`,operator:e,left:n,right:r})})),B(`SUBSET`,1,e=>({kind:`Subset`,base:z(e,0,`SUBSET`)})),B(`UNION`,1,e=>{let t=z(e,0,`UNION`),n=fn(t)?Br(t):[],r=n.filter(fn);if(!fn(t)||r.length!==n.length)return ur({kind:`Union`,base:t});let i=r.flatMap(Br),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{Gi(t,e)||on(e.elements,t)}),qr(e.elements)};return op(t)||r.some(op)?a():r.length===0?Jr:Ui(e=>zi(ip(e,0,e.length),i),a,r.map(I),void 0)}),B(`DOMAIN`,1,e=>{let t=z(e,0,`DOMAIN`);if(!un(t))throw new y(`DOMAIN expects a function but received ${R(t)}`);return ua(t)})],dp=vs(`Integers`,`Neg`,`IntValue`,1),fp=e=>{let t=vs(e,`DotDot`,`IntervalValue`,2);return[ys(e,`+`,`Plus`,(e,t)=>e+t),ys(e,`-`,`Minus`,(e,t)=>e-t),ys(e,`*`,`Times`,(e,t)=>e*t),ys(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new c(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new c(`0^0 is undefined.`);return e**t}),ys(e,`\\div`,`Divide`,(e,t)=>{if(t===0)throw new c(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(ss(n))throw cs(`${e} \\div ${t}`);return n}),ys(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new c(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),B(`..`,2,e=>{let n=z(e,0,`..`),r=_s(z(e,1,`..`),t);return{kind:`Interval`,low:_s(n,t),high:r}})]},pp=fp(`Naturals`),mp=fp(`Integers`),hp=e=>{let t=pp.indexOf(e);return t===-1?void 0:mp[t]},gp=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[gs(xs(`<`,(e,t)=>e<t),t(`LT`)),gs(xs(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),gs(xs(`<=`,(e,t)=>e<=t),t(`LE`)),gs(xs(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},_p=[rs(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...pp,...gp(`Naturals`)],vp=[rs(`Int`,{kind:`InfiniteSet`,name:`Int`}),...mp,...gp(`Integers`),B(`-.`,1,e=>{let t=_s(z(e,0,`-`),dp);if(ss(-t))throw cs(`-${t}`);return-t})],yp=(e,t,n)=>{let r=z(e,t,n),i=Bi(r);if(!i)throw new c(`${n}\n${R(r)}`);return i},bp=(e,t,n)=>{let r=z(e,t,n);return typeof r==`string`?r:yp(e,t,n)},xp=(e,t,n)=>{let r=z(e,t,`SubSeq`);if(typeof r!=`number`)throw Qo(n,`SubSeq`,`natural number`,r);return r},Sp=(e,t,n)=>typeof e==`string`?Bn(e.slice(t,n)):li(e.slice(t,n)),Cp=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,wp=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Tp=(e,t)=>{let n=Zf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?gs(e,t):e}):t},Ep=e=>Tp(`Sequences`,[B(`Seq`,1,e=>({kind:`SequenceSet`,base:z(e,0,`Seq`)})),B(`Len`,1,e=>bp(e,0,Cp(``,`Len`)).length),B(`\\o`,2,e=>{let t=bp(e,0,wp(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=yp(e,1,wp(`t \\o s`,`sequence`));return li([...t,...n])}let n=z(e,1,`\\o`);if(typeof n!=`string`)throw new c(`${wp(`t \\o s`,`string`)}\n${R(n)}`);return Bn(t+n)}),B(`Append`,2,t=>li([...yp(t,0,wp(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),z(t,1,`Append`)])),B(`Head`,1,e=>{let t=yp(e,0,Cp(``,`Head`));if(t.length===0)throw new c(`Attempted to apply Head to the empty sequence.`);return t[0]}),B(`Tail`,1,e=>{let t=bp(e,0,Cp(``,`Tail`));if(t.length===0)throw new c(`Attempted to apply Tail to the empty sequence.`);return Sp(t,1)}),B(`SubSeq`,3,e=>{let t=bp(e,0,Cp(`first `,`SubSeq`)),n=xp(e,1,`second`),r=xp(e,2,`third`);if(n>r)return Sp(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new c(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${R(z(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Sp(t,n-1,r)}),is(`SelectSeq`,2,e=>{let t=ns(e,1,`SelectSeq`);return li(yp(e,0,Cp(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new c(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${t.name}>`);return n}))})]),Dp=e=>Tp(`FiniteSets`,[B(`IsFiniteSet`,1,e=>Li(z(e,0,`IsFiniteSet`))),B(`Cardinality`,1,t=>{let n=z(t,0,`Cardinality`);if(!P(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new c(`Attempted to compute cardinality of the value\n${R(n)}`);return Fi(n,e)})]),Op=[gs(B(`Warshall`,1,e=>{let t=z(e,0,`Warshall`);if(!P(t)||Un(t))throw new c(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${R(t)}`);Fi(t);let n=[],r=/* @__PURE__ */ new Map,i=e=>{let t=ka(e),i=r.get(t)??n.length;return i===n.length&&(r.set(t,i),n.push(e)),i},a=I(t).elements.map(e=>{let t=Bi(e);if(t?.length!==2)throw new c(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${R(e)}`);return[i(t[0]),i(t[1])]}),o=n.map(()=>n.map(()=>!1));a.forEach(e=>{o[e[0]][e[1]]=!0});for(let e=0;e<n.length;e++)for(let t=0;t<n.length;t++)if(o[t][e])for(let r=0;r<n.length;r++)o[e][r]&&(o[t][r]=!0);return qr(n.flatMap((e,t)=>n.flatMap((n,r)=>o[t][r]?[li([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],kp=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return Op;if(e===`AnySet`)return[rs(`ANY`,qn)];if(e===`IOUtils`)return Hd(r,a);if(e===`_TLCTrace`)return Gd(r);if(!tp(n.version).has(e))return;let o=Mp(e,t,n,r,i);return e===`Randomization`&&o?[...o,_f(n)]:o},Ap=/* @__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`]]]),jp=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),Mp=(e,t,n,r,i)=>{switch(e){case`Naturals`:return _p;case`Integers`:return vp;case`Sequences`:return Ep(n.version);case`FiniteSets`:return Dp(n.version);case`TLC`:return Tp(`TLC`,Wf(t,n));case`Randomization`:return vf(n);case`_Possible`:return Mf(t,n);case`Json`:return Vd(r);case`Bags`:return Tp(`Bags`,fd(i));case`TLCExt`:return Tp(`TLCExt`,jf(t,n));default:return}},Np=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&ul.get(t)||[];r.expressions.push(...i,t);let a=Hi.sets,o=a??[],s=o.length;Hi.sets=o;try{return n()}catch(e){throw s_(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Hi.sets=a}},Pp=(e,t,n)=>e.coverage?jo(e.coverage,t,n):-1,Fp=(e,t,n)=>e.coverage?No(e.coverage,t,n):n(),Ip=(e,t,n,r)=>Fp(e,t,()=>W(n,r)),Lp=(e,t,n,r)=>{let i=Ip(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},Rp=(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},zp=e=>!e.includes(void 0),Bp=e=>e.variables.map(()=>void 0),Vp=(e,t,n)=>{let r=[...e];return r[t]=n,r},Hp=(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}},Up=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,Wp=e=>e.kind===`Identifier`?e.name:void 0,Gp=(e,t,n)=>{if(t.kind===`Label`)return Gp(e,t.body,n);let r=Wp(t);if(r===void 0)return;let i=Gh(n,r);if(i?.kind===`Thunk`)return Gp(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=Fg(r,e);return o?.kind===`Closure`&&o.params.length===0?Gp(e,o.body,o.scope):void 0},Kp=(e,t,n)=>{if(t.kind===`Prime`)return Gp(e,t.expression,n);if(t.kind===`Label`)return Kp(e,t.body,n);let r=Wp(t);if(r===void 0)return;let i=Gh(n,r);if(i?.kind===`Thunk`)return Kp(e,i.expression,i.scope);if(i)return;let a=Fg(r,e);return a?.kind===`Closure`&&a.params.length===0?Kp(e,a.body,a.scope):void 0},qp=e=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean expression.`);return e},Jp=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Yp=(e,t,n,r)=>{let i=Zp(e,t,n,r);return i&&e.coverage&&!e.isInit&&Mo(e.coverage,r),i},Xp=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Mo(r,n),Mo(r,r.roots[n])),e.onState(t),!0},Zp=(e,t,n,r)=>t===void 0?zp(n)?Xp(e,n,r):(e.onIncomplete?.(n),!1):zp(n)&&Jp(e)?$p(e,t,n,r):t.kind===`Predicate`?em(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?gm(e,t.expression,t.rest,t.scope,n,t.node):Qp(e,t,n)&&Yp(e,t.rest,n,t.node),Qp=(e,t,n)=>{let r=e.environment,i=Ip(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return Ip(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Wh(t,r.runtime.version):t}})();try{return!Ur(i,a)}catch(t){throw e.callStack&&s_(e.callStack,[i],t),t}},$p=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return gm(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?Qp(e,i,n):qp(Ip(e,i.node,i.expression,Rp(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return Xp(e,n,r)},em=(e,t,n,r,i,a)=>tm(e,t,n,r,i,Pp(e,a,t)),tm=(e,t,n,r,i,a)=>Np(e,t,()=>{switch(t.kind){case`Let`:{let o=Rp(e,r,i),s=t.definitions,c=e.coverage?Qg(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):Qg(s,o);return em(e,t.body,n,c,i,a)}case`Label`:return em(e,t.body,n,r,i,a);default:if(um.has(t.kind))throw new y(`The state relation is not a boolean expression.`);return Np(e,t,()=>mm(e,t,n,r,i,a))}}),nm=(e,t,n,r,i)=>qp(t)&&Yp(e,n,r,i),rm=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),im=(e,t,n,r,i,a)=>{let o=Rp(e,r,i);if(t.kind===`Identifier`){let s=Gh(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return em(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return em(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:Fg(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&Wu(c,e.environment))?em(e,l.body,n,l.scope,i,a):nm(e,Lp(e,a,t,o),n,i,a)}let s=Ig(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Fp(e,a,()=>Jg(s,t.args,o));return em(e,s.body,n,r,i,a)}let c=rm.has(t.operator)?Ip(e,a,t,o):Lp(e,a,t,o);return nm(e,c,n,i,a)},am=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?Yp(e,t,Vp(n,r,i),a):Ur(o,i)&&Yp(e,t,n,a)},om=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),sm=(e,t,n)=>(e.coverage&&Po(e.coverage,t,n.length+1),n),cm=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?Gp(e.environment,o,r):Kp(e.environment,o,r),l=Rp(e,r,i);if(c===void 0)return Ip(e,a,t,l)===!0&&Yp(e,n,i,a);let u=Ip(e,a,s,l),d=i[c];if(t.operator===`=`)return am(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&e.callStack?.sources.set(f,s),d!==void 0)return Ip(e,a,t,l)===!0&&Yp(e,n,i,a);if(!fi(f))throw new y(`The right side of \\IN is not enumerable.`);return sm(e,f,Di(f)).reduce((t,r)=>Yp(e,n,Vp(i,c,r),a)||t,!1)},lm=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),um=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),dm={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},fm=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:dm[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${U(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${U(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${U(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`},pm=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Fp(e,r,()=>dg(t.bounds,t=>{let r=W(t,n),i=cg(r,t,a);return Array.isArray(i)&&sm(e,r,i),i}));return pg(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},mm=(e,t,n,r,i,a)=>{let o=Rp(e,r,i);switch(t.kind){case`Identifier`:return im(e,t,n,r,i,a);case`Apply`:return lm.has(t.operator)&&t.args.length===2?cm(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?qp(Ip(e,a,t.args[0],o))?em(e,t.args[1],n,r,i,a):Yp(e,n,i,a):im(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>om(`Predicate`,t,r,a,e),n);return em(e,o[0],t,r,i,a)}let s=o[o.length-1];return tm(e,Hp(t,o.length-1),om(`Predicate`,s,r,a,n),r,i,Up(e,a))}case`Or`:{let o=t.operands;if(t.isBulleted||o.length===2)return o.reduce((t,o)=>em(e,o,n,r,i,a)||t,!1);let s=tm(e,Hp(t,o.length-1),n,r,i,Up(e,a)),c=em(e,o[o.length-1],n,r,i,a);return s||c}case`Exists`:return pm(e,t,o,a).reduce((r,o)=>em(e,t.body,n,o,i,a)||r,!1);case`Forall`:{let r=pm(e,t,o,a);if(r.length===0)return Yp(e,n,i,a);let s=r.slice(1).reduce((e,n)=>om(`Predicate`,t.body,n,a,e),n);return em(e,t.body,s,r[0],i,a)}case`If`:return em(e,qp(Ip(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>qp(Ip(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new y(`TLC encountered a CASE with no conditions true.`);return em(e,s,n,r,i,a)}case`FunctionApplication`:{let r=yg(Ip(e,a,t.function,e.isInit?o:Yh(o)));if(r){let s=Fp(e,a,()=>bg(r,t,o));return em(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return gm(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=em(e,t.action,n,r,i,a);return gm(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return em(e,t.action,om(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?fm(t):void 0;if(s!==void 0)throw new y(s);return nm(e,Ip(e,a,t,o),n,i,a)},hm=(e,t,n)=>e.runtime.warn(St.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${U(n)}`),gm=(e,t,n,r,i,a)=>Np(e,t,()=>{let o=Pp(e,a,t),s=Gp(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!Ur(a,r)?(hm(e.environment,s,t),!1):am(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return Yp(e,n,i,o);let c=s.reduceRight((e,t)=>om(`Unchanged`,t,r,o,e),n);return gm(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=Gh(r,t.name);if(a?.kind===`Thunk`)return gm(e,a.expression,n,a.scope,i,o);let s=a?void 0:Fg(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return gm(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Rp(e,r,i),s=Ig(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return gm(e,s.body,n,Jg(s,t.args,a),i,o)}let c=e.environment,l=Ip(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=Ip(e,o,t,{environment:c,scope:r,state:i,next:void 0});return Ur(l,u)&&Yp(e,n,i,o)}),_m=(e,t,n,r,i)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i}),vm=/* @__PURE__ */ Error(`The replay found a successor`),ym=(e,t,n,r)=>{let i=_m(r,`enabled`,n,()=>{throw vm}),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=om(`Changed`,e.subscript,t,-1,void 0);em(i,e.action,n,t,Bp(r),-1)}else em(i,e,void 0,t,Bp(r),-1);return!1}catch(e){if(e!==vm)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},bm=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=_m(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>om(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);em(o,i.expression,s,i.scope,Bp(t),i.node??-1)},xm=(e,t,n,r)=>{e.some(e=>um.has(e.expression.kind))||e.forEach(e=>{let i=[];Sm(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},Sm=(e,t,n,r,i,a)=>{let o=_m(r,`next`,n,i,a);em(o,e.expression,void 0,e.scope,Bp(r),t)},Cm=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(Gp(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=Gh(r,e.name)?void 0:Fg(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,Qg(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){Kp(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=Gh(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?Ig(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:Fg(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,Jg(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},wm=/* @__PURE__ */ new WeakMap,Tm=/* @__PURE__ */ new WeakMap,Em=(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},Dm=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Om=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,km=(e,t)=>{let n=new y(t);return e.isInit?n:S(n,w.error)},Am=(e,t,n,r)=>{let i=Ph(n);return r&&um.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 ${Om(e)}, TLC expected a boolean expression,\nbut instead found ${R(t)}.\n${i}`},jm=(e,t,n)=>{let r=ms(t),i=U(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${Om(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
1781
- `:``}${i}`},Mm=(e,t,n)=>Fm(e,t,W(t,n)),Nm=new Set(up.map(e=>e.name)),Pm=e=>e.kind===`Apply`?Nm.has(e.operator):e.kind!==`Identifier`&&!um.has(e.kind),Fm=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;let i=Am(e,n,t,r);throw e.isInit&&r&&Pm(t)?new d(i):km(e,i)},Im=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=p_(n,r.environment))(r),Lm=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Rm=(e,t,n)=>{let r=n?wm:Tm,i=r.get(e);if(i)return i;let a=vh(e,t,n),o=n?void 0:_h(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},zm=(e,t)=>{if(t.constants.has(e))return;let n=ng(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Bm=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Bm(e.expression,t,!1,r);if(e.kind!==`Identifier`||M(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=zm(e.name,t);if(a&&!r.has(a))return r.add(a),Bm(a.body,t,n,r)},Vm=(e,t,n)=>Bm(e,t,!n),Hm=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Hm(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Qg(e.definitions,Em(r,t,n));return Hm(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Gh(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return Hm(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=zm(e.name,r.environment);if(s)return Hm(s.body,void 0,n,r,i)},Um=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||M(e))||!t&&e.kind===`Prime`,Wm=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Wm(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=zm(e.name,t);if(i)return n.add(e.name),Wm(i.body,t,n)},Gm=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Km=(e,t,n)=>Gm.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Lm(e.operator)&&(Um(e.args[0],n)||Vm(e.args[0],t,n)!==void 0)||M(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,qm=/* @__PURE__ */ new Set,Jm=(e,t)=>{if(M(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return yl(e,(e,i)=>{let a=r?Jm(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},Ym=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||M(e)?void 0:ng(r,t);return i&&!n.has(i)&&(n.add(i),Ym(i.body,t,n))?!0:mt(e).some(e=>Ym(e,t,n))},Xm=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Vm(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=Wm(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return Km(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Rm(e,t,n)}},Zm=(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(Yu(e,t)===void 0||Ym(e,t,/* @__PURE__ */ new Set))return!0;let n=Jm(e,qm);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)}},Qm=(e,t,n)=>{let r=e.map(e=>Xm(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Jp(t);for(let s=e;s<r.length;s++){if(s>0&&f&&bh(u)){d??=Em(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!Ur(t,i[e.index])}):void 0;if(o){hm(t.environment,o.index,o.expression);return}let s=n.expression,c=Im(a,e,s,d);if(!Fm(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Em(t,n,u);let r=Im(i,s,e.expression,d);if(!Fm(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Em(t,n,u);let r=Im(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Dm(u,e.index,r),d=void 0;else if(!Ur(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!Ur(e,n[i.index])){hm(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},$m=e=>{let t=fm(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw km(n,t);Mm(n,e,Em(n,r,i))&&s(i,a)}},eh=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Em(r,i,a);if(a[l]!==void 0){Mm(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!fi(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Om(r)}, the right side of \\IN is not enumerable.`;throw km(r,`${t}\n${U(e)}`)}let p=Di(f);if(r.generator){for(let e of lf(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(Dm(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(Dm(a,l,p[e]),o)}},th=/* @__PURE__ */ new WeakMap,nh=e=>{let t=th.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(nh),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return th.set(e,n),n},rh=(e,t)=>{let n=e.args[0],r=$m(e),i=(e,r,i)=>Hm(n,r,i,e,!t)??-1,a=eh(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],Em(t,n,o));l(Dm(o,u,d),s)}},ih=(e,t,n)=>{let r=U(e);return(i,a,o,s,c,l)=>{let u=Em(i,a,o),d=W(e.function,n?u:Yh(u)),f=yg(d);if(f!==void 0){Rm(f.body,t,n)(i,bg(f,e,u),o,s,c,l);return}if(!un(d))throw km(i,`In computing ${Om(i)}, a non-function (${ms(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw km(i,`In computing ${Om(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},ah=(e,t)=>{let n=nh(e);return Wm(e,t)?Qm([n],t,!1):e.kind===`Tuple`?Rm(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Gh(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Rm(nh(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=Em(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=Ig(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Rm(nh(n.body),t,!1)(r,Jg(n,e.args,u),a,o,s,c);return}}Mm(r,n,u)&&c(a,o)}},oh=(e,t,n)=>{let r=e.operator,i=$m(e),a=M(e)?void 0:Fg(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=v_(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=Rm(a.body,t,n),o(e,i(Em(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Em(a,o,s),f=Ig(e,d);f?.kind===`Closure`?Rm(f.body,t,n)(a,Jg(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},sh=(e,t,n)=>{let r=$m(e),i=M(e)?void 0:zm(e.name,t),a;return(o,s,c,l,u,d)=>{let f=Gh(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Rm(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&Ag(i,t)!==void 0?r(o,s,c,l,u,d):(a??=Rm(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},ch=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||M(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!M(i))return;let a=Bm(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},lh=e=>e.kind===`And`?e.operands.flatMap(lh):[e],uh=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Km(e,t,!1),dh=e=>{let t=[];return(n,r,i)=>{let a=Em(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Fm(n,i,Im(t,r,i,a)))return}}},fh=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=lh(e),r=n.findIndex(e=>!uh(e,t)||ch(e,t)),i=r===-1?void 0:ch(n[r],t);return i?{...i,before:r===0?void 0:dh(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>fh(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||M(e))return;let r=Fg(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=fh(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!M(o))return;let s=i.before,c=s&&v_(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Em(e,t,n)),n))}},ph=(e,t,n)=>{let r=Gh(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},mh=(e,t,n)=>{let r=e.map(e=>Rm(e,t,n)),i=n?[]:e.map(e=>fh(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&ph(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},hh=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=Qd(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},gh=(e,t)=>{let n=Rm(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=Em(r,i,a),u=t.runtime.version,d=dg(e.bounds,e=>W(e,l)).map((n,r)=>lf(og(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,qh(i,l,e)))};f(d.length-1,i)}},_h=(e,t)=>{if(e.kind===`Exists`)return gh(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Rm(e,t,!1));return e.isBulleted?hh(n):n.reduce((e,t)=>hh([e,t]))},vh=(e,t,n)=>{let r=e=>Rm(e,t,n);switch(e.kind){case`And`:return Qm(e.operands,t,n);case`Or`:return mh(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=og(W(a.set,Em(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,Kh(r,e,u[t]),o,s,c,l)}}let o=n?void 0:Zm(e,t);if(o){let r=Qm(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=Em(n,i,a),d=dg(e.bounds,e=>og(W(e,u),e,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=Kh(t,o.names[e],r);if(e===d.length-1){let e=Em(n,i,a);if(!o.guards.every(t=>Mm(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{mg(e.bounds,Em(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Yu(e,t)!==void 0&&!Ym(e.body,t,/* @__PURE__ */ new Set)?Jm(e,qm):void 0;return(t,n,r,o,s,c)=>{let l=[];mg(e.bounds,Em(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Gh(n,e)?.kind===`Value`)){u.every(n=>Mm(t,e.body,Em(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&bh(r)?u.slice(n).every(n=>Mm(t,e.body,Em(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=W(e.condition,Em(r,i,a));if(typeof l!=`boolean`)throw km(r,jm(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=Em(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw km(r,`In computing ${Om(r)}, a non-boolean expression${r.isEnabled?``:` `}(${ms(t)}) was used as a guard condition of a CASE.\n${Ph(e.source)}`)})?.body??n;if(!u)throw km(r,`In computing ${Om(r)}, TLC encountered a CASE with no conditions true.\n${U(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=e_(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Qg(e.definitions,Em(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new y(`UNCHANGED appears in an initial predicate at ${jh(e)}`)}:ah(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return Mm(e,i,Em(e,n,r))}catch(n){throw e.isEnabled?Wh(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 mh([e.action,nh(e.subscript)],t,n);case`Label`:return r(e.body);case`Identifier`:return sh(e,t,n);case`FunctionApplication`:return ih(e,t,n);case`Apply`:{let i=e.args;if(Lm(e.operator)){let r=Vm(i[0],t,n);if(r!==void 0)return e.operator===`=`?Qm([e],t,n):eh(e,()=>r);if(Um(i[0],n))return rh(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=W(i[0],Em(n,r,a));if(typeof l!=`boolean`){let t=ms(l),r=U(e);throw km(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return oh(e,t,n)}default:return $m(e)}},yh=e=>e.variables.map(()=>void 0),bh=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},xh=(e,t)=>{let n=t.state;if(!n||!bh(n))throw new y(`ENABLED needs a complete state at ${jh(e)}`);let r=t.environment;if(r.callStack)return ym(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return Rm(e,r,!1)(i,t.scope,yh(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Sh=(e,t,n,r,i)=>{let a={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Rm(e,t,!0)(a,r,yh(t),void 0,!1,e=>{if(!a.isStopped){if(!bh(e)){if(i){a.isStopped=i([...e]);return}throw S(new f([...e]),w.error)}a.isStopped=n(e)}})},Ch=(e,t,n)=>{let r=[];return Sh(e,t,e=>(r.push(e),!1),n),r},wh=(e,n,r,i,a,o,s)=>{let c={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1,generator:o,successors:0,onUnsatisfied:s};return Rm(e,r,!1)(c,a,yh(r),void 0,!1,(e,n)=>{if(!c.isStopped){if(!bh(e)){let i=r.variables.filter((t,n)=>e[n]===void 0);throw new t(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,e,n,i)}c.successors++,c.isStopped=i({state:e,action:n})}}),c.successors},Th=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Rm(e,n,!1)(i,r,yh(n),void 0,!1,e=>{bh(e)||(i.isStopped=!0)}),i.isStopped},Eh=(e,t,n,r)=>{let i=[];return wh(e,t,n,e=>(i.push(e),!1),r),i},Dh=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Oh=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),kh=e=>Oh.has(e.kind)||e.kind===`Apply`&&Dh.has(e.operator),Ah=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&ln(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},jh=e=>`line ${e.location.line}, column ${e.location.column}`,U=e=>{let t=e.location.range;return t?g(t):jh(e)},Mh={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Nh=(e,t)=>new y(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${U(t)}`),Ph=e=>e.kind===`Number`?e.text??String(e.value):U(e),Fh=(e,t)=>new y(`A non-boolean expression (${ms(t)}) was used as the condition of an IF.\n${U(e)}`),Ih=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new y(`A non-boolean expression (${ms(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Ph(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new y(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${ms(n)}.\n${U({...e,location:{...e.location,range:{...r,end:i}}})}`)},Lh=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${N(R(n))}\n${U(e)}`,r=e=>`Attempted to apply function:\n${N(R(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!un(i))throw new y(`Attempted to select field "${t}" from a non-record value ${N(R(i))}\n${U(e)}`);let a=or(i);if(a===`tuple`)throw na(t);return ca(i.kind===`LazyFunction`?L(i):i,t,a===`record`?n:r)}},Rh=e=>e===`1.7.4`?(t,n)=>$i(t,n,e):void 0,zh=e=>t=>{if(!un(t))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${ms(t)})\n${U(e)}`);return ua(t)},Bh=(e,t)=>(n,r)=>{if(!P(n)||Un(n))throw new y(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${U(e)}`);return t.evaluateBinary?t.evaluateBinary(n,r):t.evaluate([n,r])},Vh=e=>S(new y(`TLC can't handle real numbers.\n${e.text}`),w.configParseError),Hh=e=>S(new y(`TLC can't handle a number this big.\n${e.text??e.value}`),w.error),Uh=(e,t)=>new a(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${U(t)}`,e),Wh=(e,t)=>e instanceof a&&t!==`1.7.4`?new y(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,Gh=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Kh=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),qh=(e,t,n)=>{if(t.kind===`Name`)return Kh(e,t.name,n);let r=Bi(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new y(`Argument mismatch in operator application.${e?g(e):``}`)}return t.names.reduce((e,t,n)=>Kh(e,t,r[n]),e)},Jh=(e,t)=>{if(un(e))return e;throw new y(`A non-function (${ms(e)}) was applied as a function.\n${U(t)}`)},Yh=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Xh=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Zh=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Expected ${t} to be a boolean but found ${R(e)}`);return e},Qh=(e,t,n)=>{if(typeof e!=`boolean`)throw new y(`Attempted to evaluate an expression of form P => Q when ${n} was\n${ms(e)}.\n${U(t)}`);return e},$h=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Attempted to apply the operator ~ to a non-boolean\n(${ms(e)})\n${U(t)}`);return!e},eg=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new y(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${U(n)}`);return e===t},tg=(e,t)=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${Ph(t)}`);return e},ng=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),rg=(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.`},ig=(e,t,n)=>{if(!P(e)||Un(e)){let r=R(e),i=n===`1.7.4`?void 0:rg(e,r);throw new y(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Ph(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Ph(t)}\n${i}`)}},ag=(e,t,n)=>(ig(e,t,n),typeof e==`object`&&e.kind===`Interval`?ai(e):yi(e)??Ti(e)),og=(e,t,n)=>n===`1.7.4`?(ig(e,t,n),yi(e)??Di(e)):ag(e,t,n),sg=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Fi(e),e},cg=(e,t,n)=>sg(e)??og(e,t,n),lg=(e,t,n)=>sg(e)??ag(e,t,n),ug=(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},dg=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),fg=(e,t)=>dg(e,e=>cg(W(e,t),e,t.environment.runtime.version)),pg=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):ug(t[n],t=>i(n-1,qh(a,e[n].pattern,t)));return i(e.length-1,n)},mg=(e,t,n)=>pg(e,fg(e,t),t.scope,n),hg=(e,t)=>{let n=dg(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},gg=(e,t,n)=>{if(e.length===1)return qh(t,e[0].pattern,n);let r=Bi(n)??[];return e.reduce((e,t,n)=>qh(e,t.pattern,r[n]),t)},_g=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,vg=e=>Object.assign(e.value,{lambda:e}),yg=e=>_g(e)?e.lambda:void 0,bg=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:li(i),o=(e,n,i)=>`In applying the function\n${N(R(r))},\nthe ${e} is:\n${N(R(n))}${i}.\n${U(t.function)}`,s=e.bounds;if(s.length===1){if(!Gi(a,r.domain))throw new y(o(`first argument`,a,`which is not in its domain`));return gg(s,e.scope,a)}let c=Bi(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[],u=()=>new y(`In applying the function\n${N(R(r))},\nthe argument list is:\n${N(R(a))}\nwhich does not match its formal parameter.\n`);if(c===void 0||(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!Gi(n,l[t]))throw new y(o(r,n,`${e.pattern.kind===`Name`?``:`
1782
- `}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Bi(n)?.length!==e.pattern.names.length)throw new y(o(r,n,`which does not match its formal parameter`))}),c.length>s.length))throw u();return gg(s,e.scope,a)},xg=(e,t)=>{let n=t.location.range;if(n)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:g(n)}},Sg=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Cg=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},wg=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),Tg=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Eg=(e,t)=>{let n=hg(e.bounds,t),r=Cg(n,(n,r)=>W(e.body,Xh(t,gg(e.bounds,Kh(void 0,e.name,r),n))),Sg(xg(e.bounds,e.body),e.bounds,n),wg(e.bounds));vg({value:r,bounds:e.bounds,body:e.body,scope:Kh(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=Eg(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?sr(i):i},Dg=(e,t)=>{if(typeof t!=`object`||or(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!ln(t.domain))return t;try{let e=L(t);return rr(e.domain,e.range)}catch(e){if(e instanceof y)return t;throw e}},Og=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new y(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>Eg(e,t):p_(Tg(e),t):p_(e.body,t),kg=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=Og(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(Xh(e,void 0)):e=>a[i]??r(Xh(e,void 0));return t.definitionEvaluators.set(e,o),o},Ag=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},jg=(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)||!Wu(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>Dg(e,Og(e,t)(i)));Vr(n),t.startupValues[r]=n}catch(e){if(!(e instanceof y)&&!ee(e))throw e}}),Mg=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&mr(e[n],t))}catch(e){if(e instanceof y)return!1;throw e}},Ng=(e,t)=>{let n=e.cache;if(n!==void 0&&Mg(t.state,e.state)&&Mg(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?No(r,i,()=>W(e.expression,Xh(t,e.scope))):W(e.expression,Xh(t,e.scope));return(!e.isStreamed||ki(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},Pg=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),Fg=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Fg(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Pg(r):t.builtins.get(e)},Ig=(e,t)=>M(e)?Lg(e.operator,t):Fg(e.operator,t.environment)??Lg(e.operator,t),Lg=(e,t)=>{let n=Gh(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Fg(e,t.environment)},Rg=e=>e.kind===`Closure`?e.params.length:e.arity,zg=(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:Lg(n,t);if(!r)throw new y(`Expected an operator argument at ${jh(e)}`);return r},Bg=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>Kh(e,n.name,t[r]),e.scope);return W(e.body,Xh(n,r))},Vg=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Rg(e),call:n=>Bg(e,n,t)},Hg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Lg(e.name,t);return n!==void 0&&Rg(n)>0},Ug=(e,t)=>e.map(e=>Hg(e,t)?Vg(zg(e,t),t):W(e,t)),Wg=(e,t)=>new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),Gg=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Kg=(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 Kg(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([])}},qg=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&mn(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=Gg(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=M(e)?void 0:Kg(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=Gh(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Gg(e,t)}}return t=>Gg(e,t)},Jg=(e,t,n,r)=>{if(t.length!==e.params.length)throw Wg(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:zg(t[a],n)}:(r?.[a]??qg(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},Yg=(e,t,n,r)=>e.kind===`Closure`?W(e.body,Xh(n,Jg(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(g_(t,n),n):e.evaluate(Ug(t,n),n),Xg=/* @__PURE__ */ new WeakMap,Zg=e=>{let t=Xg.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return Xg.set(e,n),n},Qg=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:Zg(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},$g=(e,t,n)=>{let r=Gh(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Ng(r,n);if(r?.kind===`Operator`){if(Rg(r.operator)===0)return Bg(r.operator,[],n);throw new y(`Operator ${e} is used without arguments`)}let i=Kg(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Uh(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return kg(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new y(`Unknown identifier ${e} at ${jh(t)}`)},e_=(e,t)=>({impure:new Set(e.filter(e=>Ku(e,t))),streamed:new Set(e.filter(e=>Ku(e,t,`streamed`)))}),t_=e=>[...e.facts.ids.keys()].some(t=>Ku(t,e)),n_=e=>[...e.facts.ids.keys()].some(t=>Ku(t,e,`repeated`)),r_=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,i_=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),a_=e=>t=>{let n=e(t);return mr(n,e(i_(t)))},o_=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Hi.sets,s=Hi.callStack,c=a??[],l=c.length;Hi.sets=c,Hi.callStack=r;try{let a=t(i),o=r_(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&kh(e)&&r.sources.set(o,e),o}catch(t){t instanceof o&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Ah(e,r.values),a=i&&!mt(e).some(e=>e===n)?r.values.get(i):void 0,s=e.kind===`FunctionApplication`&&a!==void 0&&!un(a)?void 0:a;throw s_(r,[s,...c.slice(l).filter(e=>e!==s)],t),t}finally{r.isFrozen||r.expressions.pop(),c.length=l,Hi.sets=a,Hi.callStack=s}},s_=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof y){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},c_=(e,t,n)=>{if(!(n instanceof y))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},l_=e=>({...e,coverage:void 0,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),u_=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},d_=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=jo(n,i,e);Mo(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},f_=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=B_(e,t),i=t.callStack,a=i&&ul.get(e),o=i?o_(e,r,t,i):r,s=i&&a?u_(e,a,o,i):o,c=t.coverage,l=c?d_(e,s,c):s;return t.evaluators.set(e,l),l},p_=(e,t)=>{if(t.callStack||t.coverage)return f_(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=Ws(e,t)??f_(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>p_(e,t.environment)(t),m_=(e,t)=>{let n=e.name,r=M(e)?void 0:Kg(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Uh(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=kg(e,t))(r)}return t=>$g(n,e,t)},h_=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||M(e))return!0;let n=Fg(e.name,t);return n===void 0||Rg(n)===0},g_=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),__=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(g_(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&h_(t[0],n)){let e=f_(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&h_(t[0],n)&&h_(t[1],n);if(i&&a){let e=f_(t[0],n),r=f_(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(Ug(t,n),n)},v_=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Wg(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:qg(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:zg(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},y_=(e,t,n)=>{let r=v_(e,t,n),i;return t=>(i??=p_(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},b_=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=f_(n[0],t),i=f_(n[1],t);return t=>!Qh(r(t),e,`P`)||Qh(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=f_(n[0],t);return t=>$h(r(t),e)}if(e.operator===`<=>`){let r=f_(n[0],t),i=f_(n[1],t);return t=>eg(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw Nh(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=M(e)?void 0:Fg(e.operator,t);if(r?.kind===`Closure`)return y_(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=f_(n[0],t),i=zh(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!ll.has(e)&&!Xu(n[0],t);return e=>r.evaluate(g_(n,e),i&&e.scope===void 0?void 0:e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=f_(n[0],t),a=f_(n[1],t),o=Bh(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return __(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new y(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let i=n.map(e=>qg(e,t));return r=>{let a=Lg(e.operator,r);if(a)return Yg(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new y(`${e.operator} is a function; apply it with brackets`):new y(`Unknown operator ${e.operator} at ${jh(e)}`)}},x_=(e,t)=>{let n=e.kind===`Forall`,r=f_(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=f_(i.set,t);return s=>ug(cg(o(s),i.set,t.runtime.version),t=>tg(r(Xh(s,Kh(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=dg(a,e=>cg(f_(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?tg(r(Xh(o,a)),e)!==n:ug(s[t],e=>c(t-1,Kh(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>mg(a,t,i=>tg(r(Xh(t,i)),e)!==n)?!n:n},S_=(e,t)=>{if(e.kind===`Tuple`)return li(e.names.map(e=>{let n=Gh(t,e);return n?.kind===`Value`&&n.value}));let n=Gh(t,e.name);return n?.kind===`Value`?n.value:void 0},C_=/* @__PURE__ */ new WeakSet,w_=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&C_.add(e)},T_=/* @__PURE__ */ new WeakMap,E_=e=>{if(T_.has(e))return T_.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=ht(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),mt(e).every(n)},r=n(e)?[...t]:void 0;return T_.set(e,r),r},D_=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=Gh(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),O_=e=>C_.has(e),k_=(e,t)=>{let n=O_(e),r=f_(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(Xh(t,Kh(t.scope,n,e)));if(sn(e))return Fi(e),cn(e,i),d(e,t);let o=si(e),s=rr(o,o.map(i));return ln(e)?s:(s.lambdaDomain=e,sr(s))}let n=[],s=dg(i,e=>lg(W(e,t),e,t.environment.runtime.version));return pg(i,s,t.scope,e=>{let o=i.length===1?S_(a.pattern,e)??!1:li(i.map(t=>S_(t.pattern,e)??!1));return n.push([o,r(Xh(t,e))]),!1}),Qr(n)},c=xg(i,e.body),l=wg(i),u=E_(e.body),d=(t,n)=>{let a=D_(n.scope,u),o=Xh(n,a),s=vg({value:Cg(t,e=>r(Xh(o,gg(i,a,e))),Sg(c,i,t),l),bounds:i,body:e.body,scope:a});return i.length===1?sr(s):s},f=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!F(t))return d(t,r);if(!(i.length===1?ln(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(ln))){if(f)return d(t,r);try{return s(t,r)}catch(e){if(!(e instanceof y))throw e;return d(t,r)}}if(!f)return s(t,r);try{return s(t,r)}catch(t){throw c_(f,e,t),t}},createLazy:d}},A_=(e,t)=>{let n=k_(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=f_(r[0].set,t);return t=>n(e(t),t)}return e=>n(hg(r,e),e)},j_=(e,t)=>{let n=C_.has(e);n&&w_(e.function);let r=f_(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=>f_(e,t))}),value:f_(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):li(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Xh(i,Kh(i.scope,`@`,e))):da(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(St.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${U(e.function)}`)}return n}},M_=(e,t)=>{let n=f_(e.predicate,t),r=e.bound.pattern,i=e.predicate.location.range,a=i&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:g(i)},o=Ph(e.predicate),s=t.coverage,c=(e,t,n)=>{if(!s||e===-1)return n();t||s.secondary[e]++;let r=No(s,t?-1:e,n);return!t&&r===!0&&s.secondary[e]++,r},l=(t,n,i,s)=>({kind:`FilteredSet`,base:t,test:(e,t)=>{if(r.kind===`Tuple`&&Bi(e)?.length!==r.names.length)throw new y(`Attempted to check if the value:\n${N(R(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=c(s,t,()=>i(Xh(n,qh(n.scope,r,e))));if(typeof a!=`boolean`)throw new y(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${o} yielded non-Boolean value.`);return a},source:a,rebind:r=>l(t,{...n,environment:r},f_(e.predicate,r),-1)});return(e,t,r=-1)=>l(e,t,n,r)},N_=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${ms(e)}.\n${Ph(t.predicate)}`);return e},P_=(e,t,n,r)=>{if(!P(e)||Un(e))throw new y(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${U(t)}`);return Hr(e),lg(e,n,r)},F_=e=>new y(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${U(e)}`),I_=(e,t)=>{if(e.kind===`SetFilter`){let n=f_(e.predicate,t),r=f_(e.bound.set,t),i=M_(e,t),a=e.bound.pattern,o=t.coverage;return t=>{let s=r(t);if(!ln(s))return i(s,t,o?.current);let c=[],l=r=>{let i=n(Xh(t,qh(t.scope,a,r)));N_(i,e)&&on(c,r)},u=s.kind===`Interval`?s:I(s).elements;return cn(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),nr(c)}}if(e.kind===`SetMap`){let n=f_(e.expression,t);return t=>{let r=[];return mg(e.bounds,t,e=>(on(r,n(Xh(t,e))),!1)),qr(r)}}let n=e.set;if(!n)return()=>{throw new y(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`)};let r=f_(e.body,t),i=f_(n,t);return t=>{let a=P_(i(t),e,n,t.environment.runtime.version),o,s=e.pattern;if(ug(a,n=>{if(s.kind===`Tuple`&&Bi(n)?.length!==s.names.length)throw new y(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${U(e)}`);let i=qh(t.scope,s,n);return tg(r(Xh(t,i)),e)?(o=S_(s,i),!0):!1}),o===void 0)throw F_(e);return o}},L_=e=>[...e].sort((e,t)=>Xn(e.name,t.name)),R_=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),z_=(e,t)=>{let n=L_(e),r=R_(n),i=n.map(e=>f_(e.value,t));if(r)return e=>ui(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>bn(a,i.map(t=>t(e)),o):e=>di(a,i.map(t=>t(e)))},B_=(e,t)=>{let n=e=>f_(e,t);switch(e.kind){case`Number`:{let t=e.value;return mn(t)?()=>t:()=>{throw Hh(e)}}case`Decimal`:return()=>{throw Vh(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return m_(e,t);case`Apply`:return b_(e,t);case`Bracket`:return()=>{throw new y(`A bracket without a function or subscript is not an expression at ${jh(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new y(`An operator cannot be used as a value at ${jh(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 Ih(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 Ih(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return e=>t(i_(e))}case`Unchanged`:return a_(n(e.expression));case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Fh(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new y(`A non-boolean expression (${ms(t)}) was used as a condition of a CASE. ${Ph(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new y(`Attempted to evaluate a CASE with no conditions true.\n${U(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Xh(n,Qg(e.definitions,n)))}case`Forall`:case`Exists`:return x_(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?Nh(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new y(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${U(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return I_(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>qr(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>li(t.map(t=>t(e)))}case`FunctionConstruction`:return A_(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 z_(e.fields,t);case`RecordSet`:{let t=L_(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 j_(e,t);case`ExceptAt`:return t=>{let n=Gh(t.scope,`@`);if(n?.kind!==`Value`)throw new y(`@ appears outside an EXCEPT at ${jh(e)}`);return n.value};case`FunctionApplication`:{w_(e.function);let r=n(e.function),i=t=>Jh(r(Yh(t)),e),a=e.args.map(n),o=Rh(t.runtime.version);if(a.length===1){let e=a[0];return t=>ca(i(t),e(t),o)}return e=>ca(i(e),li(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Lh(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=a_(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new y(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${U(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>xh(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new y(`The subexpression reference at ${jh(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Nh(Mh[e.kind],e)}}},V_=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},H_=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Sa(e[t]),16777619),r=Math.imul(r^Oa(e[t]),1540483477);t[0]=V_(n)||1,t[1]=V_(r)},U_=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},W_=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),G_=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=pa(t,Sa(e[n]));return t&1073741823},K_=(e,t)=>{for(let n=0;n<t.length;n++)if(!gr(e[n],t[n]))return!1;return!0},q_=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,J_=(e,t,n)=>{let r=e.slots.length-1;for(let i=q_(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&K_(e.states[r-1],n))return r-1}},Y_=(e,t,n)=>{let r=e.slots.length-1,i=q_(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},X_=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&Y_(e,t[n],t[n+1])}Y_(e,t,n+1)},Z_=(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}},Q_=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),$_=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Z_(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},ev=e=>Atomics.load(e.used,0)*2>=e.slots.length,tv=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Z_(t,n);return{slots:t,used:e.used}},nv={kind:`Boolean`,value:!0},rv={kind:`Boolean`,value:!1},iv=e=>e?nv:rv,av=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,ov=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,sv=(e,t)=>({kind:e,body:t}),cv=(e,t,n)=>({kind:e,operands:[t,n]}),lv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?lv(e,t.operands).operands:[t])}),uv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return uv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,uv(t)),0)}},dv=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 dv(e.body);case`And`:case`Or`:return e.operands.some(dv)}},fv=/* @__PURE__ */ new WeakMap;let pv=0;const mv=e=>{let t=fv.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`#${pv++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(mv).join(`,`)})`;default:return`${e.kind}(${mv(e.body)})`}})();return fv.set(e,n),n},hv=(e,t)=>e===t||mv(e)===mv(t),gv=(e,t)=>{let n=mv(t);return e.some(e=>e===t||mv(e)===n)},_v=e=>e===`And`?`Or`:`And`,vv=(e,t)=>{switch(e.kind){case`Boolean`:return t?iv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?sv(`Not`,e):e;case`Not`:return vv(e.body,!t);case`And`:case`Or`:return lv(t?_v(e.kind):e.kind,e.operands.map(e=>vv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return sv(n,vv(e.body,t))}}},yv=e=>{switch(e.kind){case`Boolean`:return iv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return lv(_v(e.kind),e.operands.map(yv));case`Always`:return sv(`Eventually`,yv(e.body));case`Eventually`:return sv(`Always`,yv(e.body));default:return sv(`Not`,e)}},bv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=bv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return iv(t)}return n.length===0?iv(!t):n.length===1?n[0]:lv(e.kind,n)}case`Not`:{let t=bv(e.body);return t.kind===`Boolean`?iv(!t.value):sv(`Not`,t)}case`Always`:case`Eventually`:{let t=bv(e.body);return sv(e.kind,t.kind===e.kind?t.body:t)}default:return e}},xv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Sv=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=Sv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new y(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>lv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Sv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=xv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:lv(`Or`,t);n.push(sv(`Always`,sv(`Eventually`,e)))}return lv(`Or`,n)}case`Not`:return av(e.body)?e:Sv(yv(e.body));default:return e}},Cv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Cv(e.operands[0]):lv(e.kind,e.operands.map(Cv));case`Not`:return e.body.kind===`Not`?Cv(e.body.body):sv(`Not`,Cv(e.body));case`Always`:case`Eventually`:case`Next`:return sv(e.kind,Cv(e.body));default:return e}},wv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return wv(e.operands[0]);let t=Math.floor(e.operands.length/2);return cv(e.kind,wv(lv(e.kind,e.operands.slice(0,t))),wv(lv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return sv(e.kind,wv(e.body));default:return e}},Tv=(e,t)=>{e.kind===`Eventually`&&!gv(t,e)&&t.push(e),`body`in e&&Tv(e.body,t),`operands`in e&&e.operands.forEach(e=>Tv(e,t))},Ev=e=>{let t=e.filter(ov),n=e.flatMap(e=>e.kind===`Not`&&ov(e.body)?[e.body]:[]);return!t.some(e=>gv(n,e))},Dv=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,sv(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new y(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Ov=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:sv(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},kv=(e,t,n)=>e.flatMap(e=>{let r=Ov(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Av=e=>[...new Set(e.map(mv))].sort().join(`|`),jv=(e,t)=>{let n=new Set(t.map(Av));return[...e.filter(e=>!n.has(Av(e))),...t]},Mv=e=>{let t=Dv(e),n=kv(t,`Always`,`And`),r=kv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Ov(t,`Eventually`,`Or`);if(n&&!(gv(e,n.first)||gv(e,n.second)))return jv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(gv(e,t.first)||gv(e,t.second))&&!gv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Ev(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Ov(t[e],`Always`,`And`);n&&(gv(t,n.first)||t.push(n.first),gv(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)gv(t,e.first)&&gv(t,e.second)&&!gv(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!Ev(t)?[]:i(t)};return a(e)},Nv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>uv(e)<=1)}),Pv=e=>{let t=Mv([e]).map(Nv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Av(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 Mv(n)){let n=Av(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Nv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Fv=(e,t)=>!gv(e,t)||gv(e,t.body),Iv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&uv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=xv(e);if(n){let e=uv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(dv(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Lv=(e,t)=>{let n=e.findIndex(e=>hv(e,t));return n===-1?(e.push(t),e.length-1):n},Rv=e=>{let t=Sv(bv(vv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Cv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Iv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:lv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:hv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&wv(e.formula),n=[];t&&Tv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Lv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Lv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Lv(i,e))}));return{tableau:t&&Pv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},zv=()=>S(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),w.livenessEvaluationFailure),Bv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Vv=/* @__PURE__ */ new WeakSet,Hv=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),Uv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Wv=(e,t)=>new y(`TLC cannot handle the temporal formula ${U(e)}${t===void 0?``:`:\n${t}`}`),Gv=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=Gv(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=Gh(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=ng(e,n);if(t)return qu(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:M(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return vl(e,(e,o)=>(a=Math.max(a,Gv(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(Bv.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=M(e)?void 0:Fg(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,Jg(o,e.args,Uv(n,t)))}default:return l(e)}},Kv=(e,t)=>{try{return fg(e,t)}catch(e){if(!(e instanceof y))throw e;if(!Nt(e))return;throw S(new y(`${p}${e.message}`),w.error)}},qv=(e,t,n,i,a={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let o=(e,t,r=a.name,o=a.expanding,s)=>qv(e,t,n,i,{name:r,path:s?.kind===`Operator`&&s.params.length===0?[...a.path,s.name]:a.path,expanding:o,isSubstituted:a.isSubstituted||s!==void 0&&n.substitutedDefinitions.has(s)});if(e.kind===`And`)return e.operands.flatMap(e=>o(e,t,U(e)));if(e.kind===`Label`)return o(e.body,t);if(e.kind===`Let`)return o(e.body,Jv(e,t,n));if(e.kind===`Identifier`){let i=M(e)?Gh(t,e.name):void 0;if(i?.kind===`Thunk`&&!i.isReleased)return o(i.expression,i.scope,Vv.has(i)?e.name:a.name);let s=n.constants.has(e.name)?void 0:ng(e.name,n);if(!i&&s?.kind===`Operator`&&s.params.length===0&&(qu(s,n)>0||Ag(s,n)===void 0)){if(a.expanding.has(s))throw r();return o(s.body,void 0,!a.isSubstituted&&n.instanceNames.get(e.name)||s.name,/* @__PURE__ */ new Set([...a.expanding,s]),s)}}let s=Uv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(i||Gv(e,t,n)===3)){let t=Ig(e,s),r=M(e)?void 0:ng(e.operator,n),i=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!a.isSubstituted||i))return o(t.body,Jg(t,e.args,s),a.isSubstituted&&r?r.name:e.operator,a.expanding,r)}let c=i&&e.kind===`Forall`&&e.bounds.every(e=>Gv(e.set,t,n)===0),l=c?Kv(e.bounds,s):void 0;if(c&&l){let n=[];if(pg(e.bounds,l,t,t=>(n.push(...o(e.body,t,U(e.body))),!1)),n.length===0)throw zv();return n}return[{expression:e,scope:t,name:a.name,path:a.path}]},Jv=(e,t,n)=>{let r=Qg(e.definitions,Uv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Vv.add(e.binding);return r},Yv=(e,t,n)=>{let i=n.runtime.version===`1.7.4`,a=(e,t,r)=>{let a=r===0&&!i?Gv(e,t,n):r;if(a===0){let r=W(e,Uv(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${Ph(e)}`);return iv(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},o=0,c=(e,t,i,s)=>{if(o>=100)throw r();o++;let c=p(e,t);o--;let l=uv(c),u=l===0&&Gv(i,s,n)>2;return l>2||u?c:a(i,s,l)},l=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,a=Uv(n,t),o=M(e)||ng(r,n)===void 0?Gh(t,r):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&Vv.has(o))return u(e,()=>c(o.expression,o.scope,e,t));let s=o?.kind===`Operator`?o.operator:o?void 0:M(e)?Lg(r,a):Fg(r,n),l=e.kind===`Apply`?e.args:[],d=s?.kind===`Builtin`&&l.length===2?Hv.get(s.name):void 0;if(d){let n=l.map(e=>p(e,t));return f(e,t,lv(d,n))}if(s?.kind!==`Closure`)throw Wv(e);let m=!M(e)&&ng(r,n)?.isRecursive===!0;return u(e,()=>(i&&l.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),c(s.body,Jg(s,l,a),e,t)),m)},u=(e,t,n=!1)=>{try{return t()}catch(t){let r=t instanceof s||n&&!i;throw!(t instanceof y)||r?t:Wv(e)}},d=(e,t)=>{let r=Gv(e,t,n),i=[],o=e.kind===`Forall`;try{mg(e.bounds,Uv(n,t),t=>(i.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof y)||n instanceof s)throw n;if(r<=2)return a(e,t,r);throw Wv(e,o&&!Nt(n)?n.message:void 0)}return i.length===0?iv(o):f(e,t,lv(o?`And`:`Or`,i))},f=(e,t,n)=>{let r=uv(n);return r>2?n:a(e,t,r)},p=(e,t)=>{let r=Gv(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,Jv(e,t,n));case`Apply`:{let n=e.args;if(e.operator===`~`&&!M(e))return f(e,t,sv(`Not`,p(n[0],t)));if(e.operator===`=>`)return f(e,t,cv(`Or`,sv(`Not`,p(n[0],t)),p(n[1],t)));break}case`And`:case`Or`:return f(e,t,lv(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return d(e,t);case`If`:{if(!i&&Gv(e.condition,t,n)===0){let r=W(e.condition,Uv(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let r=p(e.condition,t);return f(e,t,cv(`Or`,cv(`And`,r,p(e.consequent,t)),cv(`And`,sv(`Not`,r),p(e.alternative,t))))}}if(r<=2)return a(e,t,r);switch(e.kind){case`Identifier`:return l(e,t);case`Apply`:return e.operator===`~>`?sv(`Always`,cv(`Or`,sv(`Not`,p(e.args[0],t)),sv(`Eventually`,p(e.args[1],t)))):l(e,t);case`Always`:case`Eventually`:return sv(e.kind,p(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=sv(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?sv(`Always`,sv(`Eventually`,cv(`Or`,i,a))):cv(`Or`,sv(`Eventually`,sv(`Always`,i)),sv(`Always`,sv(`Eventually`,a)))}default:throw Wv(e)}};return p(e,t)},Xv=(e,t,n,r,i)=>{let a=e=>Xv(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`?W(e.expression,a):xh(e.step,a);if(typeof o!=`boolean`)throw new y(`A state predicate was evaluated to a non-boolean value.`);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a=e.scope,o=e.subscript;if(o&&Ur(W(o,{environment:r,scope:a,state:t,next:void 0}),W(o,{environment:r,scope:a,state:n,next:void 0})))return!1;let s=W(e.expression,{environment:r,scope:a,state:t,next:n});if(typeof s!=`boolean`)throw new y(`Encountered an action predicate that's not a boolean.`);return s}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return Xv(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new y(`TLC cannot evaluate a temporal formula in a single step`)}},Zv=(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)=>Zv(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 Xv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Qv=`UnnamedAction`,$v={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},ey=e=>{let t=e.range??$v;return ui([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},ty=(e,t)=>{let n=[[`name`,e.name],[`location`,ey(e.location)]];return e.parameters.length>0&&n.push([`context`,ui(e.parameters)],[`parameters`,li(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),ui(n)},ny=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),ry=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),iy=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,ay=e=>e.kind===`Apply`?e.args:[],oy=(e,t,n)=>{let r=iy(e);if(r===void 0)return;if(M(e)){let e=Gh(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=Fg(r,n);return i?.kind===`Closure`?i:void 0},sy=(e,t)=>{try{return W(e,ry(t,void 0)),!0}catch(e){if(e instanceof ie)return!1;throw e}},cy=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&Wu(e,t)&&sy(e.body,t),ly=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&cy(e,t),uy=(e,t)=>{let n=ng(e.name,t);return n?.body===e.body&&ly(n,t)},dy=(e,t)=>{if(e.kind!==`Identifier`||!M(e))return;let n=Gh(t,e.name);return n?.kind===`Thunk`?n:void 0},fy=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:Qg(e.definitions,ry(n,t))};let r=dy(e,t);return r&&{expression:r.expression,scope:r.scope}},py=(e,t,n,r)=>t.kind===`Apply`?Jg(e,t.args,ry(r,n)):e.scope,my=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Gh(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),hy=(e,t)=>{try{return e()}catch(e){if(e instanceof ie)return t();throw e}},gy=(e,t,n,r,i)=>{let a=ay(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>Gv(e,n,i)!==0)?o():hy(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,ry(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},_y=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Qv,location:e.location,parameters:my(n,t),expression:e,scope:t});if(um.has(e.kind))throw S(new y(`${m}The next state relation is not a boolean expression.\n${Ph(e)}`),w.error);switch(e.kind){case`Let`:return _y(e.body,Qg(e.definitions,ry(r,t)),n,r,i);case`Label`:return _y(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>_y(e,t,n,r,i));case`Exists`:return hy(()=>{let o=[];return mg(e.bounds,ry(r,t),t=>(o.push(..._y(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=M(e)?void 0:i.get(iy(e)??``),s=oy(e,t,r);if(o)return gy(o,e,t,s,r);if(!s)return[a()];let c=ay(e),l=M(e)?s.name:r.instanceNames.get(iy(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return uy(s,r)||c.some(e=>Gv(e,t,r)!==0)?u():hy(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,ry(r,t))},parent:e}),s.scope);return _y(s.body,e,{...s,name:l},r,i)},u)},vy=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>vy(e,t,n,r,i,o),s=(e,t,n)=>ny(e,dl(t,a),n),c=fy(e,t,n);if(c){o(c.expression,c.scope);return}let l=oy(e,t,n);if(l&&uy(l,n))return;let u=l?[...a,...ul.get(l.body)??[]]:a;if(l&&l.params.length===0){if(Gv(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,Jg(l,e.args,ry(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(Qv,e,t));return}let d=Gv(e,t,n);d<=1?r.inits.push(s(Qv,e,t)):d===3&&r.temporals.push(s(Qv,e,t))},yy=(e,t,n,r,i)=>{let a=(t,n)=>yy(e,t,n,r,i),o=fy(t,n,r);if(o){a(o.expression,o.scope);return}let s=oy(t,n,r);if(s&&uy(s,r))return;if(s&&s.params.length===ay(t).length){a(s.body,py(s,t,n,r));return}if(t.kind===`Forall`&&hy(()=>(mg(t.bounds,ry(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(ny(e,a)):Gv(a,n,r)<2?i.invariants.push(ny(e,a)):i.impliedTemporals.push(ny(e,t));return}let c=Gv(t,n,r);c<=1?i.impliedInits.push(ny(e,t)):c===3&&i.impliedTemporals.push(ny(e,t))},by=(e,t)=>{let n=ng(e,t);return n?.kind===`Operator`&&!ly(n,t)?n:void 0},xy=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:by(e.specification,t);a&&(vy(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:Qv,location:e.frames[0].location,parameters:[],expression:dl(e.expression,e.frames),scope:e.scope}]:_y(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Fg(e.init,t);o?.kind===`Closure`&&r.inits.push(ny(e.init??``,o.body));let s=e.next===void 0?void 0:Fg(e.next,t);return s?.kind===`Closure`&&r.actions.push(..._y(s.body,s.scope,s,t,n)),r},Sy=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=fy(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&M(e)?Gh(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!M(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=oy(e,t,n);if(!s||s.params.length!==ay(e).length)return!0;let c=ng(s.name,n);return c?.body===s.body&&cy(c,n)?!0:i(s.body,py(s,e,t,n))};return i(e,t)?r:void 0},Cy=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>R(e[1])).join(`,`)})`,wy=(e,t,n=!1)=>`${e.name===Qv?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:Cy(e)} ${g(e.location.range??$v)}`,Ty=e=>`${e.name}${Cy(e)}`,Ey=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=by(e,n);t&&i.invariants.push(ny(e,t.body))}),t.properties.forEach(e=>{let t=by(e,n);t&&yy(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>Kr(e.map(e=>{let n=a&&t&&Yo(a,t,e.expression);return ty(e,n&&ui(n))})),s=e=>Kr(e.flatMap(e=>{let t=by(e,n);return t?[ui([[`name`,t.name],[`location`,ey(t.location)]])]:[]}));return ui([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,Kr(n.variables.map((e,t)=>ui([[`name`,e],[`location`,ey(r[t])],...a?[[`coverage`,ui([[`distinct`,Lo(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},Dy=e=>{switch(e.kind){case`Number`:if(!mn(e.value))throw S(new c(`TLC can't handle a number this big.\n${e.value}`),w.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return $n(e.name);case`Set`:return I({kind:`MixedSet`,elements:e.elements.map(Dy)})}},Oy=e=>{try{return Dy(e)}catch(e){throw!(e instanceof y)||e instanceof c||e instanceof re?e:S(new y(`${m}${e.message}`),w.error)}},ky=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>R(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new y(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&mr(t,r)})});if(t)return t[1];throw new y(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:R(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Ay=e=>new v(`In the configuration file, the identifier ${e} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),jy=(e,t)=>{let n=e=>t.root.visible.get(e)?.key??e,r=t.root.constants.map(e=>e.name),i=t.root.variables,a=e=>{let n=t.moduleSymbols.get(e.module??``)?.get(e.name);return n?.kind===`Definition`?n:void 0},o=e=>{if(e.module===void 0)return[e.name,n(e.name)];let t=a(e);return t?[t.key]:[]},s=e=>e.module===t.root.module.name?[]:o(e),c=e=>{let n=t.definitions.get(e);return n?.kind===`Operator`?n.params.length:t.root.constants.find(t=>t.name===e)?.arity??t.builtins.get(e)?.arity??0},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set,d=(e,n)=>{t.builtins.set(e,n),t.definitions.delete(e),l.delete(e),u.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Oy(e.value);Vr(t),s(e).forEach(e=>{let n=c(e);n===0?l.set(e,t):d(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let f=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=f.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new v(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(Dy),Dy(e.value)]),f.set(t,n)}),f.forEach(e=>s(e).forEach(t=>d(t,ky(e.name,c(t),e.rows))));let p=new Map(e.substitutions.flatMap(e=>o(e).map(t=>[t,n(e.target)])));[...p.keys()].forEach(e=>l.delete(e));let m=(e,a,o)=>{let s=n(a),c=t.definitions.get(s);if(!(c!==void 0||t.builtins.has(s)||l.has(s)||r.includes(a)||i.includes(a)))throw new v(`The configuration file substitutes for ${e} with the undefined identifier ${a}.`);if(c?.kind===`Operator`&&c.params.length!==o)throw new v(`The configuration file substitutes for ${e} with ${a} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(n=>{let i=n.name,a=n.target;if(!r.includes(i)&&!t.root.visible.has(i))throw new v(`In the configuration file, the identifier ${i} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===a))throw Ay(a);m(i,a,t.root.constants.find(e=>e.name===i)?.arity??t.root.visible.get(i)?.arity)});let h=e.substitutions.filter(e=>e.module!==void 0);[...t.moduleSymbols.keys()].forEach(e=>{let t=h.filter(t=>t.module===e);t.forEach(e=>{let n=a(e);if(n){if(t.some(t=>t.name===e.target))throw Ay(e.target);m(e.name,e.target,n.arity)}});let n=t.find(e=>!a(e));if(n)throw new v(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let g=h.find(e=>!t.moduleSymbols.has(e.module??``));if(g)throw new v(`In the configuration file, the module name ${g.module} is not a module in the specification.`);let _=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(s)),y=(e,n)=>{if(_.has(e))return{key:e,prefix:n};let r=t.copySources.get(e);return r&&y(r.source,n+r.prefix)};t.copySources.forEach((e,n)=>{let r=y(e.source,e.prefix),i=t.definitions.get(n);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=Rl(n,r.key,a,a.slice(r.prefix),i.location);t.definitions.set(n,o),t.root.visible.forEach((e,r)=>{e.key===n&&r!==n&&t.definitions.set(r,o)})}),t.operatorConstants.forEach((e,t)=>l.set(t,e));let ee=r.filter(e=>!l.has(e)&&!p.has(e)&&!u.has(e));if(ee.length>0){let e=t.order.getDeclarationOrder(`constant`).find(e=>ee.includes(e))??ee[0];throw new v(`The constant parameter ${e} is not assigned a value by the configuration file.`)}return{constants:l,substitutions:p}},My=`tlc2/value/impl/`,Ny={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},Py={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},Fy=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},Iy=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Ly=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Ry=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Iy.get(e[3])}${`[]`.repeat(e[1].length)}`),zy=(e,t)=>e[e[t].first].text,By=(e,t)=>zy(e,t).replaceAll(`/`,`.`),Vy=e=>{let t=Fy(e);if(t.readUint32()!==3405691582)throw new l(`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===Ny.utf8?a.text=i.decode(t.readBytes(t.readUint16())):r===Ny.integer?a.value=t.readInt32():r===Ny.float?t.readUint32():r===Ny.long||r===Ny.double?(t.readBytes(8),e++):r===Ny.class||r===Ny.string||r===Ny.methodType||r===Ny.module||r===Ny.package?a.first=t.readUint16():r===Ny.methodHandle?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=By(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=Ry(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:Fy(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>By(n,d.readUint16())):[],p=Ly.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Ry(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},Hy=(e,t)=>{let n=e[t],r=e[n.second];return{className:zy(e,n.first),name:e[r.first].text}},Uy=(e,t,n,r)=>{let i=()=>new ae(`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===Ny.integer)return n.value;if(n.tag===Ny.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>=Py.iconstM1&&n<=Py.iconst5)o.push(n-Py.iconst0),e+=1;else if(n===Py.bipush)o.push(a[e+1]<<24>>24),e+=2;else if(n===Py.sipush)o.push(l()<<16>>16),e+=3;else if(n===Py.ldc)o.push(c(a[e+1])),e+=2;else if(n===Py.ldcW)o.push(c(l())),e+=3;else if(n===Py.dup){let t=s();o.push(t,t),e+=1}else if(n===Py.getstatic){let n=Hy(t,l());if(n.className!==`${My}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===Py.invokestatic){let n=Hy(t,l()),a=s();if(n.className!==`${My}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===Py.new)o.push({className:zy(t,l()),value:void 0}),e+=3;else if(n===Py.invokespecial){let n=Hy(t,l()),a=s(),o=s();if(!(n.className===`${My}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===Py.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()},Wy=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Vy(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:Uy(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)}))}},Gy=A(`EOF`),Ky=A(`IDENTIFIER`),qy=A(`DEFBREAK`),Jy=(e,t)=>Array.from({length:A(t)-A(e)+1},(t,n)=>A(e)+n),Yy=new Set(Jy(`op_57`,`op_119`)),Xy=new Set(Jy(`op_1`,`op_119`)),Zy=new Set(Jy(`op_57`,`op_70`)),Qy=/* @__PURE__ */ new Set([...Jy(`ACTION`,`EXCEPT`),A(`EXTENDS`),...Jy(`IF`,`SF`),A(`STATE`),...Jy(`THEN`,`WITH`),A(`US`),...Jy(`op_112`,`op_116`)]),$y=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),eb=new Map([...$y(`postfix`,160,160,!0,`[`),...$y(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...$y(`prefix`,120,120,!1,`-.`),...$y(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...$y(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...$y(`prefix`,40,40,!0,`\\lnot`),...$y(`nfix`,100,130,!0,`\\times`),...$y(`infix`,140,140,!1,`^`,`^^`),...$y(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...$y(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...$y(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...$y(`infix`,100,110,!0,`|`,`||`,`%%`),...$y(`infix`,100,110,!1,`%`),...$y(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...$y(`infix`,90,140,!1,`\\wr`),...$y(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...$y(`infix`,90,130,!1,`!!`),...$y(`infix`,90,90,!1,`...`,`..`),...$y(`infix`,80,80,!0,`\\intersect`,`\\union`),...$y(`infix`,80,80,!1,`\\`),...$y(`infix`,70,70,!1,`<:`,`:>`),...$y(`infix`,60,60,!0,`@@`),...$y(`infix`,50,140,!0,`\\cdot`),...$y(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...$y(`infix`,30,30,!0,`\\land`,`\\lor`),...$y(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...$y(`infix`,10,10,!1,`=>`)]),tb=new Map([...eb,...Kf.flatMap(e=>e.slice(1).map(t=>[t,eb.get(e[0])]))]),nb=tb.get(`[`),rb={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},ib=e=>({type:`tokens`,kinds:new Set(e)}),ab=e=>typeof e==`string`?e.startsWith(`<`)?ib([A(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(ab)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),ob=e=>(...t)=>({type:e,body:G(...t)}),q=ob(`zeroOrMore`),sb=ob(`oneOrMore`),J=ob(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),cb=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),lb=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=cb(e,n);return n},ub=(...e)=>{let t=e.map(A);return e=>t.includes(lb(e,1).kind)},db=(e,t=lb(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},fb=e=>{let t=lb(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},pb=e=>ub(`CASESEP`)(e)&&db(e),mb=e=>{let t=lb(e,1);Qy.has(t.kind)&&(t.kind=Ky)},hb=(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}`,gb=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),_b=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},vb=e=>e.operatorStacks[e.operatorStacks.length-1],yb=(e,t)=>e.low>t.high,bb=(e,t)=>e.high<t.low,xb=e=>e.fix===`prefix`?e:tb.get(`${e.name}.`),Sb=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===nb?gb(`FcnAppl`,[n,...r.node.heirs]):gb(`PostfixExpr`,[n,r.node]),operator:void 0})},Cb=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:gb(`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:gb(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},wb=e=>{let t=vb(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 Sb(t,n),wb(e);if(i.operator!==void 0){let t=xb(r.operator);return t!==void 0&&yb(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${hb(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 ${hb(e,a.node.first,a.node.last)} and expression at location ${hb(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return bb(a.operator,r.operator)?void 0:yb(a.operator,r.operator)?(Cb(t,a.operator),wb(e)):`Precedence conflict between ops ${a.operator.name} in block ${hb(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=xb(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(bb(s,r.operator))return;if(!yb(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${hb(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Cb(t,s),wb(e);let c=hb(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===rb?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Tb=e=>Y(t=>{let n=vb(t),r=_b(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:wb(t)}),Eb=Tb(()=>!1),Db=Tb(()=>!0),Ob=Y(e=>{e.lastOperator=tb.get(e.token.image)}),kb=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},Ab=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?kb(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},jb=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!db(e,n.first.beginColumn))return n;let t=jb(e,n);if(t!==void 0)return t}},Mb=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(A),n=(e,...t)=>t.some(t=>e.kind===A(t)),r=e=>e!==void 0&&Yy.has(e.kind),i=e.token,a=cb(e,i);i.next=void 0;let o=cb(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===Ky&&(e=e.next)}else if(e.kind===Ky){let t=e.next;!r(t)||Zy.has(t.kind)||Xy.has(t.kind)&&t.next?.kind!==Ky||(e=t.next?.kind===A(`SUBSTITUTE`)?i:Xy.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==qy&&(e.next={kind:qy,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=cb(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Nb=e=>{let t=lb(e,1);if(t.kind===A(`LAB`)){let n=1;for(;n!==0;)if(t=cb(e,t),t.kind===A(`LAB`)&&n++,t.kind===A(`RAB`)&&n--,t.kind===Gy)return!1;return cb(e,t).kind===A(`IN`)}if(t.kind!==Ky)return!1;for(t=cb(e,t);t.kind===A(`COMMA`);){if(t=cb(e,t),t.kind!==Ky)return!1;t=cb(e,t)}return t.kind===A(`IN`)},Pb=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Fb=e=>e.proofLevels.at(-1)??-1,Ib=e=>{let t=lb(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:ub(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Fb(e)>=0&&Pb(t)>Fb(e):ub(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Lb=(e,t)=>{let n=Pb(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},Rb=e=>Y(t=>Lb(t,t.token)?void 0:`${hb(t,t.token)}: ${e}`),zb=ib([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(A)),Bb=ib([...zb.kinds,A(`op_76`)]),Vb=ib(Xy),Hb=ib(Zy),Ub=ib([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(A)),Wb=()=>q(Z({expansion:[K(zb,`<op_77>`)],semantic:db}),K(`PrefixOp`,`InfixOp`),Db),Gb=()=>K(G(Z({expansion:[`OpenStart`],semantic:db}),`OpenExpression`,Eb),G(Z({semantic:db}),`ExtendableExpr`)),Kb=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),qb=()=>K(G(Z({semantic:e=>ub(`ASSUME`,`BOXASSUME`)(e)||lb(e,2).kind===A(`COLONCOLON`)&&[A(`ASSUME`),A(`BOXASSUME`)].includes(lb(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Jb=()=>[`JuncItem`,q(Z({semantic:fb}),`JuncItem`)],Yb=e=>Y(t=>{t.expecting=e,mb(t)}),Xb=e=>Y(t=>{t.isTerminalProof=e}),Zb=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{Mb(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),Qb={CompilationUnit:Q(void 0,[Y(Mb),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),Yb(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,Yb(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,Yb(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(Mb)),G(Z({semantic:e=>ub(`USE`)(e)&&lb(e,2).kind!==A(`ONLY`)||ub(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(Zb(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Zb(`Expression`,Z({expansion:[`<IDENTIFIER>`,Hb]}),`PostfixLHS`,`Expression`),Zb(`Expression`,Z({expansion:[`<IDENTIFIER>`,Vb]}),`InfixLHS`,`Expression`),Zb(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),Zb(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[Bb,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,Vb,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,Hb]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,Yb(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[zb,Ob]),NonExpPrefixOp:Q(void 0,[Bb,Ob]),InfixOp:Q(`Infix Op`,[Vb,Ob]),PostfixOp:Q(void 0,[Hb,Ob]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{Mb(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),qb(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),qb(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=_b(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${hb(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(Mb),K(G(Z({amount:3}),Z({semantic:ub(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:Ib}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>ub(`BY`)(e)||lb(e,2).kind===A(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>lb(e,2).kind!==A(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,Xb(!0),J(`<ONLY>`)),G(`<USE>`,Xb(!1),J(`<ONLY>`)),G(`<HIDE>`,Xb(!1))),X("an expression, `MODULE' or `DEF'"),J(Kb(),q(`<COMMA>`,X(`MODULE or expression`),Kb(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Kb(),q(`<COMMA>`,X(`MODULE or expression`),Kb(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),Ub,Rb(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:Ib}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),Ub,Rb(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:ub(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:ub(`INSTANCE`)}),`Instantiation`),G(Z({semantic:ub(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:Ib}),Y(e=>{let t=_b(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${hb(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),sb(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:ub(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(Bb,Vb,Hb),ib([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(A))],semantic:db}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${hb(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:db}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:Nb}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),sb(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=_b(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),sb(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:Nb}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>lb(e,2).kind===A(`MAPTO`)&&Qy.has(lb(e,1).kind)}),Y(e=>{lb(e,1).kind=Ky}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=gb(`FcnAppl`,t.heirs),e.lastOperator=nb})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,sb(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(mb),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===A(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>pb(e)&&lb(e,2).kind!==A(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:pb}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[sb(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=lb(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...Jb()),G(Z({expansion:[`<AND>`]}),...Jb())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=jb(t,e.heirs[1]);return n&&`Item at ${hb(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${hb(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),Wb(),Gb()],(e,t)=>{let n=vb(t);n.push({node:e.heirs[0],operator:rb});let r=wb(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Eb,q(K(G(Z({expansion:[`PostfixOp`],semantic:db}),`PostfixOp`,Db),G(Z({expansion:[`<DOT>`],semantic:db}),`<DOT>`,Y(mb),Z({semantic:db}),`Identifier`,Y(e=>{let t=vb(e);t[t.length-1].operator!==void 0&&Sb(t,t.length),t[t.length-1]={node:gb(`RecordComponent`,[t[t.length-1].node,_b(e,2),_b(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:db}),X(`function argument`),`SBracketCases`,Tb(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:db}),`InfixOp`,Db,Wb(),Gb()),G(Z({expansion:[`<COLONCOLON>`],semantic:db}),`<COLONCOLON>`,Y(e=>{let t=vb(e);if(!Ab(t[t.length-1].node))return`\`::' at ${hb(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=vb(e),n=_b(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!bb(r,e.lastOperator)){let t=_b(e,3);return`Removing label at ${hb(e,t.first,t.last)} would change expression parsing.`}t.push({node:gb(`Label`,[_b(e,3),_b(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:db}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:db}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>Fb(e)<0&&e.proofLevels.length<=1?`${hb(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${hb(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:kb(e.heirs)===void 0?e.heirs.length===1?gb(`GeneralId`,e.heirs):void 0:gb(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>lb(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>lb(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${hb(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},$b=/* @__PURE__ */ new Map,ex=e=>{let t=$b.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=ex(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,ex(Qb[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 $b.set(e,n),n},tx=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},nx=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=cb(e,e.scanPosition)),e.scanPosition=cb(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`},rx=(e,t)=>{if(t.type===`tokens`)return nx(e,t.kinds);if(t.type===`call`)return rx(e,Qb[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||tx(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=rx(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||tx(e,t.semantic)?rx(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=rx(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=rx(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},ix=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=rx(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},ax=(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||ex(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!ex(a).hasSemanticStart?ex(a).first.has(lb(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):ix(e,i,a)&&(o===void 0||o(e))}),ox=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,rx(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=cb(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Gy){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=cb(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Qe(e.token.image)}" `},sx=(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??ox(e)}\n\nResidual stack trace follows:\n${r}`,!1},cx=(e,t)=>{let n=cb(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,sx(e))},lx=(e,t)=>{let n=Qb[t];n.message!==void 0&&(e.messages.push({name:n.message,token:lb(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!ux(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 sx(e,i);let a=r.node??(r.heirs.length===0?void 0:gb(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},ux=(e,t)=>{if(t.type===`tokens`)return cx(e,t.kinds);if(t.type===`call`)return lx(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||sx(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||sx(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||ux(e,t));if(t.type===`choice`){let n=ax(e,t.alternatives);return n===-1?sx(e):ux(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!ux(e,t.body))return!1;if(t.type===`optional`)return ax(e,[t.body])===-1||ux(e,t.body);for(;ax(e,[t.body])===0;)if(!ux(e,t.body))return!1;return!0},dx=e=>{let t=Xe(e),n={kind:Gy,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=ux(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
1783
- `)},fx={low:15,high:15},px={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),mx=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),hx=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),gx=/* @__PURE__ */ new Set([...hx,`'`]),_x=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),vx=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),yx=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),bx=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),xx=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...gx]),Sx=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Cx=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),wx=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Tx=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Ex=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Dx=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Ox=/* @__PURE__ */ new Set([``,`*`,`-`]),kx={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},Ax=(e,t)=>e.line-t.line||e.column-t.column,jx=(e,t)=>({start:Ax(e.start,t.start)<=0?e.start:t.start,stop:Ax(e.stop,t.stop)>=0?e.stop:t.stop}),Mx=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),Nx=(e,t,n=`Proof.Parser`)=>new l(e,void 0,{reason:e,line:t.start.line,column:t.start.column,isEnd:!1,proof:{stop:t.stop,exception:n}}),Px=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Fx=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Ix=/* @__PURE__ */ new Set([`NEW`,...Fx.keys()]),Lx=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Rx=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),zx=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Bx=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?mx.has(e.operator):hx.has(e.operator)),Vx=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,Hx=e=>mx.has(e)||hx.has(e)||e===`-.`,Ux=(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}}},Wx=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
1784
- `)}\n`},Gx=(e,t,n=Ee(e,t===`tlapm`))=>{let r=t===`tlapm`,a=r?n:n.map(xe),o=0,s=[],c,u,d=[],f=/* @__PURE__ */ new Set,p=[],m=[],h=e=>d[d.length-1].has(e),_=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),v=[],y=[],ee=[],b=(e,t=o-1)=>{let n=e===t?ee[e]:void 0;if(n)return n;let r=a[t];v[e]??=_(a[e]),y[t]??={line:r.line,column:r.endColumn};let i={module:m[0].name,start:v[e],end:y[t]};return e===t&&(ee[e]=i),i},x=(e,t)=>(e.location.range=b(t),e),S=(e=0)=>a[Math.min(o+e,a.length-1)],C=(e=0)=>{let t=S(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},w=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),te=0,ne=e=>{let t=a.slice(te,o).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},re=e=>r&&(e.kind===`Keyword`||zx.has(e.text)),ie=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},ae=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Dx.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:re(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,oe=(e,t=S(),n)=>{let r=a[a.length-1],i=t.line===r.line&&t.column===r.column;return new l(`${e} at line ${t.line}, column ${t.column}`,void 0,se(e,t,i,n))},se=(e,t,n,i)=>{if(r&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...ne(ie(e)),isEnd:n}}return r&&i?{reason:`Unexpected ${ae(i)}`,...ie(i),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},ce=(e,t=S())=>oe(e,t,t),le=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!re(e),T=(e,t=0)=>{let n=C(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},E=()=>{let e=C();if(e.kind===`End`)throw oe(`Unexpected end of expression`);return o++,e},D=e=>T(e)?(o++,!0):!1,O=e=>{if(!T(e))throw ce(`Expected ${JSON.stringify(e)} but found ${w(C())}`);return E()},de=()=>{let e=C();if(e.kind!==`Identifier`)throw ce(`Expected an identifier but found ${w(e)}`);if(re(e))throw ce(`Unexpected keyword ${e.text}`);return o++,e.text},fe=()=>{let e=o;return{name:de(),range:b(e)}},pe=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),me=()=>{let e=C();return e.kind!==`String`&&(vx.has(e.text)||mx.has(e.text)||gx.has(e.text))?(o++,e.text):de()},he=!1,ge=()=>C().kind===`Identifier`||!le(C())?de():(he=!0,E().text),_e=e=>{if(!r)return e();s.push(-1);let t=e();return s.pop(),t},k=(e,t=`,`)=>{let n=[e()];for(;D(t);)n.push(e());return n},ve=()=>{if(T(`<<`)){let e=1;for(;C(e).kind===`Identifier`||T(`,`,e);)e++;return T(`>>`,e)&&T(`\\in`,e+1)}let e=0;for(;C(e).kind===`Identifier`;){if(T(`\\in`,e+1))return!0;if(!T(`,`,e+1))return!1;e+=2}return!1},ye=()=>{if(T(`::`))return!0;if(!T(`(`))return!1;let e=1;for(;C(e).kind===`Identifier`&&T(`,`,e+1);)e+=2;return C(e).kind===`Identifier`&&T(`)`,e+1)&&T(`::`,e+2)},be=()=>{if(!D(`<<`)){let e=fe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=pe(T(`>>`)?[]:k(fe));return O(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Se=()=>k(()=>{let e=k(be);O(`\\in`);let t=j();return e.map(e=>({pattern:e,set:t}))}).flat(),Ce=()=>{let e=C();if(r&&zx.has(e.text)){let t=o;E();let n={kind:`Identifier`,name:e.text,location:_(e)};return{subscript:x(n,t),lastArgs:[]}}let t=r&&(e.kind===`Number`||e.kind===`String`||T(`@`));if(e.kind===`Identifier`){let t=o,n=[],i=[],a=e=>(i.push(b(o,o)),n.push(de()),e&&T(`(`)?ke():[]),s=[a(!r)];for(;T(`!`)&&C(1).kind===`Identifier`;)E(),s.push(a(!0));let c=s.slice(0,-1),l=_(e);l.range={...b(t),end:i[i.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:i,location:l},lastArgs:s[s.length-1]}}if(T(`<<`)||T(`(`)||T(`{`)||T(`[`)||t){let e=o,t=Re();return{subscript:t.location.range?t:x(t,e),lastArgs:[]}}throw ce(`Expected a subscript but found ${w(e)}`)},we=e=>{let t=C(1),n=C(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`&&T(`==`,gx.has(n.text)?3:4))},Te=e=>{let t=C(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||T(`,`,1)||T(`)`,1)||t.kind===`Keyword`&&Cx.has(t.text)||we(e)},De=()=>{let e=C(),t=e.kind===`Operator`&&(mx.has(e.text)||_x.has(e.text))&&Te(e);if(r&&e.kind!==`String`&&(_x.has(e.text)||xx.has(e.text)&&e.text!==`'`&&!hx.has(e.text)||bx.has(e.text)&&C(-1).text===`(`&&C(-1).line===e.line&&C(-1).endColumn+1===e.column&&C(1).text===`)`&&C(1).line===e.line&&C(1).column===e.endColumn+1)&&Te(e))throw oe(`incomplete expression`,e);if(t&&!r&&e.text===`\\X`&&e.spelling!==`×`)throw oe(`\\X may not be used as an infix operator`,e);if(t)return o++,x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:_(e)},o-1);if(e.kind!==`String`&&xx.has(e.text)&&Te(e)){o++;let t=_(e);if(hx.has(e.text))return x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return x({kind:`Lambda`,params:[n.name],body:Ux(e.text,n,t),operator:e.text,location:_(e)},o-1)}if(T(`LAMBDA`)){let t=o;E();let n=pe(k(fe));O(`:`);let r=j();return x({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:_(e)},t)}return j()},Oe,ke=()=>_e(()=>{let e=o;O(`(`);let t=k(De);return O(`)`),Oe=b(e),t}),A=()=>{let e=E();s.push(e.column);let t=[j()];for(;Vx(S())&&S().text===e.text&&S().column===e.column;)o++,t.push(j());return s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:_(e)}},Ae=e=>_e(()=>{let t=_(e),n=C().kind===`Identifier`,i=T(`|->`,1)&&(n||le(C()));if(i||n&&T(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=o,n=_(C()),r=e();return n.range=b(t),O(i?`|->`:`:`),{name:r,value:j(),location:n}},a=[r(()=>n?de():E().text),...D(`,`)?k(()=>r(de)):[]];return O(`]`),{kind:e,fields:a,location:t}}if(ve()){let e=o,n=Se();if(!r||T(`|->`)){O(`|->`);let e=j();return O(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=j();if(D(`->`)){let e=j();return O(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(D(`EXCEPT`)){let e=k(()=>{O(`!`);let e=[];for(;T(`.`)||T(`[`);)if(D(`.`)){if(!le(C()))throw ce(`Expected a field name but found ${w(C())}`);if(!r&&T(`@`))throw ce(`@ used in !.@`);e.push({kind:`Field`,name:E().text})}else O(`[`),e.push({kind:`Index`,args:k(()=>j())}),O(`]`);return O(`=`),{path:e,value:j()}});return O(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!r&&!T(`]_`)){let e=[a];for(;D(`,`);)e.push(j());return O(`]`),{kind:`Bracket`,args:e,location:t}}return O(`]_`),{kind:`BoxAction`,action:a,subscript:Ce().subscript,location:t}}),je=()=>{let e=o,t=x(Be(),e),n=_(E());return x({kind:`Apply`,operator:`\\in`,args:[t,j()],location:n},e)},Me=e=>_e(()=>{let t=_(e);if(D(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ve()&&(C(1).text===`\\in`||T(`<<`))){let e=o,n=be();O(`\\in`);let r=j();if(D(`:`)){let e=j();return O(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=C().kind===`Identifier`&&T(`\\in`,1)?je():j();if(D(`:`)){let e=Se();return O(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;D(`,`);)r.push(j());return O(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ne=e=>{let t=_(e),n=_e(()=>T(`>>`)||T(`>>_`)?[]:k(()=>j()));if(D(`>>_`)){if(n.length!==1)throw oe(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:Ce().subscript,location:t}}return O(`>>`),{kind:`Tuple`,elements:n,location:t}},Pe=e=>{let t=_(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ve()){let e=Se();return O(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=pe(k(fe));return O(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Fe=e=>{let t=[];do{let n=o;if(D(`OTHER`))return O(`->`),{kind:`Case`,arms:t,other:j(),otherRange:b(n),location:_(e)};let r=j();O(`->`),t.push({condition:r,body:j()})}while(D(`[]`));return{kind:`Case`,arms:t,other:void 0,location:_(e)}},Ie=()=>{let e=C(1);return T(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Sx.has(e.text)||e.kind===`Operator`&&(mx.has(e.text)||gx.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&vx.has(e.text))},Le=()=>{let e=E();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--,{kind:`Bound`,args:ke()}}return{kind:`Name`,name:e.text,args:T(`(`)?ke():[]}},Re=e=>{let n=o,i=E(),a=_(i);if(r&&i.kind===`Keyword`&&i.text===`LAMBDA`){let e=k(de);return O(`:`),{kind:`Lambda`,params:e,body:j(),location:a}}if(i.kind===`Number`){if(r&&/^\\[BOH]/.test(i.text))throw oe(`incomplete expression`,i);return{kind:`Number`,value:ue(i.text),text:i.text,location:a}}if(i.kind===`Decimal`)return{kind:`Decimal`,text:i.text,location:a};if(i.kind===`String`)return{kind:`String`,value:i.text,location:a};let s=i.kind===`Step`&&rt(i);if(!r&&s&&et()<0&&$e.length<=1)throw oe(`Step number used outside proof`,i);if(s&&i.text[1]===`+`)throw oe(`<+> step number used in an expression`,i);if(i.kind===`Identifier`||s){let t=s?it(i)??i.text:i.text;if(ye()){let o=pe(D(`(`)?k(fe):[]);o.names.length>0&&O(`)`),O(`::`);let s=b(n),l=j();if(!r&&e!==void 0&&c!==void 0&&Bx(l)&&e.high>=c.low)throw oe(`Removing the label would change expression parsing`,i);return{kind:`Label`,name:t,params:o.names,paramRanges:o.ranges,head:s,body:l,location:a}}let l=T(`(`);if(t===`@`&&!l&&!Ie())return{kind:`ExceptAt`,location:a};let u=l?ke():[],d=[l?Oe:void 0];if(!Ie())return l?{kind:`Apply`,operator:t,args:u,argumentsRange:Oe,location:a}:{kind:`Identifier`,name:t,location:a};let f=[{kind:`Name`,name:t,args:u}],p=[b(n,n)];for(;Ie();)E(),p.push(b(o,o)),Oe=void 0,f.push(Le()),d.push(Oe);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),v=d.at(-1)??b(n);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:a}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:a}:{kind:`Apply`,operator:h,args:g,..._.slice(0,-1).some(e=>e>0)&&{argumentCounts:_},argumentsRange:v,selectorRanges:p,argumentRanges:d,location:a}}if(i.kind===`Operator`&&Hx(i.text)&&T(`(`)){let e=ke();return t===`tlc`&&i.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:{kind:`Apply`,operator:i.text,spelling:i.spelling,args:e,location:a}}if(i.kind===`Operator`&&Hx(i.text)&&!r)return{kind:`Identifier`,name:i.text,spelling:i.spelling,location:a};switch(i.text){case`(`:{let e=_e(()=>j());return O(`)`),e}case`[`:return Ae(i);case`{`:return Me(i);case`<<`:return Ne(i);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Pe(i);case`IF`:{let e=j();O(`THEN`);let t=j();return O(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:a}}case`CASE`:return Fe(i);case`LET`:{let e=[],t=[];for(d.push(/* @__PURE__ */ new Set);!D(`IN`);){if(r&&T(`RECURSIVE`))throw oe(`Unexpected keyword RECURSIVE`,ne(S()));if(D(`RECURSIVE`)){Xe();continue}let n=Ue(!r&&D(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}d.pop();let n=j();return t.length===0?{kind:`Let`,definitions:e,body:n,location:a}:{kind:`Let`,definitions:e,instances:t,body:n,location:a}}case`CHOOSE`:{let e=be(),t=D(`\\in`)?j():void 0;return O(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:a}}case`WF_`:case`SF_`:{let e=Ce(),t=!T(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:_e(()=>{O(`(`);let e=j();return O(`)`),e});return{kind:i.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw ce(`Unexpected ${w(i)}`,i)},ze=(e,t,n)=>{c=u={low:t,high:n};let i=j(r?Math.min(n+1,fx.low):n+1),a=C(),o=gx.has(a.text)?fx.high:mx.get(a.text)?.high;if(!r&&a.kind===`Operator`&&o!==void 0&&o>=t)throw oe(`Precedence conflict between ${e.text} and ${a.text}`,a);return i},Be=()=>{let e=u;u=void 0;let t=C(),n=_(t);if(t.kind===`Operator`&&Vx(t))return A();if(r&&mx.has(t.text)&&T(`(`,1)){let e=o,r=_e(()=>{E(),E();let r=j();if(!D(`,`))return;let i=j();O(`)`);let a={kind:`Apply`,operator:t.text,args:[r,i],location:n};return x(a,e)});if(r!==void 0)return r;o=e}if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return E(),{kind:`Apply`,operator:`~`,args:[ze(t,4,4)],location:n};case`-`:case`-.`:if(t.text===`-.`&&!r)break;return E(),{kind:`Apply`,operator:`-.`,args:[ze(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return E(),Ux(t.text,ze(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return E(),{kind:`Apply`,operator:t.text,args:[r?j(9):ze(t,10,13)],location:n}}return Re(e)},j=(e=0)=>{let t=o,n=Be(),i=n.location.range?n:x(n,t),a;for(;;){let n=C();if(n.kind!==`Operator`)break;let o=_(n);if(n.text===`'`&&e<=15){E(),c=fx,i=x({kind:`Prime`,expression:i,location:o},t);continue}if(hx.has(n.text)&&e<=15){E(),c=fx,i=x({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[i],location:o},t);continue}if(n.text===`[`){E();let e=_e(()=>k(()=>j()));_e(()=>O(`]`)),c=px,i=x({kind:`FunctionApplication`,function:i,args:e,location:o},t);continue}if(n.text===`.`&&le(C(1))){E();let e=E().text;i=x({kind:`FieldAccess`,record:i,field:e,location:o},t);continue}let s=mx.get(n.text);if(!s||s.low<e)break;if(a){let e=!(a.low>s.high||a.high<s.low),t=a.text===n.text&&s.isAssociative;if(e&&!t&&(a.text!==`\\X`||n.text!==`\\X`))throw oe(`Precedence conflict between ${a.text} and ${n.text}`,n)}if(E(),!r&&s.low>12&&T(`-`))throw oe(`Precedence conflict between ${n.text} and -`,C());c=u=s;let l=j(s.high+1);if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,r=[b(t).end];i=i.kind===e&&a?.text===n.text?{...i,operands:[...i.operands,l],prefixEnds:[...i.prefixEnds??[],...r]}:{kind:e,operands:[i,l],prefixEnds:r,location:o}}else i=n.text===`\\X`?i.kind===`Product`&&a?.text===`\\X`?{...i,factors:[...i.factors,l]}:{kind:`Product`,factors:[i,l],location:o}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[i,l],location:o};i=x(i,t),a={...s,text:n.text}}return i},Ve=()=>{if(!D(`(`))return[];let e=Ye();return O(`)`),e},He=()=>{let e=_(C()),t=j(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:m[0].name,start:e,end:r}}},Ue=e=>{let t=o;return x(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=C(),n=o,r=_(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:b(n,o-2),...He(),isLocal:e,isRecursive:h(t),location:r});if(t.kind===`Identifier`&&C(1).kind===`Operator`&&mx.has(C(1).text)&&C(2).kind===`Identifier`&&T(`==`,3)){let e=fe(),t=E().text,n=fe();return O(`==`),i(t,[We(e),We(n)])}let a=t.kind!==`String`&&vx.has(t.text),s=t.kind===`Identifier`&&gx.has(C(1).text)&&T(`==`,2);if(a||s){let e=a?t.text:C(1).text;a&&E();let n=fe();return s&&E(),O(`==`),i(e,[We(n)])}let c=de();if(D(`[`)){let t=_e(()=>Se());return O(`]`),O(`==`),{kind:`Function`,name:c,bounds:t,body:j(),isLocal:e,isRecursive:h(c),location:r}}let l=o,u=Ve();return O(`==`),T(`INSTANCE`)?{...Ke(c,u,e,r),definitionRange:b(l)}:i(c,u)},Ke=(e,t,n,r)=>{let i=o;return O(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ge(),substitutions:D(`WITH`)?k(()=>{let e=o,t=me(),n=b(e);return O(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:b(i)}},qe=()=>{let e=o;return x(Je(),e)},Je=()=>{let e=_(C());if(T(`_`)&&C(1).kind===`Operator`)return E(),{name:E().text,arity:D(`_`)?2:1,location:e};if(C().kind!==`String`&&(vx.has(C().text)||r&&C().kind===`Operator`)&&T(`_`,1)){let t=E().text;return E(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=de();if(!D(`(`))return{name:t,arity:0,location:e};let n=k(()=>O(`_`));return O(`)`),{name:t,arity:n.length,location:e}},Ye=()=>k(qe),Xe=()=>{let e=Ye();return e.forEach(e=>d[d.length-1].add(e.name)),e},Ze=e=>{let t=0,n=e;do{let e=C(n);if(e.kind===`End`)return n;e.kind===`Operator`&&Lx.has(e.text)&&t++,e.kind===`Operator`&&Rx.has(e.text)&&t--,n++}while(t>0);return n},Qe=()=>{let e=C(),t=C(1);return e.kind===`Identifier`?T(`(`,1)||T(`[`,1)?T(`==`,Ze(1)):t.kind===`Operator`&&gx.has(t.text)?T(`==`,2):t.kind===`Operator`&&mx.has(t.text)?C(2).kind===`Identifier`&&T(`==`,3):T(`==`,1):e.kind!==`String`&&vx.has(e.text)&&t.kind===`Identifier`&&T(`==`,2)},$e=[],et=()=>$e[$e.length-1]??-1,tt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),nt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},rt=e=>!e.text.endsWith(`.`)&&!Ox.has(nt(e)),it=e=>{let t=nt(e);if(Ox.has(t))return;let n=tt(e);if(n>=0)return`<${n}>${t}`;let r=et(),i=$e[$e.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},at=e=>{if(e.kind===`Keyword`)return Tx.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return $e.length===0;if(e.text[1]===`+`||$e.length===0)return!0;let t=et();return t>=0&&tt(e)>t},ot=e=>{let t=tt(e),n=$e.length-1,r=$e[n-1]??-1,i=$e[n]<0;return i&&($e[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:$e[n]===t},st=e=>!f.has(e)&&m.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),ct=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!zx.has(e.name)&&!st(e.name):!1,lt=()=>{let e=C();return e.kind===`Step`?rt(e):e.kind===`Keyword`?Px.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Qe()},ut=()=>{let e=o,t=C();return t.kind===`Operator`&&!yx.has(t.text)&&Hx(t.text)?(o++,x({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:_(t)},e)):D(`MODULE`)?x({kind:`ModuleFact`,name:de(),location:_(t)},e):j()},dt=e=>p[p.length-1]?.add(e),ft=e=>{p.push(/* @__PURE__ */ new Set);let t=e();return p.pop(),t},pt=e=>p.some(t=>t.has(e))||m.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),mt=()=>{let e=o,t=C(),n=k(()=>{let e=C();if((e.kind!==`Identifier`||re(e))&&e.kind!==`Operator`)throw ce(`Expected a definition name but found ${w(e)}`,e);return o++,e.text},`!`),r=_(t);return x(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},ht=()=>{if(r)return k(mt);let e=k(ut),n=t===`tlc`?e.find(e=>e.kind===`Identifier`&&pt(e.name)):void 0;if(n)throw oe(`DEF clause entry should describe a defined operator`,n.location);return e},M=()=>{let e=lt()?k(ut):[],t=D(`DEF`)||D(`DEFS`);if(r&&e.length===0&&!t)throw ce(`Expected a fact`);return{facts:e,defs:t?ht():[]}},gt=()=>{let e=o,n=E(),r=n.text===`USE`&&D(`ONLY`),a=b(e),s={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...M(),keyword:a,location:_(n)},c=s.kind===`Hide`&&t===`tlc`?s.facts.filter(e=>!ct(e)):[];if(c.length>0)throw i(c.map(t=>({location:g(t.location.range??b(e)),message:`The only expression allowed as a fact in a HIDE is
1785
- the name of a theorem, assumption, or step.`})));return x(s,e)},_t=()=>{let e=o,t=_(C()),n=D(`NEW`),i=r?o:e,a=r?_(C()):t,s=C().kind===`Keyword`?Fx.get(C().text):void 0;if(!n&&s===void 0)throw ce(`Expected a declaration but found ${w(C())}`);if(s!==void 0&&E(),s===`Variable`){let e=fe();return dt(e.name),x({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},i)}let c=qe();dt(c.name);let l=(s??`Constant`)===`Constant`&&T(`\\in`);if(l&&c.arity>0)throw oe(`declared symbol with arguments before \\in`);return l&&E(),x({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?j():void 0,nameRange:c.location.range,location:a},i)},vt=()=>{let e=o,t=_(O(`ASSUME`)),n=k(()=>(C().kind===`Identifier`&&T(`::`,1)&&T(`ASSUME`,2)&&(E(),E()),T(`ASSUME`)?ft(vt):C().kind===`Keyword`&&Ix.has(C().text)?_t():j()));return O(`PROVE`),x({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)},yt=e=>{let t=0;for(;C(t).kind===`Identifier`&&T(`,`,t+1);)t+=2;return C(t).kind===`Identifier`&&T(e,t+1)},bt=(e,t)=>{e.forEach(dt),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(dt))},xt=()=>{let e=C();if(T(`USE`)||T(`HIDE`))return gt();if(T(`INSTANCE`)){let t=o;return x(Ke(void 0,[],!1,_(e)),t)}if(T(`DEFINE`)||Qe()){let t=o;D(`DEFINE`);let n=[Ue(!1)];for(;Qe();)n.push(Ue(!1));let r={kind:`Define`,definitions:n,location:_(e)};return x(r,t)}if(D(`HAVE`))return{kind:`Have`,expression:j()};if(D(`TAKE`)){let e=ve(),t=pe(e?[]:k(fe)),n=e?Se():[];return bt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(D(`WITNESS`))return{kind:`Witness`,expressions:k(()=>j())};if(D(`PICK`)){let e=yt(`:`),t=pe(e?k(fe):[]),n=e?[]:Se();return bt(t.names,n),O(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return D(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:D(`SUFFICES`),statement:T(`ASSUME`)?vt():j()}},N=e=>{let n=C();if(n.kind!==`Step`)throw ce(`Expected a step number but found ${w(n)}`,n);if(!ot(n))throw oe(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&tt(n)<0&&it(n)!==void 0)throw oe(`<*> and <+> cannot be used for a named step`,n);return o++,{name:it(n),token:n.text,location:_(n)}},St=()=>{let e=o,t=N(T(`QED`,1)),n=o,r=/* @__PURE__ */ new Set;p.push(r);let i=D(`QED`)?{kind:`Qed`}:xt(),a=b(e),s=b(n),c=at(C());if(c&&!Ex.has(i.kind))throw oe(`Proof of a step that does not take a proof`);let l=c?Tt():void 0;return p.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(dt),x({...t,body:i,head:a,statement:s,proof:l},e)},Ct=e=>{if(D(`BY`)){let t=b(o-1);return{kind:`By`,isOnly:D(`ONLY`),...M(),keyword:t,location:e}}let t=C();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;E();let n=b(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},wt=()=>{let e=_(C());D(`PROOF`);let t=Ct(e);if(t)return t;let n=[St()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(St());return{kind:`Steps`,level:et(),steps:n,location:e}},Tt=()=>{let e=o;$e.push(-1);let t=ft(wt);return $e.pop(),x(t,e)},Et=()=>C().kind===`Step`||C().kind===`Keyword`&&Tx.has(C().text),Dt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return Mx(e);let n=t.defs[t.defs.length-1]?.location.range;return jx(Mx({...e,end:e.start}),Mx(n??t.keyword))},Ot=()=>{let e=o,t=_(C()),n=D(`PROOF`),r=Ct(t);if(r){let t=x(r,e);return{kind:`Leaf`,proof:t,span:Mx(t.keyword),first:e,end:o-1}}let i=C();if(i.kind!==`Step`)throw ce(`Expected a step number but found ${w(i)}`);let a=o;E();let s=o,c=D(`QED`)?{kind:`Qed`}:xt(),l=b(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:b(s),span:Dt(l,c),first:e,start:a,end:o-1}},kt=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=At(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={..._(a[i.first]),range:b(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},At=(e,t,n,r,i)=>{let a=e[t];if(!a)throw Nx(`Unexpected end of (sub)proof at level ${n} before QED step`,r);if(a.kind===`Leaf`)throw Nx(`Expecting a proof step but found a${kx[a.proof.kind]} leaf proof`,a.span);if(!i&&a.isProof)throw Nx(`PROOF keyword found in step that does not begin subproof`,a.span);let o=a.token.text[1];if(o===`+`&&!i)throw Nx(`<+> used but no subproof expected`,a.span);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:tt(a.token);if(s<n||!i&&s>n)return;let c=Ex.has(a.body.kind)?kt(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:it(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{..._(a.token),range:b(a.start,l)}},d=jx(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=At(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:jx(d,f.span)}},jt=()=>{if(!Et())return;let e=[];for(;Et();)e.push(Ot());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=kt(e,0,0,t.span),r=e[n.next];if(r)throw Nx(`extra step(s) after finished proof`,r.span,`Proof.Parser.toplevel`);return n.proof},Mt=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},Nt=()=>{if(C().kind!==`Identifier`||!T(`==`,1))return;let e=de();return f.add(e),E(),e},Pt=e=>{let t=o,n=E(),i=Nt(),a=ft(()=>{let e=T(`ASSUME`)?vt():j();return r?{statement:e,proof:jt()}:{statement:e,proof:at(C())?Tt():void 0}}),s=a.statement,c=x({name:i,statement:s,proof:a.proof,location:_(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&s.kind!==`AssumeProve`&&Mt(e,i,s,c.location)},Ft=()=>{let e=o,t=E(),n=Nt();return x({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:_(t)},e)},It=()=>{let e=_(O(`----`));O(`MODULE`);let t=ge();O(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(m.push(n),d.push(/* @__PURE__ */ new Set),D(`EXTENDS`)&&k(()=>{let e=o;n.extends.push(ge()),n.extendsRanges.push(b(e))});;){let t=o;te=t;let r=C();if(r.kind===`ModuleEnd`)return e.range={module:m[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},m.pop(),d.pop(),n;if(r.kind===`Separator`){if(T(`MODULE`,1)){let e=It();n.modules.push(e),n.units.push({kind:`Module`,module:e}),O(`====`);continue}E()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=_(E()),r=Ye();n.constants.push(...r),e.range=b(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=_(E()),r=k(()=>{let e=o,t=_(C());return x({name:de(),arity:0,location:t},e)});n.variables.push(...r),e.range=b(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Ft();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Mt(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(T(`USE`)&&T(`ONLY`,1))throw ce(`Expected a module unit but found ${w(r)}`);let e=gt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=_(E()),r=Xe();e.range=b(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:Lt(n,x(Ke(void 0,[],!1,_(r)),t));continue;case`LOCAL`:if(E(),T(`INSTANCE`)){Lt(n,x(Ke(void 0,[],!0,_(r)),t));continue}Lt(n,x(Ge(!0),t));continue}r.kind===`Keyword`&&wx.has(r.text)?Pt(n):Lt(n,Ue(!1))}}},Lt=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},Rt=It(),zt=he?dx(e):void 0;if(zt!==void 0)throw new l(zt);return Rt},Kx=e=>Gx(e,`tlc`),qx=(e,t)=>Gx(e,`tlc`,t),Jx=e=>Gx(e,`tlapm`),Yx=e=>Gx(e,`sany`),Xx=`$subexpression`,Zx=(e,t)=>new l(`${e} at line ${t.line}, column ${t.column}`),Qx=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Qx(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of mt(e)){let e=Qx(r,t,n);if(e)return e}},$x=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),eS=(e,t)=>{let n=e.location,r=$x(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 Zx(`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 Zx(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Xx,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Xx,args:e.args,location:n,resolution:Gs},location:n}},tS=(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:Gs})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Gs}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Gs};return eS({...t,params:[...t.params,...r]},a)},nS=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o=0,s,c=!1,l=(t,r)=>{if(!t)throw Zx(r,i);qs.set(n,{args:e.slice(0,o).flatMap(e=>`args`in e?e.args:[]),error:{location:g(t),message:r}}),c=!0},u=n=>{let r=[],a=[];for(;o<e.length;){let s=e[o];if(s.kind!==`Name`)throw Zx(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>hl(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o++}throw Zx(`Unknown operator ${r.join(`!`)}`,i)},d=t=>{let c=u(t),d=c.definition,f=Qs(d),p=o===e.length-1;if(c.args.length!==f&&(!r||c.args.length!==0))return l(n.argumentRanges?.[o]??i.range,`The operator ${c.name} requires ${f-c.earlier} arguments.`);if(p)return{definition:d,args:c.args};if(d.kind!==`Operator`)throw Zx(`Cannot select a subexpression of ${d.name}`,i);a.params.push(...d.params),a.args.push(...c.args),s=d.body,o++},f=()=>{for(;o<e.length&&!c;){let t=e[o];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o],c=s&&Qx(s,t.name,[]);if(!c)return l(i,`Cannot find label \`${t.name}'.`);let u=c.label.params;if(!r&&t.args.length!==u.length)return l(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...u.map(e=>({name:e,arity:0}))),a.args.push(...t.args),s=c.label.body,o++}},p=t=>{if(!s)throw Zx(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(s.kind===`Label`){s=s.body,p(t);return}if(s.kind===`Let`){if(t.kind!==`Operand`||yc(t.operand,1)!==0)throw Zx(`A LET/IN expression has only one operand`,i);a.lets.push(s.definitions),s=s.body;return}let n=Cc(s);if(n&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...n.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),s=n.body;return}if(s.kind===`Case`&&t.kind===`Operand`){let n=[...s.arms,...s.other?[{condition:void 0,body:s.other}]:[]],r=n[yc(t.operand,n.length)],a=e[o+1];if(!r||a?.kind!==`Operand`)throw Zx(`A subexpression of CASE must have the form !i!j`,i);o++;let c=yc(a.operand,2),l=c===0?r.condition:c===1?r.body:void 0;if(!l)throw Zx(`Nonexistent CASE operand`,i);s=l;return}if(t.kind!==`Operand`)throw Zx(`Unexpected subexpression selector`,i);let r=n?n.sets:wc(s),c=r?.[yc(t.operand,r.length)];if(!c)throw Zx(`Nonexistent operand specified by the selector`,i);s=c},m=d(void 0);if(c)return n;if(m)return tS(m.definition,{...a,args:m.args});for(f();o<e.length&&!c;){let t=e[o];if(t.kind===`Name`){for(;s?.kind===`Label`;)s=s.body;if(s?.kind!==`Let`)throw Zx(`A name selector here must be from a LET clause`,i);a.lets.push(s.definitions);let e=d(s.definitions);if(c)return n;if(e)return tS(e.definition,{...a,args:[...a.args,...e.args]});f()}else p(t),o++}if(c)return n;if(!s)throw Zx(`Subexpression selection failed`,i);return eS(a,s)},rS=(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 bc(e,t,n)},iS=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||mt(e).some(iS),aS=(e,t,n,r=!1)=>{if(!iS(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=vl(e,e=>aS(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>oS(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)=>aS(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:vl(e,e=>aS(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?rS(a.name,[],void 0,t):a.kind===`Apply`?rS(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=nS(o,t,a,r);return c!==a&&Ks.add(c),c},oS=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:aS(e.expression,t,n,!0)}))}),sS=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},cS=(e,t)=>oS(e,sS(t.definitions),()=>!1),lS=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=sS([...t,...e.definitions]),a=e=>n.has(e),o=sS([...t,...e.definitions,...r]),s=e=>aS(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>aS(e,i,c),u=e=>e.map(e=>e.kind===`ModuleFact`?e:l(e)),d=e=>e.map(e=>({...e,set:l(e.set)})),f=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&l(e.set)}:f(e)),conclusion:l(e.conclusion)}:l(e),p=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:u(e.facts)};case`Instance`:return oS(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?oS(e,i,c):_l(e,l))};case`Have`:case`Case`:return{...e,expression:l(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(l)};case`Take`:return{...e,bounds:d(e.bounds)};case`Pick`:return{...e,bounds:d(e.bounds),body:l(e.body)};case`Assert`:return{...e,statement:f(e.statement)};default:return e}},m=e=>e?.kind===`By`?{...e,facts:u(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:p(e.body),proof:m(e.proof)}))}:e,h={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:f(e.statement),proof:m(e.proof)})),uses:e.uses.map(e=>({...e,facts:u(e.facts)}))};return e.definitions.some(e=>iS(e.body))||e.assumptions.some(e=>iS(e.expression))?{...h,definitions:e.definitions.map(e=>_l(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},uS=(e,t)=>e.maxLevels[t]??3,dS=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Du({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,a=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>ru(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>ru(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>iu(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=eu(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)&&ru(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(Ou(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,o=g(t.location.range??{module:t.instancer,start:t.location,end:t.location}),s=e=>r.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 f=[...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),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),p=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&s(p(e.name,n));let r=e.operator;if(r)for(let n=0;n<e.arity;n++){let i=l.argConstraints.get(Ql(e.name,n));i!==void 0&&uS(r,n)<i&&s(`Level error in instantiating module '${t.module}':\nThe level of the argument ${n+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let n=eu(e),r=f.find(e=>e.name===n.operator)?.operator,i=f.find(e=>e.name===n.param);if(!r||!i)return;let a=uS(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}.`)}),r.size>0)throw i([...r.values()])}},fS=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],pS=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),mS=new Map(Kf.flatMap(e=>e.map(t=>[t,e[0]]))),hS=e=>mS.get(e)??e,gS=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},_S=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:gt(e)&2147483647,kind:t,isLocal:n}),vS=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:hS(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:hS(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},yS=(e,t)=>{let n=[];for(let r=t;;){let t=vS(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},bS=e=>({line:e.line,column:e.column}),xS=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=yS(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},SS=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,CS={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},wS=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&SS(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&SS(e[n+1],e[n+2])?n+=SS(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=>CS[e])}"`:r.text)}return t},TS=e=>e[2]?.text,ES=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},DS=(e,t)=>e.find(e=>e.name===t)??e.map(e=>DS(e.modules,t)).find(Boolean),OS=e=>{let t=e===void 0?[]:Ee(e),n;return{tokens:t,ranges:ES(t),getModule:()=>n??=e===void 0?Kx(``):qx(e,t)}},kS=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=OS(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??Xf.get(i)??$f.get(i)??Wx(e,i),c=a(s),l=c.tokens,u=c.ranges.get(TS(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>DS(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},AS=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=yS(t,e+1);i.push({location:bS(t[e]),apply:e=>r.forEach(t=>e.put(_S(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:bS(n),apply:t=>t.put(_S(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&yS(t,u+1).every(e=>s.has(e))&&o(u,`definition`),pS.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(bS(n)),i.push({location:bS(n),apply:e=>e.put(_S(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(_S(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=hS(e.name);i.push({location:e.location,apply:n=>n.put(_S(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(_S(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(_S(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Zs(e.location,t.location)?-1:+!!Zs(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=gS();n.set(i??``,o),Gf.toReversed().forEach(e=>o.put(_S(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},jS=(e,t)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};t.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),qf.forEach(i);let o=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=xS(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;wS(o(void 0)).forEach((e,t)=>{t===3&&Yf.forEach(i),i(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[r,a]=t;if(d.add(`${r.key}>${a}`),v.set(r.unit,[...v.get(r.unit)??[],a]),!_.has(a)){if(_.add(a),e(a).tokens.length===0){let t=r.unit??TS(e(void 0).tokens);throw n(a,t)}wS(o(a)).forEach(i)}}fS.forEach(i);let ee=/* @__PURE__ */ new Set,b=e=>{if(ee.has(e))return;ee.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(b),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return b(void 0),Jf.forEach(i),[...r]},MS=(e,t)=>{let n=kS(e,t),r=n.getParsed,i,a=()=>i??=AS(r);return{getStringOrder:e=>jS(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},NS=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),PS=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],FS=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof l))throw n;let r=dx(e);throw r===void 0?n:i([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},IS=e=>new l(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),LS=(e,t)=>e.location.range&&t.location.range&&{location:g(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${g(t.location.range)}.`},RS=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,zS=e=>e===`Theorem`?`ThmOrAssumpDefNode`:RS(e),BS=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Il(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),VS=(e,t)=>{let n=ht(e);return n!==void 0&&t.has(n)||mt(e).some(e=>VS(e,t))},HS=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(jl(e),n.get(e)??n.size)),n},US=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),WS=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Vh(e);if(e.kind===`Number`&&!mn(e.value))throw Hh(e);WS(e.kind===`Let`?[...mt(e),...US(e.instances??[])]:mt(e))}),GS=(e,t)=>{let r=t.order??MS(t.source,t.loadModule),a=r.parseModule(t.source),o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set,d=/* @__PURE__ */ new Set,f=new Map(up.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=yf(e.checkDeadlock,t.seed);m.isWarningEnabled=t.isWarningEnabled??!0,m.isTool=t.isTool??!1,m.version=t.version??`master`;let _=/* @__PURE__ */ new Map,ee=/* @__PURE__ */ new Map,b=[],x=/* @__PURE__ */ new Map,S=[],C=[],w=(e,t)=>S.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),te=0,ne=e=>`${e}#${te++}`,re=[],ie=[],ae=dS(e=>{let t=ee.get(e)??O(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>o.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>o.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=/* @__PURE__ */ new Map,le=e=>{let n=p.get(e);if(n)return n;let r=Mp(e,t.print,m,t.files,f);if(!r)return;Ap.get(e)?.forEach(le);let i=/* @__PURE__ */ new Map;return jp.get(e)?.forEach(e=>le(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{f.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Yl.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Zl(e,t.name)??i.get(t.name)?.range})}),p.set(e,i),i},T=e=>{let n=Ap.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=le(e);return r&&w(e,n),r&&n.includes(`Integers`)&&le(`Integers`),r},E=e=>(WS([...e.definitions.flatMap(pt),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...US(e.instances)]),e.modules.forEach(E),e);E(a);let D=(e,a)=>{let o=t.loadModule?.(e)??tp(m.version).get(e)??Wx(t.source,e);if(o===void 0)throw n(e,a);let s=FS(o,e,r);if(s.name!==e)throw i([{location:`Unknown location`,message:`File name '${e}' does not match the name '${s.name}' of the top level module it contains.`}],!0);return E(s)},ue=e=>{let t=C.indexOf(e.name);if(t!==-1){let n=[...C.slice(t),e.name].map(e=>`${e}.tla`);throw new l(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],a=[],o=[];C.push(e.name),S.push(n);let s=ve(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:a,warnings:ie,levelChecks:o});if(S.pop(),C.pop(),a.length>0)throw i(a,!1,void 0,ie);let c=r.find(e=>n.has(e.name)),u=c&&_.get(c.name),d=u&&LS(c,u.module);if(d)throw i([d],!1,void 0,ie);if(c)throw IS(c);return o.forEach(e=>e()),{linked:s,closure:n}},O=(e,n)=>{let r=_.get(e);if(r)return w(e,x.get(e)??[]),r;let i=ue(D(e,n)),a=/* @__PURE__ */ new Map;return kp(e,t.print,m,t.files,f,(e,t,n)=>{let r=a.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new y(`No definition of ${e} to fall back to`);return W(r.body,{environment:n.environment,scope:Jg(Pg(r),i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=i.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&NS.has(e))return;let r=o.get(n.key);r&&a.set(t.name,r),f.set(n.key,t),o.delete(n.key)}),_.set(e,i.linked),x.set(e,i.closure),w(e,i.closure),i.linked},de=(e,t,n,r,i)=>{let a=i?void 0:T(e.module);if(a)return fe(e,a);let l=i??O(e.module,t.name);l.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=PS(l),p=`#${te++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=ol(cS(e,t),f,t,n);re.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>d.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=Wl({params:g,substitutions:new Map([...h].map(([e,t])=>[e,fl(t,m)])),variables:new Set(l.variables),getDefinition:e=>o.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>s.get(e)===!0,addDefinition:(n,i,a)=>{let l=ne(`${i}@${t.name}`),d=a(l);return o.set(l,d),f.length>0&&u.add(d),e.name!==void 0&&se.set(l,`${e.name}!${se.get(n)??i}`),s.set(l,!r),c.set(l,{source:n,prefix:e.params.length}),l},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return pe(e,l.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&ce.set(r,n),r})},fe=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),pe=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:s.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},me=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),he=(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=me(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Ll(r,n),location:n}}},ge=(e,t,n,r)=>{let i=e.location,a=r?void 0:T(e.module);if(a)return e.name===void 0?[]:[...a].map(([t,n])=>{let r=me(n.arity);return Rl(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??O(e.module,n),l=`#${te++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=PS(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};re.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=>VS(f(e),p),h=d.map(t=>{let n=he(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],_=Wl({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Ll(e.params,i),location:i,resolution:Gs}:Il(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>o.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>s.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:BS(a,i)),i},createName:ne}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=me(n.arity),o=[...e.params,...a];return Rl(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...y]},_e=e=>[...e].flatMap(([e,t])=>{let n=o.get(t.key);return n?[{...n,name:e}]:[]}),k=/* @__PURE__ */ new Map,ve=(e,n)=>{let r=Wy(e,t.loadClass?.(e.name),e===a);k.set(e.name,r.overrides);let i=r.module,c=re.length,l=new Map([...up.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:tl,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=m.get(t);if(!n){l.set(t,e),m.set(t,e);return}if(!n.range||!e.range||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);zS(n.kind)===zS(e.kind)?d.warnings.push({location:r,message:`Warning: the ${RS(n.kind)} of '${t}' conflicts with \nits ${RS(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${RS(e.kind)} of '${t}' conflicts with \nits ${RS(n.kind)} at ${i}.`})}),m=/* @__PURE__ */ new Map,h=/* @__PURE__ */ new Set,_=/* @__PURE__ */ new Map,v=[],y=[...i.constants],x=i.variables.filter((e,t)=>i.variables.findIndex(t=>t.name===e.name)===t),S=x.map(e=>e.name),C=x.map(e=>e.location);i.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:T(e);if(r){p(r);return}let a=t??O(e,i.name);y.push(...a.constants.filter(e=>y.every(t=>t.name!==e.name)&&!S.includes(e.name))),a.variables.forEach((e,t)=>{S.includes(e)||y.some(t=>t.name===e)||(S.push(e),C.push(a.variableLocations[t]))}),p(a.exported),a.facts.forEach(e=>h.add(e)),a.modules.forEach((e,t)=>_.set(t,e)),v.push(a)});let w=new Map(l),te=[...i.constants.map(e=>({...e,kind:`Constant`})),...i.variables.map(e=>({...e,kind:`Variable`}))],ne=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});te.forEach(e=>m.set(e.name,ne(e)));let oe=e=>({key:le(e),arity:Qs(e),params:$s(e),kind:nl(i,e)?`Theorem`:`Definition`,range:e.location.range}),se=y.length===0&&S.length===0,le=e=>i===a?e.name:`${e.name}@${n.id}`,E=/* @__PURE__ */ new Map,D=()=>new Map([...n.modules,..._]),ue=e=>{let t=i.modules.find(t=>t.name===e.module);return t?Zs(t.location,e.location)?_.get(t.name):void 0:D().get(e.module)},me=e=>({imported:l,getInstance:e=>{let t=ue(e),n=t?void 0:T(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:i.name};let r=t??O(e.module,i.name),a=PS(r);return{declarations:a,symbols:pe(e,r.exported,a,e=>e),instancer:i.name}},bound:w,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:le,instanced:E,facts:h,reports:f,warnings:n.warnings}),he=e=>[...te.filter(t=>Zs(t.location,e)).map(e=>[e.name,ne(e)]),...i.definitions.filter(t=>Zs(t.location,e)).map(e=>[e.name,oe(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),ye=e=>{let t=D(),r=t.get(e.name),i=r&&LS(e,r.module);if(r&&!i)throw IS(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=ve(e,{id:`${n.id}/${e.name}`,symbols:he(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||_.set(e.name,o)};[...i.instances.map(e=>({location:e.location,link:()=>{let t=de(e,i,me(i),se,D().get(e.module));E.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||m.set(n,t))})}})),...i.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>Zs(e.location,t.location)?-1:1).forEach(e=>e.link());let be=lS(Jl(i,(e,t)=>ge(e,t,i.name,ue(e))),_e(l));n.errors.push(...cl(be,me(be))),be.definitions.forEach(e=>{let t=le(e);o.set(t,e),s.set(t,!se);let n=oe(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Zs(r,e.location))&&(l.set(e.name,n),e.isLocal||m.set(e.name,n))});let xe={module:be,constants:y,variables:S,variableLocations:C,visible:l,exported:m,modules:_,extended:v,facts:/* @__PURE__ */ new Set([...h,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};ee.has(i.name)||ee.set(i.name,xe);let Se=re.splice(c).map(e=>({location:e.location,check:()=>ae(e)}));return n.levelChecks.push(()=>ku(be,{constants:new Set(y.map(e=>e.name)),variables:new Set(S),getDefinition:e=>o.get(l.get(e)?.key??e),getQualifiedName:e=>ce.get(l.get(e)?.key??e)},Se,ie)),b.push(xe),xe},ye=ue(a).linked,be=t.traceFile,xe=be===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:be}}],Se=[...t.moduleOperators??[],...xe].map(e=>{let t=O(e.module,a.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});b.push(...b.splice(b.indexOf(ye),1)),ie.length>0&&!t.isSanyReported&&t.print(h(ie)),ye.visible.forEach((e,t)=>{let n=o.get(e.key);n&&e.key!==t&&o.set(t,n)}),Se.forEach(e=>{let t=e.key===void 0?void 0:o.get(e.key);e.kind!==`postcondition`&&t&&o.set(e.operator,t)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(ye,/* @__PURE__ */ new Set);let Te=ye.constants.map(e=>e.name),Ee=ye.variables,De=jy(e,{root:ye,moduleSymbols:new Map([...p,...[..._].map(([e,t])=>[e,t.visible]),[a.name,ye.visible]]),definitions:o,builtins:f,copySources:c,operatorConstants:new Map(Se.flatMap(e=>O(e.module,a.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:r}),Oe=De.constants,ke=De.substitutions;be!==void 0&&f.forEach((e,t)=>{let n=hp(e);n&&f.set(t,n)});let A=HS(Ee,b.flatMap(e=>e.module.variables.map(e=>e.name))),Ae=Vu({definitions:o,substitutions:ke,constants:Oe,variableIndex:A,builtins:f,variables:Ee}),je={runtime:m,definitions:o,builtins:f,constants:Oe,substitutions:ke,instanceNames:se,variables:Ee,variableIndex:A,facts:Ae,startupValues:Array.from({length:Ae.ids.size},()=>void 0),substitutedDefinitions:u,instanceParams:d,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Me=Du({constants:new Set(Oe.keys()),variables:/* @__PURE__ */ new Set([...Ee,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>f.has(e))]),getDefinition:e=>ng(e,je)}),Ne=e=>{try{W(e,{environment:je,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};ke.forEach((e,t)=>{let n=o.get(e),r=Te.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Me.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Ne(n.body):void 0;if(r){let n=Nt(r)?``:` - specifically: ${r.message}`;throw new v(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),m.version!==`1.7.4`&&(m.isStarted=!0);let Pe=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),Fe=r.createDefinitionOrder();return{environment:je,assumptions:Ce,variableLocations:ye.variableLocations,instanceActions:oe,startupDefinitions:b.filter(e=>!Pe.has(e.module.name)||PS(e).length===0).flatMap(e=>Fe(e===ye?void 0:e.module.name).flatMap(t=>{let n=o.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:b.flatMap(e=>k.get(e.module.name)??[]),moduleOperators:Se,rootName:a.name}},KS=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),qS=(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},JS=e=>S(new y(`${m}${e}`),w.error),YS=e=>{let t=L(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!dn(e)||!dn(i))throw JS(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},XS=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${ZS(t)}`:n},ZS=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(ZS).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${XS(e.pattern,e.set)}:${ZS(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(ZS).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${ZS(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>XS(e.pattern,e.set)).join(`,`)}|->${ZS(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(ZS);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},QS=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,$S=(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 JS(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!P(a)||!F(a))throw JS(`The symmetry operator must specify a set of functions.`);let o=I(a).elements;if(!o.every(un))throw JS(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=ZS(QS(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(St.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(YS).forEach(e=>{e.size>0&&d.set(KS(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=qS(n,e),r=KS(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!QS(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>dn(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},eC=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=nC(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(nC(e[r],t));return a}},tC=(e,t)=>{let n=[],r=[];for(let i of e){let e=nC(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Xn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Xn(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},nC=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=tC(e.elements,t);return n?tr(n):e}if(n===`Function`||n===`LazyFunction`&&F(e.domain)){let n=L(e),r=eC(n.domain,t),i=eC(n.range,t)??n.range;if(r){let e=Qr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?rr(n.domain,e.range):e}return i===n.range?n:rr(n.domain,i)}if(n===`Interval`||!P(e)||!F(e))return e;let r=I(e),i=eC(r.elements,t);return i?Kr(i):r},rC=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=nC(e[o],i),a===0&&(a=Xn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},iC={line:0,column:0},aC=e=>({kind:`Identifier`,name:e,location:iC}),oC=e=>({name:e,expression:aC(e),scope:void 0}),sC=/* @__PURE__ */ new Set([`name`,`property`]),cC=(e,t,n)=>{let r=ng(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(sC.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},lC=e=>e.body.kind===`Number`||e.body.kind===`String`,uC=(e,t,n)=>{if(n.constants.has(e))return n.constants.get(e);if(Wu(t,n)&&!lC(t))try{return W(aC(e),PC(n,void 0,void 0))}catch(e){if(e instanceof y||ee(e))return;throw e}},dC=(e,t,n)=>{if(n.constants.has(t))throw new v(`The ${e} ${t} cannot be a constant.`);let r=cC(e,t,n);if(uC(t,r,n)!==void 0)throw new v(`The ${e} ${t} cannot be a constant.`);return r},fC=(e,t,n)=>{let r=n.constants.has(t)?void 0:cC(e,t,n),i=r?uC(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new v(`The ${e} of ${t} is equal to ${R(i)}`);return i===void 0?r:void 0},pC=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},mC=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),jg(e.startupDefinitions,r),t.invariants.forEach(e=>{fC(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},hC=(e,t)=>{let n=Du({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=fC(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
1780
+ `]]),gp=(e=`master`)=>e===`1.7.4`?hp:mp,_p=(e,t)=>e.every(e=>Gi(e,t)),vp=Kr([!1,!0]);Vr(vp);const yp=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Zr(yp(e,t,r),yp(e,r,n))},bp=[`\\cup`,`\\cap`,`\\`],xp=e=>typeof e==`object`&&e.kind===`MixedSet`,Sp=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,Cp=(e,t,n)=>{t.kind===`Interval`&&Fi(t);let r=t.kind===`Interval`?t:Br(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return sn(r,e=>{Gi(e,n)===i&&an(a,e)}),Sp(t)?nr(a):qr(a)}if(Mi(t))return n;if(!ln(n))return ur({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return sn(r,e=>an(i,e)),sn(n.kind===`Interval`?n:I(n).elements,e=>{Gi(e,t)||an(i,e)}),qr(i)},wp=(e,t)=>{let n=(t,n)=>us([Ms(t,n,e)()],0,e);return{...B(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},Tp=[fs(`TRUE`,!0),fs(`FALSE`,!1),fs(`BOOLEAN`,vp),fs(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),hs(`=`,Ur),hs(`#`,(e,t)=>!Ur(e,t)),B(`~`,1,e=>!us(e,0,`~`)),B(`<=>`,2,e=>us(e,0,`<=>`)===us(e,1,`<=>`)),wp(`/\\`,(e,t)=>e&&t()),wp(`\\/`,(e,t)=>e||t()),wp(`=>`,(e,t)=>!e||t()),B(`\\in`,2,e=>Gi(z(e,0,`\\in`),z(e,1,`\\in`))),B(`\\notin`,2,e=>!Gi(z(e,0,`\\notin`),z(e,1,`\\notin`))),hs(`\\subseteq`,(e,t)=>{if(!cn(e))throw new y(`\\subseteq expects a set but received ${R(e)}`);if(typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&F(e.base))return _p(I(e.base).elements,t.base);if(typeof e==`object`&&e.kind===`Interval`){if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;for(let n=e.low;n<=e.high;n++)if(!Gi(n,t))return!1;return!0}return!Ei(e,e=>!Gi(e,t))}),...bp.map(e=>B(e,2,t=>{let n=z(t,0,e),r=z(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(ln(n)&&ln(r)&&!xp(n)&&!xp(r)&&!i&&!on(n)&&!on(r)){if(e===`\\cup`&&Mi(n))return r;let t=e===`\\cup`?Zr:e===`\\cap`?Xr:Yr;return Ui((n,r)=>{let i=I(n),a=I(r),o=t(i,a);if(e===`\\cup`){let e=Br(i),t=Yr(a,i).elements,n=e===i.elements&&(t.length===0||Xn(e[e.length-1],t[0])<0);if(e.length+t.length>nn())throw new s(rn());if(n&&!i.isNormalized)return o;let r=o===i?tr(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=Sp(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>Gi(e,o)))),o},(t,n)=>Cp(e,t,n),n,r)}return ln(n)?Cp(e,n,r):e!==`\\`&&ln(r)?Cp(e,r,n):ur({kind:`SetOperation`,operator:e,left:n,right:r})})),B(`SUBSET`,1,e=>({kind:`Subset`,base:z(e,0,`SUBSET`)})),B(`UNION`,1,e=>{let t=z(e,0,`UNION`),n=fn(t)?Br(t):[],r=n.filter(fn);if(!fn(t)||r.length!==n.length)return ur({kind:`Union`,base:t});let i=r.flatMap(Br),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{Gi(t,e)||an(e.elements,t)}),qr(e.elements)};return xp(t)||r.some(xp)?a():r.length===0?Jr:Ui(e=>zi(yp(e,0,e.length),i),a,r.map(I),void 0)}),B(`DOMAIN`,1,e=>{let t=z(e,0,`DOMAIN`);if(!un(t))throw new y(`DOMAIN expects a function but received ${R(t)}`);return ua(t)})],Ep=Ds(`Integers`,`Neg`,`IntValue`,1),Dp=e=>{let t=Ds(e,`DotDot`,`IntervalValue`,2);return[Os(e,`+`,`Plus`,(e,t)=>e+t),Os(e,`-`,`Minus`,(e,t)=>e-t),Os(e,`*`,`Times`,(e,t)=>e*t),Os(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new x(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new x(`0^0 is undefined.`);return e**t}),Os(e,`\\div`,`Divide`,(e,t)=>{if(t===0)throw new x(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(gs(n))throw _s(`${e} \\div ${t}`);return n}),Os(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new x(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),B(`..`,2,e=>{let n=z(e,0,`..`),r=Es(z(e,1,`..`),t);return{kind:`Interval`,low:Es(n,t),high:r}})]},Op=Dp(`Naturals`),kp=Dp(`Integers`),Ap=e=>{let t=Op.indexOf(e);return t===-1?void 0:kp[t]},jp=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[Ts(As(`<`,(e,t)=>e<t),t(`LT`)),Ts(As(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),Ts(As(`<=`,(e,t)=>e<=t),t(`LE`)),Ts(As(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Mp=[fs(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Op,...jp(`Naturals`)],Np=[fs(`Int`,{kind:`InfiniteSet`,name:`Int`}),...kp,...jp(`Integers`),B(`-.`,1,e=>{let t=Es(z(e,0,`-`),Ep);if(gs(-t))throw _s(`-${t}`);return-t})],Pp=(e,t,n)=>{let r=z(e,t,n),i=Bi(r);if(!i)throw new x(`${n}\n${R(r)}`);return i},Fp=(e,t,n)=>{let r=z(e,t,n);return typeof r==`string`?r:Pp(e,t,n)},Ip=(e,t,n)=>{let r=z(e,t,`SubSeq`);if(typeof r!=`number`)throw ss(n,`SubSeq`,`natural number`,r);return r},Lp=(e,t,n)=>typeof e==`string`?Bn(e.slice(t,n)):li(e.slice(t,n)),Rp=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,zp=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Bp=(e,t)=>{let n=cc.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Ts(e,t):e}):t},Vp=e=>Bp(`Sequences`,[B(`Seq`,1,e=>({kind:`SequenceSet`,base:z(e,0,`Seq`)})),B(`Len`,1,e=>Fp(e,0,Rp(``,`Len`)).length),B(`\\o`,2,e=>{let t=Fp(e,0,zp(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Pp(e,1,zp(`t \\o s`,`sequence`));return li([...t,...n])}let n=z(e,1,`\\o`);if(typeof n!=`string`)throw new x(`${zp(`t \\o s`,`string`)}\n${R(n)}`);return Bn(t+n)}),B(`Append`,2,t=>li([...Pp(t,0,zp(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),z(t,1,`Append`)])),B(`Head`,1,e=>{let t=Pp(e,0,Rp(``,`Head`));if(t.length===0)throw new x(`Attempted to apply Head to the empty sequence.`);return t[0]}),B(`Tail`,1,e=>{let t=Fp(e,0,Rp(``,`Tail`));if(t.length===0)throw new x(`Attempted to apply Tail to the empty sequence.`);return Lp(t,1)}),B(`SubSeq`,3,e=>{let t=Fp(e,0,Rp(`first `,`SubSeq`)),n=Ip(e,1,`second`),r=Ip(e,2,`third`);if(n>r)return Lp(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new x(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${R(z(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Lp(t,n-1,r)}),ps(`SelectSeq`,2,e=>{let t=ds(e,1,`SelectSeq`);return li(Pp(e,0,Rp(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new x(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${t.name}>`);return n}))})]),Hp=e=>Bp(`FiniteSets`,[B(`IsFiniteSet`,1,e=>Li(z(e,0,`IsFiniteSet`))),B(`Cardinality`,1,t=>{let n=z(t,0,`Cardinality`);if(!cn(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new x(`Attempted to compute cardinality of the value\n${R(n)}`);return Fi(n,e)})]),Up=[Ts(B(`Warshall`,1,e=>{let t=z(e,0,`Warshall`);if(!cn(t)||Un(t))throw new x(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${R(t)}`);Fi(t);let n=[],r=/* @__PURE__ */ new Map,i=e=>{let t=ka(e),i=r.get(t)??n.length;return i===n.length&&(r.set(t,i),n.push(e)),i},a=I(t).elements.map(e=>{let t=Bi(e);if(t?.length!==2)throw new x(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${R(e)}`);return[i(t[0]),i(t[1])]}),o=n.map(()=>n.map(()=>!1));a.forEach(e=>{o[e[0]][e[1]]=!0});for(let e=0;e<n.length;e++)for(let t=0;t<n.length;t++)if(o[t][e])for(let r=0;r<n.length;r++)o[e][r]&&(o[t][r]=!0);return qr(n.flatMap((e,t)=>n.flatMap((n,r)=>o[t][r]?[li([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],Wp=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return Up;if(e===`AnySet`)return[fs(`ANY`,qn)];if(e===`IOUtils`)return df(r,a);if(e===`_TLCTrace`)return mf(r);if(!gp(n.version).has(e))return;let o=qp(e,t,n,r,i);return e===`Randomization`&&o?[...o,zf(n)]:o},Gp=/* @__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`]]]),Kp=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),qp=(e,t,n,r,i)=>{switch(e){case`Naturals`:return Mp;case`Integers`:return Np;case`Sequences`:return Vp(n.version);case`FiniteSets`:return Hp(n.version);case`TLC`:return Bp(`TLC`,fp(t,n));case`Randomization`:return Bf(n);case`_Possible`:return ep(t,n);case`Json`:return uf(r);case`Bags`:return Bp(`Bags`,Pd(i));case`TLCExt`:return Bp(`TLCExt`,$f(t,n));default:return}},Jp=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&Al.get(t)||[];r.expressions.push(...i,t);let a=Hi.sets,o=a??[],s=o.length;Hi.sets=o;try{return n()}catch(e){throw S_(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Hi.sets=a}},Yp=(e,t,n)=>e.coverage?Bo(e.coverage,t,n):-1,Xp=(e,t,n)=>e.coverage?Ho(e.coverage,t,n):n(),Zp=(e,t,n,r)=>Xp(e,t,()=>W(n,r)),Qp=(e,t,n,r)=>{let i=Zp(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},$p=(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},em=e=>!e.includes(void 0),tm=e=>e.variables.map(()=>void 0),nm=(e,t,n)=>{let r=[...e];return r[t]=n,r},rm=(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}},im=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,am=e=>e.kind===`Identifier`?e.name:void 0,om=(e,t,n)=>{if(t.kind===`Label`)return om(e,t.body,n);let r=am(t);if(r===void 0)return;let i=og(n,r);if(i?.kind===`Thunk`)return om(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=Xg(r,e);return o?.kind===`Closure`&&o.params.length===0?om(e,o.body,o.scope):void 0},sm=(e,t,n)=>{if(t.kind===`Prime`)return om(e,t.expression,n);if(t.kind===`Label`)return sm(e,t.body,n);let r=am(t);if(r===void 0)return;let i=og(n,r);if(i?.kind===`Thunk`)return sm(e,i.expression,i.scope);if(i)return;let a=Xg(r,e);return a?.kind===`Closure`&&a.params.length===0?sm(e,a.body,a.scope):void 0},cm=e=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean expression.`);return e},lm=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),um=(e,t,n,r)=>{let i=fm(e,t,n,r);return i&&e.coverage&&!e.isInit&&Vo(e.coverage,r),i},dm=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Vo(r,n),Vo(r,r.roots[n])),e.onState(t),!0},fm=(e,t,n,r)=>t===void 0?em(n)?dm(e,n,r):(e.onIncomplete?.(n),!1):em(n)&&lm(e)?mm(e,t,n,r):t.kind===`Predicate`?hm(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?jm(e,t.expression,t.rest,t.scope,n,t.node):pm(e,t,n)&&um(e,t.rest,n,t.node),pm=(e,t,n)=>{let r=e.environment,i=Zp(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return Zp(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?ag(t,r.runtime.version):t}})();try{return!Ur(i,a)}catch(t){throw e.callStack&&S_(e.callStack,[i],t),t}},mm=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return jm(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?pm(e,i,n):cm(Zp(e,i.node,i.expression,$p(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return dm(e,n,r)},hm=(e,t,n,r,i,a)=>gm(e,t,n,r,i,Yp(e,a,t)),gm=(e,t,n,r,i,a)=>Jp(e,t,()=>{switch(t.kind){case`Let`:{let o=$p(e,r,i),s=t.definitions,c=e.coverage?p_(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):p_(s,o);return hm(e,t.body,n,c,i,a)}case`Label`:return hm(e,t.body,n,r,i,a);default:if(Tm.has(t.kind))throw new y(`The state relation is not a boolean expression.`);return Jp(e,t,()=>km(e,t,n,r,i,a))}}),_m=(e,t,n,r,i)=>cm(t)&&um(e,n,r,i),vm=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),ym=(e,t,n,r,i,a)=>{let o=$p(e,r,i);if(t.kind===`Identifier`){let s=og(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return hm(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return hm(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:Xg(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&dd(c,e.environment))?hm(e,l.body,n,l.scope,i,a):_m(e,Qp(e,a,t,o),n,i,a)}let s=Zg(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Xp(e,a,()=>l_(s,t.args,o));return hm(e,s.body,n,r,i,a)}let c=vm.has(t.operator)?Zp(e,a,t,o):Qp(e,a,t,o);return _m(e,c,n,i,a)},bm=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?um(e,t,nm(n,r,i),a):Ur(o,i)&&um(e,t,n,a)},xm=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),Sm=(e,t,n)=>(e.coverage&&Uo(e.coverage,t,n.length+1),n),Cm=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?om(e.environment,o,r):sm(e.environment,o,r),l=$p(e,r,i);if(c===void 0)return Zp(e,a,t,l)===!0&&um(e,n,i,a);let u=Zp(e,a,s,l),d=i[c];if(t.operator===`=`)return bm(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&e.callStack?.sources.set(f,s),d!==void 0)return Zp(e,a,t,l)===!0&&um(e,n,i,a);if(!fi(f))throw new y(`The right side of \\IN is not enumerable.`);return Sm(e,f,Di(f)).reduce((t,r)=>um(e,n,nm(i,c,r),a)||t,!1)},wm=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Tm=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Em={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Dm=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Em[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${U(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${U(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${U(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`},Om=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Xp(e,r,()=>Eg(t.bounds,t=>{let r=W(t,n),i=Cg(r,t,a);return Array.isArray(i)&&Sm(e,r,i),i}));return Og(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},km=(e,t,n,r,i,a)=>{let o=$p(e,r,i);switch(t.kind){case`Identifier`:return ym(e,t,n,r,i,a);case`Apply`:return wm.has(t.operator)&&t.args.length===2?Cm(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?cm(Zp(e,a,t.args[0],o))?hm(e,t.args[1],n,r,i,a):um(e,n,i,a):ym(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>xm(`Predicate`,t,r,a,e),n);return hm(e,o[0],t,r,i,a)}let s=o[o.length-1];return gm(e,rm(t,o.length-1),xm(`Predicate`,s,r,a,n),r,i,im(e,a))}case`Or`:{let o=t.operands;if(t.isBulleted||o.length===2)return o.reduce((t,o)=>hm(e,o,n,r,i,a)||t,!1);let s=gm(e,rm(t,o.length-1),n,r,i,im(e,a)),c=hm(e,o[o.length-1],n,r,i,a);return s||c}case`Exists`:return Om(e,t,o,a).reduce((r,o)=>hm(e,t.body,n,o,i,a)||r,!1);case`Forall`:{let r=Om(e,t,o,a);if(r.length===0)return um(e,n,i,a);let s=r.slice(1).reduce((e,n)=>xm(`Predicate`,t.body,n,a,e),n);return hm(e,t.body,s,r[0],i,a)}case`If`:return hm(e,cm(Zp(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>cm(Zp(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new y(`TLC encountered a CASE with no conditions true.`);return hm(e,s,n,r,i,a)}case`FunctionApplication`:{let r=Pg(Zp(e,a,t.function,e.isInit?o:ug(o)));if(r){let s=Xp(e,a,()=>Fg(r,t,o));return hm(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return jm(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=hm(e,t.action,n,r,i,a);return jm(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return hm(e,t.action,xm(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?Dm(t):void 0;if(s!==void 0)throw new y(s);return _m(e,Zp(e,a,t,o),n,i,a)},Am=(e,t,n)=>e.runtime.warn(xt.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${U(n)}`),jm=(e,t,n,r,i,a)=>Jp(e,t,()=>{let o=Yp(e,a,t),s=om(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!Ur(a,r)?(Am(e.environment,s,t),!1):bm(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return um(e,n,i,o);let c=s.reduceRight((e,t)=>xm(`Unchanged`,t,r,o,e),n);return jm(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=og(r,t.name);if(a?.kind===`Thunk`)return jm(e,a.expression,n,a.scope,i,o);let s=a?void 0:Xg(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return jm(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=$p(e,r,i),s=Zg(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return jm(e,s.body,n,l_(s,t.args,a),i,o)}let c=e.environment,l=Zp(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=Zp(e,o,t,{environment:c,scope:r,state:i,next:void 0});return Ur(l,u)&&um(e,n,i,o)}),Mm=(e,t,n,r,i)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i}),Nm=/* @__PURE__ */ Error(`The replay found a successor`),Pm=(e,t,n,r)=>{let i=Mm(r,`enabled`,n,()=>{throw Nm}),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=xm(`Changed`,e.subscript,t,-1,void 0);hm(i,e.action,n,t,tm(r),-1)}else hm(i,e,void 0,t,tm(r),-1);return!1}catch(e){if(e!==Nm)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},Fm=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Mm(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>xm(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);hm(o,i.expression,s,i.scope,tm(t),i.node??-1)},Im=(e,t,n,r)=>{e.some(e=>Tm.has(e.expression.kind))||e.forEach(e=>{let i=[];Lm(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},Lm=(e,t,n,r,i,a)=>{let o=Mm(r,`next`,n,i,a);hm(o,e.expression,void 0,e.scope,tm(r),t)},Rm=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(om(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=og(r,e.name)?void 0:Xg(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,p_(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){sm(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=og(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?Zg(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:Xg(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,l_(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},zm=/* @__PURE__ */ new WeakMap,Bm=/* @__PURE__ */ new WeakMap,Vm=(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},Hm=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Um=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Wm=(e,t)=>{let n=new y(t);return e.isInit?n:v(n,S.error)},Gm=(e,t,n,r)=>{let i=Yh(n);return r&&Tm.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 ${Um(e)}, TLC expected a boolean expression,\nbut instead found ${R(t)}.\n${i}`},Km=(e,t,n)=>{let r=Cs(t),i=U(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${Um(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
1781
+ `:``}${i}`},qm=(e,t,n)=>Xm(e,t,W(t,n)),Jm=new Set(Tp.map(e=>e.name)),Ym=e=>e.kind===`Apply`?Jm.has(e.operator):e.kind!==`Identifier`&&!Tm.has(e.kind),Xm=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;let i=Gm(e,n,t,r);throw e.isInit&&r&&Ym(t)?new re(i):Wm(e,i)},Zm=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=O_(n,r.environment))(r),Qm=e=>e===`=`||e===`\\in`||e===`\\subseteq`,$m=(e,t,n)=>{let r=n?zm:Bm,i=r.get(e);if(i)return i;let a=Nh(e,t,n),o=n?void 0:Mh(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},eh=(e,t)=>{if(t.constants.has(e))return;let n=_g(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},th=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return th(e.expression,t,!1,r);if(e.kind!==`Identifier`||N(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=eh(e.name,t);if(a&&!r.has(a))return r.add(a),th(a.body,t,n,r)},nh=(e,t,n)=>th(e,t,!n),rh=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return rh(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=p_(e.definitions,Vm(r,t,n));return rh(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=og(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return rh(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=eh(e.name,r.environment);if(s)return rh(s.body,void 0,n,r,i)},ih=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||N(e))||!t&&e.kind===`Prime`,ah=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ah(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=eh(e.name,t);if(i)return n.add(e.name),ah(i.body,t,n)},oh=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),sh=(e,t,n)=>oh.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Qm(e.operator)&&(ih(e.args[0],n)||nh(e.args[0],t,n)!==void 0)||N(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,ch=/* @__PURE__ */ new Set,lh=(e,t)=>{if(N(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return zl(e,(e,i)=>{let a=r?lh(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},uh=(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||N(e)?void 0:_g(r,t);return i&&!n.has(i)&&(n.add(i),uh(i.body,t,n))?!0:pt(e).some(e=>uh(e,t,n))},dh=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=nh(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=ah(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return sh(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:$m(e,t,n)}},fh=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(_d(e,t)===void 0||uh(e,t,/* @__PURE__ */ new Set))return!0;let n=lh(e,ch);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)}},ph=(e,t,n)=>{let r=e.map(e=>dh(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=lm(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Fh(u)){d??=Vm(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!Ur(t,i[e.index])}):void 0;if(o){Am(t.environment,o.index,o.expression);return}let s=n.expression,c=Zm(a,e,s,d);if(!Xm(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Vm(t,n,u);let r=Zm(i,s,e.expression,d);if(!Xm(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Vm(t,n,u);let r=Zm(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Hm(u,e.index,r),d=void 0;else if(!Ur(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!Ur(e,n[i.index])){Am(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},mh=e=>{let t=Dm(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw Wm(n,t);qm(n,e,Vm(n,r,i))&&s(i,a)}},hh=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Vm(r,i,a);if(a[l]!==void 0){qm(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!fi(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Um(r)}, the right side of \\IN is not enumerable.`;throw Wm(r,`${t}\n${U(e)}`)}let p=Di(f);if(r.generator){for(let e of jf(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(Hm(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(Hm(a,l,p[e]),o)}},gh=/* @__PURE__ */ new WeakMap,_h=e=>{let t=gh.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(_h),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return gh.set(e,n),n},vh=(e,t)=>{let n=e.args[0],r=mh(e),i=(e,r,i)=>rh(n,r,i,e,!t)??-1,a=hh(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],Vm(t,n,o));l(Hm(o,u,d),s)}},yh=(e,t,n)=>{let r=U(e);return(i,a,o,s,c,l)=>{let u=Vm(i,a,o),d=W(e.function,n?u:ug(u)),f=Pg(d);if(f!==void 0){$m(f.body,t,n)(i,Fg(f,e,u),o,s,c,l);return}if(!un(d))throw Wm(i,`In computing ${Um(i)}, a non-function (${Cs(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw Wm(i,`In computing ${Um(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},bh=(e,t)=>{let n=_h(e);return ah(e,t)?ph([n],t,!1):e.kind===`Tuple`?$m(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?og(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){$m(_h(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=Vm(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=Zg(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){$m(_h(n.body),t,!1)(r,l_(n,e.args,u),a,o,s,c);return}}qm(r,n,u)&&c(a,o)}},xh=(e,t,n)=>{let r=e.operator,i=mh(e),a=N(e)?void 0:Xg(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=N_(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=$m(a.body,t,n),o(e,i(Vm(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Vm(a,o,s),f=Zg(e,d);f?.kind===`Closure`?$m(f.body,t,n)(a,l_(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Sh=(e,t,n)=>{let r=mh(e),i=N(e)?void 0:eh(e.name,t),a;return(o,s,c,l,u,d)=>{let f=og(s,e.name);f?.kind===`Thunk`&&!f.isReleased?$m(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&Gg(i,t)!==void 0?r(o,s,c,l,u,d):(a??=$m(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},Ch=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||N(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!N(i))return;let a=th(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},wh=e=>e.kind===`And`?e.operands.flatMap(wh):[e],Th=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&sh(e,t,!1),Eh=e=>{let t=[];return(n,r,i)=>{let a=Vm(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Xm(n,i,Zm(t,r,i,a)))return}}},Dh=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=wh(e),r=n.findIndex(e=>!Th(e,t)||Ch(e,t)),i=r===-1?void 0:Ch(n[r],t);return i?{...i,before:r===0?void 0:Eh(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Dh(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||N(e))return;let r=Xg(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Dh(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`||!N(o))return;let s=i.before,c=s&&N_(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Vm(e,t,n)),n))}},Oh=(e,t,n)=>{let r=og(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},kh=(e,t,n)=>{let r=e.map(e=>$m(e,t,n)),i=n?[]:e.map(e=>Dh(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&Oh(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Ah=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=xf(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},jh=(e,t)=>{let n=$m(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=Vm(r,i,a),u=t.runtime.version,d=Eg(e.bounds,e=>W(e,l)).map((n,r)=>jf(xg(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,cg(i,l,e)))};f(d.length-1,i)}},Mh=(e,t)=>{if(e.kind===`Exists`)return jh(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>$m(e,t,!1));return e.isBulleted?Ah(n):n.reduce((e,t)=>Ah([e,t]))},Nh=(e,t,n)=>{let r=e=>$m(e,t,n);switch(e.kind){case`And`:return ph(e.operands,t,n);case`Or`:return kh(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=xg(W(a.set,Vm(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,sg(r,e,u[t]),o,s,c,l)}}let o=n?void 0:fh(e,t);if(o){let r=ph(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=Vm(n,i,a),d=Eg(e.bounds,e=>xg(W(e,u),e,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=sg(t,o.names[e],r);if(e===d.length-1){let e=Vm(n,i,a);if(!o.guards.every(t=>qm(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{kg(e.bounds,Vm(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&_d(e,t)!==void 0&&!uh(e.body,t,/* @__PURE__ */ new Set)?lh(e,ch):void 0;return(t,n,r,o,s,c)=>{let l=[];kg(e.bounds,Vm(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>og(n,e)?.kind===`Value`)){u.every(n=>qm(t,e.body,Vm(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Fh(r)?u.slice(n).every(n=>qm(t,e.body,Vm(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=W(e.condition,Vm(r,i,a));if(typeof l!=`boolean`)throw Wm(r,Km(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=Vm(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw Wm(r,`In computing ${Um(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Cs(t)}) was used as a guard condition of a CASE.\n${Yh(e.source)}`)})?.body??n;if(!u)throw Wm(r,`In computing ${Um(r)}, TLC encountered a CASE with no conditions true.\n${U(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=h_(e.definitions,t);return(t,r,a,o,s,c)=>n(t,p_(e.definitions,Vm(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new y(`UNCHANGED appears in an initial predicate at ${Kh(e)}`)}:bh(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return qm(e,i,Vm(e,n,r))}catch(n){throw e.isEnabled?ag(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 kh([e.action,_h(e.subscript)],t,n);case`Label`:return r(e.body);case`Identifier`:return Sh(e,t,n);case`FunctionApplication`:return yh(e,t,n);case`Apply`:{let i=e.args;if(Qm(e.operator)){let r=nh(i[0],t,n);if(r!==void 0)return e.operator===`=`?ph([e],t,n):hh(e,()=>r);if(ih(i[0],n))return vh(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=W(i[0],Vm(n,r,a));if(typeof l!=`boolean`){let t=Cs(l),r=U(e);throw Wm(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return xh(e,t,n)}default:return mh(e)}},Ph=e=>e.variables.map(()=>void 0),Fh=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Ih=(e,t)=>{let n=t.state;if(!n||!Fh(n))throw new y(`ENABLED needs a complete state at ${Kh(e)}`);let r=t.environment;if(r.callStack)return Pm(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return $m(e,r,!1)(i,t.scope,Ph(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Lh=(e,t,n,r,i)=>{let a={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};$m(e,t,!0)(a,r,Ph(t),void 0,!1,e=>{if(!a.isStopped){if(!Fh(e)){if(i){a.isStopped=i([...e]);return}throw v(new d([...e]),S.error)}a.isStopped=n(e)}})},Rh=(e,t,n)=>{let r=[];return Lh(e,t,e=>(r.push(e),!1),n),r},zh=(e,t,r,i,a,o,s)=>{let c={environment:r,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:o,successors:0,onUnsatisfied:s};return $m(e,r,!1)(c,a,Ph(r),void 0,!1,(e,t)=>{if(!c.isStopped){if(!Fh(e)){let i=r.variables.filter((t,n)=>e[n]===void 0);throw new n(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,e,t,i)}c.successors++,c.isStopped=i({state:e,action:t})}}),c.successors},Bh=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return $m(e,n,!1)(i,r,Ph(n),void 0,!1,e=>{Fh(e)||(i.isStopped=!0)}),i.isStopped},Vh=(e,t,n,r)=>{let i=[];return zh(e,t,n,e=>(i.push(e),!1),r),i},Hh=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Uh=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Wh=e=>Uh.has(e.kind)||e.kind===`Apply`&&Hh.has(e.operator),Gh=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&ln(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Kh=e=>`line ${e.location.line}, column ${e.location.column}`,U=e=>{let t=e.location.range;return t?m(t):Kh(e)},qh={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Jh=(e,t)=>new y(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${U(t)}`),Yh=e=>e.kind===`Number`?e.text??String(e.value):U(e),Xh=(e,t)=>new y(`A non-boolean expression (${Cs(t)}) was used as the condition of an IF.\n${U(e)}`),Zh=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new y(`A non-boolean expression (${Cs(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Yh(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new y(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Cs(n)}.\n${U({...e,location:{...e.location,range:{...r,end:i}}})}`)},Qh=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${P(R(n))}\n${U(e)}`,r=e=>`Attempted to apply function:\n${P(R(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!un(i))throw new y(`Attempted to select field "${t}" from a non-record value ${P(R(i))}\n${U(e)}`);let a=or(i);if(a===`tuple`)throw na(t);return ca(i.kind===`LazyFunction`?L(i):i,t,a===`record`?n:r)}},$h=e=>e===`1.7.4`?(t,n)=>$i(t,n,e):void 0,eg=e=>t=>{if(!un(t))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${Cs(t)})\n${U(e)}`);return ua(t)},tg=(e,t)=>(n,r)=>{if(!cn(n)||Un(n))throw new y(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${U(e)}`);return t.evaluateBinary?t.evaluateBinary(n,r):t.evaluate([n,r])},ng=e=>v(new y(`TLC can't handle real numbers.\n${e.text}`),S.configParseError),rg=e=>v(new y(`TLC can't handle a number this big.\n${e.text??e.value}`),S.error),ig=(e,t)=>new u(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${U(t)}`,e),ag=(e,t)=>e instanceof u&&t!==`1.7.4`?new y(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,og=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},sg=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),cg=(e,t,n)=>{if(t.kind===`Name`)return sg(e,t.name,n);let r=Bi(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new y(`Argument mismatch in operator application.${e?m(e):``}`)}return t.names.reduce((e,t,n)=>sg(e,t,r[n]),e)},lg=(e,t)=>{if(un(e))return e;throw new y(`A non-function (${Cs(e)}) was applied as a function.\n${U(t)}`)},ug=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},dg=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),fg=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Expected ${t} to be a boolean but found ${R(e)}`);return e},pg=(e,t,n)=>{if(typeof e!=`boolean`)throw new y(`Attempted to evaluate an expression of form P => Q when ${n} was\n${Cs(e)}.\n${U(t)}`);return e},mg=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Attempted to apply the operator ~ to a non-boolean\n(${Cs(e)})\n${U(t)}`);return!e},hg=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new y(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${U(n)}`);return e===t},gg=(e,t)=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${Yh(t)}`);return e},_g=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),vg=(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.`},yg=(e,t,n)=>{if(!cn(e)||Un(e)){let r=R(e),i=n===`1.7.4`?void 0:vg(e,r);throw new y(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Yh(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Yh(t)}\n${i}`)}},bg=(e,t,n)=>(yg(e,t,n),typeof e==`object`&&e.kind===`Interval`?ai(e):yi(e)??Ti(e)),xg=(e,t,n)=>n===`1.7.4`?(yg(e,t,n),yi(e)??Di(e)):bg(e,t,n),Sg=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Fi(e),e},Cg=(e,t,n)=>Sg(e)??xg(e,t,n),wg=(e,t,n)=>Sg(e)??bg(e,t,n),Tg=(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},Eg=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),Dg=(e,t)=>Eg(e,e=>Cg(W(e,t),e,t.environment.runtime.version)),Og=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Tg(t[n],t=>i(n-1,cg(a,e[n].pattern,t)));return i(e.length-1,n)},kg=(e,t,n)=>Og(e,Dg(e,t),t.scope,n),Ag=(e,t)=>{let n=Eg(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},jg=(e,t,n)=>{if(e.length===1)return cg(t,e[0].pattern,n);let r=Bi(n)??[];return e.reduce((e,t,n)=>cg(e,t.pattern,r[n]),t)},Mg=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Ng=e=>Object.assign(e.value,{lambda:e}),Pg=e=>Mg(e)?e.lambda:void 0,Fg=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:li(i),o=(e,n,i)=>`In applying the function\n${P(R(r))},\nthe ${e} is:\n${P(R(n))}${i}.\n${U(t.function)}`,s=e.bounds;if(s.length===1){if(!Gi(a,r.domain))throw new y(o(`first argument`,a,`which is not in its domain`));return jg(s,e.scope,a)}let c=Bi(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0)throw new y(`Attempted to apply a function to an argument not in its domain.\n${U(t.function)}`);let u=()=>new y(`In applying the function\n${P(R(r))},\nthe argument list is:\n${P(R(a))}\nwhich does not match its formal parameter.\n`);if(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!Gi(n,l[t]))throw new y(o(r,n,`${e.pattern.kind===`Name`?``:`
1782
+ `}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Bi(n)?.length!==e.pattern.names.length)throw new y(o(r,n,`which does not match its formal parameter`))}),c.length>s.length)throw u();return jg(s,e.scope,a)},Ig=(e,t)=>{let n=t.location.range;if(n)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:m(n)}},Lg=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Rg=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},zg=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),Bg=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Vg=(e,t)=>{let n=Ag(e.bounds,t),r=Rg(n,(n,r)=>W(e.body,dg(t,jg(e.bounds,sg(void 0,e.name,r),n))),Lg(Ig(e.bounds,e.body),e.bounds,n),zg(e.bounds));Ng({value:r,bounds:e.bounds,body:e.body,scope:sg(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=Vg(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?sr(i):i},Hg=(e,t)=>{if(typeof t!=`object`||or(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!ln(t.domain))return t;try{let e=L(t);return rr(e.domain,e.range)}catch(e){if(e instanceof y)return t;throw e}},Ug=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new y(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>Vg(e,t):O_(Bg(e),t):O_(e.body,t),Wg=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=Ug(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(dg(e,void 0)):e=>a[i]??r(dg(e,void 0));return t.definitionEvaluators.set(e,o),o},Gg=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},Kg=(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)||!dd(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>Hg(e,Ug(e,t)(i)));Vr(n),t.startupValues[r]=n}catch(e){if(!(e instanceof y)&&!C(e))throw e}}),qg=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&mr(e[n],t))}catch(e){if(e instanceof y)return!1;throw e}},Jg=(e,t)=>{let n=e.cache;if(n!==void 0&&qg(t.state,e.state)&&qg(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?Ho(r,i,()=>W(e.expression,dg(t,e.scope))):W(e.expression,dg(t,e.scope));return(!e.isStreamed||ki(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},Yg=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),Xg=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Xg(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Yg(r):t.builtins.get(e)},Zg=(e,t)=>N(e)?Qg(e.operator,t):Xg(e.operator,t.environment)??Qg(e.operator,t),Qg=(e,t)=>{let n=og(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Xg(e,t.environment)},$g=e=>e.kind===`Closure`?e.params.length:e.arity,e_=(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:Qg(n,t);if(!r)throw new y(`Expected an operator argument at ${Kh(e)}`);return r},t_=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>sg(e,n.name,t[r]),e.scope);return W(e.body,dg(n,r))},n_=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:$g(e),call:n=>t_(e,n,t)},r_=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Qg(e.name,t);return n!==void 0&&$g(n)>0},i_=(e,t)=>e.map(e=>r_(e,t)?n_(e_(e,t),t):W(e,t)),a_=(e,t)=>new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),o_=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),s_=(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 s_(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([])}},c_=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&mn(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=o_(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=N(e)?void 0:s_(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=og(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:o_(e,t)}}return t=>o_(e,t)},l_=(e,t,n,r)=>{if(t.length!==e.params.length)throw a_(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:e_(t[a],n)}:(r?.[a]??c_(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},u_=(e,t,n,r)=>e.kind===`Closure`?W(e.body,dg(n,l_(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(j_(t,n),n):e.evaluate(i_(t,n),n),d_=/* @__PURE__ */ new WeakMap,f_=e=>{let t=d_.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return d_.set(e,n),n},p_=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:f_(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},m_=(e,t,n)=>{let r=og(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Jg(r,n);if(r?.kind===`Operator`){if($g(r.operator)===0)return t_(r.operator,[],n);throw new y(`Operator ${e} is used without arguments`)}let i=s_(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw ig(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Wg(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new y(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${U(t)}`)},h_=(e,t)=>({impure:new Set(e.filter(e=>md(e,t))),streamed:new Set(e.filter(e=>md(e,t,`streamed`)))}),g_=e=>[...e.facts.ids.keys()].some(t=>md(t,e)),__=e=>[...e.facts.ids.keys()].some(t=>md(t,e,`repeated`)),v_=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,y_=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),b_=e=>t=>{let n=e(t);return mr(n,e(y_(t)))},x_=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Hi.sets,o=Hi.callStack,c=a??[],l=c.length;Hi.sets=c,Hi.callStack=r;try{let a=t(i),o=v_(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Wh(e)&&r.sources.set(o,e),o}catch(t){t instanceof s&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Gh(e,r.values),a=i&&!pt(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!un(a)?void 0:a;throw S_(r,[o,...c.slice(l).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),c.length=l,Hi.sets=a,Hi.callStack=o}},S_=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof y){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},C_=(e,t,n)=>{if(!(n instanceof y))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},w_=e=>({...e,coverage:void 0,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),T_=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},E_=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=Bo(n,i,e);Vo(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},D_=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=tv(e,t),i=t.callStack,a=i&&Al.get(e),o=i?x_(e,r,t,i):r,s=i&&a?T_(e,a,o,i):o,c=t.coverage,l=c?E_(e,s,c):s;return t.evaluators.set(e,l),l},O_=(e,t)=>{if(t.callStack||t.coverage)return D_(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=$s(e,t)??D_(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>O_(e,t.environment)(t),k_=(e,t)=>{let n=e.name,r=N(e)?void 0:s_(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw ig(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=Wg(e,t))(r)}return t=>m_(n,e,t)},A_=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||N(e))return!0;let n=Xg(e.name,t);return n===void 0||$g(n)===0},j_=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),M_=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(j_(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&A_(t[0],n)){let e=D_(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&A_(t[0],n)&&A_(t[1],n);if(i&&a){let e=D_(t[0],n),r=D_(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(i_(t,n),n)},N_=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw a_(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:c_(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:e_(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},P_=(e,t,n)=>{let r=N_(e,t,n),i;return t=>(i??=O_(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},F_=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=D_(n[0],t),i=D_(n[1],t);return t=>!pg(r(t),e,`P`)||pg(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=D_(n[0],t);return t=>mg(r(t),e)}if(e.operator===`<=>`){let r=D_(n[0],t),i=D_(n[1],t);return t=>hg(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw Jh(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=N(e)?void 0:Xg(e.operator,t);if(r?.kind===`Closure`)return P_(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=D_(n[0],t),i=eg(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!kl.has(e)&&!vd(n[0],t);return e=>r.evaluate(j_(n,e),i&&e.scope===void 0?void 0:e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=D_(n[0],t),a=D_(n[1],t),o=tg(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return M_(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new y(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let i=n.map(e=>c_(e,t));return r=>{let a=Qg(e.operator,r);if(a)return u_(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new y(`${e.operator} is a function; apply it with brackets`):new y(`Unknown operator ${e.operator} at ${Kh(e)}`)}},I_=(e,t)=>{let n=e.kind===`Forall`,r=D_(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=D_(i.set,t);return s=>Tg(Cg(o(s),i.set,t.runtime.version),t=>gg(r(dg(s,sg(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=Eg(a,e=>Cg(D_(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?gg(r(dg(o,a)),e)!==n:Tg(s[t],e=>c(t-1,sg(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>kg(a,t,i=>gg(r(dg(t,i)),e)!==n)?!n:n},L_=(e,t)=>{if(e.kind===`Tuple`)return li(e.names.map(e=>{let n=og(t,e);return n?.kind===`Value`&&n.value}));let n=og(t,e.name);return n?.kind===`Value`?n.value:void 0},R_=/* @__PURE__ */ new WeakSet,z_=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&R_.add(e)},B_=/* @__PURE__ */ new WeakMap,V_=e=>{if(B_.has(e))return B_.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=mt(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),pt(e).every(n)},r=n(e)?[...t]:void 0;return B_.set(e,r),r},H_=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=og(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),U_=e=>R_.has(e),W_=(e,t)=>{let n=U_(e),r=D_(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(dg(t,sg(t.scope,n,e)));if(on(e))return Fi(e),sn(e,i),d(e,t);let o=si(e),s=rr(o,o.map(i));return ln(e)?s:(s.lambdaDomain=e,sr(s))}let n=[],s=Eg(i,e=>wg(W(e,t),e,t.environment.runtime.version));return Og(i,s,t.scope,e=>{let o=i.length===1?L_(a.pattern,e)??!1:li(i.map(t=>L_(t.pattern,e)??!1));return n.push([o,r(dg(t,e))]),!1}),Qr(n)},c=Ig(i,e.body),l=zg(i),u=V_(e.body),d=(t,n)=>{let a=H_(n.scope,u),o=dg(n,a),s=Ng({value:Rg(t,e=>r(dg(o,jg(i,a,e))),Lg(c,i,t),l),bounds:i,body:e.body,scope:a});return i.length===1?sr(s):s},f=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!F(t))return d(t,r);if(!(i.length===1?ln(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(ln))){if(f)return d(t,r);try{return s(t,r)}catch(e){if(!(e instanceof y))throw e;return d(t,r)}}if(!f)return s(t,r);try{return s(t,r)}catch(t){throw C_(f,e,t),t}},createLazy:d}},G_=(e,t)=>{let n=W_(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=D_(r[0].set,t);return t=>n(e(t),t)}return e=>n(Ag(r,e),e)},K_=(e,t)=>{let n=R_.has(e);n&&z_(e.function);let r=D_(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=>D_(e,t))}),value:D_(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):li(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(dg(i,sg(i.scope,`@`,e))):da(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(xt.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${U(e.function)}`)}return n}},q_=(e,t)=>{let n=D_(e.predicate,t),r=e.bound.pattern,i=e.predicate.location.range,a=i&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:m(i)},o=Yh(e.predicate),s=t.coverage,c=(e,t,n)=>{if(!s||e===-1)return n();t||s.secondary[e]++;let r=Ho(s,t?-1:e,n);return!t&&r===!0&&s.secondary[e]++,r},l=(t,n,i,s)=>({kind:`FilteredSet`,base:t,test:(e,t)=>{if(r.kind===`Tuple`&&Bi(e)?.length!==r.names.length)throw new y(`Attempted to check if the value:\n${P(R(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=c(s,t,()=>i(dg(n,cg(n.scope,r,e))));if(typeof a!=`boolean`)throw new y(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${o} yielded non-Boolean value.`);return a},source:a,rebind:r=>l(t,{...n,environment:r},D_(e.predicate,r),-1)});return(e,t,r=-1)=>l(e,t,n,r)},J_=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${Cs(e)}.\n${Yh(t.predicate)}`);return e},Y_=(e,t,n,r)=>{if(!cn(e)||Un(e))throw new y(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${U(t)}`);return Hr(e),wg(e,n,r)},X_=e=>new y(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${U(e)}`),Z_=(e,t)=>{if(e.kind===`SetFilter`){let n=D_(e.predicate,t),r=D_(e.bound.set,t),i=q_(e,t),a=e.bound.pattern,o=t.coverage;return t=>{let s=r(t);if(!ln(s))return i(s,t,o?.current);let c=[],l=r=>{let i=n(dg(t,cg(t.scope,a,r)));J_(i,e)&&an(c,r)},u=s.kind===`Interval`?s:I(s).elements;return sn(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),nr(c)}}if(e.kind===`SetMap`){let n=D_(e.expression,t);return t=>{let r=[];return kg(e.bounds,t,e=>(an(r,n(dg(t,e))),!1)),qr(r)}}let n=e.set;if(!n)return()=>{throw new y(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`)};let r=D_(e.body,t),i=D_(n,t);return t=>{let a=Y_(i(t),e,n,t.environment.runtime.version),o,s=e.pattern;if(Tg(a,n=>{if(s.kind===`Tuple`&&Bi(n)?.length!==s.names.length)throw new y(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${U(e)}`);let i=cg(t.scope,s,n);return gg(r(dg(t,i)),e)?(o=L_(s,i),!0):!1}),o===void 0)throw X_(e);return o}},Q_=e=>[...e].sort((e,t)=>Xn(e.name,t.name)),$_=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),ev=(e,t)=>{let n=Q_(e),r=$_(n),i=n.map(e=>D_(e.value,t));if(r)return e=>ui(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>bn(a,i.map(t=>t(e)),o):e=>di(a,i.map(t=>t(e)))},tv=(e,t)=>{let n=e=>D_(e,t);switch(e.kind){case`Number`:{let t=e.value;return mn(t)?()=>t:()=>{throw rg(e)}}case`Decimal`:return()=>{throw ng(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return k_(e,t);case`Apply`:return F_(e,t);case`Bracket`:return()=>{throw new y(`A bracket without a function or subscript is not an expression at ${Kh(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new y(`An operator cannot be used as a value at ${Kh(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 Zh(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 Zh(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return e=>t(y_(e))}case`Unchanged`:return b_(n(e.expression));case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Xh(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new y(`A non-boolean expression (${Cs(t)}) was used as a condition of a CASE. ${Yh(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new y(`Attempted to evaluate a CASE with no conditions true.\n${U(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(dg(n,p_(e.definitions,n)))}case`Forall`:case`Exists`:return I_(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?Jh(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new y(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${U(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Z_(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>qr(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>li(t.map(t=>t(e)))}case`FunctionConstruction`:return G_(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 ev(e.fields,t);case`RecordSet`:{let t=Q_(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 K_(e,t);case`ExceptAt`:return t=>{let n=og(t.scope,`@`);if(n?.kind!==`Value`)throw new y(`@ appears outside an EXCEPT at ${Kh(e)}`);return n.value};case`FunctionApplication`:{z_(e.function);let r=n(e.function),i=t=>lg(r(ug(t)),e),a=e.args.map(n),o=$h(t.runtime.version);if(a.length===1){let e=a[0];return t=>ca(i(t),e(t),o)}return e=>ca(i(e),li(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Qh(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=b_(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new y(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${U(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>Ih(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new y(`The subexpression reference at ${Kh(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Jh(qh[e.kind],e)}}},nv=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},rv=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Sa(e[t]),16777619),r=Math.imul(r^Oa(e[t]),1540483477);t[0]=nv(n)||1,t[1]=nv(r)},iv=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},av=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),ov=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=pa(t,Sa(e[n]));return t&1073741823},sv=(e,t)=>{for(let n=0;n<t.length;n++)if(!gr(e[n],t[n]))return!1;return!0},cv=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,lv=(e,t,n)=>{let r=e.slots.length-1;for(let i=cv(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&sv(e.states[r-1],n))return r-1}},uv=(e,t,n)=>{let r=e.slots.length-1,i=cv(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},dv=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&uv(e,t[n],t[n+1])}uv(e,t,n+1)},fv=(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}},pv=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),mv=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return fv(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},hv=e=>Atomics.load(e.used,0)*2>=e.slots.length,gv=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&fv(t,n);return{slots:t,used:e.used}},_v={kind:`Boolean`,value:!0},vv={kind:`Boolean`,value:!1},yv=e=>e?_v:vv,bv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,xv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Sv=(e,t)=>({kind:e,body:t}),Cv=(e,t,n)=>({kind:e,operands:[t,n]}),wv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?wv(e,t.operands).operands:[t])}),Tv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Tv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Tv(t)),0)}},Ev=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 Ev(e.body);case`And`:case`Or`:return e.operands.some(Ev)}},Dv=/* @__PURE__ */ new WeakMap;let Ov=0;const kv=e=>{let t=Dv.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${Ov++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(kv).join(`,`)})`;default:return`${e.kind}(${kv(e.body)})`}})();return Dv.set(e,n),n},Av=(e,t)=>e===t||kv(e)===kv(t),jv=(e,t)=>{let n=kv(t);return e.some(e=>e===t||kv(e)===n)},Mv=e=>e===`And`?`Or`:`And`,Nv=(e,t)=>{switch(e.kind){case`Boolean`:return t?yv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Sv(`Not`,e):e;case`Not`:return Nv(e.body,!t);case`And`:case`Or`:return wv(t?Mv(e.kind):e.kind,e.operands.map(e=>Nv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Sv(n,Nv(e.body,t))}}},Pv=e=>{switch(e.kind){case`Boolean`:return yv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return wv(Mv(e.kind),e.operands.map(Pv));case`Always`:return Sv(`Eventually`,Pv(e.body));case`Eventually`:return Sv(`Always`,Pv(e.body));default:return Sv(`Not`,e)}},Fv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Fv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return yv(t)}return n.length===0?yv(!t):n.length===1?n[0]:wv(e.kind,n)}case`Not`:{let t=Fv(e.body);return t.kind===`Boolean`?yv(!t.value):Sv(`Not`,t)}case`Always`:case`Eventually`:{let t=Fv(e.body);return Sv(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Iv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Lv=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=Lv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new y(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>wv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Lv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Iv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:wv(`Or`,t);n.push(Sv(`Always`,Sv(`Eventually`,e)))}return wv(`Or`,n)}case`Not`:return bv(e.body)?e:Lv(Pv(e.body));default:return e}},Rv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Rv(e.operands[0]):wv(e.kind,e.operands.map(Rv));case`Not`:return e.body.kind===`Not`?Rv(e.body.body):Sv(`Not`,Rv(e.body));case`Always`:case`Eventually`:case`Next`:return Sv(e.kind,Rv(e.body));default:return e}},zv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return zv(e.operands[0]);let t=Math.floor(e.operands.length/2);return Cv(e.kind,zv(wv(e.kind,e.operands.slice(0,t))),zv(wv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Sv(e.kind,zv(e.body));default:return e}},Bv=(e,t)=>{e.kind===`Eventually`&&!jv(t,e)&&t.push(e),`body`in e&&Bv(e.body,t),`operands`in e&&e.operands.forEach(e=>Bv(e,t))},Vv=e=>{let t=e.filter(xv),n=e.flatMap(e=>e.kind===`Not`&&xv(e.body)?[e.body]:[]);return!t.some(e=>jv(n,e))},Hv=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,Sv(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new y(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Uv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Sv(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Wv=(e,t,n)=>e.flatMap(e=>{let r=Uv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Gv=e=>[...new Set(e.map(kv))].sort().join(`|`),Kv=(e,t)=>{let n=new Set(t.map(Gv));return[...e.filter(e=>!n.has(Gv(e))),...t]},qv=e=>{let t=Hv(e),n=Wv(t,`Always`,`And`),r=Wv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Uv(t,`Eventually`,`Or`);if(n&&!(jv(e,n.first)||jv(e,n.second)))return Kv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(jv(e,t.first)||jv(e,t.second))&&!jv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Vv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Uv(t[e],`Always`,`And`);n&&(jv(t,n.first)||t.push(n.first),jv(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)jv(t,e.first)&&jv(t,e.second)&&!jv(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!Vv(t)?[]:i(t)};return a(e)},Jv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Tv(e)<=1)}),Yv=e=>{let t=qv([e]).map(Jv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Gv(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 qv(n)){let n=Gv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Jv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Xv=(e,t)=>!jv(e,t)||jv(e,t.body),Zv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&Tv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Iv(e);if(n){let e=Tv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Ev(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Qv=(e,t)=>{let n=e.findIndex(e=>Av(e,t));return n===-1?(e.push(t),e.length-1):n},$v=e=>{let t=Lv(Fv(Nv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Rv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Zv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:wv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Av(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&zv(e.formula),n=[];t&&Bv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Qv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Qv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Qv(i,e))}));return{tableau:t&&Yv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},ey=()=>v(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),S.livenessEvaluationFailure),ty=/* @__PURE__ */ new Set([`~>`,`-+->`]),ny=/* @__PURE__ */ new WeakSet,ry=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),iy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),ay=(e,t)=>new y(`TLC cannot handle the temporal formula ${U(e)}${t===void 0?``:`:\n${t}`}`),oy=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=oy(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=og(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=_g(e,n);if(t)return hd(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:N(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return Rl(e,(e,o)=>(a=Math.max(a,oy(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(ty.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=N(e)?void 0:Xg(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,l_(o,e.args,iy(n,t)))}default:return l(e)}},sy=(e,t)=>{try{return Dg(e,t)}catch(e){if(!(e instanceof y))throw e;if(!Mt(e))return;throw v(new y(`${p}${e.message}`),S.error)}},cy=(e,t,n,r,i={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let a=(e,t,a=i.name,o=i.expanding,s)=>cy(e,t,n,r,{name:a,path:s?.kind===`Operator`&&s.params.length===0?[...i.path,s.name]:i.path,expanding:o,isSubstituted:i.isSubstituted||s!==void 0&&n.substitutedDefinitions.has(s)});if(e.kind===`And`)return e.operands.flatMap(e=>a(e,t,U(e)));if(e.kind===`Label`)return a(e.body,t);if(e.kind===`Let`)return a(e.body,ly(e,t,n));if(e.kind===`Identifier`){let r=N(e)?og(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return a(r.expression,r.scope,ny.has(r)?e.name:i.name);let o=n.constants.has(e.name)?void 0:_g(e.name,n);if(!r&&o?.kind===`Operator`&&o.params.length===0&&(hd(o,n)>0||Gg(o,n)===void 0)){if(i.expanding.has(o))throw h();return a(o.body,void 0,!i.isSubstituted&&n.instanceNames.get(e.name)||o.name,/* @__PURE__ */ new Set([...i.expanding,o]),o)}}let o=iy(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||oy(e,t,n)===3)){let t=Zg(e,o),r=N(e)?void 0:_g(e.operator,n),s=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!i.isSubstituted||s))return a(t.body,l_(t,e.args,o),i.isSubstituted&&r?r.name:e.operator,i.expanding,r)}let s=r&&e.kind===`Forall`&&e.bounds.every(e=>oy(e.set,t,n)===0),c=s?sy(e.bounds,o):void 0;if(s&&c){let n=[];if(Og(e.bounds,c,t,t=>(n.push(...a(e.body,t,U(e.body))),!1)),n.length===0)throw ey();return n}return[{expression:e,scope:t,name:i.name,path:i.path}]},ly=(e,t,n)=>{let r=p_(e.definitions,iy(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&ny.add(e.binding);return r},uy=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?oy(e,t,n):i;if(a===0){let r=W(e,iy(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${Yh(e)}`);return yv(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},a=0,o=(e,t,r,o)=>{if(a>=100)throw h();a++;let s=f(e,t);a--;let c=Tv(s),l=c===0&&oy(r,o,n)>2;return c>2||l?s:i(r,o,c)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=iy(n,t),s=N(e)||_g(i,n)===void 0?og(t,i):void 0;if(s?.kind===`Thunk`&&!s.isReleased&&ny.has(s))return l(e,()=>o(s.expression,s.scope,e,t));let c=s?.kind===`Operator`?s.operator:s?void 0:N(e)?Qg(i,a):Xg(i,n),u=e.kind===`Apply`?e.args:[],p=c?.kind===`Builtin`&&u.length===2?ry.get(c.name):void 0;if(p){let n=u.map(e=>f(e,t));return d(e,t,wv(p,n))}if(c?.kind!==`Closure`)throw ay(e);let m=!N(e)&&_g(i,n)?.isRecursive===!0;return l(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(c.body,l_(c,u,a),e,t)),m)},l=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof c||n&&!r;throw!(t instanceof y)||i?t:ay(e)}},u=(e,t)=>{let r=oy(e,t,n),a=[],o=e.kind===`Forall`;try{kg(e.bounds,iy(n,t),t=>(a.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof y)||n instanceof c)throw n;if(r<=2)return i(e,t,r);throw ay(e,o&&!Mt(n)?n.message:void 0)}return a.length===0?yv(o):d(e,t,wv(o?`And`:`Or`,a))},d=(e,t,n)=>{let r=Tv(n);return r>2?n:i(e,t,r)},f=(e,t)=>{let a=oy(e,t,n);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,ly(e,t,n));case`Apply`:{let n=e.args;if(e.operator===`~`&&!N(e))return d(e,t,Sv(`Not`,f(n[0],t)));if(e.operator===`=>`)return d(e,t,Cv(`Or`,Sv(`Not`,f(n[0],t)),f(n[1],t)));break}case`And`:case`Or`:return d(e,t,wv(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&oy(e.condition,t,n)===0){let r=W(e.condition,iy(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return d(e,t,Cv(`Or`,Cv(`And`,i,f(e.consequent,t)),Cv(`And`,Sv(`Not`,i),f(e.alternative,t))))}}if(a<=2)return i(e,t,a);switch(e.kind){case`Identifier`:return s(e,t);case`Apply`:return e.operator===`~>`?Sv(`Always`,Cv(`Or`,Sv(`Not`,f(e.args[0],t)),Sv(`Eventually`,f(e.args[1],t)))):s(e,t);case`Always`:case`Eventually`:return Sv(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Sv(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?Sv(`Always`,Sv(`Eventually`,Cv(`Or`,i,a))):Cv(`Or`,Sv(`Eventually`,Sv(`Always`,i)),Sv(`Always`,Sv(`Eventually`,a)))}default:throw ay(e)}};return f(e,t)},dy=e=>({holdsState:(t,n)=>{let r={environment:e,scope:t.scope,state:n,next:void 0},i=t.kind===`State`?W(t.expression,r):Ih(t.step,r);if(typeof i!=`boolean`)throw new y(`A state predicate was evaluated to a non-boolean value.`);return i},holdsAction:(t,n,r)=>{let i=t.scope,a=t.subscript;if(a&&Ur(W(a,{environment:e,scope:i,state:n,next:void 0}),W(a,{environment:e,scope:i,state:r,next:void 0})))return!1;let o=W(t.expression,{environment:e,scope:i,state:n,next:r});if(typeof o!=`boolean`)throw new y(`Encountered an action predicate that's not a boolean.`);return o}}),fy=(e,t,n,r,i)=>{let a=e=>fy(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a=r.holdsState(e,t);return i.set(e,a),a}case`Action`:return e.enabled&&i.get(e.enabled)===!1?!1:n!==void 0&&r.holdsAction(e,t,n);case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return fy(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new y(`TLC cannot evaluate a temporal formula in a single step`)}},py=(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)=>py(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 fy(e,t[r],t[a(r)],dy(i),/* @__PURE__ */ new Map)}},my=`UnnamedAction`,hy={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},gy=e=>{let t=e.range??hy;return ui([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},_y=(e,t)=>{let n=[[`name`,e.name],[`location`,gy(e.location)]];return e.parameters.length>0&&n.push([`context`,ui(e.parameters)],[`parameters`,li(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),ui(n)},vy=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),yy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),by=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,xy=e=>e.kind===`Apply`?e.args:[],Sy=(e,t,n)=>{let r=by(e);if(r===void 0)return;if(N(e)){let e=og(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=Xg(r,n);return i?.kind===`Closure`?i:void 0},Cy=(e,t)=>{try{return W(e,yy(t,void 0)),!0}catch(e){if(e instanceof E)return!1;throw e}},wy=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&dd(e,t)&&Cy(e.body,t),Ty=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&wy(e,t),Ey=(e,t)=>{let n=_g(e.name,t);return n?.body===e.body&&Ty(n,t)},Dy=(e,t)=>{if(e.kind!==`Identifier`||!N(e))return;let n=og(t,e.name);return n?.kind===`Thunk`?n:void 0},Oy=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:p_(e.definitions,yy(n,t))};let r=Dy(e,t);return r&&{expression:r.expression,scope:r.scope}},ky=(e,t,n,r)=>t.kind===`Apply`?l_(e,t.args,yy(r,n)):e.scope,Ay=(e,t)=>(e?.params??[]).flatMap(e=>{let n=og(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),jy=(e,t)=>{try{return e()}catch(e){if(e instanceof E)return t();throw e}},My=(e,t,n,r,i)=>{let a=xy(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>oy(e,n,i)!==0)?o():jy(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,yy(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},Ny=(e,t,n,r,a)=>{let o=()=>({name:n?.name??my,location:e.location,parameters:Ay(n,t),expression:e,scope:t});if(Tm.has(e.kind))throw v(new y(`${i}The next state relation is not a boolean expression.\n${Yh(e)}`),S.error);switch(e.kind){case`Let`:return Ny(e.body,p_(e.definitions,yy(r,t)),n,r,a);case`Label`:return Ny(e.body,t,n,r,a);case`Or`:return e.operands.flatMap(e=>Ny(e,t,n,r,a));case`Exists`:return jy(()=>{let i=[];return kg(e.bounds,yy(r,t),t=>(i.push(...Ny(e.body,t,n,r,a)),!1)),i.length===0?[o()]:i},()=>[o()])}let s=N(e)?void 0:a.get(by(e)??``),c=Sy(e,t,r);if(s)return My(s,e,t,c,r);if(!c)return[o()];let l=xy(e),u=N(e)?c.name:r.instanceNames.get(by(e)??``)??c.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return Ey(c,r)||l.some(e=>oy(e,t,r)!==0)?d():jy(()=>{let e=l.reduce((e,n,i)=>({name:c.params[i].name,binding:{kind:`Value`,value:W(n,yy(r,t))},parent:e}),c.scope);return Ny(c.body,e,{...c,name:u},r,a)},d)},Py=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>Py(e,t,n,r,i,o),s=(e,t,n)=>vy(e,jl(t,a),n),c=Oy(e,t,n);if(c){o(c.expression,c.scope);return}let l=Sy(e,t,n);if(l&&Ey(l,n))return;let u=l?[...a,...Al.get(l.body)??[]]:a;if(l&&l.params.length===0){if(oy(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,l_(l,e.args,yy(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(my,e,t));return}let d=oy(e,t,n);d<=1?r.inits.push(s(my,e,t)):d===3&&r.temporals.push(s(my,e,t))},Fy=(e,t,n,r,i)=>{let a=(t,n)=>Fy(e,t,n,r,i),o=Oy(t,n,r);if(o){a(o.expression,o.scope);return}let s=Sy(t,n,r);if(s&&Ey(s,r))return;if(s&&s.params.length===xy(t).length){a(s.body,ky(s,t,n,r));return}if(t.kind===`Forall`&&jy(()=>(kg(t.bounds,yy(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(vy(e,a)):oy(a,n,r)<2?i.invariants.push(vy(e,a)):i.impliedTemporals.push(vy(e,t));return}let c=oy(t,n,r);c<=1?i.impliedInits.push(vy(e,t)):c===3&&i.impliedTemporals.push(vy(e,t))},Iy=(e,t)=>{let n=_g(e,t);return n?.kind===`Operator`&&!Ty(n,t)?n:void 0},Ly=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:Iy(e.specification,t);a&&(Py(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:my,location:e.frames[0].location,parameters:[],expression:jl(e.expression,e.frames),scope:e.scope}]:Ny(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Xg(e.init,t);o?.kind===`Closure`&&r.inits.push(vy(e.init??``,o.body));let s=e.next===void 0?void 0:Xg(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Ny(s.body,s.scope,s,t,n)),r},Ry=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=Oy(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&N(e)?og(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!N(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=Sy(e,t,n);if(!s||s.params.length!==xy(e).length)return!0;let c=_g(s.name,n);return c?.body===s.body&&wy(c,n)?!0:i(s.body,ky(s,e,t,n))};return i(e,t)?r:void 0},zy=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>R(e[1])).join(`,`)})`,By=(e,t,n=!1)=>`${e.name===my?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:zy(e)} ${m(e.location.range??hy)}`,Vy=e=>`${e.name}${zy(e)}`,Hy=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=Iy(e,n);t&&i.invariants.push(vy(e,t.body))}),t.properties.forEach(e=>{let t=Iy(e,n);t&&Fy(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>Kr(e.map(e=>{let n=a&&t&&is(a,t,e.expression);return _y(e,n&&ui(n))})),s=e=>Kr(e.flatMap(e=>{let t=Iy(e,n);return t?[ui([[`name`,t.name],[`location`,gy(t.location)]])]:[]}));return ui([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,Kr(n.variables.map((e,t)=>ui([[`name`,e],[`location`,gy(r[t])],...a?[[`coverage`,ui([[`distinct`,Ko(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},Uy=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return Uy(e.body);case`And`:case`Or`:return e.operands.some(Uy);default:return!1}},Wy=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,Gy=e=>e.promises.some(e=>Uy(e.body))||e.models.some(e=>!Wy(e)),Ky=(e,t)=>e.every((e,n)=>gr(e,t[n])),qy=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Jy=e=>({data:e(1024),length:0,create:e}),Yy=(e,t,n,r=0,i=n.length-r)=>{let a=t+i;if(a>e.data.length){let t=e.create(Math.max(2*e.data.length,a));t.set(e.data),e.data=t}for(let a=0;a<i;a++)e.data[t+a]=n[r+a];e.length=Math.max(e.length,a)},Xy=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},Zy=e=>new Int32Array(e).fill(-1),Qy=(e,t)=>(e.edgeStarts[t]??-1)!==-1,$y=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},eb=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,tb=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),nb=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},rb=2**53-1,ib=(e,t,n)=>{let r=t.map(e=>uy(e.expression,e.scope,n)),i=e.map(e=>Sv(`Not`,uy(e.expression,e.scope,n))),a=i.length===1?i[0]:wv(`Or`,i);return{formula:r.length===0?a:wv(`And`,[...r,a]),negations:i}},ab=e=>{switch(e.kind){case`State`:return[e];case`Enabled`:return[{expression:e.step,scope:e.scope}];case`Action`:return[e.expression,e.subscript].flatMap(t=>t?[{expression:t,scope:e.scope}]:[])}},ob=(e,t)=>{switch(e.kind){case`Boolean`:return;case`State`:case`Enabled`:case`Action`:t.add(e);return;case`And`:case`Or`:e.operands.forEach(e=>ob(e,t));return;default:ob(e.body,t)}},sb=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>ob(e,t));return[...t]},cb=e=>sb(e).flatMap(e=>ab(e).map(e=>e.expression)),lb=(e,t,n,r)=>{if(e.length===0)return;let i=ib(e,t,n),a=/* @__PURE__ */ new Set;ob(i.formula,a);let o=[...a].flatMap(ab),s=o.every(e=>e.scope===void 0)?!pd(o.map(e=>e.expression),n,`repeated`):!__(n),c={environment:n,atoms:dy(n)},l=$v(i.formula),u=ub(l,{atoms:{holdsState:(e,t)=>c.atoms.holdsState(e,t),holdsAction:(e,t,n)=>c.atoms.holdsAction(e,t,n)},isShared:s,isSame:Ky,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},r,n.runtime.version!==`1.7.4`),d=(e,t)=>{if(e===void 0)return t();c.atoms=dy(e);try{return t()}finally{c.atoms=dy(n)}};return{branches:u.branches,solutions:l,addInitialState:(e,t,n)=>d(n,()=>u.addInitialState(e,t)),addState:(e,t,n,r)=>d(r,()=>u.addState(e,t,n)),storeState:u.storeState,getStateCounts:u.getStateCounts,findViolation:u.findViolation,getViolatedProperties:(t,r)=>[...new Set(e.filter((e,a)=>!py(i.negations[a].body,t,r,0,n)).map(e=>e.name))]}},ub=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map,a=1,o=t.isShared,s=t.atoms,c=t.evaluateFrom,l=/* @__PURE__ */ new Map,u=[],d=e=>{let t=l.get(e)??l.size;return l.set(e,t),u[t]=e,t},f=e=>{if(e.kind===`State`||e.kind===`Enabled`)return[d(e)*2+1];if(e.kind===`Not`){let t=e.body;return t.kind===`State`||t.kind===`Enabled`?[d(t)*2]:void 0}if(e.kind!==`And`)return;let t=e.operands.map(f);return t.every(e=>e!==void 0)?t.flat():void 0},p=e=>new Int8Array(e*l.size).fill(-1),m=e=>new Int8Array(e*i.size).fill(-1),h=(e,t,n,r,i)=>o?e(t,n,r,i):e(t,p(1),0,i),g=e=>{switch(e.kind){case`Boolean`:{let t=e.value;return()=>t}case`State`:case`Enabled`:{let t=d(e);return(n,r,i)=>(r[i+t]===-1&&(r[i+t]=+!!s.holdsState(e,n)),r[i+t]===1)}case`Action`:{let t=e.enabled&&d(e.enabled);return(n,r,i,a)=>(t===void 0||r[i+t]!==0)&&a!==void 0&&s.holdsAction(e,n,a)}case`Not`:{let t=g(e.body);return(e,n,r,i)=>!t(e,n,r,i)}case`And`:{let t=e.operands.map(g);return(e,n,r,i)=>t.every(t=>t(e,n,r,i))}case`Or`:{let t=e.operands.map(g);return(e,n,r,i)=>t.some(t=>t(e,n,r,i))}case`Next`:{let t=g(e.body);return(e,n,r,i)=>t(i??e,p(1),0,void 0)}case`Always`:case`Eventually`:return()=>{throw new y(`TLC cannot evaluate a temporal formula in a single step`)}}},_=e.map(e=>({solution:e,checks:{states:e.stateChecks.map(g),actions:e.actionChecks.map(g),nodes:e.tableau?.nodes.map(e=>{let t=o?f({kind:`And`,operands:e.statePredicates}):void 0;return t?Int32Array.from(t):e.statePredicates.map(g)})??[]},actionIds:Int32Array.from(e.actionChecks,e=>{let t=kv(e),n=i.get(t)??i.size;return i.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:Jy(e=>new Int32Array(e)),edgeActions:Jy(e=>new Uint8Array(e)),stateResults:Jy(e=>new Uint8Array(e)),initial:[],firstNodes:Jy(Zy),lastNodes:Jy(Zy),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],stateCount:0,errorNode:void 0})),v=(e,t,n,r,i)=>c(t,()=>{let t=e.checks.states,a=new Uint8Array(t.length);return t.forEach((e,t)=>{a[t]=+!!h(e,n,r,i)}),a}),b=(e,t,n,r,i,a,s,l,u,d)=>c(t,()=>{let t=e.checks.actions;for(let c=0;c<t.length;c++){if(!o){u[d+c]=+!!h(t[c],n,r,i,a);continue}let f=l+e.actionIds[c];s[f]===-1&&(s[f]=+!!t[c](n,r,i,a)),u[d+c]=s[f]}}),ee=(e,t,n,r,i)=>{let a=e.checks.nodes[t];if(!(a instanceof Int32Array))return a.every(e=>h(e,n,r,i));for(let e=0;e<a.length;e++){let t=a[e],o=i+(t>>1);if(r[o]===-1&&(r[o]=+!!s.holdsState(u[t>>1],n)),r[o]!==(t&1))return!1}return!0},x=(e,t,n,r,i,a)=>c(n,()=>ee(e,t,r,i,a)),S=(e,t)=>{if(!r)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Xy(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},C=(e,t,n,r)=>{let i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),Xy(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],Xy(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?Yy(e.firstNodes,t,[r]):e.nextSiblings[a]=r,Yy(e.lastNodes,t,[r]),r},w=(e,t)=>t<0?e.checks.nodes.some((n,r)=>te(e,t,r)!==void 0):e.isDone[t]===!0||(e.firstNodes.data[t]??-1)!==-1,ne=(e,t,n)=>(w(e,t)||e.stateCount++,C(e,t,n,tb(e,t,n))),T=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;Yy(e.edgeTargets,o,n),i.forEach((t,n)=>Yy(e.edgeActions,(o+n)*s,r,t*s,s)),Yy(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},E={slots:/* @__PURE__ */ new Int32Array},re=(e,r,i)=>{let o=[...i,{index:e,state:r}],s=16*a;E.slots=E.slots.length===s?E.slots.fill(0):new Int32Array(s);let c=e=>{let r=E.slots,i=o[e];for(let a=(n.getFingerprint(i)&2147483647)%r.length;;a=(a+1)%r.length){let n=r[a];if(n===0)return r[a]=e+1,!0;let s=o[n-1];if(s.index===i.index&&t.isSame(s.state,i.state))return!1}},l=0;for(let e=0;e<o.length;e++){if(l>=E.slots.length>>1){let e=E.slots;E.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}E.slots.length>s&&a++;let u=[];for(let e of E.slots)e!==0&&u.push(o[e-1]);return u},ie=(e,t,r,a,o,s,c)=>{let l=v(e,a,r,s,c),u=t.nodes[e.nodeTableaux[o]],d=e.checks.actions.length,f=[],h=[],g=new Uint8Array(d);u.successors.length>0&&b(e,a,r,s,c,r,m(1),0,g,0);for(let n of u.successors){if(!x(e,n,a,r,s,c))continue;if(S(t,n)&&e.errorNode===void 0&&e.solution.models.some(Wy)){e.errorNode=o;return}let i=te(e,a,n);if(i!==void 0&&h.includes(i))continue;let l=i??ne(e,a,n);h.push(l),f.push(0),i===void 0&&ie(e,t,r,a,l,s,c)}let _=n.getSuccessors(a,r),y=new Uint8Array((_.length+1)*d);y.set(g);let ee=m(_.length);_.forEach((n,o)=>{let l=p(1);b(e,a,r,s,c,n.state,ee,o*i.size,y,(o+1)*d);let m=e.isDone[n.index]===!0;for(let r of u.successors){if(!x(e,r,a,n.state,l,0))continue;let i=te(e,n.index,r);if(i!==void 0&&h.includes(i))continue;let s=i??ne(e,n.index,r);h.push(s),f.push(o+1),i===void 0&&m&&ie(e,t,n.state,n.index,s,l,0)}}),h.length>0&&T(e,o,h,y,f,l)},ae=(e,t,n,r,i,a,o)=>{let s=l.size,u=new Uint8Array(t.nodes.length*n.length);c(o,()=>{for(let i=0;i<t.nodes.length;i++)for(let t=0;t<n.length;t++)ee(e,i,n[t].state,r,t*s)&&(u[i*n.length+t]=1)}),w(e,o)||e.stateCount++,e.isDone[o]=!0;for(let c of nb(e,o)){let o=[],l=[];n.forEach((i,a)=>{let d=e.isDone[i.index]===!0;for(let f of t.nodes[e.nodeTableaux[c]].successors){if(u[f*n.length+a]===0)continue;let c=te(e,i.index,f);if(c!==void 0&&o.includes(c))continue;let p=c??ne(e,i.index,f);o.push(p),l.push(a),c===void 0&&d&&ie(e,t,i.state,i.index,p,r,a*s)}}),T(e,c,o,i,l,a)}return e.errorNode===void 0?void 0:ce(e,e.errorNode)},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)tb(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{Qy(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),Qy(e,i)||e.stateCount++,T(e,i,a,n,o,r)},se=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Qy(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of $y(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}Qy(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new y(`Couldn't re-create liveness trace (path) starting at: ${t}`)},ce=(e,t)=>qy(se(e,t).reverse().map(t=>e.nodeStates[t])),le=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>Qy(e,t)),c=[],l=t=>{let n=$y(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&Xv(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=rb;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=rb,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>eb(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>$y(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=ce(e,r),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g=f.length+m.length+h.length,_=r,v=e=>{l.push(_),_=e};for(;g>0;){let r=g;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&eb(e,_,t)&&(f[n]=!0,g--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_,e)&&(h[t]=!0,g--)}),!(g<=0);){let n=-1,c=-1,u=g;if($y(e,_).some((r,l)=>{if(s.has(e.nodeStates[r])){if(!o.has(r)||!a(_,l))return!1;n=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_,l,e)&&(m[t]=!0,g--)})}return g<u?(v(r),d.clear(),!0):(o.has(r)&&!d.has(r)&&(c=r),!1)}))break;if(g<r){v(n),d.clear();break}for(;c===-1;){let t=l.pop();if(t===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);_=t,c=$y(e,t).find(e=>o.has(e)&&!d.has(e))??-1}v(c),d.add(c)}}let b=p(r,_,s);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];b[b.length-1]!==n&&b.push(n)}let ee=c[c.length-1];return b[b.length-1]===ee&&b.pop(),{prefix:c.slice(0,-1),cycle:[ee,...b.reverse()],isCycleConstrained:Gy(n)}},p=(t,n,r)=>{if(n===t)return[];let i=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([i]),c=[];for(let n=i,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of $y(e,u).entries()){if(f===u||!a(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==i;)e.push(t),t=r,r=o.get(t)??-1;return e.push(i),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r=0;for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r,n.push(t,l,-42),c.push(l);let u=r++;$y(e,l).forEach((t,r)=>{Qy(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u=Math.min(u,o[t]):o[t]===-1&&s.push(t))}),n.push(u)}}};return{branches:_.length,addInitialState:(e,t)=>{let n=p(1);for(let r of _){let i=r.solution.tableau;if(!i)r.initial.push(e);else for(let a=0;a<i.initialCount;a++)x(r,a,void 0,t,n,0)&&r.initial.push(te(r,e,a)??ne(r,e,a))}},addState:(e,t,n)=>{let r=re(e,t,n),a=p(r.length),o=r.findIndex(t=>t.index===e)*l.size,s=m(r.length);for(let n of _){let c=n.checks.actions.length,l=new Uint8Array(r.length*c);r.forEach((r,u)=>b(n,e,t,a,o,r.state,s,u*i.size,l,u*c));let u=v(n,e,t,a,o),d=n.solution.tableau;if(!d){oe(n,r,l,u,e);continue}let f=ae(n,d,r,a,l,u,e);if(f)return f}},storeState:(e,t)=>{for(let n of _){let r=n.solution.tableau;if(!r)continue;let i=[];for(let t=0;t<r.nodes.length;t++){let r=te(n,e,t);r!==void 0&&i.push(r)}for(let e of i.sort((e,t)=>e-t))n.nodeStates[e]=t,C(n,t,n.nodeTableaux[e],e)}},getStateCounts:()=>_.map(e=>e.stateCount),findViolation:()=>{for(let e of _)for(let t of e.solution.models){let n=le(e,t);if(n)return n}}}},db=e=>{switch(e.kind){case`Number`:if(!mn(e.value))throw v(new x(`TLC can't handle a number this big.\n${e.value}`),S.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return $n(e.name);case`Set`:return I({kind:`MixedSet`,elements:e.elements.map(db)})}},fb=e=>{try{return db(e)}catch(e){throw!(e instanceof y)||e instanceof x||e instanceof T?e:v(new y(`${i}${e.message}`),S.error)}},pb=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>R(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new y(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&mr(t,r)})});if(t)return t[1];throw new y(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:R(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},mb=e=>new _(`In the configuration file, the identifier ${e} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),hb=(e,t)=>{let n=e=>t.root.visible.get(e)?.key??e,r=t.root.constants.map(e=>e.name),i=t.root.variables,a=e=>{let n=t.moduleSymbols.get(e.module??``)?.get(e.name);return n?.kind===`Definition`?n:void 0},o=e=>{if(e.module===void 0)return[e.name,n(e.name)];let t=a(e);return t?[t.key]:[]},s=e=>e.module===t.root.module.name?[]:o(e),c=e=>{let n=t.definitions.get(e);return n?.kind===`Operator`?n.params.length:t.root.constants.find(t=>t.name===e)?.arity??t.builtins.get(e)?.arity??0},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set,d=(e,n)=>{t.builtins.set(e,n),t.definitions.delete(e),l.delete(e),u.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=fb(e.value);Vr(t),s(e).forEach(e=>{let n=c(e);n===0?l.set(e,t):d(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let f=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=f.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new _(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(db),db(e.value)]),f.set(t,n)}),f.forEach(e=>s(e).forEach(t=>d(t,pb(e.name,c(t),e.rows))));let p=new Map(e.substitutions.flatMap(e=>o(e).map(t=>[t,n(e.target)])));[...p.keys()].forEach(e=>l.delete(e));let m=(e,a,o)=>{let s=n(a),c=t.definitions.get(s);if(!(c!==void 0||t.builtins.has(s)||l.has(s)||r.includes(a)||i.includes(a)))throw new _(`The configuration file substitutes for ${e} with the undefined identifier ${a}.`);if(c?.kind===`Operator`&&c.params.length!==o)throw new _(`The configuration file substitutes for ${e} with ${a} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(n=>{let i=n.name,a=n.target;if(!r.includes(i)&&!t.root.visible.has(i))throw new _(`In the configuration file, the identifier ${i} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===a))throw mb(a);m(i,a,t.root.constants.find(e=>e.name===i)?.arity??t.root.visible.get(i)?.arity)});let h=e.substitutions.filter(e=>e.module!==void 0);[...t.moduleSymbols.keys()].forEach(e=>{let t=h.filter(t=>t.module===e);t.forEach(e=>{let n=a(e);if(n){if(t.some(t=>t.name===e.target))throw mb(e.target);m(e.name,e.target,n.arity)}});let n=t.find(e=>!a(e));if(n)throw new _(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let g=h.find(e=>!t.moduleSymbols.has(e.module??``));if(g)throw new _(`In the configuration file, the module name ${g.module} is not a module in the specification.`);let v=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(s)),y=(e,n)=>{if(v.has(e))return{key:e,prefix:n};let r=t.copySources.get(e);return r&&y(r.source,n+r.prefix)};t.copySources.forEach((e,n)=>{let r=y(e.source,e.prefix),i=t.definitions.get(n);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=iu(n,r.key,a,a.slice(r.prefix),i.location);t.definitions.set(n,o),t.root.visible.forEach((e,r)=>{e.key===n&&r!==n&&t.definitions.set(r,o)})}),t.operatorConstants.forEach((e,t)=>l.set(t,e));let b=r.filter(e=>!l.has(e)&&!p.has(e)&&!u.has(e));if(b.length>0){let e=t.order.getDeclarationOrder(`constant`).find(e=>b.includes(e))??b[0];throw new _(`The constant parameter ${e} is not assigned a value by the configuration file.`)}return{constants:l,substitutions:p}},gb=`tlc2/value/impl/`,_b={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},vb={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},yb=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},bb=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),xb=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Sb=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??bb.get(e[3])}${`[]`.repeat(e[1].length)}`),Cb=(e,t)=>e[e[t].first].text,wb=(e,t)=>Cb(e,t).replaceAll(`/`,`.`),Tb=e=>{let t=yb(e);if(t.readUint32()!==3405691582)throw new r(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],i=t.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let r=t.readUint8(),i={tag:r,text:``,value:0,first:0,second:0};n[e]=i,r===_b.utf8?i.text=a.decode(t.readBytes(t.readUint16())):r===_b.integer?i.value=t.readInt32():r===_b.float?t.readUint32():r===_b.long||r===_b.double?(t.readBytes(8),e++):r===_b.class||r===_b.string||r===_b.methodType||r===_b.module||r===_b.package?i.first=t.readUint16():r===_b.methodHandle?(t.readUint8(),i.first=t.readUint16()):(i.first=t.readUint16(),i.second=t.readUint16())}t.readUint16();let o=wb(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let s=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,a=i.indexOf(`)`),c=Sb(i.slice(1,a)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:yb(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>wb(n,d.readUint16())):[],p=xb.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Sb(i.slice(a+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:s}},Eb=(e,t)=>{let n=e[t],r=e[n.second];return{className:Cb(e,n.first),name:e[r.first].text}},Db=(e,n,r,i)=>{let a=()=>new t(`The Java override ${r}.${e.name} computes its value, which tla-ts cannot run`),o=e.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===_b.integer)return t.value;if(t.tag===_b.string)return n[t.first].text;throw a()};for(let e=0;e<o.length;){let t=o[e],r=()=>o[e+1]<<8|o[e+2];if(t>=vb.iconstM1&&t<=vb.iconst5)s.push(t-vb.iconst0),e+=1;else if(t===vb.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===vb.sipush)s.push(r()<<16>>16),e+=3;else if(t===vb.ldc)s.push(l(o[e+1])),e+=2;else if(t===vb.ldcW)s.push(l(r())),e+=3;else if(t===vb.dup){let t=c();s.push(t,t),e+=1}else if(t===vb.getstatic){let t=Eb(n,r());if(t.className!==`${gb}BoolValue`||t.name!==`ValTrue`&&t.name!==`ValFalse`)throw a();s.push({kind:`Identifier`,name:t.name===`ValTrue`?`TRUE`:`FALSE`,location:i}),e+=3}else if(t===vb.invokestatic){let t=Eb(n,r()),o=c();if(t.className!==`${gb}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===vb.new)s.push({className:Cb(n,r()),value:void 0}),e+=3;else if(t===vb.invokespecial){let t=Eb(n,r()),o=c(),s=c();if(!(t.className===`${gb}StringValue`&&t.name===`<init>`&&typeof o==`string`&&typeof s==`object`&&`className`in s))throw a();s.value={kind:`String`,value:o,location:i},e+=3}else if(t===vb.areturn){let e=c();if(typeof e!=`object`)throw a();if(`className`in e){if(!e.value)throw a();return e.value}return e}else throw a()}throw a()},Ob=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Tb(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:Db(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)}))}},kb=j(`EOF`),Ab=j(`IDENTIFIER`),jb=j(`DEFBREAK`),Mb=(e,t)=>Array.from({length:j(t)-j(e)+1},(t,n)=>j(e)+n),Nb=new Set(Mb(`op_57`,`op_119`)),Pb=new Set(Mb(`op_1`,`op_119`)),Fb=new Set(Mb(`op_57`,`op_70`)),Ib=/* @__PURE__ */ new Set([...Mb(`ACTION`,`EXCEPT`),j(`EXTENDS`),...Mb(`IF`,`SF`),j(`STATE`),...Mb(`THEN`,`WITH`),j(`US`),...Mb(`op_112`,`op_116`)]),Lb=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),Rb=new Map([...Lb(`postfix`,160,160,!0,`[`),...Lb(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Lb(`prefix`,120,120,!1,`-.`),...Lb(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Lb(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Lb(`prefix`,40,40,!0,`\\lnot`),...Lb(`nfix`,100,130,!0,`\\times`),...Lb(`infix`,140,140,!1,`^`,`^^`),...Lb(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Lb(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Lb(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Lb(`infix`,100,110,!0,`|`,`||`,`%%`),...Lb(`infix`,100,110,!1,`%`),...Lb(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Lb(`infix`,90,140,!1,`\\wr`),...Lb(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Lb(`infix`,90,130,!1,`!!`),...Lb(`infix`,90,90,!1,`...`,`..`),...Lb(`infix`,80,80,!0,`\\intersect`,`\\union`),...Lb(`infix`,80,80,!1,`\\`),...Lb(`infix`,70,70,!1,`<:`,`:>`),...Lb(`infix`,60,60,!0,`@@`),...Lb(`infix`,50,140,!0,`\\cdot`),...Lb(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Lb(`infix`,30,30,!0,`\\land`,`\\lor`),...Lb(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Lb(`infix`,10,10,!1,`=>`)]),zb=new Map([...Rb,...tc.flatMap(e=>e.slice(1).map(t=>[t,Rb.get(e[0])]))]),Bb=zb.get(`[`),Vb={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Hb=e=>({type:`tokens`,kinds:new Set(e)}),Ub=e=>typeof e==`string`?e.startsWith(`<`)?Hb([j(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(Ub)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),Wb=e=>(...t)=>({type:e,body:G(...t)}),q=Wb(`zeroOrMore`),Gb=Wb(`oneOrMore`),J=Wb(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),Kb=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),qb=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Kb(e,n);return n},Jb=(...e)=>{let t=e.map(j);return e=>t.includes(qb(e,1).kind)},Yb=(e,t=qb(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Xb=e=>{let t=qb(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Zb=e=>Jb(`CASESEP`)(e)&&Yb(e),Qb=e=>{let t=qb(e,1);Ib.has(t.kind)&&(t.kind=Ab)},$b=(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}`,ex=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),tx=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},nx=e=>e.operatorStacks[e.operatorStacks.length-1],rx=(e,t)=>e.low>t.high,ix=(e,t)=>e.high<t.low,ax=e=>e.fix===`prefix`?e:zb.get(`${e.name}.`),ox=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Bb?ex(`FcnAppl`,[n,...r.node.heirs]):ex(`PostfixExpr`,[n,r.node]),operator:void 0})},sx=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:ex(`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:ex(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},cx=e=>{let t=nx(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 ox(t,n),cx(e);if(i.operator!==void 0){let t=ax(r.operator);return t!==void 0&&rx(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${$b(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 ${$b(e,a.node.first,a.node.last)} and expression at location ${$b(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return ix(a.operator,r.operator)?void 0:rx(a.operator,r.operator)?(sx(t,a.operator),cx(e)):`Precedence conflict between ops ${a.operator.name} in block ${$b(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=ax(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(ix(s,r.operator))return;if(!rx(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${$b(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return sx(t,s),cx(e);let c=$b(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===Vb?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},lx=e=>Y(t=>{let n=nx(t),r=tx(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:cx(t)}),ux=lx(()=>!1),dx=lx(()=>!0),fx=Y(e=>{e.lastOperator=zb.get(e.token.image)}),px=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},mx=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?px(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},hx=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Yb(e,n.first.beginColumn))return n;let t=hx(e,n);if(t!==void 0)return t}},gx=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(j),n=(e,...t)=>t.some(t=>e.kind===j(t)),r=e=>e!==void 0&&Nb.has(e.kind),i=e.token,a=Kb(e,i);i.next=void 0;let o=Kb(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===Ab&&(e=e.next)}else if(e.kind===Ab){let t=e.next;!r(t)||Fb.has(t.kind)||Pb.has(t.kind)&&t.next?.kind!==Ab||(e=t.next?.kind===j(`SUBSTITUTE`)?i:Pb.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==jb&&(e.next={kind:jb,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Kb(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},_x=e=>{let t=qb(e,1);if(t.kind===j(`LAB`)){let n=1;for(;n!==0;)if(t=Kb(e,t),t.kind===j(`LAB`)&&n++,t.kind===j(`RAB`)&&n--,t.kind===kb)return!1;return Kb(e,t).kind===j(`IN`)}if(t.kind!==Ab)return!1;for(t=Kb(e,t);t.kind===j(`COMMA`);){if(t=Kb(e,t),t.kind!==Ab)return!1;t=Kb(e,t)}return t.kind===j(`IN`)},vx=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),yx=e=>e.proofLevels.at(-1)??-1,bx=e=>{let t=qb(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Jb(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||yx(e)>=0&&vx(t)>yx(e):Jb(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},xx=(e,t)=>{let n=vx(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},Sx=e=>Y(t=>xx(t,t.token)?void 0:`${$b(t,t.token)}: ${e}`),Cx=Hb([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(j)),wx=Hb([...Cx.kinds,j(`op_76`)]),Tx=Hb(Pb),Ex=Hb(Fb),Dx=Hb([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(j)),Ox=()=>q(Z({expansion:[K(Cx,`<op_77>`)],semantic:Yb}),K(`PrefixOp`,`InfixOp`),dx),kx=()=>K(G(Z({expansion:[`OpenStart`],semantic:Yb}),`OpenExpression`,ux),G(Z({semantic:Yb}),`ExtendableExpr`)),Ax=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),jx=()=>K(G(Z({semantic:e=>Jb(`ASSUME`,`BOXASSUME`)(e)||qb(e,2).kind===j(`COLONCOLON`)&&[j(`ASSUME`),j(`BOXASSUME`)].includes(qb(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Mx=()=>[`JuncItem`,q(Z({semantic:Xb}),`JuncItem`)],Nx=e=>Y(t=>{t.expecting=e,Qb(t)}),Px=e=>Y(t=>{t.isTerminalProof=e}),Fx=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{gx(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),Ix={CompilationUnit:Q(void 0,[Y(gx),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),Nx(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,Nx(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,Nx(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(gx)),G(Z({semantic:e=>Jb(`USE`)(e)&&qb(e,2).kind!==j(`ONLY`)||Jb(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(Fx(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Fx(`Expression`,Z({expansion:[`<IDENTIFIER>`,Ex]}),`PostfixLHS`,`Expression`),Fx(`Expression`,Z({expansion:[`<IDENTIFIER>`,Tx]}),`InfixLHS`,`Expression`),Fx(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),Fx(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[wx,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,Tx,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,Ex]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,Nx(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[Cx,fx]),NonExpPrefixOp:Q(void 0,[wx,fx]),InfixOp:Q(`Infix Op`,[Tx,fx]),PostfixOp:Q(void 0,[Ex,fx]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{gx(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),jx(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),jx(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=tx(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${$b(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(gx),K(G(Z({amount:3}),Z({semantic:Jb(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:bx}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>Jb(`BY`)(e)||qb(e,2).kind===j(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>qb(e,2).kind!==j(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,Px(!0),J(`<ONLY>`)),G(`<USE>`,Px(!1),J(`<ONLY>`)),G(`<HIDE>`,Px(!1))),X("an expression, `MODULE' or `DEF'"),J(Ax(),q(`<COMMA>`,X(`MODULE or expression`),Ax(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Ax(),q(`<COMMA>`,X(`MODULE or expression`),Ax(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),Dx,Sx(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:bx}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),Dx,Sx(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:Jb(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:Jb(`INSTANCE`)}),`Instantiation`),G(Z({semantic:Jb(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:bx}),Y(e=>{let t=tx(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${$b(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),Gb(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:Jb(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(wx,Tx,Ex),Hb([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(j))],semantic:Yb}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${$b(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:Yb}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:_x}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),Gb(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=tx(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),Gb(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:_x}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>qb(e,2).kind===j(`MAPTO`)&&Ib.has(qb(e,1).kind)}),Y(e=>{qb(e,1).kind=Ab}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=ex(`FcnAppl`,t.heirs),e.lastOperator=Bb})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,Gb(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(Qb),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===j(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>Zb(e)&&qb(e,2).kind!==j(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:Zb}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[Gb(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=qb(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...Mx()),G(Z({expansion:[`<AND>`]}),...Mx())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=hx(t,e.heirs[1]);return n&&`Item at ${$b(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${$b(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),Ox(),kx()],(e,t)=>{let n=nx(t);n.push({node:e.heirs[0],operator:Vb});let r=cx(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),ux,q(K(G(Z({expansion:[`PostfixOp`],semantic:Yb}),`PostfixOp`,dx),G(Z({expansion:[`<DOT>`],semantic:Yb}),`<DOT>`,Y(Qb),Z({semantic:Yb}),`Identifier`,Y(e=>{let t=nx(e);t[t.length-1].operator!==void 0&&ox(t,t.length),t[t.length-1]={node:ex(`RecordComponent`,[t[t.length-1].node,tx(e,2),tx(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:Yb}),X(`function argument`),`SBracketCases`,lx(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:Yb}),`InfixOp`,dx,Ox(),kx()),G(Z({expansion:[`<COLONCOLON>`],semantic:Yb}),`<COLONCOLON>`,Y(e=>{let t=nx(e);if(!mx(t[t.length-1].node))return`\`::' at ${$b(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=nx(e),n=tx(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!ix(r,e.lastOperator)){let t=tx(e,3);return`Removing label at ${$b(e,t.first,t.last)} would change expression parsing.`}t.push({node:ex(`Label`,[tx(e,3),tx(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:Yb}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:Yb}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>yx(e)<0&&e.proofLevels.length<=1?`${$b(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${$b(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:px(e.heirs)===void 0?e.heirs.length===1?ex(`GeneralId`,e.heirs):void 0:ex(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>qb(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>qb(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${$b(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Lx=/* @__PURE__ */ new Map,Rx=e=>{let t=Lx.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Rx(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,Rx(Ix[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 Lx.set(e,n),n},zx=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Bx=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Kb(e,e.scanPosition)),e.scanPosition=Kb(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`},Vx=(e,t)=>{if(t.type===`tokens`)return Bx(e,t.kinds);if(t.type===`call`)return Vx(e,Ix[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||zx(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=Vx(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||zx(e,t.semantic)?Vx(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Vx(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=Vx(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Hx=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Vx(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},Ux=(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||Rx(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Rx(a).hasSemanticStart?Rx(a).first.has(qb(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Hx(e,i,a)&&(o===void 0||o(e))}),Wx=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,Vx(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Kb(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===kb){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Kb(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Qe(e.token.image)}" `},Gx=(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??Wx(e)}\n\nResidual stack trace follows:\n${r}`,!1},Kx=(e,t)=>{let n=Kb(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,Gx(e))},qx=(e,t)=>{let n=Ix[t];n.message!==void 0&&(e.messages.push({name:n.message,token:qb(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Jx(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 Gx(e,i);let a=r.node??(r.heirs.length===0?void 0:ex(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Jx=(e,t)=>{if(t.type===`tokens`)return Kx(e,t.kinds);if(t.type===`call`)return qx(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Gx(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Gx(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Jx(e,t));if(t.type===`choice`){let n=Ux(e,t.alternatives);return n===-1?Gx(e):Jx(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Jx(e,t.body))return!1;if(t.type===`optional`)return Ux(e,[t.body])===-1||Jx(e,t.body);for(;Ux(e,[t.body])===0;)if(!Jx(e,t.body))return!1;return!0},Yx=e=>{let t=Xe(e),n={kind:kb,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Jx(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
1783
+ `)},Xx={low:15,high:15},Zx={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),Qx=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),$x=(e,t)=>t.isAssociative||e===`%`||e===`\\X`,eS=/* @__PURE__ */ new Map([[`~`,{low:4,high:4}],[`[]`,{low:4,high:15}],[`<>`,{low:4,high:15}],[`ENABLED`,{low:4,high:15}],[`UNCHANGED`,{low:4,high:15}],[`SUBSET`,{low:8,high:8}],[`UNION`,{low:8,high:8}],[`DOMAIN`,{low:9,high:9}],[`-`,{low:12,high:12}],[`-.`,{low:12,high:12}]]),tS={low:17,high:17},nS=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`@`,`\\A`,`\\E`,`\\AA`,`\\EE`,`IF`,`CASE`,`LET`,`CHOOSE`,`LAMBDA`,`WF_`,`SF_`]),rS=/* @__PURE__ */ new Set([`(`,`{`,`<<`]),iS=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),aS=/* @__PURE__ */ new Set([...iS,`'`]),oS=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),sS=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),cS=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),lS=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),uS=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...aS]),dS=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),fS=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),pS=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),mS=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),hS=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),gS=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),_S=/* @__PURE__ */ new Set([``,`*`,`-`]),vS={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},yS=(e,t)=>e.line-t.line||e.column-t.column,bS=(e,t)=>({start:yS(e.start,t.start)<=0?e.start:t.start,stop:yS(e.stop,t.stop)>=0?e.stop:t.stop}),xS=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),SS={printed:``,set:``},CS={printed:`
1784
+ `,set:``},wS={printed:`
1785
+ `,set:`
1786
+ `},TS=(e,t,n,i=`Proof.Parser`)=>new r(e,void 0,{reason:`${e}${n.set}`,line:t.start.line,column:t.start.column,isEnd:!1,proof:{stop:t.stop,exception:i,printed:`${e}${n.printed}`}}),ES=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),DS=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),OS=/* @__PURE__ */ new Set([`NEW`,...DS.keys()]),kS=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),AS=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),jS=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),MS=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Qx.has(e.operator):iS.has(e.operator)),NS=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,PS=e=>Qx.has(e)||iS.has(e)||e===`-.`,FS=(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}}},IS=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
1787
+ `)}\n`},LS=(e,t,n=Te(e,t===`tlapm`))=>{let i=t===`tlapm`,a=i?n:n.map(be),o=0,s=[],c,l,u=[],d=/* @__PURE__ */ new Set,f=[],p=[],h,g=0,_=[],v=/* @__PURE__ */ new WeakMap,y=e=>u[u.length-1].has(e),b=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),ee=[],x=[],S=[],C=(e,t=o-1)=>{let n=e===t?S[e]:void 0;if(n)return n;let r=a[t];ee[e]??=b(a[e]),x[t]??={line:r.line,column:r.endColumn};let i={module:p[0].name,start:ee[e],end:x[t]};return e===t&&(S[e]=i),i},w=(e,t)=>(e.location.range=C(t),e),ne=(e=0)=>a[Math.min(o+e,a.length-1)],T=(e=0)=>{let t=ne(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},E=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),re=e=>i&&(e.kind===`Keyword`||jS.has(e.text)),ie=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},ae=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:gS.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:re(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,oe=(e,t=ne(),n)=>{let i=a[a.length-1],o=t.line===i.line&&t.column===i.column,s=new r(`${e} at line ${t.line}, column ${t.column}`,void 0,se(e,t,o,n));return h!==void 0&&v.set(s,h),s},se=(e,t,n,r)=>{if(!i)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=a[_[0]-1],s=r?`Unexpected ${ae(r)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=r?ie(r):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},ce=(e,t=ne())=>oe(e,t,t),le=e=>{let t={cursor:o,frame:h,restorePoints:_.length,offsideColumns:s.length,recursiveScopes:u.length},n=++g;h=n;try{let n=e();return h=t.frame,n}catch(e){if(!(e instanceof r)||v.get(e)!==n)throw e;o=t.cursor,h=t.frame,_.length=t.restorePoints,s.length=t.offsideColumns,u.length=t.recursiveScopes;return}},ue=e=>{let t=h;h=void 0;let n=e();return h=t,n},fe=e=>{_.push(o);let t=e();return _.pop(),t},pe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!re(e),D=(e,t=0)=>{let n=T(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},O=()=>{let e=T();if(e.kind===`End`)throw ce(`Unexpected end of expression`);return o++,e},k=e=>D(e)?(o++,!0):!1,A=e=>{if(!D(e))throw ce(`Expected ${JSON.stringify(e)} but found ${E(T())}`);return O()},me=()=>{let e=T();if(e.kind!==`Identifier`)throw ce(`Expected an identifier but found ${E(e)}`);if(re(e))throw ce(`Unexpected keyword ${e.text}`);return o++,e.text},he=()=>{let e=o;return{name:me(),range:C(e)}},ge=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),_e=()=>{let e=T();return e.kind!==`String`&&(sS.has(e.text)||Qx.has(e.text)||aS.has(e.text))?(o++,e.text):me()},ve=!1,ye=()=>T().kind===`Identifier`||!pe(T())?me():(ve=!0,O().text),xe=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},Se=(e,t=`,`)=>{let n=[e()];for(;k(t);)n.push(e());return n},Ce=(e=0)=>{if(D(`<<`,e)){let t=e+1;for(;T(t).kind===`Identifier`||D(`,`,t);)t++;return D(`>>`,t)&&D(`\\in`,t+1)}let t=e;for(;T(t).kind===`Identifier`;){if(D(`\\in`,t+1))return!0;if(!D(`,`,t+1))return!1;t+=2}return!1},we=()=>{if(D(`::`))return!0;if(!D(`(`))return!1;let e=1;for(;T(e).kind===`Identifier`&&D(`,`,e+1);)e+=2;return T(e).kind===`Identifier`&&D(`)`,e+1)&&D(`::`,e+2)},Ee=()=>{if(!k(`<<`)){let e=he();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ge(D(`>>`)?[]:Se(he));return A(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},De=()=>{let e=()=>{let e=Se(Ee);A(`\\in`);let t=ue(M);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;D(`,`)&&(!i||Ce(1));)O(),t.push(e());return t.flat()},Oe=()=>{let e=T();if(i&&jS.has(e.text)){let t=o;O();let n={kind:`Identifier`,name:e.text,location:b(e)};return{subscript:w(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||D(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(C(o,o)),n.push(me()),e&&D(`(`)?Me():[]),s=[a(!i)];for(;D(`!`)&&T(1).kind===`Identifier`;)O(),s.push(a(!0));let c=s.slice(0,-1),l=b(e);l.range={...C(t),end:r[r.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:r,location:l},lastArgs:s[s.length-1]}}if(D(`<<`)||D(`(`)||D(`{`)||D(`[`)||t){let e=o,t=Ue();return{subscript:t.location.range?t:w(t,e),lastArgs:[]}}throw ce(`Expected a subscript but found ${E(e)}`)},j=e=>{let t=T(1),n=T(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&D(`==`,aS.has(n.text)?3:4))},ke=e=>{let t=T(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||D(`,`,1)||D(`)`,1)||t.kind===`Keyword`&&fS.has(t.text)||j(e)},Ae=()=>{let e=T(),t=e.kind===`Operator`&&(Qx.has(e.text)||oS.has(e.text))&&ke(e);if(i&&e.kind!==`String`&&(oS.has(e.text)||uS.has(e.text)&&e.text!==`'`&&!iS.has(e.text)||lS.has(e.text)&&T(-1).text===`(`&&T(-1).line===e.line&&T(-1).endColumn+1===e.column&&T(1).text===`)`&&T(1).line===e.line&&T(1).column===e.endColumn+1)&&ke(e))throw oe(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw oe(`\\X may not be used as an infix operator`,e);if(t)return o++,w({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:b(e)},o-1);if(e.kind!==`String`&&uS.has(e.text)&&ke(e)){o++;let t=b(e);if(iS.has(e.text))return w({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return w({kind:`Lambda`,params:[n.name],body:FS(e.text,n,t),operator:e.text,location:b(e)},o-1)}if(D(`LAMBDA`)){let t=o;O();let n=ge(Se(he));A(`:`);let r=M();return w({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:b(e)},t)}if(!i)return M();let n=le(M);if(n)return n;throw ce(`Unexpected ${E(T())}`)},je,Me=()=>xe(()=>{let e=o;A(`(`);let t=Se(Ae);return A(`)`),je=C(e),t}),Ne=()=>{let e=O();s.push(e.column);let t=[M()],n=()=>{for(;NS(ne())&&ne().text===e.text&&ne().column===e.column;)o++,t.push(M())};return i?ue(n):n(),s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:b(e)}},Pe=e=>xe(()=>{let t=b(e),n=T().kind===`Identifier`,r=D(`|->`,1)&&(n||pe(T()));if(r||n&&D(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=b(T()),i=e();return n.range=C(t),A(r?`|->`:`:`),{name:i,value:M(),location:n}},a=[i(()=>n?me():O().text),...k(`,`)?Se(()=>i(me)):[]];return A(`]`),{kind:e,fields:a,location:t}}if(Ce()){let e=o,n=De();if(!i||D(`|->`)){A(`|->`);let e=M();return A(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=M();if(k(`->`)){let e=M();return A(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(k(`EXCEPT`)){let e=Se(()=>{A(`!`);let e=[];for(;D(`.`)||D(`[`);)if(k(`.`)){if(!pe(T()))throw ce(`Expected a field name but found ${E(T())}`);if(!i&&D(`@`))throw ce(`@ used in !.@`);e.push({kind:`Field`,name:O().text})}else A(`[`),e.push({kind:`Index`,args:Se(()=>M())}),A(`]`);return A(`=`),{path:e,value:M()}});return A(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!D(`]_`)){let e=[a];for(;k(`,`);)e.push(M());return A(`]`),{kind:`Bracket`,args:e,location:t}}return A(`]_`),{kind:`BoxAction`,action:a,subscript:Oe().subscript,location:t}}),Fe=()=>{let e=o,t=w(Ge(),e),n=b(O());return w({kind:`Apply`,operator:`\\in`,args:[t,ue(M)],location:n},e)},Ie=e=>xe(()=>{let t=b(e);if(k(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(Ce()&&(T(1).text===`\\in`||D(`<<`))){let e=o,n=Ee();A(`\\in`);let r=ue(M);if(k(`:`)){let e=ue(M);return A(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=T().kind===`Identifier`&&D(`\\in`,1)?Fe():M();if(k(`:`)){let e=De();return A(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;k(`,`);)r.push(M());return A(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Le=e=>{let t=b(e),n=xe(()=>D(`>>`)||D(`>>_`)?[]:Se(()=>M()));if(k(`>>_`)){if(n.length!==1)throw oe(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:ue(Oe).subscript,location:t}}return A(`>>`),{kind:`Tuple`,elements:n,location:t}},Re=e=>{let t=b(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&Ce()){let e=De();return A(`:`),{kind:n,bounds:e,body:M(),location:t}}let i=ge(Se(he));return A(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:M(),isTemporal:r,location:t}},ze=e=>{let t=[];do{let n=o;if(k(`OTHER`))return A(`->`),{kind:`Case`,arms:t,other:M(),otherRange:C(n),location:b(e)};let r=M();A(`->`),t.push({condition:r,body:M()})}while(k(`[]`));return{kind:`Case`,arms:t,other:void 0,location:b(e)}},Be=()=>{let e=T(1);return D(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||dS.has(e.text)||e.kind===`Operator`&&(Qx.has(e.text)||aS.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&sS.has(e.text))},Ve=()=>{let e=O();if(e.kind===`Number`)return{kind:`Operand`,operand:de(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o--,{kind:`Bound`,args:Me()}}return{kind:`Name`,name:e.text,args:D(`(`)?Me():[]}},He=(e,t,n,r,i)=>{let a=[{kind:`Name`,name:e,args:t}],s=[C(r,r)],c=[n];for(;Be();)O(),s.push(C(o,o)),je=void 0,a.push(Ve()),c.push(je);let l=a.flatMap(e=>e.kind===`Name`?[e.name]:[]),u=l.join(`!`),d=a.flatMap(e=>`args`in e?e.args:[]),f=a.map(e=>`args`in e?e.args.length:0);return l.length<a.length?{kind:`Subexpression`,selectors:a,selectorRanges:s,argumentRanges:c,location:i}:d.length===0?{kind:`Identifier`,name:u,selectorRanges:s,location:i}:{kind:`Apply`,operator:u,args:d,...f.slice(0,-1).some(e=>e>0)&&{argumentCounts:f},argumentsRange:c.at(-1)??C(r),selectorRanges:s,argumentRanges:c,location:i}},Ue=e=>{let n=o,r=O(),a=b(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=Se(me);return A(`:`),{kind:`Lambda`,params:e,body:M(),location:a}}if(r.kind===`Number`)return{kind:`Number`,value:de(r.text),text:r.text,location:a};if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:a};if(r.kind===`String`)return{kind:`String`,value:r.text,location:a};let s=r.kind===`Step`&&wt(r);if(!i&&s&&xt()<0&&P.length<=1)throw oe(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw oe(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let t=s?Tt(r)??r.text:r.text;if(we()){let o=ge(k(`(`)?Se(he):[]);o.names.length>0&&A(`)`),A(`::`);let s=C(n),l=M();if(!i&&e!==void 0&&c!==void 0&&MS(l)&&e.high>=c.low)throw oe(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:t,params:o.names,paramRanges:o.ranges,head:s,body:l,location:a}}let o=D(`(`);if(t===`@`&&!o&&!Be())return{kind:`ExceptAt`,location:a};let l=o?Me():[];return Be()?He(t,l,o?je:void 0,n,a):o?{kind:`Apply`,operator:t,args:l,argumentsRange:je,location:a}:{kind:`Identifier`,name:t,location:a}}let l=r.kind===`Operator`&&(PS(r.text)||r.text===`'`&&!i);if(l&&D(`(`)){let e=Me();return!i&&Be()?He(r.text,e,je,n,a):t===`tlc`&&r.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:r.text===`'`&&e.length===1?{kind:`Prime`,expression:e[0],location:a}:{kind:`Apply`,operator:r.text,spelling:r.spelling,args:e,argumentsRange:je,location:a}}if(l&&!i)return Be()?He(r.text,[],void 0,n,a):{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=xe(()=>M());return A(`)`),e}case`[`:return Pe(r);case`{`:return Ie(r);case`<<`:return Le(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Re(r);case`IF`:{let e=M();A(`THEN`);let t=M();return A(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:M(),location:a}}case`CASE`:return ze(r);case`LET`:{let e=[],t=[];for(u.push(/* @__PURE__ */ new Set);!k(`IN`);){if(i&&D(`RECURSIVE`))throw ce(`Unexpected keyword RECURSIVE`);if(k(`RECURSIVE`)){vt();continue}let n=ft(!i&&k(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}u.pop();let n=M();return t.length===0?{kind:`Let`,definitions:e,body:n,location:a}:{kind:`Let`,definitions:e,instances:t,body:n,location:a}}case`CHOOSE`:{let e=Ee(),t=k(`\\in`)?M():void 0;return A(`:`),{kind:`Choose`,pattern:e,set:t,body:M(),location:a}}case`WF_`:case`SF_`:{let e=Oe(),t=!D(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:xe(()=>{A(`(`);let e=M();return A(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw ce(`Unexpected ${E(r)}`,r)},We=(e,t,n)=>{c=l={low:t,high:n};let r=M(n+1),i=T(),a=aS.has(i.text)?Xx.high:Qx.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw oe(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},Ge=()=>{let e=l;l=void 0;let t=T(),n=b(t);if(t.kind===`Operator`&&NS(t))return Ne();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return O(),{kind:`Apply`,operator:`~`,args:[We(t,4,4)],location:n};case`-`:return O(),{kind:`Apply`,operator:`-.`,args:[We(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return O(),FS(t.text,We(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return O(),{kind:`Apply`,operator:t.text,args:[We(t,10,13)],location:n}}return Ue(e)},Ke=(e,t,n,r,i)=>{let a=b(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},qe=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:b(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:b(e)},Je=()=>{O();let e=xe(()=>Se(()=>M()));return xe(()=>A(`]`)),e},Ye=e=>{let t=o,n=Ge(),r=n.location.range?n:w(n,t),i;for(;;){let n=T();if(n.kind!==`Operator`)break;let a=b(n);if(aS.has(n.text)&&e<=15){O(),c=Xx,r=w(qe(n,r),t);continue}if(n.text===`[`){let e=Je();c=Zx,r=w({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&pe(T(1))){O();let e=O().text;r=w({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=Qx.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw oe(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(O(),o.low>12&&D(`-`))throw oe(`Precedence conflict between ${n.text} and -`,T());c=l=o;let s=M(o.high+1),u=i?.text===n.text;r=w(Ke(n,r,s,u,C(t).end),t),i={...o,text:n.text}}return r},Xe=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&wt(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&nS.has(e.text),Ze=(e,t)=>({start:t,end:o-1,expression:e.location.range?e:w(e,t)}),Qe=(e,t,n,r)=>({...n,start:e,end:o-1,fixity:t,isLeft:!1,apply:r}),$e=e=>e.kind===`Operator`&&aS.has(e.text)&&D(`(`,1)?le(()=>xe(()=>{O(),O();let t=M(),n=o-1;return A(`)`),{end:n,expression:qe(e,t)}})):void 0,et=()=>{let e=0;for(let t=o+1;t<a.length;t++){let n=a[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(a[t-1].text!==`!`&&(kS.has(n.text)&&e++,AS.has(n.text)&&--e===0))return!1}}return!1},tt=e=>D(`(`,1)&&et()?le(()=>xe(()=>{O(),O();let t=M();A(`,`);let n=M();return A(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:b(e)}})):void 0,nt=e=>{let t=o,n=T(),r=b(n),i=n.kind===`Operator`||n.kind===`Keyword`,a=i?Qx.get(n.text):void 0;if(!e){if(D(`[`)){let e=Je();return Qe(t,`Postfix`,tS,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(D(`.`)&&pe(T(1))){O();let e=O().text;return Qe(t,`Postfix`,tS,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(a){if(tt(n)){o=t;return}return O(),{...Qe(t,`Infix`,a,e=>Ke(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,C(e[0].start,e[1].end).end)),isLeft:$x(n.text,a),joins:n.text}}if(n.kind!==`Operator`||!aS.has(n.text))return;if($e(n)){o=t;return}return O(),Qe(t,`Postfix`,Xx,e=>qe(n,e[0].expression))}if(n.kind===`Operator`&&NS(n))return Ze(Ne(),t);let s=a?tt(n):void 0;if(s)return Ze(s,t);let c=$e(n);if(c)return c.expression.location.range=C(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?eS.get(n.text):void 0;if(l)return O(),Qe(t,`Prefix`,l,e=>FS(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!Xe(n))return;let u=n.kind===`Operator`&&rS.has(n.text);return Ze(u?Ue():ue(Ue),t)},rt=e=>e!==void 0&&`fixity`in e,it=e=>e!==void 0&&!(`fixity`in e),at=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=C(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},ot=e=>{let t=e.pop(),n=e.pop();if(!it(t)||!rt(n))throw oe(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(at(n,it(r)?[r,t]:[t]))},st=e=>{let t=e[e.length-2];return rt(t)?t:void 0},ct=(e,t)=>t!==void 0&&e.high<t.low,lt=()=>fe(()=>{let e=le(()=>nt(!0));if(e===void 0){let e=ne();throw e.kind===`End`?ce(`Unexpected end of expression`,e):oe(`required expressions(s) missing before '${ae(e)}'`,e)}return ue(()=>{let t=[e];for(;;){let e=le(()=>nt(rt(t[t.length-1])));if(e===void 0)break;if(it(e)||e.fixity===`Prefix`){t.push(e);continue}for(;ct(e,st(t));)ot(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&it(n)){t.splice(-1,1,at(e,[n]));continue}let r=st(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!ct(r,e)&&ot(t),t.push(e)}for(;t.length>1;)ot(t);let n=t[0];if(!it(n))throw oe(`incomplete expression`);return n.expression})}),M=(e=0)=>i?lt():Ye(e),ut=()=>{if(!k(`(`))return[];let e=_t();return A(`)`),e},dt=()=>{let e=b(T()),t=M(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:p[0].name,start:e,end:r}}},ft=e=>{let t=o;return w(mt(e),t)},pt=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),mt=e=>{let t=T(),n=o,r=b(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:C(n,o-2),...dt(),isLocal:e,isRecursive:y(t),location:r});if(t.kind===`Identifier`&&T(1).kind===`Operator`&&Qx.has(T(1).text)&&T(2).kind===`Identifier`&&D(`==`,3)){let e=he(),t=O().text,n=he();return A(`==`),i(t,[pt(e),pt(n)])}let a=t.kind!==`String`&&sS.has(t.text),s=t.kind===`Identifier`&&aS.has(T(1).text)&&D(`==`,2);if(a||s){let e=a?t.text:T(1).text;a&&O();let n=he();return s&&O(),A(`==`),i(e,[pt(n)])}let c=me();if(k(`[`)){let t=xe(()=>De());return A(`]`),A(`==`),{kind:`Function`,name:c,bounds:t,body:M(),isLocal:e,isRecursive:y(c),location:r}}let l=o,u=ut();return A(`==`),D(`INSTANCE`)?{...N(c,u,e,r),definitionRange:C(l)}:i(c,u)},N=(e,t,n,r)=>{let i=o;return A(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ye(),substitutions:k(`WITH`)?Se(()=>{let e=o,t=_e(),n=C(e);return A(`<-`),{name:t,nameRange:n,expression:Ae()}}):[],isLocal:n,location:r,instanceRange:C(i)}},ht=()=>{let e=o;return w(gt(),e)},gt=()=>{let e=b(T());if(D(`_`)&&T(1).kind===`Operator`)return O(),{name:O().text,arity:k(`_`)?2:1,location:e};if(T().kind!==`String`&&(sS.has(T().text)||i&&T().kind===`Operator`)&&D(`_`,1)){let t=O().text;return O(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=me();if(!k(`(`))return{name:t,arity:0,location:e};let n=Se(()=>A(`_`));return A(`)`),{name:t,arity:n.length,location:e}},_t=()=>Se(ht),vt=()=>{let e=_t();return e.forEach(e=>u[u.length-1].add(e.name)),e},yt=e=>{let t=0,n=e;do{let e=T(n);if(e.kind===`End`)return n;e.kind===`Operator`&&kS.has(e.text)&&t++,e.kind===`Operator`&&AS.has(e.text)&&t--,n++}while(t>0);return n},bt=()=>{let e=T(),t=T(1);return e.kind===`Identifier`?D(`(`,1)||D(`[`,1)?D(`==`,yt(1)):t.kind===`Operator`&&aS.has(t.text)?D(`==`,2):t.kind===`Operator`&&Qx.has(t.text)?T(2).kind===`Identifier`&&D(`==`,3):D(`==`,1):e.kind!==`String`&&sS.has(e.text)&&t.kind===`Identifier`&&D(`==`,2)},P=[],xt=()=>P[P.length-1]??-1,St=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Ct=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},wt=e=>!e.text.endsWith(`.`)&&!_S.has(Ct(e)),Tt=e=>{let t=Ct(e);if(_S.has(t))return;let n=St(e);if(n>=0)return`<${n}>${t}`;let r=xt(),i=P[P.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Et=e=>{if(e.kind===`Keyword`)return mS.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return P.length===0;if(e.text[1]===`+`||P.length===0)return!0;let t=xt();return t>=0&&St(e)>t},Dt=e=>{let t=St(e),n=P.length-1,r=P[n-1]??-1,i=P[n]<0;return i&&(P[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:P[n]===t},Ot=e=>!d.has(e)&&p.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),kt=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!jS.has(e.name)&&!Ot(e.name):!1,At=()=>{let e=T();return e.kind===`Step`?wt(e):e.kind===`Keyword`?ES.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!bt()},jt=()=>{let e=o,t=T();return t.kind===`Operator`&&!cS.has(t.text)&&PS(t.text)?(o++,w({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:b(t)},e)):k(`MODULE`)?w({kind:`ModuleFact`,name:me(),location:b(t)},e):M()},Mt=e=>f[f.length-1]?.add(e),Nt=e=>{f.push(/* @__PURE__ */ new Set);let t=e();return f.pop(),t},Pt=e=>f.some(t=>t.has(e))||p.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),Ft=()=>{let e=o,t=T(),n=Se(()=>{let e=T();if((e.kind!==`Identifier`||re(e))&&e.kind!==`Operator`)throw ce(`Expected a definition name but found ${E(e)}`,e);return o++,e.text},`!`),r=b(t);return w(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},It=()=>{if(i)return Se(Ft);let e=Se(jt),n=t===`tlc`?e.find(e=>e.kind===`Identifier`&&Pt(e.name)):void 0;if(n)throw oe(`DEF clause entry should describe a defined operator`,n.location);return e},Lt=()=>{let e=le(M);if(!e)return[];let t=[e];return fe(()=>{for(;D(`,`);){let e=le(()=>(O(),M()));if(!e)return;t.push(e)}}),t},Rt=()=>{let e=i?Lt():At()?Se(jt):[],t=k(`DEF`)||k(`DEFS`);if(i&&e.length===0&&!t)throw ce(`Expected a fact`);return{facts:e,defs:t?It():[]}},zt=()=>{let e=o,n=O(),r=n.text===`USE`&&k(`ONLY`),i=C(e),a={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...Rt(),keyword:i,location:b(n)},s=a.kind===`Hide`&&t===`tlc`?a.facts.filter(e=>!kt(e)):[];if(s.length>0)throw te(s.map(t=>({location:m(t.location.range??C(e)),message:`The only expression allowed as a fact in a HIDE is
1788
+ the name of a theorem, assumption, or step.`})));return w(a,e)},Bt=()=>{let e=o,t=b(T()),n=k(`NEW`),r=i?o:e,a=i?b(T()):t,s=T().kind===`Keyword`?DS.get(T().text):void 0;if(!n&&s===void 0)throw ce(`Expected a declaration but found ${E(T())}`);if(s!==void 0&&O(),s===`Variable`){let e=he();return Mt(e.name),w({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=ht();Mt(c.name);let l=(s??`Constant`)===`Constant`&&D(`\\in`);if(l&&c.arity>0)throw oe(`declared symbol with arguments before \\in`);return l&&O(),w({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?M():void 0,nameRange:c.location.range,location:a},r)},Vt=()=>{if(T().kind===`Identifier`&&D(`::`,1)&&D(`ASSUME`,2)&&(O(),O()),D(`ASSUME`))return Nt(Ut);if(T().kind===`Keyword`&&OS.has(T().text))return i?ue(Bt):Bt();if(!i)return M();let e=le(M);if(e===void 0)throw ce(`Expected a hypothesis`);return e},Ht=()=>{let e=[Vt()];return fe(()=>{for(;;){let t=le(()=>(A(`,`),Vt()));if(t===void 0)break;e.push(t)}}),e},Ut=()=>{let e=o,t=b(A(`ASSUME`)),n=()=>{let n=i?Ht():Se(Vt);return A(`PROVE`),w({kind:`AssumeProve`,assumptions:n,conclusion:M(),location:t},e)};return i?ue(n):n()},Wt=e=>{let t=0;for(;T(t).kind===`Identifier`&&D(`,`,t+1);)t+=2;return T(t).kind===`Identifier`&&D(e,t+1)},Gt=(e,t)=>{e.forEach(Mt),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(Mt))},Kt=()=>{let e=T();if(D(`USE`)||D(`HIDE`))return zt();if(!i&&D(`INSTANCE`)){let t=o;return w(N(void 0,[],!1,b(e)),t)}if(D(`DEFINE`)||bt()){let t=o;k(`DEFINE`);let n=[ft(!1)];for(;bt();)n.push(ft(!1));let r={kind:`Define`,definitions:n,location:b(e)};return w(r,t)}if(k(`HAVE`))return{kind:`Have`,expression:M()};if(k(`TAKE`)){let e=Ce(),t=ge(e?[]:Se(he)),n=e?De():[];return Gt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(k(`WITNESS`))return{kind:`Witness`,expressions:Se(()=>M())};if(k(`PICK`)){let e=Wt(`:`),t=ge(e?Se(he):[]),n=e?[]:De();return Gt(t.names,n),A(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:M()}}return k(`CASE`)?{kind:`Case`,expression:M()}:{kind:`Assert`,isSuffices:k(`SUFFICES`),statement:D(`ASSUME`)?Ut():M()}},qt=e=>{let n=T();if(n.kind!==`Step`)throw ce(`Expected a step number but found ${E(n)}`,n);if(!Dt(n))throw oe(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&St(n)<0&&Tt(n)!==void 0)throw oe(`<*> and <+> cannot be used for a named step`,n);return o++,{name:Tt(n),token:n.text,location:b(n)}},Jt=()=>{let e=o,t=qt(D(`QED`,1)),n=o,r=/* @__PURE__ */ new Set;f.push(r);let i=k(`QED`)?{kind:`Qed`}:Kt(),a=C(e),s=C(n),c=Et(T());if(c&&!hS.has(i.kind))throw oe(`Proof of a step that does not take a proof`);let l=c?Zt():void 0;return f.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(Mt),w({...t,body:i,head:a,statement:s,proof:l},e)},Yt=e=>{if(k(`BY`)){let t=C(o-1);return{kind:`By`,isOnly:k(`ONLY`),...Rt(),keyword:t,location:e}}let t=T();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;O();let n=C(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Xt=()=>{let e=b(T());k(`PROOF`);let t=Yt(e);if(t)return t;let n=[Jt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Jt());return{kind:`Steps`,level:xt(),steps:n,location:e}},Zt=()=>{let e=o;P.push(-1);let t=Nt(Xt);return P.pop(),w(t,e)},Qt=()=>T().kind===`Step`||T().kind===`Keyword`&&mS.has(T().text),$t=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return xS(e);let n=t.defs[t.defs.length-1]?.location.range;return bS(xS({...e,end:e.start}),xS(n??t.keyword))},en=()=>{let e=o,t=b(T()),n=k(`PROOF`),r=Yt(t);if(r){let t=w(r,e);return{kind:`Leaf`,proof:t,span:xS(t.keyword),first:e,end:o-1}}let i=T();if(i.kind!==`Step`)throw ce(`Expected a step number but found ${E(i)}`);let a=o;O();let s=o,c=k(`QED`)?{kind:`Qed`}:Kt(),l=C(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:C(s),span:$t(l,c),first:e,start:a,end:o-1}},tn=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=nn(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...b(a[i.first]),range:C(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},nn=(e,t,n,r,i)=>{let a=e[t];if(!a)throw TS(`Unexpected end of (sub)proof at level ${n} before QED step`,r,wS);if(a.kind===`Leaf`)throw TS(`Expecting a proof step but found a${vS[a.proof.kind]} leaf proof`,a.span,wS);if(!i&&a.isProof)throw TS(`PROOF keyword found in step that does not begin subproof`,a.span,CS);let o=a.token.text[1];if(o===`+`&&!i)throw TS(`<+> used but no subproof expected`,a.span,CS);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:St(a.token);if(s<n||!i&&s>n)return;let c=hS.has(a.body.kind)?tn(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:Tt(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...b(a.token),range:C(a.start,l)}},d=bS(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=nn(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:bS(d,f.span)}},rn=()=>{if(!Qt())return;let e=[];for(;Qt();)e.push(en());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=tn(e,0,0,t.span),r=e[n.next];if(r)throw TS(`extra step(s) after finished proof`,r.span,SS,`Proof.Parser.toplevel`);return n.proof},an=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},on=()=>{if(T().kind!==`Identifier`||!D(`==`,1))return;let e=me();return d.add(e),O(),e},sn=()=>{if(!i)return M();let e=ne(),t=le(M);if(t)return t;throw ce(`Expected "====" but found ${E(e)}`,e)},cn=e=>{let t=o,n=O(),r=on(),a=Nt(()=>{let e=D(`ASSUME`)?Ut():sn();return i?{statement:e,proof:rn()}:{statement:e,proof:Et(T())?Zt():void 0}}),s=a.statement,c=w({name:r,statement:s,proof:a.proof,location:b(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&an(e,r,s,c.location)},ln=()=>{let e=o,t=O(),n=on();return w({name:n,expression:M(),isAxiom:t.text===`AXIOM`,location:b(t)},e)},un=()=>{let e=b(A(`----`));A(`MODULE`);let t=ye();A(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(p.push(n),u.push(/* @__PURE__ */ new Set),k(`EXTENDS`)&&Se(()=>{let e=o;n.extends.push(ye()),n.extendsRanges.push(C(e))});;){let t=o,r=T();if(r.kind===`ModuleEnd`)return e.range={module:p[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},p.pop(),u.pop(),n;if(r.kind===`Separator`){if(D(`MODULE`,1)){let e=un();n.modules.push(e),n.units.push({kind:`Module`,module:e}),A(`====`);continue}O()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=b(O()),r=_t();n.constants.push(...r),e.range=C(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=b(O()),r=Se(()=>{let e=o,t=b(T());return w({name:me(),arity:0,location:t},e)});n.variables.push(...r),e.range=C(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=ln();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&an(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(D(`USE`)&&D(`ONLY`,1))throw ce(`Expected a module unit but found ${E(r)}`);let e=zt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=b(O()),r=vt();e.range=C(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:dn(n,w(N(void 0,[],!1,b(r)),t));continue;case`LOCAL`:if(O(),D(`INSTANCE`)){dn(n,w(N(void 0,[],!0,b(r)),t));continue}dn(n,w(mt(!0),t));continue}r.kind===`Keyword`&&pS.has(r.text)?cn(n):dn(n,ft(!1))}}},dn=(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}))},fn=un(),pn=ve?Yx(e):void 0;if(pn!==void 0)throw new r(pn);return fn},RS=e=>LS(e,`tlc`),zS=(e,t)=>LS(e,`tlc`,t),BS=e=>LS(e,`tlapm`),VS=e=>LS(e,`sany`),HS=`$subexpression`,US=(e,t)=>new r(`${e} at line ${t.line}, column ${t.column}`),WS=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return WS(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of pt(e)){let e=WS(r,t,n);if(e)return e}},GS=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),KS=(e,t)=>{let n=e.location,r=GS(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 US(`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 US(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:HS,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:HS,args:e.args,location:n,resolution:lc},location:n}},qS=(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:lc})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:lc}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:lc};return KS({...t,params:[...t.params,...r]},a)},JS=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o=0,s,c=!1,l=(t,r)=>{if(!t)throw US(r,i);dc.set(n,{args:e.slice(0,o).flatMap(e=>`args`in e?e.args:[]),error:{location:m(t),message:r}}),c=!0},u=n=>{let r=[],a=[];for(;o<e.length;){let s=e[o];if(s.kind!==`Name`)throw US(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>Fl(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o++}throw US(`Unknown operator ${r.join(`!`)}`,i)},d=t=>{let c=u(t),d=c.definition,f=gc(d),p=o===e.length-1;if(c.args.length!==f&&(!r||c.args.length!==0))return l(n.argumentRanges?.[o]??i.range,`The operator ${rc(c.name)} requires ${f-c.earlier} arguments.`);if(p)return{definition:d,args:c.args};if(d.kind!==`Operator`)throw US(`Cannot select a subexpression of ${d.name}`,i);a.params.push(...d.params),a.args.push(...c.args),s=d.body,o++},f=()=>{for(;o<e.length&&!c;){let t=e[o];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o],c=s&&WS(s,t.name,[]);if(!c)return l(i,`Cannot find label \`${t.name}'.`);let u=c.label.params;if(!r&&t.args.length!==u.length)return l(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...u.map(e=>({name:e,arity:0}))),a.args.push(...t.args),s=c.label.body,o++}},p=t=>{if(!s)throw US(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(s.kind===`Label`){s=s.body,p(t);return}if(s.kind===`Let`){if(t.kind!==`Operand`||zc(t.operand,1)!==0)throw US(`A LET/IN expression has only one operand`,i);a.lets.push(s.definitions),s=s.body;return}let n=Uc(s);if(n&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...n.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),s=n.body;return}if(s.kind===`Case`&&t.kind===`Operand`){let n=[...s.arms,...s.other?[{condition:void 0,body:s.other}]:[]],r=n[zc(t.operand,n.length)],a=e[o+1];if(!r||a?.kind!==`Operand`)throw US(`A subexpression of CASE must have the form !i!j`,i);o++;let c=zc(a.operand,2),l=c===0?r.condition:c===1?r.body:void 0;if(!l)throw US(`Nonexistent CASE operand`,i);s=l;return}if(t.kind!==`Operand`)throw US(`Unexpected subexpression selector`,i);let r=n?n.sets:Wc(s),c=r?.[zc(t.operand,r.length)];if(!c)throw US(`Nonexistent operand specified by the selector`,i);s=c},h=d(void 0);if(c)return n;if(h)return qS(h.definition,{...a,args:h.args});for(f();o<e.length&&!c;){let t=e[o];if(t.kind===`Name`){for(;s?.kind===`Label`;)s=s.body;if(s?.kind!==`Let`)throw US(`A name selector here must be from a LET clause`,i);a.lets.push(s.definitions);let e=d(s.definitions);if(c)return n;if(e)return qS(e.definition,{...a,args:[...a.args,...e.args]});f()}else p(t),o++}if(c)return n;if(!s)throw US(`Subexpression selection failed`,i);return KS(a,s)},YS=(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 Bc(e,t,n)},XS=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||pt(e).some(XS),ZS=(e,t,n,r=!1)=>{if(!XS(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Rl(e,e=>ZS(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>QS(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)=>ZS(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Rl(e,e=>ZS(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?YS(a.name,[],void 0,t):a.kind===`Apply`?YS(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name)||s?.kind===`Name`&&o[1].kind!==`Name`&&!t(s.name))return a;let c=JS(o,t,a,r);return c!==a&&uc.add(c),c},QS=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:ZS(e.expression,t,n,!0)}))}),$S=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},eC=(e,t)=>QS(e,$S(t.definitions),()=>!1),tC=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=$S([...t,...e.definitions]),a=e=>n.has(e),o=$S([...t,...e.definitions,...r]),s=e=>ZS(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>ZS(e,i,c),u=e=>e.map(e=>e.kind===`ModuleFact`?e:l(e)),d=e=>e.map(e=>({...e,set:l(e.set)})),f=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&l(e.set)}:f(e)),conclusion:l(e.conclusion)}:l(e),p=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:u(e.facts)};case`Instance`:return QS(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?QS(e,i,c):Ll(e,l))};case`Have`:case`Case`:return{...e,expression:l(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(l)};case`Take`:return{...e,bounds:d(e.bounds)};case`Pick`:return{...e,bounds:d(e.bounds),body:l(e.body)};case`Assert`:return{...e,statement:f(e.statement)};default:return e}},m=e=>e?.kind===`By`?{...e,facts:u(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:p(e.body),proof:m(e.proof)}))}:e,h={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:f(e.statement),proof:m(e.proof)})),uses:e.uses.map(e=>({...e,facts:u(e.facts)}))};return e.definitions.some(e=>XS(e.body))||e.assumptions.some(e=>XS(e.expression))?{...h,definitions:e.definitions.map(e=>Ll(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},nC=(e,t)=>e.maxLevels[t]??3,rC=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=qu({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Cu(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Cu(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>wu(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=bu(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)&&Cu(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(Ju(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=m(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;if(r)for(let n=0;n<e.arity;n++){let i=c.argConstraints.get(vu(e.name,n));i!==void 0&&nC(r,n)<i&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${n+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),c.argParams.forEach(e=>{let n=bu(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=nC(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw te([...r.values()])}},iC=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],aC=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),oC=new Map(tc.flatMap(e=>e.map(t=>[t,e[0]]))),sC=e=>oC.get(e)??e,cC=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},lC=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:ht(e)&2147483647,kind:t,isLocal:n}),uC=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:sC(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:sC(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},dC=(e,t)=>{let n=[];for(let r=t;;){let t=uC(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},fC=e=>({line:e.line,column:e.column}),pC=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=dC(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},mC=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,hC={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},gC=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&mC(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&mC(e[n+1],e[n+2])?n+=mC(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=>hC[e])}"`:r.text)}return t},_C=e=>e[2]?.text,vC=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},yC=(e,t)=>e.find(e=>e.name===t)??e.map(e=>yC(e.modules,t)).find(Boolean),bC=e=>{let t=e===void 0?[]:Te(e),n;return{tokens:t,ranges:vC(t),getModule:()=>n??=e===void 0?RS(``):zS(e,t)}},xC=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=bC(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??sc.get(i)??mp.get(i)??IS(e,i),c=a(s),l=c.tokens,u=c.ranges.get(_C(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>yC(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},SC=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=dC(t,e+1);i.push({location:fC(t[e]),apply:e=>r.forEach(t=>e.put(lC(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:fC(n),apply:t=>t.put(lC(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&dC(t,u+1).every(e=>s.has(e))&&o(u,`definition`),aC.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(fC(n)),i.push({location:fC(n),apply:e=>e.put(lC(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(lC(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=sC(e.name);i.push({location:e.location,apply:n=>n.put(lC(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(lC(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(lC(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>hc(e.location,t.location)?-1:+!!hc(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=cC();n.set(i??``,o),ec.toReversed().forEach(e=>o.put(lC(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},CC=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};t.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),ic.forEach(i);let s=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=pC(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;gC(s(void 0)).forEach((e,t)=>{t===3&&oc.forEach(i),i(e)});let b=u(void 0);for(;;){let t=g(b,/* @__PURE__ */ new Set)??_(b,/* @__PURE__ */ new Set);if(!t)break;let[n,r]=t;if(f.add(`${n.key}>${r}`),y.set(n.unit,[...y.get(n.unit)??[],r]),!v.has(r)){if(v.add(r),e(r).tokens.length===0){let t=n.unit??_C(e(void 0).tokens);throw o(r,t)}gC(s(r)).forEach(i)}}iC.forEach(i);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`&&i(e.text)})};return x(void 0),n.forEach(e=>{let t=s(e);gC(t).forEach(i),t.forEach(e=>{e.kind===`String`&&i(e.text)})}),ac.forEach(i),[...r]},wC=(e,t)=>{let n=xC(e,t),r=n.getParsed,i,a=()=>i??=SC(r);return{getStringOrder:(e,t)=>CC(r,e,t),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},TC=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),EC=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],DC=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof r))throw n;let i=Yx(e);throw i===void 0?n:te([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,i)}},OC=e=>new r(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),kC=(e,t)=>e.location.range&&t.location.range&&{location:m(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${m(t.location.range)}.`},AC=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,jC=e=>e===`Theorem`?`ThmOrAssumpDefNode`:AC(e),MC=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:nu(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),NC=(e,t)=>{let n=mt(e);return n!==void 0&&t.has(n)||pt(e).some(e=>NC(e,t))},PC=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Zl(e),n.get(e)??n.size)),n},FC=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),IC=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw ng(e);if(e.kind===`Number`&&!mn(e.value))throw rg(e);IC(e.kind===`Let`?[...pt(e),...FC(e.instances??[])]:pt(e))}),LC=(e,t)=>{let n=t.order??wC(t.source,t.loadModule),i=n.parseModule(t.source),a=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,d=new Map(Tp.map(e=>[e.name,e])),f=/* @__PURE__ */ new Map,p=Vf(e.checkDeadlock,t.seed);p.isWarningEnabled=t.isWarningEnabled??!0,p.isTool=t.isTool??!1,p.version=t.version??`master`,p.readLine=t.readLine;let h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Map,b=[],ee=/* @__PURE__ */ new Map,x=[],S=[],C=(e,t)=>x.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),w=0,ne=e=>`${e}#${w++}`,T=[],E=[],re=rC(e=>{let t=v.get(e)??fe(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)}}),ie=/* @__PURE__ */ new Map,ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=e=>{let n=f.get(e);if(n)return n;let r=qp(e,t.print,p,t.files,d);if(!r)return;Gp.get(e)?.forEach(se);let i=/* @__PURE__ */ new Map;return Kp.get(e)?.forEach(e=>se(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{d.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:hu.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:_u(e,t.name)??i.get(t.name)?.range})}),f.set(e,i),i},ce=e=>{let n=Gp.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=se(e);return r&&C(e,n),r&&n.includes(`Integers`)&&se(`Integers`),r},le=e=>(IC([...e.definitions.flatMap(ft),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...FC(e.instances)]),e.modules.forEach(le),e);le(i);let ue=(e,r)=>{let i=t.loadModule?.(e)??gp(p.version).get(e)??IS(t.source,e);if(i===void 0)throw o(e,r);let a=DC(i,e,n);if(a.name!==e)throw te([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return le(a)},de=e=>{let t=S.indexOf(e.name);if(t!==-1){let n=[...S.slice(t),e.name].map(e=>`${e}.tla`);throw new r(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,i=[],a=[],o=[];S.push(e.name),x.push(n);let s=_e(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:E,levelChecks:o});if(x.pop(),S.pop(),a.length>0)throw te(a,!1,void 0,E);let c=i.find(e=>n.has(e.name)),l=c&&h.get(c.name),u=l&&kC(c,l.module);if(u)throw te([u],!1,void 0,E);if(c)throw OC(c);return o.forEach(e=>e()),{linked:s,closure:n}},fe=(e,n)=>{let r=h.get(e);if(r)return C(e,ee.get(e)??[]),r;let i=de(ue(e,n)),o=/* @__PURE__ */ new Map;return Wp(e,t.print,p,t.files,d,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new y(`No definition of ${e} to fall back to`);return W(r.body,{environment:n.environment,scope:l_(Yg(r),i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=i.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&TC.has(e))return;let r=a.get(n.key);r&&o.set(t.name,r),d.set(n.key,t),a.delete(n.key)}),h.set(e,i.linked),ee.set(e,i.closure),C(e,i.closure),i.linked},pe=(e,t,n,r,i)=>{let o=i?void 0:ce(e.module);if(o)return D(e,o);let d=i??fe(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=EC(d),p=`#${w++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=El(eC(e,t),f,t,n);T.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>u.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=uu({params:g,substitutions:new Map([...h].map(([e,t])=>[e,Ml(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>s.get(e)===!0,addDefinition:(n,i,o)=>{let u=ne(`${i}@${t.name}`),d=o(u);return a.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&ae.set(u,`${e.name}!${ae.get(n)??i}`),s.set(u,!r),c.set(u,{source:n,prefix:e.params.length}),u},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return O(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&ie.set(r,{name:n,location:e.location}),e.name!==void 0&&oe.set(r,n),r})},D=(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}])),O=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:s.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},k=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),A=(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=k(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:ru(r,n),location:n}}},me=(e,t,n,r)=>{let i=e.location,o=r?void 0:ce(e.module);if(o)return e.name===void 0?[]:[...o].map(([t,n])=>{let r=k(n.arity,n.params);return iu(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??fe(e.module,n),l=`#${w++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=EC(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};T.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>NC(f(e),p),h=d.map(t=>{let n=A(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],_=uu({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:ru(e.params,i),location:i,resolution:lc}:nu(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>s.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:MC(a,i)),i},createName:ne}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=k(n.arity,n.params),o=[...e.params,...a];return iu(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...y]},he=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),ge=/* @__PURE__ */ new Map,_e=(e,n)=>{let r=Ob(e,t.loadClass?.(e.name),e===i);ge.set(e.name,r.overrides);let o=r.module,c=T.length,l=new Map([...Tp.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:xl,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||m(n.range)===m(e.range))return;let r=m(e.range),i=m(n.range);jC(n.kind)===jC(e.kind)?d.warnings.push({location:r,message:`Warning: the ${AC(n.kind)} of '${t}' conflicts with \nits ${AC(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${AC(e.kind)} of '${t}' conflicts with \nits ${AC(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,_=/* @__PURE__ */ new Map,y=[],ee=[...o.constants],x=o.variables.filter((e,t)=>o.variables.findIndex(t=>t.name===e.name)===t),S=x.map(e=>e.name),te=x.map(e=>e.location);o.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:ce(e);if(r){p(r);return}let i=t??fe(e,o.name);ee.push(...i.constants.filter(e=>ee.every(t=>t.name!==e.name)&&!S.includes(e.name))),i.variables.forEach((e,t)=>{S.includes(e)||ee.some(t=>t.name===e)||(S.push(e),te.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>_.set(t,e)),y.push(i)});let C=new Map(l),w=[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))],ne=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});w.forEach(e=>h.set(e.name,ne(e)));let ie=e=>({key:se(e),arity:gc(e),params:_c(e),kind:Sl(o,e)?`Theorem`:`Definition`,range:e.location.range}),ae=ee.length===0&&S.length===0,se=e=>o===i?e.name:`${e.name}@${n.id}`,le=/* @__PURE__ */ new Map,ue=()=>new Map([...n.modules,..._]),de=e=>{let t=o.modules.find(t=>t.name===e.module);return t?hc(t.location,e.location)?_.get(t.name):void 0:ue().get(e.module)},k=e=>({imported:l,getInstance:e=>{let t=de(e),n=t?void 0:ce(e.module);if(n)return{declarations:[],symbols:D(e,n),instancer:o.name};let r=t??fe(e.module,o.name),i=EC(r);return{declarations:i,symbols:O(e,r.exported,i,e=>e),instancer:o.name}},bound:C,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:se,instanced:le,facts:g,reports:f,warnings:n.warnings}),A=e=>[...w.filter(t=>hc(t.location,e)).map(e=>[e.name,ne(e)]),...o.definitions.filter(t=>hc(t.location,e)).map(e=>[e.name,ie(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),ve=e=>{let t=ue(),r=t.get(e.name),i=r&&kC(e,r.module);if(r&&!i)throw OC(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=_e(e,{id:`${n.id}/${e.name}`,symbols:A(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||_.set(e.name,o)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=pe(e,o,k(o),ae,ue().get(e.module));le.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))})}})),...o.modules.map(e=>({location:e.location,link:()=>ve(e)}))].sort((e,t)=>hc(e.location,t.location)?-1:1).forEach(e=>e.link());let ye=tC(mu(o,(e,t)=>me(e,t,o.name,de(e))),he(l));n.errors.push(...Ol(ye,k(ye))),ye.definitions.forEach(e=>{let t=se(e);a.set(t,e),s.set(t,!ae);let n=ie(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!hc(r,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let be={module:ye,constants:ee,variables:S,variableLocations:te,visible:l,exported:h,modules:_,extended:y,facts:/* @__PURE__ */ new Set([...g,...[...ye.theorems,...ye.assumptions].flatMap(e=>e.name??[])])};v.has(o.name)||v.set(o.name,be);let xe=T.splice(c).map(e=>({location:e.location,check:()=>re(e)}));return n.levelChecks.push(()=>Yu(ye,{constants:new Set(ee.map(e=>e.name)),variables:new Set(S),getDefinition:e=>a.get(l.get(e)?.key??e),getQualifiedName:e=>oe.get(l.get(e)?.key??e)},xe,E)),b.push(be),be},ve=de(i).linked,ye=t.traceFile,be=ye===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:ye}}],xe=[...t.moduleOperators??[],...be].map(e=>{let t=fe(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});b.push(...b.splice(b.indexOf(ve),1)),E.length>0&&!t.isSanyReported&&t.print(g(E));let Se=t.runtimeInvariants??[];Se.forEach(e=>{if(e.module===void 0)return;h.set(i.name,ve);let t=fe(e.module,i.name);b.splice(b.indexOf(t),1);let n=a.get(t.visible.get(e.name)?.key??e.name);n&&a.set(e.name,n)}),ve.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),xe.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(ve,/* @__PURE__ */ new Set);let Te=ve.constants.map(e=>e.name),Ee=ve.variables,De=hb(e,{root:ve,moduleSymbols:new Map([...f,...[...h].map(([e,t])=>[e,t.visible]),[i.name,ve.visible]]),definitions:a,builtins:d,copySources:c,operatorConstants:new Map(xe.flatMap(e=>fe(e.module,i.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:n}),Oe=De.constants,j=De.substitutions;ye!==void 0&&d.forEach((e,t)=>{let n=Ap(e);n&&d.set(t,n)});let ke=PC(Ee,b.flatMap(e=>e.module.variables.map(e=>e.name))),Ae=cd({definitions:a,substitutions:j,constants:Oe,variableIndex:ke,builtins:d,variables:Ee}),je={runtime:p,definitions:a,builtins:d,constants:Oe,substitutions:j,instanceNames:ae,variables:Ee,variableIndex:ke,facts:Ae,startupValues:Array.from({length:Ae.ids.size},()=>void 0),substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Me=qu({constants:new Set(Oe.keys()),variables:/* @__PURE__ */ new Set([...Ee,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>d.has(e))]),getDefinition:e=>_g(e,je)}),Ne=e=>{try{W(e,{environment:je,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};j.forEach((e,t)=>{let n=a.get(e),r=Te.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Me.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Ne(n.body):void 0;if(r){let n=Mt(r)?``:` - specifically: ${r.message}`;throw new _(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),p.version!==`1.7.4`&&(p.isStarted=!0);let Pe=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),Fe=n.createDefinitionOrder();return{environment:je,assumptions:Ce,variableLocations:ve.variableLocations,instanceActions:ie,startupDefinitions:b.filter(e=>!Pe.has(e.module.name)||EC(e).length===0).flatMap(e=>Fe(e===ve?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:b.flatMap(e=>ge.get(e.module.name)??[]),moduleOperators:xe,runtimeInvariants:Se,rootName:i.name}},RC=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),zC=(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},BC=e=>v(new y(`${i}${e}`),S.error),VC=e=>{let t=L(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!dn(e)||!dn(i))throw BC(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},HC=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${UC(t)}`:n},UC=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(UC).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${HC(e.pattern,e.set)}:${UC(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(UC).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${UC(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>HC(e.pattern,e.set)).join(`,`)}|->${UC(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(UC);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},WC=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,GC=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new _(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw BC(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!cn(a)||!F(a))throw BC(`The symmetry operator must specify a set of functions.`);let o=I(a).elements;if(!o.every(un))throw BC(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=UC(WC(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(xt.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(VC).forEach(e=>{e.size>0&&d.set(RC(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=zC(n,e),r=RC(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!WC(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>dn(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},KC=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=JC(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(JC(e[r],t));return a}},qC=(e,t)=>{let n=[],r=[];for(let i of e){let e=JC(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Xn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Xn(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},JC=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=qC(e.elements,t);return n?tr(n):e}if(n===`Function`||n===`LazyFunction`&&F(e.domain)){let n=L(e),r=KC(n.domain,t),i=KC(n.range,t)??n.range;if(r){let e=Qr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?rr(n.domain,e.range):e}return i===n.range?n:rr(n.domain,i)}if(n===`Interval`||!cn(e)||!F(e))return e;let r=I(e),i=KC(r.elements,t);return i?Kr(i):r},YC=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=JC(e[o],i),a===0&&(a=Xn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},XC={line:0,column:0},ZC=e=>({kind:`Identifier`,name:e,location:XC}),QC=e=>({name:e,expression:ZC(e),scope:void 0}),$C=/* @__PURE__ */ new Set([`name`,`property`]),ew=(e,t,n)=>{let r=_g(t,n);if(!r)throw new _(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new _($C.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},tw=e=>e.body.kind===`Number`||e.body.kind===`String`,nw=(e,t,n)=>{if(n.constants.has(e))return n.constants.get(e);if(dd(t,n)&&!tw(t))try{return W(ZC(e),Dw(n,void 0,void 0))}catch(e){if(e instanceof y||C(e))return;throw e}},rw=(e,t,n)=>{if(n.constants.has(t))throw new _(`The ${e} ${t} cannot be a constant.`);let r=ew(e,t,n);if(nw(t,r,n)!==void 0)throw new _(`The ${e} ${t} cannot be a constant.`);return r},iw=(e,t,n)=>{let r=n.constants.has(t)?void 0:ew(e,t,n),i=r?nw(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new _(`The ${e} of ${t} is equal to ${R(i)}`);return i===void 0?r:void 0},aw=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},ow=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Kg(e.startupDefinitions,r),t.invariants.forEach(e=>{iw(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},sw=(e,t)=>{let n=qu({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=iw(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
1786
1789
  Note that a bug can cause TLC to incorrectly report this error.
1787
1790
  If you believe your TLA+ or PlusCal specification to be correct,
1788
- please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw S(new v(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),w.safetyEvaluationFailure)}return[oC(e)]})},gC=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>gC(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=ng(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&Ag(n,t)===void 0)return gC(n.body,t)}return[e]},_C=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Gv(r,e.scope,t)>0)return!1;let i=W(r,PC(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 ${R(i)},\ncannot be used as a ${n}`);return!0},vC=(e,t,n,r,i)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return dC(n,e,t),aC(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(e.init!==void 0||e.next!==void 0)throw new v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let a=[],o=[],s=[],c=t.constants.has(e.specification)?t.constants.get(e.specification):uC(e.specification,cC(`name`,e.specification,t),t);if(c!==void 0)throw new v(`The value of ${e.specification} is equal to ${R(c)}`);let l=cC(`name`,e.specification,t),u=e.properties.length===1?e.properties[0]:void 0,d=!1;qv(l.body,void 0,t,!1).forEach(e=>{let c=e.expression;if(_C(e,t,`spec`))return;let l=c.kind===`Identifier`&&!M(c)?t.variableIndex.get(c.name):void 0;if(c.kind===`Identifier`&&l!==void 0){let e=n[l].range;throw new v(`The operator ${c.name}, which equals ${e?g(e):c.name},\ncannot be used as a spec`)}if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw S(new v(`TLC does not support temporal existential, nor universal, quantification over state variables.`),w.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){let n=Sy(c.expression.subscript,e.scope,t);if(n===void 0&&i?.({kind:`warning`,code:St.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
1789
- all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:St.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),o.length>0)throw new v(`The specification contains more than one conjunct of the form [][Next]_v,
1790
- but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&Gv(c.expression,e.scope,t)<2)throw S(new y(`TLC cannot handle the temporal formula ${U(c.expression)}`),w.error);let f=Gv(c,e.scope,t);if(f===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(f===2)throw new v(`TLC cannot handle this conjunct of the spec:\n${U(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,m=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),h=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(h),location:iC},next:o.length===0?void 0:h(o[0],a.length),scope:m,temporals:s,isPropertyFairness:s.length>0&&!d}},yC=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=fC(`property`,e,t);if(!i)return;Gv(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(_C(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`&&Gv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!M(e)?ng(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=Gv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=U(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new v(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},bC=(e,t,n)=>t.flatMap(t=>fC(e,t,n)?[oC(t)]:[]),xC=(e,t)=>{let n=ng(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},SC=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);dC(`possible`,n,t);let i=oC(n);if(Gv(i.expression,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 i}),CC=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||M(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},wC=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=ng(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},TC=(e,t)=>e.flatMap(e=>gC(e.expression,t).map(n=>{let r=e.scope===void 0?Yu(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:CC(n,r,t),predicate:wC(e.expression,t)}})),EC=(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},DC=/[\u0100-\uffff]/,OC=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),kC=e=>e.kind===`String`?DC.test(e.value):e.kind===`Set`&&e.elements.some(kC),AC=e=>e.kind===`String`&&DC.test(e.value)||e.kind===`Apply`&&OC.has(e.operator)||mt(e).some(AC),jC=(e,t)=>e.constants.some(e=>kC(e.value)||(e.args??[]).some(kC))||[...t.definitions.values()].some(e=>AC(e.body)||e.kind===`Function`&&e.bounds.some(e=>AC(e.set))),MC=e=>{if(!un(e))return;let t=vn(L(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},NC=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},PC=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),FC=(e,t,n)=>Zh(W(e,t),n),IC=(e,t,n=RC)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},LC=(e,t,n)=>{let r=t.kind===`Identifier`?ng(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?g(a):Ph(i)}`},RC=(e,t)=>LC(`boolean`,e,t),zC=(e,t)=>IC(e.expression,t,(n,r)=>(IC(e.predicate,t),RC(n,r))),BC=()=>{},VC=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=FC(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),HC=(e,t)=>{try{return e(PC(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},UC=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=HC(e=>tg(W(n.expression,e),n.expression),t);if(e)return{name:Ph(n.expression),trace:[],message:e.message}}},WC=(e,t,n,r=!1)=>{let i=MS(t.source,t.loadModule);return An(i.getStringOrder(e)),Fn(t),so(t.fingerprintPolynomial??0),r&&jn(),{order:i,specification:GS(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators})}},GC=e=>{let t=typeof e.config==`string`?ft(e.config,e.version):e.config,n=WC(t,e,e.onPrint??console.log),r=n.specification;mC(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=xy(t,i,r.instanceActions);return i.runtime.getSpecification=()=>Ey(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:JC(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators),getDescription:o}},KC=(e,t,n)=>{let r=UC(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(St.assumptionFalse,e,e),w.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(St.assumptionEvaluationError,i,Ft(St.assumptionEvaluationError,i,!0)),w.assumptionViolation},qC=e=>S(new y(`${m}Could not find operator: ${e.operator} in module: ${e.module}`),w.error),JC=(e,t,n,r,i,a=[])=>{let o=e=>a.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw qC(e);return{name:e.operator,key:e.key}}),s=hC(e.invariants,t),c=vC(e,t,n,r,i),l=yC(e,t,i),u=e.properties[0],d=u&&ng(u,t)?.location.range,f=e.specification,p=f&&ng(f,t)?.location.range;c.isPropertyFairness&&d&&p&&i?.({kind:`warning`,code:St.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${u} at ${g(d)} equals\nthe fairness constraints of the behavior specification ${f} at ${g(p)}.\nTherefore, checking whether ${f} => ${u} using TLC will never result in a violation of ${u}.`});let h=TC([...s,...l.invariants],t),_=[...new Map(h.map(e=>[e.predicate,e])).values()],ee=h.length>0||l.actionProperties.length>0||l.liveness.length>0;if(c.init===void 0&&(ee||l.initialPredicates.length>0||t.variables.length>0))throw new v(t.runtime.version===`1.7.4`?Dt:`The configuration file did not specify the initial state predicate.`);if(c.next===void 0&&ee)throw new v(`The configuration file did not specify the next state predicate.`);let b=bC(`constraint`,[...e.constraints,...o(`constraint`).map(e=>e.name)],t),x=TC(b,t),C=bC(`action constraint`,e.actionConstraints,t),te=t.coverage,ne=(e,n,r=!0)=>n.flatMap(n=>{if(!te)return[];let i=r?wC(n.expression,t):n.expression,a=xo(r?n.name:void 0,i,t),o=yo(te,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),re=[...ne(`invariant`,s),...ne(`invariant`,l.invariants,!1)],ie=ne(`constraint`,C),ae=ne(`constraint`,b),oe=ne(`implied`,l.initialPredicates,!1),se=ne(`implied`,l.actionProperties.map(e=>({...e,expression:e.box})),!1),ce=(e,n,r,i)=>{try{return No(e,n.node,()=>W(n.expression,PC(t,r,i,n.scope)))}catch{return}},le=(e,t,n)=>te!==void 0&&e.every(e=>ce(te,e,t,n)===!0),T=(e,t,n)=>{if(te){for(let r of e){let e=ce(te,r,t,n);if(typeof e!=`boolean`)return;if(!e)return te.primary[r.node]++,!1;te.secondary[r.node]++}return!0}};e.rlReward!==void 0&&cC(`rlreward`,e.rlReward,t),e.periodic!==void 0&&cC(`periodic`,e.periodic,t);let E=SC(e.possible,t);if(t.variables.length===0)return;let D=e.symmetry===void 0?void 0:$S(e.symmetry,t,e.substitutions),ue=e.view===void 0?void 0:dC(`view function`,e.view,t),O=e.view??o(`view`)[0]?.name,de=O===void 0?void 0:oC(O),fe=l.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:iC};return{...e,unchanged:t}}),pe=e=>Gv(e.expression,void 0,t)>=2,me=E.filter(e=>!pe(e)),he=E.filter(pe),ge=t.runtime,_e,k=()=>{if(_e)return _e;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return _e=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),_e},ve=(e,n)=>W(e,PC(t,n,void 0)),ye=e=>{let t=k(),n=D===void 0?e:rC(e,D,t);return fo(de===void 0?t.map(e=>n[e]):[ve(de.expression,n)])},be=/* @__PURE__ */ new WeakSet,xe=(e,n,r)=>{let i=r&&!be.has(r)?r:void 0;if(EC(e,n,i))return!1;try{let r=PC(t,n,void 0,e.scope),a=e.membership;return i&&a?!Qi(n[a.variable],i[a.variable],W(a.set,r)):!zC(e,r)}catch(t){throw r?Vt(S(t,w.safetyEvaluationFailure),St.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},Se=jC(e,t);ge.getFingerprint=ye;let Ce=()=>{let e=E.find(e=>!ge.possibleCounts.get(e.name));if(!e)return;let n=xC(e.name,t),r=n?` at ${g(n)}`:``;return{name:e.name,code:St.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:N(R(bf(ge),!0))}},we=ue?.body.kind===`Tuple`?ue.body.elements:[],Te=we.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),Ee=ue?.body.kind===`Tuple`&&Te.length===we.length&&new Set(Te).size===Te.length,De=(e,n)=>Ee?k().filter(e=>Te.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${N(R(n[e]))}\n`).join(``):N(R(ve(e,n))),Oe=(e,n,r)=>IC(e.expression,PC(t,n,r),e=>`${m}${RC(e,t)}`),ke=e=>{let n=Object.fromEntries(k().map(n=>[t.variables[n],e[n]]));return de===void 0?n:Ln(n,()=>De(de.expression,e))};return{properties:l,spec:c,toRecord:ke,evaluateAlias:(e,n,r,i)=>{try{dC(`alias`,e,t);let i=W(aC(e),PC(t,n,r)),a=MC(i);return a===void 0?ke(n):zn(a,e)}catch(e){if(!(e instanceof v||e instanceof y))throw e;return{...ke(n),_ALIASEvalError:It(e.message,i)}}},isSymmetric:D!==void 0,isConstrained:x.length>0||C.length>0,getTlcOrder:k,getStoredFingerprints:(e,t)=>de!==void 0||Se?BigInt64Array.from(e,ye):po(t,k()),getFingerprintState:e=>{if(Se)return[String(ye(e))];let t=D===void 0?e:rC(e,D,k());return de===void 0?t:[ve(de.expression,t)]},findViolatedInvariant:(e,t)=>{if(le(re,e))return;let n=h.find(n=>xe(n,e,t));return n&&be.add(e),n},getViolatedInvariants:e=>{let t=_.filter(t=>h.some(n=>n.predicate===t.predicate&&xe(n,e,void 0)));return t.length>0&&be.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>IC(n,PC(t,e,void 0,r));x.every(e=>r(e.predicate,e.scope))&&n();let i=_.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=l.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(x.every(e=>IC(e.predicate,PC(n,t,void 0,e.scope)))&&C.every(r=>IC(r.expression,PC(n,e,t,r.scope))))||r())||_.every(e=>IC(e.predicate,PC(n,t,void 0,e.scope))))&&fe.every(r=>IC(r.box,PC(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>T(ae,e)??x.every(r=>EC(r,e,n)||zC(r,PC(t,e,void 0))),findFailedInitialPredicate:e=>le(oe,e)?void 0:l.initialPredicates.find(n=>!IC(n.expression,PC(t,e,void 0,n.scope))),findViolatedActionProperty:(e,n)=>le(se,e,n)?void 0:fe.find(r=>{try{return!IC(r.action,PC(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!FC(r.unchanged,PC(t,e,n,r.scope),`a subscript`)}catch(e){throw Vt(YC(e),St.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>T(ie,e,t)??C.every(n=>Oe(n,e,t)),getExcludingConstraints:(e,n)=>[...x.filter(e=>!zC(e,PC(t,n,void 0))),...C.filter(t=>!Oe(t,e,n))].map(e=>{let n=xC(e.name,t);return n?g(n):e.name}),trackStatePossible:me.length===0?BC:e=>VC(me,ge,PC(t,e,void 0)),trackActionPossible:he.length===0?BC:(e,n)=>VC(he,ge,PC(t,e,n)),findUnwitnessedPossible:Ce,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=aC(e.rlReward),o=W(a,PC(t,n,r));if(typeof o!=`number`)throw new y(LC(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=o(`postcondition`),i=e.postconditions.map(e=>{let n=ng(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!lC(n)&&Ag(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw S(new y(i),w.configParseError)}let a=(e,n)=>{let r=HC(e=>IC(aC(n),e),t);if(!r)return;let i=ng(n,t)?.body,a=xC(n,t),o=a?` at ${i?.kind===`Number`?Ph(i):g(a)}`:``;return r.message===void 0?{name:e,code:St.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:St.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let s=Ce();if(s)return s;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},YC=e=>e instanceof c?S(e,e.exitCode):e,XC=(e,t)=>e*((t-e)/2**64),ZC=e=>e.includes(`.`)?e:`${e}.0`,QC=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return ZC(String(e));let[n,r]=e.toExponential().split(`e`);return`${ZC(n)}E${r.replace(`+`,``)}`},$C=e=>e!==void 0&&e>=`0`&&e<=`9`,ew=e=>{if(e===0)return`0.0`;let t=QC(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;$C(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;$C(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;$C(t[n])&&r<2;)i+=t[n++],r++;for($C(t[n])&&Number(t[n])>=5&&(i=tw(i));$C(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},tw=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${tw(r)}.`:n===`9`?`${tw(r)}0`:`${r}${Number(n)+1}`},nw=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},rw=(e,t,n)=>{if(XC(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a=1/0,o=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 s=t-n;if(s<=1048576){let t=s*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a=Math.min(a,t)}else{let t=r[e]-r[e-1];t<o&&(o=t)}}if(a===1/0)return o;let s=BigInt(a);return s<o?s:o},iw=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},aw=[void 0,`lambda`,`tuple`,`record`],ow=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=la(e.domain);return t?(a(7),a(aw.indexOf(or(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(aw.indexOf(or(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},sw=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return $n(t.strings[n[r++]]);if(e===5)return tr(i(n[r++]));let a=aw[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=si({kind:`Interval`,low:e,high:e+t-1});return ar(rr(o,i(t)),a)}let o=n[r++],s=i(o);return ar(rr(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Sh as $,ft as $t,Zv as A,ba as At,J_ as B,Ft as Bt,wy as C,fo as Ct,ty as D,ui as Dt,Ey as E,$n as Et,mv as F,gr as Ft,ev as G,Zt as Gt,tv as H,zt as Ht,Fv as I,pr as It,l_ as J,Ht as Jt,X_ as K,qt as Kt,U_ as L,St as Lt,lv as M,er as Mt,sv as N,nn as Nt,zv as O,Wa as Ot,Rv as P,Mn as Pt,t_ as Q,mt as Qt,Q_ as R,Ct as Rt,dx as S,Jo as St,xy as T,yr as Tt,$_ as U,Rt as Ut,G_ as V,It as Vt,K_ as W,Mt as Wt,ng as X,Lt as Xt,U as Y,Jt as Yt,n_ as Z,gt as Zt,YC as _,yo as _t,rw as a,bm as at,Yx as b,go as bt,WC as c,ep as ct,UC as d,Kf as dt,et as en,wh as et,NC as f,Sf as ft,mC as g,Zs as gt,pC as h,Qd as ht,nw as i,Cm as it,Yv as j,xa as jt,Xv as k,R as kt,qC as l,$f as lt,KC as m,Jd as mt,ow as n,xe as nn,Eh as nt,XC as o,xm as ot,GC as p,Tf as pt,H_ as q,Nt as qt,ew as r,Ee as rn,Th as rt,iw as s,Sm as st,sw as t,Ge as tn,Ch as tt,JC as u,tp as ut,Wx as v,ko as vt,Ty as w,$t as wt,Jx as x,xo as xt,Kx as y,Io as yt,W_ as z,Et as zt};
1791
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw v(new _(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),S.safetyEvaluationFailure)}return[QC(e)]})},cw=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>cw(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=_g(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&Gg(n,t)===void 0)return cw(n.body,t)}return[e]},lw=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||oy(r,e.scope,t)>0)return!1;let i=W(r,Dw(t,void 0,void 0,e.scope));if(i===!1)throw new _(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new _(`The operator ${r.name}, which equals ${R(i)},\ncannot be used as a ${n}`);return!0},uw=(e,t,n,r,i)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return rw(n,e,t),ZC(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(e.init!==void 0||e.next!==void 0)throw new _(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let a=[],o=[],s=[],c=t.constants.has(e.specification)?t.constants.get(e.specification):nw(e.specification,ew(`name`,e.specification,t),t);if(c!==void 0)throw new _(`The value of ${e.specification} is equal to ${R(c)}`);let l=ew(`name`,e.specification,t),u=e.properties.length===1?e.properties[0]:void 0,d=!1;cy(l.body,void 0,t,!1).forEach(e=>{let c=e.expression;if(lw(e,t,`spec`))return;let l=c.kind===`Identifier`&&!N(c)?t.variableIndex.get(c.name):void 0;if(c.kind===`Identifier`&&l!==void 0){let e=n[l].range;throw new _(`The operator ${c.name}, which equals ${e?m(e):c.name},\ncannot be used as a spec`)}if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw v(new _(`TLC does not support temporal existential, nor universal, quantification over state variables.`),S.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){let n=Ry(c.expression.subscript,e.scope,t);if(n===void 0&&i?.({kind:`warning`,code:xt.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
1792
+ all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:xt.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),o.length>0)throw new _(`The specification contains more than one conjunct of the form [][Next]_v,
1793
+ but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&oy(c.expression,e.scope,t)<2)throw v(new y(`TLC cannot handle the temporal formula ${U(c.expression)}`),S.error);let f=oy(c,e.scope,t);if(f===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(f===2)throw new _(`TLC cannot handle this conjunct of the spec:\n${U(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,h=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(g),location:XC},next:o.length===0?void 0:g(o[0],a.length),scope:h,temporals:s,isPropertyFairness:s.length>0&&!d}},dw=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=iw(`property`,e,t);if(!i)return;oy(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;cy(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(lw(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`&&oy(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!N(e)?_g(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=oy(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=U(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new _(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},fw=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},pw=(e,t,n)=>t.flatMap(t=>iw(e,t,n)?[QC(t)]:[]),mw=(e,t)=>{let n=_g(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},hw=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new _(`_POSSIBLE lists ${n} more than once`);rw(`possible`,n,t);let i=QC(n);if(oy(i.expression,void 0,t)===3)throw new _(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return i}),gw=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||N(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},_w=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=_g(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},vw=(e,t)=>e.flatMap(e=>cw(e.expression,t).map(n=>{let r=e.scope===void 0?_d(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:gw(n,r,t),predicate:_w(e.expression,t)}})),yw=(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},bw=/[\u0100-\uffff]/,xw=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Sw=e=>e.kind===`String`?bw.test(e.value):e.kind===`Set`&&e.elements.some(Sw),Cw=e=>e.kind===`String`&&bw.test(e.value)||e.kind===`Apply`&&xw.has(e.operator)||pt(e).some(Cw),ww=(e,t)=>e.constants.some(e=>Sw(e.value)||(e.args??[]).some(Sw))||[...t.definitions.values()].some(e=>Cw(e.body)||e.kind===`Function`&&e.bounds.some(e=>Cw(e.set))),Tw=e=>{if(!un(e))return;let t=vn(L(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},Ew=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},Dw=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),Ow=(e,t,n)=>fg(W(e,t),n),kw=(e,t,n=jw)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},Aw=(e,t,n)=>{let r=t.kind===`Identifier`?_g(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?m(a):Yh(i)}`},jw=(e,t)=>Aw(`boolean`,e,t),Mw=(e,t)=>kw(e.expression,t,(n,r)=>(kw(e.predicate,t),jw(n,r))),Nw=()=>{},Pw=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=Ow(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Fw=(e,t)=>{try{return e(Dw(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},Iw=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Fw(e=>gg(W(n.expression,e),n.expression),t);if(e)return{name:Yh(n.expression),trace:[],message:e.message}}},Lw=(e,t,n,r=!1)=>{let i=wC(t.source,t.loadModule);return An(i.getStringOrder(e,(t.runtimeInvariants??[]).flatMap(e=>e.module??[]))),Fn(t),so(t.fingerprintPolynomial??0),r&&jn(),{order:i,specification:LC(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine,runtimeInvariants:t.runtimeInvariants})}},Rw=e=>{let t=typeof e.config==`string`?dt(e.config,e.version):e.config,n=Lw(t,e,e.onPrint??console.log),r=n.specification;ow(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=Ly(t,i,r.instanceActions);return i.runtime.getSpecification=()=>Hy(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:Vw(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators,r.runtimeInvariants),getDescription:o}},zw=(e,t,n)=>{let r=Iw(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(xt.assumptionFalse,e,e),S.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(xt.assumptionEvaluationError,i,Pt(xt.assumptionEvaluationError,i,!0)),S.assumptionViolation},Bw=e=>v(new y(`${i}Could not find operator: ${e.operator} in module: ${e.module}`),S.error),Vw=(e,t,n,r,a,o=[],s=[])=>{let c=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw Bw(e);return{name:e.operator,key:e.key}}),l=sw(e.invariants,t),u=uw(e,t,n,r,a),d=dw(e,t,a),f=e.properties[0],p=f&&_g(f,t)?.location.range,h=e.specification,g=h&&_g(h,t)?.location.range;u.isPropertyFairness&&p&&g&&a?.({kind:`warning`,code:xt.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${f} at ${m(p)} equals\nthe fairness constraints of the behavior specification ${h} at ${m(g)}.\nTherefore, checking whether ${h} => ${f} using TLC will never result in a violation of ${f}.`});let b=vw([...l,...d.invariants],t),ee=b.length>0||d.actionProperties.length>0||d.liveness.length>0;if(u.init===void 0&&(ee||d.initialPredicates.length>0||t.variables.length>0))throw new _(t.runtime.version===`1.7.4`?Et:`The configuration file did not specify the initial state predicate.`);if(u.next===void 0&&ee)throw new _(`The configuration file did not specify the next state predicate.`);let x=vw(s.map(e=>{let n=_g(e.name,t);return{name:e.name,expression:n?.kind===`Operator`?n.body:ZC(e.name),scope:void 0}}),t),te=[...b,...x],C=[...new Map(te.map(e=>[e.predicate,e])).values()],w=pw(`constraint`,[...e.constraints,...c(`constraint`).map(e=>e.name)],t),ne=vw(w,t),T=pw(`action constraint`,e.actionConstraints,t),E=t.coverage,re=(e,n,r=!0)=>n.flatMap(n=>{if(!E)return[];let i=r?_w(n.expression,t):n.expression,a=Ao(r?n.name:void 0,i,t),o=Oo(E,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),ie=[...re(`invariant`,l),...re(`invariant`,d.invariants,!1)],ae=re(`constraint`,T),oe=re(`constraint`,w),se=re(`implied`,d.initialPredicates,!1),ce=re(`implied`,d.actionProperties.map(e=>({...e,expression:e.box})),!1),le=(e,n,r,i)=>{try{return Ho(e,n.node,()=>W(n.expression,Dw(t,r,i,n.scope)))}catch{return}},ue=(e,t,n)=>E!==void 0&&e.every(e=>le(E,e,t,n)===!0),de=(e,t,n)=>{if(E){for(let r of e){let e=le(E,r,t,n);if(typeof e!=`boolean`)return;if(!e)return E.primary[r.node]++,!1;E.secondary[r.node]++}return!0}};e.rlReward!==void 0&&ew(`rlreward`,e.rlReward,t),e.periodic!==void 0&&ew(`periodic`,e.periodic,t);let fe=hw(e.possible,t);if(t.variables.length===0)return;let pe=e.symmetry===void 0?void 0:GC(e.symmetry,t,e.substitutions),D=e.view===void 0?void 0:rw(`view function`,e.view,t),O=e.view??c(`view`)[0]?.name,k=O===void 0?void 0:QC(O),A=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:XC};return{...e,unchanged:t}}),me=e=>oy(e.expression,void 0,t)>=2,he=fe.filter(e=>!me(e)),ge=fe.filter(me),_e=t.runtime,ve,ye=()=>{if(ve)return ve;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return ve=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),ve},be=(e,n)=>W(e,Dw(t,n,void 0)),xe=e=>{let t=pe===void 0?e:YC(e,pe,ye());return bo(k===void 0?ye().map(e=>t[e]):[be(k.expression,t)])},Se=e=>ue(se,e)?void 0:d.initialPredicates.find(n=>!kw(n.expression,Dw(t,e,void 0,n.scope))),Ce=/* @__PURE__ */ new WeakSet,we=(e,n,r)=>{let i=r&&!Ce.has(r)?r:void 0;if(yw(e,n,i))return!1;try{let r=Dw(t,n,void 0,e.scope),a=e.membership;return i&&a?!Qi(n[a.variable],i[a.variable],W(a.set,r)):!Mw(e,r)}catch(t){throw r?Bt(v(t,S.safetyEvaluationFailure),xt.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},Te=ww(e,t);_e.getFingerprint=xe;let Ee=()=>{let e=fe.find(e=>!_e.possibleCounts.get(e.name));if(!e)return;let n=mw(e.name,t),r=n?` at ${m(n)}`:``;return{name:e.name,code:xt.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:P(R(Hf(_e),!0))}},De=D?.body.kind===`Tuple`?D.body.elements:[],Oe=De.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),j=D?.body.kind===`Tuple`&&Oe.length===De.length&&new Set(Oe).size===Oe.length,ke=(e,n)=>j?ye().filter(e=>Oe.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${P(R(n[e]))}\n`).join(``):P(R(be(e,n))),Ae=(e,n,r)=>kw(e.expression,Dw(t,n,r),e=>`${i}${jw(e,t)}`),je=e=>{let n=Object.fromEntries(ye().map(n=>[t.variables[n],e[n]]));return k===void 0?n:Ln(n,()=>ke(k.expression,e))};return _e.toRecord=je,{properties:d,spec:u,toRecord:je,evaluateAlias:(e,n,r,i)=>{try{rw(`alias`,e,t);let i=W(ZC(e),Dw(t,n,r)),a=Tw(i);return a===void 0?je(n):zn(a,e)}catch(e){if(!(e instanceof _||e instanceof y))throw e;return{...je(n),_ALIASEvalError:Ft(e.message,i)}}},isSymmetric:pe!==void 0,isConstrained:ne.length>0||T.length>0,getTypedChecks:n=>{if(E!==void 0||fe.length>0||e.periodic!==void 0||[...te,...ne].some(e=>e.scope!==void 0)||T.length>0||d.actionProperties.some(e=>e.scope!==void 0)||d.liveness.length>0&&(n===void 0||k!==void 0)||u.init===void 0||u.next===void 0)return;let r=C.map(e=>e.predicate),i=[...new Set(ne.map(e=>e.predicate))],a=d.initialPredicates.map(e=>e.expression),o=[...t.facts.ids.keys()],s=fw(u.scope),c=e=>Gg(e,t)===void 0&&md(e,t,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&dd(e,t)&&c(e))||pd([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...k?[k.expression]:[],...s,...cb(n??[])],t,`replayed`))?void 0:{init:u.init,next:u.next,scope:u.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>Se(e)===void 0,actionProperties:d.actionProperties,symmetry:pe,view:k?.expression,variableOrder:ye(),liveness:n}},getTlcOrder:ye,getStoredFingerprints:(e,t)=>k!==void 0||Te?BigInt64Array.from(e,xe):So(t,ye()),getFingerprintState:e=>{if(Te)return[String(xe(e))];let t=pe===void 0?e:YC(e,pe,ye());return k===void 0?t:[be(k.expression,t)]},findViolatedInvariant:(e,t)=>{let n=(ue(ie,e)?x:te).find(n=>we(n,e,t));return n&&Ce.add(e),n},getViolatedInvariants:e=>{let t=C.filter(t=>te.some(n=>n.predicate===t.predicate&&we(n,e,void 0)));return t.length>0&&Ce.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>kw(n,Dw(t,e,void 0,r));ne.every(e=>r(e.predicate,e.scope))&&n();let i=C.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=d.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(ne.every(e=>kw(e.predicate,Dw(n,t,void 0,e.scope)))&&T.every(r=>kw(r.expression,Dw(n,e,t,r.scope))))||r())||C.every(e=>kw(e.predicate,Dw(n,t,void 0,e.scope))))&&A.every(r=>kw(r.box,Dw(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>de(oe,e)??ne.every(r=>yw(r,e,n)||Mw(r,Dw(t,e,void 0))),findFailedInitialPredicate:Se,findViolatedActionProperty:(e,n)=>ue(ce,e,n)?void 0:A.find(r=>{try{return!kw(r.action,Dw(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!Ow(r.unchanged,Dw(t,e,n,r.scope),`a subscript`)}catch(e){throw Bt(Hw(e),xt.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>de(ae,e,t)??T.every(n=>Ae(n,e,t)),getExcludingConstraints:(e,n)=>[...ne.filter(e=>!Mw(e,Dw(t,n,void 0))),...T.filter(t=>!Ae(t,e,n))].map(e=>{let n=mw(e.name,t);return n?m(n):e.name}),trackStatePossible:he.length===0?Nw:e=>Pw(he,_e,Dw(t,e,void 0)),trackActionPossible:ge.length===0?Nw:(e,n)=>Pw(ge,_e,Dw(t,e,n)),findUnwitnessedPossible:Ee,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=ZC(e.rlReward),o=W(a,Dw(t,n,r));if(typeof o!=`number`)throw new y(Aw(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=c(`postcondition`),i=e.postconditions.map(e=>{let n=_g(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!tw(n)&&Gg(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw v(new y(i),S.configParseError)}let a=(e,n)=>{let r=Fw(e=>kw(ZC(n),e),t);if(!r)return;let i=_g(n,t)?.body,a=mw(n,t),o=a?` at ${i?.kind===`Number`?Yh(i):m(a)}`:``;return r.message===void 0?{name:e,code:xt.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:xt.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=Ee();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},Hw=e=>e instanceof x?v(e,e.exitCode):e,Uw=(e,t)=>e*((t-e)/2**64),Ww=e=>e.includes(`.`)?e:`${e}.0`,Gw=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Ww(String(e));let[n,r]=e.toExponential().split(`e`);return`${Ww(n)}E${r.replace(`+`,``)}`},Kw=e=>e!==void 0&&e>=`0`&&e<=`9`,qw=e=>{if(e===0)return`0.0`;let t=Gw(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;Kw(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;Kw(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;Kw(t[n])&&r<2;)i+=t[n++],r++;for(Kw(t[n])&&Number(t[n])>=5&&(i=Jw(i));Kw(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},Jw=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Jw(r)}.`:n===`9`?`${Jw(r)}0`:`${r}${Number(n)+1}`},Yw=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},Xw=(e,t,n)=>{if(Uw(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},Zw=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},Qw=[void 0,`lambda`,`tuple`,`record`],$w=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=la(e.domain);return t?(a(7),a(Qw.indexOf(or(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(Qw.indexOf(or(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},eT=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return $n(t.strings[n[r++]]);if(e===5)return tr(i(n[r++]));let a=Qw[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=si({kind:`Interval`,low:e,high:e+t-1});return ar(rr(o,i(t)),a)}let o=n[r++],s=i(o);return ar(rr(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{zh as $,I as $t,Ly as A,Qt as At,mv as B,li as Bt,BS as C,Ao as Ct,sb as D,ho as Dt,lb as E,go as Et,pv as F,ui as Ft,w_ as G,nn as Gt,hv as H,R as Ht,av as I,Kr as It,s_ as J,Di as Jt,U as K,er as Kt,lv as L,rr as Lt,_y as M,yr as Mt,ey as N,Qr as Nt,By as O,uo as Ot,iv as P,$n as Pt,Lh as Q,pr as Qt,ov as R,di as Rt,VS as S,To as St,ub as T,mo as Tt,dv as U,ba as Ut,sv as V,Wa as Vt,rv as W,xa as Wt,Gg as X,F as Xt,_g as Y,Mn as Yt,g_ as Z,gr as Zt,ow as _,et as _n,hc as _t,Xw as a,Rt as an,Fm as at,IS as b,Te as bn,Ro as bt,Lw as c,Xt as cn,hp as ct,Iw as d,Vt as dn,Wf as dt,xt as en,Rh as et,Dw as f,qt as fn,qf as ft,aw as g,dt as gn,pd as gt,zw as h,pt as hn,dd as ht,Yw as i,Ft as in,Rm as it,Hy as j,Xn as jt,Vy as k,bo as kt,Bw as l,Kt as ln,mp as lt,Rw as m,ht as mn,xf as mt,$w as n,Tt as nn,uh as nt,Uw as o,Lt as on,Im as ot,Ew as p,It as pn,_f as pt,W as q,tn as qt,qw as r,Pt as rn,Bh as rt,Zw as s,jt as sn,Lm as st,eT as t,St as tn,Vh as tt,Vw as u,Mt as un,gp as ut,Hw as v,Ge as vn,rc as vt,Yx as w,rs as wt,RS as x,Go as xt,JC as y,be as yn,Oo as yt,gv as z,tr as zt};