tla-ts 0.0.4 → 0.0.5

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 (378) hide show
  1. package/README.md +37 -126
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +366 -0
  5. package/dist/deciders.js +366 -0
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +46 -12
  8. package/dist/index.d.ts +46 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -4
  11. package/dist/parallel-worker.js +1 -4
  12. package/dist/prove-worker.cjs +9 -0
  13. package/dist/prove-worker.d.cts +9 -0
  14. package/dist/prove-worker.d.ts +9 -0
  15. package/dist/prove-worker.js +9 -0
  16. package/dist/prove.cjs +1006 -0
  17. package/dist/prove.js +1006 -0
  18. package/dist/run.cjs +45 -0
  19. package/dist/run.js +45 -0
  20. package/dist/tlapm.cjs +10 -0
  21. package/dist/tlapm.js +10 -0
  22. package/dist/transfer.cjs +76 -92
  23. package/dist/transfer.js +76 -92
  24. package/dist/worker.cjs +21 -0
  25. package/dist/worker.js +21 -0
  26. package/package.json +21 -12
  27. package/src/ast.ts +2 -2
  28. package/src/bags.ts +22 -23
  29. package/src/builtins.ts +16 -8
  30. package/src/check.ts +131 -1153
  31. package/src/{cli-options.ts → cli/options.ts} +54 -9
  32. package/src/cli/run.ts +63 -0
  33. package/src/cli/shared.ts +106 -0
  34. package/src/cli/tlapm.ts +374 -0
  35. package/src/{run-cli.ts → cli/tlc.ts} +115 -721
  36. package/src/cli/xml-exporter.ts +221 -0
  37. package/src/cli.ts +1 -1
  38. package/src/codegen.ts +43 -22
  39. package/src/config.ts +5 -5
  40. package/src/dependencies.ts +4 -6
  41. package/src/environment.ts +55 -60
  42. package/src/errors.ts +97 -35
  43. package/src/evaluate.ts +361 -181
  44. package/src/exit-codes.ts +1 -1
  45. package/src/fingerprints.ts +3 -3
  46. package/src/index.ts +10 -0
  47. package/src/instances.ts +56 -46
  48. package/src/java-overrides.ts +79 -41
  49. package/src/json.ts +31 -36
  50. package/src/levels.ts +10 -13
  51. package/src/{live-check.ts → liveness-checker.ts} +207 -141
  52. package/src/liveness.ts +38 -34
  53. package/src/{obligation-action.ts → obligations/action.ts} +248 -74
  54. package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
  55. package/src/obligations/equality.ts +260 -0
  56. package/src/obligations/expression.ts +618 -0
  57. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  58. package/src/obligations/generate.ts +457 -0
  59. package/src/{obligations.ts → obligations/index.ts} +46 -32
  60. package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
  61. package/src/obligations/module.ts +445 -0
  62. package/src/obligations/normalize.ts +554 -0
  63. package/src/obligations/operators.ts +176 -0
  64. package/src/obligations/pragma.ts +195 -0
  65. package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
  66. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  67. package/src/obligations/regroup.ts +100 -0
  68. package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
  69. package/src/{obligation-source.ts → obligations/source.ts} +172 -216
  70. package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
  71. package/src/obligations/substitution.ts +261 -0
  72. package/src/obligations/temporal.ts +321 -0
  73. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  74. package/src/parallel-worker.ts +39 -51
  75. package/src/parallel.ts +39 -66
  76. package/src/parser.ts +67 -74
  77. package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
  78. package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
  79. package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
  80. package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
  81. package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
  82. package/src/prover/decide-pool.ts +95 -0
  83. package/src/prover/deciders.ts +33 -0
  84. package/src/prover/first-order.ts +175 -0
  85. package/src/prover/isabelle/LICENSE +36 -0
  86. package/src/prover/isabelle/LICENSE-tlapm +26 -0
  87. package/src/prover/isabelle/decide.ts +44 -0
  88. package/src/prover/isabelle/encode.ts +445 -0
  89. package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
  90. package/src/prover/isabelle/isar/method.ts +367 -0
  91. package/src/prover/isabelle/isar/proof.ts +28 -0
  92. package/src/prover/isabelle/isar/statement.ts +57 -0
  93. package/src/prover/isabelle/isar/theory.ts +192 -0
  94. package/src/prover/isabelle/isar/type-check.ts +278 -0
  95. package/src/prover/isabelle/provers/blast/blast.ts +258 -0
  96. package/src/prover/isabelle/provers/blast/branch.ts +322 -0
  97. package/src/prover/isabelle/provers/blast/prove.ts +347 -0
  98. package/src/prover/isabelle/provers/blast/rules.ts +330 -0
  99. package/src/prover/isabelle/provers/blast/state.ts +180 -0
  100. package/src/prover/isabelle/provers/blast/term.ts +546 -0
  101. package/src/prover/isabelle/provers/clasimp.ts +150 -0
  102. package/src/prover/isabelle/provers/classical.ts +389 -0
  103. package/src/prover/isabelle/provers/hypsubst.ts +433 -0
  104. package/src/prover/isabelle/pure/bicompose.ts +174 -0
  105. package/src/prover/isabelle/pure/consts.ts +32 -0
  106. package/src/prover/isabelle/pure/conv.ts +79 -0
  107. package/src/prover/isabelle/pure/drule.ts +264 -0
  108. package/src/prover/isabelle/pure/envir.ts +331 -0
  109. package/src/prover/isabelle/pure/goal.ts +53 -0
  110. package/src/prover/isabelle/pure/interrupt.ts +16 -0
  111. package/src/prover/isabelle/pure/list.ts +12 -0
  112. package/src/prover/isabelle/pure/logic.ts +330 -0
  113. package/src/prover/isabelle/pure/name.ts +98 -0
  114. package/src/prover/isabelle/pure/net.ts +215 -0
  115. package/src/prover/isabelle/pure/object-logic.ts +41 -0
  116. package/src/prover/isabelle/pure/pattern.ts +631 -0
  117. package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
  118. package/src/prover/isabelle/pure/rewriter.ts +602 -0
  119. package/src/prover/isabelle/pure/search.ts +68 -0
  120. package/src/prover/isabelle/pure/seq.ts +133 -0
  121. package/src/prover/isabelle/pure/simplifier.ts +106 -0
  122. package/src/prover/isabelle/pure/table.ts +201 -0
  123. package/src/prover/isabelle/pure/tactic.ts +168 -0
  124. package/src/prover/isabelle/pure/tactical.ts +264 -0
  125. package/src/prover/isabelle/pure/term-ord.ts +105 -0
  126. package/src/prover/isabelle/pure/term.ts +688 -0
  127. package/src/prover/isabelle/pure/thm.ts +783 -0
  128. package/src/prover/isabelle/pure/type.ts +121 -0
  129. package/src/prover/isabelle/pure/unify.ts +753 -0
  130. package/src/prover/isabelle/pure/variable.ts +25 -0
  131. package/src/prover/isabelle/tla/classical-setup.ts +101 -0
  132. package/src/prover/isabelle/tla/context.ts +74 -0
  133. package/src/prover/isabelle/tla/logic-data.ts +5 -0
  134. package/src/prover/isabelle/tla/logic.ts +215 -0
  135. package/src/prover/isabelle/tla/simpdata.ts +241 -0
  136. package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
  137. package/src/prover/ocaml.ts +22 -0
  138. package/src/prover/prep/action.ts +508 -0
  139. package/src/prover/prep/enabled-axioms.ts +189 -0
  140. package/src/prover/prep/fingerprint.ts +388 -0
  141. package/src/prover/prep/level-comparison.ts +529 -0
  142. package/src/prover/prep/md5.ts +60 -0
  143. package/src/prover/prep/methods.ts +221 -0
  144. package/src/prover/prep/normalize.ts +309 -0
  145. package/src/prover/prove-worker.ts +22 -0
  146. package/src/prover/prove.ts +492 -0
  147. package/src/prover/ptl/decide.ts +68 -0
  148. package/src/prover/ptl/encode.ts +244 -0
  149. package/src/prover/ptl/sat.ts +151 -0
  150. package/src/prover/ptl/tableau.ts +276 -0
  151. package/src/prover/smt/axioms.ts +209 -0
  152. package/src/prover/smt/context.ts +108 -0
  153. package/src/prover/smt/data.ts +636 -0
  154. package/src/prover/smt/encode.ts +275 -0
  155. package/src/prover/smt/extensionality.ts +65 -0
  156. package/src/prover/smt/flatten.ts +112 -0
  157. package/src/prover/smt/format.ts +154 -0
  158. package/src/prover/smt/instances.ts +181 -0
  159. package/src/prover/smt/rewrite.ts +766 -0
  160. package/src/prover/smt/solver/act-cache.ts +265 -0
  161. package/src/prover/smt/solver/arith-rewriter.ts +962 -0
  162. package/src/prover/smt/solver/array.ts +22 -0
  163. package/src/prover/smt/solver/asserted-formulas.ts +469 -0
  164. package/src/prover/smt/solver/ast-lt.ts +157 -0
  165. package/src/prover/smt/solver/ast-util.ts +91 -0
  166. package/src/prover/smt/solver/ast.ts +1315 -0
  167. package/src/prover/smt/solver/auf-solver.ts +572 -0
  168. package/src/prover/smt/solver/case-split-queue.ts +178 -0
  169. package/src/prover/smt/solver/cg-table.ts +175 -0
  170. package/src/prover/smt/solver/clause.ts +276 -0
  171. package/src/prover/smt/solver/conflict-resolution.ts +343 -0
  172. package/src/prover/smt/solver/context.ts +1292 -0
  173. package/src/prover/smt/solver/ctx-simplify.ts +334 -0
  174. package/src/prover/smt/solver/der.ts +224 -0
  175. package/src/prover/smt/solver/dyn-ack.ts +141 -0
  176. package/src/prover/smt/solver/e-matching.ts +659 -0
  177. package/src/prover/smt/solver/enode.ts +259 -0
  178. package/src/prover/smt/solver/expr-ref.ts +21 -0
  179. package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
  180. package/src/prover/smt/solver/fingerprints.ts +92 -0
  181. package/src/prover/smt/solver/flat-literals.ts +51 -0
  182. package/src/prover/smt/solver/goal.ts +138 -0
  183. package/src/prover/smt/solver/hash.ts +173 -0
  184. package/src/prover/smt/solver/hashtable.ts +166 -0
  185. package/src/prover/smt/solver/internalizer.ts +1381 -0
  186. package/src/prover/smt/solver/lbool.ts +5 -0
  187. package/src/prover/smt/solver/literal.ts +24 -0
  188. package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
  189. package/src/prover/smt/solver/lp/constraints.ts +78 -0
  190. package/src/prover/smt/solver/lp/containers.ts +296 -0
  191. package/src/prover/smt/solver/lp/core-solver.ts +504 -0
  192. package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
  193. package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
  194. package/src/prover/smt/solver/lp/dependency.ts +51 -0
  195. package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
  196. package/src/prover/smt/solver/lp/explanation.ts +46 -0
  197. package/src/prover/smt/solver/lp/gomory.ts +255 -0
  198. package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
  199. package/src/prover/smt/solver/lp/hnf.ts +281 -0
  200. package/src/prover/smt/solver/lp/int-cube.ts +295 -0
  201. package/src/prover/smt/solver/lp/int-solver.ts +514 -0
  202. package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
  203. package/src/prover/smt/solver/lp/lar-term.ts +62 -0
  204. package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
  205. package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
  206. package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
  207. package/src/prover/smt/solver/lp/nex.ts +120 -0
  208. package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
  209. package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
  210. package/src/prover/smt/solver/lp/nla-core.ts +968 -0
  211. package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
  212. package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
  213. package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
  214. package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
  215. package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
  216. package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
  217. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  218. package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
  219. package/src/prover/smt/solver/lp/nla-order.ts +307 -0
  220. package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
  221. package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
  222. package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
  223. package/src/prover/smt/solver/lp/nla-types.ts +124 -0
  224. package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
  225. package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
  226. package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
  227. package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
  228. package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
  229. package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
  230. package/src/prover/smt/solver/lp/pdd.ts +971 -0
  231. package/src/prover/smt/solver/lp/random-updater.ts +138 -0
  232. package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
  233. package/src/prover/smt/solver/lp/union-find.ts +96 -0
  234. package/src/prover/smt/solver/mam-compiler.ts +847 -0
  235. package/src/prover/smt/solver/mam-interpreter.ts +400 -0
  236. package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
  237. package/src/prover/smt/solver/model-checker.ts +347 -0
  238. package/src/prover/smt/solver/model-evaluator.ts +262 -0
  239. package/src/prover/smt/solver/model-finder.ts +155 -0
  240. package/src/prover/smt/solver/model-generator.ts +97 -0
  241. package/src/prover/smt/solver/model-macro-solver.ts +728 -0
  242. package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
  243. package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
  244. package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
  245. package/src/prover/smt/solver/nlsat/explain.ts +607 -0
  246. package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
  247. package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
  248. package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
  249. package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
  250. package/src/prover/smt/solver/nlsat/solver.ts +911 -0
  251. package/src/prover/smt/solver/nlsat/types.ts +43 -0
  252. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  253. package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
  254. package/src/prover/smt/solver/nnf.ts +469 -0
  255. package/src/prover/smt/solver/pattern-inference.ts +351 -0
  256. package/src/prover/smt/solver/poly-rewriter.ts +477 -0
  257. package/src/prover/smt/solver/propagate-values.ts +83 -0
  258. package/src/prover/smt/solver/proto-model.ts +551 -0
  259. package/src/prover/smt/solver/pull-quant.ts +139 -0
  260. package/src/prover/smt/solver/qe-lite-der.ts +526 -0
  261. package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
  262. package/src/prover/smt/solver/qe-lite.ts +381 -0
  263. package/src/prover/smt/solver/qi-queue.ts +362 -0
  264. package/src/prover/smt/solver/quant-tactics.ts +117 -0
  265. package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
  266. package/src/prover/smt/solver/quantifier-manager.ts +186 -0
  267. package/src/prover/smt/solver/random-gen.ts +10 -0
  268. package/src/prover/smt/solver/rational.ts +165 -0
  269. package/src/prover/smt/solver/ref-vector.ts +62 -0
  270. package/src/prover/smt/solver/relevancy.ts +247 -0
  271. package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
  272. package/src/prover/smt/solver/rewriter.ts +843 -0
  273. package/src/prover/smt/solver/rlimit.ts +79 -0
  274. package/src/prover/smt/solver/smtlib-parser.ts +526 -0
  275. package/src/prover/smt/solver/solver.ts +71 -0
  276. package/src/prover/smt/solver/sort.ts +35 -0
  277. package/src/prover/smt/solver/sticky-generations.ts +69 -0
  278. package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
  279. package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
  280. package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
  281. package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
  282. package/src/prover/smt/solver/theory-lra-model.ts +243 -0
  283. package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
  284. package/src/prover/smt/solver/theory-lra-state.ts +43 -0
  285. package/src/prover/smt/solver/theory-lra.ts +56 -0
  286. package/src/prover/smt/solver/var-subst.ts +258 -0
  287. package/src/prover/smt/solver/z3-license.txt +10 -0
  288. package/src/prover/smt/table.ts +170 -0
  289. package/src/prover/tlapm/cache.ts +236 -0
  290. package/src/prover/tlapm/ocaml-marshal.ts +166 -0
  291. package/src/prover/tlapm/tlapm.ts +96 -0
  292. package/src/prover/tlaps-module.ts +510 -0
  293. package/src/prover/verdict.ts +13 -0
  294. package/src/prover/zenon/LICENSE +32 -0
  295. package/src/prover/zenon/check/check.ts +105 -0
  296. package/src/prover/zenon/check/definitions.ts +144 -0
  297. package/src/prover/zenon/check/equality.ts +182 -0
  298. package/src/prover/zenon/check/functions.ts +62 -0
  299. package/src/prover/zenon/check/keys.ts +125 -0
  300. package/src/prover/zenon/check/propositional.ts +104 -0
  301. package/src/prover/zenon/check/records.ts +188 -0
  302. package/src/prover/zenon/check/relations.ts +121 -0
  303. package/src/prover/zenon/check/rewrites.ts +224 -0
  304. package/src/prover/zenon/check/sets.ts +302 -0
  305. package/src/prover/zenon/check/terms.ts +127 -0
  306. package/src/prover/zenon/check/tla.ts +126 -0
  307. package/src/prover/zenon/decide.ts +107 -0
  308. package/src/prover/zenon/encode.ts +378 -0
  309. package/src/prover/zenon/eqrel.ts +300 -0
  310. package/src/prover/zenon/equality-rules.ts +435 -0
  311. package/src/prover/zenon/expr.ts +551 -0
  312. package/src/prover/zenon/index-table.ts +350 -0
  313. package/src/prover/zenon/isar-case.ts +513 -0
  314. package/src/prover/zenon/isar.ts +1249 -0
  315. package/src/prover/zenon/limits.ts +15 -0
  316. package/src/prover/zenon/llproof.ts +173 -0
  317. package/src/prover/zenon/mltoll.ts +1566 -0
  318. package/src/prover/zenon/node.ts +297 -0
  319. package/src/prover/zenon/ocaml.ts +169 -0
  320. package/src/prover/zenon/parse.ts +247 -0
  321. package/src/prover/zenon/phrase.ts +191 -0
  322. package/src/prover/zenon/proof.ts +198 -0
  323. package/src/prover/zenon/propositional-rules.ts +387 -0
  324. package/src/prover/zenon/rules.ts +94 -0
  325. package/src/prover/zenon/search.ts +288 -0
  326. package/src/prover/zenon/tla/functions.ts +151 -0
  327. package/src/prover/zenon/tla/llproof.ts +480 -0
  328. package/src/prover/zenon/tla/records.ts +225 -0
  329. package/src/prover/zenon/tla/rewrites.ts +447 -0
  330. package/src/prover/zenon/tla/sets.ts +304 -0
  331. package/src/prover/zenon/tla/terms.ts +162 -0
  332. package/src/prover/zenon/tla/tla.ts +506 -0
  333. package/src/randomization.ts +19 -24
  334. package/src/resolve.ts +15 -22
  335. package/src/runtime.ts +8 -8
  336. package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
  337. package/src/{sany-generator.ts → sany/generator.ts} +38 -55
  338. package/src/{sany-levels.ts → sany/levels.ts} +45 -48
  339. package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
  340. package/src/{sany-linter.ts → sany/linter.ts} +1 -1
  341. package/src/{sany-modules.ts → sany/modules.ts} +2 -2
  342. package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
  343. package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
  344. package/src/{sany-report.ts → sany/report.ts} +16 -17
  345. package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
  346. package/src/{sany-source.ts → sany/source.ts} +6 -7
  347. package/src/{sany-xml.ts → sany/xml.ts} +5 -6
  348. package/src/search.ts +969 -0
  349. package/src/spec-description.ts +26 -20
  350. package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
  351. package/src/standard-modules.ts +21 -22
  352. package/src/state-graph.ts +9 -8
  353. package/src/substitution-levels.ts +2 -2
  354. package/src/successors.ts +39 -23
  355. package/src/symmetry.ts +1 -1
  356. package/src/tableau.ts +6 -7
  357. package/src/tlc/fingerprint.ts +214 -0
  358. package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
  359. package/src/{tlc-order.ts → tlc/order.ts} +7 -7
  360. package/src/{tlc-random.ts → tlc/random.ts} +3 -190
  361. package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
  362. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
  363. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
  364. package/src/{tlc-version.ts → tlc/version.ts} +8 -7
  365. package/src/transfer.ts +32 -32
  366. package/src/values.ts +166 -111
  367. package/src/worker.ts +62 -0
  368. package/dist/parallel.cjs +0 -12
  369. package/dist/parallel.js +0 -12
  370. package/dist/run-cli.cjs +0 -55
  371. package/dist/run-cli.js +0 -55
  372. package/src/canonical.ts +0 -40
  373. package/src/obligation-expression.ts +0 -1060
  374. package/src/obligation-module.ts +0 -1042
  375. package/src/standard-ranges.ts +0 -116
  376. package/src/value-sources.ts +0 -29
  377. /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
  378. /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
package/dist/transfer.js CHANGED
@@ -6,78 +6,18 @@
6
6
  * This source code is licensed under the MIT license found in the
7
7
  * LICENSE file in the root directory of this source tree.
8
8
  */
9
- const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenessViolation:13,assertViolation:14,specEvaluationFailure:75,safetyEvaluationFailure:76,livenessEvaluationFailure:77,specParseError:150,configParseError:151,error:255},t=/* @__PURE__ */ new WeakMap,n=(e,n)=>(e instanceof Error&&!t.has(e)&&t.set(e,n),e),r=e=>t.get(e),i=t=>{try{return t()}catch(t){throw n(t,e.error)}},a=e=>{let t=i(e);return t&&{branches:t.branches,addInitialState:(e,n,r)=>i(()=>t.addInitialState(e,n,r)),addState:(e,n,r,a)=>i(()=>t.addState(e,n,r,a)),findViolation:()=>i(()=>t.findViolation()),getViolatedProperties:(e,n)=>i(()=>t.getViolatedProperties(e,n))}},o=e=>`TLC threw an unexpected exception.\nThis was probably caused by an error in the spec or model.\nSee the User Output or TLC Console for clues to what happened.\nThe exception was a ${e}\n: `,s=o(`java.lang.RuntimeException`),c=e=>e instanceof RangeError&&e.message===`Maximum call stack size exceeded`;var l=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},u=class extends l{failure;sany;constructor(e,t,n,r){super(e,t),this.name=`TlaSyntaxError`,this.failure=n,this.sany=r}},d=class extends u{location;parseError;constructor(e,t,n){super(e),this.location=t,this.parseError=n}},f=class extends d{constructor(e,t,n=!0){super(`Cannot find source file for module ${e} imported in module ${t}.`,n?t:void 0)}};const p=(e,t=!1,n,r=[])=>new u(e.map(e=>`${e.location}\n\n${e.message}`).join(`
10
-
11
- `),void 0,void 0,{errors:e,warnings:r,isFatal:t,parseError:n}),m=(e,t)=>p([{location:`In module ${t}`,message:`Cannot find source file for module ${e} imported in module ${t}.`}],!0),h=e=>`*** Warnings: ${e.length}\n\n${e.map(e=>`${e.location}\n\n${e.message}\n\n\n`).join(`
12
- `)}`,g=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,_=(e,t)=>p([{location:g(t),message:e}]);var v=class extends l{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},y=class extends l{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}};const b=`This was a Java StackOverflowError. It was probably the result
13
- of an incorrect recursive function definition that caused TLC to enter
14
- an infinite loop when trying to compute the function or its application
15
- to an element in its putative domain.`;var x=class extends y{constructor(){super(b)}},ee=class extends y{state;action;variables;constructor(e,t,n,r){super(e),this.state=t,this.action=n,this.variables=r}},te=class extends y{variable;constructor(e,t){super(e),this.variable=t}},S=class extends y{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},ne=class extends y{state;constructor(e){super(`current state is not a legal state`),this.name=`TlaEvaluationError`,this.state=e}},re=class extends l{failure;exception;constructor(e,t={}){super(e),this.name=`TlaProofError`,this.failure=t.exception===void 0?t.failure??e:void 0,this.exception=t.exception??`Failure(${JSON.stringify(this.failure)})`}},ie=class extends re{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},C=class extends l{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}},ae=class extends C{unwound;constructor(e,t){super(e),this.name=`TlaJavaException`,this.unwound=t}};const oe=t=>r(t)??(t instanceof u?e.specParseError:t instanceof v?e.configParseError:t instanceof y?e.specEvaluationFailure:e.error);var se=class extends l{node;constructor(e,t){super(e),this.name=`PcalError`,this.node=t}},w=class extends l{constructor(e){super(e),this.name=`PcalRuntimeError`}},T=class extends l{constructor(e){super(`You have discovered a bug in pcal.trans.\nSend the following information and the\ninput file to the current maintainer(s).\n\n -- ${e}.`),this.name=`PcalBugError`}};const E=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),D=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),ce=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),le=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),ue=/* @__PURE__ */ new Map([[`∃`,`\\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`]]),de=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,fe=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),pe=e=>e.startsWith(`\\`)?parseInt(e.slice(2),fe.get(e[1].toLowerCase())):Number(e),me=/-{4,}[ \t]*MODULE\b/,he=e=>/[A-Za-z0-9_]/.test(e),O=(e,t)=>{let n=e[t];if(n===`\\`&&/[A-Za-z]/.test(e[t+1]??``)){let n=/^[A-Za-z]+/.exec(e.slice(t+1))?.[0]??``,r={value:n.length};for(;r.value>0&&!D.has(n.slice(0,r.value));)r.value--;let i=D.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=[e.slice(t,t+2),n].find(e=>ue.has(e));if(r!==void 0)return{text:ue.get(r)??``,length:r.length};let i=le.find(n=>e.startsWith(n,t));return i?{text:ce.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},ge=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),_e=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>ue.has(e)||ge.has(e));return n===void 0?void 0:{text:n,length:n.length}},ve=e=>e!==void 0&&e>=`0`&&e<=`9`,ye=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},be=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:ye(e,t+1,ve);if(n===t+1||e[n]!==`>`)return 0;let r=ye(e,n+1,he),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return ye(e,i?r+1:r,e=>e===`.`)-t},xe=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,Se=(e,t)=>t===` `?e+8-e%8:e+1,Ce=e=>{let t=me.exec(e);if(!t)throw new u(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
16
- `),a={index:t.index,line:i.length,lineStart:t.index-i[i.length-1].length,moduleDepth:0},o={lineStart:-1,position:0,width:0},s=()=>{for((o.lineStart!==a.lineStart||o.position>a.index)&&(o.lineStart=a.lineStart,o.position=a.lineStart,o.width=0);o.position<a.index;o.position++)o.width=Se(o.width,e[o.position]);return Se(o.width,e[a.index])},c=(e,t,r,i)=>{let o=s();n.push({kind:e,text:t,spelling:i,line:a.line,column:o,endColumn:o+r-1}),a.index+=r},l=t=>{for(let n=0;n<t;n++)e[a.index]===`
17
- `&&(a.line++,a.lineStart=a.index+1),a.index++},d=t=>new u(`${t} at line ${a.line}, column ${s()}`,void 0,{reason:t,line:a.line,column:s(),isEnd:a.index>=e.length});for(;a.index<e.length;){let t=e[a.index];if(t===`
18
- `||t===` `||t===` `||t===`\r`){l(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
19
- `,a.index);l((t===-1?e.length:t)-a.index);continue}if(e.startsWith(`(*`,a.index)){let t={value:0};do{if(a.index>=e.length)throw d(`Unterminated comment`);e.startsWith(`(*`,a.index)?(t.value++,l(2)):e.startsWith(`*)`,a.index)?(t.value--,l(2)):l(1)}while(t.value>0);continue}if(e.startsWith(`----`,a.index)){let t=ye(e,a.index,e=>e===`-`)-a.index;e.slice(a.index+t).trimStart().startsWith(`MODULE`)&&a.moduleDepth++,c(`Separator`,`----`,t);continue}if(e.startsWith(`====`,a.index)){if(c(`ModuleEnd`,`====`,ye(e,a.index,e=>e===`=`)-a.index),a.moduleDepth--,a.moduleDepth<=0)break;continue}if(t===`"`){let t=a.line,r=s(),i=[];for(l(1);e[a.index]!==`"`;){if(a.index>=e.length||`
20
- \r`.includes(e[a.index]))throw d(`Unterminated string`);if(e[a.index]===`\\`){let t=e[a.index+1];if(t===void 0||!`ntrf\\"`.includes(t))throw d(`Invalid escape in string`);i.push({n:`
21
- `,t:` `,r:`\r`,f:`\f`}[t]??t),l(2)}else i.push(e[a.index]),l(1)}l(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=de.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(he(t)){let t=e.slice(a.index,ye(e,a.index,he));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(a.index))?.[0]??t;c(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}let n=/^(_|\d+)/.exec(t)?.[0];if(n!==void 0&&!/[A-Za-z]/.test(t)){c(n===`_`?`Operator`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){c(`Keyword`,t.slice(0,3),3);continue}let i=r.get(t)??t;r.set(i,i),c(E.has(t)?`Keyword`:`Identifier`,i,t.length);continue}if(`ℕℤℝ`.includes(t)){c(`Identifier`,r.get(t)??t,1),r.set(t,t);continue}let o=be(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let u=O(e,a.index);if(u){let t=e.slice(a.index,a.index+u.length);c(`Operator`,u.text,u.length,t===u.text?void 0:t)}else throw d(`Unexpected character ${JSON.stringify(t)}`)}let f=s();return n.push({kind:`End`,text:``,line:a.line,column:f,endColumn:f}),n},we=[[`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`]],k=we.map(e=>e[0]),Te=new Map(k.map((e,t)=>[e,t]).reverse()),A=e=>{let t=Te.get(e);if(t===void 0)throw new l(`Unknown SANY token kind ${e}`);return t},Ee=new Map(we.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),De=Math.max(...[...Ee.keys()].map(e=>e.length)),Oe=Array.from({length:De},(e,t)=>De-t),ke=/----+ *MODULE/y,Ae=[/_\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],je=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`)),Me=je(String.raw`\.\/\\`),Ne=je(String.raw`\.\\\/`),Pe=String.raw`<(?:[0-9]+|\+|\*)>`,Fe=[[`_BM0`,[ke]],[`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`,Me],[`BOR`,Ne],[`IDENTIFIER`,Ae],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Pe}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Pe,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Pe}(?:\*\.*|-\.*|\.+)`,`y`)]]],Ie=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[ke]]],Le=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[ke]],[`BAND`,Me],[`BOR`,Ne],[`IDENTIFIER`,Ae]],j=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Re=(e,t,n)=>e.map(([e,r])=>({kind:A(e),length:Math.max(...r.map(e=>j(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),ze=(e,t)=>{let n=Oe.find(n=>Ee.has(e.slice(t,t+n))),r=Re(Fe,e,t);if(n===void 0)return r;let i={kind:Ee.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},Be=e=>e+8-e%8,Ve=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
9
+ import{B as e,D as t,E as n,F as r,G as i,H as a,I as o,L as s,M as c,N as l,O as u,P as d,R as f,S as p,U as m,_ as ee,g as h,h as te,k as g,l as _,m as v,v as y,z as ne}from"./worker.js";const re=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),ie=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),ae=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),oe=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),se=/* @__PURE__ */ new Map([[`∃`,`\\E`],[`∀`,`\\A`],[`∷`,`::`],[`≜`,`==`],[`⟨`,`<<`],[`⟩_`,`>>_`],[`⟩`,`>>`],[`→`,`->`],[`←`,`<-`],[`↦`,`|->`],[`⁺`,`^+`],[`¬`,`~`],[`□`,`[]`],[`◇`,`<>`],[`∧`,`/\\`],[`∨`,`\\/`],[`∈`,`\\in`],[`≈`,`\\approx`],[`≔`,`:=`],[`≍`,`\\asymp`],[`◯`,`\\bigcirc`],[`⩴`,`::=`],[`●`,`\\bullet`],[`∩`,`\\cap`],[`⋅`,`\\cdot`],[`∘`,`\\o`],[`≅`,`\\cong`],[`∪`,`\\cup`],[`÷`,`\\div`],[`≐`,`\\doteq`],[`‥`,`..`],[`…`,`...`],[`≡`,`<=>`],[`‼`,`!!`],[`≥`,`>=`],[`≫`,`\\gg`],[`⇔`,`<=>`],[`⇒`,`=>`],[`⫤`,`=|`],[`↝`,`~>`],[`≤`,`<=`],[`≪`,`\\ll`],[`⊣`,`-|`],[`≠`,`#`],[`∉`,`\\notin`],[`⊙`,`\\odot`],[`⊖`,`\\ominus`],[`⊕`,`\\oplus`],[`⊘`,`\\oslash`],[`⊗`,`\\otimes`],[`⇸`,`-+->`],[`≺`,`\\prec`],[`⪯`,`\\preceq`],[`∝`,`\\propto`],[`⁇`,`??`],[`⊨`,`|=`],[`⊢`,`|-`],[`∼`,`\\sim`],[`≃`,`\\simeq`],[`⊓`,`\\sqcap`],[`⊔`,`\\sqcup`],[`⊏`,`\\sqsubset`],[`⊑`,`\\sqsubseteq`],[`⊐`,`\\sqsupset`],[`⊒`,`\\sqsupseteq`],[`⋆`,`\\star`],[`⊂`,`\\subset`],[`⊆`,`\\subseteq`],[`≻`,`\\succ`],[`⪰`,`\\succeq`],[`⊃`,`\\supset`],[`⊇`,`\\supseteq`],[`×`,`\\X`],[`⊎`,`\\uplus`],[`‖`,`||`],[`≀`,`\\wr`]]),ce=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,le=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),ue=e=>e.startsWith(`\\`)?parseInt(e.slice(2),le.get(e[1].toLowerCase())):Number(e),de=/-{4,}[ \t]*MODULE\b/,fe=e=>/[A-Za-z0-9_]/.test(e),b=(e,t)=>{let n=e[t];if(n===`\\`&&/[A-Za-z]/.test(e[t+1]??``)){let n=/^[A-Za-z]+/.exec(e.slice(t+1))?.[0]??``,r={value:n.length};for(;r.value>0&&!ie.has(n.slice(0,r.value));)r.value--;let i=ie.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=[e.slice(t,t+2),n].find(e=>se.has(e));if(r!==void 0)return{text:se.get(r)??``,length:r.length};let i=oe.find(n=>e.startsWith(n,t));return i?{text:ae.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},x=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),S=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>se.has(e)||x.has(e));return n===void 0?void 0:{text:n,length:n.length}},C=e=>e!==void 0&&e>=`0`&&e<=`9`,w=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},pe=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:w(e,t+1,C);if(n===t+1||e[n]!==`>`)return 0;let r=w(e,n+1,fe),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return w(e,i?r+1:r,e=>e===`.`)-t},me=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,he=(e,t)=>t===` `?e+8-e%8:e+1,ge=e=>{let n=de.exec(e);if(!n)throw new t(`Expected a module header such as ---- MODULE Name ----`);let r=[],i=/* @__PURE__ */ new Map,a=e.slice(0,n.index).split(`
10
+ `),o={index:n.index,line:a.length,lineStart:n.index-a[a.length-1].length,moduleDepth:0},s={lineStart:-1,position:0,width:0},c=()=>{for((s.lineStart!==o.lineStart||s.position>o.index)&&(s.lineStart=o.lineStart,s.position=o.lineStart,s.width=0);s.position<o.index;s.position++)s.width=he(s.width,e[s.position]);return he(s.width,e[o.index])},l=(e,t,n,i)=>{let a=c();r.push({kind:e,text:t,spelling:i,line:o.line,column:a,endColumn:a+n-1}),o.index+=n},u=t=>{for(let n=0;n<t;n++)e[o.index]===`
11
+ `&&(o.line++,o.lineStart=o.index+1),o.index++},d=n=>new t(`${n} at line ${o.line}, column ${c()}`,void 0,{reason:n,line:o.line,column:c(),isEnd:o.index>=e.length});for(;o.index<e.length;){let t=e[o.index];if(t===`
12
+ `||t===` `||t===` `||t===`\r`){u(1);continue}if(e.startsWith(`\\*`,o.index)){let t=e.indexOf(`
13
+ `,o.index);u((t===-1?e.length:t)-o.index);continue}if(e.startsWith(`(*`,o.index)){let t={value:0};do{if(o.index>=e.length)throw d(`Unterminated comment`);e.startsWith(`(*`,o.index)?(t.value++,u(2)):e.startsWith(`*)`,o.index)?(t.value--,u(2)):u(1)}while(t.value>0);continue}if(e.startsWith(`----`,o.index)){let t=w(e,o.index,e=>e===`-`)-o.index;e.slice(o.index+t).trimStart().startsWith(`MODULE`)&&o.moduleDepth++,l(`Separator`,`----`,t);continue}if(e.startsWith(`====`,o.index)){if(l(`ModuleEnd`,`====`,w(e,o.index,e=>e===`=`)-o.index),o.moduleDepth--,o.moduleDepth<=0)break;continue}if(t===`"`){let t=o.line,n=c(),i=[];for(u(1);e[o.index]!==`"`;){if(o.index>=e.length||`
14
+ \r`.includes(e[o.index]))throw d(`Unterminated string`);if(e[o.index]===`\\`){let t=e[o.index+1];if(t===void 0||!`ntrf\\"`.includes(t))throw d(`Invalid escape in string`);i.push({n:`
15
+ `,t:` `,r:`\r`,f:`\f`}[t]??t),u(2)}else i.push(e[o.index]),u(1)}u(1),r.push({kind:`String`,text:i.join(``),line:t,column:n,endColumn:c()-1});continue}let n=ce.exec(e.slice(o.index,o.index+64));if(n){l(`Number`,n[0],n[0].length);continue}if(fe(t)){let t=e.slice(o.index,w(e,o.index,fe));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(o.index))?.[0]??t;l(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}let n=/^(_|\d+)/.exec(t)?.[0];if(n!==void 0&&!/[A-Za-z]/.test(t)){l(n===`_`?`Operator`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){l(`Keyword`,t.slice(0,3),3);continue}let r=i.get(t)??t;i.set(r,r),l(re.has(t)?`Keyword`:`Identifier`,r,t.length);continue}if(`ℕℤℝ`.includes(t)){l(`Identifier`,i.get(t)??t,1),i.set(t,t);continue}let a=pe(e,o.index);if(a>0){l(`Step`,e.slice(o.index,o.index+a),a);continue}let s=b(e,o.index);if(s){let t=e.slice(o.index,o.index+s.length);l(`Operator`,s.text,s.length,t===s.text?void 0:t)}else throw d(`Unexpected character ${JSON.stringify(t)}`)}let f=c();return r.push({kind:`End`,text:``,line:o.line,column:f,endColumn:f}),r},_e=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],ve=_e.map(e=>e[0]),ye=new Map(ve.map((e,t)=>[e,t]).reverse()),T=e=>{let t=ye.get(e);if(t===void 0)throw new te(`Unknown SANY token kind ${e}`);return t},E=new Map(_e.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),be=Math.max(...[...E.keys()].map(e=>e.length)),xe=Array.from({length:be},(e,t)=>be-t),Se=/----+ *MODULE/y,Ce=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],we=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),Te=we(String.raw`\.\/\\`),Ee=we(String.raw`\.\\\/`),De=String.raw`<(?:[0-9]+|\+|\*)>`,Oe=[[`_BM0`,[Se]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,Te],[`BOR`,Ee],[`IDENTIFIER`,Ce],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${De}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(De,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${De}(?:\*\.*|-\.*|\.+)`,`y`)]]],ke=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[Se]]],Ae=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[Se]],[`BAND`,Te],[`BOR`,Ee],[`IDENTIFIER`,Ce]],je=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Me=(e,t,n)=>e.map(([e,r])=>({kind:T(e),length:Math.max(...r.map(e=>je(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),Ne=(e,t)=>{let n=xe.find(n=>E.has(e.slice(t,t+n))),r=Me(Oe,e,t);if(n===void 0)return r;let i={kind:E.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},Pe=e=>e+8-e%8,Fe=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
22
16
  `?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
23
- `?r.isAfterLf=!0:i===` `&&(r.column=Be(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},He=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Ue=new Set([...Ee.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),We=(e,t)=>{let n=0;for(;Ue.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,j(He,e,t)))},Ge=e=>{let t=Ve(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(A(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?Je(o,s,e[a],i):t.lines[n]===o?e[a]===`
24
- `||e[a]===`\r`?Je(o+1,0,void 0,i):Je(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=Re(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,k[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),k[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(Ie);if(n.mode===`PRAGMA`)return s(Le);for(;n.offset<e.length;){let t=n.offset;if(`
25
- \r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=ze(e,t);if(i.length===0){let n=We(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},Ke=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
26
- `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),qe=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Ke.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Je=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${qe(n)}" (${n.charCodeAt(0)}), `}after : "${qe(r)}"`,Ye=e=>{let t=Ge(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===` `?Be(e):e+1,e.beginColumn);return Je(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Xe=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],Ze=/* @__PURE__ */ new Set([...Xe,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),Qe=[`TYPE`,`TYPE_CONSTRAINT`],$e=/* @__PURE__ */ new Set([...Xe,...Qe]),et=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],tt=e=>{let t=[],n={index:0,line:1,lineStart:0},r=(r,i)=>{t.push({kind:`Error`,text:Je(n.line,r-n.lineStart+1,e[r],i),line:n.line})},i=e=>{t.push({kind:`Error`,text:Je(n.line+1,0,void 0,e),line:n.line})},a=e=>{let t=e.split(`
27
- `);t.length>1&&(n.line+=t.length-1,n.lineStart=n.index+e.length-t[t.length-1].length),n.index+=e.length};for(;n.index<e.length;){let o=e.slice(n.index),s=/^\s+/.exec(o)?.[0];if(s){a(s);continue}if(o.startsWith(`\\*`)){let e=o.indexOf(`
28
- `);a(e===-1?o:o.slice(0,e));continue}if(o.startsWith(`(*`)){let e=o.indexOf(`*)`);if(e===-1)return a(o),i(``),t;a(o.slice(0,e+2));continue}let c=n.line,l=/^\d+(?![A-Za-z_])/.exec(o)?.[0];if(l){t.push({kind:`Number`,text:l,line:c}),a(l);continue}let u=/^[A-Za-z0-9_]+/.exec(o)?.[0];if(u){t.push({kind:`Word`,text:u,line:c}),a(u);continue}if(o.startsWith(`"`)){let s=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(o),l=s?.[0]??`"`;if(s?.[2]!==`"`)return a(l),n.index===e.length?i(`${l}\n`):r(n.index,l),t;t.push({kind:`String`,text:s[1],line:c}),a(l);continue}let d=et.find(e=>o.startsWith(e));if(d){t.push({kind:`Symbol`,text:d,line:c}),a(d);continue}let f=_e(e,n.index)??O(e,n.index);if(!f)return r(n.index,``),t;t.push({kind:`Word`,text:f.text,line:c}),a(e.slice(n.index,n.index+f.length))}return t.push({kind:`End`,text:``,line:n.line}),t},nt=(e,t)=>new v(`TLC found an error in the configuration file at line ${e}\n${t}`),rt=(e,t)=>nt(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`]]),it=/* @__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`]]),at=(e,t=`master`)=>{let n=t===`1.7.4`?$e:Ze,r=tt(e),i={index:0},a={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},o={isSet:!1},s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i.index++,r.length-1)];if(e.kind===`Error`)throw new v(`TLC found an error in the configuration file:\n${e.text}`);return e},l=e=>{if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t={token:c()};if(t.token.text!==`}`)for(;e.push(l(t.token)),t.token=c(),t.token.text===`,`;)t.token=c();if(t.token.text!==`}`)throw nt(t.token.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw nt(e.line,`It was expecting a value, but did not find it.`)},u=e=>{let t=c();if(t.kind===`End`)throw nt(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw nt(n.line,`It was expecting ], but did not find it.`);return t.text},d=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let r={token:c(),name:t.text};for(;r.token.text===`!`;)r.name=`${r.name}!${c().text}`,r.token=c();let i=r.name;if(r.token.text===`<-`){if(r.token=c(),r.token.text===`[`){let e=u(`<-`),t=c();if(t.kind===`End`)throw nt(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:i,target:t.text,module:e});continue}if(r.token.kind===`End`)throw nt(r.token.line,`Expected an identifier after <-.`);a.substitutions.push({name:i,target:r.token.text});continue}let o=[],s=r.token.text===`(`;if(s){for(;o.push(l(c())),r.token=c(),r.token.text===`,`;);if(r.token.text!==`)`)throw nt(e,``);r.token=c()}if(r.token.text!==`=`)throw nt(r.token.line,`It was expecting = or <-, but did not find it.`);r.token=c();let d=r.token.text===`[`?u(`=`):void 0,f=l(d===void 0?r.token:c());a.constants.push({name:i,value:f,...s&&{args:o},...d!==void 0&&{module:d}})}},f=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},p={token:c()};for(;p.token.kind!==`End`;){let e=p.token.text,t=p.token.line,r=n.has(e)?M.get(e):void 0,i=n.has(e)?it.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw nt(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 rt(t,e);a[r]=n.text,p.token=c()}else if(i!==void 0)p.token=f(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)p.token=d(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw nt(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o.isSet)throw rt(t,e);o.isSet=!0,a.checkDeadlock=n.text===`TRUE`,p.token=c()}else{if(!n.has(e)||!Qe.includes(e))throw nt(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw rt(t,e);s.add(e),p.token=c()}}return a},ot={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:` `}},st=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},ct=e=>e!==void 0&&/^\p{Nd}$/u.test(e),lt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),ut=e=>{let t=t=>{let n=ye(e,t,st);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=ye(e,t,ct);if(e.startsWith(`..`,n)&&ct(e[n+2]))return{kind:`Constant`,first:t,last:ye(e,n+2,ct)-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=ct(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,ct)-1,children:[]};if(lt(n))return{kind:`Constant`,first:t,last:ye(e,t,lt)-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)},dt=e=>{let t=e.length===0?void 0:ut(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=ot[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},N=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,ft=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),P=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),F=e=>typeof e==`object`&&e.kind===`ModelValue`,pt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:N(e)?`set`:`function`,mt=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new S(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ht={isUsed:!1},gt=(e,t)=>(ht.isUsed=!0,e.writtenKeys=t,e),_t=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Sr(e.domain,t)]]),vt=(e,t,n)=>gt(tn(e,t),n),yt=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(yt);e.writtenKeys=void 0,e.range.forEach(yt)}},bt=e=>e.every(e=>typeof e==`string`),xt=(e,t)=>e.length>0&&t.length>0&&bt(e)!==bt(t),St=(e,t)=>{ht.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return xt(n,r)?Cn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=zt(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=zt(i[e],a[e]);if(t!==0)return t}return 0},Ct=(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=zt(n[e],r[e]);if(t!==0)return t}return 0},wt=e=>F(e)?e.type:void 0,Tt=(e,t,n)=>{let r=wt(e),i=wt(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(F(e)&&F(t)){if(r===void 0||i===void 0||r===i)return;throw new y(`Attempted to ${a} the differently-typed model values ${z(e)} and ${z(t)}`)}throw r===void 0?new y(`Attempted to ${a} the typed model value ${z(t)} and the non-model value\n${z(e)}`):new y(`Attempted to ${a}${n?``:` the`} typed model value ${z(e)} and non-model value\n${z(t)}`)},Et={ranks:Object.create(null),size:0},Dt=e=>{Et.ranks=Object.create(null),Et.size=0,Bt.clear();for(let t of e)At(t)},Ot={is174:!1},kt=e=>{Ot.is174=e===`1.7.4`},At=e=>(Et.ranks[e]===void 0&&(Et.ranks[e]=Et.size++),e),jt=()=>Et.size,Mt=e=>Et.ranks[At(e)],Nt=(e,t)=>{if(e===t)return 0;let n=Et.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Pt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Ft=(e,t)=>(Pt(e)||Pt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),It=(e,t,n)=>{if(!Pt(e))throw new y(`Attempted to ${n} the set ${z(I(e)?L(e):e,!0)} with the value:\n${z(t,!0)}`);if(!Pt(t))throw new y(`Attempted to compare overridden value ${z(e,!0)} with non-overridden value:\n${z(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new y(`Attempted to compare ${z(e,!0)} with the value\n${z(t,!0)}`)},Lt={kind:`InfiniteSet`,name:`Any`},Rt=e=>{throw new y(`Attempted to compare ANY with the value\n${z(e)}`)},zt=(e,t)=>{if(e===t)return ht.isUsed&&yt(e),e===Lt?Rt(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return St(e,t);if(n===`Set`&&r===`Set`)return Ct(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&&Tt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Tt(e,t,!1),n===`ModelValue`?-1:1;if(e===Lt||t===Lt)return Rt(e===Lt?t:e);if(N(e)&&N(t)&&Ft(e,t))return It(e,t,`compare`);let i=N(e);if(i!==N(t))throw new y(`Attempted to compare ${pt(e)} ${z(e)} with ${pt(t)} ${z(t)}`);return i?Ct(L(e),L(t)):St(Ar(e),Ar(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Nt(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Tt(e,t,!1),F(e))return-1;if(F(t))return 1;throw new y(`Attempted to compare ${pt(e)} ${z(e)} with ${pt(t)} ${z(t)}`)},Bt=/* @__PURE__ */ new Map,Vt=e=>{let t=Bt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Mt(e)};return Bt.set(e,n),n},Ht=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),Ut=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0}),Wt={isPresent:!1},Gt=(e,t)=>(t===`lambda`&&(Wt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Kt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,qt=e=>Gt(e,`lambda`),Jt=/* @__PURE__ */ new WeakSet,Yt=/* @__PURE__ */ new WeakSet,Xt={isPresent:!1},Zt=e=>(Xt.isPresent=!0,e),Qt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),$t=e=>{Xt.isPresent&&typeof e==`object`&&Qt.has(e.kind)&&Yt.add(e)},en=e=>{!Wt.isPresent&&!Xt.isPresent||typeof e!=`object`||Jt.has(e)||(Jt.add(e),e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(en),e.range.forEach(en)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(en):N(e)&&I(e)&&($t(e),L(e).elements.forEach(en)))},tn=(e,t)=>Gt(Ut(e,t),`record`),nn=(e,t)=>{if($t(e),e===t)return ht.isUsed&&yt(e),e!==Lt||Rt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Tt(e,t,!0),zt(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return St(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Ct(e,t)===0;if(F(e)||F(t))return Tt(e,t,!0),F(e)&&F(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return nn(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=R(e.domain),r=R(t.domain);if(n||r)return n===r;let i=R(e.range),a=R(t.range);return i||a?i===a:nn(e.domain,t.domain)&&nn(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(R(e))return R(t);if(R(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]&&nn(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return R(e)?R(t):!R(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>nn(e,t.factors[n]));let n=N(e)&&N(t)&&!(I(e)&&I(t));if(n&&Ft(e,t))return It(e,t,`check equality of`)===0;if(n){if(!Pt(e)){let n=L(e);if(!Pt(t))return Ct(n,L(t))===0}return oi(e)===oi(t)}return zt(e,t)===0},rn=e=>{let t=(e,t)=>e===t||e.length===t.length&&e.every((e,r)=>n(e,t[r])),n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):oi(n)===oi(r);return n},an=rn(!1),on=rn(!0),sn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},cn=e=>{if(!P(e))return;let t=Ar(e);return{domain:t.domain,range:t.range,low:sn(t.domain)}},ln=e=>{if(!P(e))return;let t=Ar(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},un=(e,t)=>{if(wt(e)!==void 0)throw new y(`Attempted to compare the typed model value ${z(e)} and the non-model value\n${z(t)}`);return 1},dn=(e,t)=>{if(wt(e)!==void 0)throw new y(`Attempted to check equality of the typed model value ${z(e)} and the non-model value\n${z(t)}`);return!1},fn=(e,t)=>{let n=wt(e);if(n===void 0)return F(t)?e.rank-t.rank:-1;if(!F(t))throw new y(`Attempted to compare the typed model value ${z(e)} and non-model value\n${z(t)}`);let r=wt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to compare the differently-typed model values ${z(e)} and ${z(t)}`);return e.rank-t.rank},pn=(e,t)=>{let n=wt(e);if(n===void 0)return F(t)&&e.name===t.name;if(!F(t))throw new y(`Attempted to check equality of typed model value ${z(e)} and non-model value\n${z(t)}`);let r=wt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to check equality of the differently-typed model values ${z(e)} and ${z(t)}`);return e.name===t.name},mn={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`}},hn=(e,t,n)=>{let r=mn[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${z(e)} with ${r.other}:\n${z(t)}`},gn=(e,t,n)=>{let r=cn(n);if(!r){if(F(n))return un(n,t);throw new y(`Attempted to compare the function ${z(t)} with the value:\n${z(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>_n(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return _n(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new y(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${z(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},_n=(e,t)=>{for(let n=0;n<e.length;n++){let r=Cn(e[n],t[n]);if(r!==0)return r}return 0},vn=(e,t)=>{let n=Ar(e);if(e.kind===`Function`&&Cr(n)!==void 0){let r=P(t)?Cr(t):void 0;return r?n.range.length-r.length||_n(n.range,r):gn({...n,low:1},e,t)}if(Kt(e)===`record`){let r=ln(t);if(!r){if(F(t))return un(t,e);throw new y(`Attempted to compare record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length-r.domain.length||_n(n.domain,r.domain)||_n(n.range,r.range)}return gn({...n,low:sn(n.domain)},e,t)},yn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),bn=(e,t)=>Pt(e)||Pt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),xn=(e,t)=>{let n=yn(t)?t:L(t);return{elements:L(e).elements,otherElements:L(n).elements}},Sn=(e,t)=>{if(bn(e,t))return zt(e,t);if(!yn(e))return Sn(L(e),t);if(!N(t)){if(F(t))return un(t,e);throw new y(`Attempted to compare the set ${z(e)} with the value:\n${z(t)}`)}let n=xn(e,t);return n.elements.length-n.otherElements.length||_n(n.elements,n.otherElements)},Cn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return zt(e,t);if(F(t))return un(t,e);throw new y(hn(e,t,!1))}return e.kind===`ModelValue`?fn(e,t):P(e)?vn(e,t):Sn(e,t)},wn=(e,t)=>e.every((e,n)=>On(e,t[n])),Tn=(e,t,n)=>{let r=cn(n);if(!r){if(F(n))return dn(n,t);throw new y(`Attempted to check equality of the function ${z(t)} with the value:\n${z(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&wn(e.range,r.range);let i=e.low??r.low;return i===void 0?wn(e.domain,r.domain)&&wn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new y(`Attempted to compare an integer with non-integer:\n${z(e)}.`);return e===i+t})&&wn(e.range,r.range)},En=(e,t)=>{let n=Ar(e);if(e.kind===`Function`&&Cr(n)!==void 0){let r=P(t)?Cr(t):void 0;return r?n.range.length===r.length&&wn(n.range,r):Tn({...n,low:1},e,t)}if(Kt(e)===`record`){let r=ln(t);if(!r){if(F(t))return dn(t,e);throw new y(`Attempted to check equality of record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length===r.domain.length&&wn(n.domain,r.domain)&&wn(n.range,r.range)}return Tn({...n,low:sn(n.domain)},e,t)},Dn=(e,t)=>{if(bn(e,t))return nn(e,t);if(!yn(e))return Dn(L(e),t);if(!N(t)){if(F(t))return dn(t,e);throw new y(`Attempted to check equality of the set ${z(e)} with the value:\n${z(t)}`)}let n=xn(e,t);return n.elements.length===n.otherElements.length&&wn(n.elements,n.otherElements)},On=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(F(t))return dn(t,e);throw new y(hn(e,t,!0))}return e.kind===`ModelValue`?pn(e,t):P(e)?En(e,t):Dn(e,t)},kn=e=>{let t=[];for(let n of e){let e=jn(n,t);e.isFound||t.splice(e.index,0,n)}return t},An=(e,t)=>{let n=Tr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},jn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=An(e,()=>Cn(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},Mn=(e,t)=>t.some(t=>An(t,()=>On(t,e))),Nn=/* @__PURE__ */ new WeakSet,Pn=e=>{typeof e==`object`&&(e.kind===`Set`&&(Nn.add(e),e.elements.forEach(Pn)),e.kind===`Function`&&(e.domain.forEach(Pn),e.range.forEach(Pn)))},Fn=(e,t)=>Er(()=>nn(e,t),()=>On(e,t)),In=e=>{for(let t=1;t<e.length;t++)if(zt(e[t-1],e[t])>=0)return!1;return!0},Ln=e=>{for(let t=1;t<e.length;t++)$t(e[t]);if(e.length<2||In(e))return Ht(e);let t=[...e].sort(zt),n=[t[0]];for(let e=1;e<t.length;e++)zt(n[n.length-1],t[e])!==0&&n.push(t[e]);return Ht(n)},Rn=e=>Er(()=>Ln(e),()=>({kind:`MixedSet`,elements:e})),zn=Ht([]),Bn=(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&&zt(r[a],t)<0;)a++;a<r.length&&zt(r[a],t)===0||i.push(t)}return i.length===n.length?e:Ht(i)},Vn=(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&&zt(r[a],t)<0;)a++;a<r.length&&zt(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Ht(i)},Hn=(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=zt(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=Ht(i);if(e.hash!==0&&e.hash!==Kr){let t=e.hash,n=0;for(;n<a.length;n++){let e=Zr(a[n]);if(e===Kr)break;t=t+Wr(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+ti(a[e])|0;c.fingerprint=t}return c},Un=e=>{let t=e.length<2?e:[...e].sort((e,t)=>zt(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&zt(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Ut(n,r)},Wn=e=>{let t=Un(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:gt(t,e.map(e=>e[0]))},Gn=[],Kn=[],qn=/* @__PURE__ */ new WeakMap,Jn=e=>{let t=Gn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Gn[e]=n,n},Yn=e=>{if(yr(e),e.low===1&&e.high>=1)return Jn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Xn=e=>e.length>0&&(e===Gn[e.length]||qn.has(e)),Zn=e=>{let t=L(e).elements;return Xn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Qn=e=>{let t=Kn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Kn[e]=n,n},$n=e=>Gt(Ut(Jn(e.length),e),`tuple`),er=e=>Gt(Un(e),`record`),tr=e=>N(e)&&!Pt(e),nr=(e,t=!1)=>`UNION(${z(e.base,t)})`,rr=(e,t=e=>L(e).elements)=>{if(!tr(e.base))throw new y(`Attempted to enumerate the nonenumerable set:\n${nr(e)}`);return t(e.base)},ir=(e,t,n)=>{if(tr(e))return e;throw new y(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${z(e)}\nwhen enumerating:\n${nr(n)}`)},I=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 I(e.base);case`FunctionSet`:return I(e.domain)&&I(e.range)||ar(e.domain)===!0||ar(e)===!0;case`RecordSet`:return e.sets.every(I)||ar(e)===!0;case`ProductSet`:return e.factors.every(I)||ar(e)===!0;case`Union`:return I(e.base)&&pr(e.base).every(I);case`SetOperation`:return e.operator===`\\cup`?I(e.left)&&I(e.right):e.operator===`\\cap`?I(e.left)||I(e.right):I(e.left);default:return!1}},ar=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=ar(e.domain);return t===void 0?void 0:!t&&ar(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=ar(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return I(e)?L(e).elements.length===0:void 0;default:return}},or=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},sr=(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},cr=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Pt(e.base))return;let t=L(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:sr(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Ht(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},lr=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Ht(r.map(t=>e[t])));while(sr(r,e.length))}return t},ur=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Pt(a))throw new y(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},dr=(e,t=e=>L(e).elements)=>{if(typeof e!=`object`)throw new y(`Expected a set but found ${z(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return kn(e.elements);case`Interval`:{let t=Yn(e);return t!==Gn[t.length]&&qn.set(t,e),t}case`Subset`:{if(yr(e.base)===0)return lr([]);if(!N(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${dt(z(e.base))}`);let t=L(e.base).elements;if(t.length>30)throw new y(vr(e));return lr(t)}case`FunctionSet`:{if(!Ot.is174&&R(e))return[];if(Pt(e.domain))throw new y(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${z(e.domain)}\ncannot be enumerated.`);let n=Zn(e.domain);if((n.length>0||Ot.is174)&&Pt(e.range))throw new y(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${z(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return or(n.map(()=>r)).map(e=>Ut(n,e))}case`RecordSet`:{if(!Ot.is174&&R(e))return[];let n=ur(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${z(t)}`);return or(n).map(t=>er(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Ot.is174&&R(e))return[];let n=ur(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${z(e)}`);return or(n).map($n)}case`FilteredSet`:if(!N(e.base)||Pt(e.base))throw new y(`Attempted to enumerate { x \\in S : p(x) } when S:\n${z(e.base)}\nis not enumerable`);return L(e.base).elements.filter(e.test);case`Union`:{let t=rr(e).flatMap((t,n)=>L(ir(t,n,e)).elements);return L(Rn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!tr(e.left)||!tr(e.right)))throw new y(`Attempted to enumerate S \\cup T when S:\n${z(e.left)}\nand T:\n${z(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!tr(e.left)&&!tr(e.right))throw new y(`Attempted to enumerate S \\cap T when neither S:\n${z(e.left)}\nnor T:\n${z(e.right)}\nis enumerable`);if(e.operator===`\\`&&!tr(e.left))throw new y(`Attempted to enumerate S \\ T when S:\n${z(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Hn(L(e.left),L(e.right)).elements;let t=e.operator===`\\`||tr(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return L(n).elements.filter(t=>Dr(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to enumerate the non-enumerable set ${z(e)}`);default:throw new y(`Expected a set but found ${z(e)}`)}},fr=/* @__PURE__ */ new WeakMap,L=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Ht(dr(e));let t=typeof e==`object`?fr.get(e):void 0;if(t)return t;let n=Tr.sets;n?.push(e);let r=dr(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`)?Ht(r):Ln(r);return typeof e==`object`&&fr.set(e,i),i},pr=e=>{if(typeof e!=`object`||Yt.has(e))return L(e).elements;let t=Tr.sets;t?.push(e);let n=gr(e);return t?.pop(),n},mr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,hr=e=>typeof e!=`object`||Yt.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?hr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||hr(e.left)||hr(e.right):mr(e)?.some(hr)??!1,gr=e=>{if(e.kind===`Union`)return rr(e,pr).flatMap((t,n)=>pr(ir(t,n,e)));if(e.kind===`FilteredSet`&&!Pt(e.base))return pr(e.base).filter(e.test);if(mr(e)?.some(hr))return dr(e,pr);if(e.kind!==`SetOperation`)return L(e).elements;if(e.operator===`\\cup`)return!tr(e.left)||!tr(e.right)?L(e).elements:[...pr(e.left),...pr(e.right)];let t=e.operator===`\\`||tr(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return tr(n)?pr(n).filter(t=>Dr(t,r)===(e.operator===`\\cap`)):L(e).elements},R=e=>{if(typeof e!=`object`||!N(e))throw new y(`Shouldn't call isEmpty() on value ${z(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new y(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(R);case`RecordSet`:return e.sets.some(R);case`FunctionSet`:return!R(e.domain)&&R(e.range);case`Union`:return rr(e).every((t,n)=>R(ir(t,n,e)));default:return L(e).elements.length===0}},_r=(e,t,n)=>e.reduce((e,r)=>{let i=e*yr(r,t);if(i>2147483647)throw new y(n());return i},1),vr=e=>`Overflow when computing the number of elements in:\n${z(e)}`,yr=(e,t)=>{if(typeof e!=`object`)throw new y(`Attempted to compute the number of elements in the ${typeof e==`number`?`integer`:typeof e==`string`?`string`:`boolean`} ${z(e)}.`);switch(e.kind){case`ModelValue`:throw new y(`Attempted to compute the number of elements in the model value ${z(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return yr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new y(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to compute the number of elements in the overridden value ${z(e)}.`);case`Subset`:{let n=yr(e.base,t);if(n>=31)throw new y(vr(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(R(e.domain))return 1;if(R(e.range))return 0;if(yr(e.range,t)===1)return 1}let n=yr(e.domain,t),r=yr(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new y(vr(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&R(e)?0:_r(e.sets,t,()=>vr(e));case`ProductSet`:return t!==`1.7.4`&&R(e)?0:_r(e.factors,t,()=>`Overflow when computing the number of elements in ${z(e)}`);default:return $t(e),L(e).elements.length}},br=e=>`Attempted to check if the set ${z(e)}is finite.`,xr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new y(`Attempted to check if the ${pt(e)} ${z(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new y(`Attempted to check if the function:\n${z(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return xr(e.base)&&R(e.base);case`Subset`:return xr(e.base);case`FunctionSet`:{let t=xr(e.domain);if(t&&R(e.domain))return!0;let n=xr(e.range);return n&&R(e.range)?!0:n&&(t||yr(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!xr(e))n.isAllFinite=!1;else if(R(e))return!0;return n.isAllFinite}case`Union`:if(!tr(e.base))throw new y(`Attempted to check if the nonenumerable set:\n${nr(e)}\nis a finite set.`);return L(e.base).elements.every(xr);case`SetOperation`:if(e.operator===`\\cup`)return xr(e.left)&&xr(e.right);if(e.operator===`\\cap`){if(!xr(e.left)&&!xr(e.right))throw new y(br(e));return!0}if(xr(e.left))return!0;if(!xr(e.right))throw new y(br(e));return!1;case`FilteredSet`:if(!xr(e.base))throw new y(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${z(e.base)}\nis finite.`);return!0}},Sr=(e,t,n=zt)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},Cr=e=>{if(typeof e!=`object`||!P(e))return;let t=Ar(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},wr=(e,t)=>{let n=`Attempted to check if the value:\n${z(e)}\nis an element of the`;if(!P(t))return`${n} ${pt(t)} ${z(t)}`;let r=Kt(t);return r===`record`?`Attempted to check if element:\n${z(e)}\nis in the record:\n${z(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${z(t)}`},Tr={sets:void 0},Er=(e,t)=>{let n=Tr.sets,r=Tr.callStack,i=n?.length??0,a=r&&{...r,length:r.expressions.length};try{return e()}catch(e){if(!(e instanceof y))throw e;return n&&(n.length=i),r&&a&&(r.expressions.length=a.length,r.isFrozen=a.isFrozen,r.fingerprint=a.fingerprint),t(e)}},Dr=(e,t)=>{let n=Tr.sets;if(n===void 0)return Or(e,t);n.push(t);let r=Or(e,t);return n.pop(),r},Or=(e,t)=>{if(!N(t))throw new y(wr(e,t));switch(t.kind){case`Set`:return $t(e),Er(()=>Sr(t.elements,e)!==-1,()=>Nn.has(t)?jn(e,t.elements).isFound:Mn(e,t.elements));case`MixedSet`:return Mn(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!F(e))throw new y(`Attempted to check if the value:\n${z(e)}\nis in the integer interval ${z(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(F(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new y(`Attempted to check if the value:\n${z(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!N(e)||Pt(e))throw new y(`Attempted to check if the non-enumerable value\n${dt(z(e))}\nis element of\n${dt(z(t))}`);return L(e).elements.every(e=>Dr(e,t.base));case`FunctionSet`:{if(!P(e)){if(F(e))return!1;throw new y(`Attempted to check if \n${z(e)}\nwhich is not a TLC function value, is in the set of functions:\n${dt(z(t))}`)}let n=Ar(e),r=sn(n.domain);return(r===void 0?Fn(t.domain,Ht(n.domain)):Fn({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Dr(e,t.range))}case`RecordSet`:{let n=P(e)?Ar(e):void 0;if(!n||!bt(n.domain)){if(F(e))return!1;throw new y(`Attempted to check if non-record\n${z(e)}\nis in the set of records:\n${z(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Sr(n.domain,e);return i!==-1&&Dr(n.range[i],t.sets[r])})}case`ProductSet`:{let n=P(e)?Cr(e):void 0;if(n===void 0){if(P(e)&&Ar(e).domain.every(e=>typeof e==`number`)||F(e))return!1;throw new y(`Attempted to check if non-tuple\n${z(e)}\nis in the set of tuples:\n${z(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>Dr(e,t.factors[n]))}case`FilteredSet`:return Dr(e,t.base)&&t.test(e);case`Union`:if(!tr(t.base))throw new y(`Attempted to check if:\n ${z(e)}\nis an element of the non-enumerable set:\n ${nr(t)}`);return L(t.base).elements.some(t=>Dr(e,t));case`SetOperation`:return t.operator===`\\cup`?Dr(e,t.left)||Dr(e,t.right):Dr(e,t.left)&&Dr(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Cr(e);if(n===void 0){if(F(e))return!1;throw new y(`Attempted to check if the value:\n${dt(z(e))}\nis an element of ${dt(z(t))}.`)}return n.every(e=>Dr(e,t.base))}default:throw new y(wr(e,t))}},kr=(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?Dr(e,n):e.range.every((e,r)=>kr(e,t.range[r],n.range)),Ar=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){I(e.domain)||yr(e.domain);let t=Zn(e.domain);return Gt(Ut(t,t.map(t=>e.apply(t))),Kt(e))}throw new y(`Expected a function but found ${z(e)}`)},jr=(e,t,n)=>{let r=dt(z(e)),i=dt(z(t)),a=n===`1.7.4`;switch(Kt(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.`}},Mr=(e,t)=>{if(!Ot.is174)return jr(e,t);let n=dt(z(t));return Kt(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Nr=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}if(e.length<=8){for(let n=0;n<e.length;n++)if(e[n]===t)return n}return Sr(e,t)},Pr=e=>new y(`Attempted to apply function with integer domain to the non-integer argument ${dt(z(e))}`),Fr=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Kt(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&&!Ot.is174&&Xn(r))throw Pr(t)}return Er(()=>Nr(r,t),e=>{throw Ot.is174||r.length<32?r.forEach(e=>On(e,t)):Sr(r,t,Cn),e})},Ir=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!Dr(t,e.domain))throw new y(Kt(e)===`lambda`?jr(e,t):`Attempted to apply a function to ${z(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new y(`Attempted to apply ${z(e)}, which is not a function`);let r=n??jr,i=Fr(e,t,r);if(i===-1)throw new y(r(e,t));return e.range[i]},Lr=e=>Xn(e)?qn.get(e)??Qn(e.length):void 0,Rr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=Ar(e).domain;return Lr(t)??Ht(t)},zr=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!I(e.domain))){if(!Dr(t,e.domain))return e;let r=n(e.apply(t));return Gt({kind:`LazyFunction`,domain:e.domain,apply:n=>Fn(t,n)?r:e.apply(n),source:e.source},Kt(e))}if(!P(e))throw new y(`Attempted to apply EXCEPT construct to the value ${dt(z(e))}.`);let i=Ar(e),a=Fr(i,t,Mr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Gt(Ut(i.domain,o),Kt(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Kr){let e=Zr(c);if(e!==Kr){let t=Zr(i.domain[a]);l.hash=s===c?i.hash:i.hash-Gr(t,Zr(s))+Gr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-ni(e,s)+ni(e,c)|0}return l},Br=/* @__PURE__ */ new WeakMap,Vr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Hr=(e,t)=>Math.imul(e^t,16777619),Ur=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Vr(t)},Wr=e=>Vr(e+2654435769|0),Gr=(e,t)=>Vr(Math.imul(e,668265261)+t|0),Kr=795548749,qr=e=>{if(e.kind===`ModelValue`)return Vr(Hr(Ur(e.name),109));if(N(e)){if(!I(e))return Kr;let t=L(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Zr(t[e]);if(r===Kr)return Kr;n=n+Wr(r)|0}return n}if(e.kind===`LazyFunction`&&!I(e.domain))return Kr;let t=Ar(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=Zr(t.domain[e]),i=Zr(t.range[e]);if(r===Kr||i===Kr)return Kr;n=n+Gr(r,i)|0}return n},Jr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new y(`TLC has found a state in which the value of a variable contains ${z(e)}`);if(N(e)){L(e).elements.forEach(Jr);return}let t=Ar(e);t.domain.forEach(Jr),t.range.forEach(Jr)},Yr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Zr(e)===Kr&&Jr(e);return}catch(e){if(!(e instanceof y))throw e;return e}},Xr=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[]}},Zr=e=>{if(typeof e==`number`)return Vr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Ur(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=qr(e)),e.hash;let t=Br.get(e);if(t!==void 0)return t;let n=qr(e);return Br.set(e,n),n},Qr=/* @__PURE__ */ new WeakMap,$r=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},ei=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return $r(t)},ti=e=>$r(ii(e)+2135587861|0),ni=(e,t)=>$r(Math.imul(ii(e),374761393)+ii(t)|0),ri=e=>{if(e.kind===`ModelValue`)return $r(ei(e.name)^60);if(N(e)){if(!I(e))return ei(oi(e));let t=L(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ti(t[e])|0;return n}let t=Ar(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+ni(t.domain[e],t.range[e])|0;return n},ii=e=>{if(typeof e==`number`)return $r(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return ei(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=ri(e)),e.fingerprint;let t=Qr.get(e);if(t!==void 0)return t;let n=ri(e);return Qr.set(e,n),n},ai=/* @__PURE__ */ new WeakMap,oi=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=ai.get(e);if(t!==void 0)return t;let n=si(e);return ai.set(e,n),n},si=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${oi(e.base)}>`;if(e.kind===`FilteredSet`&&!I(e))throw new y(`Attempted to compare the non-enumerable set ${z(e)} with another value`);if(N(e))return I(e)?`{${L(e).elements.map(oi).join(`,`)}}`:`<${e.kind} ${z(e)}>`;let t=Ar(e);return`(${t.domain.map((e,n)=>`${oi(e)}:${oi(t.range[n])}`).join(`,`)})`},ci=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,li=e=>e.reduce((e,t)=>e===0?0:e*yr(t),1),ui=e=>{if(e.kind===`Subset`)return yr(e.base)<=6?L(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return L(e);if(e.kind===`FunctionSet`&&I(e.domain)&&yr(e.domain)===0)return Ht([Ut([],[])]);let t=e.kind===`FunctionSet`?yr(e.range)**yr(e.domain):li(e.kind===`RecordSet`?e.sets:e.factors);return t===0?zn:t<=1999?L(e):void 0},di=(e,t)=>{if(t)return ui(e);if(I(e))try{return ui(e)}catch(e){if(e instanceof y)return;throw e}},fi=(e,t)=>{let n=e=>z(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return nr(e,t)}},pi=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),mi=e=>{if(I(e.domain))try{return Ar(e)}catch(e){if(e instanceof y)return;throw e}},z=(e,t=!1,n=!1)=>{let r=e=>z(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return ci(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(L(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=di(e,t);return n?r(n):fi(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?mi(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${z(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Ot.is174&&Kt(e)!==`tuple`)return`<< >>`;let a=r=>z(r,t,n&&Kt(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Kt(e)===`record`||i.domain.every(e=>typeof e==`string`&&pi(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):_t(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},hi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${dt(z(n))}\n`).join(``)},gi=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},_i=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Zr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||on(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||on(i[e],n))return i[e]}return n.kind===`Set`?gi(n.elements,t):(gi(n.domain,t),gi(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}},vi=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},B=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,yi=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),bi=(e,t)=>yi.has(e)?new y(t):new S(t),xi=e=>typeof e==`object`&&e.kind===`Operator`,V=(e,t,n)=>{let r=e[t];if(r===void 0||xi(r))throw bi(n,`${n} expects a value as argument ${t+1}`);return r},Si=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`number`)throw bi(n,`${n} expects an integer but received ${z(r)}`);return r},Ci=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`boolean`)throw bi(n,`${n} expects a boolean but received ${z(r)}`);return r},wi=(e,t,n)=>{let r=V(e,t,n);if(!N(r))throw bi(n,`${n} expects a set but received ${z(r)}`);return r},Ti=(e,t,n)=>{let r=wi(e,t,n);if(!I(r))throw bi(n,`${n} cannot enumerate the non-enumerable set ${z(r)}`);return r},Ei=(e,t,n)=>L(Ti(e,t,n)),Di=(e,t,n)=>Ei(e,t,n).elements,Oi=(e,t,n)=>{let r=V(e,t,n),i=Cr(r);if(!i)throw bi(n,`${n} expects a sequence but received ${z(r)}`);return i},ki=(e,t,n)=>{let r=V(e,t,n);if(!P(r))throw bi(n,`${n} expects a function but received ${z(r)}`);return Ar(r)},Ai=(e,t,n)=>{let r=e[t];if(r===void 0||!xi(r))throw bi(n,`${n} expects an operator as argument ${t+1}`);return r},ji=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),H=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),Mi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Ni=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Pi=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(V(n,0,e),V(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Fi=e=>e>2147483647||e<-2147483648,Ii=e=>new S(`Overflow when computing ${e}`),Li={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`},Ri={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},zi={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`},Bi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Vi=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Ri[e.operator];if(e.kind!==`Function`)return Li[e.kind];let t=Kt(e);return t===void 0?`FcnRcdValue`:Bi[t]},Hi=e=>zi[Vi(e)],Ui=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Wi=(e,t)=>{let n=n=>(...r)=>{let i=Tr.sets?.length??0;try{return n(...r)}catch(n){throw n instanceof y&&(e.isLazy===!0||!(n instanceof S))?(Tr.sets&&(Tr.sets.length=i),Ui(t,n.message)):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Gi=(e,t)=>{if(typeof e!=`number`)throw Ui(t,`Cannot cast tlc2.value.impl.${Vi(e)} to tlc2.value.impl.IntValue`);return e},Ki=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,qi=(e,t,n,r)=>{let i=Ki(e,n,`IntValue`,2);return Pi(t,(e,n)=>{let a=Gi(e,i),o=Gi(n,i),s=r(a,o);if(Fi(s))throw Ii(`${a}${t}${o}`);return s})},Ji=(e,t,n)=>{if(typeof e!=`number`)throw new S(`The ${t} argument of ${n} should be an integer, but instead it is:\n${z(e)}`);return e},Yi=(e,t,n=e)=>Pi(e,(e,r)=>t(Ji(e,`first`,n),Ji(r,`second`,n))),Xi=(e,t,n)=>({...Ni(e,t,n),isLazy:!0}),Zi=(e,t,n)=>{let r=Ai(e,t,n);return()=>r.call([])},Qi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),$i=()=>({bool:gl,condition:(e,t)=>{if(typeof e!=`boolean`)throw nl(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw rl(t,n,e);return e},apply:Ir,expectFunction:pl,tuple:$n,set:Rn,record:tn,writtenRecord:vt,equal:nn,enumerate:Dl,unassigned:(e,t)=>{throw _d(e,t)},primeOutsideAction:e=>{throw yd(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:ml,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>dl(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),ea={value:void 0},ta=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),na=e=>`local${e.counter++}`,ra=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),vi(e).forEach(e=>ra(e,t)),t),ia=(e,t,n)=>{let r=ta(e,Wu(t,e.environment)),i=ra(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=ta(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},aa=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>na(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${ca(e,t.set,s)}, ${ta(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=na(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${ca(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=na(e),a=na(e),o=na(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},oa=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${ca(e,r[0],n)}, "the left side of =>") ? bool(${ca(e,r[1],n)}, "the right side of =>") : true)`;if(B(t))return ia(e,t,n);let i=$l(t.operator,e.environment);if(i?.kind!==`Builtin`)return ia(e,t,n);if(i.name===`DOMAIN`)return`${ta(e,ol(t))}(${ca(e,r[0],n)})`;if(i.name===`TLCEval`)return ia(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${ta(e,sl(t,i))}(${ca(e,r[0],n)}, ${ca(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Zu(r[0],a))return`${ta(e,i.evaluateUnary)}(${ca(e,r[0],n)})`;let o=r.length===2&&Zu(r[0],a)&&Zu(r[1],a);return i.evaluateBinary&&o?`${ta(e,i.evaluateBinary)}(${ca(e,r[0],n)}, ${ca(e,r[1],n)})`:ia(e,t,n)},sa=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(B(e))return!1;let r=lu(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return sa(e.expression,t,n);case`FieldAccess`:return sa(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>sa(e,t,n));default:return!1}},ca=(e,t,n)=>{let r=(t,r=n)=>ca(e,t,r);if(Fu(t)&&Au(t,e.environment))return ia(e,t,n);switch(t.kind){case`Number`:return _u(t.value)?String(t.value):ia(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(B(t))return ia(e,t,n);let i=lu(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=ta(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?ta(e,i.value):ia(e,t,n)}case`Apply`:return oa(e,t,n);case`And`:case`Or`:{let n=ta(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)}, ${ta(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{dd(t.function);let i=`expectFunction(${sa(t.function,n,e.environment)?r(t.function):ia(e,t.function,{...n,context:`keepLazyContext(${n.context})`})}, ${ta(e,t)})`,a=al(e.environment.runtime.version),o=a?`, ${ta(e,a)}`:``;return t.args.length===1?`apply(${i}, ${r(t.args[0])}${o})`:`apply(${i}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${o})`}case`FieldAccess`:return`${ta(e,il(t))}(${r(t.record)})`;case`Record`:{let i=hd(t.fields);if(gd(i))return ia(e,t,n);let a=ta(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}, ${ta(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=ta(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?aa(e,t,n):ia(e,t,n);default:return ia(e,t,n)}},la=(e,t)=>{if(!Qi.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=ca(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
29
- `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;ea.value??=$i();let o=ea.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ua={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},da={none:0,error:1,warning:3,state:4},fa={0:``,1:`Error: `,3:`Warning: `,4:`State `},pa=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===da.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
30
- (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${fa[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},ma=`The configuration file did not specify the initial state predicate.
31
- Can also be caused by trying to run TLC on a specification from
32
- a module imported with a parameterized INSTANCE statement.`,ha=[[1005,b,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
33
- %1%`,!0],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
34
- %1%,
35
- but it produced the following error:
36
- %2%`,!1],[2148,`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable %1% occurring in the state formula v.
37
- `,!1],[2155,`Attempted to compare %1% with the value
38
- %2%`,!0],[2158,`Attempted to check if the value:
39
- %1%
40
- is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
41
- the following value:
42
- %1%`,!0],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
43
- %4%`,!0],[2176,`Applying %1% to the following value,
44
- which is not %2%:
45
- %3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
46
- element is not a bag:
47
- %1%`,!0],[2178,`Overflow when computing %1%`,!1],[2179,`The second argument of \\div is 0.`,!0],[2180,`0^0 is undefined.`,!0],[2181,`Attempted to compute cardinality of the value
48
- %1%`,!0],[2182,`Evaluating an expression of the form %1% when s is not a %2%:
49
- %3%`,!0],[2183,`The %1% argument of %2% must be in the domain of its %3% argument:
50
- %4%
51
- , but instead it is
52
- %5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
53
- on the right-hand side of a <- after already appearing on the
54
- left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
55
- is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,ma,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
56
- %1%`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
57
- %1%`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
58
- but instead found %3%.
59
- %4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
60
- but didn't find one.
61
- %3%`,!1],[2260,`In computing ENABLED, TLC encountered a temporal formula (%1%).
62
- %2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
63
- %2%`,!1],[2265,`TLC can't handle a number this big.
64
- %1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
65
- %4%`,!0],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
66
- %2%`,!1],[2281,`The configuration file substitutes constant %1% with non-constant %2%%3%`,!1],[2283,`The argument of %1% should be a %2%, but instead it is:
67
- %3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
68
- The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
69
- The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configuration file at line %1%
70
- Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
71
- It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
72
- %1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
73
- `,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]],ga={value:void 0},_a=()=>ga.value??=ha.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),va=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,ya=e=>va.test(e)?void 0:_a().find(t=>t.pattern.test(e))?.message,ba=e=>e instanceof S||ya(e.message)?.isEvalException===!0,xa=/* @__PURE__ */ new Map([[1e3,`
74
- : `],[2105,`failed.
75
- `],[2154,`but it produced the following error:
76
- `],[2213,`:
77
- `],[2281,` - specifically: `]]),Sa=(e,t,n)=>{let r=n?xa.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)}${Ca(t.slice(a),n)}`},Ca=(e,t)=>{let n=t?ya(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${da.none} @!@!@\n${Sa(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},wa=e=>String(e).padStart(2,`0`),Ta=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 ${wa(r%24)}h`:e>36e5?`${wa(r%24)}h ${wa(n)}min`:e>6e4?`${wa(n)}min ${wa(t)}s`:`${wa(t)}s`},Ea=e=>`${e.getFullYear()}-${wa(e.getMonth()+1)}-${wa(e.getDate())} ${wa(e.getHours())}:${wa(e.getMinutes())}:${wa(e.getSeconds())}`,Da={kind:`Local`},Oa=/* @__PURE__ */ new WeakSet,ka=/* @__PURE__ */ new WeakMap,Aa=/* @__PURE__ */ new WeakMap,ja=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Ma=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),Na=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Pa=e=>e.kind===`Operator`?e.params.length:0,Fa=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ia=e=>e.name.includes(`!`),La=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Ra=(e,t,n)=>{let r=t.bindings.get(e);return r&&Na(r.position,t.location)&&(!n||Na(r.position,n.start))?r:void 0},za=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),Ba=(e,t,n,r)=>{if(t===void 0)return!0;if(za(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},Va=(e,t,n,r)=>Ba(t,La(e,t)??Ra(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Ha=(e,t,n)=>{Ba(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ua=(e,t,n,r)=>t.reduce((e,t,i)=>Va(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Wa=(e,t,n)=>t.reduce((e,t)=>Va(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ga=e=>e.kind===`Name`?[e.name]:e.names,Ka=e=>e.flatMap(e=>Ga(e.pattern)),qa=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Na(n.location,t.location))?n:void 0},Ja=(e,t)=>{let n=qa(e,t);return n?{key:t.getKey(n),arity:Pa(n),params:Fa(n),kind:`Definition`}:t.imported.get(e)},Ya=(e,t,n)=>La(t,e)??Ja(e,n),Xa=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Za=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Xa(e.location,e.spelling??t)},Qa=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return Na(e.location,e.args[0].location)?`prefix`:`postfix`}},$a=e=>!/^[\p{L}\d_]/u.test(e),eo=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),to=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,no=(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])}})},ro=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?no(e.name,[],void 0):no(e.operator,e.args,e.argumentCounts),io=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),ao=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Ka(e.bounds),body:e.body,sets:io(e.bounds)};case`SetMap`:return{names:Ka(e.bounds),body:e.expression,sets:io(e.bounds)};case`SetFilter`:return{names:Ga(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ga(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}},oo=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}},so=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,co=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),lo=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?lo(e.body,t):vi(e).reduce((e,n)=>e??lo(n,t),void 0)},uo=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??uo(i,t,n||co(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&lo(e.set,t):lo(e,t)},fo=e=>e.kind===`Label`?fo(e.body):e,po=e=>typeof e==`number`?`argument selector ${e}`:e,mo=`within the scope of a declaration
78
- from outside that declaration's scope.`,ho=(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`&&fo(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:uo(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?lo(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&co(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${mo}`);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=po(n.operand);if(l.isSufficesOpen){if(to(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=fo(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Ya(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=ao(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:oo(e);if(!c)return;let f=to(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=to(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(co(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${mo}`);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.`))},go=(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)},_o=(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=La(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)},vo=(e,t,n,r)=>{if(!so(e))return!1;let i=ro(e),a=i[0],o=i.length>1&&a.kind===`Name`?La(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&ho(e,i,o,t,n,r),o!==void 0},yo=(e,t,n,r)=>{let i=e.location;if(ko(e,n,r))return;let a=Aa.get(e);if(a!==void 0)return a;if(ja(t))return e.kind===`Apply`?e.args.length:0;let o=La(n,t);if(o?.isNonFact){r.errors.push({location:g(Za(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(vo(e,n,r,!1)||eo(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=Da),o)return o.arity;let s=Ja(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Aa.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(La(n,c)!==void 0||Ja(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===`-.`?Xa(i,`-`):Za(e,t));if(!$a(t)||eo(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=Qa(e);d&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},bo=(e,t,n)=>(e.forEach(e=>U(e.set,t,n)),e.reduce((e,t)=>Ua(e,Ga(t.pattern),t.pattern.ranges,n),t)),xo=(e,t)=>e.kind===`Identifier`&&e.name===t&&B(e)||vi(e).some(e=>xo(e,t)),So=(e,t)=>{e.kind===`FunctionConstruction`&&xo(e.body,t)&&(e.isRecursive=!0),vi(e).forEach(e=>So(e,t))},Co=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Ka(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`?bo(e.bounds,t,i):Wa(t,e.params,i),l=La(c,a)??Ra(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(U(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),So(e.body,a),e.isSelfReferential=xo(e.body,a)):U(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:Ba(a,La(t,a)??Ra(a,i,o),{kind:`Definition`,arity:Pa(e),range:o},i)},wo=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(La(e,t.name)?.isPending)return e;let n={name:t.name,arity:Pa(t),params:Fa(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)=>Fo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=ja(t.name)?e:s(e,e=>!Na(t.location,e.location)),o={name:t.name,arity:Pa(t),kind:`Definition`,range:t.location.range,parent:a};if(Ia(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||ja(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Co(t,a,u,i)?{...o,params:Fa(t)}:a},a),()=>!0)},To=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:La(t,r)??Ra(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Eo=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=To(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},Do=(e,t,n)=>{if(Eo(e,t,n))return;let r=e.operator,i=Ya(r,t,n),a=yo(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:g(e.argumentsRange??Za(e,r)),message:`The operator ${r} requires ${a-(To(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Oo(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=yo(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else U(i,t,n);return!0}if(i.kind===`Lambda`){U(i,t,n);let o=i.params.length===c;return!o&&Oa.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)??Za(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 U(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=Ya(u,t,n)?.params??[],f=yo(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(Za(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.`)})},Oo=(e,t,n)=>{e.kind===`Identifier`?yo(e,e.name,t,n):U(e,t,n)},ko=(e,t,n)=>{let r=ka.get(e);return r?(r.args.forEach(e=>Oo(e,t,n)),n.errors.push(r.error),!0):!1},U=(e,t,n)=>{if(Oa.has(e)&&!n.isGenerated){U(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>U(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Eo(e,t,n))return;let r=e.name,i=yo(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:g(Za(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:yo(e,e.operator,t,n);return;case`Apply`:Do(e,t,n);return;case`Lambda`:U(e.body,Ua(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:U(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&U(e.other,t,n);return;case`Let`:U(e.body,wo(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:U(e.body,bo(e.bounds,t,n),i(Ka(e.bounds)));return;case`UnboundedQuantifier`:U(e.body,Ua(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&U(e.set,t,n),U(e.body,Ua(t,Ga(e.pattern),e.pattern.ranges,n),i(Ga(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:U(e.predicate,bo([e.bound],t,n),i(Ga(e.bound.pattern)));return;case`SetMap`:U(e.expression,bo(e.bounds,t,n),i(Ka(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??Xa(r.location,r.name)),message:`Non-unique fields in constructor.`}),U(r.value,t,n)});return;case`Except`:U(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),U(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:U(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(go(e,n))return;U(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),_o(e,t,n);return;case`Subexpression`:if(ko(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Oo(e,t,n)),vo(e,t,n,!1)}},Ao=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Eo(e,t,n)||vo(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&La(t,r)?.isNonFact?n.errors.push({location:g(Za(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||U(e,t,n)}),jo=(e,t,n)=>(e.set&&U(e.set,t,n),Va(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Mo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:jo(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Mo(t,e.scope,e.unit,!0):U(t,e.scope,e.unit),e),{scope:t,unit:n});return U(e.conclusion,i.scope,i.unit),i.scope},No=(e,t,n)=>e.kind===`AssumeProve`?Mo(e,t,n):(U(e,t,n),t),Po=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Ao(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Io(t,e,r),t)},Fo=(e,t,n)=>{let r=Ho(e,t,n);return e.name===void 0?r:Va(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Io=(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=No(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Po(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Po(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 Ao(r.facts,t,n),o(t);case`Instance`:return o(Fo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Fo(t,e,i):wo([t],e,n),t));case`Have`:case`Case`:return U(r.expression,t,i),Po(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>U(e,t,i)),a(t);case`Take`:return a(Ua(bo(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ua(bo(r.bounds,t,i),r.names,r.nameRanges,i);return U(r.body,o,{...i,labelParams:[...i.labelParams,...Ka(r.bounds),...r.names]}),Po(e.proof,a(t),n),a(o)}default:return Po(e.proof,a(t),n),a(t)}},Lo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:No(e.statement,void 0,t);e.name!==void 0&&Ha(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Po(e.proof,n,t),r&&(r.isInProof=!1)},Ro={line:0,column:0},zo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Bo=(e,t)=>{let n=new Map([...Ma,...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},Vo=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){U(n,a,i);return}let r=yo(n,n.name,a,i);if(r!==void 0&&r!==t.arity)throw new u(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},s=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:g(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;o(r,a);let c=a.location.range;s.has(n)?c&&i.errors.push({location:g(c),message:`Multiple substitutions for symbol '${n}' in substitution.`}):s.set(n,a)});let c=t.filter(e=>!s.has(e.name)),l=e=>!La(a,e.name)&&!Ja(e.name,i);return c.filter(e=>!l(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};o(t,n),s.set(t.name,n)}),c.filter(l).forEach(t=>{let r=e.location.range,a=t.location.range;r&&a&&i.errors.push({location:g(r),message:`Substitution missing for symbol ${t.name} declared at ${g(a)} \nand instantiated in module ${n}.`})}),s},Ho=(e,t,n)=>{let r=n.getInstance(e);return Vo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Va(e,t,r,n),t)},Uo=(e,t,n,r)=>{let i=Bo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Vo(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:Ro}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Wo=(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)=>Na(e.location,t.location)?-1:+!!Na(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof u)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},Go=(e,t)=>{let n=Bo(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([...Ma,...t.bound].map(([e,t])=>[e,{...t,position:Ro}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>Ha(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return Wo([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=Ba(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);zo(e,t)?U(t.body,void 0,i):Co(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:Pa(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);Wa(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>Ha(t,e,i)),e.name!==void 0&&Ha(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);U(e.expression,void 0,r),e.name!==void 0&&Ha(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>Lo(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Ao(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:g(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Ko=/* @__PURE__ */ new WeakSet,qo=/* @__PURE__ */ new WeakSet,Jo=(e,t,n=/* @__PURE__ */ new Set)=>{let r=es(e,(e,r)=>Jo(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&B(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&B(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Yo=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Xo=/* @__PURE__ */ new WeakMap,Zo=e=>Xo.get(e)??e.name,Qo=(e,t)=>(Zo(t)!==e.name&&Xo.set(e,Zo(t)),e),$o=(e,t)=>Qo(e.kind===`Function`?{...e,bounds:Yo(e.bounds,e=>t(e,[])),body:t(e.body,Ka(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),es=(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=>$o(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Yo(e.bounds,n),body:t(e.body,Ka(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,Ga(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,Ga(e.bound.pattern))};case`SetMap`:return{...e,bounds:Yo(e.bounds,n),expression:t(e.expression,Ka(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)}}},ts=`LAMBDA`,ns=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return es(e,(e,n)=>(r.push(...ns(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},rs=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}},is=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),as=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},os=(e,t)=>e.map(e=>({pattern:as(e.pattern,t),set:e.set})),ss=(e,t)=>e.kind===`Function`?{...e,bounds:os(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},cs=(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=>Qo({...ss(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:os(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:as(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:as(e.bound.pattern,n),set:e.bound.set}};default:return e}},ls=e=>`${e}@ENABLED`,us=(e,t)=>e.modes.get(t)??e,ds=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!B(e)&&t.instantiation.variables.has(e.name),fs=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>fs(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(ds(e,t,n))return[e.name];let r=B(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?fs(r.body,t,/* @__PURE__ */ new Map):void 0},ps=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return ds(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:ls(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:vs(e.expression,us(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[vs(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:vs(e.subscript,us(t,`Primed`),n),location:r},vs(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=fs(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:ls(r),location:e.location},location:e.location},vs({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},ms=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),hs=(e,t)=>e.map(e=>ms(e.name,t)),gs=(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:[...hs(t,r),...i.map(e=>ms(e,r))],location:r},location:r}},_s=(e,t)=>e.instantiation.isParameterized(t)?bs(e,t):void 0,vs=(e,t,n)=>{let r=e=>vs(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!B(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:vs(e.expression,us(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:vs(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},us(t,`Enabled`),n)};let s=ps(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Ko.add(n),n;let r=_s(t,e.name);if(r===void 0)return e;if(a.length===0)return{...e,name:r};let o=i.getDefinition(e.name);return o&&Pa(o)>0?gs(r,a,Pa(o),e.location):{kind:`Apply`,operator:r,args:hs(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||qo.has(e),c=e=>(s&&qo.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:ts,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:ts,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new u(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=_s(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...hs(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=_s(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?gs(n,a,Pa(r),e.location):{...e,operator:n}}let c=rs(t),l=es(e,(e,i)=>i.length===0?r(e):vs(e,t,is(n,i,c)));return cs(l,n,c)},ys=(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:ms(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},bs=(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=rs(e),o=ss($o(i,(t,n)=>vs(t,e,is(/* @__PURE__ */ new Map,n,a))),a);return ys(o,r.params,i.location)}):t},xs=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ns(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=>_s(i,e)??e,getQualifiedKey:t=>{let n=_s(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>ys(r,e.params,r.location)):t}}},Ss=e=>e.kind===`Let`&&e.instances!==void 0||vi(e).some(Ss),Cs=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=es(e,e=>Cs(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Na(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}},ws=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Ts=(e,t)=>e.definitions.some(e=>Ss(e.body))||e.assumptions.some(e=>Ss(e.expression))||e.theorems.some(e=>{let t=ws(e);return t!==void 0&&Ss(t)})?{...e,definitions:e.definitions.map(e=>$o(e,e=>Cs(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Cs(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=ws(e);return n===void 0?e:{...e,statement:Cs(n,t,[])}})}:e,Es=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=Tr.sets,a=i??[],o=a.length;Tr.sets=a;try{return n()}catch(e){throw Vu(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,Tr.sets=i}},Ds=(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},Os=e=>!e.includes(void 0),ks=e=>e.variables.map(()=>void 0),As=(e,t,n)=>{let r=[...e];return r[t]=n,r},js=(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}},Ms=e=>e.kind===`Identifier`?e.name:void 0,Ns=(e,t,n)=>{if(t.kind===`Label`)return Ns(e,t.body,n);let r=Ms(t);if(r===void 0)return;let i=ul(n,r);if(i?.kind===`Thunk`)return Ns(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=$l(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Ns(e,o.body,o.scope):void 0},Ps=(e,t,n)=>{if(t.kind===`Prime`)return Ns(e,t.expression,n);if(t.kind===`Label`)return Ps(e,t.body,n);let r=Ms(t);if(r===void 0)return;let i=ul(n,r);if(i?.kind===`Thunk`)return Ps(e,i.expression,i.scope);if(i)return;let a=$l(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Ps(e,a.body,a.scope):void 0},Fs=e=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean expression.`);return e},Is=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Ls=(e,t,n)=>{t===void 0?Os(n)&&e.onState(n):Os(n)&&Is(e)?zs(e,t,n):t.kind===`Predicate`?Bs(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?Ys(e,t.expression,t.rest,t.scope,n):Rs(e,t,n)&&Ls(e,t.rest,n)},Rs=(e,t,n)=>{let r=e.environment,i=W(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return W(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?vd(t,r.runtime.version):t}})();return!nn(i,a)},zs=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){Ys(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Rs(e,r,n):!Fs(W(r.expression,Ds(e,r.scope,n))))return}e.onState(n)},Bs=(e,t,n,r,i)=>Es(e,t,()=>{switch(t.kind){case`Let`:Bs(e,t.body,n,hu(t.definitions,Ds(e,r,i)),i);return;case`Label`:Bs(e,t.body,n,r,i);return;default:if(qs.has(t.kind))throw new y(`The state relation is not a boolean expression.`);Es(e,t,()=>Js(e,t,n,r,i))}}),Vs=(e,t,n,r)=>{Fs(t)&&Ls(e,n,r)},Hs=(e,t,n,r,i)=>{let a=Ds(e,r,i);if(t.kind===`Identifier`){let o=ul(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Bs(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Bs(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:$l(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&xl(s,e.environment))){Bs(e,c.body,n,c.scope,i);return}Vs(e,W(t,a),n,i);return}let o=tu(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Bs(e,o.body,n,pu(o,t.args,a),i):Vs(e,W(t,a),n,i)},Us=(e,t,n,r,i)=>{let a=n[r];a===void 0?Ls(e,t,As(n,r,i)):nn(a,i)&&Ls(e,t,n)},Ws=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Gs=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?Ns(e,a,r):Ps(e,a,r),c=Ds(e,r,i);if(s===void 0){W(t,c)===!0&&Ls(e,n,i);return}let l=W(o,c),u=i[s];if(t.operator===`=`){Us(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)W(t,c)===!0&&Ls(e,n,i);else{if(!tr(d))throw new y(`The right side of \\IN is not enumerable.`);for(let t of pr(d))Ls(e,n,As(i,s,t))}},Ks=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),qs=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Js=(e,t,n,r,i)=>{let a=Ds(e,r,i);switch(t.kind){case`Identifier`:Hs(e,t,n,r,i);return;case`Apply`:if(Ks.has(t.operator)&&t.args.length===2){Gs(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(Fs(W(t.args[0],a))){Bs(e,t.args[1],n,r,i);return}Ls(e,n,i);return}Hs(e,t,n,r,i);return;case`And`:{let a=t.operands;if(t.isBulleted||a.length===2){let t=a.slice(1).reduceRight((e,t)=>Ws(`Predicate`,t,r,e),n);Bs(e,a[0],t,r,i);return}let o=a[a.length-1];Bs(e,js(t,a.length-1),Ws(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>Bs(e,t,n,r,i));return}Bs(e,js(t,a.length-1),n,r,i),Bs(e,a[a.length-1],n,r,i);return}case`Exists`:Ml(t.bounds,a,r=>(Bs(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(Ml(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Ls(e,n,i);return}let o=r.slice(1).reduce((e,n)=>Ws(`Predicate`,t.body,n,e),n);Bs(e,t.body,o,r[0],i);return}case`If`:Bs(e,Fs(W(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>Fs(W(e.condition,a)))?.body??t.other;if(o===void 0)throw new y(`TLC encountered a CASE with no conditions true.`);Bs(e,o,n,r,i);return}case`FunctionApplication`:{let r=Ll(W(t.function,e.isInit?a:ml(a)));if(r){Bs(e,r.body,n,Rl(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){Ys(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){Bs(e,t.action,n,r,i),Ys(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){Bs(e,t.action,Ws(`Changed`,t.subscript,r,n),r,i);return}}Vs(e,W(t,a),n,i)},Ys=(e,t,n,r,i)=>Es(e,t,()=>{let a=Ns(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Us(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Ls(e,n,i);return}let s=o.reduceRight((e,t)=>Ws(`Unchanged`,t,r,e),n);Ys(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=ul(r,t.name);if(a?.kind===`Thunk`){Ys(e,a.expression,n,a.scope,i);return}let o=a?void 0:$l(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){Ys(e,o.body,n,o.scope,i);return}}let o=e.environment,s=W(t,{environment:o,scope:r,state:e.current,next:void 0}),c=W(t,{environment:o,scope:r,state:i,next:void 0});nn(s,c)&&Ls(e,n,i)}),Xs=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},Zs=/* @__PURE__ */ Error(`The replay found a successor`),Qs=(e,t,n,r)=>{let i=Xs(r,!1,n,()=>{throw Zs},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Ws(`Changed`,e.subscript,t,void 0);Bs(i,e.action,n,t,ks(r))}else Bs(i,e,void 0,t,ks(r));return!1}catch(e){if(e!==Zs)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},$s=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Xs(t,!0,void 0,n),o=i.reduceRight((e,t)=>Ws(`Predicate`,t.expression,t.scope,e),void 0);Bs(a,r.expression,o,r.scope,ks(t))},ec=(e,t,n,r)=>{e.some(e=>qs.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Xs(n,!1,t,e=>i.push(e));Bs(a,e.expression,void 0,e.scope,ks(n)),i.forEach(t=>r(t,e))})},tc=/* @__PURE__ */ new WeakMap,nc=/* @__PURE__ */ new WeakMap,rc=(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},ic=(e,t,n)=>{let r=e.slice();return r[t]=n,r},ac=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,oc=(t,r)=>{let i=new y(r);return t.isInit?i:n(i,e.error)},sc=(e,t,n,r)=>{let i=tl(n);return r&&qs.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 ${ac(e)}, TLC expected a boolean expression,\nbut instead found ${z(t)}.\n${i}`},cc=(e,t,n)=>{let r=Hi(t),i=el(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 ${ac(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
79
- `:``}${i}`},lc=(e,t,n,r=!0)=>{let i=W(t,n);if(typeof i==`boolean`)return i;throw oc(e,sc(e,i,t,r))},uc=e=>e===`=`||e===`\\in`||e===`\\subseteq`,dc=(e,t,n)=>{let r=n?tc:nc,i=r.get(e);if(i)return i;let a=Rc(e,t,n);return r.set(e,a),a},fc=(e,t)=>{if(t.constants.has(e))return;let n=_l(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},pc=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return pc(e.expression,t,!1,r);if(e.kind!==`Identifier`||B(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=fc(e.name,t);if(a&&!r.has(a))return r.add(a),pc(a.body,t,n,r)},mc=(e,t,n)=>pc(e,t,!n),hc=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return hc(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=hu(e.definitions,rc(r,t,n));return hc(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ul(t,e.name);if(a?.kind===`Thunk`)return hc(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=fc(e.name,r.environment);if(s)return hc(s.body,void 0,n,r,i)},gc=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||B(e))||!t&&e.kind===`Prime`,_c=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>_c(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=fc(e.name,t);if(i)return n.add(e.name),_c(i.body,t,n)},vc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),yc=(e,t,n)=>vc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||uc(e.operator)&&(gc(e.args[0],n)||mc(e.args[0],t,n)!==void 0)||B(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,bc=/* @__PURE__ */ new Set,xc=(e,t)=>{if(B(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return es(e,(e,i)=>{let a=r.isReadOnly?xc(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Sc=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||B(e)?void 0:_l(r,t);return i&&!n.has(i)&&(n.add(i),Sc(i.body,t,n))?!0:vi(e).some(e=>Sc(e,t,n))},Cc=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=mc(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=_c(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return yc(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:dc(e,t,n)}},wc=(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(wd(e,t)===void 0||Sc(e,t,/* @__PURE__ */ new Set))return!0;let n=xc(e,bc);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)}},Tc=(e,t,n)=>{let r=e.map(e=>Cc(e,t,n)),i=(e,t,n,a,o,s)=>{let c=a,l,u=Is(t);for(let a=e;a<r.length;a++){if(a>0&&u&&Hc(c)){l??=rc(t,n,c);for(let e=a;e<r.length;e++)if(!lc(t,r[e].expression,l,!1))return;s(c,o);return}let e=r[a];if(e.kind===`Guard`){if(l??=rc(t,n,c),!lc(t,e.expression,l))return;continue}if(e.kind===`Assign`){l??=rc(t,n,c);let r=W(e.value,l),i=c[e.index];if(i===void 0)c=ic(c,e.index,r),l=void 0;else if(!nn(i,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=c[t];if(e===void 0)c=ic(c,t,n[t]),l=void 0;else if(!nn(e,n[t]))return}continue}let d=a+1;e.runner(t,n,c,o,!0,(e,r)=>i(d,t,n,e,r,s));return}s(c,o)};return(e,t,n,r,a,o)=>i(0,e,t,n,r,o)},Ec=e=>(t,n,r,i,a,o)=>{lc(t,e,rc(t,n,r))&&o(r,i)},Dc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=rc(r,i,a);if(a[l]!==void 0){lc(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!tr(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${ac(r)}, the right side of \\IN is not enumerable.`;throw oc(r,`${t}\n${el(e)}`)}let p=pr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(ic(a,l,p[e]),o)}},Oc=/* @__PURE__ */ new WeakMap,kc=e=>{let t=Oc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(kc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Oc.set(e,n),n},Ac=(e,t)=>{let n=e.args[0],r=Ec(e),i=(e,r,i)=>hc(n,r,i,e,!t)??-1,a=Dc(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],rc(t,n,o));l(ic(o,u,d),s)}},jc=(e,t,n)=>{let r=el(e);return(i,a,o,s,c,l)=>{let u=rc(i,a,o),d=W(e.function,n?u:ml(u)),f=Ll(d);if(f!==void 0){dc(f.body,t,n)(i,Rl(f,e,u),o,s,c,l);return}if(!P(d))throw oc(i,`In computing ${ac(i)}, a non-function (${Hi(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw oc(i,`In computing ${ac(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Mc=(e,t)=>{if(_c(e,t))return Tc([kc(e)],t,!1);if(e.kind===`Tuple`)return dc(kc(e),t,!1);let n=kc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ul(i,e.name):void 0;l?.kind===`Thunk`?dc(kc(l.expression),t,!1)(r,l.scope,a,o,s,c):lc(r,n,rc(r,i,a))&&c(a,o)}},Nc=(e,t,n)=>{let r=e.operator,i=Ec(e),a=B(e)?void 0:$l(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=ed(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=dc(a.body,t,n),o.body(e,i(rc(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=rc(a,o,s),f=tu(e,d);f?.kind===`Closure`?dc(f.body,t,n)(a,pu(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Pc=(e,t,n)=>{let r=Ec(e),i=B(e)?void 0:fc(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ul(s,e.name);f?.kind===`Thunk`?dc(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=dc(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Fc=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||B(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!B(a))return;let o=pc(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>Fc(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||B(e))return;let r=$l(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Fc(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(i&&o?.kind===`Identifier`&&B(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Ic=(e,t,n)=>{let r=ul(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},Lc=(e,t,n)=>{let r=e.map(e=>dc(e,t,n)),i=n?[]:e.map(e=>Fc(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&Ic(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},Rc=(e,t,n)=>{let r=e=>dc(e,t,n);switch(e.kind){case`And`:return Tc(e.operands,t,n);case`Or`:return Lc(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=Tl(W(a.set,rc(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,dl(r,e,u[t]),o,s,c,l)}}let o=n?void 0:wc(e,t);if(o){let r=Tc(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=rc(n,i,a),d=e.bounds.map(e=>Tl(W(e.set,u),e.set,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=dl(t,o.names[e],r);if(e===d.length-1){let e=rc(n,i,a);if(!o.guards.every(t=>lc(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Ml(e.bounds,rc(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&wd(e,t)!==void 0&&!Sc(e.body,t,/* @__PURE__ */ new Set)?xc(e,bc):void 0;return(t,n,r,o,s,c)=>{let l=[];Ml(e.bounds,rc(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ul(n,e)?.kind===`Value`)){u.every(n=>lc(t,e.body,rc(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Hc(r)?u.slice(n).every(n=>lc(t,e.body,rc(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,rc(r,i,a));if(typeof l!=`boolean`)throw oc(r,cc(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=rc(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw oc(r,`In computing ${ac(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Hi(t)}) was used as a guard condition of a CASE.\n${tl(e.source)}`)})?.body??n;if(!u)throw oc(r,`In computing ${ac(r)}, TLC encountered a CASE with no conditions true.\n${el(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Eu(e.definitions,t);return(t,r,a,o,s,c)=>n(t,hu(e.definitions,rc(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new y(`UNCHANGED appears in an initial predicate at ${Qc(e)}`)}:Mc(e.expression,t);case`AngleAction`:{let n=r(e.action),i=kc(e.subscript),a=(e,n,r)=>{try{return lc(e,i,rc(e,n,r))}catch(n){throw e.isEnabled?vd(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,kc(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Pc(e,t,n);case`FunctionApplication`:return jc(e,t,n);case`Apply`:{let i=e.args;if(uc(e.operator)){let r=mc(i[0],t,n);if(r!==void 0)return e.operator===`=`?Tc([e],t,n):Dc(e,()=>r);if(gc(i[0],n))return Ac(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=W(i[0],rc(t,n,r));(typeof c==`boolean`?c:gl(c,`the left side of => at ${Qc(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Nc(e,t,n)}default:return Ec(e)}},zc=/* @__PURE__ */ new WeakMap,Bc=e=>{let t=zc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return zc.set(e,n),n},Vc=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Hc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Uc=(e,t)=>{let n=t.state;if(!n||!Hc(n))throw new y(`ENABLED needs a complete state at ${Qc(e)}`);let r=t.environment;if(r.callStack)return Qs(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return dc(e,r,!1)(i,t.scope,Bc(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Wc=(t,r,i,a)=>{let o={environment:r,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};dc(t,r,!0)(o,a,Bc(r),void 0,!1,t=>{if(!o.isStopped){if(!Hc(t))throw n(new ne([...t]),e.error);o.isStopped=i(t)}})},Gc=(e,t,n)=>{let r=[];return Wc(e,t,e=>(r.push(e),!1),n),r},Kc=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return dc(e,n,!1)(a,i,Bc(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Hc(e)){let r=Vc(e,n);throw new ee(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},qc=(e,t,n,r)=>{let i=[];return Kc(e,t,n,e=>(i.push(e),!1),r),i},Jc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Yc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Xc=e=>Yc.has(e.kind)||e.kind===`Apply`&&Jc.has(e.operator),Zc=(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&&ft(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Qc=e=>`line ${e.location.line}, column ${e.location.column}`,$c=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,el=e=>{let t=e.location.range;return t?$c(t):Qc(e)},tl=e=>e.kind===`Number`?e.text??String(e.value):el(e),nl=(e,t)=>new y(`A non-boolean expression (${Hi(t)}) was used as the condition of an IF.\n${el(e)}`),rl=(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 (${Hi(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${tl(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${Hi(n)}.\n${el({...e,location:{...e.location,range:{...r,end:i}}})}`)},il=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${z(n)}\n${el(e)}`,r=e=>`Attempted to apply function:\n${dt(z(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!P(i))throw new y(`Attempted to select field "${t}" from a non-record value ${dt(z(i))}\n${el(e)}`);let a=Kt(i);if(a===`tuple`)throw Pr(t);return Ir(i,t,a===`record`?n:r)}},al=e=>e===`1.7.4`?(t,n)=>jr(t,n,e):void 0,ol=e=>t=>{if(!P(t))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${Hi(t)})\n${el(e)}`);return Rr(t)},sl=(e,t)=>(n,r)=>{if(!N(n)||Pt(n))throw new y(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${el(e)}`);return t.evaluate([n,r])},cl=t=>n(new y(`TLC can't handle real numbers: ${t.text} at ${Qc(t)}`),e.configParseError),ll=t=>n(new y(`TLC can't handle a number this big: ${t.text??t.value} at ${Qc(t)}`),e.error),ul=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},dl=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),fl=(e,t,n)=>{if(t.kind===`Name`)return dl(e,t.name,n);let r=Cr(n);if(!r||r.length!==t.names.length)throw new y(`Cannot bind <<${t.names.join(`, `)}>> to ${z(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>dl(e,t,r[n]),e)},pl=(e,t)=>{if(P(e))return e;throw new y(`A non-function (${Hi(e)}) was applied as a function.\n${el(t)}`)},ml=e=>e.isKeepLazy?e:{...e,isKeepLazy:!0},hl=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),gl=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Expected ${t} to be a boolean but found ${z(e)}`);return e},_l=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),vl=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),yl=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),bl=(e,t)=>{if(vl.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&yl.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=_l(n,t);if(e&&!t.constants.has(n)&&!xl(e,t))return!0}return vi(e).some(e=>bl(e,t))},xl=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!bl(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>bl(e.set,t)));return t.constantLevels.set(e,r),r},Sl=(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.`},Cl=(e,t,n)=>{if(!N(e)||Pt(e)){let r=z(e),i=n===`1.7.4`?void 0:Sl(e,r);throw new y(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${tl(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${tl(t)}\n${i}`)}},wl=(e,t,n)=>(Cl(e,t,n),typeof e==`object`&&e.kind===`Interval`?Yn(e):cr(e)??L(e).elements),Tl=(e,t,n)=>n===`1.7.4`?(Cl(e,t,n),cr(e)??pr(e)):wl(e,t,n),El=e=>{if(typeof e==`object`&&e.kind===`Interval`)return yr(e),e},Dl=(e,t,n)=>El(e)??Tl(e,t,n),Ol=(e,t,n)=>El(e)??wl(e,t,n),kl=(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},Al=(e,t)=>e.map(e=>Dl(W(e.set,t),e.set,t.environment.runtime.version)),jl=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):kl(t[n],t=>i(n-1,fl(a,e[n].pattern,t)));return i(e.length-1,n)},Ml=(e,t,n)=>jl(e,Al(e,t),t.scope,n),Nl=(e,t)=>{let n=e.map(e=>W(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Pl=(e,t,n)=>{if(e.length===1)return fl(t,e[0].pattern,n);let r=Cr(n)??[];return e.reduce((e,t,n)=>fl(e,t.pattern,r[n]),t)},Fl=/* @__PURE__ */ new WeakMap,Il=e=>(Fl.set(e.value,e),e.value),Ll=e=>typeof e==`object`&&e.kind===`LazyFunction`?Fl.get(e):void 0,Rl=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:$n(i),o=(e,n,i)=>`In applying the function\n${dt(z(r))},\nthe ${e} is:\n${dt(z(n))}${i}.\n${el(t.function)}`,s=e.bounds;if(s.length===1){if(!Dr(a,r.domain))throw new y(o(`first argument`,a,`which is not in its domain`));return Pl(s,e.scope,a)}let c=Cr(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new y(`Attempted to apply a function to an argument not in its domain.\n${el(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!Dr(n,l[t]))throw new y(o(r,n,`${e.pattern.kind===`Name`?``:`
80
- `}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Cr(n)?.length!==e.pattern.names.length)throw new y(o(r,n,`which does not match its formal parameter`))}),Pl(s,e.scope,$n(c.slice(0,s.length)))},zl=/* @__PURE__ */ new WeakMap,Bl=(e,t)=>{let n=zl.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:$c(r)};return zl.set(t,i),i},Vl=(e,t,n)=>{let r=Bl(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},Hl=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Zr(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(an(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},Ul=/* @__PURE__ */ new WeakMap,Wl=e=>{let t=Ul.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return Ul.set(e,n),n},Gl=(e,t)=>{let n=Nl(e.bounds,t),r=Hl(n,(n,r)=>W(e.body,hl(t,Pl(e.bounds,dl(void 0,e.name,r),n))),Vl(e.bounds,e.body,n));return Il({value:r,bounds:e.bounds,body:e.body,scope:dl(void 0,e.name,r)}),e.bounds.length===1?qt(r):r},Kl=(e,t)=>{if(typeof t!=`object`||Kt(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!ft(t.domain))return t;try{let e=Ar(t);return Ut(e.domain,e.range)}catch(e){if(e instanceof y)return t;throw e}},ql=(e,t)=>e.kind===`Function`?e.isSelfReferential?Gl(e,t):W(Wl(e),t):W(e.body,t),Jl=(e,t)=>{let n=xl(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new y(`Operator ${e.name} requires ${e.params.length} arguments`);let i=hl(t,void 0);if(!n)return ql(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>Kl(e,ql(e,i)));return t.environment.definitionValues.set(e,a),a},Yl=(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))&&xl(e,t))try{Pn(Jl(e,{environment:t,scope:void 0,state:void 0,next:void 0}))}catch(e){if(!(e instanceof y)&&!c(e))throw e}}),Xl=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=W(e.expression,hl(t,e.scope));return n&&(e.cache=r),r},Zl=/* @__PURE__ */ new WeakMap,Ql=e=>{let t=Zl.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Zl.set(e,n),n},$l=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return $l(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Ql(r):t.builtins.get(e)},eu=/* @__PURE__ */ new WeakMap,tu=(e,t)=>{if(B(e))return nu(e.operator,t);let n=eu.get(e),r=n===void 0?$l(e.operator,t.environment)??null:n;return n===void 0&&eu.set(e,r),r??nu(e.operator,t)},nu=(e,t)=>{let n=ul(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return $l(e,t.environment)},ru=e=>e.kind===`Closure`?e.params.length:e.arity,iu=(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:nu(n,t);if(!r)throw new y(`Expected an operator argument at ${Qc(e)}`);return r},au=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>dl(e,n.name,t[r]),e.scope);return W(e.body,hl(n,r))},ou=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:ru(e),call:n=>au(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},su=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=nu(e.name,t);return n!==void 0&&ru(n)>0},cu=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),lu=(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 lu(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([])}},uu=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&_u(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=B(e)?void 0:lu(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ul(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:cu(e,t)}}return t=>cu(e,t)},du=/* @__PURE__ */ new WeakMap,fu=(e,t)=>{let n=du.get(e);if(n)return n;let r=uu(e,t);return du.set(e,r),r},pu=(e,t,n)=>{if(t.length!==e.params.length)throw new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`);let r=e.scope;for(let i=0;i<t.length;i++){let a=e.params[i],o=a.arity>0?{kind:`Operator`,operator:iu(t[i],n)}:fu(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},mu=(e,t,n)=>e.kind===`Closure`?W(e.body,hl(n,pu(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Qu(t,n),n):e.evaluate(t.map(e=>su(e,n)?ou(iu(e,n),n):W(e,n)),n),hu=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0},i):r.params.length>0||n?.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0},i)},t.scope),gu=(e,t,n)=>{let r=ul(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Xl(r,n);if(r?.kind===`Operator`){if(ru(r.operator)===0)return au(r.operator,[],n);throw new y(`Operator ${e} is used without arguments`)}let i=lu(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw _d(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Jl(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new y(`Unknown identifier ${e} at ${Qc(t)}`)},_u=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,vu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),yu=(e,t)=>vu.has(e)||t.builtins.get(e)?.isStateLevel===!0,bu={builtins:vu,definitions:/* @__PURE__ */ new WeakMap},xu={builtins:new Set([...vu].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},Su=(e,t)=>e.kind===`Operator`&&e.params.length===0&&xl(e,t),Cu=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!B(e)){let e=_l(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!Su(e,t)&&wu(e,t,n))return!0}return vi(e).some(e=>Cu(e,t,n))},wu=(e,t,n=bu)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Cu(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Cu(e.set,t,n));return n.definitions.set(e,i),i},Tu={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},Eu=(e,t)=>new Set(e.filter(e=>wu(e,t)||wu(e,t,Tu))),Du=e=>[...e.definitions.values()].some(t=>wu(t,e)),Ou=e=>[...e.definitions.values()].some(t=>wu(t,e,xu)),ku=/* @__PURE__ */ new WeakMap,Au=(e,t)=>{let n=ku.get(e);if(n!==void 0)return n;let r=Pu(e,t,Mu);return ku.set(e,r),r},ju=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),Mu=/* @__PURE__ */ new Set,Nu=(e,t,n)=>n.size===0?Au(e,t):Pu(e,t,n),Pu=(e,t,n)=>{if(!ju.has(e.kind))return!1;if(e.kind===`Identifier`&&B(e))return n.has(e.name);if(B(e))return!1;if(e.kind===`Identifier`){let n=lu(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&Su(n.definition,t)}if(e.kind===`Apply`){if(yu(e.operator,t)||Tu.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=$l(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=_l(e.operator,t);if(!n||!xl(n,t)||wu(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&Nu(e,t,n))}let r={value:!0};return es(e,(e,i)=>(r.value&&=Nu(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Fu=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Iu=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},Lu=(e,t)=>{if(e.kind===`Identifier`&&B(e))return!t.has(e.name);if(B(e))return!0;let n={value:!1};return es(e,(e,r)=>(n.value||=Lu(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Ru=(e,t)=>Ko.has(e)&&Fu(e)&&wd(e,t)!==void 0&&!Lu(e,Mu),zu=/* @__PURE__ */ new WeakMap,Bu=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Tr.sets,o=Tr.callStack,s=a??[],c=s.length;Tr.sets=s,Tr.callStack=r;try{let a=t(i),o=typeof a==`object`&&a.kind===`FilteredSet`?zu.get(a):void 0,s=o?o(n):a;return r.values.set(e,s),typeof s==`object`&&s.kind!==`FilteredSet`&&Xc(e)&&r.sources.set(s,e),s}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Zc(e,r.values),a=i&&!vi(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!P(a)?void 0:a;throw Vu(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Tr.sets=a,Tr.callStack=o}},Vu=(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},Hu=(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}},Uu=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Wu=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=xd(e,t),i=t.callStack,a=i?Bu(e,r,t,i):Fu(e)&&Au(e,t)?Iu(r):Ru(e,t)?Yu(r):r;return t.evaluators.set(e,a),a},Gu=/* @__PURE__ */ new WeakMap,Ku=(e,t)=>{if(t.callStack)return Wu(e,t);let n=Gu.get(e);if(n)return n;let r=(Fu(e)&&Au(e,t)?void 0:la(e,t))??Wu(e,t);return Gu.set(e,r),r},W=(e,t)=>Ku(e,t.environment)(t),qu=(e,t)=>{let n=e.name,r=B(e)?void 0:lu(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw _d(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&xl(e,t))return t=>Jl(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Ku(e.body,t),n.body(hl(r,void 0)));return Ju(e,t)?Yu(r):r}return t=>Jl(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Jl(e,t);return xl(e,t)||!Ju(e,t)?n:Yu(n)}return t=>gu(n,e,t)},Ju=(e,t)=>wd(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>wd(e.set,t)!==void 0)),Yu=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},Xu=(e,t)=>{let n=$l(e,t);return n!==void 0&&ru(n)>0},Zu=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!B(e)&&Xu(e.name,t)),Qu=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),$u=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Qu(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Zu(t[0],n)){let e=Wu(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Zu(t[0],n)&&Zu(t[1],n);if(i&&a){let e=Wu(t[0],n),r=Wu(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>su(e,n)?ou(iu(e,n),n):W(e,n)),n)},ed=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:fu(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:iu(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},td=/* @__PURE__ */ new WeakMap,nd=e=>{let t=td.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return td.set(e,n),n},rd=(e,t)=>{let n=[];for(let r=e;n.length<t;r=r?.parent){if(r?.binding.kind!==`Value`)return;n.push(r.binding.value)}return n},id=(e,t)=>e.every((e,n)=>an(e,t[n])),ad=(e,t)=>{let n=_l(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&xl(n,t)&&!wu(n,t)},od=(e,t,n,r)=>{let i=ed(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Ku(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r)return e=>o(i(e),e);let s=nd(e);return e=>{let n=i(e),r=rd(n,t.length);if(!r||e.isKeepLazy)return o(n,e);let a=r.length;for(let e of r)a=Hr(a,Zr(e));let c=s.calls.get(a),l=c?.find(e=>id(e.args,r));if(l)return l.value;let u=o(n,e);return s.size<65536&&(s.size++,c?c.push({args:r,value:u}):s.calls.set(a,[{args:r,value:u}])),u}},sd=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Wu(n[0],t),r=Wu(n[1],t);return t=>!gl(e(t),`the left side of =>`)||gl(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new y(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=B(e)?void 0:$l(e.operator,t);if(r?.kind===`Closure`){let i=!t.callStack&&ad(e,t);return od(r,n,t,i)}if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Wu(n[0],t),i=ol(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Wu(n[0],t);return qo.has(e)||bl(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=Wu(n[0],t),a=Wu(n[1],t),o=sl(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?$u(r,n,t):e.operator===`\\cdot`&&n.length===2?()=>{throw new y(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)}:r=>{let i=nu(e.operator,r);if(i)return mu(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new y(`${e.operator} is a function; apply it with brackets`):new y(`Unknown operator ${e.operator} at ${Qc(e)}`)}},cd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Wu(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Wu(a.set,t);return s=>kl(Dl(o(s),a.set,t.runtime.version),t=>gl(i(hl(s,dl(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>Wu(e.set,t));return s=>{let c=a.map((e,n)=>Dl(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?gl(i(hl(s,a)),r)!==n:kl(c[t],n=>l(t-1,dl(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Ml(o,e,t=>gl(i(hl(e,t)),r)!==n)?!n:n},ld=(e,t)=>{if(e.kind===`Tuple`)return $n(e.names.map(e=>{let n=ul(t,e);return n?.kind===`Value`&&n.value}));let n=ul(t,e.name);return n?.kind===`Value`?n.value:void 0},ud=/* @__PURE__ */ new WeakSet,dd=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&ud.add(e)},fd=(e,t)=>{let n=ud.has(e),r=Wu(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Wu(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=Zn(e),o=Ut(i,i.map(e=>r(hl(t,dl(t.scope,n,e)))));return ft(e)?o:qt(o)}let n=[],s=i.map(e=>Ol(W(e.set,t),e.set,t.environment.runtime.version));return jl(i,s,t.scope,e=>{let o=i.length===1?ld(a.pattern,e)??!1:$n(i.map(t=>ld(t.pattern,e)??!1));return n.push([o,r(hl(t,e))]),!1}),Un(n)},l=(t,n)=>{let a=Il({value:Hl(t,e=>r(hl(n,Pl(i,n.scope,e))),Vl(i,e.body,t)),bounds:i,body:e.body,scope:n.scope});return i.length===1?qt(a):a},u=t.callStack;return t=>{let r=o?s(t):Nl(i,t);if(e.isRecursive||n||t.isKeepLazy||!I(r))return l(r,t);if(!ft(r)){if(u)return l(r,t);try{return c(r,t)}catch(e){if(!(e instanceof y))throw e;return l(r,t)}}if(!u)return c(r,t);try{return c(r,t)}catch(t){throw Hu(u,e,t),t}}},pd=(e,t)=>{let n=ud.has(e);n&&dd(e.function);let r=Wu(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=>Wu(e,t))}),value:Wu(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):$n(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(hl(i,dl(i.scope,`@`,e))):zr(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(ua.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${el(e.function)}`)}return n}},md=(e,t)=>{if(e.kind===`SetFilter`){let n=Wu(e.predicate,t),r=Wu(e.bound.set,t),i=e.bound.pattern,a=e.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:$c(a)},s=(e,t)=>n=>gl(e(hl(t,fl(t.scope,i,n))),`a set filter predicate`),c=(t,n,r)=>{let i={kind:`FilteredSet`,base:t,test:s(r,n),source:o};return zu.set(i,r=>c(t,{...n,environment:r},Wu(e.predicate,r))),i};return e=>{let t=r(e);return ft(t)?Ht(L(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=Wu(e.expression,t);return t=>{let r=[];return Ml(e.bounds,t,e=>(r.push(n(hl(t,e))),!1)),Rn(r)}}let n=e.set;if(!n)return()=>{throw new y(`TLC cannot evaluate an unbounded CHOOSE at ${Qc(e)}`)};let r=Wu(e.body,t),i=Wu(n,t);return t=>{let a=i(t);if(!N(a)||Pt(a))throw new y(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${el(e)}`);let o={value:void 0},s=Ol(a,n,t.environment.runtime.version);if(kl(s,n=>{let i=fl(t.scope,e.pattern,n);return gl(r(hl(t,i)),`the body of CHOOSE`)?(o.value=ld(e.pattern,i),!0):!1}),o.value===void 0)throw new y(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${el(e)}`);return o.value}},hd=e=>[...e].sort((e,t)=>zt(e.name,t.name)),gd=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),_d=(e,t)=>new te(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${el(t)}`,e),vd=(e,t)=>e instanceof te&&t!==`1.7.4`?new y(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,yd=e=>new y(`A primed expression appears outside an action at ${Qc(e)}`),bd=(e,t)=>{let n=hd(e),r=gd(n),i=n.map(e=>Wu(e.value,t));if(r)return e=>er(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=>vt(a,i.map(t=>t(e)),o):e=>tn(a,i.map(t=>t(e)))},xd=(e,t)=>{let n=e=>Wu(e,t);switch(e.kind){case`Number`:{let t=e.value;return _u(t)?()=>t:()=>{throw ll(e)}}case`Decimal`:return()=>{throw cl(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return qu(e,t);case`Apply`:return sd(e,t);case`Bracket`:return()=>{throw new y(`A bracket without a function or subscript is not an expression at ${Qc(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new y(`An operator cannot be used as a value at ${Qc(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 rl(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 rl(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw yd(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>nn(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw nl(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 (${Hi(t)}) was used as a condition of a CASE. ${tl(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${el(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(hl(n,hu(e.definitions,n)))}case`Forall`:case`Exists`:return cd(e,t);case`UnboundedQuantifier`:return()=>{throw new y(`TLC cannot evaluate an unbounded quantifier at ${Qc(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return md(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Rn(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>$n(t.map(t=>t(e)))}case`FunctionConstruction`:return fd(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 bd(e.fields,t);case`RecordSet`:{let t=hd(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 pd(e,t);case`ExceptAt`:return t=>{let n=ul(t.scope,`@`);if(n?.kind!==`Value`)throw new y(`@ appears outside an EXCEPT at ${Qc(e)}`);return n.value};case`FunctionApplication`:{dd(e.function);let r=n(e.function),i=t=>pl(r(ml(t)),e),a=e.args.map(n),o=al(t.runtime.version);if(a.length===1){let e=a[0];return t=>Ir(i(t),e(t),o)}return e=>Ir(i(e),$n(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=il(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?gl(t(e),`an action`)||r(e):gl(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Uc(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new y(`The subexpression reference at ${Qc(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new y(`TLC cannot evaluate a temporal formula in a state at ${Qc(e)}`)}}},Sd=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Cd=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},wd=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Sd.has(e.kind))return!1;let a=Cd(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&yu(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return vi(e).every(i)};return i(e)?[...n]:void 0},Td=`-------------------------------- MODULE Reals -------------------------------
17
+ `?r.isAfterLf=!0:i===` `&&(r.column=Pe(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},Ie=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Le=new Set([...E.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Re=(e,t)=>{let n=0;for(;Le.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,je(Ie,e,t)))},ze=e=>{let t=Fe(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(T(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?D(o,s,e[a],i):t.lines[n]===o?e[a]===`
18
+ `||e[a]===`\r`?D(o+1,0,void 0,i):D(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=Me(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,ve[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),ve[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(ke);if(n.mode===`PRAGMA`)return s(Ae);for(;n.offset<e.length;){let t=n.offset;if(`
19
+ \r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=Ne(e,t);if(i.length===0){let n=Re(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},Be=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
20
+ `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Ve=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Be.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),D=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Ve(n)}" (${n.charCodeAt(0)}), `}after : "${Ve(r)}"`,He=e=>{let t=ze(e);for(let e=t();typeof e!=`string`&&e.kind!==T(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?Pe(e):e+1,e.beginColumn);return D(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Ue=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},O=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,We=`-------------------------------- MODULE Reals -------------------------------
81
21
  (***************************************************************************)
82
22
  (* This module provides dummy definitions of the operators that are *)
83
23
  (* defined by the real Reals module. It is expected that any tool that *)
@@ -94,7 +34,7 @@ EXTENDS Integers
94
34
  Real == "Reals"
95
35
  a / b == CHOOSE m \\in Real : m * b = a
96
36
  Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
97
- =============================================================================`,Ed=`----------------------------- MODULE RealTime -------------------------------
37
+ =============================================================================`,Ge=`----------------------------- MODULE RealTime -------------------------------
98
38
  (***************************************************************************)
99
39
  (* This standard module is described in Chapter 9 of the book "Specifying *)
100
40
  (* Systems". The type of specification described there cannot be handled *)
@@ -120,7 +60,7 @@ RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
120
60
  IN /\\ now \\in Real
121
61
  /\\ [][NowNext]_now
122
62
  /\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
123
- =============================================================================`,Dd=`----------------------------- MODULE Toolbox --------------------------------
63
+ =============================================================================`,Ke=`----------------------------- MODULE Toolbox --------------------------------
124
64
  (***************************************************************************)
125
65
  (* *)
126
66
  (***************************************************************************)
@@ -146,7 +86,60 @@ _TEPosition ==
146
86
  THEN _TETraceLength
147
87
  ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
148
88
 
149
- =============================================================================`,Od=/* @__PURE__ */ new Map([[`Reals`,Td],[`RealTime`,Ed],[`Toolbox`,Dd]]),kd=`tlc2/value/impl/`,Ad=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},jd=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Md=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Nd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??jd.get(e[3])}${`[]`.repeat(e[1].length)}`),Pd=(e,t)=>e[e[t].first].text,Fd=(e,t)=>Pd(e,t).replaceAll(`/`,`.`),Id=e=>{let t=Ad(e);if(t.readUint32()!==3405691582)throw new u(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===1?a.text=i.decode(t.readBytes(t.readUint16())):r===3?a.value=t.readInt32():r===4?t.readUint32():r===5||r===6?(t.readBytes(8),e++):r===7||r===8||r===16||r===19||r===20?a.first=t.readUint16():r===15?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=Fd(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=Nd(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:Ad(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()},()=>Fd(n,d.readUint16())):[],p=Md.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Nd(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}},Ld=(e,t)=>{let n=e[t],r=e[n.second];return{className:Pd(e,n.first),name:e[r.first].text}},Rd=(e,t,n,r)=>{let i=()=>new C(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===3)return n.value;if(n.tag===8)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=2&&n<=8)o.push(n-3),e+=1;else if(n===16)o.push(a[e+1]<<24>>24),e+=2;else if(n===17)o.push(l()<<16>>16),e+=3;else if(n===18)o.push(c(a[e+1])),e+=2;else if(n===19)o.push(c(l())),e+=3;else if(n===89){let t=s();o.push(t,t),e+=1}else if(n===178){let n=Ld(t,l());if(n.className!==`${kd}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===184){let n=Ld(t,l()),a=s();if(n.className!==`${kd}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===187)o.push({className:Pd(t,l()),value:void 0}),e+=3;else if(n===183){let n=Ld(t,l()),a=s(),o=s();if(!(n.className===`${kd}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===176){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},zd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Id(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:Rd(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)}))}},Bd=/* @__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(`,`),Vd=[[`\\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`,`≀`],[`^+`,`⁺`]],Hd=/* @__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(`,`),Ud=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),Wd=/* @__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(`.`),Gd=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),Kd=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
89
+ =============================================================================`,qe=/* @__PURE__ */ new Map([[`Reals`,We],[`RealTime`,Ge],[`Toolbox`,Ke]]),Je={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},Ye=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},Xe=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ze=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Qe=e=>{let t=t=>{let n=w(e,t,Ye);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=w(e,t,Xe);if(e.startsWith(`..`,n)&&Xe(e[n+2]))return{kind:`Constant`,first:t,last:w(e,n+2,Xe)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=Xe(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:w(e,t+1,Xe)-1,children:[]};if(Ze(n))return{kind:`Constant`,first:t,last:w(e,t,Ze)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},k=e=>{let t=e.length===0?void 0:Qe(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=Je[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let ee=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),h=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return ee===void 0||h===void 0?void 0:`${ee}${s.divider}\n${o}${s.dividerPad}${h}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},A=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,$e=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),j=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),M=e=>typeof e==`object`&&e.kind===`ModelValue`,et=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),tt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:A(e)?`set`:`function`,nt=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,rt={isUsed:!1},it=(e,t)=>(rt.isUsed=!0,e.writtenKeys=t,e),at=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[fr(e.domain,t)]]),ot=(e,t,n)=>it(Un(e,t),n),st=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(st);e.writtenKeys=void 0,e.range.forEach(st)}},ct=e=>e.every(e=>typeof e==`string`),lt=(e,t)=>e.length>0&&t.length>0&&ct(e)!==ct(t),ut=(e,t)=>{rt.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return lt(n,r)?dn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Dt(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:Dt(t,n);if(r!==0)return r}return 0},dt=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=Dt(n[e],r[e]);if(t!==0)return t}return 0},ft=e=>M(e)?e.type:void 0,pt=(e,t,n)=>{let r=ft(e),i=ft(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(M(e)&&M(t)){if(r===void 0||i===void 0||r===i)return;throw new h(`Attempted to ${a} the differently-typed model values ${L(e)} and ${L(t)}`)}throw r===void 0?new h(`Attempted to ${a} the typed model value ${L(t)} and the non-model value\n${L(e)}`):new h(`Attempted to ${a}${n?``:` the`} typed model value ${L(e)} and non-model value\n${L(t)}`)},mt={ranks:Object.create(null),size:0},ht=e=>{mt.ranks=Object.create(null),mt.size=0,Ot.clear();for(let t of e)vt(t)},gt={is174:!1},_t=e=>{gt.is174=e===`1.7.4`},vt=e=>(mt.ranks[e]===void 0&&(mt.ranks[e]=mt.size++),e),yt=()=>mt.size,bt=e=>mt.ranks[vt(e)],xt=(e,t)=>{if(e===t)return 0;let n=mt.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},St=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Ct=(e,t)=>(St(e)||St(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),wt=(e,t,n)=>{if(!St(e))throw new h(`Attempted to ${n} the set ${L(N(e)?P(e):e,!0)} with the value:\n${L(t,!0)}`);if(!St(t))throw new h(`Attempted to compare overridden value ${L(e,!0)} with non-overridden value:\n${L(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new h(`Attempted to compare ${L(e,!0)} with the value\n${L(t,!0)}`)},Tt={kind:`InfiniteSet`,name:`Any`},Et=e=>{throw new h(`Attempted to compare ANY with the value\n${L(e)}`)},Dt=(e,t)=>{if(e===t)return rt.isUsed&&st(e),e===Tt?Et(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return ut(e,t);if(n===`Set`&&r===`Set`)return dt(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&pt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return pt(e,t,!1),n===`ModelValue`?-1:1;if(e===Tt||t===Tt)return Et(e===Tt?t:e);if(A(e)&&A(t)&&Ct(e,t))return wt(e,t,`compare`);let i=A(e);if(i!==A(t))throw new h(`Attempted to compare ${tt(e)} ${L(e)} with ${tt(t)} ${L(t)}`);return i?dt(P(e),P(t)):ut(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return xt(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(pt(e,t,!1),M(e))return-1;if(M(t))return 1;throw new h(`Attempted to compare ${tt(e)} ${L(e)} with ${tt(t)} ${L(t)}`)},Ot=/* @__PURE__ */ new Map,kt=e=>{let t=Ot.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:bt(e)};return Ot.set(e,n),n},At=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),jt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),Mt={isPresent:!1},Nt=(e,t)=>(t===`lambda`&&(Mt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Pt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Ft=e=>Nt(e,`lambda`),It=/* @__PURE__ */ new WeakSet,Lt=/* @__PURE__ */ new WeakSet,Rt={isPresent:!1},zt=e=>(Rt.isPresent=!0,e),Bt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Vt=e=>{Rt.isPresent&&typeof e==`object`&&Bt.has(e.kind)&&Lt.add(e)},Ht=e=>{if((Mt.isPresent||Rt.isPresent)&&typeof e==`object`){if(e.kind===`Function`||e.kind===`Set`){if(e.isFingerprinted)return;e.isFingerprinted=!0}else{if(It.has(e))return;It.add(e)}e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Ht),e.range.forEach(Ht)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Ht):A(e)&&N(e)&&(Vt(e),P(e).elements.forEach(Ht))}},Ut=(e,t)=>{if(Vt(e),e===t)return rt.isUsed&&st(e),e!==Tt||Et(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&pt(e,t,!0),Dt(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return ut(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return dt(e,t)===0;if(M(e)||M(t))return pt(e,t,!0),M(e)&&M(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Ut(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=F(e.domain),r=F(t.domain);if(n||r)return n===r;let i=F(e.range),a=F(t.range);return i||a?i===a:Ut(e.domain,t.domain)&&Ut(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(F(e))return F(t);if(F(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&Ut(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return F(e)?F(t):!F(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Ut(e,t.factors[n]));let n=A(e)&&A(t)&&!(N(e)&&N(t));if(n&&Ct(e,t))return wt(e,t,`check equality of`)===0;if(n){if(!St(e)){let n=P(e);if(!St(t))return dt(n,P(t))===0}return Qr(e)===Qr(t)}return Dt(e,t)===0},Wt=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):Qr(n)===Qr(r);return n},Gt=Wt(!1),Kt=Wt(!0),qt=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Jt=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Ur(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Kt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Kt(i[e],n))return i[e]}return n.kind===`Set`?qt(n.elements,t):(qt(n.domain,t),qt(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},Yt=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},Xt=e=>{if(!j(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:Yt(t.domain)}},Zt=e=>{if(!j(e))return;let t=I(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},Qt=(e,t)=>(pt(t,e,!1),1),$t=(e,t)=>(pt(t,e,!0),!1),en=(e,t)=>(e.type!==void 0&&pt(e,t,!1),M(t)?e.rank-t.rank:-1),tn=(e,t)=>(e.type!==void 0&&pt(e,t,!0),M(t)&&e.name===t.name),nn={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},rn=(e,t,n)=>{let r=nn[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${L(e)} with ${r.other}:\n${L(t)}`},an=(e,t,n)=>{let r=Xt(n);if(!r){if(M(n))return Qt(n,t);throw new h(`Attempted to compare the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>on(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return on(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new h(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${L(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},on=(e,t)=>{for(let n=0;n<e.length;n++){let r=dn(e[n],t[n]);if(r!==0)return r}return 0},sn=(e,t)=>{let n=I(e);if(e.kind===`Function`&&pr(n)!==void 0){let r=j(t)?pr(t):void 0;return r?n.range.length-r.length||on(n.range,r):an({...n,low:1},e,t)}if(Pt(e)===`record`){let r=Zt(t);if(!r){if(M(t))return Qt(t,e);throw new h(`Attempted to compare record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length-r.domain.length||on(n.domain,r.domain)||on(n.range,r.range)}return an({...n,low:Yt(n.domain)},e,t)},cn=(e,t)=>St(e)||St(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),ln=(e,t)=>{let n=et(t)?t:P(t);return{elements:P(e).elements,otherElements:P(n).elements}},un=(e,t)=>{if(cn(e,t))return Dt(e,t);if(!et(e))return un(P(e),t);if(!A(t)){if(M(t))return Qt(t,e);throw new h(`Attempted to compare the set ${L(e)} with the value:\n${L(t)}`)}let n=ln(e,t);return n.elements.length-n.otherElements.length||on(n.elements,n.otherElements)},dn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return Dt(e,t);if(M(t))return Qt(t,e);throw new h(rn(e,t,!1))}return e.kind===`ModelValue`?en(e,t):j(e)?sn(e,t):un(e,t)},fn=(e,t)=>e.every((e,n)=>gn(e,t[n])),pn=(e,t,n)=>{let r=Xt(n);if(!r){if(M(n))return $t(n,t);throw new h(`Attempted to check equality of the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&fn(e.range,r.range);let i=e.low??r.low;return i===void 0?fn(e.domain,r.domain)&&fn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new h(`Attempted to compare an integer with non-integer:\n${L(e)}.`);return e===i+t})&&fn(e.range,r.range)},mn=(e,t)=>{let n=I(e);if(e.kind===`Function`&&pr(n)!==void 0){let r=j(t)?pr(t):void 0;return r?n.range.length===r.length&&fn(n.range,r):pn({...n,low:1},e,t)}if(Pt(e)===`record`){let r=Zt(t);if(!r){if(M(t))return $t(t,e);throw new h(`Attempted to check equality of record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length===r.domain.length&&fn(n.domain,r.domain)&&fn(n.range,r.range)}return pn({...n,low:Yt(n.domain)},e,t)},hn=(e,t)=>{if(cn(e,t))return Ut(e,t);if(!et(e))return hn(P(e),t);if(!A(t)){if(M(t))return $t(t,e);throw new h(`Attempted to check equality of the set ${L(e)} with the value:\n${L(t)}`)}let n=ln(e,t);return n.elements.length===n.otherElements.length&&fn(n.elements,n.otherElements)},gn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(M(t))return $t(t,e);throw new h(rn(e,t,!0))}return e.kind===`ModelValue`?tn(e,t):j(e)?mn(e,t):hn(e,t)},_n=e=>{let t=[];for(let n of e){let e=yn(n,t);e.isFound||t.splice(e.index,0,n)}return t},vn=(e,t)=>{let n=hr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},yn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=vn(e,()=>dn(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},bn=(e,t)=>t.some(t=>vn(t,()=>gn(t,e))),xn=/* @__PURE__ */ new WeakSet,Sn=e=>{typeof e==`object`&&(e.kind===`Set`&&(xn.add(e),e.elements.forEach(Sn)),e.kind===`Function`&&(e.domain.forEach(Sn),e.range.forEach(Sn)))},Cn=(e,t)=>gr(Ut,gn,e,t),wn=e=>{for(let t=1;t<e.length;t++)if(Dt(e[t-1],e[t])>=0)return!1;return!0},Tn=e=>{for(let t=1;t<e.length;t++)Vt(e[t]);if(e.length<2||wn(e))return At(e);let t=[...e].sort(Dt),n=[t[0]];for(let e=1;e<t.length;e++)Dt(n[n.length-1],t[e])!==0&&n.push(t[e]);return At(n)},En=e=>gr(Tn,e=>({kind:`MixedSet`,elements:e}),e,void 0),Dn=At([]),On=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Dt(r[a],t)<0;)a++;a<r.length&&Dt(r[a],t)===0||i.push(t)}return i.length===n.length?e:At(i)},kn=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Dt(r[a],t)<0;)a++;a<r.length&&Dt(r[a],t)===0&&i.push(t)}return i.length===n.length?e:At(i)},An=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=Dt(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=At(i);if(e.hash!==0&&e.hash!==Rr){let t=e.hash,n=0;for(;n<a.length;n++){let e=Ur(a[n]);if(e===Rr)break;t=t+Ir(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+qr(a[e])|0;c.fingerprint=t}return c},jn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Dt(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Dt(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return jt(n,r)},Mn=e=>{let t=jn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:it(t,e.map(e=>e[0]))},Nn=[],Pn=[],Fn=/* @__PURE__ */ new WeakMap,In=e=>{let t=Nn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Nn[e]=n,n},Ln=e=>{if(lr(e),e.low===1&&e.high>=1)return In(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Rn=e=>e.length>0&&(e===Nn[e.length]||Fn.has(e)),zn=e=>{let t=P(e).elements;return Rn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Bn=e=>{let t=Pn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Pn[e]=n,n},Vn=e=>Nt(jt(In(e.length),e),`tuple`),Hn=e=>Nt(jn(e),`record`),Un=(e,t)=>Nt(jt(e,t),`record`),Wn=e=>A(e)&&!St(e),Gn=(e,t=!1)=>`UNION(${L(e.base,t)})`,Kn=(e,t=e=>P(e).elements)=>{if(!Wn(e.base))throw new h(`Attempted to enumerate the nonenumerable set:\n${Gn(e)}`);return t(e.base)},qn=(e,t,n)=>{if(Wn(e))return e;throw new h(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(e)}\nwhen enumerating:\n${Gn(n)}`)},N=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return N(e.base);case`FunctionSet`:return N(e.domain)&&N(e.range)||Jn(e.domain)===!0||Jn(e)===!0;case`RecordSet`:return e.sets.every(N)||Jn(e)===!0;case`ProductSet`:return e.factors.every(N)||Jn(e)===!0;case`Union`:return N(e.base)&&nr(e.base).every(N);case`SetOperation`:return e.operator===`\\cup`?N(e.left)&&N(e.right):e.operator===`\\cap`?N(e.left)||N(e.right):N(e.left);default:return!1}},Jn=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=Jn(e.domain);return t===void 0?void 0:!t&&Jn(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Jn(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return N(e)?P(e).elements.length===0:void 0;default:return}},Yn=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},Xn=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},Zn=e=>{if(typeof e!=`object`||e.kind!==`Subset`||St(e.base))return;let t=P(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:Xn(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return At(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},Qn=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(At(r.map(t=>e[t])));while(Xn(r,e.length))}return t},$n=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(St(a))throw new h(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},er=(e,t=e=>P(e).elements)=>{if(typeof e!=`object`)throw new h(`Expected a set but found ${L(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return _n(e.elements);case`Interval`:{let t=Ln(e);return t!==Nn[t.length]&&Fn.set(t,e),t}case`Subset`:{if(lr(e.base)===0)return Qn([]);if(!A(e.base))throw new h(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${k(L(e.base))}`);let t=P(e.base).elements;if(t.length>30)throw new h(cr(e));return Qn(t)}case`FunctionSet`:{if(!gt.is174&&F(e))return[];if(St(e.domain))throw new h(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(e.domain)}\ncannot be enumerated.`);let n=zn(e.domain);if((n.length>0||gt.is174)&&St(e.range))throw new h(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${L(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return Yn(n.map(()=>r)).map(e=>jt(n,e))}case`RecordSet`:{if(!gt.is174&&F(e))return[];let n=$n(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${L(t)}`);return Yn(n).map(t=>Hn(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!gt.is174&&F(e))return[];let n=$n(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${L(e)}`);return Yn(n).map(Vn)}case`FilteredSet`:if(!A(e.base)||St(e.base))throw new h(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(e.base)}\nis not enumerable`);return P(e.base).elements.filter(e.test);case`Union`:{let t=Kn(e).flatMap((t,n)=>P(qn(t,n,e)).elements);return P(En(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Wn(e.left)||!Wn(e.right)))throw new h(`Attempted to enumerate S \\cup T when S:\n${L(e.left)}\nand T:\n${L(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Wn(e.left)&&!Wn(e.right))throw new h(`Attempted to enumerate S \\cap T when neither S:\n${L(e.left)}\nnor T:\n${L(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Wn(e.left))throw new h(`Attempted to enumerate S \\ T when S:\n${L(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return An(P(e.left),P(e.right)).elements;let t=e.operator===`\\`||Wn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return P(n).elements.filter(t=>_r(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new h(`Attempted to enumerate the non-enumerable set ${L(e)}`);default:throw new h(`Expected a set but found ${L(e)}`)}},tr=/* @__PURE__ */ new WeakMap,P=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return At(er(e));let t=typeof e==`object`?tr.get(e):void 0;if(t)return t;let n=hr.sets;n?.push(e);let r=er(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?At(r):Tn(r);return typeof e==`object`&&tr.set(e,i),i},nr=e=>{if(typeof e!=`object`||Lt.has(e))return P(e).elements;let t=hr.sets;t?.push(e);let n=or(e);return t?.pop(),n},rr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,ir=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(ir);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(ir)&&e.range.every(ir);case`SetOperation`:return e.operator!==`\\cup`&&ir(e.left)&&ir(e.right);case`FilteredSet`:return ir(e.base);case`ProductSet`:return e.factors.every(ir);default:return!1}},ar=e=>typeof e!=`object`||Lt.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?ar(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||ar(e.left)||ar(e.right):rr(e)?.some(ar)??!1,or=e=>{if(e.kind===`Union`)return Kn(e,nr).flatMap((t,n)=>nr(qn(t,n,e)));if(e.kind===`FilteredSet`&&!St(e.base))return nr(e.base).filter(e.test);if(rr(e)?.some(ar))return er(e,nr);if(e.kind!==`SetOperation`)return P(e).elements;if(e.operator===`\\cup`)return!Wn(e.left)||!Wn(e.right)?P(e).elements:[...nr(e.left),...nr(e.right)];let t=e.operator===`\\`||Wn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Wn(n)?nr(n).filter(t=>_r(t,r)===(e.operator===`\\cap`)):P(e).elements},F=e=>{if(typeof e!=`object`||!A(e))throw new h(`Shouldn't call isEmpty() on value ${L(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new h(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(F);case`RecordSet`:return e.sets.some(F);case`FunctionSet`:return!F(e.domain)&&F(e.range);case`Union`:return Kn(e).every((t,n)=>F(qn(t,n,e)));default:return P(e).elements.length===0}},sr=(e,t,n)=>e.reduce((e,r)=>{let i=e*lr(r,t);if(i>2147483647)throw new h(n());return i},1),cr=e=>`Overflow when computing the number of elements in:\n${L(e)}`,lr=(e,t)=>{if(typeof e!=`object`)throw new h(`Attempted to compute the number of elements in the ${tt(e)} ${L(e)}.`);switch(e.kind){case`ModelValue`:throw new h(`Attempted to compute the number of elements in the model value ${L(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return lr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new h(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new h(`Attempted to compute the number of elements in the overridden value ${L(e)}.`);case`Subset`:{let n=lr(e.base,t);if(n>=31)throw new h(cr(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(F(e.domain))return 1;if(F(e.range))return 0;if(lr(e.range,t)===1)return 1}let n=lr(e.domain,t),r=lr(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new h(cr(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&F(e)?0:sr(e.sets,t,()=>cr(e));case`ProductSet`:return t!==`1.7.4`&&F(e)?0:sr(e.factors,t,()=>`Overflow when computing the number of elements in ${L(e)}`);default:return Vt(e),P(e).elements.length}},ur=e=>`Attempted to check if the set ${L(e)}is finite.`,dr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new h(`Attempted to check if the ${tt(e)} ${L(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new h(`Attempted to check if the function:\n${L(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return dr(e.base)&&F(e.base);case`Subset`:return dr(e.base);case`FunctionSet`:{let t=dr(e.domain);if(t&&F(e.domain))return!0;let n=dr(e.range);return n&&F(e.range)?!0:n&&(t||lr(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!dr(e))n.isAllFinite=!1;else if(F(e))return!0;return n.isAllFinite}case`Union`:if(!Wn(e.base))throw new h(`Attempted to check if the nonenumerable set:\n${Gn(e)}\nis a finite set.`);return P(e.base).elements.every(dr);case`SetOperation`:if(e.operator===`\\cup`)return dr(e.left)&&dr(e.right);if(e.operator===`\\cap`){if(!dr(e.left)&&!dr(e.right))throw new h(ur(e));return!0}if(dr(e.left))return!0;if(!dr(e.right))throw new h(ur(e));return!1;case`FilteredSet`:if(!dr(e.base))throw new h(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(e.base)}\nis finite.`);return!0}},fr=(e,t,n=Dt)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},pr=e=>{if(typeof e!=`object`||!j(e))return;let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},mr=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!j(t))return`${n} ${tt(t)} ${L(t)}`;let r=Pt(t);return r===`record`?`Attempted to check if element:\n${L(e)}\nis in the record:\n${L(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${L(t)}`},hr={sets:void 0},gr=(e,t,n,r)=>{let i=hr.sets,a=hr.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof h))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},_r=(e,t)=>{let n=hr.sets;if(n===void 0)return br(e,t);n.push(t);let r=br(e,t);return n.pop(),r},vr=(e,t)=>fr(t.elements,e)!==-1,yr=(e,t)=>xn.has(t)?yn(e,t.elements).isFound:bn(e,t.elements),br=(e,t)=>{if(!A(t))throw new h(mr(e,t));switch(t.kind){case`Set`:return Vt(e),gr(vr,yr,e,t);case`MixedSet`:return bn(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!M(e))throw new h(`Attempted to check if the value:\n${L(e)}\nis in the integer interval ${L(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(M(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new h(`Attempted to check if the value:\n${L(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!A(e)||St(e))throw new h(`Attempted to check if the non-enumerable value\n${k(L(e))}\nis element of\n${k(L(t))}`);return P(e).elements.every(e=>_r(e,t.base));case`FunctionSet`:{if(!j(e)){if(M(e))return!1;throw new h(`Attempted to check if \n${L(e)}\nwhich is not a TLC function value, is in the set of functions:\n${k(L(t))}`)}let n=I(e),r=Yt(n.domain);return(r===void 0?Cn(t.domain,At(n.domain)):Cn({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>_r(e,t.range))}case`RecordSet`:{let n=j(e)?I(e):void 0;if(!n||!ct(n.domain)){if(M(e))return!1;throw new h(`Attempted to check if non-record\n${L(e)}\nis in the set of records:\n${L(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=fr(n.domain,e);return i!==-1&&_r(n.range[i],t.sets[r])})}case`ProductSet`:{let n=j(e)?pr(e):void 0;if(n===void 0){if(j(e)&&I(e).domain.every(e=>typeof e==`number`)||M(e))return!1;throw new h(`Attempted to check if non-tuple\n${L(e)}\nis in the set of tuples:\n${L(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>_r(e,t.factors[n]))}case`FilteredSet`:return _r(e,t.base)&&t.test(e);case`Union`:if(!Wn(t.base))throw new h(`Attempted to check if:\n ${L(e)}\nis an element of the non-enumerable set:\n ${Gn(t)}`);return P(t.base).elements.some(t=>_r(e,t));case`SetOperation`:return t.operator===`\\cup`?_r(e,t.left)||_r(e,t.right):_r(e,t.left)&&_r(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=pr(e);if(n===void 0){if(M(e))return!1;throw new h(`Attempted to check if the value:\n${k(L(e))}\nis an element of ${k(L(t))}.`)}return n.every(e=>_r(e,t.base))}default:throw new h(mr(e,t))}},xr=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?_r(e,n):e.range.every((e,r)=>xr(e,t.range[r],n.range)),I=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){N(e.domain)||lr(e.domain);let t=zn(e.domain);return Nt(jt(t,t.map(t=>e.apply(t))),Pt(e))}throw new h(`Expected a function but found ${L(e)}`)},Sr=(e,t,n)=>{let r=k(L(e)),i=k(L(t)),a=n===`1.7.4`;switch(Pt(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},Cr=(e,t)=>{if(!gt.is174)return Sr(e,t);let n=k(L(t));return Pt(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},wr=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},Tr=e=>new h(`Attempted to apply function with integer domain to the non-integer argument ${k(L(e))}`),Er=(e,t,n)=>{throw gt.is174||e.length<32?e.forEach(e=>gn(e,t)):fr(e,t,dn),n},Dr=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Pt(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new h(n(e,t));if(a===void 0&&!gt.is174&&Rn(r))throw Tr(t)}let i=wr(r,t);return i===-1?gr(fr,Er,r,t):i},Or=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!_r(t,e.domain))throw new h(Pt(e)===`lambda`?Sr(e,t):`Attempted to apply a function to ${L(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new h(`Attempted to apply ${L(e)}, which is not a function`);let r=n??Sr,i=Dr(e,t,r);if(i===-1)throw new h(r(e,t));return e.range[i]},kr=e=>Rn(e)?Fn.get(e)??Bn(e.length):void 0,Ar=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e).domain;return kr(t)??At(t)},jr=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!N(e.domain))){if(!_r(t,e.domain))return e;let r=n(e.apply(t));return Nt({kind:`LazyFunction`,domain:e.domain,apply:n=>Cn(t,n)?r:e.apply(n),source:e.source},Pt(e))}if(!j(e))throw new h(`Attempted to apply EXCEPT construct to the value ${k(L(e))}.`);let i=I(e),a=Dr(i,t,Cr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Nt(jt(i.domain,o),Pt(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Rr){let e=Ur(c);if(e!==Rr){let t=Ur(i.domain[a]);l.hash=s===c?i.hash:i.hash-Lr(t,Ur(s))+Lr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Jr(e,s)+Jr(e,c)|0}return l},Mr=/* @__PURE__ */ new WeakMap,Nr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Pr=(e,t)=>Math.imul(e^t,16777619),Fr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Nr(t)},Ir=e=>Nr(e+2654435769|0),Lr=(e,t)=>Nr(Math.imul(e,668265261)+t|0),Rr=795548749,zr=e=>{if(e.kind===`ModelValue`)return Nr(Pr(Fr(e.name),109));if(A(e)){if(!N(e))return Rr;let t=P(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Ur(t[e]);if(r===Rr)return Rr;n=n+Ir(r)|0}return n}if(e.kind===`LazyFunction`&&!N(e.domain))return Rr;let t=I(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=Ur(t.domain[e]),i=Ur(t.range[e]);if(r===Rr||i===Rr)return Rr;n=n+Lr(r,i)|0}return n},Br=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new h(`TLC has found a state in which the value of a variable contains ${L(e)}`);if(A(e)){P(e).elements.forEach(Br);return}let t=I(e);t.domain.forEach(Br),t.range.forEach(Br)},Vr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Ur(e)===Rr&&Br(e);return}catch(e){if(!(e instanceof h))throw e;return e}},Hr=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Ur=e=>{if(typeof e==`number`)return Nr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Fr(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=zr(e)),e.hash;let t=Mr.get(e);if(t!==void 0)return t;let n=zr(e);return Mr.set(e,n),n},Wr=/* @__PURE__ */ new WeakMap,Gr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Kr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Gr(t)},qr=e=>Gr(Xr(e)+2135587861|0),Jr=(e,t)=>Gr(Math.imul(Xr(e),374761393)+Xr(t)|0),Yr=e=>{if(e.kind===`ModelValue`)return Gr(Kr(e.name)^60);if(A(e)){if(!N(e))return Kr(Qr(e));let t=P(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+qr(t[e])|0;return n}let t=I(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Jr(t.domain[e],t.range[e])|0;return n},Xr=e=>{if(typeof e==`number`)return Gr(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return Kr(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Yr(e)),e.fingerprint;let t=Wr.get(e);if(t!==void 0)return t;let n=Yr(e);return Wr.set(e,n),n},Zr=/* @__PURE__ */ new WeakMap,Qr=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=Zr.get(e);if(t!==void 0)return t;let n=$r(e);return Zr.set(e,n),n},$r=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${Qr(e.base)}>`;if(e.kind===`FilteredSet`&&!N(e))throw new h(`Attempted to compare the non-enumerable set ${L(e)} with another value`);if(A(e))return N(e)?`{${P(e).elements.map(Qr).join(`,`)}}`:`<${e.kind} ${L(e)}>`;let t=I(e);return`(${t.domain.map((e,n)=>`${Qr(e)}:${Qr(t.range[n])}`).join(`,`)})`},ei=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,ti=e=>e.reduce((e,t)=>e===0?0:e*lr(t),1),ni=e=>{if(e.kind===`Subset`)return lr(e.base)<=6?P(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return P(e);if(e.kind===`FunctionSet`&&N(e.domain)&&lr(e.domain)===0)return At([jt([],[])]);let t=e.kind===`FunctionSet`?lr(e.range)**lr(e.domain):ti(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Dn:t<=1999?P(e):void 0},ri=(e,t)=>{if(t)return ni(e);if(N(e))try{return ni(e)}catch(e){if(e instanceof h)return;throw e}},ii=(e,t)=>{let n=e=>L(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return Gn(e,t)}},ai=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),oi=e=>{if(N(e.domain))try{return I(e)}catch(e){if(e instanceof h)return;throw e}},L=(e,t=!1,n=!1)=>{let r=e=>L(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return ei(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(P(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=ri(e,t);return n?r(n):ii(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?oi(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&gt.is174&&Pt(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&Pt(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Pt(e)===`record`||i.domain.every(e=>typeof e==`string`&&ai(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):at(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},si=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${k(L(n))}\n`).join(``)},ci=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),li=(e,t)=>ci.has(e)?new h(t):new p(t),ui=(e,t,n,r)=>new p(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${L(r)}`),di=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||di(r))throw li(n,`${n} expects a value as argument ${t+1}`);return r},fi=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`number`)throw li(n,`${n} expects an integer but received ${L(r)}`);return r},pi=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw li(n,`${n} expects a boolean but received ${L(r)}`);return r},mi=(e,t,n)=>{let r=R(e,t,n);if(!A(r))throw li(n,`${n} expects a set but received ${L(r)}`);return r},hi=(e,t,n)=>{let r=mi(e,t,n);if(!N(r))throw li(n,`${n} cannot enumerate the non-enumerable set ${L(r)}`);return r},gi=(e,t,n)=>P(hi(e,t,n)).elements,_i=(e,t,n)=>{let r=R(e,t,n),i=pr(r);if(!i)throw li(n,`${n} expects a sequence but received ${L(r)}`);return i},vi=(e,t,n)=>{let r=R(e,t,n);if(!j(r))throw li(n,`${n} expects a function but received ${L(r)}`);return I(r)},yi=(e,t,n)=>{let r=e[t];if(r===void 0||!di(r))throw li(n,`${n} expects an operator as argument ${t+1}`);return r},bi=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),z=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),xi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Si=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Ci=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),wi=e=>e>2147483647||e<-2147483648,Ti=e=>new p(`Overflow when computing ${e}`),Ei={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},Di={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Oi={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},ki={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ai=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Di[e.operator];if(e.kind!==`Function`)return Ei[e.kind];let t=Pt(e);return t===void 0?`FcnRcdValue`:ki[t]},ji=e=>Oi[Ai(e)],Mi=(e,t)=>new h(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Ni=(e,t)=>{let n=n=>(...r)=>{let i=hr.sets?.length??0;try{return n(...r)}catch(n){throw n instanceof h&&(e.isLazy===!0||!(n instanceof p))?(hr.sets&&(hr.sets.length=i),Mi(t,n.message)):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Pi=(e,t)=>{if(typeof e!=`number`)throw Mi(t,`Cannot cast tlc2.value.impl.${Ai(e)} to tlc2.value.impl.IntValue`);return e},Fi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Ii=(e,t,n,r)=>{let i=Fi(e,n,`IntValue`,2);return Ci(t,(e,n)=>{let a=Pi(e,i),o=Pi(n,i),s=r(a,o);if(wi(s))throw Ti(`${a}${t}${o}`);return s})},Li=(e,t,n)=>{if(typeof e!=`number`)throw new p(`The ${t} argument of ${n} should be an integer, but instead it is:\n${L(e)}`);return e},Ri=(e,t,n=e)=>Ci(e,(e,r)=>t(Li(e,`first`,n),Li(r,`second`,n))),zi=(e,t,n)=>({...Si(e,t,n),isLazy:!0}),Bi=(e,t,n)=>{let r=yi(e,t,n);return()=>r.call([])},Vi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Hi=()=>({bool:wl,condition:(e,t)=>{if(typeof e!=`boolean`)throw sl(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw cl(t,n,e);return e},apply:Or,expectFunction:xl,tuple:Vn,set:En,record:Un,writtenRecord:ot,equal:Ut,enumerate:Fl,unassigned:(e,t)=>{throw hl(e,t)},primeOutsideAction:e=>{throw _l(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:Sl,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>yl(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Ui={value:void 0},Wi=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Gi=e=>`local${e.counter++}`,Ki=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Ue(e).forEach(e=>Ki(e,t)),t),qi=(e,t,n)=>{let r=Wi(e,V(t,e.environment)),i=Ki(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Wi(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Ji=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>Gi(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Qi(e,t.set,s)}, ${Wi(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=Gi(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Qi(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Gi(e),a=Gi(e),o=Gi(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; let applied; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},Yi=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Qi(e,r[0],n)}, "the left side of =>") ? bool(${Qi(e,r[1],n)}, "the right side of =>") : true)`;if(O(t))return qi(e,t,n);let i=su(t.operator,e.environment);if(i?.kind!==`Builtin`)return qi(e,t,n);if(i.name===`DOMAIN`)return`${Wi(e,dl(t))}(${Qi(e,r[0],n)})`;if(i.name===`TLCEval`)return qi(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Wi(e,fl(t,i))}(${Qi(e,r[0],n)}, ${Qi(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&id(r[0],a))return`${Wi(e,i.evaluateUnary)}(${Qi(e,r[0],n)})`;let o=r.length===2&&id(r[0],a)&&id(r[1],a);return i.evaluateBinary&&o?`${Wi(e,i.evaluateBinary)}(${Qi(e,r[0],n)}, ${Qi(e,r[1],n)})`:qi(e,t,n)},Xi=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(O(e))return!1;let r=yu(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Xi(e.expression,t,n);case`FieldAccess`:return Xi(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Xi(e,t,n));default:return!1}},Zi=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Zi(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Zi);default:return!1}},Qi=(e,t,n)=>{let r=(t,r=n)=>Qi(e,t,r);if(Wu(t)&&zu(t,e.environment))return qi(e,t,n);switch(t.kind){case`Number`:return nt(t.value)?String(t.value):qi(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(O(t))return qi(e,t,n);let i=yu(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Wi(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Wi(e,i.value):qi(e,t,n)}case`Apply`:return Yi(e,t,n);case`And`:case`Or`:{let n=Wi(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Wi(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Dd(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Xi(t.function,n,e.environment)?r(t.function):Zi(t.function)?r(t.function,i):qi(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Wi(e,t)}))`,o=ul(e.environment.runtime.version),s=o?`, ${Wi(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${Wi(e,ll(t))}(${r(t.record)})`;case`Record`:{let i=jd(t.fields);if(Md(i))return qi(e,t,n);let a=Wi(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Wi(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=Wi(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Ji(e,t,n):qi(e,t,n);default:return qi(e,t,n)}},$i=(e,t)=>{if(!Vi.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=Qi(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
90
+ `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;Ui.value??=Hi();let o=Ui.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ea={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},ta={none:0,error:1,warning:3,state:4},na={0:``,1:`Error: `,3:`Warning: `,4:`State `},ra=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===ta.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
91
+ (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${na[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},ia=`The configuration file did not specify the initial state predicate.
92
+ Can also be caused by trying to run TLC on a specification from
93
+ a module imported with a parameterized INSTANCE statement.`,aa=[[1005,_,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
94
+ %1%`,!0],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
95
+ %1%,
96
+ but it produced the following error:
97
+ %2%`,!1],[2148,`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable %1% occurring in the state formula v.
98
+ `,!1],[2155,`Attempted to compare %1% with the value
99
+ %2%`,!0],[2158,`Attempted to check if the value:
100
+ %1%
101
+ is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
102
+ the following value:
103
+ %1%`,!0],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
104
+ %4%`,!0],[2176,`Applying %1% to the following value,
105
+ which is not %2%:
106
+ %3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
107
+ element is not a bag:
108
+ %1%`,!0],[2178,`Overflow when computing %1%`,!1],[2179,`The second argument of \\div is 0.`,!0],[2180,`0^0 is undefined.`,!0],[2181,`Attempted to compute cardinality of the value
109
+ %1%`,!0],[2182,`Evaluating an expression of the form %1% when s is not a %2%:
110
+ %3%`,!0],[2183,`The %1% argument of %2% must be in the domain of its %3% argument:
111
+ %4%
112
+ , but instead it is
113
+ %5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
114
+ on the right-hand side of a <- after already appearing on the
115
+ left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
116
+ is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,ia,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
117
+ %1%`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
118
+ %1%`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
119
+ but instead found %3%.
120
+ %4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
121
+ but didn't find one.
122
+ %3%`,!1],[2260,`In computing ENABLED, TLC encountered a temporal formula (%1%).
123
+ %2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
124
+ %2%`,!1],[2265,`TLC can't handle a number this big.
125
+ %1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
126
+ %4%`,!0],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
127
+ %2%`,!1],[2281,`The configuration file substitutes constant %1% with non-constant %2%%3%`,!1],[2283,`The argument of %1% should be a %2%, but instead it is:
128
+ %3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
129
+ The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
130
+ The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configuration file at line %1%
131
+ Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
132
+ It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
133
+ %1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
134
+ `,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]],oa={value:void 0},sa=()=>oa.value??=aa.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),ca=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,la=e=>ca.test(e)?void 0:sa().find(t=>t.pattern.test(e))?.message,ua=e=>e instanceof p||la(e.message)?.isEvalException===!0,da=/* @__PURE__ */ new Map([[1e3,`
135
+ : `],[2105,`failed.
136
+ `],[2154,`but it produced the following error:
137
+ `],[2213,`:
138
+ `],[2281,` - specifically: `]]),fa=(e,t,n)=>{let r=n?da.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${pa(t.slice(a),n)}`},pa=(e,t)=>{let n=t?la(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${ta.none} @!@!@\n${fa(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},ma=e=>String(e).padStart(2,`0`),ha=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${ma(r%24)}h`:e>36e5?`${ma(r%24)}h ${ma(n)}min`:e>6e4?`${ma(n)}min ${ma(t)}s`:`${ma(t)}s`},ga=e=>`${e.getFullYear()}-${ma(e.getMonth()+1)}-${ma(e.getDate())} ${ma(e.getHours())}:${ma(e.getMinutes())}:${ma(e.getSeconds())}`,_a=/* @__PURE__ */ new WeakMap,va=(t,n,r)=>{if(!(t instanceof h))return t;let a=i(new h(`${r}\n${t.message}`,t),e(t));return _a.set(a,{code:n,headline:r,inner:t}),a},ya=e=>_a.has(e),ba=l.slice(0,l.indexOf(`
139
+ `)),xa=`${l}tlc2.tool.EvalException: `,Sa=`${l}util.Assert$TLCRuntimeException: `,Ca=e=>ua(e)?xa:Sa,wa=e=>{try{return e()}catch(e){throw e instanceof h?ua(e)?new h(`${c}${e.message}`):la(e.message)?e:new h(`${l}${e.message}`):e}},Ta=[xa,Sa,l,c],Ea=(e,t)=>{let n=_a.get(e);if(n)return`${n.headline}\n${Ea(n.inner,t)}`;let r=e.message,i=Ta.find(e=>r.startsWith(e))??``;return`${i}${pa(r.slice(i.length),t)}`},Da=(e,t)=>{let n=_a.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Ea(e,!0)};if(t&&ua(e))return{code:la(r)?.code??ea.general,message:r,toolMessage:r};let i=t&&!r.startsWith(ba)?l:``;return{code:ea.general,message:`${i}${r}`,toolMessage:`${i}${Ea(e,!0)}`}},Oa=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),ka=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Aa=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Oa.has(e.kind))return!1;let a=ka(e);if(a!==void 0&&!O(e)&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&Ou(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return Ue(e).every(i)};return i(e)?[...n]:void 0},ja={kind:`Local`},Ma=/* @__PURE__ */ new WeakSet,Na=/* @__PURE__ */ new WeakMap,Pa=/* @__PURE__ */ new WeakMap,Fa=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Ia=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),La=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Ra=e=>e.kind===`Operator`?e.params.length:0,za=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ba=e=>e.name.includes(`!`),Va=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Ha=(e,t,n)=>{let r=t.bindings.get(e);return r&&La(r.position,t.location)&&(!n||La(r.position,n.start))?r:void 0},Ua=(e,t)=>e!==void 0&&t!==void 0&&f(e)===f(t),Wa=(e,t,n,r)=>{if(t===void 0)return!0;if(Ua(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=f(i),o=t.range&&f(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},Ga=(e,t,n,r)=>Wa(t,Va(e,t)??Ha(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Ka=(e,t,n)=>{Wa(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},qa=(e,t,n,r)=>t.reduce((e,t,i)=>Ga(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Ja=(e,t,n)=>t.reduce((e,t)=>Ga(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ya=e=>e.kind===`Name`?[e.name]:e.names,Xa=e=>e.flatMap(e=>Ya(e.pattern)),Za=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||La(n.location,t.location))?n:void 0},Qa=(e,t)=>{let n=Za(e,t);return n?{key:t.getKey(n),arity:Ra(n),params:za(n),kind:`Definition`}:t.imported.get(e)},$a=(e,t,n)=>Va(t,e)??Qa(e,n),eo=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),to=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:eo(e.location,e.spelling??t)},no=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return La(e.location,e.args[0].location)?`prefix`:`postfix`}},ro=e=>!/^[\p{L}\d_]/u.test(e),io=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),ao=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,oo=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},so=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?oo(e.name,[],void 0):oo(e.operator,e.args,e.argumentCounts),co=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),lo=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Xa(e.bounds),body:e.body,sets:co(e.bounds)};case`SetMap`:return{names:Xa(e.bounds),body:e.expression,sets:co(e.bounds)};case`SetFilter`:return{names:Ya(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ya(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},uo=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},fo=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,po=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),mo=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?mo(e.body,t):Ue(e).reduce((e,n)=>e??mo(n,t),void 0)},ho=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??ho(i,t,n||po(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&mo(e.set,t):mo(e,t)},go=e=>e.kind===`Label`?go(e.body):e,_o=e=>typeof e==`number`?`argument selector ${e}`:e,vo=`within the scope of a declaration
140
+ from outside that declaration's scope.`,yo=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:f(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&go(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:ho(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?mo(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&po(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${vo}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=_o(n.operand);if(l.isSufficesOpen){if(ao(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=go(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?$a(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=lo(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:uo(e);if(!c)return;let f=ao(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=ao(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(po(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${vo}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},bo=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:f(e.location.range),message:n}),!0)},xo=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=f(r),a=e.params.filter((r,i)=>{let a=Va(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:f(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},So=(e,t,n,r)=>{if(!fo(e))return!1;let i=so(e),a=i[0],o=i.length>1&&a.kind===`Name`?Va(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&yo(e,i,o,t,n,r),o!==void 0},Co=(e,t,n,r)=>{let i=e.location;if(No(e,n,r))return;let a=Pa.get(e);if(a!==void 0)return a;if(Fa(t))return e.kind===`Apply`?e.args.length:0;let o=Va(n,t);if(o?.isNonFact){r.errors.push({location:f(to(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(So(e,n,r,!1)||io(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=ja),o)return o.arity;let s=Qa(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Pa.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(Va(n,c)!==void 0||Qa(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=f(e.kind===`Apply`&&l===`-.`?eo(i,`-`):to(e,t));if(!ro(t)||io(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=no(e);d&&i.range&&r.errors.push({location:f(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},wo=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>qa(e,Ya(t.pattern),t.pattern.ranges,n),t)),To=(e,t)=>e.kind===`Identifier`&&e.name===t&&O(e)||Ue(e).some(e=>To(e,t)),Eo=(e,t)=>{e.kind===`FunctionConstruction`&&To(e.body,t)&&(e.isRecursive=!0),Ue(e).forEach(e=>Eo(e,t))},Do=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Xa(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:f(o),message:e})},c=e.kind===`Function`?wo(e.bounds,t,i):Ja(t,e.params,i),l=Va(c,a)??Ha(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(B(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Eo(e.body,a),e.isSelfReferential=To(e.body,a)):B(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:Wa(a,Va(t,a)??Ha(a,i,o),{kind:`Definition`,arity:Ra(e),range:o},i)},Oo=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Va(e,t.name)?.isPending)return e;let n={name:t.name,arity:Ra(t),params:za(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>zo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Fa(t.name)?e:s(e,e=>!La(t.location,e.location)),o={name:t.name,arity:Ra(t),kind:`Definition`,range:t.location.range,parent:a};if(Ba(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Fa(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Do(t,a,u,i)?{...o,params:za(t)}:a},a),()=>!0)},ko=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Va(t,r)??Ha(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Ao=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=ko(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:f(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},jo=(e,t,n)=>{if(Ao(e,t,n))return;let r=e.operator,i=$a(r,t,n),a=Co(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:f(e.argumentsRange??to(e,r)),message:`The operator ${r} requires ${a-(ko(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Mo(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:f(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=Co(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else B(i,t,n);return!0}if(i.kind===`Lambda`){B(i,t,n);let o=i.params.length===c;return!o&&Ma.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??to(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return B(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=$a(u,t,n)?.params??[],f=Co(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(to(i,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},Mo=(e,t,n)=>{e.kind===`Identifier`?Co(e,e.name,t,n):B(e,t,n)},No=(e,t,n)=>{let r=Na.get(e);return r?(r.args.forEach(e=>Mo(e,t,n)),n.errors.push(r.error),!0):!1},B=(e,t,n)=>{if(Ma.has(e)&&!n.isGenerated){B(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>B(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Ao(e,t,n))return;let r=e.name,i=Co(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:f(to(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Co(e,e.operator,t,n);return;case`Apply`:jo(e,t,n);return;case`Lambda`:B(e.body,qa(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&B(e.other,t,n);return;case`Let`:B(e.body,Oo(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(e.body,wo(e.bounds,t,n),i(Xa(e.bounds)));return;case`UnboundedQuantifier`:B(e.body,qa(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&B(e.set,t,n),B(e.body,qa(t,Ya(e.pattern),e.pattern.ranges,n),i(Ya(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:B(e.predicate,wo([e.bound],t,n),i(Ya(e.bound.pattern)));return;case`SetMap`:B(e.expression,wo(e.bounds,t,n),i(Xa(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:f(r.location.range??eo(r.location,r.name)),message:`Non-unique fields in constructor.`}),B(r.value,t,n)});return;case`Except`:B(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:B(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(bo(e,n))return;B(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),xo(e,t,n);return;case`Subexpression`:if(No(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Mo(e,t,n)),So(e,t,n,!1)}},Po=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Ao(e,t,n)||So(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&Va(t,r)?.isNonFact?n.errors.push({location:f(to(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||B(e,t,n)}),Fo=(e,t,n)=>(e.set&&B(e.set,t,n),Ga(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Io=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Fo(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Io(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},Lo=(e,t,n)=>e.kind===`AssumeProve`?Io(e,t,n):(B(e,t,n),t),Ro=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Po(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Bo(t,e,r),t)},zo=(e,t,n)=>{let r=Ko(e,t,n);return e.name===void 0?r:Ga(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Bo=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=Lo(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Ro(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Ro(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return Po(r.facts,t,n),o(t);case`Instance`:return o(zo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?zo(t,e,i):Oo([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),Ro(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),a(t);case`Take`:return a(qa(wo(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=qa(wo(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,o,{...i,labelParams:[...i.labelParams,...Xa(r.bounds),...r.names]}),Ro(e.proof,a(t),n),a(o)}default:return Ro(e.proof,a(t),n),a(t)}},Vo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Lo(e.statement,void 0,t);e.name!==void 0&&Ka(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Ro(e.proof,n,t),r&&(r.isInProof=!1)},Ho={line:0,column:0},Uo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Wo=(e,t)=>{let n=new Map([...Ia,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},Go=(e,n,r,i,a)=>{let o=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){B(r,o,a);return}let i=Co(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new t(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},c=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let t=e.name,r=n.find(e=>e.name===t);if(!r){a.errors.push({location:f(e.nameRange),message:`Identifier '${t}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let i=e.expression;s(r,i);let o=i.location.range;c.has(t)?o&&a.errors.push({location:f(o),message:`Multiple substitutions for symbol '${t}' in substitution.`}):c.set(t,i)});let l=n.filter(e=>!c.has(e.name)),u=e=>!Va(o,e.name)&&!Qa(e.name,a);return l.filter(e=>!u(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};s(t,n),c.set(t.name,n)}),l.filter(u).forEach(t=>{let n=e.location.range,i=t.location.range;n&&i&&a.errors.push({location:f(n),message:`Substitution missing for symbol ${t.name} declared at ${f(i)} \nand instantiated in module ${r}.`})}),c},Ko=(e,t,n)=>{let r=n.getInstance(e);return Go(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ga(e,t,r,n),t)},qo=(e,t,n,r)=>{let i=Wo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Go(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:Ho}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Jo=(e,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>La(e.location,t.location)?-1:+!!La(t.location,e.location)).forEach(e=>{let a=[],o=[];try{e.check(a,o)}catch(e){if(!(e instanceof t)||!e.sany&&a.length===0)throw e;a.push(...e.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},Yo=(e,t)=>{let n=Wo(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...Ia,...t.bound].map(([e,t])=>[e,{...t,position:Ho}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>Ka(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return Jo([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=Wa(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);Uo(e,t)?B(t.body,void 0,i):Do(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:Ra(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);Ja(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>Ka(t,e,i)),e.name!==void 0&&Ka(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);B(e.expression,void 0,r),e.name!==void 0&&Ka(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>Vo(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Po(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:f(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Xo=/* @__PURE__ */ new WeakSet,Zo=/* @__PURE__ */ new WeakSet,Qo=(e,t,n=/* @__PURE__ */ new Set)=>{let r=is(e,(e,r)=>Qo(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&O(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&O(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},$o=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),es=/* @__PURE__ */ new WeakMap,ts=e=>es.get(e)??e.name,ns=(e,t)=>(ts(t)!==e.name&&es.set(e,ts(t)),e),rs=(e,t)=>ns(e.kind===`Function`?{...e,bounds:$o(e.bounds,e=>t(e,[])),body:t(e.body,Xa(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),is=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>rs(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:$o(e.bounds,n),body:t(e.body,Xa(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,Ya(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,Ya(e.bound.pattern))};case`SetMap`:return{...e,bounds:$o(e.bounds,n),expression:t(e.expression,Xa(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},as=`LAMBDA`,os=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return is(e,(e,n)=>(r.push(...os(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},ss=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},cs=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),ls=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},us=(e,t)=>e.map(e=>({pattern:ls(e.pattern,t),set:e.set})),ds=(e,t)=>e.kind===`Function`?{...e,bounds:us(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},fs=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>ns({...ds(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:us(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:ls(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:ls(e.bound.pattern,n),set:e.bound.set}};default:return e}},ps=e=>`${e}@ENABLED`,ms=(e,t)=>e.modes.get(t)??e,hs=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!O(e)&&t.instantiation.variables.has(e.name),gs=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>gs(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(hs(e,t,n))return[e.name];let r=O(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?gs(r.body,t,/* @__PURE__ */ new Map):void 0},_s=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return hs(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:ps(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Ss(e.expression,ms(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Ss(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Ss(e.subscript,ms(t,`Primed`),n),location:r},Ss(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=gs(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:ps(r),location:e.location},location:e.location},Ss({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},vs=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:ja}),ys=(e,t)=>e.map(e=>vs(e.name,t)),bs=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...ys(t,r),...i.map(e=>vs(e,r))],location:r},location:r}},xs=(e,t)=>e.instantiation.isParameterized(t)?ws(e,t):void 0,Ss=(e,n,r)=>{let i=e=>Ss(e,n,r),a=n.instantiation,o=a.params,s=t=>!r.has(t)&&!O(e);if(e.kind===`Enabled`&&n.mode===`Normal`)return{...e,expression:Ss(e.expression,ms(n,`Enabled`),r)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&n.mode===`Normal`)return{...e,subscript:i(e.subscript),action:i(e.action),enabled:Ss(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},ms(n,`Enabled`),r)};let c=_s(e,n,r);if(c)return c;if(e.kind===`Identifier`&&s(e.name)){let t=a.substitutions.get(e.name);if(t)return Xo.add(t),t;let r=xs(n,e.name);if(r===void 0)return e;if(o.length===0)return{...e,name:r};let i=a.getDefinition(e.name);return i&&Ra(i)>0?bs(r,o,Ra(i),e.location):{kind:`Apply`,operator:r,args:ys(o,e.location),location:e.location}}if(e.kind===`Apply`&&s(e.operator)){let r=e.args.map(i),s=a.substitutions.get(e.operator),c=a.substitutions.size>0||o.length>0||Zo.has(e),l=e=>(c&&Zo.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let t=s.kind===`Identifier`?s.name:s.operator;return l({...e,operator:t,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...e,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:as,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...e,operator:as,args:r,resolution:ja},location:e.location};if(s)throw new t(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=xs(n,e.operator);return u===void 0?l({...e,args:r}):{...e,operator:u,args:[...ys(o,e.location),...r]}}if(e.kind===`OperatorReference`&&s(e.operator)){let t=xs(n,e.operator);if(t===void 0)return e;let r=a.getDefinition(e.operator);return o.length>0&&r?bs(t,o,Ra(r),e.location):{...e,operator:t}}let l=ss(n),u=is(e,(e,t)=>t.length===0?i(e):Ss(e,n,cs(r,t,l)));return fs(u,r,l)},Cs=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:vs(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ws=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=ss(e),o=ds(rs(i,(t,n)=>Ss(t,e,cs(/* @__PURE__ */ new Map,n,a))),a);return Cs(o,r.params,i.location)}):t},Ts=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>os(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>xs(i,e)??e,getQualifiedKey:t=>{let n=xs(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Cs(r,e.params,r.location)):t}}},Es=e=>e.kind===`Let`&&e.instances!==void 0||Ue(e).some(Es),Ds=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=is(e,e=>Ds(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>La(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},Os=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ks=(e,t)=>e.definitions.some(e=>Es(e.body))||e.assumptions.some(e=>Es(e.expression))||e.theorems.some(e=>{let t=Os(e);return t!==void 0&&Es(t)})?{...e,definitions:e.definitions.map(e=>rs(e,e=>Ds(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ds(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Os(e);return n===void 0?e:{...e,statement:Ds(n,t,[])}})}:e,As=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=hr.sets,a=i??[],o=a.length;hr.sets=a;try{return n()}catch(e){throw Xu(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,hr.sets=i}},js=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Ms=e=>!e.includes(void 0),Ns=e=>e.variables.map(()=>void 0),Ps=(e,t,n)=>{let r=[...e];return r[t]=n,r},Fs=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Is=e=>e.kind===`Identifier`?e.name:void 0,Ls=(e,t,n)=>{if(t.kind===`Label`)return Ls(e,t.body,n);let r=Is(t);if(r===void 0)return;let i=vl(n,r);if(i?.kind===`Thunk`)return Ls(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=su(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Ls(e,o.body,o.scope):void 0},Rs=(e,t,n)=>{if(t.kind===`Prime`)return Ls(e,t.expression,n);if(t.kind===`Label`)return Rs(e,t.body,n);let r=Is(t);if(r===void 0)return;let i=vl(n,r);if(i?.kind===`Thunk`)return Rs(e,i.expression,i.scope);if(i)return;let a=su(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Rs(e,a.body,a.scope):void 0},zs=e=>{if(typeof e!=`boolean`)throw new h(`TLC expected a boolean expression.`);return e},Bs=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Vs=(e,t,n)=>{t===void 0?Ms(n)&&e.onState(n):Ms(n)&&Bs(e)?Us(e,t,n):t.kind===`Predicate`?Ws(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?$s(e,t.expression,t.rest,t.scope,n):Hs(e,t,n)&&Vs(e,t.rest,n)},Hs=(e,t,n)=>{let r=e.environment,i=H(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return H(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?gl(t,r.runtime.version):t}})();return!Ut(i,a)},Us=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){$s(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Hs(e,r,n):!zs(H(r.expression,js(e,r.scope,n))))return}e.onState(n)},Ws=(e,t,n,r,i)=>As(e,t,()=>{switch(t.kind){case`Let`:Ws(e,t.body,n,Tu(t.definitions,js(e,r,i)),i);return;case`Label`:Ws(e,t.body,n,r,i);return;default:if(Zs.has(t.kind))throw new h(`The state relation is not a boolean expression.`);As(e,t,()=>Qs(e,t,n,r,i))}}),Gs=(e,t,n,r)=>{zs(t)&&Vs(e,n,r)},Ks=(e,t,n,r,i)=>{let a=js(e,r,i);if(t.kind===`Identifier`){let o=vl(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Ws(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Ws(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:su(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&kl(s,e.environment))){Ws(e,c.body,n,c.scope,i);return}Gs(e,H(t,a),n,i);return}let o=lu(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Ws(e,o.body,n,Cu(o,t.args,a),i):Gs(e,H(t,a),n,i)},qs=(e,t,n,r,i)=>{let a=n[r];a===void 0?Vs(e,t,Ps(n,r,i)):Ut(a,i)&&Vs(e,t,n)},Js=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Ys=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?Ls(e,a,r):Rs(e,a,r),c=js(e,r,i);if(s===void 0){H(t,c)===!0&&Vs(e,n,i);return}let l=H(o,c),u=i[s];if(t.operator===`=`){qs(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)H(t,c)===!0&&Vs(e,n,i);else{if(!Wn(d))throw new h(`The right side of \\IN is not enumerable.`);for(let t of nr(d))Vs(e,n,Ps(i,s,t))}},Xs=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Zs=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Qs=(e,t,n,r,i)=>{let a=js(e,r,i);switch(t.kind){case`Identifier`:Ks(e,t,n,r,i);return;case`Apply`:if(Xs.has(t.operator)&&t.args.length===2){Ys(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(zs(H(t.args[0],a))){Ws(e,t.args[1],n,r,i);return}Vs(e,n,i);return}Ks(e,t,n,r,i);return;case`And`:{let a=t.operands;if(t.isBulleted||a.length===2){let t=a.slice(1).reduceRight((e,t)=>Js(`Predicate`,t,r,e),n);Ws(e,a[0],t,r,i);return}let o=a[a.length-1];Ws(e,Fs(t,a.length-1),Js(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>Ws(e,t,n,r,i));return}Ws(e,Fs(t,a.length-1),n,r,i),Ws(e,a[a.length-1],n,r,i);return}case`Exists`:Bl(t.bounds,a,r=>(Ws(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(Bl(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Vs(e,n,i);return}let o=r.slice(1).reduce((e,n)=>Js(`Predicate`,t.body,n,e),n);Ws(e,t.body,o,r[0],i);return}case`If`:Ws(e,zs(H(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>zs(H(e.condition,a)))?.body??t.other;if(o===void 0)throw new h(`TLC encountered a CASE with no conditions true.`);Ws(e,o,n,r,i);return}case`FunctionApplication`:{let r=Gl(H(t.function,e.isInit?a:Sl(a)));if(r){Ws(e,r.body,n,Kl(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){$s(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){Ws(e,t.action,n,r,i),$s(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){Ws(e,t.action,Js(`Changed`,t.subscript,r,n),r,i);return}}Gs(e,H(t,a),n,i)},$s=(e,t,n,r,i)=>As(e,t,()=>{let a=Ls(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&qs(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Vs(e,n,i);return}let s=o.reduceRight((e,t)=>Js(`Unchanged`,t,r,e),n);$s(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=vl(r,t.name);if(a?.kind===`Thunk`){$s(e,a.expression,n,a.scope,i);return}let o=a?void 0:su(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){$s(e,o.body,n,o.scope,i);return}}let o=e.environment,s=H(t,{environment:o,scope:r,state:e.current,next:void 0}),c=H(t,{environment:o,scope:r,state:i,next:void 0});Ut(s,c)&&Vs(e,n,i)}),ec=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},tc=/* @__PURE__ */ Error(`The replay found a successor`),nc=(e,t,n,r)=>{let i=ec(r,!1,n,()=>{throw tc},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Js(`Changed`,e.subscript,t,void 0);Ws(i,e.action,n,t,Ns(r))}else Ws(i,e,void 0,t,Ns(r));return!1}catch(e){if(e!==tc)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},rc=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=ec(t,!0,void 0,n),o=i.reduceRight((e,t)=>Js(`Predicate`,t.expression,t.scope,e),void 0);Ws(a,r.expression,o,r.scope,Ns(t))},ic=(e,t,n,r)=>{e.some(e=>Zs.has(e.expression.kind))||e.forEach(e=>{let i=[],a=ec(n,!1,t,e=>i.push(e));Ws(a,e.expression,void 0,e.scope,Ns(n)),i.forEach(t=>r(t,e))})},ac=/* @__PURE__ */ new WeakMap,oc=/* @__PURE__ */ new WeakMap,sc=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},cc=(e,t,n)=>{let r=e.slice();return r[t]=n,r},lc=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,uc=(e,t)=>{let n=new h(t);return e.isInit?n:i(n,m.error)},dc=(e,t,n,r)=>{let i=ol(n);return r&&Zs.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${lc(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},fc=(e,t,n)=>{let r=ji(t),i=al(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${lc(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
141
+ `:``}${i}`},pc=(e,t,n)=>mc(e,t,H(t,n)),mc=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw uc(e,dc(e,n,t,r))},hc=(e,t,n,r)=>r.environment.callStack?H(n,r):(e[t]??=ed(n,r.environment))(r),gc=e=>e===`=`||e===`\\in`||e===`\\subseteq`,_c=(e,t,n)=>{let r=n?ac:oc,i=r.get(e);if(i)return i;let a=Wc(e,t,n);return r.set(e,a),a},vc=(e,t)=>{if(t.constants.has(e))return;let n=Tl(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},yc=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return yc(e.expression,t,!1,r);if(e.kind!==`Identifier`||O(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=vc(e.name,t);if(a&&!r.has(a))return r.add(a),yc(a.body,t,n,r)},bc=(e,t,n)=>yc(e,t,!n),xc=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return xc(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Tu(e.definitions,sc(r,t,n));return xc(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=vl(t,e.name);if(a?.kind===`Thunk`)return xc(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=vc(e.name,r.environment);if(s)return xc(s.body,void 0,n,r,i)},Sc=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||O(e))||!t&&e.kind===`Prime`,Cc=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Cc(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=vc(e.name,t);if(i)return n.add(e.name),Cc(i.body,t,n)},wc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Tc=(e,t,n)=>wc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||gc(e.operator)&&(Sc(e.args[0],n)||bc(e.args[0],t,n)!==void 0)||O(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Ec=/* @__PURE__ */ new Set,Dc=(e,t)=>{if(O(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return is(e,(e,i)=>{let a=r.isReadOnly?Dc(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Oc=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||O(e)?void 0:Tl(r,t);return i&&!n.has(i)&&(n.add(i),Oc(i.body,t,n))?!0:Ue(e).some(e=>Oc(e,t,n))},kc=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=bc(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=Cc(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return Tc(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:_c(e,t,n)}},Ac=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(Aa(e,t)===void 0||Oc(e,t,/* @__PURE__ */ new Set))return!0;let n=Dc(e,Ec);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},jc=(e,t,n)=>{let r=e.map(e=>kc(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Bs(t);for(let s=e;s<r.length;s++){if(s>0&&f&&qc(u)){d??=sc(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=hc(a,e,n,d);if(!mc(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=sc(t,n,u);let r=hc(i,s,e.expression,d);if(!mc(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=sc(t,n,u);let r=hc(i,s,e.value,d),a=u[e.index];if(a===void 0)u=cc(u,e.index,r),d=void 0;else if(!Ut(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=u[t];if(e===void 0)u=cc(u,t,n[t]),d=void 0;else if(!Ut(e,n[t]))return}continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},Mc=e=>(t,n,r,i,a,o)=>{pc(t,e,sc(t,n,r))&&o(r,i)},Nc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=sc(r,i,a);if(a[l]!==void 0){pc(r,e,u)&&c(a,o);return}let d=H(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Wn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${lc(r)}, the right side of \\IN is not enumerable.`;throw uc(r,`${t}\n${al(e)}`)}let p=nr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(cc(a,l,p[e]),o)}},Pc=/* @__PURE__ */ new WeakMap,Fc=e=>{let t=Pc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Fc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Pc.set(e,n),n},Ic=(e,t)=>{let n=e.args[0],r=Mc(e),i=(e,r,i)=>xc(n,r,i,e,!t)??-1,a=Nc(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=H(e.args[1],sc(t,n,o));l(cc(o,u,d),s)}},Lc=(e,t,n)=>{let r=al(e);return(i,a,o,s,c,l)=>{let u=sc(i,a,o),d=H(e.function,n?u:Sl(u)),f=Gl(d);if(f!==void 0){_c(f.body,t,n)(i,Kl(f,e,u),o,s,c,l);return}if(!j(d))throw uc(i,`In computing ${lc(i)}, a non-function (${ji(d)}) was applied as a function.\n${r}`);let p=H(e,u);if(typeof p!=`boolean`)throw uc(i,`In computing ${lc(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Rc=(e,t)=>{if(Cc(e,t))return jc([Fc(e)],t,!1);if(e.kind===`Tuple`)return _c(Fc(e),t,!1);let n=Fc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?vl(i,e.name):void 0;l?.kind===`Thunk`?_c(Fc(l.expression),t,!1)(r,l.scope,a,o,s,c):pc(r,n,sc(r,i,a))&&c(a,o)}},zc=(e,t,n)=>{let r=e.operator,i=Mc(e),a=O(e)?void 0:su(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=sd(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=_c(a.body,t,n),o.body(e,i(sc(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=sc(a,o,s),f=lu(e,d);f?.kind===`Closure`?_c(f.body,t,n)(a,Cu(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Bc=(e,t,n)=>{let r=Mc(e),i=O(e)?void 0:vc(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=vl(s,e.name);f?.kind===`Thunk`?_c(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=_c(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Vc=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||O(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!O(a))return;let o=yc(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>Vc(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||O(e))return;let r=su(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Vc(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(i&&o?.kind===`Identifier`&&O(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Hc=(e,t,n)=>{let r=vl(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Uc=(e,t,n)=>{let r=e.map(e=>_c(e,t,n)),i=n?[]:e.map(e=>Vc(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&Hc(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},Wc=(e,t,n)=>{let r=e=>_c(e,t,n);switch(e.kind){case`And`:return jc(e.operands,t,n);case`Or`:return Uc(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=Nl(H(a.set,sc(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,yl(r,e,u[t]),o,s,c,l)}}let o=n?void 0:Ac(e,t);if(o){let r=jc(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=sc(n,i,a),d=e.bounds.map(e=>Nl(H(e.set,u),e.set,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=yl(t,o.names[e],r);if(e===d.length-1){let e=sc(n,i,a);if(!o.guards.every(t=>pc(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Bl(e.bounds,sc(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Aa(e,t)!==void 0&&!Oc(e.body,t,/* @__PURE__ */ new Set)?Dc(e,Ec):void 0;return(t,n,r,o,s,c)=>{let l=[];Bl(e.bounds,sc(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>vl(n,e)?.kind===`Value`)){u.every(n=>pc(t,e.body,sc(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&qc(r)?u.slice(n).every(n=>pc(t,e.body,sc(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=H(e.condition,sc(r,i,a));if(typeof l!=`boolean`)throw uc(r,fc(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=sc(r,i,a),u=t.find(e=>{let t=H(e.condition,l);if(typeof t==`boolean`)return t;throw uc(r,`In computing ${lc(r)}, a non-boolean expression${r.isEnabled?``:` `}(${ji(t)}) was used as a guard condition of a CASE.\n${ol(e.source)}`)})?.body??n;if(!u)throw uc(r,`In computing ${lc(r)}, TLC encountered a CASE with no conditions true.\n${al(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Fu(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Tu(e.definitions,sc(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new h(`UNCHANGED appears in an initial predicate at ${rl(e)}`)}:Rc(e.expression,t);case`AngleAction`:{let n=r(e.action),i=Fc(e.subscript),a=(e,n,r)=>{try{return pc(e,i,sc(e,n,r))}catch(n){throw e.isEnabled?gl(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,Fc(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Bc(e,t,n);case`FunctionApplication`:return Lc(e,t,n);case`Apply`:{let i=e.args;if(gc(e.operator)){let r=bc(i[0],t,n);if(r!==void 0)return e.operator===`=`?jc([e],t,n):Nc(e,()=>r);if(Sc(i[0],n))return Ic(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=H(i[0],sc(t,n,r));(typeof c==`boolean`?c:wl(c,`the left side of => at ${rl(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return zc(e,t,n)}default:return Mc(e)}},Gc=/* @__PURE__ */ new WeakMap,Kc=e=>{let t=Gc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Gc.set(e,n),n},qc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Jc=(e,t)=>{let n=t.state;if(!n||!qc(n))throw new h(`ENABLED needs a complete state at ${rl(e)}`);let r=t.environment;if(r.callStack)return nc(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return _c(e,r,!1)(i,t.scope,Kc(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Yc=(e,t,n,r)=>{let a={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};_c(e,t,!0)(a,r,Kc(t),void 0,!1,e=>{if(!a.isStopped){if(!qc(e))throw i(new ee([...e]),m.error);a.isStopped=n(e)}})},Xc=(e,t,n)=>{let r=[];return Yc(e,t,e=>(r.push(e),!1),n),r},Zc=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return _c(e,n,!1)(a,i,Kc(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!qc(e)){let r=n.variables.filter((t,n)=>e[n]===void 0);throw new y(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Qc=(e,t,n,r)=>{let i=[];return Zc(e,t,n,e=>(i.push(e),!1),r),i},$c=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),el=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),tl=e=>el.has(e.kind)||e.kind===`Apply`&&$c.has(e.operator),nl=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&$e(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},rl=e=>`line ${e.location.line}, column ${e.location.column}`,il=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,al=e=>{let t=e.location.range;return t?il(t):rl(e)},ol=e=>e.kind===`Number`?e.text??String(e.value):al(e),sl=(e,t)=>new h(`A non-boolean expression (${ji(t)}) was used as the condition of an IF.\n${al(e)}`),cl=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new h(`A non-boolean expression (${ji(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${ol(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new h(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${ji(n)}.\n${al({...e,location:{...e.location,range:{...r,end:i}}})}`)},ll=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${L(n)}\n${al(e)}`,r=e=>`Attempted to apply function:\n${k(L(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!j(i))throw new h(`Attempted to select field "${t}" from a non-record value ${k(L(i))}\n${al(e)}`);let a=Pt(i);if(a===`tuple`)throw Tr(t);return Or(i,t,a===`record`?n:r)}},ul=e=>e===`1.7.4`?(t,n)=>Sr(t,n,e):void 0,dl=e=>t=>{if(!j(t))throw new h(`Attempted to apply the operator DOMAIN to a non-function\n(${ji(t)})\n${al(e)}`);return Ar(t)},fl=(e,t)=>(n,r)=>{if(!A(n)||St(n))throw new h(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${al(e)}`);return t.evaluate([n,r])},pl=e=>i(new h(`TLC can't handle real numbers: ${e.text} at ${rl(e)}`),m.configParseError),ml=e=>i(new h(`TLC can't handle a number this big: ${e.text??e.value} at ${rl(e)}`),m.error),hl=(e,t)=>new u(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${al(t)}`,e),gl=(e,t)=>e instanceof u&&t!==`1.7.4`?new h(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,_l=e=>new h(`A primed expression appears outside an action at ${rl(e)}`),vl=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},yl=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),bl=(e,t,n)=>{if(t.kind===`Name`)return yl(e,t.name,n);let r=pr(n);if(!r||r.length!==t.names.length)throw new h(`Cannot bind <<${t.names.join(`, `)}>> to ${L(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>yl(e,t,r[n]),e)},xl=(e,t)=>{if(j(e))return e;throw new h(`A non-function (${ji(e)}) was applied as a function.\n${al(t)}`)},Sl=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Cl=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),wl=(e,t)=>{if(typeof e!=`boolean`)throw new h(`Expected ${t} to be a boolean but found ${L(e)}`);return e},Tl=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),El=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Dl=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),Ol=(e,t)=>{if(El.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&Dl.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=Tl(n,t);if(e&&!t.constants.has(n)&&!kl(e,t))return!0}return Ue(e).some(e=>Ol(e,t))},kl=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!Ol(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>Ol(e.set,t)));return t.constantLevels.set(e,r),r},Al=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},jl=(e,t,n)=>{if(!A(e)||St(e)){let r=L(e),i=n===`1.7.4`?void 0:Al(e,r);throw new h(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${ol(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${ol(t)}\n${i}`)}},Ml=(e,t,n)=>(jl(e,t,n),typeof e==`object`&&e.kind===`Interval`?Ln(e):Zn(e)??P(e).elements),Nl=(e,t,n)=>n===`1.7.4`?(jl(e,t,n),Zn(e)??nr(e)):Ml(e,t,n),Pl=e=>{if(typeof e==`object`&&e.kind===`Interval`)return lr(e),e},Fl=(e,t,n)=>Pl(e)??Nl(e,t,n),Il=(e,t,n)=>Pl(e)??Ml(e,t,n),Ll=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},Rl=(e,t)=>e.map(e=>Fl(H(e.set,t),e.set,t.environment.runtime.version)),zl=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Ll(t[n],t=>i(n-1,bl(a,e[n].pattern,t)));return i(e.length-1,n)},Bl=(e,t,n)=>zl(e,Rl(e,t),t.scope,n),Vl=(e,t)=>{let n=e.map(e=>H(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Hl=(e,t,n)=>{if(e.length===1)return bl(t,e[0].pattern,n);let r=pr(n)??[];return e.reduce((e,t,n)=>bl(e,t.pattern,r[n]),t)},Ul=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Wl=e=>Object.assign(e.value,{lambda:e}),Gl=e=>Ul(e)?e.lambda:void 0,Kl=(e,t,n)=>{let r=e.value,i=t.args.map(e=>H(e,n)),a=i.length===1?i[0]:Vn(i),o=(e,n,i)=>`In applying the function\n${k(L(r))},\nthe ${e} is:\n${k(L(n))}${i}.\n${al(t.function)}`,s=e.bounds;if(s.length===1){if(!_r(a,r.domain))throw new h(o(`first argument`,a,`which is not in its domain`));return Hl(s,e.scope,a)}let c=pr(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new h(`Attempted to apply a function to an argument not in its domain.\n${al(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!_r(n,l[t]))throw new h(o(r,n,`${e.pattern.kind===`Name`?``:`
142
+ `}which is not in its domain`));if(e.pattern.kind===`Tuple`&&pr(n)?.length!==e.pattern.names.length)throw new h(o(r,n,`which does not match its formal parameter`))}),Hl(s,e.scope,Vn(c.slice(0,s.length)))},ql=/* @__PURE__ */ new WeakMap,Jl=(e,t)=>{let n=ql.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:il(r)};return ql.set(t,i),i},Yl=(e,t,n)=>{let r=Jl(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},Xl=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Ur(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(Gt(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},Zl=/* @__PURE__ */ new WeakMap,Ql=e=>{let t=Zl.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return Zl.set(e,n),n},$l=(e,t)=>{let n=Vl(e.bounds,t),r=Xl(n,(n,r)=>H(e.body,Cl(t,Hl(e.bounds,yl(void 0,e.name,r),n))),Yl(e.bounds,e.body,n));return Wl({value:r,bounds:e.bounds,body:e.body,scope:yl(void 0,e.name,r)}),e.bounds.length===1?Ft(r):r},eu=(e,t)=>{if(typeof t!=`object`||Pt(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!$e(t.domain))return t;try{let e=I(t);return jt(e.domain,e.range)}catch(e){if(e instanceof h)return t;throw e}},tu=(e,t)=>e.kind===`Function`?e.isSelfReferential?$l(e,t):H(Ql(e),t):H(e.body,t),nu=(e,t)=>{let n=kl(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new h(`Operator ${e.name} requires ${e.params.length} arguments`);let i=Cl(t,void 0);if(!n)return tu(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>eu(e,tu(e,i)));return t.environment.definitionValues.set(e,a),a},ru=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(!(t.constants.has(n)||t.substitutions.has(n))&&kl(e,t))try{Sn(nu(e,{environment:t,scope:void 0,state:void 0,next:void 0}))}catch(e){if(!(e instanceof h)&&!a(e))throw e}}),iu=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=H(e.expression,Cl(t,e.scope));return n&&(!e.isStreamed||ir(r))&&(e.cache=r),r},au=/* @__PURE__ */ new WeakMap,ou=e=>{let t=au.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return au.set(e,n),n},su=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return su(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?ou(r):t.builtins.get(e)},cu=/* @__PURE__ */ new WeakMap,lu=(e,t)=>{if(O(e))return uu(e.operator,t);let n=cu.get(e),r=n===void 0?su(e.operator,t.environment)??null:n;return n===void 0&&cu.set(e,r),r??uu(e.operator,t)},uu=(e,t)=>{let n=vl(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return su(e,t.environment)},du=e=>e.kind===`Closure`?e.params.length:e.arity,fu=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:uu(n,t);if(!r)throw new h(`Expected an operator argument at ${rl(e)}`);return r},pu=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>yl(e,n.name,t[r]),e.scope);return H(e.body,Cl(n,r))},mu=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:du(e),call:n=>pu(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},hu=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=uu(e.name,t);return n!==void 0&&du(n)>0},gu=(e,t)=>e.map(e=>hu(e,t)?mu(fu(e,t),t):H(e,t)),_u=(e,t)=>new h(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),vu=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),yu=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return yu(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},bu=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&nt(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=O(e)?void 0:yu(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=vl(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:vu(e,t)}}return t=>vu(e,t)},xu=/* @__PURE__ */ new WeakMap,Su=(e,t)=>{let n=xu.get(e);if(n)return n;let r=bu(e,t);return xu.set(e,r),r},Cu=(e,t,n,r)=>{if(t.length!==e.params.length)throw _u(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:fu(t[a],n)}:(r?.[a]??Su(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},wu=(e,t,n,r,i)=>{if(e.kind===`Closure`){let a=Cl(n,Cu(e,t,n,i));return n.environment.callStack?H(e.body,a):(r.entry?.body===e.body?r.entry:r.entry={body:e.body,evaluator:ed(e.body,n.environment)}).evaluator(a)}return e.kind===`Operator`?e.call(t.map(e=>H(e,n))):e.isLazy?e.evaluate(ad(t,n),n):e.evaluate(gu(t,n),n)},Tu=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1},i):r.params.length>0||n?.impure.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(r)??!1},i)},t.scope),Eu=(e,t,n)=>{let r=vl(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return iu(r,n);if(r?.kind===`Operator`){if(du(r.operator)===0)return pu(r.operator,[],n);throw new h(`Operator ${e} is used without arguments`)}let i=yu(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw hl(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return nu(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new h(`Unknown identifier ${e} at ${rl(t)}`)},Du=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Ou=(e,t)=>Du.has(e)||t.builtins.get(e)?.isStateLevel===!0,ku={builtins:Du,definitions:/* @__PURE__ */ new WeakMap},Au={builtins:new Set([...Du].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},ju=(e,t)=>e.kind===`Operator`&&e.params.length===0&&kl(e,t),Mu=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!O(e)){let e=Tl(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!ju(e,t)&&Nu(e,t,n))return!0}return Ue(e).some(e=>Mu(e,t,n))},Nu=(e,t,n=ku)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Mu(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Mu(e.set,t,n));return n.definitions.set(e,i),i},Pu={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},Fu=(e,t)=>({impure:new Set(e.filter(e=>Nu(e,t))),streamed:new Set(e.filter(e=>Nu(e,t,Pu)))}),Iu=e=>[...e.definitions.values()].some(t=>Nu(t,e)),Lu=e=>[...e.definitions.values()].some(t=>Nu(t,e,Au)),Ru=/* @__PURE__ */ new WeakMap,zu=(e,t)=>{let n=Ru.get(e);if(n!==void 0)return n;let r=Uu(e,t,Vu);return Ru.set(e,r),r},Bu=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),Vu=/* @__PURE__ */ new Set,Hu=(e,t,n)=>n.size===0?zu(e,t):Uu(e,t,n),Uu=(e,t,n)=>{if(!Bu.has(e.kind))return!1;if(e.kind===`Identifier`&&O(e))return n.has(e.name);if(O(e))return!1;if(e.kind===`Identifier`){let n=yu(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&ju(n.definition,t)}if(e.kind===`Apply`){if(Ou(e.operator,t)||Pu.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=su(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=Tl(e.operator,t);if(!n||!kl(n,t)||Nu(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&Hu(e,t,n))}let r={value:!0};return is(e,(e,i)=>(r.value&&=Hu(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Wu=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Gu=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},Ku=(e,t)=>{if(e.kind===`Identifier`&&O(e))return!t.has(e.name);if(O(e))return!0;let n={value:!1};return is(e,(e,r)=>(n.value||=Ku(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},qu=(e,t)=>Xo.has(e)&&Wu(e)&&Aa(e,t)!==void 0&&!Ku(e,Vu),Ju=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,Yu=(e,t,n,r)=>i=>{r.expressions.push(e);let a=hr.sets,o=hr.callStack,s=a??[],c=s.length;hr.sets=s,hr.callStack=r;try{let a=t(i),o=Ju(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&tl(e)&&r.sources.set(o,e),o}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=nl(e,r.values),a=i&&!Ue(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!j(a)?void 0:a;throw Xu(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,hr.sets=a,hr.callStack=o}},Xu=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof h){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},Zu=(e,t,n)=>{if(!(n instanceof h))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},Qu=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),V=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Pd(e,t),i=t.callStack,a=i?Yu(e,r,t,i):Wu(e)&&zu(e,t)?Gu(r):qu(e,t)?rd(r):r;return t.evaluators.set(e,a),a},$u=/* @__PURE__ */ new WeakMap,ed=(e,t)=>{if(t.callStack)return V(e,t);let n=$u.get(e);if(n)return n;let r=(Wu(e)&&zu(e,t)?void 0:$i(e,t))??V(e,t);return $u.set(e,r),r},H=(e,t)=>ed(e,t.environment)(t),td=(e,t)=>{let n=e.name,r=O(e)?void 0:yu(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw hl(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&kl(e,t))return t=>nu(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=ed(e.body,t),n.body(Cl(r,void 0)));return nd(e,t)?rd(r):r}return t=>nu(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>nu(e,t);return kl(e,t)||!nd(e,t)?n:rd(n)}return t=>Eu(n,e,t)},nd=(e,t)=>Aa(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Aa(e.set,t)!==void 0)),rd=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},id=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||O(e))return!0;let n=su(e.name,t);return n===void 0||du(n)===0},ad=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>H(e,t),expression:e})),od=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(ad(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&id(t[0],n)){let e=V(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&id(t[0],n)&&id(t[1],n);if(i&&a){let e=V(t[0],n),r=V(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(gu(t,n),n)},sd=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw _u(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Su(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:fu(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},cd=()=>({calls:/* @__PURE__ */ new Map,size:0,state:void 0}),ld=/* @__PURE__ */ new WeakMap,ud=e=>{let t=ld.get(e);if(t)return t;let n={constant:cd(),state:cd()};return ld.set(e,n),n},dd=e=>e.kind===`ExceptAt`||Ue(e).some(dd),fd=/* @__PURE__ */ new WeakMap,pd=(e,t)=>{let n=fd.get(e);if(n!==void 0)return n;let r=Aa(e,t)!==void 0&&Dc(e,Vu),i=r&&[...new Set(dd(e)?[...r,`@`]:r)];return fd.set(e,i??!1),i??!1},md=e=>typeof e!=`object`||e.kind===`ModelValue`||e.kind===`Set`||e.kind===`Function`||e.kind===`Interval`,U={sources:[],sourceCount:0,args:[],argCount:0,hash:0,isStateKeyed:!1},hd=e=>typeof e==`object`&&e.kind===`ModelValue`?e.rank:Ur(e),gd=e=>md(e)?(U.sources[U.sourceCount++]=void 0,U.args[U.argCount++]=e,U.hash=Pr(U.hash,hd(e)),!0):!1,_d=(e,t,n)=>{if(!t)return!1;U.sources[U.sourceCount++]=e,U.isStateKeyed=!0;for(let e=0;e<t.length;e++){let r=vl(n,t[e]);if(r?.kind!==`Value`||!md(r.value))return!1;U.args[U.argCount++]=r.value,U.hash=Pr(U.hash,hd(r.value))}return!0},vd=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&nt(e.value))return()=>gd(e.value);if(e.kind===`Identifier`){let n=O(e)?void 0:yu(e.name,t);if(n?.kind===`Value`)return()=>gd(n.value);if(n===void 0)return n=>{let r=vl(n.scope,e.name);return r?.kind===`Value`?gd(r.value):r?.kind!==`Thunk`||r.state!==n.state?!1:_d(r.expression,pd(r.expression,t),r.scope)}}let n=pd(e,t);return t=>_d(e,n,t.scope)},yd=e=>{if(e.args.length!==U.argCount||e.sources.length!==U.sourceCount)return!1;for(let t=0;t<U.sourceCount;t++)if(e.sources[t]!==U.sources[t])return!1;for(let t=0;t<U.argCount;t++)if(!Gt(e.args[t],U.args[t]))return!1;return!0},bd=e=>{if(e!==void 0){for(let t=0;t<e.length;t++)if(yd(e[t]))return e[t]}},xd=(e,t)=>{let n=Tl(e.operator,t);if(n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&!Nu(n,t))return kl(n,t)?`constant`:nd(n,t)?`state`:void 0},Sd=(e,t,n,r)=>{let i=sd(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=ed(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r||t.length!==e.params.length)return e=>o(i(e),e);let s=ud(e),c=t.map(e=>vd(e,n)),l={hits:0,misses:0};return e=>{if(e.isKeepLazy)return o(i(e),e);U.sourceCount=0,U.argCount=0,U.hash=t.length,U.isStateKeyed=!1;for(let t=0;t<c.length;t++)if(!c[t](e))return o(i(e),e);let n=r===`state`||U.isStateKeyed;if(n&&l.misses>1024&&l.hits<l.misses)return o(i(e),e);let a=n?s.state:s.constant;n&&a.state!==e.state&&(a.state=e.state,a.calls.clear(),a.size=0);let u=U.hash&1073741823,d=a.calls.get(u),f=bd(d);if(f)return n&&l.hits++,f.value;n&&l.misses++;let p=U.sources.slice(0,U.sourceCount),m=U.args.slice(0,U.argCount),ee=o(i(e),e);if(a.size<65536){a.size++;let e={sources:p,args:m,value:ee};d?d.push(e):a.calls.set(u,[e])}return ee}},Cd=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=V(n[0],t),r=V(n[1],t);return t=>!wl(e(t),`the left side of =>`)||wl(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new h(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=O(e)?void 0:su(e.operator,t);if(r?.kind===`Closure`){let i=t.callStack?void 0:xd(e,t);return Sd(r,n,t,i)}if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=V(n[0],t),i=dl(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=V(n[0],t);return Zo.has(e)||Ol(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=V(n[0],t),a=V(n[1],t),o=fl(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return od(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new h(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let i={entry:void 0},a=n.map(e=>Su(e,t));return r=>{let o=uu(e.operator,r);if(o)return wu(o,n,r,i,a);throw t.definitions.get(e.operator)?.kind===`Function`?new h(`${e.operator} is a function; apply it with brackets`):new h(`Unknown operator ${e.operator} at ${rl(e)}`)}},wd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=V(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=V(a.set,t);return s=>Ll(Fl(o(s),a.set,t.runtime.version),t=>wl(i(Cl(s,yl(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>V(e.set,t));return s=>{let c=a.map((e,n)=>Fl(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?wl(i(Cl(s,a)),r)!==n:Ll(c[t],n=>l(t-1,yl(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Bl(o,e,t=>wl(i(Cl(e,t)),r)!==n)?!n:n},Td=(e,t)=>{if(e.kind===`Tuple`)return Vn(e.names.map(e=>{let n=vl(t,e);return n?.kind===`Value`&&n.value}));let n=vl(t,e.name);return n?.kind===`Value`?n.value:void 0},Ed=/* @__PURE__ */ new WeakSet,Dd=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Ed.add(e)},Od=(e,t)=>{let n=Ed.has(e),r=V(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=V(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=zn(e),o=jt(i,i.map(e=>r(Cl(t,yl(t.scope,n,e)))));return $e(e)?o:Ft(o)}let n=[],s=i.map(e=>Il(H(e.set,t),e.set,t.environment.runtime.version));return zl(i,s,t.scope,e=>{let o=i.length===1?Td(a.pattern,e)??!1:Vn(i.map(t=>Td(t.pattern,e)??!1));return n.push([o,r(Cl(t,e))]),!1}),jn(n)},l=(t,n)=>{let a=Wl({value:Xl(t,e=>r(Cl(n,Hl(i,n.scope,e))),Yl(i,e.body,t)),bounds:i,body:e.body,scope:n.scope});return i.length===1?Ft(a):a},u=t.callStack;return t=>{let r=o?s(t):Vl(i,t);if(e.isRecursive||n||t.isKeepLazy||!N(r))return l(r,t);if(!$e(r)){if(u)return l(r,t);try{return c(r,t)}catch(e){if(!(e instanceof h))throw e;return l(r,t)}}if(!u)return c(r,t);try{return c(r,t)}catch(t){throw Zu(u,e,t),t}}},kd=(e,t)=>{let n=Ed.has(e);n&&Dd(e.function);let r=V(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>V(e,t))}),value:V(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Vn(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Cl(i,yl(i.scope,`@`,e))):jr(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(ea.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${al(e.function)}`)}return n}},Ad=(e,t)=>{if(e.kind===`SetFilter`){let n=V(e.predicate,t),r=V(e.bound.set,t),i=e.bound.pattern,a=e.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:il(a)},s=(e,t)=>n=>wl(e(Cl(t,bl(t.scope,i,n))),`a set filter predicate`),c=(t,n,r)=>({kind:`FilteredSet`,base:t,test:s(r,n),source:o,rebind:r=>c(t,{...n,environment:r},V(e.predicate,r))});return e=>{let t=r(e);return $e(t)?At(P(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=V(e.expression,t);return t=>{let r=[];return Bl(e.bounds,t,e=>(r.push(n(Cl(t,e))),!1)),En(r)}}let n=e.set;if(!n)return()=>{throw new h(`TLC cannot evaluate an unbounded CHOOSE at ${rl(e)}`)};let r=V(e.body,t),i=V(n,t);return t=>{let a=i(t);if(!A(a)||St(a))throw new h(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${al(e)}`);let o={value:void 0},s=Il(a,n,t.environment.runtime.version);if(Ll(s,n=>{let i=bl(t.scope,e.pattern,n);return wl(r(Cl(t,i)),`the body of CHOOSE`)?(o.value=Td(e.pattern,i),!0):!1}),o.value===void 0)throw new h(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${al(e)}`);return o.value}},jd=e=>[...e].sort((e,t)=>Dt(e.name,t.name)),Md=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Nd=(e,t)=>{let n=jd(e),r=Md(n),i=n.map(e=>V(e.value,t));if(r)return e=>Hn(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>ot(a,i.map(t=>t(e)),o):e=>Un(a,i.map(t=>t(e)))},Pd=(e,t)=>{let n=e=>V(e,t);switch(e.kind){case`Number`:{let t=e.value;return nt(t)?()=>t:()=>{throw ml(e)}}case`Decimal`:return()=>{throw pl(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return td(e,t);case`Apply`:return Cd(e,t);case`Bracket`:return()=>{throw new h(`A bracket without a function or subscript is not an expression at ${rl(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new h(`An operator cannot be used as a value at ${rl(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw cl(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw cl(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw _l(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>Ut(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw sl(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new h(`A non-boolean expression (${ji(t)}) was used as a condition of a CASE. ${ol(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new h(`Attempted to evaluate a CASE with no conditions true.\n${al(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Cl(n,Tu(e.definitions,n)))}case`Forall`:case`Exists`:return wd(e,t);case`UnboundedQuantifier`:return()=>{throw new h(`TLC cannot evaluate an unbounded quantifier at ${rl(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Ad(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>En(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Vn(t.map(t=>t(e)))}case`FunctionConstruction`:return Od(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return Nd(e.fields,t);case`RecordSet`:{let t=jd(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return kd(e,t);case`ExceptAt`:return t=>{let n=vl(t.scope,`@`);if(n?.kind!==`Value`)throw new h(`@ appears outside an EXCEPT at ${rl(e)}`);return n.value};case`FunctionApplication`:{Dd(e.function);let r=n(e.function),i=t=>xl(r(Sl(t)),e),a=e.args.map(n),o=ul(t.runtime.version);if(a.length===1){let e=a[0];return t=>Or(i(t),e(t),o)}return e=>Or(i(e),Vn(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=ll(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?wl(t(e),`an action`)||r(e):wl(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Jc(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new h(`The subexpression reference at ${rl(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new h(`TLC cannot evaluate a temporal formula in a state at ${rl(e)}`)}}},Fd=`tlc2/value/impl/`,Id={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},Ld={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},Rd=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},zd=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Bd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Vd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??zd.get(e[3])}${`[]`.repeat(e[1].length)}`),Hd=(e,t)=>e[e[t].first].text,Ud=(e,t)=>Hd(e,t).replaceAll(`/`,`.`),Wd=e=>{let n=Rd(e);if(n.readUint32()!==3405691582)throw new t(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===Id.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===Id.integer?i.value=n.readInt32():t===Id.float?n.readUint32():t===Id.long||t===Id.double?(n.readBytes(8),e++):t===Id.class||t===Id.string||t===Id.methodType||t===Id.module||t===Id.package?i.first=n.readUint16():t===Id.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=Ud(r,n.readUint16());n.readUint16(),n.readBytes(n.readUint16()*2);for(let e=n.readUint16();e>0;e--){n.readBytes(6);for(let e=n.readUint16();e>0;e--)n.readUint16(),n.readBytes(n.readUint32())}let s=[];for(let e=n.readUint16();e>0;e--){let e=n.readUint16(),t=r[n.readUint16()].text,i=r[n.readUint16()].text,a=i.indexOf(`)`),c=Vd(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:Rd(n.readBytes(n.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>Ud(r,d.readUint16())):[],p=Bd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Vd(i.slice(a+1))[0],ee=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:t,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${t}(${c.join(`,`)})${ee}`})}return{pool:r,methods:s}},Gd=(e,t)=>{let n=e[t],r=e[n.second];return{className:Hd(e,n.first),name:e[r.first].text}},Kd=(e,t,n,r)=>{let i=()=>new g(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===Id.integer)return n.value;if(n.tag===Id.string)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=Ld.iconstM1&&n<=Ld.iconst5)o.push(n-Ld.iconst0),e+=1;else if(n===Ld.bipush)o.push(a[e+1]<<24>>24),e+=2;else if(n===Ld.sipush)o.push(l()<<16>>16),e+=3;else if(n===Ld.ldc)o.push(c(a[e+1])),e+=2;else if(n===Ld.ldcW)o.push(c(l())),e+=3;else if(n===Ld.dup){let t=s();o.push(t,t),e+=1}else if(n===Ld.getstatic){let n=Gd(t,l());if(n.className!==`${Fd}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===Ld.invokestatic){let n=Gd(t,l()),a=s();if(n.className!==`${Fd}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===Ld.new)o.push({className:Hd(t,l()),value:void 0}),e+=3;else if(n===Ld.invokespecial){let n=Gd(t,l()),a=s(),o=s();if(!(n.className===`${Fd}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===Ld.areturn){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},qd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Wd(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:Kd(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},Jd=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),Yd=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],Xd=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),Zd=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),Qd=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),$d=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),ef=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
150
143
  Nat == { }
151
144
  a+b == {a, b}
152
145
  a-b == CHOOSE n : b + n = a
@@ -462,9 +455,9 @@ _CheckName(name) ==
462
455
  => (PrintT(counts) /\\ FALSE)
463
456
  _PrintCounts == PrintT(_Counts)
464
457
  =============================================================================
465
- `]]),qd=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),Jd=A(`EOF`),Yd=A(`IDENTIFIER`),Xd=A(`DEFBREAK`),Zd=(e,t)=>Array.from({length:A(t)-A(e)+1},(t,n)=>A(e)+n),Qd=new Set(Zd(`op_57`,`op_119`)),$d=new Set(Zd(`op_1`,`op_119`)),ef=new Set(Zd(`op_57`,`op_70`)),tf=/* @__PURE__ */ new Set([...Zd(`ACTION`,`EXCEPT`),A(`EXTENDS`),...Zd(`IF`,`SF`),A(`STATE`),...Zd(`THEN`,`WITH`),A(`US`),...Zd(`op_112`,`op_116`)]),nf=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),rf=new Map([...nf(`postfix`,160,160,!0,`[`),...nf(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...nf(`prefix`,120,120,!1,`-.`),...nf(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...nf(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...nf(`prefix`,40,40,!0,`\\lnot`),...nf(`nfix`,100,130,!0,`\\times`),...nf(`infix`,140,140,!1,`^`,`^^`),...nf(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...nf(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...nf(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...nf(`infix`,100,110,!0,`|`,`||`,`%%`),...nf(`infix`,100,110,!1,`%`),...nf(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...nf(`infix`,90,140,!1,`\\wr`),...nf(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...nf(`infix`,90,130,!1,`!!`),...nf(`infix`,90,90,!1,`...`,`..`),...nf(`infix`,80,80,!0,`\\intersect`,`\\union`),...nf(`infix`,80,80,!1,`\\`),...nf(`infix`,70,70,!1,`<:`,`:>`),...nf(`infix`,60,60,!0,`@@`),...nf(`infix`,50,140,!0,`\\cdot`),...nf(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...nf(`infix`,30,30,!0,`\\land`,`\\lor`),...nf(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...nf(`infix`,10,10,!1,`=>`)]),af=new Map([...rf,...Vd.flatMap(e=>e.slice(1).map(t=>[t,rf.get(e[0])]))]),of=af.get(`[`),sf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},cf=e=>({type:`tokens`,kinds:new Set(e)}),lf=e=>typeof e==`string`?e.startsWith(`<`)?cf([A(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(lf)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),uf=e=>(...t)=>({type:e,body:G(...t)}),q=uf(`zeroOrMore`),df=uf(`oneOrMore`),J=uf(`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}),ff=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),pf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=ff(e,n);return n},mf=(...e)=>{let t=e.map(A);return e=>t.includes(pf(e,1).kind)},hf=(e,t=pf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},gf=e=>{let t=pf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},_f=e=>mf(`CASESEP`)(e)&&hf(e),vf=e=>{let t=pf(e,1);tf.has(t.kind)&&(t.kind=Yd)},yf=(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}`,bf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),xf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Sf=e=>e.operatorStacks[e.operatorStacks.length-1],Cf=(e,t)=>e.low>t.high,wf=(e,t)=>e.high<t.low,Tf=e=>e.fix===`prefix`?e:af.get(`${e.name}.`),Ef=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===of?bf(`FcnAppl`,[n,...r.node.heirs]):bf(`PostfixExpr`,[n,r.node]),operator:void 0})},Df=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:bf(`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:bf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Of=e=>{let t=Sf(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 Ef(t,n),Of(e);if(i.operator!==void 0){let t=Tf(r.operator);return t!==void 0&&Cf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${yf(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 ${yf(e,a.node.first,a.node.last)} and expression at location ${yf(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return wf(a.operator,r.operator)?void 0:Cf(a.operator,r.operator)?(Df(t,a.operator),Of(e)):`Precedence conflict between ops ${a.operator.name} in block ${yf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Tf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(wf(s,r.operator))return;if(!Cf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${yf(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Df(t,s),Of(e);let c=yf(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===sf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},kf=e=>Y(t=>{let n=Sf(t),r=xf(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:Of(t)}),Af=kf(()=>!1),jf=kf(()=>!0),Mf=Y(e=>{e.lastOperator=af.get(e.token.image)}),Nf=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},Pf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Nf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Ff=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!hf(e,n.first.beginColumn))return n;let t=Ff(e,n);if(t!==void 0)return t}},If=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&&Qd.has(e.kind),i=e.token,a=ff(e,i);i.next=void 0;let o=ff(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===Yd&&(e=e.next)}else if(e.kind===Yd){let t=e.next;!r(t)||ef.has(t.kind)||$d.has(t.kind)&&t.next?.kind!==Yd||(e=t.next?.kind===A(`SUBSTITUTE`)?i:$d.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Xd&&(e.next={kind:Xd,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=ff(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Lf=e=>{let t=pf(e,1);if(t.kind===A(`LAB`)){let n=1;for(;n!==0;)if(t=ff(e,t),t.kind===A(`LAB`)&&n++,t.kind===A(`RAB`)&&n--,t.kind===Jd)return!1;return ff(e,t).kind===A(`IN`)}if(t.kind!==Yd)return!1;for(t=ff(e,t);t.kind===A(`COMMA`);){if(t=ff(e,t),t.kind!==Yd)return!1;t=ff(e,t)}return t.kind===A(`IN`)},Rf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),zf=e=>e.proofLevels.at(-1)??-1,Bf=e=>{let t=pf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:mf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||zf(e)>=0&&Rf(t)>zf(e):mf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Vf=(e,t)=>{let n=Rf(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},Hf=e=>Y(t=>Vf(t,t.token)?void 0:`${yf(t,t.token)}: ${e}`),Uf=cf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(A)),Wf=cf([...Uf.kinds,A(`op_76`)]),Gf=cf($d),Kf=cf(ef),qf=cf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(A)),Jf=()=>q(Z({expansion:[K(Uf,`<op_77>`)],semantic:hf}),K(`PrefixOp`,`InfixOp`),jf),Yf=()=>K(G(Z({expansion:[`OpenStart`],semantic:hf}),`OpenExpression`,Af),G(Z({semantic:hf}),`ExtendableExpr`)),Xf=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),Zf=()=>K(G(Z({semantic:e=>mf(`ASSUME`,`BOXASSUME`)(e)||pf(e,2).kind===A(`COLONCOLON`)&&[A(`ASSUME`),A(`BOXASSUME`)].includes(pf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Qf=()=>[`JuncItem`,q(Z({semantic:gf}),`JuncItem`)],$f=e=>Y(t=>{t.expecting=e,vf(t)}),ep=e=>Y(t=>{t.isTerminalProof=e}),tp=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{If(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),np={CompilationUnit:Q(void 0,[Y(If),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>`),$f(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,$f(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,$f(`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(If)),G(Z({semantic:e=>mf(`USE`)(e)&&pf(e,2).kind!==A(`ONLY`)||mf(`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(tp(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),tp(`Expression`,Z({expansion:[`<IDENTIFIER>`,Kf]}),`PostfixLHS`,`Expression`),tp(`Expression`,Z({expansion:[`<IDENTIFIER>`,Gf]}),`InfixLHS`,`Expression`),tp(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),tp(`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`,[Wf,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,Gf,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,Kf]),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>`,$f(`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,[Uf,Mf]),NonExpPrefixOp:Q(void 0,[Wf,Mf]),InfixOp:Q(`Infix Op`,[Gf,Mf]),PostfixOp:Q(void 0,[Kf,Mf]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{If(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),Zf(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),Zf(),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=xf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${yf(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(If),K(G(Z({amount:3}),Z({semantic:mf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:Bf}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>mf(`BY`)(e)||pf(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=>pf(e,2).kind!==A(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,ep(!0),J(`<ONLY>`)),G(`<USE>`,ep(!1),J(`<ONLY>`)),G(`<HIDE>`,ep(!1))),X("an expression, `MODULE' or `DEF'"),J(Xf(),q(`<COMMA>`,X(`MODULE or expression`),Xf(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Xf(),q(`<COMMA>`,X(`MODULE or expression`),Xf(),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`),qf,Hf(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:Bf}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),qf,Hf(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:mf(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:mf(`INSTANCE`)}),`Instantiation`),G(Z({semantic:mf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:Bf}),Y(e=>{let t=xf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${yf(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),df(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:mf(`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(Wf,Gf,Kf),cf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(A))],semantic:hf}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${yf(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:hf}),`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:Lf}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),df(`<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=xf(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`)),df(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:Lf}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>pf(e,2).kind===A(`MAPTO`)&&tf.has(pf(e,1).kind)}),Y(e=>{pf(e,1).kind=Yd}),`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=bf(`FcnAppl`,t.heirs),e.lastOperator=of})),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>`,df(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(vf),`Identifier`),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===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=>_f(e)&&pf(e,2).kind!==A(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:_f}),`<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`,[df(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=pf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...Qf()),G(Z({expansion:[`<AND>`]}),...Qf())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Ff(t,e.heirs[1]);return n&&`Item at ${yf(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${yf(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([])}),Jf(),Yf()],(e,t)=>{let n=Sf(t);n.push({node:e.heirs[0],operator:sf});let r=Of(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`),Af,q(K(G(Z({expansion:[`PostfixOp`],semantic:hf}),`PostfixOp`,jf),G(Z({expansion:[`<DOT>`],semantic:hf}),`<DOT>`,Y(vf),Z({semantic:hf}),`Identifier`,Y(e=>{let t=Sf(e);t[t.length-1].operator!==void 0&&Ef(t,t.length),t[t.length-1]={node:bf(`RecordComponent`,[t[t.length-1].node,xf(e,2),xf(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:hf}),X(`function argument`),`SBracketCases`,kf(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:hf}),`InfixOp`,jf,Jf(),Yf()),G(Z({expansion:[`<COLONCOLON>`],semantic:hf}),`<COLONCOLON>`,Y(e=>{let t=Sf(e);if(!Pf(t[t.length-1].node))return`\`::' at ${yf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=Sf(e),n=xf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!wf(r,e.lastOperator)){let t=xf(e,3);return`Removing label at ${yf(e,t.first,t.last)} would change expression parsing.`}t.push({node:bf(`Label`,[xf(e,3),xf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:hf}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:hf}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>zf(e)<0&&e.proofLevels.length<=1?`${yf(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${yf(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:Nf(e.heirs)===void 0?e.heirs.length===1?bf(`GeneralId`,e.heirs):void 0:bf(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>pf(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=>pf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${yf(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},rp=/* @__PURE__ */ new Map,ip=e=>{let t=rp.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=ip(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,ip(np[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 rp.set(e,n),n},ap=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},op=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=ff(e,e.scanPosition)),e.scanPosition=ff(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`},sp=(e,t)=>{if(t.type===`tokens`)return op(e,t.kinds);if(t.type===`call`)return sp(e,np[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||ap(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=sp(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||ap(e,t.semantic)?sp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=sp(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=sp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},cp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=sp(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},lp=(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||ip(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!ip(a).hasSemanticStart?ip(a).first.has(pf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):cp(e,i,a)&&(o===void 0||o(e))}),up=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,sp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=ff(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Jd){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=ff(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${qe(e.token.image)}" `},dp=(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??up(e)}\n\nResidual stack trace follows:\n${r}`,!1},fp=(e,t)=>{let n=ff(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,dp(e))},pp=(e,t)=>{let n=np[t];n.message!==void 0&&(e.messages.push({name:n.message,token:pf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!mp(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 dp(e,i);let a=r.node??(r.heirs.length===0?void 0:bf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},mp=(e,t)=>{if(t.type===`tokens`)return fp(e,t.kinds);if(t.type===`call`)return pp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||dp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||dp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||mp(e,t));if(t.type===`choice`){let n=lp(e,t.alternatives);return n===-1?dp(e):mp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!mp(e,t.body))return!1;if(t.type===`optional`)return lp(e,[t.body])===-1||mp(e,t.body);for(;lp(e,[t.body])===0;)if(!mp(e,t.body))return!1;return!0},hp=e=>{let t=Ge(e),n={kind:Jd,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=mp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},gp={low:15,high:15},_p={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),vp=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)]]),yp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),bp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),xp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Sp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Cp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),wp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...yp]),Tp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?vp.has(e.operator):yp.has(e.operator)),Ep=e=>vp.has(e)||yp.has(e)||e===`-.`,Dp=(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}}},Op=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),kp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Ap=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),jp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Mp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Np=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Pp=/* @__PURE__ */ new Set([``,`*`,`-`]),Fp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Ip=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Lp=/* @__PURE__ */ new Set([`NEW`,...Ip.keys()]),Rp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),zp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Bp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Vp=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
466
- `)}\n`},Hp=(e,t)=>{let n=t===`tlapm`,r=n?Ce(e):Ce(e).map(xe),i={index:0,offsideColumns:[]},a={},o=[],s=/* @__PURE__ */ new Set,c=[],l=[],d=e=>o[o.length-1].has(e),f=e=>({line:e.line,column:n&&e.kind===`String`?e.endColumn:e.column,range:void 0}),m=[],h=[],_=[],v=(e,t=i.index-1)=>{let n=e===t?_[e]:void 0;if(n)return n;let a=r[t];m[e]??=f(r[e]),h[t]??={line:a.line,column:a.endColumn};let o={module:l[0].name,start:m[e],end:h[t]};return e===t&&(_[e]=o),o},y=(e,t)=>(e.location.range=v(t),e),b=(e=0)=>r[Math.min(i.index+e,r.length-1)],x=(e=0)=>{let t=b(e),n=i.offsideColumns[i.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ee=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),te={index:0},S=e=>{let t=r.slice(te.index,i.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ne=e=>n&&(e.kind===`Keyword`||Bp.has(e.text)),re=e=>{let t=r.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},ie=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Np.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ne(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,C=(e,t=b(),n)=>{let i=r[r.length-1],a=t.line===i.line&&t.column===i.column;return new u(`${e} at line ${t.line}, column ${t.column}`,void 0,ae(e,t,a,n))},ae=(e,t,i,a)=>{if(n&&i){let e=r[r.length-1];return{reason:`Unexpected EOF`,...S(re(e)),isEnd:i}}return n&&a?{reason:`Unexpected ${ie(a)}`,...re(a),isEnd:i}:{reason:e,line:t.line,column:t.column,isEnd:i}},oe=(e,t=b())=>C(e,t,t),se=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ne(e),w=(e,t=0)=>{let n=x(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=x();if(e.kind===`End`)throw C(`Unexpected end of expression`);return i.index++,e},E=e=>w(e)?(i.index++,!0):!1,D=e=>{if(!w(e))throw oe(`Expected ${JSON.stringify(e)} but found ${ee(x())}`);return T()},ce=()=>{let e=x();if(e.kind!==`Identifier`)throw oe(`Expected an identifier but found ${ee(e)}`);if(ne(e))throw oe(`Unexpected keyword ${e.text}`);return i.index++,e.text},le=()=>{let e=i.index;return{name:ce(),range:v(e)}},ue=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),de=()=>{let e=x();return e.kind!==`String`&&(xp.has(e.text)||vp.has(e.text)||yp.has(e.text)||e.text===`'`)?(i.index++,e.text):ce()},fe={isUsed:!1},me=()=>x().kind===`Identifier`||!se(x())?ce():(fe.isUsed=!0,T().text),he=e=>{if(!n)return e();i.offsideColumns.push(-1);let t=e();return i.offsideColumns.pop(),t},O=(e,t=`,`)=>{let n=[e()];for(;E(t);)n.push(e());return n},ge=()=>{if(w(`<<`)){let e={value:1};for(;x(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;x(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},_e=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;x(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return x(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},ve=()=>{if(!E(`<<`)){let e=le();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ue(O(le));return D(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},ye=()=>O(()=>{let e=O(ve);D(`\\in`);let t=j();return e.map(e=>({pattern:e,set:t}))}).flat(),be=()=>{let e=x();if(e.kind===`Identifier`){let t=i.index,n=[T().text];for(;w(`!`)&&x(1).kind===`Identifier`;)T(),n.push(ce());return y({kind:`Identifier`,name:n.join(`!`),location:f(e)},t)}if(w(`<<`)||w(`(`))return Fe();throw oe(`Expected a subscript but found ${ee(e)}`)},Se=e=>{let t=x(1),n=x(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&w(`==`,yp.has(n.text)?3:4))},we=e=>{let t=x(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&kp.has(t.text)||Se(e)},k=()=>{let e=x(),t=e.kind===`Operator`&&(vp.has(e.text)||bp.has(e.text))&&we(e);if(n&&e.kind!==`String`&&(bp.has(e.text)||wp.has(e.text)&&e.text!==`'`&&!yp.has(e.text)||Cp.has(e.text)&&x(-1).text===`(`&&x(-1).line===e.line&&x(-1).endColumn+1===e.column&&x(1).text===`)`&&x(1).line===e.line&&x(1).column===e.endColumn+1)&&we(e))throw C(`incomplete expression`,e);if(t)return i.index++,y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:f(e)},i.index-1);if(e.kind!==`String`&&wp.has(e.text)&&we(e)){i.index++;let t=f(e);if(yp.has(e.text))return y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},i.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return y({kind:`Lambda`,params:[n.name],body:Dp(e.text,n,t),operator:e.text,location:f(e)},i.index-1)}if(w(`LAMBDA`)){let t=i.index;T();let n=ue(O(le));D(`:`);let r=j();return y({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:f(e)},t)}return j()},Te={range:void 0},A=()=>he(()=>{let e=i.index;D(`(`);let t=O(k);return D(`)`),Te.range=v(e),t}),Ee=()=>{let e=T();i.offsideColumns.push(e.column);let t=[j()];for(;b().text===e.text&&b().column===e.column;)i.index++,t.push(j());return i.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:f(e)}},De=e=>he(()=>{let t=f(e),r=x().kind===`Identifier`,a=w(`|->`,1)&&(r||se(x()));if(a||r&&w(`:`,1)){let e=a?`Record`:`RecordSet`,n=e=>{let t=i.index,n=f(x()),r=e();return n.range=v(t),D(a?`|->`:`:`),{name:r,value:j(),location:n}},o=[n(()=>r?ce():T().text),...E(`,`)?O(()=>n(ce)):[]];return D(`]`),{kind:e,fields:o,location:t}}if(ge()){let e=ye();D(`|->`);let n=j();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let o=j();if(E(`->`)){let e=j();return D(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(E(`EXCEPT`)){let e=O(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!se(x()))throw oe(`Expected a field name but found ${ee(x())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:O(()=>j())}),D(`]`);return D(`=`),{path:e,value:j()}});return D(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!n&&!w(`]_`)){let e=[o];for(;E(`,`);)e.push(j());return D(`]`),{kind:`Bracket`,args:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:o,subscript:be(),location:t}}),Oe=()=>{let e=i.index,t=y(Le(),e),n=f(T());return y({kind:`Apply`,operator:`\\in`,args:[t,j()],location:n},e)},ke=e=>he(()=>{let t=f(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ge()&&(x(1).text===`\\in`||w(`<<`))){let e=i.index,n=ve();D(`\\in`);let r=j();if(E(`:`)){let e=j();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}i.index=e}let n=x().kind===`Identifier`&&w(`\\in`,1)?Oe():j();if(E(`:`)){let e=ye();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;E(`,`);)r.push(j());return D(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ae=e=>{let t=f(e),n=he(()=>w(`>>`)||w(`>>_`)?[]:O(()=>j()));if(E(`>>_`)){if(n.length!==1)throw C(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:be(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},je=e=>{let t=f(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ge()){let e=ye();return D(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=ue(O(le));return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Me=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:j(),location:f(e)};let n=j();D(`->`),t.push({condition:n,body:j()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:f(e)}},Ne=()=>{let e=x(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Op.has(e.text)||e.kind===`Operator`&&(vp.has(e.text)||yp.has(e.text)||bp.has(e.text)))},Pe=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:pe(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return i.index--,{kind:`Bound`,args:A()}}return{kind:`Name`,name:e.text,args:w(`(`)?A():[]}},Fe=e=>{let t=i.index,r=T(),s=f(r);if(n&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=O(ce);return D(`:`),{kind:`Lambda`,params:e,body:j(),location:s}}if(r.kind===`Number`){if(n&&/^\\[BOH]/.test(r.text))throw C(`incomplete expression`,r);return{kind:`Number`,value:pe(r.text),text:r.text,location:s}}if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:s};if(r.kind===`String`)return{kind:`String`,value:r.text,location:s};let c=r.kind===`Step`&&et(r);if(c&&Ze()<0&&Xe.length<=1)throw C(`Step number used outside proof`,r);if(c&&r.text[1]===`+`)throw C(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||c){let o=c?tt(r)??r.text:r.text;if(_e()){let t=ue(E(`(`)?O(le):[]);t.names.length>0&&D(`)`),D(`::`);let i=j();if(!n&&e!==void 0&&a.last!==void 0&&Tp(i)&&e.high>=a.last.low)throw C(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:o,params:t.names,paramRanges:t.ranges,body:i,location:s}}let l=w(`(`);if(o===`@`&&!l&&!Ne())return{kind:`ExceptAt`,location:s};let u=l?A():[],d=[l?Te.range:void 0];if(!Ne())return l?{kind:`Apply`,operator:o,args:u,argumentsRange:Te.range,location:s}:{kind:`Identifier`,name:o,location:s};let f=[{kind:`Name`,name:o,args:u}],p=[v(t,t)];for(;Ne();)T(),p.push(v(i.index,i.index)),Te.range=void 0,f.push(Pe()),d.push(Te.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),y=d.at(-1)??v(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:s}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:s}:_.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:h,args:g,argumentCounts:_,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:s}:{kind:`Apply`,operator:h,args:g,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:s}}if(r.kind===`Operator`&&Ep(r.text)&&w(`(`))return{kind:`Apply`,operator:r.text,spelling:r.spelling,args:A(),location:s};if(r.kind===`Operator`&&Ep(r.text)&&!n)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:s};switch(r.text){case`(`:{let e=he(()=>j());return D(`)`),e}case`[`:return De(r);case`{`:return ke(r);case`<<`:return Ae(r);case`@`:return{kind:`ExceptAt`,location:s};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return je(r);case`IF`:{let e=j();D(`THEN`);let t=j();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:s}}case`CASE`:return Me(r);case`LET`:{let e=[],t=[];for(o.push(/* @__PURE__ */ new Set);!E(`IN`);){if(n&&w(`RECURSIVE`))throw C(`Unexpected keyword RECURSIVE`,S(b()));if(E(`RECURSIVE`)){qe();continue}let r=Be(!1);r.kind===`Instance`?t.push(r):e.push(r)}o.pop();let r=j();return t.length===0?{kind:`Let`,definitions:e,body:r,location:s}:{kind:`Let`,definitions:e,instances:t,body:r,location:s}}case`CHOOSE`:{let e=ve(),t=E(`\\in`)?j():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:s}}case`WF_`:case`SF_`:{let e=be(),t=he(()=>{D(`(`);let e=j();return D(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:s}}}throw oe(`Unexpected ${ee(r)}`,r)},Ie=(e,t,r)=>{a.last=a.preceding={low:t,high:r};let i=j(r+1),o=x(),s=o.text===`'`||yp.has(o.text)?gp.high:vp.get(o.text)?.high;if(!n&&o.kind===`Operator`&&s!==void 0&&s>=t)throw C(`Precedence conflict between ${e.text} and ${o.text}`,o);return i},Le=()=>{let e=a.preceding;a.preceding=void 0;let t=x(),r=f(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return Ee();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[Ie(t,4,4)],location:r};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[Ie(t,12,12)],location:r};case`[]`:return T(),{kind:`Always`,expression:Ie(t,4,15),location:r};case`<>`:return T(),{kind:`Eventually`,expression:Ie(t,4,15),location:r};case`ENABLED`:return T(),{kind:`Enabled`,expression:Ie(t,4,15),location:r};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:Ie(t,4,15),location:r};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:t.text,args:[n?j(9):Ie(t,10,13)],location:r}}return Fe(e)},j=(e=0)=>{let t=i.index,n=Le(),r={left:n.location.range?n:y(n,t),previous:void 0};for(;;){let n=x();if(n.kind!==`Operator`)break;let i=f(n);if(n.text===`'`&&e<=15){T(),a.last=gp,r.left=y({kind:`Prime`,expression:r.left,location:i},t);continue}if(yp.has(n.text)&&e<=15){T(),a.last=gp,r.left=y({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){T();let e=he(()=>O(()=>j()));he(()=>D(`]`)),a.last=_p,r.left=y({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&se(x(1))){T();let e=T().text;r.left=y({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let o=vp.get(n.text);if(!o||o.low<e)break;let s=r.previous;if(s){let e=!(s.low>o.high||s.high<o.low),t=s.text===n.text&&o.isAssociative;if(e&&!t&&(s.text!==`\\X`||n.text!==`\\X`))throw C(`Precedence conflict between ${s.text} and ${n.text}`,n)}if(T(),o.low>12&&w(`-`))throw C(`Precedence conflict between ${n.text} and -`,x());a.last=a.preceding=o;let c=j(o.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[v(t).end];r.left=l.kind===e&&s?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&s?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=y(r.left,t),r.previous={...o,text:n.text}}return r.left},Re=()=>{if(!E(`(`))return[];let e=Ke();return D(`)`),e},ze=()=>{let e=f(x()),t=j(),n=r[i.index-1],a={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:l[0].name,start:e,end:a}}},Be=e=>{let t=i.index;return y(He(e),t)},Ve=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),He=e=>{let t=x(),n=f(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...ze(),isLocal:e,isRecursive:d(t),location:n});if(t.kind===`Identifier`&&x(1).kind===`Operator`&&vp.has(x(1).text)&&x(2).kind===`Identifier`&&w(`==`,3)){let e=le(),t=T().text,n=le();return D(`==`),r(t,[Ve(e),Ve(n)])}let a=t.kind!==`String`&&xp.has(t.text),o=t.kind===`Identifier`&&yp.has(x(1).text)&&w(`==`,2);if(a||o){let e=a?t.text:x(1).text;a&&T();let n=le();return o&&T(),D(`==`),r(e,[Ve(n)])}let s=ce();if(E(`[`)){let t=he(()=>ye());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:j(),isLocal:e,isRecursive:d(s),location:n}}let c=i.index,l=Re();return D(`==`),w(`INSTANCE`)?{...Ue(s,l,e,n),definitionRange:v(c)}:r(s,l)},Ue=(e,t,n,r)=>{let a=i.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:me(),substitutions:E(`WITH`)?O(()=>{let e=i.index,t=de(),n=v(e);return D(`<-`),{name:t,nameRange:n,expression:k()}}):[],isLocal:n,location:r,instanceRange:v(a)}},We=()=>{let e=i.index;return y(Ge(),e)},Ge=()=>{let e=f(x());if(w(`_`)&&x(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(x().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=ce();if(!E(`(`))return{name:t,arity:0,location:e};let n=O(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},Ke=()=>O(We),qe=()=>{let e=Ke();return e.forEach(e=>o[o.length-1].add(e.name)),e},Je=e=>{let t={value:0,offset:e};do{let e=x(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Rp.has(e.text)&&t.value++,e.kind===`Operator`&&zp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ye=()=>{let e=x(),t=x(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,Je(1)):t.kind===`Operator`&&yp.has(t.text)?w(`==`,2):t.kind===`Operator`&&vp.has(t.text)?x(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):e.kind!==`String`&&xp.has(e.text)&&t.kind===`Identifier`&&w(`==`,2)},Xe=[],Ze=()=>Xe[Xe.length-1]??-1,Qe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),$e=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},et=e=>!e.text.endsWith(`.`)&&!Pp.has($e(e)),tt=e=>{let t=$e(e);if(Pp.has(t))return;let n=Qe(e);if(n>=0)return`<${n}>${t}`;let r=Ze(),i=Xe[Xe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},nt=e=>{if(e.kind===`Keyword`)return jp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Xe.length===0;if(e.text[1]===`+`||Xe.length===0)return!0;let t=Ze();return t>=0&&Qe(e)>t},rt=e=>{let t=Qe(e),n=Xe.length-1,r=Xe[n-1]??-1,i=Xe[n]<0;return i&&(Xe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Xe[n]===t},M=e=>!s.has(e)&&l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),it=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Bp.has(e.name)&&!M(e.name):!1,at=()=>{let e=x();return e.kind===`Step`?et(e):e.kind===`Keyword`?Fp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ye()},ot=()=>{let e=i.index,t=x();return t.kind===`Operator`&&!Sp.has(t.text)&&Ep(t.text)?(i.index++,y({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:f(t)},e)):E(`MODULE`)?y({kind:`ModuleFact`,name:ce(),location:f(t)},e):j()},st=e=>c[c.length-1]?.add(e),ct=e=>{c.push(/* @__PURE__ */ new Set);let t=e();return c.pop(),t},lt=e=>c.some(t=>t.has(e))||l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ut=()=>{let e=i.index,t=x(),n=O(()=>{let e=x();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw oe(`Expected a definition name but found ${ee(e)}`,e);return i.index++,e.text},`!`),r=f(t);return y(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},dt=()=>{if(n)return O(ut);let e=O(ot),r=t===`tlc`?e.find(e=>e.kind===`Identifier`&&lt(e.name)):void 0;if(r)throw C(`DEF clause entry should describe a defined operator`,r.location);return e},N=()=>({facts:at()?O(ot):[],defs:E(`DEF`)||E(`DEFS`)?dt():[]}),ft=()=>{let e=i.index,n=T(),r=n.text===`USE`&&E(`ONLY`),a=v(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...N(),keyword:a,location:f(n)},s=o.kind===`Hide`&&t===`tlc`?o.facts.filter(e=>!it(e)):[];if(s.length>0)throw p(s.map(t=>({location:g(t.location.range??v(e)),message:`The only expression allowed as a fact in a HIDE is
467
- the name of a theorem, assumption, or step.`})));return y(o,e)},P=()=>{let e=i.index,t=f(x()),n=E(`NEW`),r=x().kind===`Keyword`?Ip.get(x().text):void 0;if(!n&&r===void 0)throw oe(`Expected a declaration but found ${ee(x())}`);if(r!==void 0&&T(),r===`Variable`){let n=le();return st(n.name),y({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let a=We();st(a.name);let o=(r??`Constant`)===`Constant`&&w(`\\in`);if(o&&a.arity>0)throw C(`declared symbol with arguments before \\in`);return o&&T(),y({kind:`NewSymbol`,name:a.name,arity:a.arity,level:r??`Constant`,set:o?j():void 0,nameRange:a.location.range,location:t},e)},F=()=>{let e=i.index,t=f(D(`ASSUME`)),n=O(()=>w(`ASSUME`)?ct(F):x().kind===`Keyword`&&Lp.has(x().text)?P():j());return D(`PROVE`),y({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)},pt=e=>{let t={value:0};for(;x(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return x(t.value).kind===`Identifier`&&w(e,t.value+1)},mt=(e,t)=>{e.forEach(st),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(st))},ht=()=>{let e=x();if(w(`USE`)||w(`HIDE`))return ft();if(w(`INSTANCE`)){let t=i.index;return y(Ue(void 0,[],!1,f(e)),t)}if(w(`DEFINE`)||Ye()){let t=i.index;E(`DEFINE`);let n=[Be(!1)];for(;Ye();)n.push(Be(!1));let r={kind:`Define`,definitions:n,location:f(e)};return y(r,t)}if(E(`HAVE`))return{kind:`Have`,expression:j()};if(E(`TAKE`)){let e=ge(),t=ue(e?[]:O(le)),n=e?ye():[];return mt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:O(()=>j())};if(E(`PICK`)){let e=pt(`:`),t=ue(e?O(le):[]),n=e?[]:ye();return mt(t.names,n),D(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return E(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?F():j()}},gt=e=>{let t=x();if(t.kind!==`Step`)throw oe(`Expected a step number but found ${ee(t)}`,t);if(!rt(t))throw C(`${e?`QED step`:`step`}'s number has bad level`,t);if(Qe(t)<0&&tt(t)!==void 0)throw C(`<*> and <+> cannot be used for a named step`,t);return i.index++,{name:tt(t),token:t.text,location:f(t)}},_t=()=>{let e=i.index,t=gt(w(`QED`,1)),n=i.index,r=/* @__PURE__ */ new Set;c.push(r);let a=E(`QED`)?{kind:`Qed`}:ht(),o=v(e),s=v(n),l=nt(x());if(l&&!Mp.has(a.kind))throw C(`Proof of a step that does not take a proof`);let u=l?yt():void 0;return c.pop(),(a.kind!==`Assert`||a.isSuffices)&&r.forEach(st),y({...t,body:a,head:o,statement:s,proof:u},e)},vt=()=>{let e=f(x());if(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=v(i.index-1);return{kind:`By`,isOnly:E(`ONLY`),...N(),keyword:t,location:e}}let t=x(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=v(i.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`PROOF`);let n=[_t()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(_t());return{kind:`Steps`,level:Ze(),steps:n,location:e}},yt=()=>{let e=i.index;Xe.push(-1);let t=ct(vt);return Xe.pop(),y(t,e)},bt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},xt=e=>{let t=i.index,n=T(),r=x().kind===`Identifier`&&w(`==`,1)?ce():void 0;r!==void 0&&(s.add(r),T());let a=ct(()=>({statement:w(`ASSUME`)?F():j(),proof:nt(x())?yt():void 0})),o=a.statement,c=y({name:r,statement:o,proof:a.proof,location:f(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&o.kind!==`AssumeProve`&&bt(e,y({kind:`Operator`,name:r,params:[],body:o,isLocal:!1,isRecursive:!1,location:f(n)},t))},St=()=>{let e=i.index;return y(Ct(),e)},Ct=()=>{let e=T(),t=f(e),n=e.text===`AXIOM`;if(x().kind===`Identifier`&&w(`==`,1)){let e=ce();return s.add(e),T(),{name:e,expression:j(),isAxiom:n,location:t}}return{name:void 0,expression:j(),isAxiom:n,location:t}},wt=()=>{let e=f(D(`----`));D(`MODULE`);let t=me();D(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(l.push(n),o.push(/* @__PURE__ */ new Set),E(`EXTENDS`)&&O(()=>{let e=i.index;n.extends.push(me()),n.extendsRanges.push(v(e))});;){let t=i.index;te.index=t;let r=x();if(r.kind===`ModuleEnd`)return e.range={module:l[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},l.pop(),o.pop(),n;if(r.kind===`Separator`){if(w(`MODULE`,1)){let e=wt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=f(T()),r=Ke();n.constants.push(...r),e.range=v(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=f(T()),r=O(()=>{let e=i.index,t=f(x());return y({name:ce(),arity:0,location:t},e)});n.variables.push(...r),e.range=v(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=St();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&bt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(w(`USE`)&&w(`ONLY`,1))throw oe(`Expected a module unit but found ${ee(r)}`);let e=ft();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:qe()});continue;case`INSTANCE`:Tt(n,y(Ue(void 0,[],!1,f(r)),t));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){Tt(n,y(Ue(void 0,[],!0,f(r)),t));continue}Tt(n,y(He(!0),t));continue}r.kind===`Keyword`&&Ap.has(r.text)?xt(n):Tt(n,Be(!1))}}},Tt=(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}))},Et=wt(),Dt=fe.isUsed?hp(e):void 0;if(Dt!==void 0)throw new u(Dt);return Et},Up=e=>Hp(e,`tlc`),Wp=e=>Hp(e,`tlapm`),Gp=e=>Hp(e,`sany`),Kp=25214903917n,qp=(1n<<48n)-1n,Jp=2147483647,Yp=e=>{let t={value:(BigInt.asUintN(64,e)^Kp)&qp},n=e=>(t.value=t.value*Kp+11n&qp,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Kp)&qp},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<=Jp)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Xp=10454148508367108822n,Zp=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Xp);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Qp=Int32Array.from(Zp,e=>Number(BigInt.asIntN(32,e>>32n))),$p=Int32Array.from(Zp,e=>Number(BigInt.asIntN(32,e))),em=Number(BigInt.asIntN(32,Xp>>32n)),tm=Number(BigInt.asIntN(32,Xp));let nm=em,rm=tm;const im=e=>{let t=(e^rm)&255;rm=(rm>>>8|nm<<24)^$p[t],nm=nm>>>8^Qp[t]},am=e=>{for(let t=0;t<32;t+=8)im(e>>>t)},om=e=>{if(typeof e==`boolean`)im(0),im(e?116:102);else if(typeof e==`number`)im(1),am(e);else if(typeof e==`string`){im(3),am(e.length);for(let t=0;t<e.length;t++)im(e.charCodeAt(t))}else if(F(e))im(21),am(Mt(e.name)+1);else if(P(e)){let t=Ar(e);im(9),am(t.domain.length);for(let e=0;e<t.domain.length;e++)om(t.domain[e]),om(t.range[e])}else{let t=L(e).elements;im(5),am(t.length);for(let e of t)om(e)}},sm=e=>{let t={high:nm,low:rm};nm=em,rm=tm;for(let t of e)om(t);let n=BigInt(nm>>>0)<<32n|BigInt(rm>>>0);return nm=t.high,rm=t.low,n},cm=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||F(e))return 5;if(typeof e==`string`)return 5+e.length;if(P(e)){let t=Ar(e);return t.domain.reduce((e,n,r)=>e+cm(n)+cm(t.range[r]),5)}return L(e).elements.reduce((e,t)=>e+cm(t),5)},lm=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){nm=n<32?0:1<<n-32,rm=n<32?1<<n:0;for(let t=0;t<e;t++)im(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^nm,t[n+1]=t[a+1]^rm}}return t},um=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=r.get(e);if(t!==void 0)return t;let n=cm(e);return nm=0,rm=0,om(e),r.set(e,i.length),i.push(n,nm,rm),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=lm(e);return n.set(e,r),r};return(n,r)=>{let s={high:nm,low:rm},c={high:em,low:tm};for(let t of e){let e=a(n[t]),r=o(i[e]),s={high:i[e+1],low:i[e+2]};for(let e=0;e<8;e++){let t=e<4?c.low:c.high,n=(e*256+(t>>>(e&3)*8&255))*2;s.high^=r[n],s.low^=r[n+1]}c.high=s.high,c.low=s.low}nm=s.high,rm=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},dm=[],fm=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},pm=()=>{for(let e=1277011;dm.length<1341;e++)fm(e)&&dm.push(e);return dm},mm=e=>{let t=pm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},hm=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},gm=e=>{for(let t=Math.max(e,9);;t++){let e=hm(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)}}},_m=(e,t,n)=>{if(t<=0)return[];let r=gm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(mm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},vm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Jp),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},ym=(1n<<63n)-1n-24n,bm=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(ym*BigInt(n)+i)%t;return r<0n?r+t:r})},xm=(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,Sm=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Zn(e.domain),n=L(e.range).elements;return{lists:t.map(()=>n),create:e=>Ut(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>L(e).elements),create:t=>er(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>L(e).elements),create:$n}}},Cm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,wm=(e,t,n,r)=>{if(R(t))return[];let i=r===`1.7.4`?vm:_m;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=Cm(t,r)?void 0:Sm(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Jp)?bm(e,t,n):i(e,Number(t),n)).map(e=>a.create(xm(a.lists,e)))}let o=L(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Tm=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new y(`RandomElement of the empty set`);return n},Em=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Zn(e.domain)];return Ut(n,n.map(()=>Em(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return er(e.names.map((n,r)=>[n,Em(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return $n(e.factors.map(e=>Em(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new y(`RandomElement of the empty set`);return e.low+r}return Tm(L(e).elements,t)},Dm=(e,t=0n)=>{let n=Yp(t),r={random:Yp(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>er([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:sm,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},Om=e=>Un([...e.possibleCounts].map(([e,t])=>[e,t])),km=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Om(e)]]),Am=`----------------------------- MODULE Bags --------------------------------
458
+ `]]),tf=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),nf=T(`EOF`),rf=T(`IDENTIFIER`),af=T(`DEFBREAK`),of=(e,t)=>Array.from({length:T(t)-T(e)+1},(t,n)=>T(e)+n),sf=new Set(of(`op_57`,`op_119`)),cf=new Set(of(`op_1`,`op_119`)),lf=new Set(of(`op_57`,`op_70`)),uf=/* @__PURE__ */ new Set([...of(`ACTION`,`EXCEPT`),T(`EXTENDS`),...of(`IF`,`SF`),T(`STATE`),...of(`THEN`,`WITH`),T(`US`),...of(`op_112`,`op_116`)]),df=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),ff=new Map([...df(`postfix`,160,160,!0,`[`),...df(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...df(`prefix`,120,120,!1,`-.`),...df(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...df(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...df(`prefix`,40,40,!0,`\\lnot`),...df(`nfix`,100,130,!0,`\\times`),...df(`infix`,140,140,!1,`^`,`^^`),...df(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...df(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...df(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...df(`infix`,100,110,!0,`|`,`||`,`%%`),...df(`infix`,100,110,!1,`%`),...df(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...df(`infix`,90,140,!1,`\\wr`),...df(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...df(`infix`,90,130,!1,`!!`),...df(`infix`,90,90,!1,`...`,`..`),...df(`infix`,80,80,!0,`\\intersect`,`\\union`),...df(`infix`,80,80,!1,`\\`),...df(`infix`,70,70,!1,`<:`,`:>`),...df(`infix`,60,60,!0,`@@`),...df(`infix`,50,140,!0,`\\cdot`),...df(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...df(`infix`,30,30,!0,`\\land`,`\\lor`),...df(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...df(`infix`,10,10,!1,`=>`)]),pf=new Map([...ff,...Yd.flatMap(e=>e.slice(1).map(t=>[t,ff.get(e[0])]))]),mf=pf.get(`[`),hf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},gf=e=>({type:`tokens`,kinds:new Set(e)}),_f=e=>typeof e==`string`?e.startsWith(`<`)?gf([T(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(_f)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),vf=e=>(...t)=>({type:e,body:W(...t)}),K=vf(`zeroOrMore`),yf=vf(`oneOrMore`),q=vf(`optional`),J=e=>({type:`action`,run:t=>e(t)??void 0}),Y=e=>J(t=>{t.expecting=e}),X=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&W(...e.expansion),semantic:e.semantic}),bf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),xf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=bf(e,n);return n},Sf=(...e)=>{let t=e.map(T);return e=>t.includes(xf(e,1).kind)},Cf=(e,t=xf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},wf=e=>{let t=xf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Tf=e=>Sf(`CASESEP`)(e)&&Cf(e),Ef=e=>{let t=xf(e,1);uf.has(t.kind)&&(t.kind=rf)},Df=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,Of=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),kf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Af=e=>e.operatorStacks[e.operatorStacks.length-1],jf=(e,t)=>e.low>t.high,Mf=(e,t)=>e.high<t.low,Nf=e=>e.fix===`prefix`?e:pf.get(`${e.name}.`),Pf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===mf?Of(`FcnAppl`,[n,...r.node.heirs]):Of(`PostfixExpr`,[n,r.node]),operator:void 0})},Ff=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Of(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:Of(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},If=e=>{let t=Af(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return Pf(t,n),If(e);if(i.operator!==void 0){let t=Nf(r.operator);return t!==void 0&&jf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Df(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Df(e,a.node.first,a.node.last)} and expression at location ${Df(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Mf(a.operator,r.operator)?void 0:jf(a.operator,r.operator)?(Ff(t,a.operator),If(e)):`Precedence conflict between ops ${a.operator.name} in block ${Df(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Nf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Mf(s,r.operator))return;if(!jf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Df(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Ff(t,s),If(e);let c=Df(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===hf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Lf=e=>J(t=>{let n=Af(t),r=kf(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:If(t)}),Rf=Lf(()=>!1),zf=Lf(()=>!0),Bf=J(e=>{e.lastOperator=pf.get(e.token.image)}),Vf=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},Hf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Vf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Uf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Cf(e,n.first.beginColumn))return n;let t=Uf(e,n);if(t!==void 0)return t}},Wf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(T),n=(e,...t)=>t.some(t=>e.kind===T(t)),r=e=>e!==void 0&&sf.has(e.kind),i=e.token,a=bf(e,i);i.next=void 0;let o=bf(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===rf&&(e=e.next)}else if(e.kind===rf){let t=e.next;!r(t)||lf.has(t.kind)||cf.has(t.kind)&&t.next?.kind!==rf||(e=t.next?.kind===T(`SUBSTITUTE`)?i:cf.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==af&&(e.next={kind:af,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=bf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Gf=e=>{let t=xf(e,1);if(t.kind===T(`LAB`)){let n=1;for(;n!==0;)if(t=bf(e,t),t.kind===T(`LAB`)&&n++,t.kind===T(`RAB`)&&n--,t.kind===nf)return!1;return bf(e,t).kind===T(`IN`)}if(t.kind!==rf)return!1;for(t=bf(e,t);t.kind===T(`COMMA`);){if(t=bf(e,t),t.kind!==rf)return!1;t=bf(e,t)}return t.kind===T(`IN`)},Kf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),qf=e=>e.proofLevels.at(-1)??-1,Jf=e=>{let t=xf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Sf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||qf(e)>=0&&Kf(t)>qf(e):Sf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Yf=(e,t)=>{let n=Kf(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},Xf=e=>J(t=>Yf(t,t.token)?void 0:`${Df(t,t.token)}: ${e}`),Zf=gf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(T)),Qf=gf([...Zf.kinds,T(`op_76`)]),$f=gf(cf),ep=gf(lf),tp=gf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(T)),np=()=>K(X({expansion:[G(Zf,`<op_77>`)],semantic:Cf}),G(`PrefixOp`,`InfixOp`),zf),rp=()=>G(W(X({expansion:[`OpenStart`],semantic:Cf}),`OpenExpression`,Rf),W(X({semantic:Cf}),`ExtendableExpr`)),ip=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),ap=()=>G(W(X({semantic:e=>Sf(`ASSUME`,`BOXASSUME`)(e)||xf(e,2).kind===T(`COLONCOLON`)&&[T(`ASSUME`),T(`BOXASSUME`)].includes(xf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),op=()=>[`JuncItem`,K(X({semantic:wf}),`JuncItem`)],sp=e=>J(t=>{t.expecting=e,Ef(t)}),cp=e=>J(t=>{t.isTerminalProof=e}),lp=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{Wf(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),up={CompilationUnit:Z(void 0,[J(Wf),q(`Prelude`),`Module`]),Prelude:Z(void 0,[`<BEGIN_PRAGMA>`,K(G(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Z(`Module definition`,[Y(`---- MODULE`),`BeginModule`,Y(`EXTENDS clause or module body`),`Extends`,Y(`Module body`),`Body`,Y(`==== or more Module body`),`EndModule`]),BeginModule:Z(`Begin module`,[Y(`---- MODULE (beginning of module)`),G(`<_BM0>`,`<_BM1>`,`<_BM2>`),sp(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,sp(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,sp(`Identifier`),`Identifier`))]),Body:Z(`Module body`,[Y(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),K(G(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,W(X({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,W(X({amount:2}),`Instance`),W(X({amount:2}),`Assumption`),W(X({amount:2}),`Theorem`),W(X({amount:1}),`Module`,J(Wf)),W(X({semantic:e=>Sf(`USE`)(e)&&xf(e,2).kind!==T(`ONLY`)||Sf(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Z(`variable declaration`,[`<VARIABLE>`,Y(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Y(`Identifier`),`Identifier`)]),ParamDeclaration:Z(`Parameter declaration`,[Y(`CONSTANT`),`ParamSubDecl`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Z(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Z(`Recursive`,[Y(`RECURSIVE`),`<RECURSIVE>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y("`,' or `)'"))]),ConstantDeclarationItems:Z(`Constant declaration items`,[Y(`Identifier, _ or prefix op`),G(W(`Identifier`,Y(`(, comma, or Module Body`),q(X({amount:2}),`<LBR>`,Y(`_`),`<US>`,Y(`comma or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`comma or )`)),`<RBR>`)),W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`prefix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Z(`Definition`,[Y(`LOCAL, Identifier or Operator Symbol`),q(`<LOCAL>`),`<DEFBREAK>`,Y(`LOCAL, Identifier or Operator Symbol`),G(lp(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),lp(`Expression`,X({expansion:[`<IDENTIFIER>`,ep]}),`PostfixLHS`,`Expression`),lp(`Expression`,X({expansion:[`<IDENTIFIER>`,$f]}),`InfixLHS`,`Expression`),lp(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),lp(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Z(`Identifier tuple`,[`<LAB>`,Y(`Identifier or >>`),q(`Identifier`,Y(`COMMA or >>`),K(`<COMMA>`,Y(`COMMA or >>`),`Identifier`,Y(`COMMA or >>`))),`<RAB>`]),IdentLHS:Z(`Identifier LHS`,[`Identifier`,Y(`( or ==`),q(`<LBR>`,Y(`Identifier Declaration, prefix op, _ or )`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`),K(`<COMMA>`,Y(`Identifier Declaration, prefix op or _`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Z(`Prefix LHS`,[Qf,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,$f,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,ep]),IdentDecl:Z(`Identifier Declation`,[`Identifier`,Y(`( or ...`),q(`<LBR>`,Y(`_`),`<US>`,Y(`COMMA or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Z(`Op. Symbol Declaration`,[G(W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`infix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),Instance:Z(`Instance`,[Y(`LOCAL or instance`),q(`<LOCAL>`),`Instantiation`,Y(`COMMA or Module Body`)]),Instantiation:Z(`NonLocalInstance`,[`<INSTANCE>`,sp(`Module identifier`),`Identifier`,Y(`WITH or another definition.`),q(`<WITH>`,Y(``),`Substitution`,Y(``),K(X({amount:3}),`<COMMA>`,Y(``),`Substitution`,Y(``)))]),Substitution:Z(`Substitution`,[G(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),Y(`<-`),`<SUBSTITUTE>`,Y(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Z(void 0,[Zf,Bf]),NonExpPrefixOp:Z(void 0,[Qf,Bf]),InfixOp:Z(`Infix Op`,[$f,Bf]),PostfixOp:Z(void 0,[ep,Bf]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{Wf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),ap(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),ap(),Y("PROVE or `,'")),G(`<PROVE>`,`<BOXPROVE>`),Y(`Expression`),`Expression`))]),NewSymb:Z(`NEW symbol declaration`,[Y(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),G(W(X({amount:2}),G(W(X({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),Y(`Constant declaration`),G(W(X({amount:2}),`IdentDecl`,q(`<IN>`,J(e=>{let t=kf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Df(e,t.first,t.last)}`:void 0}),Y(`Expression`),`Expression`)),`SomeFixDecl`)),W(X({amount:2}),q(`<NEW>`),`<VARIABLE>`,Y(`Identifier`),`Identifier`),W(X({amount:2}),q(`<NEW>`),G(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),Y(`Declaration`),G(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Z(`Domain binding`,[q(`<IN>`,Y(`Expression`),`Expression`)]),Theorem:Z(`Theorem`,[Y(`THEOREM, PROPOSITION`),G(`<THEOREM>`,`<PROPOSITION>`),Y(`Identifier, Assume-Prove or Expression`),q(X({amount:2}),`Identifier`,Y(`==`),`<DEF>`),J(Wf),G(W(X({amount:3}),X({semantic:Sf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:Jf}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>Sf(`BY`)(e)||xf(e,2).kind===T(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>xf(e,2).kind!==T(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,cp(!0),q(`<ONLY>`)),W(`<USE>`,cp(!1),q(`<ONLY>`)),W(`<HIDE>`,cp(!1))),Y("an expression, `MODULE' or `DEF'"),q(ip(),K(`<COMMA>`,Y(`MODULE or expression`),ip(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),ip(),K(`<COMMA>`,Y(`MODULE or expression`),ip(),J(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),J(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Z(`QED step`,[Y(`Step number`),tp,Xf(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:Jf}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),tp,Xf(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:Sf(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:Sf(`INSTANCE`)}),`Instantiation`),W(X({semantic:Sf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:Jf}),J(e=>{let t=kf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Df(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),yf(X({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Z(`HaveStep`,[`<HAVE>`,Y(`expression`),`Expression`]),TakeStep:Z(`TakeStep`,[`<TAKE>`,Y(`identifier`),G(W(X({expansion:[G(W(`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,Y(`comma or step`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or proof step`))),W(`Identifier`,Y(`comma or proof step`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or proof step`))))]),WitnessStep:Z(`WitnessStep`,[`<WITNESS>`,Y(`expression`),`Expression`,K(`<COMMA>`,Y(`expression`),`Expression`,Y(`comma or colon`))]),PickStep:Z(`PickStep`,[`<PICK>`,Y(`identifier`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,Y(`comma, or colon`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or colon`))),W(`QuantBound`,Y(`comma or colon`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or colon`)))),`<COLON>`,Y(`expression`),`Expression`]),CaseStep:Z(`CaseStep`,[`<CASE>`,Y(`expression`),`Expression`]),AssertStep:Z(`AssertStep`,[q(`<SUFFICES>`,Y(`expression or ASSUME/PROVE`)),G(`Expression`,W(X({semantic:Sf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Z(void 0,[G(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Z(void 0,[G(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Z(`String`,[`<STRING_LITERAL>`]),Number:Z(void 0,[`<NUMBER_LITERAL>`,q(X({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Z(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,K(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Z(void 0,[G(W(X({amount:2,expansion:[G(Qf,$f,ep),gf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(T))],semantic:Cf}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Df(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:Cf}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Z(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Z(`Quantified form`,[G(`<EXISTS>`,`<FORALL>`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,K(`<COMMA>`,`Identifier`)),W(`QuantBound`,K(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Z(`Bound Quantified Expression`,[G(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,K(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Z(`Quant Bound`,[G(`IdentifierTuple`,W(`Identifier`,K(`<COMMA>`,`Identifier`,Y(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Z(`Some { } form`,[`<LBC>`,q(G(W(X({semantic:Gf}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),yf(`<COMMA>`,`Expression`)))),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,K(`<COMMA>`,`Expression`)),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,K(`<COMMA>`,`QuantBound`)),W(`Expression`,q(G(W(`<COLON>`,J(e=>{let t=kf(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,K(`<COMMA>`,`QuantBound`)),yf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:Gf}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>xf(e,2).kind===T(`MAPTO`)&&uf.has(xf(e,1).kind)}),J(e=>{xf(e,1).kind=rf}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,K(`<COMMA>`,`FieldSet`),`<RSB>`),W(`Expression`,G(W(K(`<COMMA>`,`Expression`),`<RSB>`,J(e=>{let t=e.frames[e.frames.length-1];t.node=Of(`FcnAppl`,t.heirs),e.lastOperator=mf})),W(`<ARROW>`,`Expression`,`<RSB>`),W(`<EXCEPT>`,`ExceptSpec`,K(`<COMMA>`,`ExceptSpec`),`<RSB>`),W(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Z(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Z(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Z(`Except Spec`,[`<BANG>`,yf(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(Ef),`Identifier`),W(`<LSB>`,`Expression`,K(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Z(`Some << -- >> or >>_ Form`,[`<LAB>`,q(`Expression`,K(`<COMMA>`,`Expression`)),G(`<RAB>`,W(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Z(void 0,[`Identifier`,q(X({amount:2}),`OpArgs`),G(W(`<BANG>`,`NoOpExtension`),J(e=>{e.isFairnessHooked=e.token.kind===T(`RBR`)}))]),ReducedExpression:Z(`restricted form of expression`,[G(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Z(`Fairness Expression`,[J(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),G(`<WF>`,`<SF>`),`ReducedExpression`,q(X({amount:2}),`<LBR>`,`Expression`,`<RBR>`,J(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Z(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Z(`CASE Expression`,[`<CASE>`,`CaseArm`,K(X({semantic:e=>Tf(e)&&xf(e,2).kind!==T(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:Tf}),`<CASESEP>`,`OtherArm`)]),CaseArm:Z(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Z(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Z(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Z(`Let Definitions`,[yf(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=xf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...op()),W(X({expansion:[`<AND>`]}),...op())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Uf(t,e.heirs[1]);return n&&`Item at ${Df(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Df(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Z(`(Un)Bounded Choose`,[`<CHOOSE>`,G(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Z(`Lambda`,[`<LAMBDA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'"),K(`<COMMA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'")),`<COLON>`,Y(`Expression`),`Expression`]),Expression:Z(`Expression`,[J(e=>{e.operatorStacks.push([])}),np(),rp()],(e,t)=>{let n=Af(t);n.push({node:e.heirs[0],operator:hf});let r=If(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Z(`ExtendableExpr`,[G(W(X({expansion:[G(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Rf,K(G(W(X({expansion:[`PostfixOp`],semantic:Cf}),`PostfixOp`,zf),W(X({expansion:[`<DOT>`],semantic:Cf}),`<DOT>`,J(Ef),X({semantic:Cf}),`Identifier`,J(e=>{let t=Af(e);t[t.length-1].operator!==void 0&&Pf(t,t.length),t[t.length-1]={node:Of(`RecordComponent`,[t[t.length-1].node,kf(e,2),kf(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:Cf}),Y(`function argument`),`SBracketCases`,Lf(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:Cf}),`InfixOp`,zf,np(),rp()),W(X({expansion:[`<COLONCOLON>`],semantic:Cf}),`<COLONCOLON>`,J(e=>{let t=Af(e);if(!Hf(t[t.length-1].node))return`\`::' at ${Df(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=Af(e),n=kf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Mf(r,e.lastOperator)){let t=kf(e,3);return`Removing label at ${Df(e,t.first,t.last)} would change expression parsing.`}t.push({node:Of(`Label`,[kf(e,3),kf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:Cf}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:Cf}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>qf(e)<0&&e.proofLevels.length<=1?`${Df(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Df(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,W(X({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),q(X({amount:2}),`OpArgs`),K(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Vf(e.heirs)===void 0?e.heirs.length===1?Of(`GeneralId`,e.heirs):void 0:Of(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>xf(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),q(X({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Z(`StructOp`,[Y("`<<' , `>>' , `:' , `@' , or number"),G(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,W(X({semantic:e=>xf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Df(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},dp=/* @__PURE__ */ new Map,fp=e=>{let t=dp.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=fp(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,fp(up[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return dp.set(e,n),n},pp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},mp=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=bf(e,e.scanPosition)),e.scanPosition=bf(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},hp=(e,t)=>{if(t.type===`tokens`)return mp(e,t.kinds);if(t.type===`call`)return hp(e,up[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||pp(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=hp(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||pp(e,t.semantic)?hp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=hp(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=hp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},gp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=hp(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},_p=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||fp(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!fp(a).hasSemanticStart?fp(a).first.has(xf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):gp(e,i,a)&&(o===void 0||o(e))}),vp=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,hp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=bf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===nf){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=bf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ve(e.token.image)}" `},yp=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??vp(e)}\n\nResidual stack trace follows:\n${r}`,!1},bp=(e,t)=>{let n=bf(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,yp(e))},xp=(e,t)=>{let n=up[t];n.message!==void 0&&(e.messages.push({name:n.message,token:xf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Sp(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return yp(e,i);let a=r.node??(r.heirs.length===0?void 0:Of(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Sp=(e,t)=>{if(t.type===`tokens`)return bp(e,t.kinds);if(t.type===`call`)return xp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||yp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||yp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Sp(e,t));if(t.type===`choice`){let n=_p(e,t.alternatives);return n===-1?yp(e):Sp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Sp(e,t.body))return!1;if(t.type===`optional`)return _p(e,[t.body])===-1||Sp(e,t.body);for(;_p(e,[t.body])===0;)if(!Sp(e,t.body))return!1;return!0},Cp=e=>{let t=ze(e),n={kind:nf,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Sp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},wp={low:15,high:15},Tp={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),Ep=new Map([[`=>`,Q(1,1,!1)],[`<=>`,Q(2,2,!1)],[`~>`,Q(2,2,!1)],[`-+->`,Q(2,2,!1)],[`/\\`,Q(3,3,!0)],[`\\/`,Q(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,Q(5,5,!1)]),[`\\cdot`,Q(5,14,!0)],[`@@`,Q(6,6,!0)],[`:>`,Q(7,7,!1)],[`<:`,Q(7,7,!1)],[`\\cup`,Q(8,8,!0)],[`\\cap`,Q(8,8,!0)],[`\\`,Q(8,8,!1)],[`..`,Q(9,9,!1)],[`...`,Q(9,9,!1)],[`##`,Q(9,13,!0)],[`$`,Q(9,13,!0)],[`$$`,Q(9,13,!0)],[`??`,Q(9,13,!0)],[`!!`,Q(9,13,!1)],[`\\sqcap`,Q(9,13,!0)],[`\\sqcup`,Q(9,13,!0)],[`\\uplus`,Q(9,13,!0)],[`\\wr`,Q(9,14,!1)],[`+`,Q(10,10,!0)],[`++`,Q(10,10,!0)],[`(+)`,Q(10,10,!0)],[`\\oplus`,Q(10,10,!0)],[`%`,Q(10,11,!1)],[`%%`,Q(10,11,!0)],[`|`,Q(10,11,!0)],[`||`,Q(10,11,!0)],[`\\X`,Q(10,13,!1)],[`-`,Q(11,11,!0)],[`--`,Q(11,11,!0)],[`(-)`,Q(11,11,!0)],[`\\ominus`,Q(11,11,!0)],[`*`,Q(13,13,!0)],[`**`,Q(13,13,!0)],[`/`,Q(13,13,!1)],[`//`,Q(13,13,!1)],[`\\div`,Q(13,13,!1)],[`\\o`,Q(13,13,!0)],[`(.)`,Q(13,13,!0)],[`\\odot`,Q(13,13,!0)],[`(/)`,Q(13,13,!1)],[`\\oslash`,Q(13,13,!1)],[`(\\X)`,Q(13,13,!0)],[`\\otimes`,Q(13,13,!0)],[`&`,Q(13,13,!0)],[`&&`,Q(13,13,!0)],[`\\star`,Q(13,13,!0)],[`\\bullet`,Q(13,13,!0)],[`\\bigcirc`,Q(13,13,!0)],[`^`,Q(14,14,!1)],[`^^`,Q(14,14,!1)]]),Dp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Op=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),kp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Ap=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),jp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Mp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...Dp]),Np=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Pp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Fp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Ip=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Lp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Rp=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),zp=/* @__PURE__ */ new Set([``,`*`,`-`]),Bp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Vp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Hp=/* @__PURE__ */ new Set([`NEW`,...Vp.keys()]),Up=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Wp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Gp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Kp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Ep.has(e.operator):Dp.has(e.operator)),qp=e=>Ep.has(e)||Dp.has(e)||e===`-.`,Jp=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},Yp=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
459
+ `)}\n`},Xp=(e,n)=>{let i=n===`tlapm`,a=i?ge(e):ge(e).map(me),o={index:0,offsideColumns:[]},s={},c=[],l=/* @__PURE__ */ new Set,u=[],d=[],p=e=>c[c.length-1].has(e),m=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),ee=[],h=[],te=[],g=(e,t=o.index-1)=>{let n=e===t?te[e]:void 0;if(n)return n;let r=a[t];ee[e]??=m(a[e]),h[t]??={line:r.line,column:r.endColumn};let i={module:d[0].name,start:ee[e],end:h[t]};return e===t&&(te[e]=i),i},_=(e,t)=>(e.location.range=g(t),e),v=(e=0)=>a[Math.min(o.index+e,a.length-1)],y=(e=0)=>{let t=v(e),n=o.offsideColumns[o.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ne=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),re={index:0},ie=e=>{let t=a.slice(re.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ae=e=>i&&(e.kind===`Keyword`||Gp.has(e.text)),oe=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},se=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Rp.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ae(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,ce=(e,n=v(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column;return new t(`${e} at line ${n.line}, column ${n.column}`,void 0,le(e,n,o,r))},le=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...ie(oe(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${se(r)}`,...oe(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},de=(e,t=v())=>ce(e,t,t),fe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ae(e),b=(e,t=0)=>{let n=y(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},x=()=>{let e=y();if(e.kind===`End`)throw ce(`Unexpected end of expression`);return o.index++,e},S=e=>b(e)?(o.index++,!0):!1,C=e=>{if(!b(e))throw de(`Expected ${JSON.stringify(e)} but found ${ne(y())}`);return x()},w=()=>{let e=y();if(e.kind!==`Identifier`)throw de(`Expected an identifier but found ${ne(e)}`);if(ae(e))throw de(`Unexpected keyword ${e.text}`);return o.index++,e.text},pe=()=>{let e=o.index;return{name:w(),range:g(e)}},he=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),_e=()=>{let e=y();return e.kind!==`String`&&(kp.has(e.text)||Ep.has(e.text)||Dp.has(e.text)||e.text===`'`)?(o.index++,e.text):w()},ve={isUsed:!1},ye=()=>y().kind===`Identifier`||!fe(y())?w():(ve.isUsed=!0,x().text),T=e=>{if(!i)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},E=(e,t=`,`)=>{let n=[e()];for(;S(t);)n.push(e());return n},be=()=>{if(b(`<<`)){let e={value:1};for(;y(e.value).kind===`Identifier`||b(`,`,e.value);)e.value++;return b(`>>`,e.value)&&b(`\\in`,e.value+1)}let e={value:0};for(;y(e.value).kind===`Identifier`;){if(b(`\\in`,e.value+1))return!0;if(!b(`,`,e.value+1))return!1;e.value+=2}return!1},xe=()=>{if(b(`::`))return!0;if(!b(`(`))return!1;let e={value:1};for(;y(e.value).kind===`Identifier`&&b(`,`,e.value+1);)e.value+=2;return y(e.value).kind===`Identifier`&&b(`)`,e.value+1)&&b(`::`,e.value+2)},Se=()=>{if(!S(`<<`)){let e=pe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(E(pe));return C(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>E(()=>{let e=E(Se);C(`\\in`);let t=D();return e.map(e=>({pattern:e,set:t}))}).flat(),we=()=>{let e=y();if(e.kind===`Identifier`){let t=o.index,n=[x().text];for(;b(`!`)&&y(1).kind===`Identifier`;)x(),n.push(w());return _({kind:`Identifier`,name:n.join(`!`),location:m(e)},t)}if(b(`<<`)||b(`(`))return ze();throw de(`Expected a subscript but found ${ne(e)}`)},Te=e=>{let t=y(1),n=y(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&b(`==`,Dp.has(n.text)?3:4))},Ee=e=>{let t=y(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||b(`,`,1)||b(`)`,1)||t.kind===`Keyword`&&Pp.has(t.text)||Te(e)},De=()=>{let e=y(),t=e.kind===`Operator`&&(Ep.has(e.text)||Op.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(Op.has(e.text)||Mp.has(e.text)&&e.text!==`'`&&!Dp.has(e.text)||jp.has(e.text)&&y(-1).text===`(`&&y(-1).line===e.line&&y(-1).endColumn+1===e.column&&y(1).text===`)`&&y(1).line===e.line&&y(1).column===e.endColumn+1)&&Ee(e))throw ce(`incomplete expression`,e);if(t)return o.index++,_({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:m(e)},o.index-1);if(e.kind!==`String`&&Mp.has(e.text)&&Ee(e)){o.index++;let t=m(e);if(Dp.has(e.text))return _({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return _({kind:`Lambda`,params:[n.name],body:Jp(e.text,n,t),operator:e.text,location:m(e)},o.index-1)}if(b(`LAMBDA`)){let t=o.index;x();let n=he(E(pe));C(`:`);let r=D();return _({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:m(e)},t)}return D()},Oe={range:void 0},ke=()=>T(()=>{let e=o.index;C(`(`);let t=E(De);return C(`)`),Oe.range=g(e),t}),Ae=()=>{let e=x();o.offsideColumns.push(e.column);let t=[D()];for(;v().text===e.text&&v().column===e.column;)o.index++,t.push(D());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:m(e)}},je=e=>T(()=>{let t=m(e),n=y().kind===`Identifier`,r=b(`|->`,1)&&(n||fe(y()));if(r||n&&b(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o.index,n=m(y()),i=e();return n.range=g(t),C(r?`|->`:`:`),{name:i,value:D(),location:n}},a=[i(()=>n?w():x().text),...S(`,`)?E(()=>i(w)):[]];return C(`]`),{kind:e,fields:a,location:t}}if(be()){let e=Ce();C(`|->`);let n=D();return C(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let a=D();if(S(`->`)){let e=D();return C(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(S(`EXCEPT`)){let e=E(()=>{C(`!`);let e=[];for(;b(`.`)||b(`[`);)if(S(`.`)){if(!fe(y()))throw de(`Expected a field name but found ${ne(y())}`);e.push({kind:`Field`,name:x().text})}else C(`[`),e.push({kind:`Index`,args:E(()=>D())}),C(`]`);return C(`=`),{path:e,value:D()}});return C(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!b(`]_`)){let e=[a];for(;S(`,`);)e.push(D());return C(`]`),{kind:`Bracket`,args:e,location:t}}return C(`]_`),{kind:`BoxAction`,action:a,subscript:we(),location:t}}),Me=()=>{let e=o.index,t=_(Ve(),e),n=m(x());return _({kind:`Apply`,operator:`\\in`,args:[t,D()],location:n},e)},Ne=e=>T(()=>{let t=m(e);if(S(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(be()&&(y(1).text===`\\in`||b(`<<`))){let e=o.index,n=Se();C(`\\in`);let r=D();if(S(`:`)){let e=D();return C(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=y().kind===`Identifier`&&b(`\\in`,1)?Me():D();if(S(`:`)){let e=Ce();return C(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;S(`,`);)r.push(D());return C(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=m(e),n=T(()=>b(`>>`)||b(`>>_`)?[]:E(()=>D()));if(S(`>>_`)){if(n.length!==1)throw ce(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:we(),location:t}}return C(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=m(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&be()){let e=Ce();return C(`:`),{kind:n,bounds:e,body:D(),location:t}}let i=he(E(pe));return C(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:D(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{if(S(`OTHER`))return C(`->`),{kind:`Case`,arms:t,other:D(),location:m(e)};let n=D();C(`->`),t.push({condition:n,body:D()})}while(S(`[]`));return{kind:`Case`,arms:t,other:void 0,location:m(e)}},Le=()=>{let e=y(1);return b(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Np.has(e.text)||e.kind===`Operator`&&(Ep.has(e.text)||Dp.has(e.text)||Op.has(e.text)))},Re=()=>{let e=x();if(e.kind===`Number`)return{kind:`Operand`,operand:ue(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o.index--,{kind:`Bound`,args:ke()}}return{kind:`Name`,name:e.text,args:b(`(`)?ke():[]}},ze=e=>{let t=o.index,n=x(),r=m(n);if(i&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=E(w);return C(`:`),{kind:`Lambda`,params:e,body:D(),location:r}}if(n.kind===`Number`){if(i&&/^\\[BOH]/.test(n.text))throw ce(`incomplete expression`,n);return{kind:`Number`,value:ue(n.text),text:n.text,location:r}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:r};if(n.kind===`String`)return{kind:`String`,value:n.text,location:r};let a=n.kind===`Step`&&M(n);if(a&&A()<0&&k.length<=1)throw ce(`Step number used outside proof`,n);if(a&&n.text[1]===`+`)throw ce(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||a){let c=a?et(n)??n.text:n.text;if(xe()){let t=he(S(`(`)?E(pe):[]);t.names.length>0&&C(`)`),C(`::`);let a=D();if(!i&&e!==void 0&&s.last!==void 0&&Kp(a)&&e.high>=s.last.low)throw ce(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:c,params:t.names,paramRanges:t.ranges,body:a,location:r}}let l=b(`(`);if(c===`@`&&!l&&!Le())return{kind:`ExceptAt`,location:r};let u=l?ke():[],d=[l?Oe.range:void 0];if(!Le())return l?{kind:`Apply`,operator:c,args:u,argumentsRange:Oe.range,location:r}:{kind:`Identifier`,name:c,location:r};let f=[{kind:`Name`,name:c,args:u}],p=[g(t,t)];for(;Le();)x(),p.push(g(o.index,o.index)),Oe.range=void 0,f.push(Re()),d.push(Oe.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),ee=m.join(`!`),h=f.flatMap(e=>`args`in e?e.args:[]),te=f.map(e=>`args`in e?e.args.length:0),_=d.at(-1)??g(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:r}:h.length===0?{kind:`Identifier`,name:ee,selectorRanges:p,location:r}:{kind:`Apply`,operator:ee,args:h,...te.slice(0,-1).some(e=>e>0)&&{argumentCounts:te},argumentsRange:_,selectorRanges:p,argumentRanges:d,location:r}}if(n.kind===`Operator`&&qp(n.text)&&b(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:ke(),location:r};if(n.kind===`Operator`&&qp(n.text)&&!i)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:r};switch(n.text){case`(`:{let e=T(()=>D());return C(`)`),e}case`[`:return je(n);case`{`:return Ne(n);case`<<`:return Pe(n);case`@`:return{kind:`ExceptAt`,location:r};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Fe(n);case`IF`:{let e=D();C(`THEN`);let t=D();return C(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:D(),location:r}}case`CASE`:return Ie(n);case`LET`:{let e=[],t=[];for(c.push(/* @__PURE__ */ new Set);!S(`IN`);){if(i&&b(`RECURSIVE`))throw ce(`Unexpected keyword RECURSIVE`,ie(v()));if(S(`RECURSIVE`)){Xe();continue}let n=O(!1);n.kind===`Instance`?t.push(n):e.push(n)}c.pop();let n=D();return t.length===0?{kind:`Let`,definitions:e,body:n,location:r}:{kind:`Let`,definitions:e,instances:t,body:n,location:r}}case`CHOOSE`:{let e=Se(),t=S(`\\in`)?D():void 0;return C(`:`),{kind:`Choose`,pattern:e,set:t,body:D(),location:r}}case`WF_`:case`SF_`:{let e=we(),t=T(()=>{C(`(`);let e=D();return C(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:r}}}throw de(`Unexpected ${ne(n)}`,n)},Be=(e,t,n)=>{s.last=s.preceding={low:t,high:n};let r=D(n+1),a=y(),o=a.text===`'`||Dp.has(a.text)?wp.high:Ep.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw ce(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},Ve=()=>{let e=s.preceding;s.preceding=void 0;let t=y(),n=m(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return Ae();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return x(),{kind:`Apply`,operator:`~`,args:[Be(t,4,4)],location:n};case`-`:return x(),{kind:`Apply`,operator:`-.`,args:[Be(t,12,12)],location:n};case`[]`:return x(),{kind:`Always`,expression:Be(t,4,15),location:n};case`<>`:return x(),{kind:`Eventually`,expression:Be(t,4,15),location:n};case`ENABLED`:return x(),{kind:`Enabled`,expression:Be(t,4,15),location:n};case`UNCHANGED`:return x(),{kind:`Unchanged`,expression:Be(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return x(),{kind:`Apply`,operator:t.text,args:[i?D(9):Be(t,10,13)],location:n}}return ze(e)},D=(e=0)=>{let t=o.index,n=Ve(),r={left:n.location.range?n:_(n,t),previous:void 0};for(;;){let n=y();if(n.kind!==`Operator`)break;let i=m(n);if(n.text===`'`&&e<=15){x(),s.last=wp,r.left=_({kind:`Prime`,expression:r.left,location:i},t);continue}if(Dp.has(n.text)&&e<=15){x(),s.last=wp,r.left=_({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){x();let e=T(()=>E(()=>D()));T(()=>C(`]`)),s.last=Tp,r.left=_({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&fe(y(1))){x();let e=x().text;r.left=_({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=Ep.get(n.text);if(!a||a.low<e)break;let o=r.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw ce(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(x(),a.low>12&&b(`-`))throw ce(`Precedence conflict between ${n.text} and -`,y());s.last=s.preceding=a;let c=D(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[g(t).end];r.left=l.kind===e&&o?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&o?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=_(r.left,t),r.previous={...a,text:n.text}}return r.left},He=()=>{if(!S(`(`))return[];let e=Ye();return C(`)`),e},Ue=()=>{let e=m(y()),t=D(),n=a[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},O=e=>{let t=o.index;return _(Ge(e),t)},We=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),Ge=e=>{let t=y(),n=m(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...Ue(),isLocal:e,isRecursive:p(t),location:n});if(t.kind===`Identifier`&&y(1).kind===`Operator`&&Ep.has(y(1).text)&&y(2).kind===`Identifier`&&b(`==`,3)){let e=pe(),t=x().text,n=pe();return C(`==`),r(t,[We(e),We(n)])}let i=t.kind!==`String`&&kp.has(t.text),a=t.kind===`Identifier`&&Dp.has(y(1).text)&&b(`==`,2);if(i||a){let e=i?t.text:y(1).text;i&&x();let n=pe();return a&&x(),C(`==`),r(e,[We(n)])}let s=w();if(S(`[`)){let t=T(()=>Ce());return C(`]`),C(`==`),{kind:`Function`,name:s,bounds:t,body:D(),isLocal:e,isRecursive:p(s),location:n}}let c=o.index,l=He();return C(`==`),b(`INSTANCE`)?{...Ke(s,l,e,n),definitionRange:g(c)}:r(s,l)},Ke=(e,t,n,r)=>{let i=o.index;return C(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ye(),substitutions:S(`WITH`)?E(()=>{let e=o.index,t=_e(),n=g(e);return C(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:g(i)}},qe=()=>{let e=o.index;return _(Je(),e)},Je=()=>{let e=m(y());if(b(`_`)&&y(1).kind===`Operator`)return x(),{name:x().text,arity:S(`_`)?2:1,location:e};if(y().kind===`Operator`&&b(`_`,1)){let t=x().text;return x(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=w();if(!S(`(`))return{name:t,arity:0,location:e};let n=E(()=>C(`_`));return C(`)`),{name:t,arity:n.length,location:e}},Ye=()=>E(qe),Xe=()=>{let e=Ye();return e.forEach(e=>c[c.length-1].add(e.name)),e},Ze=e=>{let t={value:0,offset:e};do{let e=y(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Up.has(e.text)&&t.value++,e.kind===`Operator`&&Wp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Qe=()=>{let e=y(),t=y(1);return e.kind===`Identifier`?b(`(`,1)||b(`[`,1)?b(`==`,Ze(1)):t.kind===`Operator`&&Dp.has(t.text)?b(`==`,2):t.kind===`Operator`&&Ep.has(t.text)?y(2).kind===`Identifier`&&b(`==`,3):b(`==`,1):e.kind!==`String`&&kp.has(e.text)&&t.kind===`Identifier`&&b(`==`,2)},k=[],A=()=>k[k.length-1]??-1,$e=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),j=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},M=e=>!e.text.endsWith(`.`)&&!zp.has(j(e)),et=e=>{let t=j(e);if(zp.has(t))return;let n=$e(e);if(n>=0)return`<${n}>${t}`;let r=A(),i=k[k.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},tt=e=>{if(e.kind===`Keyword`)return Ip.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return k.length===0;if(e.text[1]===`+`||k.length===0)return!0;let t=A();return t>=0&&$e(e)>t},nt=e=>{let t=$e(e),n=k.length-1,r=k[n-1]??-1,i=k[n]<0;return i&&(k[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:k[n]===t},rt=e=>!l.has(e)&&d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),it=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Gp.has(e.name)&&!rt(e.name):!1,at=()=>{let e=y();return e.kind===`Step`?M(e):e.kind===`Keyword`?Bp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Qe()},ot=()=>{let e=o.index,t=y();return t.kind===`Operator`&&!Ap.has(t.text)&&qp(t.text)?(o.index++,_({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:m(t)},e)):S(`MODULE`)?_({kind:`ModuleFact`,name:w(),location:m(t)},e):D()},st=e=>u[u.length-1]?.add(e),ct=e=>{u.push(/* @__PURE__ */ new Set);let t=e();return u.pop(),t},lt=e=>u.some(t=>t.has(e))||d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ut=()=>{let e=o.index,t=y(),n=E(()=>{let e=y();if((e.kind!==`Identifier`||ae(e))&&e.kind!==`Operator`)throw de(`Expected a definition name but found ${ne(e)}`,e);return o.index++,e.text},`!`),r=m(t);return _(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},dt=()=>{if(i)return E(ut);let e=E(ot),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&lt(e.name)):void 0;if(t)throw ce(`DEF clause entry should describe a defined operator`,t.location);return e},ft=()=>({facts:at()?E(ot):[],defs:S(`DEF`)||S(`DEFS`)?dt():[]}),pt=()=>{let e=o.index,t=x(),i=t.text===`USE`&&S(`ONLY`),a=g(e),s={kind:t.text===`USE`?`Use`:`Hide`,isOnly:i,...ft(),keyword:a,location:m(t)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!it(e)):[];if(c.length>0)throw r(c.map(t=>({location:f(t.location.range??g(e)),message:`The only expression allowed as a fact in a HIDE is
460
+ the name of a theorem, assumption, or step.`})));return _(s,e)},mt=()=>{let e=o.index,t=m(y()),n=S(`NEW`),r=y().kind===`Keyword`?Vp.get(y().text):void 0;if(!n&&r===void 0)throw de(`Expected a declaration but found ${ne(y())}`);if(r!==void 0&&x(),r===`Variable`){let n=pe();return st(n.name),_({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=qe();st(i.name);let a=(r??`Constant`)===`Constant`&&b(`\\in`);if(a&&i.arity>0)throw ce(`declared symbol with arguments before \\in`);return a&&x(),_({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:a?D():void 0,nameRange:i.location.range,location:t},e)},ht=()=>{let e=o.index,t=m(C(`ASSUME`)),n=E(()=>b(`ASSUME`)?ct(ht):y().kind===`Keyword`&&Hp.has(y().text)?mt():D());return C(`PROVE`),_({kind:`AssumeProve`,assumptions:n,conclusion:D(),location:t},e)},gt=e=>{let t={value:0};for(;y(t.value).kind===`Identifier`&&b(`,`,t.value+1);)t.value+=2;return y(t.value).kind===`Identifier`&&b(e,t.value+1)},_t=(e,t)=>{e.forEach(st),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(st))},vt=()=>{let e=y();if(b(`USE`)||b(`HIDE`))return pt();if(b(`INSTANCE`)){let t=o.index;return _(Ke(void 0,[],!1,m(e)),t)}if(b(`DEFINE`)||Qe()){let t=o.index;S(`DEFINE`);let n=[O(!1)];for(;Qe();)n.push(O(!1));let r={kind:`Define`,definitions:n,location:m(e)};return _(r,t)}if(S(`HAVE`))return{kind:`Have`,expression:D()};if(S(`TAKE`)){let e=be(),t=he(e?[]:E(pe)),n=e?Ce():[];return _t(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(S(`WITNESS`))return{kind:`Witness`,expressions:E(()=>D())};if(S(`PICK`)){let e=gt(`:`),t=he(e?E(pe):[]),n=e?[]:Ce();return _t(t.names,n),C(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:D()}}return S(`CASE`)?{kind:`Case`,expression:D()}:{kind:`Assert`,isSuffices:S(`SUFFICES`),statement:b(`ASSUME`)?ht():D()}},yt=e=>{let t=y();if(t.kind!==`Step`)throw de(`Expected a step number but found ${ne(t)}`,t);if(!nt(t))throw ce(`${e?`QED step`:`step`}'s number has bad level`,t);if($e(t)<0&&et(t)!==void 0)throw ce(`<*> and <+> cannot be used for a named step`,t);return o.index++,{name:et(t),token:t.text,location:m(t)}},bt=()=>{let e=o.index,t=yt(b(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;u.push(r);let i=S(`QED`)?{kind:`Qed`}:vt(),a=g(e),s=g(n),c=tt(y());if(c&&!Lp.has(i.kind))throw ce(`Proof of a step that does not take a proof`);let l=c?St():void 0;return u.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(st),_({...t,body:i,head:a,statement:s,proof:l},e)},xt=()=>{let e=m(y());if(b(`BY`)||b(`PROOF`)&&b(`BY`,1)){S(`PROOF`),x();let t=g(o.index-1);return{kind:`By`,isOnly:S(`ONLY`),...ft(),keyword:t,location:e}}let t=y(+!!b(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){S(`PROOF`),x();let n=g(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}S(`PROOF`);let n=[bt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(bt());return{kind:`Steps`,level:A(),steps:n,location:e}},St=()=>{let e=o.index;k.push(-1);let t=ct(xt);return k.pop(),_(t,e)},Ct=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},wt=e=>{let t=o.index,n=x(),r=y().kind===`Identifier`&&b(`==`,1)?w():void 0;r!==void 0&&(l.add(r),x());let i=ct(()=>({statement:b(`ASSUME`)?ht():D(),proof:tt(y())?St():void 0})),a=i.statement,s=_({name:r,statement:a,proof:i.proof,location:m(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&a.kind!==`AssumeProve`&&Ct(e,_({kind:`Operator`,name:r,params:[],body:a,isLocal:!1,isRecursive:!1,location:m(n)},t))},Tt=()=>{let e=o.index,t=x(),n=y().kind===`Identifier`&&b(`==`,1)?w():void 0;return n!==void 0&&(l.add(n),x()),_({name:n,expression:D(),isAxiom:t.text===`AXIOM`,location:m(t)},e)},Et=()=>{let e=m(C(`----`));C(`MODULE`);let t=ye();C(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),c.push(/* @__PURE__ */ new Set),S(`EXTENDS`)&&E(()=>{let e=o.index;n.extends.push(ye()),n.extendsRanges.push(g(e))});;){let t=o.index;re.index=t;let r=y();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),c.pop(),n;if(r.kind===`Separator`){if(b(`MODULE`,1)){let e=Et();n.modules.push(e),n.units.push({kind:`Module`,module:e}),C(`====`);continue}x()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=m(x()),r=Ye();n.constants.push(...r),e.range=g(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=m(x()),r=E(()=>{let e=o.index,t=m(y());return _({name:w(),arity:0,location:t},e)});n.variables.push(...r),e.range=g(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Tt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Ct(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(b(`USE`)&&b(`ONLY`,1))throw de(`Expected a module unit but found ${ne(r)}`);let e=pt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:x(),n.units.push({kind:`Recursive`,declarations:Xe()});continue;case`INSTANCE`:Dt(n,_(Ke(void 0,[],!1,m(r)),t));continue;case`LOCAL`:if(x(),b(`INSTANCE`)){Dt(n,_(Ke(void 0,[],!0,m(r)),t));continue}Dt(n,_(Ge(!0),t));continue}r.kind===`Keyword`&&Fp.has(r.text)?wt(n):Dt(n,O(!1))}}},Dt=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},Ot=Et(),kt=ve.isUsed?Cp(e):void 0;if(kt!==void 0)throw new t(kt);return Ot},Zp=e=>Xp(e,`tlc`),Qp=e=>Xp(e,`tlapm`),$p=e=>Xp(e,`sany`),em=10454148508367108822n,tm=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:em);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),nm=Int32Array.from(tm,e=>Number(BigInt.asIntN(32,e>>32n))),rm=Int32Array.from(tm,e=>Number(BigInt.asIntN(32,e))),im=Number(BigInt.asIntN(32,em>>32n)),am=Number(BigInt.asIntN(32,em));let om=im,sm=am;const cm=e=>{let t=(e^sm)&255;sm=(sm>>>8|om<<24)^rm[t],om=om>>>8^nm[t]},lm=e=>{for(let t=0;t<32;t+=8)cm(e>>>t)},um=e=>{if(typeof e==`boolean`)cm(0),cm(e?116:102);else if(typeof e==`number`)cm(1),lm(e);else if(typeof e==`string`){cm(3),lm(e.length);for(let t=0;t<e.length;t++)cm(e.charCodeAt(t))}else if(M(e))cm(21),lm(bt(e.name)+1);else if(j(e)){let t=I(e);cm(9),lm(t.domain.length);for(let e=0;e<t.domain.length;e++)um(t.domain[e]),um(t.range[e])}else{let t=P(e).elements;cm(5),lm(t.length);for(let e of t)um(e)}},dm=e=>{let t={high:om,low:sm};om=im,sm=am;for(let t of e)um(t);let n=BigInt(om>>>0)<<32n|BigInt(sm>>>0);return om=t.high,sm=t.low,n},fm=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||M(e))return 5;if(typeof e==`string`)return 5+e.length;if(j(e)){let t=I(e);return t.domain.reduce((e,n,r)=>e+fm(n)+fm(t.range[r]),5)}return P(e).elements.reduce((e,t)=>e+fm(t),5)},pm=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){om=n<32?0:1<<n-32,sm=n<32?1<<n:0;for(let t=0;t<e;t++)cm(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^om,t[n+1]=t[a+1]^sm}}return t},mm=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=n.get(e);if(t)return t;let r=pm(e);return n.set(e,r),r},o=e=>{if(typeof e!=`object`||M(e))return um(e),fm(e);let t=s(e),n={high:om,low:sm},r=a(i[t]);om=i[t+1],sm=i[t+2];for(let e=0;e<8;e++){let t=e<4?n.low:n.high,i=(e*256+(t>>>(e&3)*8&255))*2;om^=r[i],sm^=r[i+1]}return i[t]},s=e=>{let t=r.get(e);if(t!==void 0)return t;let n={high:om,low:sm};om=0,sm=0;let a={value:5};if(j(e)){let t=I(e);cm(9),lm(t.domain.length);for(let e=0;e<t.domain.length;e++)a.value+=o(t.domain[e]),a.value+=o(t.range[e])}else{let t=P(e).elements;cm(5),lm(t.length);for(let e of t)a.value+=o(e)}let s=i.length;return r.set(e,s),i.push(a.value,om,sm),om=n.high,sm=n.low,s};return(n,r)=>{let i={high:om,low:sm};om=im,sm=am;for(let t of e)o(n[t]);t[2*r]=sm,t[2*r+1]=om,om=i.high,sm=i.low}},hm=25214903917n,gm=(1n<<48n)-1n,_m=2147483647,vm=e=>{let t={value:(BigInt.asUintN(64,e)^hm)&gm},n=e=>(t.value=t.value*hm+11n&gm,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^hm)&gm},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=_m)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},ym=[],bm=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},xm=()=>{for(let e=1277011;ym.length<1341;e++)bm(e)&&ym.push(e);return ym},Sm=e=>{let t=xm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Cm=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},wm=e=>{for(let t=Math.max(e,9);;t++){let e=Cm(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},Tm=(e,t,n)=>{if(t<=0)return[];let r=wm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Sm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Em=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:_m),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Dm=(1n<<63n)-1n-24n,Om=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Dm*BigInt(n)+i)%t;return r<0n?r+t:r})},km=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,Am=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=zn(e.domain),n=P(e.range).elements;return{lists:t.map(()=>n),create:e=>jt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>P(e).elements),create:t=>Hn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>P(e).elements),create:Vn}}},jm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Mm=(e,t,n,r)=>{if(F(t))return[];let i=r===`1.7.4`?Em:Tm;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=jm(t,r)?void 0:Am(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(_m)?Om(e,t,n):i(e,Number(t),n)).map(e=>a.create(km(a.lists,e)))}let o=P(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Nm=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new h(`RandomElement of the empty set`);return n},Pm=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...zn(e.domain)];return jt(n,n.map(()=>Pm(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Hn(e.names.map((n,r)=>[n,Pm(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Vn(e.factors.map(e=>Pm(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new h(`RandomElement of the empty set`);return e.low+r}return Nm(P(e).elements,t)},Fm=(e,t=0n)=>{let n=vm(t),r={random:vm(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Hn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:dm,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.seededState&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.seededState=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},Im=e=>jn([...e.possibleCounts].map(([e,t])=>[e,t])),Lm=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Im(e)]]),Rm=`----------------------------- MODULE Bags --------------------------------
468
461
  (**************************************************************************)
469
462
  (* A bag, also called a multiset, is a set that can contain multiple *)
470
463
  (* copies of the same element. A bag can have infinitely many elements, *)
@@ -617,7 +610,7 @@ CopiesIn(e, B) ==
617
610
  7 Dec 98 : Corrected error found by Stephan Merz.
618
611
  6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
619
612
  5 Dec 98 : Initial version.
620
- `,jm=/* @__PURE__ */ new Map([[`Bags`,Am],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
613
+ `,zm=/* @__PURE__ */ new Map([[`Bags`,Rm],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
621
614
  (***************************************************************************)
622
615
  (* The two definitions in this standard module are overridden by TLC in *)
623
616
  (* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
@@ -873,7 +866,7 @@ TestRandomSetOfSubsets(k, n, S) ==
873
866
  [i \\in 1..5 |-> Cardinality(RandomSetOfSubsets(k, n, S))]
874
867
 
875
868
  =============================================================================
876
- `],[`RealTime`,`${Ed}\n`],[`Reals`,`${Td}\n`],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
869
+ `],[`RealTime`,`${Ge}\n`],[`Reals`,`${We}\n`],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
877
870
  (***************************************************************************)
878
871
  (* Defines operators on finite sequences, where a sequence of length n is *)
879
872
  (* represented as a function whose domain is the set 1..n (the set *)
@@ -1277,7 +1270,7 @@ TLCEvalDefinition(definitionName) ==
1277
1270
  TRUE \\* TODO
1278
1271
 
1279
1272
  ============================================================================
1280
- `],[`Toolbox`,`${Dd}\n`],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
1273
+ `],[`Toolbox`,`${Ke}\n`],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
1281
1274
  LOCAL INSTANCE TLC
1282
1275
  LOCAL INSTANCE TLCExt
1283
1276
  LOCAL INSTANCE GraphViz
@@ -1677,7 +1670,7 @@ _TLCTrace ==
1677
1670
  /\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
1678
1671
 
1679
1672
  =============================================================================
1680
- `]]),Mm=new Map([...[...jm].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,Am.replace(`
1673
+ `]]),Bm=new Map([...[...zm].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,Rm.replace(`
1681
1674
  LOCAL INSTANCE Naturals
1682
1675
  `,`
1683
1676
  EXTENDS TLC
@@ -1769,16 +1762,7 @@ _TEPosition ==
1769
1762
  ELSE TLCGet("level") + 1
1770
1763
 
1771
1764
  =============================================================================
1772
- `]]),Nm=(e=`master`)=>e===`1.7.4`?Mm:jm,Pm=(e,t,n)=>new S(`Applying ${e} to the following value,\nwhich is not ${t}:\n${z(n)}`),Fm=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${z(r)}`),Im=e=>P(e)?Ar(e):void 0,Lm=(e,t,n)=>{let r=V(e,t,n),i=Im(r);if(!i)throw Pm(n,`a function with a finite domain`,r);return i},Rm=(e,t,n)=>{let r=V(e,t,n),i=Im(r);if(!i)throw Fm(t===0?`first`:`second`,n,`bag`,r);return i},zm=(e,t)=>{if(!N(e)||!I(e))throw t();return L(e).elements},Bm=e=>e.range.every(e=>typeof e==`number`&&e>0),Vm=(e,t)=>{let n=e.domain.findIndex(e=>nn(e,t));return n===-1?void 0:e.range[n]},Hm=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Um=Hm(`BagDiff`,`tlc2.value.impl.Value`,2),Wm=Hm(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Gm=Hm(`BagUnion`,`tlc2.value.impl.Value`,1),Km=Hm(`BagOfAll`,`tlc2.value.impl.Value`,2),qm=Hm(`BagCup`,`tlc2.value.impl.Value`,2),Jm=Hm(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Ym=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Vi(e)}`;throw Ui(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Xm=(e,t,n)=>{let r=Ym(e,n)+Ym(t,n);if(Fi(r))throw Ii(`${e}+${t}`);return r},Zm=(e,t,n,r)=>{let i=Vm(n,e.domain[t]),a=Ym(e.range[t],r);return i===void 0?a:a-Ym(i,r)|0},Qm=(e,t)=>Un(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>nn(e[0],r));a?a[1]=Xm(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),$m=Ut([],[]),eh=e=>[ji(`EmptyBag`,$m),H(`IsABag`,1,e=>{let t=Im(V(e,0,`IsABag`));return t!==void 0&&Bm(t)}),H(`BagCardinality`,1,e=>{let t=V(e,0,`BagCardinality`);return Lm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Pm(`BagCardinality`,`a bag`,t);return Xm(e,n,Jm)},0)}),H(`BagIn`,2,e=>{let t=V(e,1,`BagIn`),n=Vm(Lm(e,1,`BagIn`),V(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Fm(`second`,`BagIn`,`bag`,t);return n>0}),H(`CopiesIn`,2,e=>{let t=V(e,1,`CopiesIn`),n=Vm(Lm(e,1,`CopiesIn`),V(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Fm(`second`,`CopiesIn`,`bag`,t);return n}),H(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Rm(e,t,`(+)`);if(!Bm(n))throw Fm(t===0?`first`:`second`,`(+)`,`bag`,V(e,t,`(+)`));return n});return Qm(t,qm)}),H(`\\ominus`,2,e=>{let t=Rm(e,0,`(-)`),n=Rm(e,1,`(-)`);return Un(t.domain.flatMap((e,r)=>{let i=Zm(t,r,n,Um);return i>0?[[e,i]]:[]}))}),H(`BagUnion`,1,e=>{let t=V(e,0,`BagUnion`),n=zm(t,()=>Pm(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??$m;let r=n.map(e=>{let n=Im(e);if(!n)throw new S(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${z(t)}`);return n});return Qm(r,Gm)}),H(`\\sqsubseteq`,2,e=>{let t=Lm(e,0,`\\sqsubseteq`),n=Lm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Zm(t,r,n,Wm)<=0)}),Mi(`BagOfAll`,2,e=>{let t=Ai(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new S(`The first argument of BagOfAll should be an operator, but instead it is:\n${z(t.literalBody)}`);let n=V(e,1,`BagOfAll`),r=Im(n);if(!r)throw Fm(`second`,`BagOfAll`,`function with a finite domain`,n);return Qm(r.domain.map((e,n)=>Ut([t.call([e])],[r.range[n]])),Km)}),H(`SubBag`,1,t=>{let n=V(t,0,`SubBag`);if(!P(n))throw new y(`DOMAIN expects a function but received ${z(n)}`);let r=Ar(n),i=Ln(r.range).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new y(`Attempted to apply a function to ${z(r)}, which is not in its domain`);return Ln(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Ut(e.map(e=>e[0]),e.map(e=>e[1]))))}),H(`BagToSet`,1,e=>Rr(Lm(e,0,`BagToSet`))),H(`SetToBag`,1,e=>{let t=V(e,0,`SetToBag`),n=zm(t,()=>Pm(`BagToSet`,`a function with a finite domain`,t));return Ut([...n],n.map(()=>1))})],th=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,nh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,rh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,ih=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,ah=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,oh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,sh=e=>{if(!P(e))return!1;let t=Ar(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},ch=(e,t)=>Ui(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Vi(t)}`),lh=(e,t)=>Ui(e,`Cannot cast tlc2.value.impl.${Vi(t)} to tlc2.value.impl.StringValue`),uh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),dh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw ch(t,e);return`[${L(e).elements.map(e=>ph(e,t)).join(`,`)}]`},fh=(e,t)=>{let n=Ar(e),r=Cr(n);return r?`[${r.map(e=>ph(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${uh(typeof e==`string`?e:z(e))}:${ph(n.range[r],t)}`).join(`,`)}}`},ph=(e,t)=>typeof e==`string`?uh(e):typeof e==`object`?e.kind===`ModelValue`?uh(e.name):N(e)?dh(e,t):fh(e,t):String(e),mh=e=>{if(N(e))return dh(e,th);if(!P(e)||sh(e))throw ch(th,e);return fh(e,th)},hh=e=>{if(!P(e))throw ch(nh,e);return fh(e,nh)},gh=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},_h=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return At(e);if(Array.isArray(e))return $n(e.map(e=>_h(e,t)));if(typeof e==`object`&&e)return er(Object.entries(e).map(([e,n])=>[At(e),_h(n,t)]));throw Ui(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},vh=(e,t)=>{if(e.trim()===``)return _h(null,t);try{return _h(JSON.parse(e,(e,t,n)=>typeof t==`number`?gh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Ui(t,e.message):e}},yh=(e,t)=>{if(typeof e!=`string`)throw lh(t,e);return e},bh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Ui(n,`${t} (No such file or directory)`);return r},xh=e=>[Ni(`ToJson`,1,e=>At(ph(V(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Ni(`ToJsonArray`,1,e=>At(mh(V(e,0,`ToJsonArray`)))),Ni(`ToJsonObject`,1,e=>At(hh(V(e,0,`ToJsonObject`)))),Ni(`JsonSerialize`,2,t=>{let n=yh(V(t,0,`JsonSerialize`),rh),r=V(t,1,`JsonSerialize`);if(!Cr(r)&&!sh(r))throw new S(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${z(r)}`);return e.writeFile?.(n,ph(r,rh)),!0}),Ni(`ndJsonSerialize`,2,t=>{let n=yh(V(t,0,`ndJsonSerialize`),ih),r=V(t,1,`ndJsonSerialize`),i=Cr(r);if(!i)throw new S(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${z(r)}`);return e.writeFile?.(n,i.map(e=>`${ph(e,ih)}\n`).join(``)),!0}),Ni(`JsonDeserialize`,1,t=>{let n=yh(V(t,0,`JsonDeserialize`),ah);return vh(bh(e,n,ah),ah)}),Ni(`ndJsonDeserialize`,1,t=>{let n=yh(V(t,0,`ndJsonDeserialize`),oh);return $n(bh(e,n,oh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>vh(e,oh)))})],Sh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,Ch=1e6,wh=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),Th=(e,t,n)=>{if(typeof e!=`number`||e<0)throw wh(t,n,`nonnegative integer`,z(e));return e},Eh=(e,t,n,r)=>{if(!N(e)||!I(e))throw wh(t,n,r,z(e));return L(e).elements},Dh=(e,t,n,r)=>Ln(Array.from({length:t},()=>Ln(e.filter(()=>r.nextDouble()<n)))),Oh=(e,t)=>{let n=`RandomSetOfSubsets`,r=Th(V(e,0,n),`first`,n),i=Th(V(e,1,n),`second`,n),a=Eh(V(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw wh(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw wh(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Dh(a,r,a.length===0?0:i/a.length,t.getRandom())},kh=e=>[Ni(`RandomSubset`,2,t=>{let n=V(t,0,`RandomSubset`);if(typeof n!=`number`)throw wh(`first`,`RandomSubset`,`nonnegative integer`,z(n));if(n<0)throw Ui(Sh,String(n));let r=V(t,1,`RandomSubset`);if(!N(r)||!R(r)&&!I(r))throw wh(`second`,`RandomSubset`,`a finite set`,z(r));let i=Cm(r,e.version);if(i&&i.reduce((e,t)=>e*L(t).elements.length,1)>Ch)throw Ui(Sh,`Attempted to construct a set with too many elements (>${Ch}).`);return Ln(wm(n,r,e.getRandom(),e.version))}),Ni(`RandomSetOfSubsets`,3,t=>Oh(t,e)),Ni(`TestRandomSetOfSubsets`,3,t=>$n(Array.from({length:5},()=>L(Oh(t,e)).elements.length)))],Ah=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,jh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Ah})`,Mh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Ah}) throws java.io.IOException`,Nh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Ah})`,Ph=()=>er([[`action`,Ln([])],[`state`,Ln([])]]),Fh=()=>er([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Ih=e=>er([[`name`,e??`UnnamedAction`],[`location`,Fh()]]),Lh=(e,t,n)=>{let r=e.map((e,t)=>$n([t+1,er(Object.entries(e))])),i=r.slice(1).map((e,n)=>$n([r[n],t[n],e])),a=n?[$n([r[r.length-1],n.action,r[n.start]])]:[];return er([[`action`,Ln([...i,...a])],[`state`,Ln(r)]])},Rh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return km(e).get(t)},zh=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),z(r));else throw new S(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${z(n)}`)},Bh=e=>e.every(e=>e!==void 0),Vh=(e,t)=>er(t.variables.map((t,n)=>[t,e[n]])),Hh=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!B(e)){if(t.variableIndex.has(r))return!0;let e=_l(r,t);if(e&&!n.has(e)&&(n.add(e),Hh(e.body,t,n)))return!0}return vi(e).some(e=>Hh(e,t,n))},Uh=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[H(`AssertEq`,2,t=>{let n=V(t,0,`AssertEq`),r=V(t,1,`AssertEq`),i=nn(n,r);return i||(e(z(`Assertion failed`,!0)),e(z(n,!0)),e(z(r,!0))),i}),Xi(`AssertError`,2,e=>{let n=Ai(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Ui(jh,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=Zi(e,0,`AssertError`)();try{Zi(e,1,`AssertError`)()}catch(e){if(e instanceof y)return Ca(e.message,t.isTool)===r;throw e}return!1}),Ni(`TLCGetOrDefault`,2,e=>{let n=V(e,0,`TLCGetOrDefault`);return Rh(t,n)??V(e,1,`TLCGetOrDefault`)}),{...Mi(`TLCGetAndSet`,4,n=>{let r=V(n,0,`TLCGetAndSet`),i=Rh(t,r)??V(n,3,`TLCGetAndSet`),a=Ai(n,1,`TLCGetAndSet`);return zh(t,e,r,a.call([i,V(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Ni(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!Bh(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Ui(Mh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return $n(t.getBehavior(r).map(e=>Vh(e,n.environment)))}),Ni(`CounterExample`,0,()=>t.counterExample??Ph()),H(`ToTrace`,1,e=>{let t=V(e,0,`ToTrace`);if(!P(t)||!nn(Rr(t),Ln([`action`,`state`])))throw new y(`The argument of ToTrace should be a CounterExample, but instead it is:\n${z(t)}`);let n=L(Ir(t,`state`)).elements.map(e=>Cr(e)??[]);return $n(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),H(`TLCModelValue`,1,e=>{let t=V(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new S(`The argument of ModelValue should be a string, but instead it is:\n${z(t)}`);return Vt(t)}),Xi(`TLCDefer`,1,()=>!0),H(`TLCNoOp`,1,e=>V(e,0,`TLCNoOp`)),Xi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!Bh(r))throw Ui(Nh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||gl(Zi(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new C(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Xi(`TLCCache`,2,(e,t)=>{let r=Ai(e,0,`TLCCache`),a=oi(Zi(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Hh(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),H(`TLCFP`,1,e=>Number(BigInt.asIntN(32,sm([V(e,0,`TLCFP`)])))),Ni(`TLCEvalDefinition`,1,(e,t)=>{let n=V(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?_l(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new S(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${z(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new S(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return W({kind:`Identifier`,name:n,location:r.location},t)})]},Wh=(e,t)=>[Ni(`_Track`,2,e=>{let n=String(V(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,V(e,0,`_Track`)===!0?r+1:r),!0}),Ni(`_Counts`,0,()=>Om(t)),Ni(`_CheckName`,1,n=>{let r=String(V(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(z(Om(t),!0)),!1)}),Ni(`_PrintCounts`,0,()=>(e(z(Om(t),!0)),!0))],Gh=e=>String(e).padStart(2,`0`),Kh=e=>`${e.getUTCFullYear()}.${Gh(e.getUTCMonth()+1)}.${Gh(e.getUTCDate())}.${Gh(e.getUTCHours())}${Gh(e.getUTCMinutes())}${Gh(e.getUTCSeconds())}`,qh=e=>Un([...e].map(([e,t])=>[e,$n([t])])),Jh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Yh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Xh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Zh=(e,t,n)=>{if(e.version===`1.7.4`?!Yh.has(t)||!e.isStarted&&Xh.has(t):!e.isStarted&&Jh.has(t))throw new S(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return er([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return er([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return er([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,At(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,At(Kh(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Ih(void 0);case`all`:return qh(e.registers);case`all:named`:return qh(km(e))}if(t.startsWith(`s:`)){let n=km(e).get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return At(e.properties.get(t.slice(2))??t);throw new S(`TLCGet(${t}) was undefined.`)},Qh=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new S(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${z(t)}`);return Zh(e,t,n?.state)},$h=e=>e.length===0?[[]]:e.flatMap((t,n)=>$h([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),eg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&L(e).elements.forEach(eg),e.kind===`Function`&&e.range.forEach(eg))},tg=(t,n)=>[H(`Print`,2,e=>(t(`${dt(z(V(e,0,`Print`),!0,!0))} ${dt(z(V(e,1,`Print`),!0,!0))}`),V(e,1,`Print`))),H(`PrintT`,1,e=>(t(dt(z(V(e,0,`PrintT`),!0,!0))),!0)),H(`Assert`,2,t=>{if(V(t,0,`Assert`)!==!0)throw new S(`The first argument of Assert evaluated to FALSE; the second argument was:\n${dt(z(V(t,1,`Assert`)))}`,e.assertViolation);return!0}),H(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),H(`:>`,2,e=>Un([[V(e,0,`:>`),V(e,1,`:>`)]])),H(`@@`,2,e=>{let t=ki(e,0,`@@`),n=ki(e,1,`@@`);return Wn([..._t(t),..._t(n)])}),H(`ToString`,1,e=>At(z(V(e,0,`ToString`),!0))),H(`TLCEval`,1,e=>{let t=V(e,0,`TLCEval`);return eg(t),t}),H(`Permutations`,1,e=>{let t=Di(e,0,`Permutations`);return Ln($h(t).map(e=>Un(t.map((t,n)=>[t,e[n]]))))}),Mi(`SortSeq`,2,e=>{let t=Ai(e,1,`SortSeq`);return $n(Oi(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),n.version===`1.7.4`?Wi({...Ni(`TLCGet`,1,(e,t)=>Qh(n,V(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Wi(Xi(`TLCGet`,1,(e,t)=>Qh(n,Zi(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Ni(`TLCSet`,2,e=>{let r=V(e,0,`TLCSet`);return zh(n,t,r,V(e,1,`TLCSet`)),!0}),ji(`Any`,Lt),H(`RandomElement`,1,e=>Em(Ti(e,0,`RandomElement`),n.getRandom()))],ng=(e,t)=>e.every(e=>Dr(e,t)),rg=Ln([!1,!0]),ig=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Hn(ig(e,t,r),ig(e,r,n))},ag=[`\\cup`,`\\cap`,`\\`],og=e=>typeof e==`object`&&e.kind===`MixedSet`,sg=e=>e.kind===`Interval`?L(e).elements:e.elements,cg=(e,t,n)=>{let r=sg(t);if(e!==`\\cup`){let t=e===`\\cap`;return Rn(r.filter(e=>Dr(e,n)===t))}if(r.length===0)return n;if(!ft(n))return Zt({kind:`SetOperation`,operator:e,left:t,right:n});let i=L(n).elements.filter(e=>!Dr(e,t));return Rn([...r,...i])},lg=[ji(`TRUE`,!0),ji(`FALSE`,!1),ji(`BOOLEAN`,rg),ji(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Pi(`=`,Fn),Pi(`#`,(e,t)=>!Fn(e,t)),H(`~`,1,e=>!Ci(e,0,`~`)),H(`<=>`,2,e=>Ci(e,0,`<=>`)===Ci(e,1,`<=>`)),H(`/\\`,2,e=>Ci(e,0,`/\\`)&&Ci(e,1,`/\\`)),H(`\\/`,2,e=>Ci(e,0,`\\/`)||Ci(e,1,`\\/`)),H(`=>`,2,e=>!Ci(e,0,`=>`)||Ci(e,1,`=>`)),H(`\\in`,2,e=>Dr(V(e,0,`\\in`),V(e,1,`\\in`))),H(`\\notin`,2,e=>!Dr(V(e,0,`\\notin`),V(e,1,`\\notin`))),H(`\\subseteq`,2,e=>{let t=wi(e,0,`\\subseteq`),n=V(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&I(t.base)?ng(L(t.base).elements,n.base):ng(L(t).elements,n)}),...ag.map(e=>H(e,2,t=>{let n=V(t,0,e),r=V(t,1,e);if(ft(n)&&ft(r)&&!og(n)&&!og(r)){if(e===`\\cup`&&R(n))return r;let t=e===`\\cup`?Hn:e===`\\cap`?Vn:Bn;return Er(()=>t(L(n),L(r)),()=>cg(e,n,r))}return ft(n)?cg(e,n,r):e!==`\\`&&ft(r)?cg(e,r,n):Zt({kind:`SetOperation`,operator:e,left:n,right:r})})),H(`SUBSET`,1,e=>({kind:`Subset`,base:V(e,0,`SUBSET`)})),H(`UNION`,1,e=>{let t=wi(e,0,`UNION`),n=yn(t)?t.elements.filter(yn):[];if(!yn(t)||n.length!==t.elements.length)return Zt({kind:`Union`,base:t});if(og(t)||n.some(og)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Dr(t,e)||e.elements.push(t)})),Rn(e.elements)}return n.length===0?zn:ig(n.map(L),0,n.length)}),H(`DOMAIN`,1,e=>{let t=V(e,0,`DOMAIN`);if(!P(t))throw new y(`DOMAIN expects a function but received ${z(t)}`);return Rr(t)})],ug=Ki(`Integers`,`Neg`,`IntValue`,1),dg=e=>{let t=Ki(e,`DotDot`,`IntervalValue`,2);return[qi(e,`+`,`Plus`,(e,t)=>e+t),qi(e,`-`,`Minus`,(e,t)=>e-t),qi(e,`*`,`Times`,(e,t)=>e*t),qi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new S(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new S(`0^0 is undefined.`);return e**t}),qi(e,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new S(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/n)|0;return e<0&&Math.imul(e,n)!==t?e-1:e}let r=Math.floor(t/n);if(Fi(r))throw Ii(`${t} \\div ${n}`);return r}),qi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new S(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),H(`..`,2,e=>({kind:`Interval`,low:Gi(V(e,0,`..`),t),high:Gi(V(e,1,`..`),t)}))]},fg=dg(`Naturals`),pg=dg(`Integers`),mg=e=>{let t=fg.indexOf(e);return t===-1?void 0:pg[t]},hg=[ji(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...fg,Yi(`<`,(e,t)=>e<t),Yi(`>`,(e,t)=>e>t),Yi(`<=`,(e,t)=>e<=t),Yi(`>=`,(e,t)=>e>=t,`>`)],gg=[ji(`Int`,{kind:`InfiniteSet`,name:`Int`}),...pg,Yi(`>=`,(e,t)=>e>=t),H(`-.`,1,e=>{let t=Gi(V(e,0,`-`),ug);if(Fi(-t))throw Ii(`-${t}`);return-t})],_g=(e,t,n)=>{let r=V(e,t,n),i=Cr(r);if(!i)throw new S(`${n}\n${z(r)}`);return i},vg=(e,t,n)=>{let r=V(e,t,n);return typeof r==`string`?r:_g(e,t,n)},yg=(e,t,n)=>typeof e==`string`?At(e.slice(t,n)):$n(e.slice(t,n)),bg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,xg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Sg=(e,t)=>{let n=qd.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Wi(e,t):e}):t},Cg=e=>Sg(`Sequences`,[H(`Seq`,1,e=>({kind:`SequenceSet`,base:V(e,0,`Seq`)})),H(`Len`,1,e=>vg(e,0,bg(``,`Len`)).length),H(`\\o`,2,e=>{let t=vg(e,0,xg(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=_g(e,1,xg(`t \\o s`,`sequence`));return $n([...t,...n])}let n=V(e,1,`\\o`);if(typeof n!=`string`)throw new S(`${xg(`t \\o s`,`string`)}\n${z(n)}`);return At(t+n)}),H(`Append`,2,t=>$n([..._g(t,0,xg(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),V(t,1,`Append`)])),H(`Head`,1,e=>{let t=_g(e,0,bg(``,`Head`));if(t.length===0)throw new S(`Attempted to apply Head to the empty sequence.`);return t[0]}),H(`Tail`,1,e=>{let t=vg(e,0,bg(``,`Tail`));if(t.length===0)throw new S(`Attempted to apply Tail to the empty sequence.`);return yg(t,1)}),H(`SubSeq`,3,e=>{let t=vg(e,0,bg(`first `,`SubSeq`)),n=Si(e,1,`SubSeq`),r=Si(e,2,`SubSeq`);if(n>r)return yg(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new S(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${z(V(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return yg(t,n-1,r)}),Mi(`SelectSeq`,2,e=>{let t=Ai(e,1,`SelectSeq`);return $n(_g(e,0,bg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new S(`The second argument of SelectSeq should be a operator, but instead it is:\n${z(n)}`);return n}))})]),wg=e=>Sg(`FiniteSets`,[H(`IsFiniteSet`,1,e=>{let t=V(e,0,`IsFiniteSet`);if(N(t))return xr(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new y(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${z(t)}\nis a finite set.`:`Attempted to check if the ${pt(t)} ${z(t)} is a finite set.`)}),H(`Cardinality`,1,t=>{let n=V(t,0,`Cardinality`);if(!N(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new S(`Attempted to compute cardinality of the value\n${z(n)}`);return yr(n,e)})]),Tg=/* @__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`]]]),Eg=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:hg};case`Integers`:return{extends:[`Naturals`],operators:gg};case`Sequences`:return{extends:[],operators:Cg(n.version)};case`FiniteSets`:return{extends:[],operators:wg(n.version)};case`TLC`:return{extends:[],operators:Sg(`TLC`,tg(t,n))};case`Randomization`:return{extends:[],operators:kh(n)};case`_Possible`:return{extends:[],operators:Wh(t,n)};case`Json`:return{extends:[],operators:xh(r)};case`Bags`:return{extends:[],operators:eh(i)};case`TLCExt`:return{extends:[],operators:Uh(t,n)};default:return}},Dg=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}])),Og={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]}},kg=(e,t)=>{let n=Og[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Ag=`$subexpression`,jg=(e,t)=>new u(`${e} at line ${t.line}, column ${t.column}`),Mg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Mg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of vi(e)){let e=Mg(r,t,n);if(e)return e}},Ng=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Pg=(e,t)=>{let n=e.location,r=Ng(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 jg(`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 jg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Ag,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Ag,args:e.args,location:n,resolution:Da},location:n}},Fg=(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:Da})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Da}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Da};return Pg({...t,params:[...t.params,...r]},a)},Ig=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw jg(r,i);ka.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:g(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw jg(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>Zo(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw jg(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=Pa(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw jg(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&Mg(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw jg(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||to(t.operand,1)!==0)throw jg(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=ao(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[to(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw jg(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=to(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw jg(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw jg(`Unexpected subexpression selector`,i);let s=r?r.sets:oo(n),c=s?.[to(t.operand,s.length)];if(!c)throw jg(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return Fg(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw jg(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return Fg(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw jg(`Subexpression selection failed`,i);return Pg(a,o.current)},Lg=(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 no(e,t,n)},Rg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||vi(e).some(Rg),zg=(e,t,n,r=!1)=>{if(!Rg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=es(e,e=>zg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Bg(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)=>zg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:es(e,e=>zg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Lg(a.name,[],void 0,t):a.kind===`Apply`?Lg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Ig(o,t,a,r);return c!==a&&Oa.add(c),c},Bg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:zg(e.expression,t,n,!0)}))}),Vg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Hg=(e,t)=>Bg(e,Vg(t.definitions),()=>!1),Ug=(e,t)=>{let n=Vg([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>zg(e,n,i),o=e=>i(e)||!n(e),s=e=>zg(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return Bg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Bg(e,n,o):$o(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>Rg(e.body))||e.assumptions.some(e=>Rg(e.expression))?{...p,definitions:e.definitions.map(e=>$o(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Wg=(e,t)=>`${e}${t}`,Gg=(e,t,n)=>`${e}${t}${n}`,Kg=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},qg=(e,t,n)=>`${e},${t},${n}`,Jg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Yg=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Xg=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Zg=(e,t,n,r)=>({...Jg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Qg=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,$g=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,e_=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,{...Zg(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),t_=Zg(`$Set`,0,[2],[1]),n_=Zg(`$Junction`,0,[3],[1]),r_=Zg(`$Choose`,0,[2],[1]),i_=Zg(`$Function`,0,[3],[1]),a_=Zg(`$FcnApply`,0,[2,2],[1,1]),o_=Zg(`$RcdSelect`,0,[2,0],[1,1]),s_=Zg(`'`,2,[1],[0]),c_=Zg(`ENABLED`,1,[2],[0]),l_=Zg(`[]`,3,[3],[0]),u_=Zg(`$SquareAct`,2,[2,1],[0,0]),d_=Zg(`$WF`,3,[1,2],[0,0]),f_=Zg(`$TemporalExists`,3,[3],[0]),p_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),m_=e=>e.map(e=>({name:e,arity:0})),h_=(e,t)=>t.location.range?_(`${e}.`,t.location.range):new u(`${e} at line ${t.location.line}, column ${t.location.column}`),g_=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),__=e=>e.kind!==`Let`&&e.kind!==`Label`,v_=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=e_.get(t)??Dg.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Jg(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(Gg(e,n,t))}),t.data.constraints.forEach((e,t)=>Yg(r.constraints,t,e)),Xg(r.argConstraints,Wg(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Xg(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>Qg(e,n))throw new u(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new u(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(qg(t,n,r)),s=Jg(Math.max(e.level,...t.filter((t,n)=>$g(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)=>{$g(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)=>Yg(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Yg(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Yg(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Yg(s.constraints,t,Qg(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Yg(s.constraints,e,Qg(r,a)))}))}),e.argParams.forEach(e=>{let t=Kg(e),n=a(t.operator)?.operator;n&&Yg(s.constraints,t.param,Qg(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Xg(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Xg(s.argConstraints,Wg(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Xg(s.argConstraints,Wg(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Kg(e),n=a(t.operator);n&&Xg(s.argConstraints,Wg(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Kg(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Kg(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(Gg(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(Gg(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(Gg(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,m_(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Jg();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=p_(n,m_(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),l=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw h_(`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 h_(`Action used where only temporal formula or state predicate allowed`,e);g_.has(e.operator)&&l(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&__(n)&&n.kind!==r)throw h_(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=v(e,n);t.constraints.forEach((e,t)=>Yg(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Xg(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof u)||t.sany?t:h_(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Jg();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return l(n,e),i(n_,n)}case`Prime`:case`Unchanged`:return s(s_,[e.expression],t);case`Enabled`:return s(c_,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(l_,[n])}case`If`:return s(n_,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(n_,[...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(n_,[e.body],t,e.bounds.map(e=>e.set),Ka(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw h_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?f_:n_,[e.body],t,[],e.names);case`Choose`:return s(r_,[e.body],t,e.set?[e.set]:[],Ga(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(t_,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(t_,[e.predicate],t,[e.bound.set],Ga(e.bound.pattern));case`SetMap`:return s(t_,[e.expression],t,e.bounds.map(e=>e.set),Ka(e.bounds));case`FunctionConstruction`:return s(i_,[e.body],t,e.bounds.map(e=>e.set),Ka(e.bounds));case`Record`:return s(i_,e.fields.map(e=>e.value),t);case`RecordSet`:return s(t_,e.fields.map(e=>e.value),t);case`Except`:return s(t_,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(a_,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(t_,e.args,t)}]);case`Bracket`:return Jg();case`FieldAccess`:return i(o_,[a(e.record,t),{data:Jg()}]);case`BoxAction`:case`AngleAction`:return s(u_,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(d_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Jg()}},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 vi(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,p_(t,m_(e.names))),i;default:return es(e,(e,n)=>(a(e,r,p_(t,m_(n))),e)),i}},_=(e,t,n,r)=>{let i=p_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Jg(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(Wg(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(Gg(e.name,n,t.name))).map(e=>qg(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(Kg(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Kg(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,{...Jg(),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}},y_=(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`?y_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Jg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Yg(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Xg(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},b_=(e,t,n,r)=>{let i=v_(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`?y_(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:g(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=Wo([...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`?y_(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw p(n)}})),...n],r);if(l.length>0)throw p(l,!1,void 0,r)},x_=(e,t)=>e.maxLevels[t]??3,S_=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=v_({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=>Yg(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Yg(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Xg(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Kg(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)&&Yg(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(y_(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=g(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(Wg(e.name,i));a!==void 0&&x_(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=Kg(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=x_(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw p([...r.values()])}},C_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],w_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),T_=new Map(Vd.flatMap(e=>e.map(t=>[t,e[0]]))),E_=e=>T_.get(e)??e,D_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},O_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(D_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},k_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),A_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:E_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:E_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},j_=(e,t)=>{let n=[];for(let r=t;;){let t=A_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},M_=e=>({line:e.line,column:e.column}),N_=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=j_(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},P_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,F_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},I_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&P_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&P_(e[n+1],e[n+2])?n+=P_(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=>F_[e])}"`:r.text)}return t},L_=e=>e[2]?.text,R_=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},z_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>z_(e.modules,t)).find(Boolean),B_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:(Gd.has(i)?t?.(i):void 0)??Kd.get(i)??t?.(i)??Vp(e,i),s=o===void 0?[]:Ce(o),c=R_(s),l=c.get(L_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Up(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>z_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},V_=(e,t)=>{let n=B_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=j_(t,e+1);r.push({location:M_(t[e]),apply:e=>i.forEach(t=>e.put(k_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:M_(u),apply:t=>t.put(k_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&j_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),w_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(M_(u)),r.push({location:M_(u),apply:e=>e.put(k_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(k_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=E_(e.name);r.push({location:e.location,apply:n=>n.put(k_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(k_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(k_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Na(e.location,t.location)?-1:+!!Na(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=O_();i.set(e??``,s),Bd.toReversed().forEach(e=>s.put(k_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},H_=(e,t,n)=>V_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),U_=(e,t)=>{let n=V_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},W_=(e,t)=>H_(e,t,`variable`),G_=(e,t,n)=>{let r=B_(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),Hd.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=N_(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),h=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},g=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?h(n,r,t):[n,i]};return t},_=g(e=>e.extends),v=g(e=>e.instances),y=/* @__PURE__ */ new Set([void 0]),b=/* @__PURE__ */ new Map;I_(s(void 0)).forEach((e,t)=>{t===3&&Wd.forEach(a),a(e)});let x=u(void 0);for(;;){let e=_(x,/* @__PURE__ */ new Set)??v(x,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;if(f.add(`${t.key}>${n}`),b.set(t.unit,[...b.get(t.unit)??[],n]),!y.has(n)){if(y.add(n),r(n).tokens.length===0){let e=t.unit??L_(r(void 0).tokens);throw m(n,e)}I_(s(n)).forEach(a)}}C_.forEach(a);let ee=/* @__PURE__ */ new Set,te=e=>{if(ee.has(e))return;ee.add(e);let t=b.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(te),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return te(void 0),Ud.forEach(a),[...i]},K_=t=>{switch(t.kind){case`Number`:try{return mt(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Vt(t.name);case`Set`:return Ln(t.elements.map(K_))}},q_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],J_=(e,t)=>{try{return Up(e)}catch(n){if(!(n instanceof u))throw n;let r=hp(e);throw r===void 0?n:p([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},Y_=e=>new u(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),X_=(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)}.`},Z_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,Q_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:Z_(e),$_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Da},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),ev=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>z(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new y(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&nn(t,r)})});if(t)return t[1];throw new y(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:z(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},tv=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||vi(e).some(e=>tv(e,t)),nv=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ls(e),n.get(e)??n.size)),n},rv=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),iv=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw cl(e);if(e.kind===`Number`&&!_u(e.value))throw ll(e);iv(e.kind===`Let`?[...vi(e),...rv(e.instances??[])]:vi(e))}),av=(e,t)=>{let n=Up(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Set,s=new Map(lg.map(e=>[e.name,e])),c=/* @__PURE__ */ new Map,l=Dm(e.checkDeadlock,t.seed);l.isWarningEnabled=t.isWarningEnabled??!0,l.isTool=t.isTool??!1,l.version=t.version??`master`;let d=/* @__PURE__ */ new Map,f=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,b=[],x=/* @__PURE__ */ new Map,ee=[],te=[],S=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne={value:0},re=e=>`${e}#${ne.value++}`,ie=[],C=[],ae=S_(e=>{let t=_.get(e)??ue(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>r.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,w=/* @__PURE__ */ new Map,T=e=>{let n=c.get(e);if(n)return n;let r=Eg(e,t.print,l,t.files,s);if(!r)return;Tg.get(e)?.forEach(T);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>T(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{s.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Dg.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:kg(e,t.name)??i.get(t.name)?.range})}),c.set(e,i),i},E=e=>{if(Gd.has(e)&&t.loadModule?.(e)!==void 0)return;let n=T(e),r=Tg.get(e)??[];return n&&S(e,r),n&&r.includes(`Integers`)&&T(`Integers`),n},D=e=>(iv([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...rv(e.instances)]),e.modules.forEach(D),e);D(n);let ce=(e,n)=>{let r=t.loadModule?.(e)??Od.get(e)??Vp(t.source,e);if(r===void 0)throw m(e,n);let i=J_(r,e);if(i.name!==e)throw p([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return D(i)},le=e=>{let t=te.indexOf(e.name);if(t!==-1)throw new u(`Circular dependency among .tla files; dependency cycle is: ${[...te.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];te.push(e.name),ee.push(n);let o=be(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:C,levelChecks:a});if(ee.pop(),te.pop(),i.length>0)throw p(i,!1,void 0,C);let s=r.find(e=>n.has(e.name)),c=s&&d.get(s.name),l=c&&X_(s,c.module);if(l)throw p([l],!1,void 0,C);if(s)throw Y_(s);return a.forEach(e=>e()),{linked:o,closure:n}},ue=(e,n)=>{let i=d.get(e);if(i)return S(e,x.get(e)??[]),i;let a=le(ce(e,n));return(Nm(l.version).has(e)?Eg(e,t.print,l,t.files,s):void 0)?.operators.forEach(e=>{let t=a.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(s.set(t.key,e),r.delete(t.key))}),d.set(e,a.linked),x.set(e,a.closure),S(e,a.closure),a.linked},de=(e,t,n,s,c)=>{let l=c?void 0:E(e.module);if(l)return fe(e,l);let u=c??ue(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=q_(u),f=`#${ne.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Uo(Hg(e,t),d,t,n);ie.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=xs({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Jo(t,p)])),variables:new Set(u.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,c,l)=>{let u=re(`${c}@${t.name}`),f=l(u);return r.set(u,f),d.length>0&&o.add(f),e.name!==void 0&&se.set(u,`${e.name}!${se.get(n)??c}`),i.set(u,!s),a.set(u,{source:n,prefix:e.params.length}),u},createName:re});return pe(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&w.set(r,n),r})},fe=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),pe=(e,t,n,r)=>{let a=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!a.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:i.get(n.key)===!0?e.location.range:n.range}];let a=`${e.name}!${t}`;return[a,{key:r(n.key,a),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},me=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Da})),he=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:me(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),O=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ge=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=O(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:me(r,n),location:n}}},_e=(e,t,n,a)=>{let o=e.location,s=a?void 0:E(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=O(n.arity);return he(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??ue(e.module,n),l=`#${ne.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=q_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};ie.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>tv(f(e),p),h=d.map(t=>{let n=ge(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=xs({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:me(e.params,o),location:o,resolution:Da}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Da}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:$_(a,i)),i},createName:re}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=O(n.arity),a=[...e.params,...i];return he(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ve=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),ye=/* @__PURE__ */ new Map,be=(e,a)=>{let o=zd(e,t.loadClass?.(e.name),e===n);ye.set(e.name,o.overrides);let s=o.module,c=ie.length,l=new Map([...lg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...a.symbols]),u=/* @__PURE__ */ new Map,d={location:Ro,errors:[],warnings:[]},p=[d],m=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);Q_(n.kind)===Q_(e.kind)?d.warnings.push({location:r,message:`Warning: the ${Z_(n.kind)} of '${t}' conflicts with \nits ${Z_(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${Z_(e.kind)} of '${t}' conflicts with \nits ${Z_(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,x=[],ee=[...s.constants],te=s.variables.map(e=>e.name),S=s.variables.map(e=>e.location);s.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:E(e);if(n){m(n);return}let r=t??ue(e,s.name);ee.push(...r.constants.filter(e=>ee.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{te.includes(e)||(te.push(e),S.push(r.variableLocations[t]))}),m(r.exported),r.facts.forEach(e=>v.add(e)),r.modules.forEach((e,t)=>y.set(t,e)),x.push(r)});let ne=new Map(l),re=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});re.forEach(e=>h.set(e.name,oe(e)));let se=e=>({key:D(e),arity:Pa(e),params:Fa(e),kind:zo(s,e)?`Theorem`:`Definition`,range:e.location.range}),T=ee.length===0&&te.length===0,D=e=>s===n?e.name:`${e.name}@${a.id}`,ce=/* @__PURE__ */ new Map,le=()=>new Map([...a.modules,...y]),me=e=>{let t=s.instances.find(t=>t.module===e.name);return t!==void 0&&Na(e.location,t.location)},he=e=>{let t=s.modules.find(t=>t.name===e.module);return t?me(t)?y.get(t.name):void 0:le().get(e.module)},O=e=>({imported:l,getInstance:e=>{let t=he(e),n=t?void 0:E(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:s.name};let r=t??ue(e.module,s.name),i=q_(r);return{declarations:i,symbols:pe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:D,instanced:ce,facts:v,reports:p,warnings:a.warnings}),ge=e=>[...re.filter(t=>Na(t.location,e)).map(e=>[e.name,oe(e)]),...s.definitions.filter(t=>Na(t.location,e)).map(e=>[e.name,se(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),xe=e=>{let t=le(),n=t.get(e.name),r=n&&X_(e,n.module);if(n&&!r)throw Y_(e);a.nested.push(e);let i={location:e.location,errors:[],warnings:[]};p.push(i);let o=be(e,{id:`${a.id}/${e.name}`,symbols:ge(e.location),modules:t,nested:a.nested,errors:i.errors,warnings:i.warnings,levelChecks:a.levelChecks});r&&i.errors.push(r),n||y.set(e.name,o),f.has(e.name)||f.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=de(e,s,O(s),T,le().get(e.module));ce.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>xe(e)}))].sort((e,t)=>Na(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=Ug(Ts(s,(e,t)=>_e(e,t,s.name,he(e))),ve(l));a.errors.push(...Go(Se,O(Se))),Se.definitions.forEach(e=>{let t=D(e);r.set(t,e),i.set(t,!T);let n=se(e),a=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||a!==void 0&&!Na(a,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ce={module:Se,constants:ee,variables:te,variableLocations:S,visible:l,exported:h,modules:y,extended:x,facts:/* @__PURE__ */ new Set([...v,...[...Se.theorems,...Se.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,Ce);let we=ie.splice(c).map(e=>({location:e.location,check:()=>ae(e)}));return a.levelChecks.push(()=>b_(Se,{constants:new Set(ee.map(e=>e.name)),variables:new Set(te),getDefinition:e=>r.get(l.get(e)?.key??e),getQualifiedName:e=>w.get(l.get(e)?.key??e)},we,C)),b.push(Ce),Ce},xe=le(n).linked;C.length>0&&!t.isSanyReported&&t.print(h(C));let Se=e=>xe.visible.get(e)?.key??e;xe.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(xe,/* @__PURE__ */ new Set);let k=xe.constants.map(e=>e.name),Te=xe.variables,A=e=>e.module===void 0?[e.name,Se(e.name)]:e.module===n.name||k.includes(e.name)?[]:[(d.get(e.module)??f.get(e.module))?.visible.get(e.name)?.key??e.name],Ee=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:xe.constants.find(t=>t.name===e)?.arity??0},De=/* @__PURE__ */ new Map,Oe=/* @__PURE__ */ new Set,ke=(e,t)=>{s.set(e,t),r.delete(e),De.delete(e),Oe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=K_(e.value);Pn(t),A(e).forEach(e=>{let n=Ee(e);n===0?De.set(e,t):ke(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ae=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ae.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new v(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(K_),K_(e.value)]),Ae.set(t,n)}),Ae.forEach(e=>A(e).forEach(t=>ke(t,ev(e.name,Ee(t)||e.rows[0][0].length,e.rows))));let je=new Map(e.substitutions.flatMap(e=>A(e).map(t=>[t,Se(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!k.includes(n)&&!xe.visible.has(n))throw new v(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new v(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=Se(i),o=r.get(a);if(!(o!==void 0||s.has(a)||De.has(a)||k.includes(i)||Te.includes(i)))throw new v(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(o?.kind===`Operator`&&o.params.length!==(xe.constants.find(e=>e.name===n)?.arity??xe.visible.get(n)?.arity))throw new v(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let Me=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(A)),Ne=(e,t)=>{if(Me.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&Ne(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=Ne(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=he(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),xe.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let Pe=k.filter(e=>!De.has(e)&&!je.has(e)&&!Oe.has(e));if(Pe.length>0&&!t.isUnconfigured)throw new v(`The constant parameter ${H_(t.source,t.loadModule,`constant`).find(e=>Pe.includes(e))??Pe[0]} is not assigned a value by the configuration file.`);t.isTraceRecorded&&s.forEach((e,t)=>{let n=mg(e);n&&s.set(t,n)});let Fe={runtime:l,definitions:r,builtins:s,constants:De,substitutions:je,instanceNames:se,variables:Te,variableIndex:nv(Te,b.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:o,evaluators:/* @__PURE__ */ new WeakMap},Ie=v_({constants:new Set(De.keys()),variables:/* @__PURE__ */ new Set([...Te,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>s.has(e))]),getDefinition:e=>_l(e,Fe)}),Le=e=>{try{W(e,{environment:Fe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};je.forEach((e,t)=>{let n=r.get(e),i=k.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ie.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Le(n.body):void 0;if(i)throw new v(`The configuration file substitutes constant ${t} with non-constant ${e}${ba(i)?``:` - specifically: ${i.message}`}`)}),l.version!==`1.7.4`&&(l.isStarted=!0);let j=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),Re=U_(t.source,t.loadModule);return{environment:Fe,assumptions:Ce,variableLocations:xe.variableLocations,instanceActions:oe,startupDefinitions:b.filter(e=>!j.has(e.module.name)||q_(e).length===0).flatMap(e=>Re(e===xe?void 0:e.module.name).flatMap(t=>{let n=r.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:xe.constants,rootSymbols:xe.visible,javaOverrides:b.flatMap(e=>ye.get(e.module.name)??[])}},ov={kind:`Boolean`,value:!0},sv={kind:`Boolean`,value:!1},cv=e=>e?ov:sv,lv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,uv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,dv=(e,t)=>({kind:e,body:t}),fv=(e,t,n)=>({kind:e,operands:[t,n]}),pv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?pv(e,t.operands).operands:[t])}),mv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return mv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,mv(t)),0)}},hv=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return hv(e.body);case`And`:case`Or`:return e.operands.some(hv)}},gv=/* @__PURE__ */ new WeakMap,_v={count:0},vv=e=>{let t=gv.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${_v.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(vv).join(`,`)})`;default:return`${e.kind}(${vv(e.body)})`}})();return gv.set(e,n),n},yv=(e,t)=>e===t||vv(e)===vv(t),bv=(e,t)=>{let n=vv(t);return e.some(e=>e===t||vv(e)===n)},xv=e=>e===`And`?`Or`:`And`,Sv=(e,t)=>{switch(e.kind){case`Boolean`:return t?cv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?dv(`Not`,e):e;case`Not`:return Sv(e.body,!t);case`And`:case`Or`:return pv(t?xv(e.kind):e.kind,e.operands.map(e=>Sv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return dv(n,Sv(e.body,t))}}},Cv=e=>{switch(e.kind){case`Boolean`:return cv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return pv(xv(e.kind),e.operands.map(Cv));case`Always`:return dv(`Eventually`,Cv(e.body));case`Eventually`:return dv(`Always`,Cv(e.body));default:return dv(`Not`,e)}},wv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=wv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return cv(t)}return n.length===0?cv(!t):n.length===1?n[0]:pv(e.kind,n)}case`Not`:{let t=wv(e.body);return t.kind===`Boolean`?cv(!t.value):dv(`Not`,t)}case`Always`:case`Eventually`:{let t=wv(e.body);return dv(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Tv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Ev=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Ev(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new y(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>pv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Ev(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Tv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:pv(`Or`,t);n.push(dv(`Always`,dv(`Eventually`,e)))}return pv(`Or`,n)}case`Not`:return lv(e.body)?e:Ev(Cv(e.body));default:return e}},Dv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Dv(e.operands[0]):pv(e.kind,e.operands.map(Dv));case`Not`:return e.body.kind===`Not`?Dv(e.body.body):dv(`Not`,Dv(e.body));case`Always`:case`Eventually`:case`Next`:return dv(e.kind,Dv(e.body));default:return e}},Ov=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Ov(e.operands[0]);let t=Math.floor(e.operands.length/2);return fv(e.kind,Ov(pv(e.kind,e.operands.slice(0,t))),Ov(pv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return dv(e.kind,Ov(e.body));default:return e}},kv=(e,t)=>{e.kind===`Eventually`&&!bv(t,e)&&t.push(e),`body`in e&&kv(e.body,t),`operands`in e&&e.operands.forEach(e=>kv(e,t))},Av=e=>{let t=e.filter(uv),n=e.flatMap(e=>e.kind===`Not`&&uv(e.body)?[e.body]:[]);return!t.some(e=>bv(n,e))},jv=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,dv(`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},Mv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:dv(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Nv=(e,t,n)=>e.flatMap(e=>{let r=Mv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Pv=e=>[...new Set(e.map(vv))].sort().join(`|`),Fv=(e,t)=>{let n=new Set(t.map(Pv));return[...e.filter(e=>!n.has(Pv(e))),...t]},Iv=e=>{let t=jv(e),n=Nv(t,`Always`,`And`),r=Nv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Mv(t,`Eventually`,`Or`);if(n&&!(bv(e,n.first)||bv(e,n.second)))return Fv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(bv(e,t.first)||bv(e,t.second))&&!bv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Av(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Mv(t[e],`Always`,`And`);n&&(bv(t,n.first)||t.push(n.first),bv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)bv(t,e.first)&&bv(t,e.second)&&!bv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Av(t)?[]:i(t)};return a(e)},Lv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>mv(e)<=1)}),Rv=e=>{let t=Iv([e]).map(Lv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Pv(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of Iv(n)){let n=Pv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Lv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},zv=(e,t)=>!bv(e,t)||bv(e,t.body),Bv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&mv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Tv(e);if(n){let e=mv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(hv(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Vv=(e,t)=>{let n=e.findIndex(e=>yv(e,t));return n===-1?(e.push(t),e.length-1):n},Hv=e=>{let t=Ev(wv(Sv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Dv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Bv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:pv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:yv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Ov(e.formula),n=[];t&&kv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Vv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Vv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Vv(i,e))}));return{tableau:t&&Rv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Uv=()=>n(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.livenessEvaluationFailure),Wv=()=>n(new x,e.error),Gv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Kv=/* @__PURE__ */ new WeakMap,qv=/* @__PURE__ */ new WeakSet,Jv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Yv=(e,t)=>new y(`TLC cannot handle the temporal formula ${el(e)}${t===void 0?``:`:\n${t}`}`),Xv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ul(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Xv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Xv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=_l(e,n);if(t)return Zv(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?r.isStateLevel&&!r.isLevelConstant?1:0:void 0},o=(e,t)=>r.has(e)?0:B(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return es(e,(e,a)=>(i.value=Math.max(i.value,Xv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Gv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Zv=(e,t)=>{let n=Kv.get(e);if(n!==void 0)return n;Kv.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(Xv(e.body,void 0,t),...r.map(e=>Xv(e.set,void 0,t)));return Kv.set(e,i),i},Qv=(t,r)=>{try{return Al(t,r)}catch(t){if(!(t instanceof y))throw t;if(!ba(t))return;throw n(new y(`${o(`tlc2.tool.EvalException`)}${t.message}`),e.error)}},$v=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>$v(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,el(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,ey(e,t,n));if(e.kind===`Identifier`){let r=B(e)?ul(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:_l(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Zv(a,n)>0){if(i.has(a))throw Wv();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=Jv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Xv(e,t,n)===3)){let t=tu(e,c),r=B(e)?void 0:_l(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,pu(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>Xv(e.set,t,n)===0),u=l?Qv(e.bounds,c):void 0;if(l&&u){let n=[];if(jl(e.bounds,u,t,t=>(n.push(...s(e.body,t,el(e.body))),!1)),n.length===0)throw Uv();return n}return[{expression:e,scope:t,name:o}]},ey=(e,t,n)=>{let r=hu(e.definitions,Jv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&qv.add(e.binding);return r},ty=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),ny=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?Xv(e,t,n):i;if(a===0){let r=W(e,Jv(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${tl(e)}`);return cv(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},a={depth:0},o=(e,t,n,r)=>{if(a.depth>=100)throw Wv();a.depth++;let o=f(e,t);a.depth--;let s=mv(o);return s>2?o:i(n,r,s)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=Jv(n,t),s=B(e)||_l(i,n)===void 0?ul(t,i):void 0;if(s?.kind===`Thunk`&&qv.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:B(e)?nu(i,a):$l(i,n);if(l?.kind!==`Closure`)throw Yv(e);let u=e.kind===`Apply`?e.args:[],d=!B(e)&&_l(i,n)?.isRecursive===!0;return c(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(l.body,pu(l,u,a),e,t)),d)},c=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof x||n&&!r;throw!(t instanceof y)||i?t:Yv(e)}},l=(e,t)=>{let r=Xv(e,t,n);if(!e.bounds.every(e=>Xv(e.set,t,n)===0)){if(r<=2)return i(e,t,r);throw Yv(e)}let a=[],o=e.kind===`Forall`;try{Ml(e.bounds,Jv(n,t),t=>(a.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof y)||n instanceof x)throw n;if(r<=2)return i(e,t,r);throw Yv(e,o&&!ba(n)?n.message:void 0)}return a.length===0?cv(o):u(e,t,pv(o?`And`:`Or`,a))},u=(e,t,n)=>{let r=mv(n);return r>2?n:i(e,t,r)},d=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!B(e)||e.operator===`=>`),f=(e,t)=>{let a=Xv(e,t,n);if(a<=2&&!d(e))return i(e,t,a);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,ey(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?dv(`Always`,fv(`Or`,dv(`Not`,f(n[0],t)),dv(`Eventually`,f(n[1],t)))):e.operator===`~`&&!B(e)?u(e,t,dv(`Not`,f(n[0],t))):e.operator===`=>`?u(e,t,fv(`Or`,dv(`Not`,f(n[0],t)),f(n[1],t))):s(e,t)}case`And`:case`Or`:return u(e,t,pv(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(!r&&Xv(e.condition,t,n)===0){let r=W(e.condition,Jv(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return u(e,t,fv(`Or`,fv(`And`,i,f(e.consequent,t)),fv(`And`,dv(`Not`,i),f(e.alternative,t))))}case`Always`:case`Eventually`:return dv(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=ty(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=dv(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?dv(`Always`,dv(`Eventually`,fv(`Or`,i,a))):fv(`Or`,dv(`Eventually`,dv(`Always`,i)),dv(`Always`,dv(`Eventually`,a)))}default:throw Yv(e)}};return f(e,t)},ry=(e,t,n,r,i)=>{let a=e=>ry(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`?gl(W(e.expression,a),`a temporal property predicate`):Uc(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&gl(W(e.unchanged,a),`a subscript`)?!1:gl(W(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return ry(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`)}},iy=(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)=>iy(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 ry(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},ay=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return ay(e.body);case`And`:case`Or`:return e.operands.some(ay);default:return!1}},oy=e=>e.promises.some(e=>ay(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),sy=(e,t)=>e.every((e,n)=>an(e,t[n])),cy=e=>e.filter((t,n)=>n===0||e[n-1]!==t),ly=e=>({data:e(1024),length:0,create:e}),uy=(e,t,n)=>{let r=t+n.length;if(r>e.data.length){let t=e.create(Math.max(2*e.data.length,r));t.set(e.data),e.data=t}e.data.set(n,t),e.length=Math.max(e.length,r)},dy=e=>new Int32Array(e).fill(-1),fy=(e,t)=>(e.edgeStarts[t]??-1)!==-1,py=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},my=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,hy=(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),gy=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},_y=2**53-1,vy=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>ny(e.expression,e.scope,n)),a=e.map(e=>dv(`Not`,ny(e.expression,e.scope,n))),o=a.length===1?a[0]:pv(`Or`,a),s=i.length===0?o:pv(`And`,[...i,o]),c=Hv(s);if(c.length===0)throw Uv();let l=/* @__PURE__ */ new Map,u=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=vv(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:ly(e=>new Int32Array(e)),edgeActions:ly(e=>new Uint8Array(e)),stateResults:ly(e=>new Uint8Array(e)),initial:[],firstNodes:ly(dy),lastNodes:ly(dy),nextSiblings:[],isDone:[],errorNode:void 0})),d={multiplier:1},f=!Ou(n),p={environment:n},m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>ry(e,t,void 0,p.environment,f?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),b=(e,t,n,r)=>g(t,()=>{let t=e.solution.actionChecks;if(!f)return Uint8Array.from(t,e=>+!!ry(e,n,r,p.environment,/* @__PURE__ */ new Map));let i=h(n),a=m.actions.get(n)??/* @__PURE__ */ new Map;m.actions.set(n,a);let o=a.get(r)??new Int8Array(l.size).fill(-1);return a.set(r,o),Uint8Array.from(e.actionIds,(e,a)=>(o[e]===-1&&(o[e]=+!!ry(t[a],n,r,p.environment,i)),o[e]))}),x=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),ee=(e,t)=>{if(n.runtime.version===`1.7.4`)return!1;let r=e.nodes[t];return r.particle.length===0&&r.successors.length===1&&r.successors[0]===t},te=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),S=(e,t,n)=>e.solution.tableau?gy(e,t).find(t=>e.nodeTableaux[t]===n):t,ne=(e,t,n)=>{let r=hy(e,t,n),i=e.lastNodes.data[t]??-1;return i===-1?uy(e.firstNodes,t,[r]):e.nextSiblings[i]=r,uy(e.lastNodes,t,[r]),r},re=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;uy(e.edgeTargets,a,n),r.forEach((t,n)=>uy(e.edgeActions,(a+n)*o,t)),uy(e.stateResults,e.nodeStates[t]*i.length,i),e.edgeStarts[t]=a,e.edgeCounts[t]=n.length},ie=(e,t,n)=>{let i={slots:Array.from({length:16*d.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&sy(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*d.multiplier&&d.multiplier++,i.slots.filter(e=>e!==void 0)},C=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=[],u=s.successors.length>0?b(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!x(t,r,i,n))continue;if(ee(t,r)&&e.errorNode===void 0&&te(e)){e.errorNode=a;return}let o=S(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&C(e,t,n,i,s)}for(let a of r.getSuccessors(i,n)){let r=b(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!x(t,n,i,a.state)||a.index===-1)continue;let s=S(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&C(e,t,a.state,a.index,u)}}l.length>0&&re(e,a,l,c,o)},ae=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>x(t,r,a,e.state)));e.isDone[a]=!0;for(let s of gy(e,a)){let a=[],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=S(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&C(e,t,n.state,n.index,d)}}),re(e,s,a,c,i)}if(e.errorNode!==void 0)return cy(se(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)hy(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{fy(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),re(e,i,a,o,r)},se=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)fy(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 py(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}fy(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new y(`Couldn't re-create liveness trace (path) starting at: ${t}`)},w=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>fy(e,t)),c=[],l=t=>{let n=py(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&zv(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=_y;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=_y,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>my(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>py(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=cy(se(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+m.length+h.length},_={node:r},v=e=>o.has(e),b=e=>{l.push(_.node),_.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&my(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},o=g.count;if(py(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!v(r)||!a(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_.node,c,e)&&(m[t]=!0,g.count--)})}return g.count<o?(b(r),d.clear(),!0):(v(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){b(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=py(e,t).find(e=>v(e)&&!d.has(e))??-1}b(n.unvisited),d.add(n.unvisited)}}let x=p(r,_.node,s,a);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let ee=c[c.length-1];return x[x.length-1]===ee&&x.pop(),{prefix:c.slice(0,-1),cycle:[ee,...x.reverse()],isCycleConstrained:oy(n)}},p=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of py(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r.link,n.push(t,l,-42),c.push(l);let u={value:r.link++};py(e,l).forEach((t,r)=>{fy(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u.value=Math.min(u.value,o[t]):o[t]===-1&&s.push(t))}),n.push(u.value)}}};return{branches:u.length,addInitialState:(e,t,r)=>{p.environment=r??n,m.states.clear(),m.actions.clear();try{for(let n of u){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)x(r,i,void 0,t)&&n.initial.push(S(n,e,i)??ne(n,e,i))}}finally{p.environment=n}},addState:(e,t,r,i)=>{p.environment=i??n,m.states.clear(),m.actions.clear();try{let n=ie(e,t,r);for(let r of u){let i=n.map(n=>b(r,e,t,n.state)),a=v(r,e,t),o=r.solution.tableau,s=o?ae(r,o,n,i,a,e):oe(r,n,i,a,e);if(s)return s}return}finally{p.environment=n}},findViolation:()=>{for(let e of u)for(let t of e.solution.models){let n=w(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!iy(a[i].body,t,r,0,n)).map(e=>e.name))]}},yy=`UnnamedAction`,by={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},xy=e=>{let t=e.range??by;return er([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Sy=e=>{let t=[[`name`,e.name],[`location`,xy(e.location)]];return e.parameters.length===0?er(t):er([...t,[`context`,er(e.parameters)],[`parameters`,$n(e.parameters.map(e=>e[0]))]])},Cy=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),wy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Ty=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Ey=e=>e.kind===`Apply`?e.args:[],Dy=(e,t,n)=>{let r=Ty(e);if(r===void 0)return;if(B(e)){let e=ul(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=$l(r,n);return i?.kind===`Closure`?i:void 0},Oy=(e,t)=>{try{return W(e,wy(t,void 0)),!0}catch(e){if(e instanceof l)return!1;throw e}},ky=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&xl(e,t)&&Oy(e.body,t),Ay=(e,t)=>{let n=_l(e.name,t);return n?.body===e.body&&ky(n,t)},jy=(e,t)=>{if(e.kind!==`Identifier`||!B(e))return;let n=ul(t,e.name);return n?.kind===`Thunk`?n:void 0},My=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ul(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Ny=(e,t)=>{try{return e()}catch(e){if(e instanceof l)return t();throw e}},Py=(e,t,n,r,i)=>{let a=Ey(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>Xv(e,n,i)!==0)?o():Ny(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,wy(i,n))]),expression:t,scope:n}],o)},Fy=(e,t,n,r,i)=>{let a=()=>({name:n?.name??yy,location:e.location,parameters:My(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Fy(e.body,hu(e.definitions,wy(r,t)),n,r,i);case`Label`:return Fy(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Fy(e,t,n,r,i));case`Exists`:return Ny(()=>{let o=[];return Ml(e.bounds,wy(r,t),t=>(o.push(...Fy(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=B(e)?void 0:i.get(Ty(e)??``),s=Dy(e,t,r);if(o)return Py(o,e,t,s,r);if(!s)return[a()];let c=Ey(e),l=B(e)?s.name:r.instanceNames.get(Ty(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return Ay(s,r)||c.some(e=>Xv(e,t,r)!==0)?u():Ny(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,wy(r,t))},parent:e}),s.scope);return Fy(s.body,e,{...s,name:l},r,i)},u)},Iy=(e,t,n,r,i)=>{let a=(e,t)=>Iy(e,t,n,r,i);if(e.kind===`Let`){a(e.body,hu(e.definitions,wy(n,t)));return}let o=jy(e,t);if(o){a(o.expression,o.scope);return}let s=Dy(e,t,n);if(s&&Ay(s,n))return;if(s&&s.params.length===0){if(Xv(s.body,s.scope,n)===1){r.inits.push(Cy(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,pu(s,e.args,wy(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(Cy(yy,e));return}let c=Xv(e,t,n);c<=1?r.inits.push(Cy(yy,e)):c===3&&r.temporals.push(Cy(yy,e))},Ly=(e,t,n,r,i)=>{let a=(t,n)=>Ly(e,t,n,r,i);if(t.kind===`Let`){a(t.body,hu(t.definitions,wy(r,n)));return}let o=jy(t,n);if(o){a(o.expression,o.scope);return}let s=Dy(t,n,r);if(s&&Ay(s,r))return;if(s&&s.params.length===Ey(t).length){a(s.body,t.kind===`Apply`?pu(s,t.args,wy(r,n)):s.scope);return}if(t.kind===`Forall`&&Ny(()=>(Ml(t.bounds,wy(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(Cy(e,a)):Xv(a,n,r)<2?i.invariants.push(Cy(e,a)):i.impliedTemporals.push(Cy(e,t));return}let c=Xv(t,n,r);c<=1?i.impliedInits.push(Cy(e,t)):c===3&&i.impliedTemporals.push(Cy(e,t))},Ry=(e,t)=>{let n=_l(e,t);return n?.kind===`Operator`&&!ky(n,t)?n:void 0},zy=e=>er([[`name`,e.name],[`location`,xy(e.location)]]),By=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Ry(e.specification,t);a&&(Iy(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Fy(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:$l(e.init,t);o?.kind===`Closure`&&r.inits.push(Cy(e.init??``,o.body));let s=e.next===void 0?void 0:$l(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Fy(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Ry(e,t);n&&r.invariants.push(Cy(e,n.body))}),e.properties.forEach(e=>{let n=Ry(e,t);n&&Ly(e,n.body,void 0,t,r)}),r},Vy=(e,t,n)=>By(e,t,n).inits,Hy=(e,t,n)=>By(e,t,n).actions,Uy=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>z(e[1])).join(`,`)})`,Wy=(e,t)=>`${e.name===yy?`Action`:e.name}${t===`1.7.4`?``:Uy(e)} ${g(e.location.range??by)}`,Gy=e=>`${e.name}${Uy(e)}`,Ky=(e,t,n,r)=>{let i=By(e,t,r),a=e=>Ln(e.map(Sy)),o=e=>Ln(e.flatMap(e=>{let n=Ry(e,t);return n?[zy(n)]:[]}));return er([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,Ln(t.variables.map((e,t)=>er([[`name`,e],[`location`,xy(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},qy=`paired12`,Jy=(e,t=16)=>e<=t*.75?t:Jy(e,t*2),Yy=(e,t)=>{let n=Jy(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},Xy=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Zy=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Qy=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),$y=e=>Qy(e).replaceAll(`
1773
- `,`\\n`),eb=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},writeStuttering:r,close:()=>t?.(e.path,n.join(``))}},tb=(e,t,n)=>{let r=n===`1.7.4`,i=[`strict digraph DiskGraph {
1774
- `,r?``:`node [shape=box,style=rounded]
1775
- `,e.colorize?`edge [colorscheme="${qy}"]\n`:``,`nodesep=0.35;
1776
- `,`subgraph cluster_graph {
1777
- `,`color="white";
1778
- `],a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=e=>{let t=a.get(e.level)??/* @__PURE__ */ new Set;a.set(e.level,t.add(e.fingerprint))},c=e=>{if(!e)return 1;let t=o.get(e.name)??o.size+2;return o.set(e.name,t),t},l=()=>[`subgraph cluster_legend {graph[style=bold];label = "Next State Actions" style="solid"
1779
- `,`node [ labeljust="l",colorscheme="${qy}",style=filled,shape=record ]\n`,...Yy([...o.keys()],Zy).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${o.get(e)}]\n`),`}`].join(``),u=()=>[...Yy([...a],e=>e[0]).map(e=>`{rank = same; ${Yy([...e[1]],Xy).map(e=>`${e};`).join(``)}}\n`),`}
1780
- `,e.colorize&&o.size>1?l():``,`}`].join(``),d=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),i.join(``)+u())};return{writeInitialState:e=>{i.push(`${e.fingerprint} [label="${$y(e.getLabel())}",style = filled]\n`),s(e),d()},writeSuccessor:(t,n,a,o)=>{let l=e.colorize?String(c(o)):`black`,u=e.actionLabels&&o?Qy(r?o.name:o.signature):``;if(i.push(`${t.fingerprint} -> ${n.fingerprint} [label="${u}",color="${l}",fontcolor="${l}"];\n`),!a){let e=r?``:`,tooltip="${$y(n.getText())}"`;i.push(`${n.fingerprint} [label="${$y(n.getLabel())}"${e}];\n`)}s(t),d()},writeStuttering:e=>{i.push(`${e.fingerprint} -> ${e.fingerprint} [style="dashed"];\n`),s(e),d()},close:()=>t?.(e.path,i.join(``)+u())}},nb=(e,t,n)=>e.dot?tb(e,t,n):eb(e,t),rb=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),ib=(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},ab=t=>n(new y(`${s}${t}`),e.error),ob=e=>{let t=Ar(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!F(e)||!F(i))throw ab(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},sb=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(sb);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},cb=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,lb=(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 ab(`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(!N(a)||!I(a))throw ab(`The symmetry operator must specify a set of functions.`);let o=L(a).elements;if(!o.every(P))throw ab(`The symmetry values must be function records.`);let s=o.map(ob),c=r.body.kind===`Apply`?r.body.args:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=sb(cb(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(ua.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;s.forEach(e=>{e.size>0&&d.set(rb(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=ib(n,e),r=rb(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!cb(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=>F(e)&&m.has(e.name))})),d.size===0)return;let g=Math.max(256,Math.floor(4194304/d.size));return{permutations:[...d.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:g})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:g}},ub=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=pb(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(pb(e[r],t));return a}},db=(e,t)=>{let n=[],r=[];for(let i of e){let e=pb(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(zt);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(zt(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},fb=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,pb=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=fb(e);if(n===0||n>64)return mb(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=mb(e,t),a=i!==e&&an(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},mb=(e,t)=>{let n=e.kind;if(n===`Set`){let n=db(e.elements,t);return n?Ht(n):e}if(n===`Function`||n===`LazyFunction`&&I(e.domain)){let n=Ar(e),r=ub(n.domain,t),i=ub(n.range,t)??n.range;if(r){let e=Un(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Ut(n.domain,e.range):e}return i===n.range?n:Ut(n.domain,i)}if(n===`Interval`||!N(e)||!I(e))return e;let r=L(e),i=ub(r.elements,t);return i?Ln(i):r},hb=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},gb=(e,t,n)=>e.images[t]??=pb(e.images[0],n.permutations[t-1]),_b=(e,t,n,r)=>{let i=hb(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=zt(gb(i,t,r),gb(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},vb=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?_b(i,t,n,r):0;if(o!==0)return o<0}return!1},yb=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>vb(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?gb(hb(e,t),r,t):e)},bb=(e,t)=>e*((t-e)/2**64),xb=e=>e.includes(`.`)?e:`${e}.0`,Sb=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return xb(String(e));let[n,r]=e.toExponential().split(`e`);return`${xb(n)}E${r.replace(`+`,``)}`},Cb=e=>e!==void 0&&e>=`0`&&e<=`9`,wb=e=>{if(e===0)return`0.0`;let t=Sb(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Cb(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;Cb(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Cb(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Cb(t[n.next])&&Number(t[n.next])>=5&&(n.result=Tb(n.result));Cb(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Tb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Tb(r)}.`:n===`9`?`${Tb(r)}0`:`${r}${Number(n)+1}`},Eb=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},Db=(e,t,n)=>{if(bb(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},Ob=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},kb=(e,t)=>({...e,traceOutput:[...e.traceOutput??[],...t]}),Ab={line:0,column:0},jb=`Failed to recover the initial state from its fingerprint.`,Mb=`Failed to recover the next state from its fingerprint.`,Nb=e=>({kind:`Identifier`,name:e,location:Ab}),Pb=/* @__PURE__ */ new Set([`name`,`property`]),Fb=(e,t,n)=>{let r=_l(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(Pb.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},Ib=(e,t,n)=>{if(xl(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return W(Nb(e),ax(n,void 0,void 0))}catch(e){if(e instanceof y||c(e))return;throw e}},Lb=(e,t,n)=>{let r=Fb(e,t,n);if(Ib(t,r,n)!==void 0)throw new v(`The ${e} ${t} cannot be a constant.`);return r},Rb=(e,t,n)=>{let r=n.constants.has(t)?void 0:Fb(e,t,n),i=r?Ib(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new v(`The ${e} of ${t} is equal to ${z(i)}`);return i===void 0?r:void 0},zb=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Bb=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Yl(e.startupDefinitions,r),t.invariants.forEach(e=>{Rb(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Vb=(t,r)=>{let i=v_({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>_l(e,r)});return t.flatMap(t=>{let a=Rb(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
1765
+ `]]),Vm=(e=`master`)=>e===`1.7.4`?Bm:zm,Hm=(e,t,n)=>new p(`Applying ${e} to the following value,\nwhich is not ${t}:\n${L(n)}`),Um=e=>j(e)?I(e):void 0,Wm=(e,t,n)=>{let r=R(e,t,n),i=Um(r);if(!i)throw Hm(n,`a function with a finite domain`,r);return i},Gm=(e,t,n)=>{let r=R(e,t,n),i=Um(r);if(!i)throw ui(t===0?`first`:`second`,n,`bag`,r);return i},Km=(e,t)=>{if(!A(e)||!N(e))throw t();return P(e).elements},qm=e=>e.range.every(e=>typeof e==`number`&&e>0),Jm=(e,t)=>{let n=e.domain.findIndex(e=>Ut(e,t));return n===-1?void 0:e.range[n]},Ym=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Xm=Ym(`BagDiff`,`tlc2.value.impl.Value`,2),Zm=Ym(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Qm=Ym(`BagUnion`,`tlc2.value.impl.Value`,1),$m=Ym(`BagOfAll`,`tlc2.value.impl.Value`,2),eh=Ym(`BagCup`,`tlc2.value.impl.Value`,2),th=Ym(`BagCardinality`,`tlc2.value.impl.IntValue`,1),nh=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Ai(e)}`;throw Mi(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},rh=(e,t,n)=>{let r=nh(e,n)+nh(t,n);if(wi(r))throw Ti(`${e}+${t}`);return r},ih=(e,t,n,r)=>{let i=Jm(n,e.domain[t]),a=nh(e.range[t],r);return i===void 0?a:a-nh(i,r)|0},ah=(e,t)=>jn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Ut(e[0],r));a?a[1]=rh(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),oh=jt([],[]),sh=e=>[bi(`EmptyBag`,oh),z(`IsABag`,1,e=>{let t=Um(R(e,0,`IsABag`));return t!==void 0&&qm(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return Wm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Hm(`BagCardinality`,`a bag`,t);return rh(e,n,th)},0)}),z(`BagIn`,2,e=>{let t=R(e,1,`BagIn`),n=Jm(Wm(e,1,`BagIn`),R(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw ui(`second`,`BagIn`,`bag`,t);return n>0}),z(`CopiesIn`,2,e=>{let t=R(e,1,`CopiesIn`),n=Jm(Wm(e,1,`CopiesIn`),R(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw ui(`second`,`CopiesIn`,`bag`,t);return n}),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Gm(e,t,`(+)`);if(!qm(n))throw ui(t===0?`first`:`second`,`(+)`,`bag`,R(e,t,`(+)`));return n});return ah(t,eh)}),z(`\\ominus`,2,e=>{let t=Gm(e,0,`(-)`),n=Gm(e,1,`(-)`);return jn(t.domain.flatMap((e,r)=>{let i=ih(t,r,n,Xm);return i>0?[[e,i]]:[]}))}),z(`BagUnion`,1,e=>{let t=R(e,0,`BagUnion`),n=Km(t,()=>Hm(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??oh;let r=n.map(e=>{let n=Um(e);if(!n)throw new p(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(t)}`);return n});return ah(r,Qm)}),z(`\\sqsubseteq`,2,e=>{let t=Wm(e,0,`\\sqsubseteq`),n=Wm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>ih(t,r,n,Zm)<=0)}),xi(`BagOfAll`,2,e=>{let t=yi(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new p(`The first argument of BagOfAll should be an operator, but instead it is:\n${L(t.literalBody)}`);let n=R(e,1,`BagOfAll`),r=Um(n);if(!r)throw ui(`second`,`BagOfAll`,`function with a finite domain`,n);return ah(r.domain.map((e,n)=>jt([t.call([e])],[r.range[n]])),$m)}),z(`SubBag`,1,t=>{let n=R(t,0,`SubBag`);if(!j(n))throw new h(`DOMAIN expects a function but received ${L(n)}`);let r=I(n),i=Tn(r.range).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new h(`Attempted to apply a function to ${L(r)}, which is not in its domain`);return Tn(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>jt(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>Ar(Wm(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=Km(t,()=>Hm(`BagToSet`,`a function with a finite domain`,t));return jt([...n],n.map(()=>1))})],ch=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,lh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,uh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,dh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,fh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,ph=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,mh=e=>{if(!j(e))return!1;let t=I(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},hh=(e,t)=>Mi(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Ai(t)}`),gh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),_h=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw hh(t,e);return`[${P(e).elements.map(e=>yh(e,t)).join(`,`)}]`},vh=(e,t)=>{let n=I(e),r=pr(n);return r?`[${r.map(e=>yh(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${gh(typeof e==`string`?e:L(e))}:${yh(n.range[r],t)}`).join(`,`)}}`},yh=(e,t)=>typeof e==`string`?gh(e):typeof e==`object`?e.kind===`ModelValue`?gh(e.name):A(e)?_h(e,t):vh(e,t):String(e),bh=e=>{if(A(e))return _h(e,ch);if(!j(e)||mh(e))throw hh(ch,e);return vh(e,ch)},xh=e=>{if(!j(e))throw hh(lh,e);return vh(e,lh)},Sh=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},Ch=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return vt(e);if(Array.isArray(e))return Vn(e.map(e=>Ch(e,t)));if(typeof e==`object`&&e)return Hn(Object.entries(e).map(([e,n])=>[vt(e),Ch(n,t)]));throw Mi(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},wh=(e,t)=>{if(e.trim()===``)return Ch(null,t);try{return Ch(JSON.parse(e,(e,t,n)=>typeof t==`number`?Sh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Mi(t,e.message):e}},Th=(e,t)=>{if(typeof e!=`string`)throw Mi(t,`Cannot cast tlc2.value.impl.${Ai(e)} to tlc2.value.impl.StringValue`);return e},Eh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Mi(n,`${t} (No such file or directory)`);return r},Dh=e=>[Si(`ToJson`,1,e=>vt(yh(R(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Si(`ToJsonArray`,1,e=>vt(bh(R(e,0,`ToJsonArray`)))),Si(`ToJsonObject`,1,e=>vt(xh(R(e,0,`ToJsonObject`)))),Si(`JsonSerialize`,2,t=>{let n=Th(R(t,0,`JsonSerialize`),uh),r=R(t,1,`JsonSerialize`);if(!pr(r)&&!mh(r))throw ui(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,yh(r,uh)),!0}),Si(`ndJsonSerialize`,2,t=>{let n=Th(R(t,0,`ndJsonSerialize`),dh),r=R(t,1,`ndJsonSerialize`),i=pr(r);if(!i)throw ui(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${yh(e,dh)}\n`).join(``)),!0}),Si(`JsonDeserialize`,1,t=>{let n=Th(R(t,0,`JsonDeserialize`),fh);return wh(Eh(e,n,fh),fh)}),Si(`ndJsonDeserialize`,1,t=>{let n=Th(R(t,0,`ndJsonDeserialize`),ph);return Vn(Eh(e,n,ph).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>wh(e,ph)))})],Oh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,kh=1e6,Ah=(e,t,n)=>{if(typeof e!=`number`||e<0)throw ui(t,n,`nonnegative integer`,e);return e},jh=(e,t,n,r)=>Tn(Array.from({length:t},()=>Tn(e.filter(()=>r.nextDouble()<n)))),Mh=(e,t)=>{let n=`RandomSetOfSubsets`,r=Ah(R(e,0,n),`first`,n),i=Ah(R(e,1,n),`second`,n),a=R(e,2,n);if(!A(a)||!N(a))throw ui(`third`,n,`finite set`,a);let o=P(a).elements;if(o.length<31&&r>2**o.length)throw ui(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw ui(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return jh(o,r,o.length===0?0:i/o.length,t.getRandom())},Nh=e=>[Si(`RandomSubset`,2,t=>{let n=R(t,0,`RandomSubset`);if(typeof n!=`number`)throw ui(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw Mi(Oh,String(n));let r=R(t,1,`RandomSubset`);if(!A(r)||!F(r)&&!N(r))throw ui(`second`,`RandomSubset`,`a finite set`,r);let i=jm(r,e.version);if(i&&i.reduce((e,t)=>e*P(t).elements.length,1)>kh)throw Mi(Oh,`Attempted to construct a set with too many elements (>${kh}).`);return Tn(Mm(n,r,e.getRandom(),e.version))}),Si(`RandomSetOfSubsets`,3,t=>Mh(t,e)),Si(`TestRandomSetOfSubsets`,3,t=>Vn(Array.from({length:5},()=>P(Mh(t,e)).elements.length)))],Ph=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Fh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Ph})`,Ih=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Ph}) throws java.io.IOException`,Lh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Ph})`,Rh=e=>Hn([[`name`,e??`UnnamedAction`],[`location`,Hn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),zh=(e,t,n)=>{let r=e.map((e,t)=>Vn([t+1,Hn(Object.entries(e))])),i=r.slice(1).map((e,n)=>Vn([r[n],t[n],e])),a=n?[Vn([r[r.length-1],n.action,r[n.start]])]:[];return Hn([[`action`,Tn([...i,...a])],[`state`,Tn(r)]])},Bh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Lm(e).get(t)},Vh=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),L(r));else throw new p(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(n)}`)},Hh=e=>e.every(e=>e!==void 0),Uh=(e,t)=>Hn(t.variables.map((t,n)=>[t,e[n]])),Wh=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!O(e)){if(t.variableIndex.has(r))return!0;let e=Tl(r,t);if(e&&!n.has(e)&&(n.add(e),Wh(e.body,t,n)))return!0}return Ue(e).some(e=>Wh(e,t,n))},Gh=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[z(`AssertEq`,2,t=>{let n=R(t,0,`AssertEq`),r=R(t,1,`AssertEq`),i=Ut(n,r);return i||(e(L(`Assertion failed`,!0)),e(L(n,!0)),e(L(r,!0))),i}),zi(`AssertError`,2,e=>{let n=yi(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Mi(Fh,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=Bi(e,0,`AssertError`)();try{Bi(e,1,`AssertError`)()}catch(e){if(e instanceof h)return pa(e.message,t.isTool)===r;throw e}return!1}),Si(`TLCGetOrDefault`,2,e=>{let n=R(e,0,`TLCGetOrDefault`);return Bh(t,n)??R(e,1,`TLCGetOrDefault`)}),{...xi(`TLCGetAndSet`,4,n=>{let r=R(n,0,`TLCGetAndSet`),i=Bh(t,r)??R(n,3,`TLCGetAndSet`),a=yi(n,1,`TLCGetAndSet`);return Vh(t,e,r,a.call([i,R(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Si(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!Hh(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Mi(Ih,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Vn(t.getBehavior(r).map(e=>Uh(e,n.environment)))}),Si(`CounterExample`,0,()=>t.counterExample??Hn([[`action`,Tn([])],[`state`,Tn([])]])),z(`ToTrace`,1,e=>{let t=R(e,0,`ToTrace`);if(!j(t)||!Ut(Ar(t),Tn([`action`,`state`])))throw new h(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(t)}`);let n=P(Or(t,`state`)).elements.map(e=>pr(e)??[]);return Vn(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let t=R(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new p(`The argument of ModelValue should be a string, but instead it is:\n${L(t)}`);return kt(t)}),zi(`TLCDefer`,1,()=>!0),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),zi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!Hh(r))throw Mi(Lh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||wl(Bi(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new g(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),zi(`TLCCache`,2,(e,t)=>{let r=yi(e,0,`TLCCache`),a=Qr(Bi(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Wh(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),z(`TLCFP`,1,e=>Number(BigInt.asIntN(32,dm([R(e,0,`TLCFP`)])))),Si(`TLCEvalDefinition`,1,(e,t)=>{let n=R(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?Tl(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new p(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${L(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new p(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return H({kind:`Identifier`,name:n,location:r.location},t)})]},Kh=(e,t)=>[Si(`_Track`,2,e=>{let n=String(R(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,R(e,0,`_Track`)===!0?r+1:r),!0}),Si(`_Counts`,0,()=>Im(t)),Si(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(Im(t),!0)),!1)}),Si(`_PrintCounts`,0,()=>(e(L(Im(t),!0)),!0))],qh=e=>String(e).padStart(2,`0`),Jh=e=>`${e.getUTCFullYear()}.${qh(e.getUTCMonth()+1)}.${qh(e.getUTCDate())}.${qh(e.getUTCHours())}${qh(e.getUTCMinutes())}${qh(e.getUTCSeconds())}`,Yh=e=>jn([...e].map(([e,t])=>[e,Vn([t])])),Xh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Zh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Qh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),$h=(e,t,n)=>{if(e.version===`1.7.4`?!Zh.has(t)||!e.isStarted&&Qh.has(t):!e.isStarted&&Xh.has(t))throw new p(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return Hn([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Hn([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Hn([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,vt(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,vt(Jh(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Rh(void 0);case`all`:return Yh(e.registers);case`all:named`:return Yh(Lm(e))}if(t.startsWith(`s:`)){let n=Lm(e).get(t);if(n===void 0)throw new p(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return vt(e.properties.get(t.slice(2))??t);throw new p(`TLCGet(${t}) was undefined.`)},eg=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new p(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new p(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(t)}`);return $h(e,t,n?.state)},tg=e=>e.length===0?[[]]:e.flatMap((t,n)=>tg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),ng=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&P(e).elements.forEach(ng),e.kind===`Function`&&e.range.forEach(ng))},rg=(e,t)=>[z(`Print`,2,t=>(e(`${k(L(R(t,0,`Print`),!0,!0))} ${k(L(R(t,1,`Print`),!0,!0))}`),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(k(L(R(t,0,`PrintT`),!0,!0))),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new p(`The first argument of Assert evaluated to FALSE; the second argument was:\n${k(L(R(e,1,`Assert`)))}`,m.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>jn([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=vi(e,0,`@@`),n=vi(e,1,`@@`);return Mn([...at(t),...at(n)])}),z(`ToString`,1,e=>vt(L(R(e,0,`ToString`),!0))),z(`TLCEval`,1,e=>{let t=R(e,0,`TLCEval`);return ng(t),t}),z(`Permutations`,1,e=>{let t=gi(e,0,`Permutations`);return Tn(tg(t).map(e=>jn(t.map((t,n)=>[t,e[n]]))))}),xi(`SortSeq`,2,e=>{let t=yi(e,1,`SortSeq`);return Vn(_i(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),t.version===`1.7.4`?Ni({...Si(`TLCGet`,1,(e,n)=>eg(t,R(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Ni(zi(`TLCGet`,1,(e,n)=>eg(t,Bi(e,0,`TLCGet`)(),n)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Si(`TLCSet`,2,n=>{let r=R(n,0,`TLCSet`);return Vh(t,e,r,R(n,1,`TLCSet`)),!0}),bi(`Any`,Tt),z(`RandomElement`,1,e=>Pm(hi(e,0,`RandomElement`),t.getRandom()))],ig=(e,t)=>e.every(e=>_r(e,t)),ag=Tn([!1,!0]),og=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return An(og(e,t,r),og(e,r,n))},sg=[`\\cup`,`\\cap`,`\\`],cg=e=>typeof e==`object`&&e.kind===`MixedSet`,lg=(e,t,n)=>{let r=t.kind===`Interval`?P(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return En(r.filter(e=>_r(e,n)===t))}if(r.length===0)return n;if(!$e(n))return zt({kind:`SetOperation`,operator:e,left:t,right:n});let i=P(n).elements.filter(e=>!_r(e,t));return En([...r,...i])},ug=[bi(`TRUE`,!0),bi(`FALSE`,!1),bi(`BOOLEAN`,ag),bi(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Ci(`=`,Cn),Ci(`#`,(e,t)=>!Cn(e,t)),z(`~`,1,e=>!pi(e,0,`~`)),z(`<=>`,2,e=>pi(e,0,`<=>`)===pi(e,1,`<=>`)),z(`/\\`,2,e=>pi(e,0,`/\\`)&&pi(e,1,`/\\`)),z(`\\/`,2,e=>pi(e,0,`\\/`)||pi(e,1,`\\/`)),z(`=>`,2,e=>!pi(e,0,`=>`)||pi(e,1,`=>`)),z(`\\in`,2,e=>_r(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!_r(R(e,0,`\\notin`),R(e,1,`\\notin`))),z(`\\subseteq`,2,e=>{let t=mi(e,0,`\\subseteq`),n=R(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&N(t.base)?ig(P(t.base).elements,n.base):ig(P(t).elements,n)}),...sg.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e);if($e(n)&&$e(r)&&!cg(n)&&!cg(r)){if(e===`\\cup`&&F(n))return r;let t=e===`\\cup`?An:e===`\\cap`?kn:On;return gr((e,n)=>t(P(e),P(n)),(t,n)=>lg(e,t,n),n,r)}return $e(n)?lg(e,n,r):e!==`\\`&&$e(r)?lg(e,r,n):zt({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=mi(e,0,`UNION`),n=et(t)?t.elements.filter(et):[];if(!et(t)||n.length!==t.elements.length)return zt({kind:`Union`,base:t});if(cg(t)||n.some(cg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{_r(t,e)||e.elements.push(t)})),En(e.elements)}return n.length===0?Dn:og(n.map(P),0,n.length)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!j(t))throw new h(`DOMAIN expects a function but received ${L(t)}`);return Ar(t)})],dg=Fi(`Integers`,`Neg`,`IntValue`,1),fg=e=>{let t=Fi(e,`DotDot`,`IntervalValue`,2);return[Ii(e,`+`,`Plus`,(e,t)=>e+t),Ii(e,`-`,`Minus`,(e,t)=>e-t),Ii(e,`*`,`Times`,(e,t)=>e*t),Ii(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new p(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new p(`0^0 is undefined.`);return e**t}),Ii(e,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new p(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/n)|0;return e<0&&Math.imul(e,n)!==t?e-1:e}let r=Math.floor(t/n);if(wi(r))throw Ti(`${t} \\div ${n}`);return r}),Ii(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new p(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),z(`..`,2,e=>({kind:`Interval`,low:Pi(R(e,0,`..`),t),high:Pi(R(e,1,`..`),t)}))]},pg=fg(`Naturals`),mg=fg(`Integers`),hg=e=>{let t=pg.indexOf(e);return t===-1?void 0:mg[t]},gg=[bi(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...pg,Ri(`<`,(e,t)=>e<t),Ri(`>`,(e,t)=>e>t),Ri(`<=`,(e,t)=>e<=t),Ri(`>=`,(e,t)=>e>=t,`>`)],_g=[bi(`Int`,{kind:`InfiniteSet`,name:`Int`}),...mg,Ri(`>=`,(e,t)=>e>=t),z(`-.`,1,e=>{let t=Pi(R(e,0,`-`),dg);if(wi(-t))throw Ti(`-${t}`);return-t})],vg=(e,t,n)=>{let r=R(e,t,n),i=pr(r);if(!i)throw new p(`${n}\n${L(r)}`);return i},yg=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:vg(e,t,n)},bg=(e,t,n)=>typeof e==`string`?vt(e.slice(t,n)):Vn(e.slice(t,n)),xg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Sg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Cg=(e,t)=>{let n=tf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Ni(e,t):e}):t},wg=e=>Cg(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>yg(e,0,xg(``,`Len`)).length),z(`\\o`,2,e=>{let t=yg(e,0,Sg(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=vg(e,1,Sg(`t \\o s`,`sequence`));return Vn([...t,...n])}let n=R(e,1,`\\o`);if(typeof n!=`string`)throw new p(`${Sg(`t \\o s`,`string`)}\n${L(n)}`);return vt(t+n)}),z(`Append`,2,t=>Vn([...vg(t,0,Sg(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let t=vg(e,0,xg(``,`Head`));if(t.length===0)throw new p(`Attempted to apply Head to the empty sequence.`);return t[0]}),z(`Tail`,1,e=>{let t=yg(e,0,xg(``,`Tail`));if(t.length===0)throw new p(`Attempted to apply Tail to the empty sequence.`);return bg(t,1)}),z(`SubSeq`,3,e=>{let t=yg(e,0,xg(`first `,`SubSeq`)),n=fi(e,1,`SubSeq`),r=fi(e,2,`SubSeq`);if(n>r)return bg(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new p(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return bg(t,n-1,r)}),xi(`SelectSeq`,2,e=>{let t=yi(e,1,`SelectSeq`);return Vn(vg(e,0,xg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw ui(`second`,`SelectSeq`,`operator`,n);return n}))})]),Tg=e=>Cg(`FiniteSets`,[z(`IsFiniteSet`,1,e=>{let t=R(e,0,`IsFiniteSet`);if(A(t))return dr(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new h(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${L(t)}\nis a finite set.`:`Attempted to check if the ${tt(t)} ${L(t)} is a finite set.`)}),z(`Cardinality`,1,t=>{let n=R(t,0,`Cardinality`);if(!A(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new p(`Attempted to compute cardinality of the value\n${L(n)}`);return lr(n,e)})]),Eg=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Dg=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:gg};case`Integers`:return{extends:[`Naturals`],operators:_g};case`Sequences`:return{extends:[],operators:wg(n.version)};case`FiniteSets`:return{extends:[],operators:Tg(n.version)};case`TLC`:return{extends:[],operators:Cg(`TLC`,rg(t,n))};case`Randomization`:return{extends:[],operators:Nh(n)};case`_Possible`:return{extends:[],operators:Kh(t,n)};case`Json`:return{extends:[],operators:Dh(r)};case`Bags`:return{extends:[],operators:sh(i)};case`TLCExt`:return{extends:[],operators:Gh(t,n)};default:return}},Og=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),kg={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},Ag=(e,t)=>{let n=kg[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},jg=`$subexpression`,Mg=(e,n)=>new t(`${e} at line ${n.line}, column ${n.column}`),Ng=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Ng(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Ue(e)){let e=Ng(r,t,n);if(e)return e}},Pg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Fg=(e,t)=>{let n=e.location,r=Pg(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw Mg(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw Mg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:jg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:jg,args:e.args,location:n,resolution:ja},location:n}},Ig=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:ja})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ja}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ja};return Fg({...t,params:[...t.params,...r]},a)},Lg=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw Mg(r,i);Na.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:f(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw Mg(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>ts(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw Mg(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=Ra(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw Mg(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&Ng(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw Mg(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||ao(t.operand,1)!==0)throw Mg(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=lo(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[ao(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw Mg(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=ao(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw Mg(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw Mg(`Unexpected subexpression selector`,i);let s=r?r.sets:uo(n),c=s?.[ao(t.operand,s.length)];if(!c)throw Mg(`Nonexistent operand specified by the selector`,i);o.current=c},p=l(void 0);if(o.isFailed)return n;if(p)return Ig(p.definition,{...a,args:p.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw Mg(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return Ig(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw Mg(`Subexpression selection failed`,i);return Fg(a,o.current)},Rg=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return oo(e,t,n)},zg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Ue(e).some(zg),Bg=(e,t,n,r=!1)=>{if(!zg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=is(e,e=>Bg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Vg(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>Bg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:is(e,e=>Bg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Rg(a.name,[],void 0,t):a.kind===`Apply`?Rg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Lg(o,t,a,r);return c!==a&&Ma.add(c),c},Vg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Bg(e.expression,t,n,!0)}))}),Hg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Ug=(e,t)=>Vg(e,Hg(t.definitions),()=>!1),Wg=(e,t)=>{let n=Hg([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>Bg(e,n,i),o=e=>i(e)||!n(e),s=e=>Bg(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return Vg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Vg(e,n,o):rs(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>zg(e.body))||e.assumptions.some(e=>zg(e.expression))?{...p,definitions:e.definitions.map(e=>rs(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Gg=(e,t)=>`${e}${t}`,Kg=(e,t,n)=>`${e}${t}${n}`,qg=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Jg=(e,t,n)=>`${e},${t},${n}`,Yg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Xg=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Zg=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Qg=(e,t,n,r)=>({...Yg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),$g=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,e_=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,t_=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...Qg(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),n_=Qg(`$Set`,0,[2],[1]),r_=Qg(`$Junction`,0,[3],[1]),i_=Qg(`$Choose`,0,[2],[1]),a_=Qg(`$Function`,0,[3],[1]),o_=Qg(`$FcnApply`,0,[2,2],[1,1]),s_=Qg(`$RcdSelect`,0,[2,0],[1,1]),c_=Qg(`'`,2,[1],[0]),l_=Qg(`ENABLED`,1,[2],[0]),u_=Qg(`[]`,3,[3],[0]),d_=Qg(`$SquareAct`,2,[2,1],[0,0]),f_=Qg(`$WF`,3,[1,2],[0,0]),p_=Qg(`$TemporalExists`,3,[3],[0]),m_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),h_=e=>e.map(e=>({name:e,arity:0})),g_=(e,n)=>n.location.range?o(`${e}.`,n.location.range):new t(`${e} at line ${n.location.line}, column ${n.location.column}`),__=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),v_=e=>e.kind!==`Let`&&e.kind!==`Label`,y_=e=>{let n=/* @__PURE__ */ new Map,r=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:g(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=g(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=t_.get(t)??Og.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},i=(e,t,n)=>{let r=Yg(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(Kg(e,n,t))}),t.data.constraints.forEach((e,t)=>Xg(r.constraints,t,e)),Zg(r.argConstraints,Gg(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Zg(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(e,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(!(n.operator||n.declared)&&n.data.level>$g(e,r))throw new t(`Level error in applying operator ${e.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new t(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=t=>{let r=e.formals.findIndex(e=>e.name===t);return r===-1?void 0:n[r]},s=(t,n,r)=>e.conditions.has(Jg(t,n,r)),c=Yg(Math.max(e.level,...n.filter((t,n)=>e_(e,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),n.forEach((t,n)=>{e_(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>Xg(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Xg(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Xg(c.constraints,t,e))),n.forEach((t,n)=>t.data.params.forEach(t=>{a(t)||Xg(c.constraints,t,$g(e,n))})),n.forEach((e,t)=>{let r=e.operator;r&&n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Xg(c.constraints,e,$g(r,a)))}))}),e.argParams.forEach(e=>{let t=qg(e),n=o(t.operator)?.operator;n&&Xg(c.constraints,t.param,$g(n,t.index))}),[e.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Zg(c.argConstraints,t,e))),n.forEach((t,r)=>{let i=t.declared;i&&(Array.from({length:i.arity},(t,n)=>Zg(c.argConstraints,Gg(i.name,n),e.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Zg(c.argConstraints,Gg(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=qg(e),n=o(t.operator);n&&Zg(c.argConstraints,Gg(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(qg(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=qg(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(Kg(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(Kg(t.operator,t.index,e)))}}),n.forEach((e,t)=>{let r=e.declared;r&&n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(Kg(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=te(`LAMBDA`,h_(e.params),e.body,t);return{data:n,operator:n}}let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Yg();return e.params.add(n),{data:e,declared:{name:n,arity:i.arity}}}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=m_(n,h_(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw g_(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw g_(`Action used where only temporal formula or state predicate allowed`,e);__.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&v_(n)&&n.kind!==r)throw g_(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=g(e,n);t.constraints.forEach((e,t)=>Xg(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Zg(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,n)=>{try{return ee(e,n)}catch(n){throw!(n instanceof t)||n.sany?n:g_(n.message,e)}},ee=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Yg();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(r_,n)}case`Prime`:case`Unchanged`:return c(c_,[e.expression],t);case`Enabled`:return c(l_,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(u_,[n])}case`If`:return c(r_,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(r_,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(r_,[e.body],t,e.bounds.map(e=>e.set),Xa(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw g_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?p_:r_,[e.body],t,[],e.names);case`Choose`:return c(i_,[e.body],t,e.set?[e.set]:[],Ya(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(n_,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(n_,[e.predicate],t,[e.bound.set],Ya(e.bound.pattern));case`SetMap`:return c(n_,[e.expression],t,e.bounds.map(e=>e.set),Xa(e.bounds));case`FunctionConstruction`:return c(a_,[e.body],t,e.bounds.map(e=>e.set),Xa(e.bounds));case`Record`:return c(a_,e.fields.map(e=>e.value),t);case`RecordSet`:return c(n_,e.fields.map(e=>e.value),t);case`Except`:return c(n_,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(o_,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(n_,e.args,t)}]);case`Bracket`:return Yg();case`FieldAccess`:return a(s_,[o(e.record,t),{data:Yg()}]);case`BoxAction`:case`AngleAction`:return c(d_,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(f_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Yg()}},h=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>h(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return Ue(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,m_(t,h_(e.names))),i;default:return is(e,(e,r)=>(a(e,n,m_(t,h_(r))),e)),i}},te=(e,t,n,r)=>{let i=m_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=h(n,i),c={...Yg(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(Gg(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(Kg(e.name,n,t.name))).map(e=>Jg(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(qg(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=qg(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},g=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...Yg(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=te(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:g,toOperand:o}},b_=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?b_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Yg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Xg(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Zg(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},x_=(e,t,n,i)=>{let a=y_(t),o=e=>Math.max(0,...e.map(e=>a.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?b_(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=f(e.statement),n=()=>s(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...c(e.proof)]:e.body.kind===`Qed`?c(e.proof):[]}):[],l=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>s(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>o([e.set])!==0).flatMap(e=>e.set.location.range?[{location:f(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(e.proof),...r,...e.proof?.kind===`Steps`&&n()?c(e.proof):[]]}):[],u=Jo([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?b_(e.statement,/* @__PURE__ */ new Map,a):a.analyze(e.statement,/* @__PURE__ */ new Map),n=[...l(e.proof),...t.level===3?c(e.proof):[]];if(n.length>0)throw r(n)}})),...n],i);if(u.length>0)throw r(u,!1,void 0,i)},S_=(e,t)=>e.maxLevels[t]??3,C_=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=y_({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},i=/* @__PURE__ */ new Map,a=t=>{let r=i.get(t);if(r)return r;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Xg(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Xg(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Zg(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=qg(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&Xg(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(b_(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(t,c),c};return t=>{let i=/* @__PURE__ */ new Map,o=f(t.location.range??{module:t.instancer,start:t.location,end:t.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=e(t.module),l=a(t.module),u=n(t.instancer),d=/* @__PURE__ */ new Map;t.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let p=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=u.analyze(n,d);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(n,d);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),m=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(p.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(m(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),p.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&s(m(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=l.argConstraints.get(Gg(e.name,i));a!==void 0&&S_(r,i)<a&&s(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let n=qg(e),r=p.find(e=>e.name===n.operator)?.operator,i=p.find(e=>e.name===n.param);if(!r||!i)return;let a=S_(r,n.index);i.level>a&&s(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),i.size>0)throw r([...i.values()])}},w_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],T_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),E_=new Map(Yd.flatMap(e=>e.map(t=>[t,e[0]]))),D_=e=>E_.get(e)??e,O_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},k_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(O_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},A_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),j_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:D_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:D_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},M_=(e,t)=>{let n=[];for(let r=t;;){let t=j_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},N_=e=>({line:e.line,column:e.column}),P_=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=M_(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}return{references:s,end:e.length}};return i(0,t??``).references},F_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,I_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},L_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&F_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&F_(e[n+1],e[n+2])?n+=F_(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>I_[e])}"`:r.text)}return t},R_=e=>e[2]?.text,z_=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},B_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>B_(e.modules,t)).find(Boolean),V_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:($d.has(i)?t?.(i):void 0)??ef.get(i)??t?.(i)??Yp(e,i),s=o===void 0?[]:ge(o),c=z_(s),l=c.get(R_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Zp(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>B_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},H_=(e,t)=>{let n=V_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=M_(t,e+1);r.push({location:N_(t[e]),apply:e=>i.forEach(t=>e.put(A_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:N_(u),apply:t=>t.put(A_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&M_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),T_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(N_(u)),r.push({location:N_(u),apply:e=>e.put(A_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(A_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=D_(e.name);r.push({location:e.location,apply:n=>n.put(A_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(A_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(A_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>La(e.location,t.location)?-1:+!!La(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=k_();i.set(e??``,s),Jd.toReversed().forEach(e=>s.put(A_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},U_=(e,t,n)=>H_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),W_=(e,t)=>{let n=H_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},G_=(e,t)=>U_(e,t,`variable`),K_=(e,t,n)=>{let r=V_(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),Xd.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=P_(s(e),e,c);return l.set(e,n),n},f=e=>c.get(e)??u(e),p=/* @__PURE__ */ new Set,m=(e,t)=>c.has(t)||p.has(`${e.key}>${t}`),ee=(e,t,n)=>{let r=[...e.extends.map(f),...e.instances.filter(t=>m(e,t)).map(f),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!m(n,e));return i===void 0?ee(n,r,t):[n,i]};return t},te=h(e=>e.extends),g=h(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;L_(s(void 0)).forEach((e,t)=>{t===3&&Qd.forEach(a),a(e)});let y=u(void 0);for(;;){let e=te(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;if(p.add(`${t.key}>${n}`),v.set(t.unit,[...v.get(t.unit)??[],n]),!_.has(n)){if(_.add(n),r(n).tokens.length===0){let e=t.unit??R_(r(void 0).tokens);throw d(n,e)}L_(s(n)).forEach(a)}}w_.forEach(a);let ne=/* @__PURE__ */ new Set,re=e=>{if(ne.has(e))return;ne.add(e);let t=v.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(re),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return re(void 0),Zd.forEach(a),[...i]},q_=e=>{switch(e.kind){case`Number`:if(!nt(e.value))throw i(new p(`Integer overflow: ${e.value} is outside TLC's 32-bit range`),m.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return kt(e.name);case`Set`:return Tn(e.elements.map(q_))}},J_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],Y_=(e,n)=>{try{return Zp(e)}catch(i){if(!(i instanceof t))throw i;let a=Cp(e);throw a===void 0?i:r([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,a)}},X_=e=>new t(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Z_=(e,t)=>e.location.range&&t.location.range&&{location:f(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${f(t.location.range)}.`},Q_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,$_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:Q_(e),ev=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:vs(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),tv=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new h(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Ut(t,r)})});if(t)return t[1];throw new h(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},nv=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Ue(e).some(e=>nv(e,t)),rv=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ps(e),n.get(e)??n.size)),n},iv=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),av=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw pl(e);if(e.kind===`Number`&&!nt(e.value))throw ml(e);av(e.kind===`Let`?[...Ue(e),...iv(e.instances??[])]:Ue(e))}),ov=(e,n)=>{let i=Zp(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=new Map(ug.map(e=>[e.name,e])),u=/* @__PURE__ */ new Map,p=Fm(e.checkDeadlock,n.seed);p.isWarningEnabled=n.isWarningEnabled??!0,p.isTool=n.isTool??!1,p.version=n.version??`master`;let m=/* @__PURE__ */ new Map,ee=/* @__PURE__ */ new Map,te=/* @__PURE__ */ new Map,g=[],_=/* @__PURE__ */ new Map,y=[],re=[],ie=(e,t)=>y.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ae={value:0},oe=e=>`${e}#${ae.value++}`,se=[],ce=[],le=C_(e=>{let t=te.get(e)??pe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),ue=/* @__PURE__ */ new Map,de=/* @__PURE__ */ new Map,fe=/* @__PURE__ */ new Map,b=e=>{let t=u.get(e);if(t)return t;let r=Dg(e,n.print,p,n.files,l);if(!r)return;Eg.get(e)?.forEach(b);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>b(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{l.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Og.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Ag(e,t.name)??i.get(t.name)?.range})}),u.set(e,i),i},x=e=>{if($d.has(e)&&n.loadModule?.(e)!==void 0)return;let t=b(e),r=Eg.get(e)??[];return t&&ie(e,r),t&&r.includes(`Integers`)&&b(`Integers`),t},S=e=>(av([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...iv(e.instances)]),e.modules.forEach(S),e);S(i);let C=(e,t)=>{let i=n.loadModule?.(e)??qe.get(e)??Yp(n.source,e);if(i===void 0)throw d(e,t);let a=Y_(i,e);if(a.name!==e)throw r([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return S(a)},w=e=>{let n=re.indexOf(e.name);if(n!==-1){let r=[...re.slice(n),e.name].map(e=>`${e}.tla`);throw new t(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let i=/* @__PURE__ */ new Set,a=[],o=[],s=[];re.push(e.name),y.push(i);let c=xe(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:a,errors:o,warnings:ce,levelChecks:s});if(y.pop(),re.pop(),o.length>0)throw r(o,!1,void 0,ce);let l=a.find(e=>i.has(e.name)),u=l&&m.get(l.name),d=u&&Z_(l,u.module);if(d)throw r([d],!1,void 0,ce);if(l)throw X_(l);return s.forEach(e=>e()),{linked:c,closure:i}},pe=(e,t)=>{let r=m.get(e);if(r)return ie(e,_.get(e)??[]),r;let i=w(C(e,t));return(Vm(p.version).has(e)?Dg(e,n.print,p,n.files,l):void 0)?.operators.forEach(e=>{let t=i.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(l.set(t.key,e),a.delete(t.key))}),m.set(e,i.linked),_.set(e,i.closure),ie(e,i.closure),i.linked},me=(e,t,n,r,i)=>{let l=i?void 0:x(e.module);if(l)return he(e,l);let u=i??pe(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=J_(u),f=`#${ae.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=qo(Ug(e,t),d,t,n);se.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let ee=Ts({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Qo(t,p)])),variables:new Set(u.variables),getDefinition:e=>a.get(e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=oe(`${i}@${t.name}`),f=l(u);return a.set(u,f),d.length>0&&c.add(f),e.name!==void 0&&de.set(u,`${e.name}!${de.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:oe});return ge(e,u.exported,d,(t,n)=>{let r=e.name===void 0?ee.getKey(t):ee.getQualifiedKey(t);return d.length>0&&ue.set(r,{name:n,location:e.location}),e.name!==void 0&&fe.set(r,n),r})},he=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),ge=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:o.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},_e=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:ys(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ve=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ye=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=ve(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:ys(r,n),location:n}}},T=(e,t,n,r)=>{let i=e.location,s=r?void 0:x(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=ve(n.arity);return _e(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${ae.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=J_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};se.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>nv(f(e),p),ee=d.map(t=>{let n=ye(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),h=[],te=Ts({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:ys(e.params,i),location:i,resolution:ja}:vs(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${h.length}`,a=r(i);return h.push(a.kind===`Operator`?{...a,name:i}:ev(a,i)),i},createName:oe}),g=new Set(d.map(e=>e.name)),_=[...c.exported].filter(([e])=>!g.has(e)).map(([t,n])=>{let r=te.getKey(n.key),a=ve(n.arity),o=[...e.params,...a];return _e(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...ee,...h,..._]},E=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),be=/* @__PURE__ */ new Map,xe=(e,t)=>{let r=qd(e,n.loadClass?.(e.name),e===i);be.set(e.name,r.overrides);let s=r.module,c=se.length,l=new Map([...ug.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...t.symbols]),u=/* @__PURE__ */ new Map,d={location:Ho,errors:[],warnings:[]},p=[d],m=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||f(n.range)===f(e.range))return;let r=f(e.range),i=f(n.range);$_(n.kind)===$_(e.kind)?d.warnings.push({location:r,message:`Warning: the ${Q_(n.kind)} of '${t}' conflicts with \nits ${Q_(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${Q_(e.kind)} of '${t}' conflicts with \nits ${Q_(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Set,v=/* @__PURE__ */ new Map,y=[],ne=[...s.constants],re=s.variables.map(e=>e.name),ie=s.variables.map(e=>e.location);s.extends.forEach(e=>{let n=t.modules.get(e),r=n?void 0:x(e);if(r){m(r);return}let i=n??pe(e,s.name);ne.push(...i.constants.filter(e=>ne.every(t=>t.name!==e.name))),i.variables.forEach((e,t)=>{re.includes(e)||(re.push(e),ie.push(i.variableLocations[t]))}),m(i.exported),i.facts.forEach(e=>_.add(e)),i.modules.forEach((e,t)=>v.set(t,e)),y.push(i)});let ae=new Map(l),oe=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],ue=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});oe.forEach(e=>h.set(e.name,ue(e)));let de=e=>({key:S(e),arity:Ra(e),params:za(e),kind:Uo(s,e)?`Theorem`:`Definition`,range:e.location.range}),b=ne.length===0&&re.length===0,S=e=>s===i?e.name:`${e.name}@${t.id}`,C=/* @__PURE__ */ new Map,w=()=>new Map([...t.modules,...v]),_e=e=>{let t=s.instances.find(t=>t.module===e.name);return t!==void 0&&La(e.location,t.location)},ve=e=>{let t=s.modules.find(t=>t.name===e.module);return t?_e(t)?v.get(t.name):void 0:w().get(e.module)},ye=e=>({imported:l,getInstance:e=>{let t=ve(e),n=t?void 0:x(e.module);if(n)return{declarations:[],symbols:he(e,n),instancer:s.name};let r=t??pe(e.module,s.name),i=J_(r);return{declarations:i,symbols:ge(e,r.exported,i,e=>e),instancer:s.name}},bound:ae,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:S,instanced:C,facts:_,reports:p,warnings:t.warnings}),Se=e=>[...oe.filter(t=>La(t.location,e)).map(e=>[e.name,ue(e)]),...s.definitions.filter(t=>La(t.location,e)).map(e=>[e.name,de(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),Ce=e=>{let n=w(),r=n.get(e.name),i=r&&Z_(e,r.module);if(r&&!i)throw X_(e);t.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=xe(e,{id:`${t.id}/${e.name}`,symbols:Se(e.location),modules:n,nested:t.nested,errors:a.errors,warnings:a.warnings,levelChecks:t.levelChecks});i&&a.errors.push(i),r||v.set(e.name,o),ee.has(e.name)||ee.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=me(e,s,ye(s),b,w().get(e.module));C.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>Ce(e)}))].sort((e,t)=>La(e.location,t.location)?-1:1).forEach(e=>e.link());let we=Wg(ks(s,(e,t)=>T(e,t,s.name,ve(e))),E(l));t.errors.push(...Yo(we,ye(we))),we.definitions.forEach(e=>{let t=S(e);a.set(t,e),o.set(t,!b);let n=de(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!La(r,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let Te={module:we,constants:ne,variables:re,variableLocations:ie,visible:l,exported:h,modules:v,extended:y,facts:/* @__PURE__ */ new Set([..._,...[...we.theorems,...we.assumptions].flatMap(e=>e.name??[])])};te.has(s.name)||te.set(s.name,Te);let Ee=se.splice(c).map(e=>({location:e.location,check:()=>le(e)}));return t.levelChecks.push(()=>x_(we,{constants:new Set(ne.map(e=>e.name)),variables:new Set(re),getDefinition:e=>a.get(l.get(e)?.key??e),getQualifiedName:e=>fe.get(l.get(e)?.key??e)},Ee,ce)),g.push(Te),Te},Se=w(i).linked;ce.length>0&&!n.isSanyReported&&n.print(ne(ce));let Ce=e=>Se.visible.get(e)?.key??e;Se.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)});let we=[],Te=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Te(e,t)),we.push(...e.module.assumptions))};Te(Se,/* @__PURE__ */ new Set);let Ee=Se.constants.map(e=>e.name),De=Se.variables,Oe=e=>e.module===void 0?[e.name,Ce(e.name)]:e.module===i.name||Ee.includes(e.name)?[]:[(m.get(e.module)??ee.get(e.module))?.visible.get(e.name)?.key??e.name],ke=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:Se.constants.find(t=>t.name===e)?.arity??0},Ae=/* @__PURE__ */ new Map,je=/* @__PURE__ */ new Set,Me=(e,t)=>{l.set(e,t),a.delete(e),Ae.delete(e),je.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=q_(e.value);Sn(t),Oe(e).forEach(e=>{let n=ke(e);n===0?Ae.set(e,t):Me(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ne=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ne.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new v(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(q_),q_(e.value)]),Ne.set(t,n)}),Ne.forEach(e=>Oe(e).forEach(t=>Me(t,tv(e.name,ke(t)||e.rows[0][0].length,e.rows))));let Pe=new Map(e.substitutions.flatMap(e=>Oe(e).map(t=>[t,Ce(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,r=t.target;if(!Ee.includes(n)&&!Se.visible.has(n))throw new v(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===r))throw new v(`In the configuration file, the identifier ${r} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let i=Ce(r),o=a.get(i);if(!(o!==void 0||l.has(i)||Ae.has(i)||Ee.includes(r)||De.includes(r)))throw new v(`The configuration file substitutes for ${n} with the undefined identifier ${r}.`);if(o?.kind===`Operator`&&o.params.length!==(Se.constants.find(e=>e.name===n)?.arity??Se.visible.get(n)?.arity))throw new v(`The configuration file substitutes for ${n} with ${r} of different number of arguments.`)});let Fe=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(Oe)),Ie=(e,t)=>{if(Fe.has(e))return{key:e,prefix:t};let n=s.get(e);return n&&Ie(n.source,t+n.prefix)};s.forEach((e,t)=>{let n=Ie(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=_e(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),Se.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})});let Le=Ee.filter(e=>!Ae.has(e)&&!Pe.has(e)&&!je.has(e));if(Le.length>0&&!n.isUnconfigured){let e=U_(n.source,n.loadModule,`constant`).find(e=>Le.includes(e))??Le[0];throw new v(`The constant parameter ${e} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&l.forEach((e,t)=>{let n=hg(e);n&&l.set(t,n)});let Re={runtime:p,definitions:a,builtins:l,constants:Ae,substitutions:Pe,instanceNames:de,variables:De,variableIndex:rv(De,g.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:c,evaluators:/* @__PURE__ */ new WeakMap},ze=y_({constants:new Set(Ae.keys()),variables:/* @__PURE__ */ new Set([...De,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>l.has(e))]),getDefinition:e=>Tl(e,Re)}),Be=e=>{try{H(e,{environment:Re,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof h)return e;throw e}};Pe.forEach((e,t)=>{let n=a.get(e),r=Ee.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&ze.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Be(n.body):void 0;if(r){let n=ua(r)?``:` - specifically: ${r.message}`;throw new v(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),p.version!==`1.7.4`&&(p.isStarted=!0);let Ve=new Set(g.flatMap(e=>e.module.instances.map(e=>e.module))),D=W_(n.source,n.loadModule);return{environment:Re,assumptions:we,variableLocations:Se.variableLocations,instanceActions:ue,startupDefinitions:g.filter(e=>!Ve.has(e.module.name)||J_(e).length===0).flatMap(e=>D(e===Se?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:Se.constants,rootSymbols:Se.visible,javaOverrides:g.flatMap(e=>be.get(e.module.name)??[])}},sv={kind:`Boolean`,value:!0},cv={kind:`Boolean`,value:!1},lv=e=>e?sv:cv,uv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,dv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),fv=(e,t,n)=>({kind:e,operands:[t,n]}),pv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?pv(e,t.operands).operands:[t])}),mv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return mv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,mv(t)),0)}},hv=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return hv(e.body);case`And`:case`Or`:return e.operands.some(hv)}},gv=/* @__PURE__ */ new WeakMap,_v={count:0},vv=e=>{let t=gv.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${_v.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(vv).join(`,`)})`;default:return`${e.kind}(${vv(e.body)})`}})();return gv.set(e,n),n},yv=(e,t)=>e===t||vv(e)===vv(t),bv=(e,t)=>{let n=vv(t);return e.some(e=>e===t||vv(e)===n)},xv=e=>e===`And`?`Or`:`And`,Sv=(e,t)=>{switch(e.kind){case`Boolean`:return t?lv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return Sv(e.body,!t);case`And`:case`Or`:return pv(t?xv(e.kind):e.kind,e.operands.map(e=>Sv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,Sv(e.body,t))}}},Cv=e=>{switch(e.kind){case`Boolean`:return lv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return pv(xv(e.kind),e.operands.map(Cv));case`Always`:return $(`Eventually`,Cv(e.body));case`Eventually`:return $(`Always`,Cv(e.body));default:return $(`Not`,e)}},wv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=wv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return lv(t)}return n.length===0?lv(!t):n.length===1?n[0]:pv(e.kind,n)}case`Not`:{let t=wv(e.body);return t.kind===`Boolean`?lv(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=wv(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Tv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Ev=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Ev(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new h(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>pv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Ev(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Tv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:pv(`Or`,t);n.push($(`Always`,$(`Eventually`,e)))}return pv(`Or`,n)}case`Not`:return uv(e.body)?e:Ev(Cv(e.body));default:return e}},Dv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Dv(e.operands[0]):pv(e.kind,e.operands.map(Dv));case`Not`:return e.body.kind===`Not`?Dv(e.body.body):$(`Not`,Dv(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,Dv(e.body));default:return e}},Ov=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Ov(e.operands[0]);let t=Math.floor(e.operands.length/2);return fv(e.kind,Ov(pv(e.kind,e.operands.slice(0,t))),Ov(pv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,Ov(e.body));default:return e}},kv=(e,t)=>{e.kind===`Eventually`&&!bv(t,e)&&t.push(e),`body`in e&&kv(e.body,t),`operands`in e&&e.operands.forEach(e=>kv(e,t))},Av=e=>{let t=e.filter(dv),n=e.flatMap(e=>e.kind===`Not`&&dv(e.body)?[e.body]:[]);return!t.some(e=>bv(n,e))},jv=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,$(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new h(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Mv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:$(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Nv=(e,t,n)=>e.flatMap(e=>{let r=Mv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Pv=e=>[...new Set(e.map(vv))].sort().join(`|`),Fv=(e,t)=>{let n=new Set(t.map(Pv));return[...e.filter(e=>!n.has(Pv(e))),...t]},Iv=e=>{let t=jv(e),n=Nv(t,`Always`,`And`),r=Nv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Mv(t,`Eventually`,`Or`);if(n&&!(bv(e,n.first)||bv(e,n.second)))return Fv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(bv(e,t.first)||bv(e,t.second))&&!bv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Av(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Mv(t[e],`Always`,`And`);n&&(bv(t,n.first)||t.push(n.first),bv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)bv(t,e.first)&&bv(t,e.second)&&!bv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Av(t)?[]:i(t)};return a(e)},Lv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>mv(e)<=1)}),Rv=e=>{let t=Iv([e]).map(Lv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Pv(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of Iv(n)){let n=Pv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Lv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},zv=(e,t)=>!bv(e,t)||bv(e,t.body),Bv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&mv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Tv(e);if(n){let e=mv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(hv(e))throw new h(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Vv=(e,t)=>{let n=e.findIndex(e=>yv(e,t));return n===-1?(e.push(t),e.length-1):n},Hv=e=>{let t=Ev(wv(Sv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Dv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Bv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:pv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:yv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Ov(e.formula),n=[];t&&kv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Vv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Vv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Vv(i,e))}));return{tableau:t&&Rv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Uv=()=>i(new h(`Temporal formula is a tautology (its negation is unsatisfiable).`),m.livenessEvaluationFailure),Wv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Gv=/* @__PURE__ */ new WeakMap,Kv=/* @__PURE__ */ new WeakSet,qv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Jv=(e,t)=>new h(`TLC cannot handle the temporal formula ${al(e)}${t===void 0?``:`:\n${t}`}`),Yv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=vl(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Yv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Yv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Tl(e,n);if(t)return Xv(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isStateLevel&&!r.isLevelConstant?1:0},o=(e,t)=>r.has(e)?0:O(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return is(e,(e,a)=>(i.value=Math.max(i.value,Yv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Wv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Xv=(e,t)=>{let n=Gv.get(e);if(n!==void 0)return n;Gv.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(Yv(e.body,void 0,t),...r.map(e=>Yv(e.set,void 0,t)));return Gv.set(e,i),i},Zv=(e,t)=>{try{return Rl(e,t)}catch(e){if(!(e instanceof h))throw e;if(!ua(e))return;throw i(new h(`${c}${e.message}`),m.error)}},Qv=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let c=(e,t,s=o,c=i,l)=>Qv(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>c(e,t,al(e)));if(e.kind===`Label`)return c(e.body,t);if(e.kind===`Let`)return c(e.body,$v(e,t,n));if(e.kind===`Identifier`){let r=O(e)?vl(t,e.name):void 0;if(r?.kind===`Thunk`)return c(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:Tl(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Xv(a,n)>0){if(i.has(a))throw s();return c(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let l=qv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Yv(e,t,n)===3)){let t=lu(e,l),r=O(e)?void 0:Tl(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return c(t.body,Cu(t,e.args,l),e.operator,i,r)}let u=r&&e.kind===`Forall`&&e.bounds.every(e=>Yv(e.set,t,n)===0),d=u?Zv(e.bounds,l):void 0;if(u&&d){let n=[];if(zl(e.bounds,d,t,t=>(n.push(...c(e.body,t,al(e.body))),!1)),n.length===0)throw Uv();return n}return[{expression:e,scope:t,name:o}]},$v=(e,t,n)=>{let r=Tu(e.definitions,qv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Kv.add(e.binding);return r},ey=(e,t,r)=>{let i=r.runtime.version===`1.7.4`,a=(e,t,n)=>{let a=n===0&&!i?Yv(e,t,r):n;if(a===0){let n=H(e,qv(r,t));if(typeof n!=`boolean`)throw new h(`TLC expected a boolean value, but did not find one. ${ol(e)}`);return lv(n)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},c=(e,t,n,r)=>{if(o.depth>=100)throw s();o.depth++;let i=m(e,t);o.depth--;let c=mv(i);return c>2?i:a(n,r,c)},l=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=qv(r,t),o=O(e)||Tl(n,r)===void 0?vl(t,n):void 0;if(o?.kind===`Thunk`&&Kv.has(o))return u(e,()=>c(o.expression,o.scope,e,t));let s=o?.kind===`Operator`?o.operator:o?void 0:O(e)?uu(n,a):su(n,r);if(s?.kind!==`Closure`)throw Jv(e);let l=e.kind===`Apply`?e.args:[],d=!O(e)&&Tl(n,r)?.isRecursive===!0;return u(e,()=>(i&&l.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>H(e,a)),c(s.body,Cu(s,l,a),e,t)),d)},u=(e,t,r=!1)=>{try{return t()}catch(t){let a=t instanceof n||r&&!i;throw!(t instanceof h)||a?t:Jv(e)}},d=(e,t)=>{let i=Yv(e,t,r);if(!e.bounds.every(e=>Yv(e.set,t,r)===0)){if(i<=2)return a(e,t,i);throw Jv(e)}let o=[],s=e.kind===`Forall`;try{Bl(e.bounds,qv(r,t),t=>(o.push(m(e.body,t)),!1))}catch(r){if(!(r instanceof h)||r instanceof n)throw r;if(i<=2)return a(e,t,i);throw Jv(e,s&&!ua(r)?r.message:void 0)}return o.length===0?lv(s):f(e,t,pv(s?`And`:`Or`,o))},f=(e,t,n)=>{let r=mv(n);return r>2?n:a(e,t,r)},p=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!O(e)||e.operator===`=>`),m=(e,t)=>{let n=Yv(e,t,r);if(n<=2&&!p(e))return a(e,t,n);switch(e.kind){case`Label`:return m(e.body,t);case`Let`:return m(e.body,$v(e,t,r));case`Identifier`:return l(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,fv(`Or`,$(`Not`,m(n[0],t)),$(`Eventually`,m(n[1],t)))):e.operator===`~`&&!O(e)?f(e,t,$(`Not`,m(n[0],t))):e.operator===`=>`?f(e,t,fv(`Or`,$(`Not`,m(n[0],t)),m(n[1],t))):l(e,t)}case`And`:case`Or`:return f(e,t,pv(e.kind,e.operands.map(e=>m(e,t))));case`Forall`:case`Exists`:return d(e,t);case`If`:{if(!i&&Yv(e.condition,t,r)===0){let n=H(e.condition,qv(r,t));if(typeof n==`boolean`)return m(n?e.consequent:e.alternative,t)}let n=m(e.condition,t);return f(e,t,fv(`Or`,fv(`And`,n,m(e.consequent,t)),fv(`And`,$(`Not`,n),m(e.alternative,t))))}case`Always`:case`Eventually`:return $(e.kind,m(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=$(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?$(`Always`,$(`Eventually`,fv(`Or`,i,a))):fv(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Jv(e)}};return m(e,t)},ty=(e,t,n,r,i)=>{let a=e=>ty(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?wl(H(e.expression,a),`a temporal property predicate`):Jc(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&wl(H(e.unchanged,a),`a subscript`)?!1:wl(H(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return ty(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new h(`TLC cannot evaluate a temporal formula in a single step`)}},ny=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>ny(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return ty(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},ry=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),iy=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},ay=e=>i(new h(`${l}${e}`),m.error),oy=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!M(e)||!M(i))throw ay(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},sy=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(sy);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},cy=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,ly=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new v(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw ay(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>H(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!A(a)||!N(a))throw ay(`The symmetry operator must specify a set of functions.`);let o=P(a).elements;if(!o.every(j))throw ay(`The symmetry values must be function records.`);let s=o.map(oy),c=r.body.kind===`Apply`?r.body.args:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=sy(cy(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(ea.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;s.forEach(e=>{e.size>0&&d.set(ry(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=iy(n,e),r=ry(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),ee=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!cy(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||ee.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>M(e)&&m.has(e.name))})),d.size===0)return;let h=Math.max(256,Math.floor(4194304/d.size));return{permutations:[...d.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:h})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:h}},uy=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=py(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(py(e[r],t));return a}},dy=(e,t)=>{let n=[],r=[];for(let i of e){let e=py(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Dt);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Dt(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},fy=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,py=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=fy(e);if(n===0||n>64)return my(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=my(e,t),a=i!==e&&Gt(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},my=(e,t)=>{let n=e.kind;if(n===`Set`){let n=dy(e.elements,t);return n?At(n):e}if(n===`Function`||n===`LazyFunction`&&N(e.domain)){let n=I(e),r=uy(n.domain,t),i=uy(n.range,t)??n.range;if(r){let e=jn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?jt(n.domain,e.range):e}return i===n.range?n:jt(n.domain,i)}if(n===`Interval`||!A(e)||!N(e))return e;let r=P(e),i=uy(r.elements,t);return i?Tn(i):r},hy=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},gy=(e,t,n)=>e.images[t]??=py(e.images[0],n.permutations[t-1]),_y=(e,t,n,r)=>{let i=hy(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=Dt(gy(i,t,r),gy(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},vy=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?_y(i,t,n,r):0;if(o!==0)return o<0}return!1},yy=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>vy(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?gy(hy(e,t),r,t):e)},by={line:0,column:0},xy=e=>({kind:`Identifier`,name:e,location:by}),Sy=/* @__PURE__ */ new Set([`name`,`property`]),Cy=(e,t,n)=>{let r=Tl(t,n);if(!r)throw new v(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new v(Sy.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},wy=(e,t,n)=>{if(kl(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return H(xy(e),Ky(n,void 0,void 0))}catch(e){if(e instanceof h||a(e))return;throw e}},Ty=(e,t,n)=>{let r=Cy(e,t,n);if(wy(t,r,n)!==void 0)throw new v(`The ${e} ${t} cannot be a constant.`);return r},Ey=(e,t,n)=>{let r=n.constants.has(t)?void 0:Cy(e,t,n),i=r?wy(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new v(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},Dy=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Oy=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),ru(e.startupDefinitions,r),t.invariants.forEach(e=>{Ey(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},ky=(e,t)=>{let n=y_({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>Tl(e,t)});return e.flatMap(e=>{let r=Ey(`invariant`,e,t);if(!r)return[];let a=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(a.level>=2){let t=a.params.size===0?``:`
1781
1766
  Note that a bug can cause TLC to incorrectly report this error.
1782
1767
  If you believe your TLA+ or PlusCal specification to be correct,
1783
- please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new v(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Nb(t),scope:void 0}]})},Hb=(e,t)=>{if(!P(e))return;let n=Ar(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Ub=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Ub(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=_l(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Ub(n.body,t)}return[e]},Wb=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Xv(r,e.scope,t)>0)return!1;let i=W(r,ax(t,void 0,void 0,e.scope));if(i===!1)throw new v(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new v(`The operator ${r.name}, which equals ${z(i)},\ncannot be used as a ${n}`);return!0},Gb=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return Lb(t,e,r),Nb(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let i=[],a=[],o=[],s=Fb(`name`,t.specification,r),c=Ib(t.specification,s,r);if(c!==void 0)throw new v(`The value of ${t.specification} is equal to ${z(c)}`);if($v(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Wb(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new v(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&Xv(c.expression,s.scope,r)<2)throw n(new y(`TLC cannot handle the temporal formula ${el(c.expression)}`),e.error);let l=Xv(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new v(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new v(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...i,...a],u=e=>`$specification${e}`,d=l.reduce((e,t,n)=>t.scope===void 0?e:{name:u(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),f=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:u(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(f),location:Ab},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},Kb=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=Rb(`property`,e,t);if(!i)return;Xv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;$v(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(Wb(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`&&Xv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!B(e)?_l(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=Xv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new v(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},qb=(e,t,n)=>t.flatMap(t=>Rb(e,t,n)?[{name:t,expression:Nb(t),scope:void 0}]:[]),Jb=(e,t)=>{let n=_l(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Yb=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);Lb(`possible`,n,t);let i=Nb(n);if(Xv(i,void 0,t)===3)throw new v(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Xb=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||B(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Zb=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=_l(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},Qb=(e,t)=>e.flatMap(e=>Ub(e.expression,t).map(n=>{let r=e.scope===void 0?wd(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Xb(n,r,t),predicate:Zb(e.expression,t)}})),$b=(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},ex=/[\u0100-\uffff]/,tx=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),nx=e=>e.kind===`String`?ex.test(e.value):e.kind===`Set`&&e.elements.some(nx),rx=e=>e.kind===`String`&&ex.test(e.value)||e.kind===`Apply`&&tx.has(e.operator)||vi(e).some(rx),ix=(e,t)=>e.constants.some(e=>nx(e.value)||(e.args??[]).some(nx))||[...t.definitions.values()].some(e=>rx(e.body)||e.kind===`Function`&&e.bounds.some(e=>rx(e.set))),ax=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),ox=(e,t,n)=>gl(W(e,t),n),sx=(e,t,n=cx)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},cx=(e,t)=>{let n=e.kind===`Identifier`?_l(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?$c(i):tl(r)}`},lx=(e,t)=>sx(e.expression,t,(n,r)=>(sx(e.predicate,t),cx(n,r))),ux=()=>{},dx=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=ox(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),fx=(e,t,n)=>{try{return ox(e,ax(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},px=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=fx(n.expression,t,`an assumption`);if(e)return{name:el(n.expression),trace:[],message:e.message}}},mx=(t,r,i,a)=>{let o=Vb(t.invariants,r),c=Gb(t,r),l=Kb(t,r,a),u=Qb([...o,...l.invariants],r),d=[...new Map(u.map(e=>[e.predicate,e])).values()],f=u.length>0||l.actionProperties.length>0||l.liveness.length>0;if(c.init===void 0&&(f||l.initialPredicates.length>0||r.variables.length>0))throw new v(r.runtime.version===`1.7.4`?ma:`The configuration file did not specify the initial state predicate.`);if(c.next===void 0&&f)throw new v(`The configuration file did not specify the next state predicate.`);let p=Qb(qb(`constraint`,t.constraints,r),r),m=qb(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Fb(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Fb(`periodic`,t.periodic,r);let h=Yb(t.possible,r);if(r.variables.length===0)return;let g=t.symmetry===void 0?void 0:lb(t.symmetry,r,t.substitutions);t.view!==void 0&&Fb(`view function`,t.view,r);let _=t.view===void 0?void 0:{name:t.view,expression:Nb(t.view),scope:void 0},b=l.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Ab};return{...e,unchanged:t}}),x=e=>Xv(e.expression,void 0,r)>=2,ee=h.filter(e=>!x(e)),te=h.filter(x),S=r.runtime,ne={indices:void 0},re=()=>{if(ne.indices)return ne.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return ne.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ne.indices},ie=(e,t)=>W(e,ax(r,t,void 0)),C=e=>{let t=re(),n=g===void 0?e:yb(e,g,t);return sm(_===void 0?t.map(e=>n[e]):[ie(_.expression,n)])},ae=ix(t,r);S.getFingerprint=C;let oe=()=>{let e=h.find(e=>!S.possibleCounts.get(e.name));if(!e)return;let t=Jb(e.name,r),n=t?` at ${$c(t)}`:``;return{name:e.name,code:ua.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${n} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:dt(z(Om(S),!0))}};return{properties:l,spec:c,isSymmetric:g!==void 0,isConstrained:p.length>0||m.length>0,getTlcOrder:re,getStoredFingerprints:(e,t)=>{if(_!==void 0||ae)return BigInt64Array.from(e,C);let n=new BigInt64Array(t.length),r=um(re(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ae)return[String(C(e))];let t=g===void 0?e:yb(e,g,re());return _===void 0?t:[ie(_.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if($b(a,t,i))return!1;try{let e=ax(r,t,void 0,a.scope),n=a.membership;return i&&n?!kr(t[n.variable],i[n.variable],W(n.set,e)):!lx(a,e)}catch(t){throw i?xx(n(t,e.safetyEvaluationFailure),ua.invariantEvaluationFailed,`Evaluating invariant ${a.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>sx(n,ax(t,e,void 0,r));p.every(e=>r(e.predicate,e.scope))&&n();let i=d.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=l.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(p.every(e=>sx(e.predicate,ax(n,t,void 0,e.scope)))&&m.every(r=>sx(r.expression,ax(n,e,t,r.scope))))||r())||d.every(e=>sx(e.predicate,ax(n,t,void 0,e.scope))))&&b.every(r=>sx(r.box,ax(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>p.every(n=>$b(n,e,t)||lx(n,ax(r,e,void 0))),findFailedInitialPredicate:e=>l.initialPredicates.find(t=>!sx(t.expression,ax(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>b.find(n=>{try{return!sx(n.action,ax(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${el(n.box)}`)&&!ox(n.unchanged,ax(r,e,t,n.scope),`a subscript`)}catch(e){throw xx(hx(e),ua.actionPropertyEvaluationFailed,`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>m.every(n=>sx(n.expression,ax(r,e,t),e=>`${s}${cx(e,r)}`)),trackStatePossible:ee.length===0?ux:e=>dx(ee,S,ax(r,e,void 0)),trackActionPossible:te.length===0?ux:(e,t)=>dx(te,S,ax(r,e,t)),findUnwitnessedPossible:oe,findPostconditionViolation:(i=!1)=>{let a=t.postconditions.find(e=>{let t=_l(e,r);return t!==void 0&&r.definitionValues.has(t)});if(a!==void 0){if(i)return;throw n(new y(`${s}The post condition ${a} cannot be a constant.`),e.error)}let o=oe();if(o)return o;for(let e of t.postconditions){let t=fx(Nb(e),r,`a postcondition`);if(!t)continue;let n=Jb(e,r),i=n?` at ${$c(n)}`:``;return t.message===void 0?{name:e,code:ua.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:ua.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},hx=e=>e instanceof S?n(e,e.exitCode):e,gx=/* @__PURE__ */ Error(`The replay stopped`),_x=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),vx=t=>{let n=ya(t.message);return n&&!n.isEvalException&&_x.has(n.code)?e.configParseError:oe(t)},yx=t=>{let n=t.cause;return n instanceof y?yx(n):t instanceof S?t.exitCode:e.specEvaluationFailure},bx=/* @__PURE__ */ new WeakMap,xx=(e,t,r)=>{if(!(e instanceof y))return e;let i=n(new y(`${r}\n${e.message}`,e),oe(e));return bx.set(i,{code:t,headline:r,inner:e}),i},Sx=s.slice(0,s.indexOf(`
1784
- `)),Cx=`${s}tlc2.tool.EvalException: `,wx=`${s}util.Assert$TLCRuntimeException: `,Tx=o(`tlc2.tool.EvalException`),Ex=e=>ba(e)?Cx:wx,Dx=e=>{try{return e()}catch(e){throw e instanceof y?ba(e)?new y(`${Tx}${e.message}`):ya(e.message)?e:new y(`${s}${e.message}`):e}},Ox=[Cx,wx,s,Tx],kx=(e,t)=>{let n=bx.get(e);if(n)return`${n.headline}\n${kx(n.inner,t)}`;let r=e.message,i=Ox.find(e=>r.startsWith(e))??``;return`${i}${Ca(r.slice(i.length),t)}`},Ax=(e,t)=>{let n=bx.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:kx(e,!0)};if(t&&ba(e))return{code:ya(r)?.code??ua.general,message:r,toolMessage:r};let i=t&&!r.startsWith(Sx)?s:``;return{code:ua.general,message:`${i}${r}`,toolMessage:`${i}${kx(e,!0)}`}},jx=e=>{let t=e.dump&&nb(e.dump,e.writeFile,e.version);try{return Nx(e,t)}catch(e){throw c(e)?Mx():e}finally{t?.close()}},Mx=()=>n(new x,e.error),Nx=(t,i)=>{let o=typeof t.config==`string`?at(t.config,t.version):t.config,l=t.onPrint??console.log,u={lines:void 0},d=e=>{u.lines?u.lines.push(e):l(e)},f=e=>{let t=u.lines,n=[];u.lines=n;try{return{result:e(),lines:n}}finally{u.lines=t}};Dt(G_(t.source,o,t.loadModule)),kt(t.version);let p=av(o,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:d,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed,isTool:t.isTool,isTraceRecorded:t.isTraceRecorded,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version});Bb(p,o,t.onProgress);let m=p.environment,h=m.runtime,g=h.version===`1.7.4`;h.pause=t.onPause??(()=>{}),h.getSpecification=()=>Ky(o,m,p.variableLocations,p.instanceActions);let _={depth:0,initialStates:void 0},b=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:h.generatedStates,distinctStates:h.distinctStates,queuedStates:h.queueSize,depth:h.generatedStates===0?0:Math.max(_.depth,1),initialStates:_.initialStates,outDegrees:void 0,fingerprintDistance:void 0}),te=Array.from({length:32},()=>0),re={newStates:0},ie=()=>Math.min(re.newStates,31),C=()=>te.map((e,t)=>t===ie()?e+1:e),ae=()=>g?[...te]:C(),se=(e,t,n)=>g?[]:e.getViolatedProperties(t,n),w=(e,t=[...te])=>({...e,violationOutDegrees:t}),T=()=>({...b(`success`),outDegrees:[...te],fingerprintDistance:Db(h.distinctStates,h.generatedStates,()=>E?E.getStoredFingerprints(A,Ee):BigInt64Array.from(A,h.getFingerprint))}),E=mx(o,m,()=>W_(t.source,t.loadModule),t.onProgress),D=()=>px(p.assumptions,m);if(!E){h.isStarted=!0;let e=D();return e?b(`assumption-violation`,e):(_.initialStates={generated:0,distinct:0},t.onProgress?.({kind:`initial-states-started`}),t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates}),T())}let ce=o.postconditions.length>0||o.possible.length>0,le=/* @__PURE__ */ new WeakMap,ue=e=>le.get(e)?.state??e.state,de=e=>{let t=le.get(e)?.action;return t?Sy(t):Ih(e.action)},fe=(e,t)=>{ce&&(h.counterExample=Lh(e.map(ue),e.slice(1).map(de),t));let n=E.findUnwitnessedPossible(),r=n?{result:void 0,lines:[]}:f(()=>E.findPostconditionViolation(!0));return{unwitnessed:n,postcondition:r.result,lines:r.lines}},pe=(e,t,n)=>{let r=t.loopStart,i=fe(t.trace,r===void 0||!n?void 0:{start:r,action:n()}),a=[...t.traceOutput??[],...i.lines];return b(e,{...t,...a.length>0&&{traceOutput:a},...i.unwitnessed&&{unwitnessed:i.unwitnessed},...i.postcondition&&{postcondition:i.postcondition}})},me=E.spec,he=E.getFingerprintState,O={value:void 0},ge=()=>O.value??=Hy(o,m,p.instanceActions),_e=e=>{let t=Uu(m),n=t.callStack;try{e(t);return}catch(e){return c(e)?{callStack:[],fingerprint:void 0}:!(e instanceof y)||!n?void 0:{callStack:n.expressions,fingerprint:n.fingerprint}}},ve=(e,t)=>{if(typeof e!=`object`)return[];let n=t.get(e),r=Xr(e).find(e=>Yr(e)!==void 0);return[...n?[n]:[],...r===void 0?[]:ve(r,t)]},ye=(e,t)=>{for(let n of he(e)){let e=Yr(n);if(!e)continue;let r=t?ve(n,t.sources):[];throw t&&r.length>0&&(t.expressions.length=0,t.isFrozen=!0,t.fingerprint={sources:r,reason:e.message}),e}e.forEach(en)},be=()=>{let e=tt.fingerprint?[tt.fingerprint]:[];return(t,n)=>{ye(t,n);let r=he(t);return Qe(Je(r),r)!==-1||e.some(e=>Xe(e,r))?!1:(e.push(r),h.distinctStates++,!0)}},xe=()=>{let e={count:0},t=[],n=be();return _e(r=>{if($s(Vy(o,m,p.instanceActions),r,i=>{if(zb(e.count,e=>u.lines?.push(e)),e.count++,h.generatedStates=e.count,!(t.length>0))try{let e=E.checkReplayedInitialState(i,r,()=>{n(i,r.callStack)&&(h.queueSize++,k?.addInitialState(A.length,i,r))});if(e){let t=Ie([{action:void 0,state:i}],[]).trace[0].state;throw u.lines?.push({kind:`initial-state-violation`,...e,state:t}),gx}}catch(e){if(!(e instanceof y)||!r.callStack?.fingerprint)throw e;t.push(e)}}),t.length>0)throw t[0]})},Se=e=>_e(t=>{let n=A[e],r=i&&ot(n,ke[e]),a=be();ec(ge(),n,t,(o,s)=>{if(!E.checkReplayedSuccessor(n,o,t,()=>{let n=a(o,t.callStack);return r&&i?.writeSuccessor(r,ot(o,ke[e]+1),!n,N?{name:s.name,signature:Gy(s)}:void 0),n}))throw gx})}),Ce=o.view!==void 0||o.symmetry!==void 0,we=[];E.properties.liveness.length>0&&t.onProgress?.({kind:`liveness-initializing`,isSymmetric:E.isSymmetric,isConstrained:E.isConstrained});let k=a(()=>Dx(()=>vy(E.properties.liveness,me.temporals,m,{getFingerprint:({index:e,state:t})=>we[e]??=Number(BigInt.asIntN(32,h.getFingerprint(t))),getSuccessors:(e,t)=>{let n=[];if(me.next===void 0)return n;let r=M.livenessSource;return M.livenessSource=e,Kc(me.next,t,m,e=>{if(je(e.state),!(E.satisfiesConstraints(e.state,t)&&E.satisfiesActionConstraints(t,e.state)))return!1;let r=he(e.state),i=Qe(Je(r),r);return n.push({index:i,state:e.state}),!1},me.scope),M.livenessSource=r,n}})));h.isStarted=!0;let Te=E.isSymmetric||k!==void 0,A=[],Ee=[],De=[],Oe=[],ke=[],Ae={slots:new Int32Array(1<<17),size:0,shift:16},je=_i(),Me=e=>Object.fromEntries(E.getTlcOrder().map(t=>[m.variables[t],e[t]])),Ne=(e,t,n,r)=>(h.getLevel=()=>n+1,h.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Pe(e,t[n].state,(t[n+1]??t[r??n]).state)),Pe=(e,n,r)=>{try{let t=Lb(`alias`,e,m).body,i=W(Nb(e),ax(m,n,r)),a=t.kind===`Record`?t.fields.map(e=>e.name):[];return Hb(i,a)??Me(n)}catch(e){if(!(e instanceof v||e instanceof y))throw e;return{...Me(n),_ALIASEvalError:Ca(e.message,t.isTool??!1)}}},Fe=(e,t,n,r)=>{let i=ge(),a={...M};Object.assign(M,{index:e,isExpanding:!0,candidate:void 0});let o=r?e=>e:he,s=o(n),c=i.find(e=>qc(e.expression,t,m,e.scope).some(e=>Xe(o(e.state),s)));return Object.assign(M,a),c},Ie=(e,n,r={})=>{let i=o.alias,a=r.known??1,s=e.length>1?f(Le).lines:[],c=e.map((t,r)=>r===0||t.action===`Stuttering`?{result:void 0,lines:[]}:f(()=>Fe(n[r-1],e[r-1].state,t.state,a===2&&r===e.length-1))),l=c.map(e=>e.lines),u=r.loopStart,d=g&&u!==void 0?u+1:e.length-a,p=d>0?[s,...l.slice(1,d)].flat():[];return{trace:e.map((n,r)=>{let a=c[r].result,o={action:n.action,label:a&&Wy(a,t.version),state:i===void 0?Me(n.state):Ne(i,e,r,u),output:r===0?p:r<d?[]:l[r]};return(i!==void 0||a)&&le.set(o,{state:Me(n.state),action:a}),o}),traceOutput:a>0&&!g?[s,...l].flat():[]}},Le=()=>me.init===void 0?[]:Gc(me.init,m,me.scope),j=(e,t)=>f(()=>{for(let n of ge()){let r=qc(n.expression,e,m,n.scope).find(t);if(r)return{...r,action:r.action??n.name}}}).result,Re=(e,t)=>Xe(he(e),Ee[t]),ze=(e,t)=>j(e,e=>Re(e.state,t)),Be=(e,t)=>{let n=f(()=>Ce||Du(m)?Le().find(t=>Re(t,e[0])):A[e[0]]).result;if(!n)throw new y(jb);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=ze(i,e[n]);if(!a)throw new y(t);r.push(a)}return r},Ve=(e,t)=>{let n=[];for(let t=e;t!==-1;t=De[t])n.unshift(t);let r=Ce&&n.length>1?Be(n,jb):n.map(e=>({state:A[e],action:Oe[e]}));if(!t)return Ie(r,n);let i=Ce?j(A[e],e=>Xe(e.state,t.state))?.action:t.action;return Ie([...r,{state:t.state,action:i}],n,{known:2})},He=e=>De[e]===-1?{trace:[{action:void 0,label:void 0,state:Me(A[e])}],traceOutput:g?[]:f(Le).lines}:Ve(e),Ue=(e,t)=>({trace:Ve(e,t).trace}),We=(t,n)=>n.isInitial&&!n.callStack&&!n.fingerprint&&g?e.success:n.callStack?n.isCallStackFirst?oe(t):n.isLiveCallStack?r(t)??(t instanceof S?t.exitCode:e.error):n.isInitial||n.fingerprint?e.specEvaluationFailure:yx(t):n.isInitial?vx(t):oe(t),Ge=(e,t,n={})=>{let r=c(e)?new x:e;if(!(r instanceof y))throw r;let i=t.trace.length>0&&!n.traceFailure?fe(t.trace,void 0):void 0,a=i?.unwitnessed??i?.postcondition,o=[...t.traceOutput??[],...i?.lines??[]];return{...b(`error`,void 0,{...Ax(r,n.isNextState??!1),...t,...o.length>0&&{traceOutput:o},...a&&{postcondition:a},initialState:n.initialState&&!(r instanceof S)?Me(n.initialState):void 0,exitCode:We(r,n),callStack:n.callStack,...n.isCallStackFirst&&{isCallStackFirst:!0},...n.fingerprint&&{fingerprint:n.fingerprint},...n.traceFailure&&{traceFailure:n.traceFailure}}),outDegrees:n.outDegrees}},Ke=(n,r)=>{h.generatedStates++;let i=ge(),a=i.length===1?i[0]:i.find(e=>e.name===r.action),o=r.variables,s=i.length===1?`the next-state action`:`action ${r.action} of the next-state relation`,c=g?`assigned`:`defined`,l=`Successor state is not completely specified by ${s}. The following variable${o.length>1?`s are`:` is`} not ${c}: ${o.join(`, `)}.\n`,u=Vt(`null`),d=r.state.map(e=>e??u),f=Ge(r,He(n));return w({...f,failure:f.failure&&{...f.failure,code:ua.incompleteSuccessor,message:l,toolMessage:l,exitCode:e.specEvaluationFailure,trace:[...f.failure.trace,{action:r.action,label:a&&Wy(a,t.version),state:Me(d)}]}})},qe=(e,t)=>{let n=Be(e,Mb),r=n[n.length-1].state;if(Ce&&t!==void 0&&t!==e.length-1&&ze(r,e[t])===void 0)throw new y(Mb);return n},Je=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Hr(t,Zr(e[n]));return t&1073741823},Ye=e=>{for(let t of e){let e=Yr(t);if(e)throw e}},Xe=(e,t)=>{for(let n=0;n<t.length;n++)if(!an(e[n],t[n]))return!1;return!0},Ze=e=>Math.imul(e,2654435761)>>>Ae.shift<<1,Qe=(e,t)=>{let n=Ae.slots.length-1;for(let r=Ze(e);;r=r+2&n){let n=Ae.slots[r+1];if(n===0)return-1;if(Ae.slots[r]===e&&Xe(Ee[n-1],t))return n-1}},$e=(e,t)=>{let n=Ae.slots.length-1,r=Ze(e);for(;Ae.slots[r+1]!==0;)r=r+2&n;Ae.slots[r]=e,Ae.slots[r+1]=t},et=(e,t)=>{if(Ae.size++,Ae.size*4>Ae.slots.length){let e=Ae.slots;Ae.slots=new Int32Array(e.length*2),Ae.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&$e(e[t],e[t+1])}$e(e,t+1)},tt={fingerprint:void 0},nt=e=>{h.distinctStates=A.length+1,_.depth=Math.max(_.depth,e),h.diameter=Math.max(h.diameter,e)},rt=(e,t,n,r)=>{let i=n===-1?1:ke[n]+1;A.push(e),Ee.push(t),De.push(n),Oe.push(r),ke.push(i)},M={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},it=e=>e===-1?[]:[...it(De[e]),A[e]];h.isSeen=e=>{let t=he(e);return Qe(Je(t),t)!==-1},h.getBehavior=e=>{let t=e===M.candidate?-1:A.indexOf(e);return t===-1?[...it(M.index),e]:it(t)},h.getCurrentState=()=>M.index===-1?void 0:A[M.index],h.setLivenessSource=e=>{M.livenessSource=e??-1},h.getLevel=e=>{let t=M.livenessSource;if(g){let e=t===-1?M.isExpanding?M.index:-1:t;return e===-1?0:ke[e]}return t===-1?e===M.candidate?M.candidateLevel:M.index===-1?0:e===A[M.index]?ke[M.index]:M.isExpanding?ke[M.index]+1:0:e===A[t]?ke[t]:ke[t]+1};let ot=(e,t)=>({fingerprint:BigInt.asIntN(64,h.getFingerprint(e)),level:t,getLabel:()=>hi(o.alias===void 0?Me(e):Pe(o.alias,e,void 0)),getText:()=>hi(Me(e))}),st=e=>{je(e),h.generatedStates++,h.initialStates++,M.candidate=e,M.candidateLevel=1;let t=he(e),n=Je(t),r=E.satisfiesConstraints(e);if(r&&(E.trackStatePossible(e),Ye(t),e.forEach(en)),r&&Qe(n,t)!==-1)return;tt.fingerprint=r?t:void 0,r&&(nt(1),h.queueSize++,k?.addInitialState(A.length,e),i?.writeInitialState(ot(e,1)));let a=E.findViolatedInvariant(e);if(a)return pe(`invariant-violation`,{name:a.name,...Ie([{action:void 0,state:e}],[])});let o=E.findFailedInitialPredicate(e);if(o)return pe(`liveness-violation`,{name:o.name,...Ie([{action:void 0,state:e}],[])});r&&(et(n,A.length),rt(e,t,-1,void 0))},ct=(e,t,n,r,a)=>{let o=A[e];h.generatedStates++,M.candidate=t.state,M.candidateLevel=ke[e]+1,Te&&je(t.state);let s=he(t.state),l=Je(s),u=Qe(l,s),d=E.satisfiesConstraints(t.state,o);d&&E.trackStatePossible(t.state);let p=d&&E.satisfiesActionConstraints(o,t.state);p&&(E.trackActionPossible(o,t.state),Ye(s),t.state.forEach(en));let m=p?u:-1;if(r&&p&&i?.writeSuccessor(r,ot(t.state,ke[e]+1),m!==-1,a&&{name:a.name,signature:Gy(a)}),m!==-1&&k){let e=A[m],r=e.every((e,n)=>e===t.state[n]);n.push({index:m,state:r?e:t.state})}let g=p&&m===-1;if(g&&k&&n.push({index:A.length,state:t.state}),tt.fingerprint=g?s:void 0,g&&(nt(ke[e]+1),re.newStates++),m===-1)try{let n=E.findViolatedInvariant(t.state,o);if(n)return w(pe(`invariant-violation`,{name:n.name,...Ve(e,t)}))}catch(n){if(c(n))throw n;let r=f(()=>Se(e));return Ge(n,kb(Ue(e,t),r.lines),r.result??{outDegrees:ae()})}let _=E.findViolatedActionProperty(o,t.state);if(_)return w(pe(`liveness-violation`,{name:_.name,...Ve(e,t)}));g&&(Te||je(t.state),et(l,A.length),rt(t.state,s,e,t.action),h.queueSize++)},lt={result:void 0};k&&t.onProgress?.({kind:`liveness-prepared`,branches:k.branches});let ut=D();if(ut)return b(`assumption-violation`,ut);if(t.onProgress?.({kind:`initial-states-started`}),me.init!==void 0)try{Wc(me.init,m,e=>{zb(h.initialStates,t.onProgress);try{lt.result=st(e)}catch(t){let n=f(xe);lt.result=Ge(t,{trace:[],traceOutput:n.lines},{initialState:e,...n.result,isInitial:!0})}return lt.result!==void 0},me.scope)}catch(e){if(e instanceof ne){let t=Ge(e,{trace:[]},{initialState:e.state.map(e=>e??Vt(`null`))});return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}let t=f(xe);return Ge(e,{trace:[],traceOutput:t.lines},{...t.result,isInitial:!0})}if(lt.result)return lt.result;_.initialStates={generated:h.initialStates,distinct:h.distinctStates},t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates});let dt=me.next;if(dt===void 0){if(A.length>0)throw new y(`No next state actions defined to generate successor states from.`);return T()}let N=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),ft=(e,t)=>{if(!N)return Kc(dt,e,m,e=>t(e,void 0),me.scope);let n={isStopped:!1};return ge().reduce((r,i)=>n.isStopped?r:r+Kc(i.expression,e,m,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},P=(e,t)=>{if(!k||g)return;let n=_e(n=>k.addState(e,A[e],t,n));return n?.callStack.length&&!n.fingerprint?n.callStack:void 0},F=(e,t)=>{try{k?.addState(e,A[e],t);return}catch(n){if(!(n instanceof y))throw n;return P(e,t)}},pt=(e,t)=>{let n=f(()=>F(e,t));if(n.result)return{result:{callStack:n.result,fingerprint:void 0,isLiveCallStack:!0},lines:n.lines};let r=f(()=>Se(e));return{result:r.result,lines:[...n.lines,...r.lines]}},mt=e=>Ge(Mx(),He(e)),ht=(e,t,n)=>{if(c(e))return mt(t);let r=pt(t,n);return Ge(hx(e),kb(He(t),r.lines),{isNextState:!0,...r.result})},gt=(t,r)=>{let a=A[t],l=i&&ot(a,ke[t]),u=ft(a,(e,n)=>{try{lt.result=ct(t,e,r,l,n)}catch(n){if(c(n))return lt.result=mt(t),!0;let i=g?f(()=>Se(t)):pt(t,r);if(g&&n instanceof y&&!bx.has(n))return lt.result=Ge(new y(`${Ex(n)}${n.message}`,n),kb({trace:[]},i.lines),{isNextState:!0,...i.result}),!0;let a=he(e.state).some(e=>Yr(e)!==void 0)&&n instanceof y?Ax(ba(n)?new y(`${Tx}${n.message}`):n,!0):void 0;lt.result=Ge(n,kb(a?He(t):Ue(t,e),i.lines),{isNextState:!0,...i.result,traceFailure:a})}return lt.result!==void 0});M.isExpanding=!1;let d=lt.result;if(d?.violation&&!g){let e=f(()=>F(t,r));return{...d,violation:kb(d.violation,e.lines),...e.result&&{liveCallStack:e.result}}}if(d)return d;let p=()=>{k&&l&&g&&i?.writeStuttering(l);let e=k?.addState(t,a,r);if(!k||!e)return;let n=qe(e),o=se(k,n.map(e=>e.state),n.length-1);return pe(`property-violation`,{name:o[0],properties:o,...Ie(n,e,{known:0})})};if(u===0&&o.checkDeadlock){let e=pe(`deadlock`,{name:`deadlock`,...He(t)}),n=f(()=>{try{return{additional:p()?.violation}}catch(e){if(!(e instanceof y))throw e;return{isFailed:!0,callStack:P(t,r)}}}),i=e.violation?{...e,violation:kb(e.violation,n.lines)}:e,a=w(i,n.result.isFailed?ae():C());return n.result.additional?{...a,additionalViolation:n.result.additional}:n.result.callStack?{...a,liveCallStack:n.result.callStack}:a}try{return p()}catch(i){if(g&&i instanceof y){let t=new y(`${ba(i)?Tx:s}${i.message}`);return Ge(n(t,e.error),{trace:[]},{outDegrees:ae()})}let o=_e(e=>k?.addState(t,a,r,e));return Ge(i,He(t),{outDegrees:ae(),callStack:o?.callStack.length?o.callStack:void 0,isNextState:!0,isCallStackFirst:!0})}},_t=()=>{let e=o.specification,t=`(compare Chapter 8, page 87ff of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`;if(e===void 0)return{code:ua.noSpecificationButProperty,text:`The stuttering counterexample above may be caused by the absence of a behavior specification (SPECIFICATION). Only INIT and NEXT have been provided, so TLC permits infinite stuttering. To rule out such counterexamples, use SPECIFICATION Spec, with Spec asserting a suitable fairness constraint ${t}`};let n=_l(e,m)?.location.range;if(!(me.temporals.length>0||!n))return{code:ua.noFairnessButProperty,text:`The stuttering counterexample above may be caused by the absence of a fairness constraint in the behavior specification ${e} defined at ${$c(n)}. To rule out such counterexamples, conjoin a suitable fairness constraint to ${e} ${t}`}},vt=(e,n)=>{let r=[...n.prefix,...n.cycle],i=n.prefix.length,a=qe(r,i),o=Ie(a,r,{loopStart:i,known:0}).trace,s=se(e,a.map(e=>e.state),i),c=r[i],l=r[r.length-1],u=a[a.length-1].state,d=c===l?{result:void 0,lines:[]}:f(()=>Fe(l,u,A[c],!1)),p=c===l&&n.isCycleConstrained;return pe(`liveness-violation`,{name:s[0],properties:s,trace:o,traceOutput:d.lines,loopStart:i,loopLabel:d.result&&Wy(d.result,t.version),warning:p?_t():void 0},()=>c===l?de(o[o.length-1]):d.result?Sy(d.result):Ih(ze(u,c)?.action))},yt=k!==void 0&&t.livenessCheck!==`final`,bt=performance.now(),xt={at:bt+3e3,size:1,time:0},St=e=>{let n=performance.now();if(!((e-xt.size)/xt.size>.1)||xt.time>(n-bt)*.2||(xt.size=e,!k))return;t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!1,states:e,statistics:b(`success`)});let r=k.findViolation();return r||t.onProgress?.({kind:`liveness-finished`}),xt.time+=performance.now()-n,r};for(let e=0;e<A.length&&!h.isStopped;e++){M.index=e,M.candidate=void 0,h.queueSize=A.length-e-1,M.isExpanding=!0;let n=[];try{lt.result=gt(e,n)}catch(t){lt.result=t instanceof ee?Ke(e,t):ht(t,e,n)}if(lt.result)return lt.result;if(te[ie()]++,re.newStates=0,(yt||t.onProgress)&&performance.now()>=xt.at){xt.at=performance.now()+6e4;let n=yt?St(e+1):void 0;if(k&&n)return vt(k,n);t.onProgress?.({kind:`progress`,statistics:b(`success`)})}}M.index=-1,M.candidate=void 0,k&&t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!0,states:h.distinctStates,statistics:b(`success`)});let Ct=k?.findViolation();if(k&&Ct)return vt(k,Ct);k&&t.onProgress?.({kind:`liveness-finished`});try{let e=E.findPostconditionViolation();if(e)return b(`postcondition-violation`,{name:e.name,message:e.message,counts:e.counts,trace:[],postcondition:e})}catch(e){return Ge(e,{trace:[]})}return T()},Px=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Fx=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Zr(e[t]),16777619),r=Math.imul(r^ii(e[t]),1540483477);t[0]=Px(n)||1,t[1]=Px(r)},Ix=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},Lx=(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}},Rx=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),zx=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Lx(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Bx=e=>Atomics.load(e.used,0)*2>=e.slots.length,Vx=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Lx(t,n);return{slots:t,used:e.used}},Hx=[void 0,`lambda`,`tuple`,`record`],Ux=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=Lr(e.domain);return t?(r(7),r(Hx.indexOf(Kt(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Hx.indexOf(Kt(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},Wx=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Vt(t.strings[n[r.index++]]);if(e===5)return Ht(i(n[r.index++]));let a=Hx[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=Zn({kind:`Interval`,low:e,high:e+t-1});return Gt(Ut(o,i(t)),a)}let o=n[r.index++],s=i(o);return Gt(Ut(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Be as $,hp as A,Ca as B,Mm as C,Up as D,Vp as E,qc as F,_i as G,Ta as H,ua as I,jt as J,hi as K,da as L,el as M,Du as N,Gp as O,Gc as P,Ye as Q,pa as R,W_ as S,Nm as T,ya as U,Ea as V,vi as W,kt as X,Dt as Y,at as Z,bb as _,o as _t,Vx as a,v as at,H_ as b,Fx as c,ae as ct,px as d,d as dt,xe as et,zb as f,u as ft,Db as g,oe as gt,Eb as h,s as ht,Rx as i,w as it,Vd as j,Wp as k,jx as l,f as lt,wb as m,ie as mt,Ux as n,T as nt,zx as o,l as ot,Bb as p,C as pt,z as q,Ix as r,se as rt,Bx as s,y as st,Wx as t,Ce as tt,mx as u,re as ut,Ob as v,e as vt,jm as w,G_ as x,av as y,n as yt,Sa as z};
1768
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw i(new v(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),m.safetyEvaluationFailure)}return[{name:e,expression:xy(e),scope:void 0}]})},Ay=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Ay(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Tl(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Ay(n.body,t)}return[e]},jy=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Yv(r,e.scope,t)>0)return!1;let i=H(r,Ky(t,void 0,void 0,e.scope));if(i===!1)throw new v(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new v(`The operator ${r.name}, which equals ${L(i)},\ncannot be used as a ${n}`);return!0},My=(e,t)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return Ty(n,e,t),xy(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[]}}if(e.init!==void 0||e.next!==void 0)throw new v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let n=[],r=[],a=[],o=Cy(`name`,e.specification,t),s=wy(e.specification,o,t);if(s!==void 0)throw new v(`The value of ${e.specification} is equal to ${L(s)}`);if(Qv(o.body,void 0,t,!1).forEach(o=>{let s=o.expression;if(jy(o,t,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw i(new v(`TLC does not support temporal existential, nor universal, quantification over state variables.`),m.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){r.push({expression:s.expression.action,scope:o.scope});return}if(s.kind===`Always`&&Yv(s.expression,o.scope,t)<2)throw i(new h(`TLC cannot handle the temporal formula ${al(s.expression)}`),m.error);let c=Yv(s,o.scope,t);if(c===3)a.push(o);else{if(c===2)throw new v(`TLC cannot handle the action-level conjunct of the specification ${e.specification}`);n.push(o)}}),r.length>1)throw new v(`The specification ${e.specification} must contain at most one [][Next]_vars`);let c=[...n,...r],l=e=>`$specification${e}`,u=c.reduce((e,t,n)=>t.scope===void 0?e:{name:l(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),d=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:l(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:n.length===0?void 0:{kind:`And`,operands:n.map(d),location:by},next:r.length===0?void 0:d(r[0],n.length),scope:u,temporals:a}},Ny=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=Ey(`property`,e,t);if(!i)return;Yv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Qv(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(jy(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&Yv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!O(e)?Tl(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=Yv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new v(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},Py=(e,t,n)=>t.flatMap(t=>Ey(e,t,n)?[{name:t,expression:xy(t),scope:void 0}]:[]),Fy=(e,t)=>{let n=Tl(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Iy=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);Ty(`possible`,n,t);let i=xy(n);if(Yv(i,void 0,t)===3)throw new v(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Ly=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||O(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Ry=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Tl(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},zy=(e,t)=>e.flatMap(e=>Ay(e.expression,t).map(n=>{let r=e.scope===void 0?Aa(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Ly(n,r,t),predicate:Ry(e.expression,t)}})),By=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},Vy=/[\u0100-\uffff]/,Hy=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Uy=e=>e.kind===`String`?Vy.test(e.value):e.kind===`Set`&&e.elements.some(Uy),Wy=e=>e.kind===`String`&&Vy.test(e.value)||e.kind===`Apply`&&Hy.has(e.operator)||Ue(e).some(Wy),Gy=(e,t)=>e.constants.some(e=>Uy(e.value)||(e.args??[]).some(Uy))||[...t.definitions.values()].some(e=>Wy(e.body)||e.kind===`Function`&&e.bounds.some(e=>Wy(e.set))),Ky=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),qy=(e,t,n)=>wl(H(e,t),n),Jy=(e,t,n=Yy)=>{let r=H(e,t);if(typeof r!=`boolean`)throw new h(n(e,t.environment));return r},Yy=(e,t)=>{let n=e.kind===`Identifier`?Tl(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?il(i):ol(r)}`},Xy=(e,t)=>Jy(e.expression,t,(n,r)=>(Jy(e.predicate,t),Yy(n,r))),Zy=()=>{},Qy=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=qy(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),$y=(e,t,n)=>{try{return qy(e,Ky(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof h)return{message:e.message};throw e}},eb=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=$y(n.expression,t,`an assumption`);if(e)return{name:al(n.expression),trace:[],message:e.message}}},tb=(e,t,n,r)=>{let a=ky(e.invariants,t),o=My(e,t),s=Ny(e,t,r),c=zy([...a,...s.invariants],t),u=[...new Map(c.map(e=>[e.predicate,e])).values()],d=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(d||s.initialPredicates.length>0||t.variables.length>0))throw new v(t.runtime.version===`1.7.4`?ia:`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&d)throw new v(`The configuration file did not specify the next state predicate.`);let f=zy(Py(`constraint`,e.constraints,t),t),p=Py(`action constraint`,e.actionConstraints,t);e.rlReward!==void 0&&Cy(`rlreward`,e.rlReward,t),e.periodic!==void 0&&Cy(`periodic`,e.periodic,t);let ee=Iy(e.possible,t);if(t.variables.length===0)return;let te=e.symmetry===void 0?void 0:ly(e.symmetry,t,e.substitutions);e.view!==void 0&&Cy(`view function`,e.view,t);let g=e.view===void 0?void 0:{name:e.view,expression:xy(e.view),scope:void 0},_=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:by};return{...e,unchanged:t}}),y=e=>Yv(e.expression,void 0,t)>=2,ne=ee.filter(e=>!y(e)),re=ee.filter(y),ie=t.runtime,ae={indices:void 0},oe=()=>{if(ae.indices)return ae.indices;let e=n(),r=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return ae.indices=t.variables.map((e,t)=>t).sort((e,t)=>r(e)-r(t)),ae.indices},se=(e,n)=>H(e,Ky(t,n,void 0)),ce=e=>{let t=oe(),n=te===void 0?e:yy(e,te,t);return dm(g===void 0?t.map(e=>n[e]):[se(g.expression,n)])},le=Gy(e,t);ie.getFingerprint=ce;let ue=()=>{let e=ee.find(e=>!ie.possibleCounts.get(e.name));if(!e)return;let n=Fy(e.name,t),r=n?` at ${il(n)}`:``;return{name:e.name,code:ea.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:k(L(Im(ie),!0))}};return{properties:s,spec:o,isSymmetric:te!==void 0,isConstrained:f.length>0||p.length>0,getTlcOrder:oe,getStoredFingerprints:(e,t)=>{if(g!==void 0||le)return BigInt64Array.from(e,ce);let n=new BigInt64Array(t.length),r=mm(oe(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(le)return[String(ce(e))];let t=te===void 0?e:yy(e,te,oe());return g===void 0?t:[se(g.expression,t)]},findViolatedInvariant:(e,n)=>c.find(r=>{if(By(r,e,n))return!1;try{let i=Ky(t,e,void 0,r.scope),a=r.membership;return n&&a?!xr(e[a.variable],n[a.variable],H(a.set,i)):!Xy(r,i)}catch(e){throw n?va(i(e,m.safetyEvaluationFailure),ea.invariantEvaluationFailed,`Evaluating invariant ${r.name} failed.`):e}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Jy(n,Ky(t,e,void 0,r));f.every(e=>r(e.predicate,e.scope))&&n();let i=u.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=s.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(f.every(e=>Jy(e.predicate,Ky(n,t,void 0,e.scope)))&&p.every(r=>Jy(r.expression,Ky(n,e,t,r.scope))))||r())||u.every(e=>Jy(e.predicate,Ky(n,t,void 0,e.scope))))&&_.every(r=>Jy(r.box,Ky(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>f.every(r=>By(r,e,n)||Xy(r,Ky(t,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(n=>!Jy(n.expression,Ky(t,e,void 0,n.scope))),findViolatedActionProperty:(e,n)=>_.find(r=>{try{return!Jy(r.action,Ky(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${al(r.box)}`)&&!qy(r.unchanged,Ky(t,e,n,r.scope),`a subscript`)}catch(e){throw va(nb(e),ea.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,n)=>p.every(r=>Jy(r.expression,Ky(t,e,n),e=>`${l}${Yy(e,t)}`)),trackStatePossible:ne.length===0?Zy:e=>Qy(ne,ie,Ky(t,e,void 0)),trackActionPossible:re.length===0?Zy:(e,n)=>Qy(re,ie,Ky(t,e,n)),findUnwitnessedPossible:ue,findPostconditionViolation:(n=!1)=>{let r=e.postconditions.find(e=>{let n=Tl(e,t);return n!==void 0&&t.definitionValues.has(n)});if(r!==void 0){if(n)return;throw i(new h(`${l}The post condition ${r} cannot be a constant.`),m.error)}let a=ue();if(a)return a;for(let n of e.postconditions){let e=$y(xy(n),t,`a postcondition`);if(!e)continue;let r=Fy(n,t),i=r?` at ${il(r)}`:``;return e.message===void 0?{name:n,code:ea.postconditionFalse,message:`Postcondition ${n}${i} is false.`}:{name:n,code:ea.postconditionFailed,message:`Evaluating postcondition ${n}${i} failed.\n${e.message}`}}}}},nb=e=>e instanceof p?i(e,e.exitCode):e,rb=(e,t)=>e*((t-e)/2**64),ib=e=>e.includes(`.`)?e:`${e}.0`,ab=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return ib(String(e));let[n,r]=e.toExponential().split(`e`);return`${ib(n)}E${r.replace(`+`,``)}`},ob=e=>e!==void 0&&e>=`0`&&e<=`9`,sb=e=>{if(e===0)return`0.0`;let t=ab(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;ob(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;ob(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;ob(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(ob(t[n.next])&&Number(t[n.next])>=5&&(n.result=cb(n.result));ob(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},cb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${cb(r)}.`:n===`9`?`${cb(r)}0`:`${r}${Number(n)+1}`},lb=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},ub=(e,t,n)=>{if(rb(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},db=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},fb=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},pb=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Ur(e[t]),16777619),r=Math.imul(r^Xr(e[t]),1540483477);t[0]=fb(n)||1,t[1]=fb(r)},mb=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},hb=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},gb=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),_b=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return hb(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},vb=e=>Atomics.load(e.used,0)*2>=e.slots.length,yb=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&hb(t,n);return{slots:t,used:e.used}},bb=[void 0,`lambda`,`tuple`,`record`],xb=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=kr(e.domain);return t?(r(7),r(bb.indexOf(Pt(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(bb.indexOf(Pt(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},Sb=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return kt(t.strings[n[r.index++]]);if(e===5)return At(i(n[r.index++]));let a=bb[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=zn({kind:`Interval`,low:e,high:e+t-1});return Nt(jt(o,i(t)),a)}let o=n[r.index++],s=i(o);return Nt(jt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{il as $,vv as A,Vn as At,dm as B,ht as Bt,ty as C,ya as Ct,pv as D,kt as Dt,ey as E,Jt as Et,Rh as F,yt as Ft,Cp as G,D as Gt,Zp as H,I as Ht,zh as I,Ur as It,Cu as J,b as Jt,Yd as K,He as Kt,Bm as L,j as Lt,ov as M,L as Mt,K_ as N,Vr as Nt,$ as O,Hn as Ot,G_ as P,Hr as Pt,Bl as Q,zm as R,Gt as Rt,Uv as S,ua as St,Yv as T,Pr as Tt,$p as U,Ue as Ut,Yp as V,_t as Vt,Qp as W,O as Wt,al as X,me as Xt,Qu as Y,S as Yt,H as Z,ge as Zt,Ty as _,ga as _t,yb as a,su as at,Oy as b,Da as bt,pb as c,Xc as ct,ub as d,ic as dt,Tl as et,rb as f,ea as ft,eb as g,pa as gt,tb as h,fa as ht,gb as i,vl as it,zv as j,si as jt,Hv as k,Tn as kt,sb as l,Qc as lt,xy as m,ra as mt,xb as n,kl as nt,_b as o,Yc as ot,db as p,ta as pt,Tu as q,Pe as qt,mb as r,Iu as rt,vb as s,Zc as st,Sb as t,Lu as tt,lb as u,rc as ut,Ky as v,ha as vt,ny as w,wa as wt,nb as x,Ca as xt,Dy as y,la as yt,Vm as z,Ht as zt};