tla-ts 0.0.9 → 0.0.10-dev.094b9b512

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 (622) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +40 -37
  5. package/dist/deciders.js +47 -44
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +106 -10
  8. package/dist/index.d.ts +106 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2658 -410
  15. package/dist/prove.js +2657 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +129 -104
  21. package/dist/transfer.js +129 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +48 -62
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +599 -754
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +208 -54
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +361 -0
  40. package/src/cli/tlc.ts +309 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +14 -53
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +169 -335
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +37 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +103 -153
  64. package/src/liveness.ts +150 -109
  65. package/src/obligations/action.ts +18 -43
  66. package/src/obligations/anonymize.ts +119 -90
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +2 -2
  69. package/src/obligations/expression.ts +38 -25
  70. package/src/obligations/format.ts +1 -9
  71. package/src/obligations/generate.ts +67 -63
  72. package/src/obligations/index.ts +38 -20
  73. package/src/obligations/levels.ts +28 -17
  74. package/src/obligations/module.ts +29 -54
  75. package/src/obligations/normalize.ts +31 -36
  76. package/src/obligations/operators.ts +1 -2
  77. package/src/obligations/pragma.ts +53 -25
  78. package/src/obligations/printer.ts +90 -57
  79. package/src/obligations/proof.ts +4 -5
  80. package/src/obligations/regroup.ts +1 -4
  81. package/src/obligations/simplify.ts +58 -62
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +51 -27
  84. package/src/obligations/substitution.ts +2 -4
  85. package/src/obligations/temporal.ts +13 -19
  86. package/src/obligations/tuples.ts +3 -9
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +57 -71
  89. package/src/parser.ts +961 -387
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +19 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -62
  101. package/src/prover/isabelle/isar/attrib.ts +219 -0
  102. package/src/prover/isabelle/isar/context.ts +336 -0
  103. package/src/prover/isabelle/isar/induct.ts +392 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +513 -225
  106. package/src/prover/isabelle/isar/proof.ts +569 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +234 -0
  108. package/src/prover/isabelle/isar/theory.ts +490 -89
  109. package/src/prover/isabelle/isar/toplevel.ts +341 -0
  110. package/src/prover/isabelle/isar/type-check.ts +100 -37
  111. package/src/prover/isabelle/provers/blast/blast.ts +17 -104
  112. package/src/prover/isabelle/provers/blast/branch.ts +1 -32
  113. package/src/prover/isabelle/provers/blast/prove.ts +1 -35
  114. package/src/prover/isabelle/provers/blast/rules.ts +6 -44
  115. package/src/prover/isabelle/provers/blast/state.ts +2 -28
  116. package/src/prover/isabelle/provers/blast/term.ts +9 -36
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -13
  118. package/src/prover/isabelle/provers/classical.ts +59 -60
  119. package/src/prover/isabelle/provers/hypsubst.ts +28 -51
  120. package/src/prover/isabelle/pure/bicompose.ts +25 -38
  121. package/src/prover/isabelle/pure/consts.ts +1 -7
  122. package/src/prover/isabelle/pure/conv.ts +3 -17
  123. package/src/prover/isabelle/pure/drule.ts +96 -44
  124. package/src/prover/isabelle/pure/envir.ts +3 -52
  125. package/src/prover/isabelle/pure/goal.ts +2 -8
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +2 -15
  129. package/src/prover/isabelle/pure/name.ts +2 -9
  130. package/src/prover/isabelle/pure/net.ts +3 -59
  131. package/src/prover/isabelle/pure/object-logic.ts +16 -15
  132. package/src/prover/isabelle/pure/pattern.ts +2 -19
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +17 -62
  134. package/src/prover/isabelle/pure/rewriter.ts +32 -73
  135. package/src/prover/isabelle/pure/search.ts +3 -10
  136. package/src/prover/isabelle/pure/seq.ts +1 -10
  137. package/src/prover/isabelle/pure/simplifier.ts +28 -15
  138. package/src/prover/isabelle/pure/table.ts +3 -32
  139. package/src/prover/isabelle/pure/tactic.ts +12 -22
  140. package/src/prover/isabelle/pure/tactical.ts +48 -47
  141. package/src/prover/isabelle/pure/term-ord.ts +2 -6
  142. package/src/prover/isabelle/pure/term.ts +2 -43
  143. package/src/prover/isabelle/pure/thm.ts +27 -47
  144. package/src/prover/isabelle/pure/type.ts +2 -15
  145. package/src/prover/isabelle/pure/unify.ts +20 -30
  146. package/src/prover/isabelle/pure/variable.ts +3 -7
  147. package/src/prover/isabelle/tla/classical-setup.ts +18 -24
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +46 -43
  152. package/src/prover/isabelle/tools/intuitionistic.ts +29 -20
  153. package/src/prover/ocaml.ts +0 -6
  154. package/src/prover/prep/action.ts +32 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +0 -2
  159. package/src/prover/prep/methods.ts +137 -83
  160. package/src/prover/prep/normalize.ts +38 -36
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +371 -132
  163. package/src/prover/ptl/decide.ts +104 -44
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +61 -29
  170. package/src/prover/smt/data.ts +497 -387
  171. package/src/prover/smt/encode.ts +156 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1025 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +63 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +182 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +112 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -15
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +60 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +43 -0
  185. package/src/prover/smt/solver/aig.ts +890 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +613 -48
  187. package/src/prover/smt/solver/arith-terms.ts +123 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +176 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +312 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -57
  192. package/src/prover/smt/solver/ast-lt.ts +166 -21
  193. package/src/prover/smt/solver/ast-util.ts +161 -7
  194. package/src/prover/smt/solver/ast.ts +1466 -178
  195. package/src/prover/smt/solver/auf-solver.ts +8 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +591 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +874 -0
  198. package/src/prover/smt/solver/bound-manager.ts +186 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +602 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +500 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +339 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +97 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1905 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +224 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +175 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +545 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +534 -0
  208. package/src/prover/smt/solver/card2bv.ts +112 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +1 -9
  210. package/src/prover/smt/solver/cg-table.ts +28 -34
  211. package/src/prover/smt/solver/check-logic.ts +326 -0
  212. package/src/prover/smt/solver/clause.ts +1 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +280 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +79 -12
  215. package/src/prover/smt/solver/context.ts +510 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +34 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +124 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +575 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +83 -0
  220. package/src/prover/smt/solver/demodulator.ts +789 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +68 -0
  222. package/src/prover/smt/solver/der.ts +40 -30
  223. package/src/prover/smt/solver/diff-neq.ts +207 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +67 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +513 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +267 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +1 -11
  228. package/src/prover/smt/solver/e-matching.ts +4 -35
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +130 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +558 -0
  231. package/src/prover/smt/solver/enode.ts +93 -22
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +219 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +404 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +659 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +895 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +528 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +419 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +308 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +164 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +750 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +451 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +620 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +885 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1203 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +333 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1094 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +900 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +299 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +343 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +31 -0
  253. package/src/prover/smt/solver/expr-ref.ts +1 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -6
  255. package/src/prover/smt/solver/expr2polynomial.ts +147 -0
  256. package/src/prover/smt/solver/factor.ts +152 -0
  257. package/src/prover/smt/solver/fd-solver.ts +269 -0
  258. package/src/prover/smt/solver/fingerprints.ts +16 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +149 -0
  260. package/src/prover/smt/solver/flat-literals.ts +1 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +873 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +619 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +641 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2246 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +75 -0
  267. package/src/prover/smt/solver/goal.ts +177 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +191 -0
  269. package/src/prover/smt/solver/guard-set.ts +220 -0
  270. package/src/prover/smt/solver/hash.ts +0 -8
  271. package/src/prover/smt/solver/hashtable.ts +27 -23
  272. package/src/prover/smt/solver/inf-eps.ts +64 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +102 -0
  274. package/src/prover/smt/solver/internalizer.ts +72 -130
  275. package/src/prover/smt/solver/lackr.ts +383 -0
  276. package/src/prover/smt/solver/lbool.ts +1 -2
  277. package/src/prover/smt/solver/lia2card.ts +269 -0
  278. package/src/prover/smt/solver/lia2pb.ts +141 -0
  279. package/src/prover/smt/solver/literal.ts +0 -3
  280. package/src/prover/smt/solver/logic-tactics.ts +349 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +2 -8
  283. package/src/prover/smt/solver/lp/containers.ts +12 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +24 -27
  285. package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
  287. package/src/prover/smt/solver/lp/dependency.ts +1 -4
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +9 -102
  289. package/src/prover/smt/solver/lp/explanation.ts +1 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +9 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +11 -26
  293. package/src/prover/smt/solver/lp/int-cube.ts +18 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +4 -34
  295. package/src/prover/smt/solver/lp/lar-solver.ts +70 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +1 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +79 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
  300. package/src/prover/smt/solver/lp/nex.ts +1 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
  302. package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +69 -132
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +24 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +2 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +184 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +293 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +1 -11
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
  320. package/src/prover/smt/solver/lp/nra-solver.ts +30 -54
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +1 -8
  327. package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +6 -5
  329. package/src/prover/smt/solver/macro-finder.ts +533 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +117 -126
  331. package/src/prover/smt/solver/mam-interpreter.ts +1 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +29 -0
  333. package/src/prover/smt/solver/max-cliques.ts +107 -0
  334. package/src/prover/smt/solver/maxcore.ts +318 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +9 -20
  336. package/src/prover/smt/solver/maxlex.ts +123 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +99 -0
  338. package/src/prover/smt/solver/maxsmt.ts +93 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +477 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +102 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +280 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +49 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +280 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +624 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +845 -0
  346. package/src/prover/smt/solver/model-checker.ts +20 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +186 -39
  348. package/src/prover/smt/solver/model-finder.ts +15 -32
  349. package/src/prover/smt/solver/model-generator.ts +57 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +58 -111
  351. package/src/prover/smt/solver/model-printer.ts +215 -0
  352. package/src/prover/smt/solver/mpf.ts +712 -0
  353. package/src/prover/smt/solver/mus.ts +52 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +362 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +98 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +121 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +121 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +305 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +427 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +278 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +158 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +303 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +127 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +460 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-tactic.ts +192 -0
  367. package/src/prover/smt/solver/muz/rule-properties.ts +179 -0
  368. package/src/prover/smt/solver/muz/spacer-context.ts +1395 -0
  369. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +41 -0
  370. package/src/prover/smt/solver/muz/spacer-generalizers.ts +244 -0
  371. package/src/prover/smt/solver/muz/spacer-manager.ts +133 -0
  372. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  373. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +344 -0
  374. package/src/prover/smt/solver/muz/spacer-util.ts +309 -0
  375. package/src/prover/smt/solver/muz/substitution.ts +154 -0
  376. package/src/prover/smt/solver/nla2bv-tactic.ts +286 -0
  377. package/src/prover/smt/solver/nlqsat.ts +484 -0
  378. package/src/prover/smt/solver/nlsat/algebraic.ts +179 -159
  379. package/src/prover/smt/solver/nlsat/atoms.ts +25 -23
  380. package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
  381. package/src/prover/smt/solver/nlsat/explain.ts +61 -69
  382. package/src/prover/smt/solver/nlsat/interval-set.ts +10 -51
  383. package/src/prover/smt/solver/nlsat/levelwise.ts +49 -135
  384. package/src/prover/smt/solver/nlsat/mpbq.ts +48 -14
  385. package/src/prover/smt/solver/nlsat/polynomial.ts +30 -160
  386. package/src/prover/smt/solver/nlsat/solver.ts +227 -99
  387. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +311 -0
  388. package/src/prover/smt/solver/nlsat/transcendentals.ts +369 -0
  389. package/src/prover/smt/solver/nlsat/types.ts +1 -8
  390. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +2 -45
  391. package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
  392. package/src/prover/smt/solver/nlsat-tactic.ts +83 -0
  393. package/src/prover/smt/solver/nnf.ts +108 -60
  394. package/src/prover/smt/solver/normalize-bounds.ts +54 -0
  395. package/src/prover/smt/solver/occf.ts +98 -0
  396. package/src/prover/smt/solver/opt-context.ts +787 -0
  397. package/src/prover/smt/solver/opt-nlsat.ts +366 -0
  398. package/src/prover/smt/solver/opt-pareto.ts +284 -0
  399. package/src/prover/smt/solver/opt-preprocess.ts +102 -0
  400. package/src/prover/smt/solver/opt-solver.ts +300 -0
  401. package/src/prover/smt/solver/opt-value.ts +56 -0
  402. package/src/prover/smt/solver/optsmt.ts +691 -0
  403. package/src/prover/smt/solver/parallel-tactic.ts +301 -0
  404. package/src/prover/smt/solver/pattern-inference.ts +19 -23
  405. package/src/prover/smt/solver/pb-rewriter.ts +296 -0
  406. package/src/prover/smt/solver/pb2bv-tactic.ts +542 -0
  407. package/src/prover/smt/solver/poly-rewriter.ts +203 -77
  408. package/src/prover/smt/solver/probes.ts +514 -0
  409. package/src/prover/smt/solver/propagate-values.ts +34 -30
  410. package/src/prover/smt/solver/proto-model.ts +648 -63
  411. package/src/prover/smt/solver/pull-quant.ts +29 -23
  412. package/src/prover/smt/solver/purify-arith.ts +598 -0
  413. package/src/prover/smt/solver/qe-arith-plugin.ts +1099 -0
  414. package/src/prover/smt/solver/qe-lite-der.ts +3 -31
  415. package/src/prover/smt/solver/qe-lite-fm.ts +5 -28
  416. package/src/prover/smt/solver/qe-lite.ts +40 -49
  417. package/src/prover/smt/solver/qe-mbp.ts +281 -0
  418. package/src/prover/smt/solver/qe.ts +1508 -0
  419. package/src/prover/smt/solver/qel.ts +26 -0
  420. package/src/prover/smt/solver/qi-queue.ts +1 -16
  421. package/src/prover/smt/solver/qsat.ts +840 -0
  422. package/src/prover/smt/solver/quant-hoist.ts +195 -0
  423. package/src/prover/smt/solver/quant-tactics.ts +18 -74
  424. package/src/prover/smt/solver/quantifier-analyzer.ts +27 -47
  425. package/src/prover/smt/solver/quantifier-manager.ts +9 -23
  426. package/src/prover/smt/solver/quasi-macros.ts +254 -0
  427. package/src/prover/smt/solver/random-gen.ts +1 -2
  428. package/src/prover/smt/solver/rational.ts +29 -8
  429. package/src/prover/smt/solver/recfun-decl-plugin.ts +248 -0
  430. package/src/prover/smt/solver/recfun-rewriter.ts +108 -0
  431. package/src/prover/smt/solver/reduce-args.ts +226 -0
  432. package/src/prover/smt/solver/reduce-bv-size.ts +120 -0
  433. package/src/prover/smt/solver/ref-vector.ts +1 -6
  434. package/src/prover/smt/solver/relevancy.ts +3 -16
  435. package/src/prover/smt/solver/rewriter-tpl.ts +49 -129
  436. package/src/prover/smt/solver/rewriter.ts +478 -120
  437. package/src/prover/smt/solver/rlimit.ts +27 -21
  438. package/src/prover/smt/solver/sat/asymm-branch.ts +314 -0
  439. package/src/prover/smt/solver/sat/big.ts +178 -0
  440. package/src/prover/smt/solver/sat/clause-use-list.ts +79 -0
  441. package/src/prover/smt/solver/sat/clause.ts +221 -0
  442. package/src/prover/smt/solver/sat/cleaner.ts +96 -0
  443. package/src/prover/smt/solver/sat/config.ts +125 -0
  444. package/src/prover/smt/solver/sat/consequences.ts +204 -0
  445. package/src/prover/smt/solver/sat/elim-eqs.ts +144 -0
  446. package/src/prover/smt/solver/sat/goal2sat.ts +528 -0
  447. package/src/prover/smt/solver/sat/inc-sat-solver.ts +388 -0
  448. package/src/prover/smt/solver/sat/model-converter.ts +156 -0
  449. package/src/prover/smt/solver/sat/pb-constraint.ts +264 -0
  450. package/src/prover/smt/solver/sat/pb-solver.ts +1553 -0
  451. package/src/prover/smt/solver/sat/probing.ts +169 -0
  452. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  453. package/src/prover/smt/solver/sat/sat2goal.ts +171 -0
  454. package/src/prover/smt/solver/sat/scc.ts +143 -0
  455. package/src/prover/smt/solver/sat/simplifier.ts +1662 -0
  456. package/src/prover/smt/solver/sat/solver.ts +2128 -0
  457. package/src/prover/smt/solver/sat/var-queue.ts +119 -0
  458. package/src/prover/smt/solver/sat/watch-list.ts +136 -0
  459. package/src/prover/smt/solver/search-tree.ts +285 -0
  460. package/src/prover/smt/solver/seq-axioms.ts +1013 -0
  461. package/src/prover/smt/solver/seq-decl-plugin.ts +823 -0
  462. package/src/prover/smt/solver/seq-derive.ts +1303 -0
  463. package/src/prover/smt/solver/seq-eq-approx.ts +238 -0
  464. package/src/prover/smt/solver/seq-eq-solver.ts +440 -0
  465. package/src/prover/smt/solver/seq-factory.ts +91 -0
  466. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  467. package/src/prover/smt/solver/seq-range-predicate.ts +225 -0
  468. package/src/prover/smt/solver/seq-re-rewriter.ts +1296 -0
  469. package/src/prover/smt/solver/seq-re-util.ts +777 -0
  470. package/src/prover/smt/solver/seq-regex-bisim.ts +145 -0
  471. package/src/prover/smt/solver/seq-regex-live.ts +202 -0
  472. package/src/prover/smt/solver/seq-regex-witness.ts +100 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2407 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +318 -0
  475. package/src/prover/smt/solver/seq-subset.ts +166 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +355 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +299 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +85 -0
  479. package/src/prover/smt/solver/smt-logics.ts +67 -0
  480. package/src/prover/smt/solver/smt-setup.ts +492 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +767 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +2423 -270
  483. package/src/prover/smt/solver/smtlib-script.ts +1493 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +931 -0
  485. package/src/prover/smt/solver/solver.ts +120 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +319 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -5
  489. package/src/prover/smt/solver/tactic.ts +1936 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +206 -0
  491. package/src/prover/smt/solver/theory-array.ts +1275 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1239 -0
  493. package/src/prover/smt/solver/theory-char.ts +356 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +599 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +422 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +56 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -10
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +87 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +24 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +25 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +7 -27
  504. package/src/prover/smt/solver/theory-lra.ts +194 -8
  505. package/src/prover/smt/solver/theory-pb.ts +932 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +59 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +308 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +871 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1375 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +880 -0
  511. package/src/prover/smt/solver/theory-seq.ts +984 -0
  512. package/src/prover/smt/solver/theory.ts +175 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +487 -0
  514. package/src/prover/smt/solver/var-subst.ts +33 -35
  515. package/src/prover/smt/table.ts +1 -9
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -15
  535. package/src/prover/zenon/encode.ts +1 -8
  536. package/src/prover/zenon/eqrel.ts +2 -13
  537. package/src/prover/zenon/equality-rules.ts +0 -4
  538. package/src/prover/zenon/expr.ts +8 -26
  539. package/src/prover/zenon/index-table.ts +26 -57
  540. package/src/prover/zenon/isar-case.ts +9 -19
  541. package/src/prover/zenon/isar.ts +36 -64
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -20
  544. package/src/prover/zenon/mltoll.ts +66 -104
  545. package/src/prover/zenon/node.ts +20 -14
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +10 -12
  548. package/src/prover/zenon/phrase.ts +1 -11
  549. package/src/prover/zenon/proof.ts +0 -9
  550. package/src/prover/zenon/propositional-rules.ts +0 -5
  551. package/src/prover/zenon/rules.ts +2 -6
  552. package/src/prover/zenon/search.ts +11 -33
  553. package/src/prover/zenon/tla/functions.ts +59 -31
  554. package/src/prover/zenon/tla/llproof.ts +67 -76
  555. package/src/prover/zenon/tla/records.ts +57 -33
  556. package/src/prover/zenon/tla/rewrites.ts +12 -19
  557. package/src/prover/zenon/tla/sets.ts +88 -57
  558. package/src/prover/zenon/tla/terms.ts +0 -6
  559. package/src/prover/zenon/tla/tla.ts +66 -64
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -184
  562. package/src/runtime.ts +22 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +6 -34
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +1 -9
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +541 -163
  581. package/src/simulate.ts +709 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +0 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -31
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +266 -99
  589. package/src/symmetry.ts +33 -25
  590. package/src/tableau.ts +27 -24
  591. package/src/tlc/fingerprint.ts +183 -67
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +36 -47
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +139 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typescript/actions.ts +479 -0
  605. package/src/typescript/collections.ts +614 -0
  606. package/src/typescript/compile.ts +63 -0
  607. package/src/typescript/context.ts +94 -0
  608. package/src/typescript/emit.ts +121 -0
  609. package/src/typescript/expressions.ts +496 -0
  610. package/src/typescript/formula.ts +154 -0
  611. package/src/typescript/functions.ts +284 -0
  612. package/src/typescript/model.ts +162 -0
  613. package/src/typescript/names.ts +114 -0
  614. package/src/typescript/program.ts +48 -0
  615. package/src/typescript/properties.ts +139 -0
  616. package/src/typescript/scope.ts +112 -0
  617. package/src/typescript/steps.ts +167 -0
  618. package/src/typescript/types.ts +171 -0
  619. package/src/values.ts +832 -484
  620. package/src/worker.ts +7 -8
  621. package/src/prover/isabelle/isar/statement.ts +0 -57
  622. package/src/prover/tlaps-module.ts +0 -510
package/dist/run.cjs CHANGED
@@ -6,40 +6,153 @@
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=require("./tlapm.cjs"),t=require("./worker.cjs"),n=require("./transfer.cjs"),r=require("./prove.cjs");let i=require("node:path"),a=require("node:fs"),o=require("node:url"),s=require("node:os"),c=require("node:v8");const l=`META-INF/MANIFEST.MF`,u=async e=>{if(e===void 0||!(0,a.existsSync)(e))return`master`;let t=await import(`fflate`),n=t.unzipSync((0,a.readFileSync)(e),{filter:e=>e.name===l})[l];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},d=/[*?[{]/,f=e=>e.flatMap(e=>d.test(e)?(0,a.globSync)(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),p=(e,t)=>e.map(e=>(0,i.join)(e,`${t}.tla`)).find(a.existsSync),m=e=>t=>{let n=p(e,t);return n===void 0?void 0:(0,a.readFileSync)(n,`utf8`)},h=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),g=e=>`jar:file:${(0,o.pathToFileURL)((0,i.resolve)(e)).pathname}!/tla2sany/StandardModules/`,_=(e,r)=>{if(e instanceof t.h||e instanceof t._){let t=n.vt(e.message),i=t&&!t.isEvalException?t.code:n.dt.general;return r.print(i,n.ft.error,n.mt(i,e.message,r.isTool))}console.error(`${e.name}: ${e.message}`)},v=async(e,r=n.pt(!1))=>{try{return await e()}catch(e){if(!(e instanceof t.g))throw e;return _(e,r),t.V(e)}},y=(e,t,n)=>console.error(`File does not exist: ${(0,i.isAbsolute)(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[g(n)]].join(`, `)}`),b=e=>e.endsWith(`/`)?e:`${e}/`,x=(e,t)=>r=>{let i=e(r);return i===void 0&&!n.I.has(r)&&t(`${r}.tla`),i},S=e=>e.classPath?.split(i.delimiter).find(e=>e.endsWith(`.jar`));var C=`0.0.9`;const w=2224400062,T={int8:0,int16:1,int32:2,shared8:4,shared16:5,shared32:6,block32:8,string8:9,string32:10,doubleLittle:12},E={smallInt:64,smallString:32,smallBlock:128},D=(e,...t)=>({tag:e,fields:t}),O=e=>typeof e==`object`&&`tag`in e,ee=(e,n)=>{let r=new DataView(e.buffer,e.byteOffset,e.byteLength);if(e.length<n+20||r.getUint32(n)!==w)throw new t.w(`corrupted fingerprint file`);let i=n+20+r.getUint32(n+4),a=[],o={position:n+20},s=e=>{let n=o.position;if(o.position+=e,o.position>i)throw new t.w(`corrupted fingerprint file`);return n},c=new TextDecoder,l=t=>{let n=s(t),r=c.decode(e.subarray(n,n+t));return a.push(r),r},u=(e,t)=>{let n=D(e);t>0&&a.push(n);for(let e=0;e<t;e++)n.fields.push(f());return n},d=e=>a[a.length-e],f=()=>{let n=e[s(1)];if(n>=E.smallBlock)return u(n&15,n>>4&7);if(n>=E.smallInt)return n&63;if(n>=E.smallString)return l(n&31);switch(n){case T.int8:return r.getInt8(s(1));case T.int16:return r.getInt16(s(2));case T.int32:return r.getInt32(s(4));case T.shared8:return d(r.getUint8(s(1)));case T.shared16:return d(r.getUint16(s(2)));case T.shared32:return d(r.getUint32(s(4)));case T.block32:{let e=r.getUint32(s(4));return u(e&255,e>>>10)}case T.string8:return l(r.getUint8(s(1)));case T.string32:return l(r.getUint32(s(4)));case T.doubleLittle:{let e={float:r.getFloat64(s(8),!0)};return a.push(e),e}}throw new t.w(`corrupted fingerprint file`)};return{value:f(),next:i}},te=e=>{let t=[],n={objects:0,words32:0,words64:0},r=(e,n)=>{for(let r=(n-1)*8;r>=0;r-=8)t.push(e>>>r&255)},i=new TextEncoder,a=e=>{if(typeof e==`number`)return e>=0&&e<64?t.push(E.smallInt+e):e>=-128&&e<128?t.push(T.int8,e&255):e>=-32768&&e<32768?(t.push(T.int16),r(e,2)):(t.push(T.int32),r(e,4));if(n.objects++,typeof e==`string`){let a=i.encode(e);a.length<32?t.push(E.smallString+a.length):a.length<256?t.push(T.string8,a.length):(t.push(T.string32),r(a.length,4)),t.push(...a),n.words32+=1+Math.floor((a.length+4)/4),n.words64+=1+Math.floor((a.length+8)/8);return}if(!O(e)){let r=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(8));r.setFloat64(0,e.float,!0),t.push(T.doubleLittle,...new Uint8Array(r.buffer)),n.words32+=3,n.words64+=2;return}let o=e.fields.length;o===0?n.objects--:(n.words32+=1+o,n.words64+=1+o),e.tag<16&&o<8?t.push(E.smallBlock+e.tag+(o<<4)):(t.push(T.block32),r(o*1024+e.tag,4)),e.fields.forEach(a)};a(e);let o=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(20));return[w,t.length,n.objects,n.words32,n.words64].forEach((e,t)=>o.setUint32(t*4,e)),new Uint8Array([...new Uint8Array(o.buffer),...t])},k=20210223,A={zenon:{field:1,tag:1},isabelle:{field:2,tag:0},smt:{field:10,tag:8},z3:{field:11,tag:9},ls4:{field:17,tag:16}},j=[`false`,`timeout`],ne=`tla-ts ${C}`,re=/* @__PURE__ */ new Map([[A.zenon.field,3],[A.isabelle.field,4]]),M=(e,t)=>e!==void 0&&O(e)?e.fields[t]:void 0,ie=e=>e!==void 0&&typeof e==`object`&&`float`in e?e.float:1/0,N=e=>{let t=new TextEncoder().encode(e),n=(e,t)=>e<<t|e>>>32-t,r=Array.from({length:Math.ceil(t.length/4)},(e,n)=>t[n*4]|t[n*4+1]<<8|t[n*4+2]<<16|t[n*4+3]<<24).reduce((e,t)=>{let r=Math.imul(n(Math.imul(t,3432918353),15),461845907);return Math.imul(n(e^r,13),5)+3864292196|0},0),i=Math.imul(r^t.length^(r^t.length)>>>16,2246822507),a=Math.imul(i^i>>>13,3266489909);return(a^a>>>16)&1073741823},ae=e=>e!==void 0&&O(e)?[[e.fields[0],e.fields[1]],...ae(e.fields[2])]:[],oe=(e,n,r)=>{let i=(0,a.readFileSync)(n),o=ee(i,0),s=ee(i,o.next).value;if(o.value!==k||!O(s)||s.tag!==0)throw new t.w(`corrupted fingerprint file`);let c=M(M(s,0),1),l=(e,t)=>{let n=re.get(t);return!r||n===void 0||M(M(e,0),n)===ne};e.clear(),(c!==void 0&&O(c)?c.fields:[]).flatMap(e=>ae(e).toReversed()).forEach(([n,r])=>{if(typeof n!=`string`||!O(r))throw new t.w(`corrupted fingerprint file`);e.set(n,r.fields.map((e,t)=>l(e,t)?e:0))})},se=(e,t)=>{let n=M(t,0),r=M(n,0),i=M(M(n,1),0);if(r===void 0||r===1)return;let a=ie(M(e===`isabelle`?M(i,0):i,0)),o=e===`isabelle`?M(i,1):void 0,s=M(M(r,0),0);return{method:{prover:e,timeLimitMs:a*1e3,...typeof o==`string`&&{tactic:o}},isProved:r===0,isReused:!1,...s!==void 0&&{reason:typeof s==`number`?j[s]:String(M(s,0))}}},ce=e=>{let t=/* @__PURE__ */ new Date,n=e.method,r={float:n.rlimit??n.timeLimitMs/1e3},i=n.prover===`zenon`?D(0,r,5):n.prover===`isabelle`?D(0,D(0,r),n.tactic??`auto`):D(0,r),a=j.indexOf(e.reason??``),o=e.reason===void 0?0:D(0,a===-1?D(0,e.reason):a);return D(0,D(0,D(0,e.isProved?0:D(0,o),D(A[n.prover].tag,i)),D(0,t.getFullYear(),t.getMonth(),t.getDate(),t.getHours(),t.getMinutes(),t.getSeconds()),ne,ne,ne))},le=e=>{let t=2**Math.max(9,Math.ceil(Math.log2(e.size/2))),n=Array.from({length:t},()=>0);return e.forEach((e,r)=>{let i=N(r)&t-1;n[i]=D(0,r,D(0,...e),n[i])}),D(0,D(0,e.size,D(0,...n),0,512))},ue=e=>String(e).padStart(2,`0`),de=(e,t)=>{let n=/* @__PURE__ */ new Date,r=`${e}.history`,o=(0,i.join)(r,`${n.getFullYear()}-${ue(n.getMonth()+1)}-${ue(n.getDate())}_${ue(n.getHours())}_${ue(n.getMinutes())}_${ue(n.getSeconds())}`);(0,a.mkdirSync)(o,{recursive:!0}),[e,...t].filter(e=>(0,a.existsSync)(e)).forEach(e=>(0,a.cpSync)(e,(0,i.join)(o,(0,i.basename)(e)),{preserveTimestamps:!0})),(0,a.readdirSync)(r).map(e=>(0,i.join)(r,e)).sort((e,t)=>(0,a.statSync)(t).mtimeMs-(0,a.statSync)(e).mtimeMs).slice(10).forEach(e=>(0,a.rmSync)(e,{recursive:!0,force:!0}))},fe=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=new Map([...e].map(([e,r])=>{let i=new Map(Object.entries(A).flatMap(([e,n])=>{let i=se(e,M(r[n.field],0));return i?(t.set(i,r[n.field]),[[e,i]]):[]}));return n.set(i,r),[e,i]}));return{results:r,save:i=>{e.clear(),r.forEach((r,i)=>{let a=[...n.get(r)??Array(23).fill(0)];r.forEach((e,n)=>{a[A[n].field]=t.get(e)??ce(e)}),e.set(i,a)}),(0,a.writeFileSync)(`${i}.tmp`,Buffer.concat([te(k),te(le(e))])),(0,a.renameSync)(`${i}.tmp`,i)}}},pe=(e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,e.getArity??(()=>n.length)]}));return{usage:e.replace(`{options}`,t.map(e=>`[${e.flag}]${e.isRepeatable?`...`:``}`).join(` `)),parse:e=>{let t=[],r=[],i=[],a=[];for(let o=0;o<e.length;o++){let s=n.get(e[o]);if(s===void 0){(e[o].startsWith(`-`)?i:r).push(e[o]);continue}let c=s(e.slice(o+1)),l={name:e[o],values:e.slice(o+1,o+1+c)};t.push(l),l.values.length<c&&a.push(l),o+=c}return{options:t,positionals:r,unknown:i,incomplete:a[0],has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}},me=pe(`tla-ts <Spec.tla|Spec.cfg|glob>... {options}`,[{flag:`-config <Spec.cfg>`},{flag:`-continue`},{flag:`-deadlock`},{flag:`-dump [<format>] <file>`,getArity:e=>e.length>1&&e[0].startsWith(`dot`)?2:1},{flag:`-fp <num>`},{flag:`-lncheck <final|default>`},{flag:`-metadir <directory>`},{flag:`-nowarning`},{flag:`-seed <num>`},{flag:`-tool`},{flag:`-workers <count|auto>`}]),P=pe(`tla-ts tlapm {options} <Module.tla|glob>...`,[{flag:`-N`},{flag:`--summary`},{flag:`--strict`},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--threads <num>`},{flag:`--version`},{flag:`-I <directory>`,isRepeatable:!0},{flag:`-k`},{flag:`--noproving`},{flag:`--nofp`},{flag:`--nofpl <start> <end>`},{flag:`--safefp`},{flag:`--cleanfp`},{flag:`--usefp <file>`},{flag:`--cache-dir <directory>`}]),F=[`Usage: ${me.usage}`,` ${P.usage}`,` tla-ts [<JVM option>]... tlc2.TLC <TLC option>... <Spec>`,` (-cp tla2tools.jar or -Dtla-ts.tlc=1.7.4 picks the TLC to reproduce)`,` tla-ts [<JVM option>]... tla2sany.xml.XMLExporter [-I <directory>]... [-o] [-t] [-r] [-u] <Module.tla>`].join(`
10
- `),he=/* @__PURE__ */ new Set([`--toolbox`,`--line`,`--threads`,`--nofpl`]),ge=t=>[`.`,...e.t().map(e=>(0,i.join)((0,i.dirname)((0,i.dirname)((0,a.realpathSync)(e))),`lib/tlapm/stdlib`)).filter(e=>(0,a.existsSync)(e)).slice(0,1),...t.options.flatMap(e=>e.name===`-I`?e.values:[]).toReversed()],_e=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),ve=(e,t,n)=>_e([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:${t}`,...n]),ye=`9ed0376`,be=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,xe={failed:10,incomplete:11,emptyTarget:12},Se=(e,t,n)=>{let i=e.summary;n||(i.absent.forEach(e=>console.error(`Missing proof at ${r.p(e)}`)),i.omitted.forEach(e=>console.error(`Omitted proof at ${r.p(e)}`)));let a=i.absent.length+i.omitted.length>0;a&&console.error(`${r.f(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${i.absent.length} missing, ${i.omitted.length} omitted proof step(s).`);let o=t&&e.obligations.length===0;return o&&console.error(`${r.f(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...a?[xe.incomplete]:[],...o?[xe.emptyTarget]:[]]},Ce=e=>{try{return e()}catch(e){if(!(e instanceof t.w))throw e;console.error(` tlapm ending abnormally with ${e.exception}\n`);return}},we=(e,t)=>{let n=t.method.timeLimitMs,i=t.timeUsedMs===void 0?``:`; time-used: ${(t.timeUsedMs/1e3).toFixed(1)} (${Math.round(100*t.timeUsedMs/n)}%)`,a=n===0?``:`time-limit: ${n===1/0?`inf`:Number((n/1e3).toPrecision(6))}${i}`,o=[t.method.tactic,a].filter(Boolean).join(`; `),s=(t.method.prover===`smt`||t.method.prover===`z3`)&&t.reason===`false`&&t.verdict?`(* SMT failed with status = ${t.verdict}\n *)\n`:``;ve(e,t.isProved?`proved`:`failed`,[`prover:${t.method.prover}`,...o===``?[]:[`meth:${o}`],...t.reason===void 0?[]:[`reason:${t.reason}`],`already:${t.isReused}`,...t.isProved?[]:[`obl:${t.isReused?``:`\n${s}`}${r.n(e,t.isReused)}`]])},Te=(e,t)=>ve(e,`failed`,[`prover:fail`,`meth:time-limit: inf`,`reason:${t}`,`already:false`,`obl:${e.text}`]),Ee=async(e,t,n,i)=>{let o=fe(i.fingerprints),s=await r.i(e.obligations,{workers:i.workers,results:o.results,isFingerprinted:i.isFingerprinted,isProving:i.isProving,onReport:(e,t)=>{if(i.isToolbox){if(e.obligation.status===`trivial`)return ve(t,`trivial`,[`prover:tlapm`,`already:false`]);if(t.kind.kind===`Error`)return Te(t,`user error`);e.attempts.forEach(e=>we(t,e))}}});if((0,a.writeFileSync)(t,r.t(e.name,s,e.obligations)),console.log(`(* created new ${JSON.stringify(t)} *)`),o.save(n),console.log(`(* fingerprints written in ${JSON.stringify(n)} *)`),!i.isProving)return!1;let c=s.flatMap((t,n)=>`reason`in t.obligation?[{report:t,obligation:e.obligations[n]}]:[]);i.isToolbox&&c.filter(e=>e.report.attempts.length===0&&e.obligation.kind.kind!==`Error`).forEach(e=>Te(e.obligation,`unexpected error`)),c.toReversed().forEach(e=>console.error(`${r.f(e.obligation.locus)}${r.d(r.u(`[ERROR]: @[<v2>Could not prove or check:@,%a@]`,r.l(e.obligation.sequent)),35)}`));let l=`${e.obligations.length} obligation${e.obligations.length>1?`s`:``}`;return console.error(c.length===0?`${r.f(e.location)}[INFO]: All ${l} proved.`:`${r.f(e.location)}[ERROR]: ${c.length}/${l} failed.\nThere were backend errors processing module \`${JSON.stringify(e.name)}\`.`),c.length>0},De=async e=>{let o=P.parse(e),c=!o.has(`-N`)&&!o.has(`--summary`),l=o.unknown[0]??(c&&o.has(`--printallobs`)?`--printallobs`:void 0);if(l!==void 0)return console.error(`Error: tla-ts tlapm does not support the tlapm option ${l}.`),1;if(o.incomplete)return console.error(`Error: option '${o.incomplete.name}' needs an argument.`),1;let u=o.options.find(e=>he.has(e.name)&&e.values.some(e=>!/^-?\d+$/.test(e)));if(u)return console.error(`Error: option '${u.name}' expects an integer.`),1;if(o.has(`--version`))return console.log(ye),t.W.success;let d=f(o.positionals).map(e=>e.path),p=d.map(e=>e.endsWith(`.tla`)?e:`${e}.tla`);if(p.length===0)return console.error(F),1;let m=o.has(`--toolbox`)||o.has(`--line`);m&&console.log(`\n\\* TLAPM version ${ye}\n\\* launched at ${n.gt(/* @__PURE__ */ new Date)} with command line:\n\\* ${[`tla-ts`,`tlapm`,...e].map(be).join(` `)}\n`);let h=o.options.reduce((e,t)=>{let[n,i]=t.values.map(Number);return t.name===`--toolbox`?{start:n,end:i===0?1/0:i}:t.name===`--line`?n===0?r.o:{start:n,end:n}:e},r.o),g=p.reduce((e,t)=>e.includes((0,i.dirname)(t))?e:[(0,i.dirname)(t),...e],ge(o)),_=/* @__PURE__ */ new Set,v=Ce(()=>{let e=p.findIndex(e=>!(0,a.existsSync)(e));if(e!==-1){let n=d[e];throw console.error(`File "<unknown>":\nError: File ${JSON.stringify(n)} not found`),new t.w(`File ${n} not found`,{failure:`Module.Parser.parse_file`})}return r.c(p.map(e=>({file:`./${e}`,source:(0,a.readFileSync)(e,`utf8`)})),e=>{_.add(e);let t=g.map(t=>`${t}/${e}.tla`).find(e=>(0,a.existsSync)(e));return t===void 0?e===`TLAPS`?{file:`TLAPS.tla`,source:r.a}:void 0:{file:t,source:(0,a.readFileSync)(t,`utf8`)}},{lines:h,onWarning:e=>{if(e.channel===`stdout`)return console.log(e.text);let t=e.channel===`toolbox`||e.channel===`toolboxOnly`;if(m&&t)return _e([`type:warning`,`msg:${e.text}`]);e.channel!==`toolboxOnly`&&console.error(e.text)}})});if(!v)return 3;let y=o.get(`--cache-dir`)?.[0]??process.env.TLAPM_CACHE_DIR??`.tlacache`,b=o.get(`--nofpl`)?.map(Number)??[0,0],x={isToolbox:m,isProving:!o.has(`--noproving`),workers:Math.max(1,Number(o.get(`--threads`)?.[0]??(0,s.availableParallelism)())),isFingerprinted:e=>!o.has(`--nofp`)&&!(e.locus&&e.locus.startLine>=b[0]&&e.locus.endLine<=b[1]),fingerprints:/* @__PURE__ */ new Map},S=[];for(let[e,t]of v.entries()){let n=`${y}/${t.name}.tlaps`,i=`${n}/fingerprints`,s=o.get(`--usefp`)?.[0]??i;if((0,a.mkdirSync)(n,{recursive:!0}),o.has(`--cleanfp`)&&(0,a.existsSync)(i)&&((0,a.rmSync)(i),console.log(`(* fingerprints file ${JSON.stringify(i)} removed *)`)),!o.has(`--cleanfp`)&&(0,a.existsSync)(s)&&t.summary.total!==0&&(console.log(o.has(`--nofp`)?`(* will not use fingerprints (because of option \`--nofp\`), but will now load fingerprints from the file \`${s}\`, in order to overwrite with the new fingerprints, and then save the results at the end. *)`:`(* loading fingerprints in ${JSON.stringify(s)} *)`),oe(x.fingerprints,s,o.has(`--safefp`))),o.has(`--summary`)&&console.log(r.s(t)),m&&(t.obligations.forEach(e=>ve(e,`to be proved`,o.has(`--printallobs`)?[`obl:${e.text}`]:[])),_e([`type:obligationsnumber`,`count:${t.obligations.length}`])),o.has(`--strict`)&&S.push(...Se(t,h.start>0||h.end<1/0,o.has(`--summary`))),!c)continue;de(i,[..._,...v.slice(0,e+1).map(e=>e.name)].map(e=>`${e}.tla`));let l=await Ee(t,`${n}/${t.name}.thy`,i,x);if(l&&o.has(`--strict`)&&S.push(xe.failed),l&&!o.has(`--strict`)&&!m)return console.error(` tlapm ending abnormally with Failure("backend errors: there are unproved obligations")
9
+ const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs"),r=require("./tlapm.cjs");let i=require("node:path"),a=require("node:fs"),o=require("node:url"),s=require("node:child_process"),c=require("node:os"),l=require("node:v8");const u=`META-INF/MANIFEST.MF`,d=async e=>{if(e===void 0||!(0,a.existsSync)(e))return`master`;let t=await import(`fflate`),n=t.unzipSync((0,a.readFileSync)(e),{filter:e=>e.name===u})[u];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},f=/[*?[{]/,p=e=>e.flatMap(e=>f.test(e)?(0,a.globSync)(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),m=(e,t)=>e.map(e=>(0,i.join)(e,`${t}.tla`)).find(a.existsSync),h=e=>t=>{let n=m(e,t);return n===void 0?void 0:(0,a.readFileSync)(n,`utf8`)},g=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),_=e=>`jar:file:${(0,o.pathToFileURL)((0,i.resolve)(e)).pathname}!/tla2sany/StandardModules/`,v=t=>t instanceof e.V?e.it(t.code):e.Q(t),y=(n,r)=>{if(n instanceof e._||n instanceof e.b){let i=t.Wt(n.message),a=n instanceof e.V?n.code:i&&!i.isEvalException?i.code:t.Lt.general;return r.print(a,t.Rt.error,t.Bt(a,n.message,r.isTool))}console.error(`${n.name}: ${n.message}`)},b=async(n,r=t.zt({isTool:!1}))=>{try{return await n()}catch(t){if(!(t instanceof e.y))throw t;return y(t,r),v(t)}},x=(e,t,n)=>console.error(`File does not exist: ${(0,i.isAbsolute)(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[_(n)]].join(`, `)}`),S=e=>e.endsWith(`/`)?e:`${e}/`,C=(e,n)=>r=>{let i=e(r);return i===void 0&&!t.ct.has(r)&&n(`${r}.tla`),i},w=e=>e.classPath?.split(i.delimiter).find(e=>e.endsWith(`.jar`));var T=`0.0.10-dev.094b9b512`;const E=2224400062,D={int8:0,int16:1,int32:2,shared8:4,shared16:5,shared32:6,block32:8,string8:9,string32:10,doubleLittle:12},O={smallInt:64,smallString:32,smallBlock:128},k=(e,...t)=>({tag:e,fields:t}),A=e=>typeof e==`object`&&`tag`in e,ee=(t,n)=>{let r=new DataView(t.buffer,t.byteOffset,t.byteLength);if(t.length<n+20||r.getUint32(n)!==E)throw new e.A(`corrupted fingerprint file`);let i=n+20+r.getUint32(n+4),a=[],o=n+20,s=t=>{let n=o;if(o+=t,o>i)throw new e.A(`corrupted fingerprint file`);return n},c=new TextDecoder,l=e=>{let n=s(e),r=c.decode(t.subarray(n,n+e));return a.push(r),r},u=(e,t)=>{let n=k(e);t>0&&a.push(n);for(let e=0;e<t;e++)n.fields.push(f());return n},d=e=>a[a.length-e],f=()=>{let n=t[s(1)];if(n>=O.smallBlock)return u(n&15,n>>4&7);if(n>=O.smallInt)return n&63;if(n>=O.smallString)return l(n&31);switch(n){case D.int8:return r.getInt8(s(1));case D.int16:return r.getInt16(s(2));case D.int32:return r.getInt32(s(4));case D.shared8:return d(r.getUint8(s(1)));case D.shared16:return d(r.getUint16(s(2)));case D.shared32:return d(r.getUint32(s(4)));case D.block32:{let e=r.getUint32(s(4));return u(e&255,e>>>10)}case D.string8:return l(r.getUint8(s(1)));case D.string32:return l(r.getUint32(s(4)));case D.doubleLittle:{let e={float:r.getFloat64(s(8),!0)};return a.push(e),e}}throw new e.A(`corrupted fingerprint file`)};return{value:f(),next:i}},te=e=>{let t=[],n=0,r=0,i=0,a=(e,n)=>{for(let r=(n-1)*8;r>=0;r-=8)t.push(e>>>r&255)},o=new TextEncoder,s=e=>{if(typeof e==`number`)return e>=0&&e<64?t.push(O.smallInt+e):e>=-128&&e<128?t.push(D.int8,e&255):e>=-32768&&e<32768?(t.push(D.int16),a(e,2)):(t.push(D.int32),a(e,4));if(n++,typeof e==`string`){let n=o.encode(e);n.length<32?t.push(O.smallString+n.length):n.length<256?t.push(D.string8,n.length):(t.push(D.string32),a(n.length,4)),t.push(...n),r+=1+Math.floor((n.length+4)/4),i+=1+Math.floor((n.length+8)/8);return}if(!A(e)){let n=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(8));n.setFloat64(0,e.float,!0),t.push(D.doubleLittle,...new Uint8Array(n.buffer)),r+=3,i+=2;return}let c=e.fields.length;c===0?n--:(r+=1+c,i+=1+c),e.tag<16&&c<8?t.push(O.smallBlock+e.tag+(c<<4)):(t.push(D.block32),a(c*1024+e.tag,4)),e.fields.forEach(s)};s(e);let c=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(20));return[E,t.length,n,r,i].forEach((e,t)=>c.setUint32(t*4,e)),new Uint8Array([...new Uint8Array(c.buffer),...t])},ne=20210223,re=[...n.c,`cooper`,`expandenabled`,`expandcdot`,`lambdify`,`enabledaxioms`,`levelcomparison`],j={zenon:{field:1,tag:1},isabelle:{field:2,tag:0},cooper:{field:4,tag:3,isConstant:!0},smt:{field:10,tag:8},z3:{field:11,tag:9},ls4:{field:17,tag:16},expandenabled:{field:18,tag:6,isConstant:!0},expandcdot:{field:19,tag:8,isConstant:!0},lambdify:{field:20,tag:9,isConstant:!0},enabledaxioms:{field:21,tag:10,isConstant:!0},levelcomparison:{field:22,tag:11,isConstant:!0}},ie=[`false`,`timeout`],ae=`tla-ts ${T}`,oe=/* @__PURE__ */ new Map([[j.zenon.field,3],[j.isabelle.field,4]]),M=(e,t)=>e!==void 0&&A(e)?e.fields[t]:void 0,se=e=>e!==void 0&&typeof e==`object`&&`float`in e?e.float:1/0,N=e=>{let t=new TextEncoder().encode(e),n=(e,t)=>e<<t|e>>>32-t,r=Array.from({length:Math.ceil(t.length/4)},(e,n)=>t[n*4]|t[n*4+1]<<8|t[n*4+2]<<16|t[n*4+3]<<24).reduce((e,t)=>{let r=Math.imul(n(Math.imul(t,3432918353),15),461845907);return Math.imul(n(e^r,13),5)+3864292196|0},0),i=Math.imul(r^t.length^(r^t.length)>>>16,2246822507),a=Math.imul(i^i>>>13,3266489909);return(a^a>>>16)&1073741823},ce=e=>e!==void 0&&A(e)?[[e.fields[0],e.fields[1]],...ce(e.fields[2])]:[],P=(t,n,r)=>{let i=(0,a.readFileSync)(n),o=ee(i,0),s=ee(i,o.next).value;if(o.value!==ne||!A(s)||s.tag!==0)throw new e.A(`corrupted fingerprint file`);let c=M(M(s,0),1),l=(e,t)=>{let n=oe.get(t);return!r||n===void 0||M(M(e,0),n)===ae};t.clear(),(c!==void 0&&A(c)?c.fields:[]).flatMap(e=>ce(e).toReversed()).forEach(([n,r])=>{if(typeof n!=`string`||!A(r))throw new e.A(`corrupted fingerprint file`);t.set(n,r.fields.map((e,t)=>l(e,t)?e:0))})},le=(e,t)=>{let n=M(t,0),r=M(n,0),i=M(M(n,1),0);if(r===void 0||r===1)return;let a=se(M(e===`isabelle`?M(i,0):i,0)),o=e===`isabelle`?M(i,1):void 0,s=M(M(r,0),0);return{kind:`stored`,method:{prover:e,timeLimitMs:a*1e3,...typeof o==`string`&&{tactic:o}},isProved:r===0,...s!==void 0&&{reason:typeof s==`number`?ie[s]:String(M(s,0))}}},ue=(e,t)=>{let r=/* @__PURE__ */ new Date,i=t.method,a={float:n.u(i)},o=e===`zenon`?k(0,a,5):e===`isabelle`?k(0,k(0,a),i.tactic??`auto`):k(0,a),s=n.i(t),c=ie.indexOf(s??``),l=s===void 0?0:k(0,c===-1?k(0,s):c);return k(0,k(0,k(0,n.a(t)?0:k(0,l),j[e].isConstant?j[e].tag:k(j[e].tag,o)),k(0,r.getFullYear(),r.getMonth(),r.getDate(),r.getHours(),r.getMinutes(),r.getSeconds()),ae,ae,ae))},de=e=>{let t=2**Math.max(9,Math.ceil(Math.log2(e.size/2))),n=Array.from({length:t},()=>0);return e.forEach((e,r)=>{let i=N(r)&t-1;n[i]=k(0,r,k(0,...e),n[i])}),k(0,k(0,e.size,k(0,...n),0,512))},fe=e=>String(e).padStart(2,`0`),pe=(e,t)=>{let n=/* @__PURE__ */ new Date,r=`${e}.history`,o=(0,i.join)(r,`${n.getFullYear()}-${fe(n.getMonth()+1)}-${fe(n.getDate())}_${fe(n.getHours())}_${fe(n.getMinutes())}_${fe(n.getSeconds())}`);(0,a.mkdirSync)(o,{recursive:!0}),[e,...t].filter(e=>(0,a.existsSync)(e)).forEach(e=>(0,a.cpSync)(e,(0,i.join)(o,(0,i.basename)(e)),{preserveTimestamps:!0})),(0,a.readdirSync)(r).map(e=>(0,i.join)(r,e)).sort((e,t)=>(0,a.statSync)(t).mtimeMs-(0,a.statSync)(e).mtimeMs).slice(10).forEach(e=>(0,a.rmSync)(e,{recursive:!0,force:!0}))},me=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=new Map([...e].map(([e,r])=>{let i=new Map(re.flatMap(e=>{let n=r[j[e].field],i=le(e,M(n,0));return i?(t.set(i,n),[[e,i]]):[]}));return n.set(i,r),[e,i]}));return{results:r,save:i=>{e.clear(),r.forEach((r,i)=>{let a=[...n.get(r)??Array(23).fill(0)];re.forEach(e=>{let n=r.get(e);n&&(a[j[e].field]=t.get(n)??ue(e,n))}),e.set(i,a)}),(0,a.writeFileSync)(`${i}.tmp`,Buffer.concat([te(ne),te(de(e))])),(0,a.renameSync)(`${i}.tmp`,i)}}},he=((e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,n.length]}));return{usage:e.replace(`{options}`,t.map(e=>`[${e.flag}]${e.isRepeatable?`...`:``}`).join(` `)),parse:e=>{let t=[],r=[],i=[];for(let a=0;a<e.length;a++){let o=n.get(e[a]);o===void 0?(e[a].startsWith(`-`)?i:r).push(e[a]):(t.push({name:e[a],values:e.slice(a+1,a+1+o)}),a+=o)}return{options:t,positionals:r,unknown:i,incomplete:t.find(e=>e.values.length<(n.get(e.name)??0)),has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}})(`tla-ts tlapm {options} <Module.tla|glob>...`,[{flag:`-N`},{flag:`--summary`},{flag:`--strict`},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--threads <num>`},{flag:`--version`},{flag:`-I <directory>`,isRepeatable:!0},{flag:`-k`},{flag:`--noproving`},{flag:`--nofp`},{flag:`--nofpl <start> <end>`},{flag:`--safefp`},{flag:`--cleanfp`},{flag:`--usefp <file>`},{flag:`--cache-dir <directory>`},{flag:`--debug <flags>`,isRepeatable:!0},{flag:`--method <methods>`},{flag:`--solver <command>`},{flag:`--smt-logic <logic>`},{flag:`--stretch <factor>`},{flag:`--noflatten`}]),ge=[`Usage: tla-ts <Spec.tla|Spec.cfg|spec.ts|glob>... [-config <Spec.cfg>] [-continue] [-deadlock] [-dump [<format>] <file>] [-fp <num>] [-lncheck <final|default|off>] [-maxSetSize <num>] [-metadir <directory>] [-nowarning] [-seed <num>] [-terse] [-tool] [-view] [-workers <count|auto>]`,` ${he.usage}`,` tla-ts [<JVM option>]... tlc2.TLC <TLC option>... <Spec>`,` (-cp tla2tools.jar or -Dtla-ts.tlc=1.7.4 picks the TLC to reproduce)`,` tla-ts [<JVM option>]... tla2sany.xml.XMLExporter [-I <directory>]... [-o] [-t] [-r] [-u] <Module.tla>`].join(`
10
+ `),_e=/* @__PURE__ */ new Set([`--toolbox`,`--line`,`--threads`,`--nofpl`]),ve=e=>[`.`,...r.t().map(e=>(0,i.join)((0,i.dirname)((0,i.dirname)((0,a.realpathSync)(e))),`lib/tlapm/stdlib`)).filter(a.existsSync).slice(0,1),...e.options.flatMap(e=>e.name===`-I`?e.values:[]).toReversed()],ye=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),be=(e,t,n)=>ye([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:${t}`,...n]),xe=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,Se={failed:10,incomplete:11,emptyTarget:12},Ce=(e,t,r)=>{let i=e.summary;r||(i.absent.forEach(e=>console.error(`Missing proof at ${n.y(e)}`)),i.omitted.forEach(e=>console.error(`Omitted proof at ${n.y(e)}`)));let a=i.absent.length+i.omitted.length>0;a&&console.error(`${n.v(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${i.absent.length} missing, ${i.omitted.length} omitted proof step(s).`);let o=t&&e.obligations.length===0;return o&&console.error(`${n.v(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...a?[Se.incomplete]:[],...o?[Se.emptyTarget]:[]]},we=(e,t,n)=>{console.error(` tlapm ending abnormally with ${e.exception}\n`),n&&ye(t.message===``?[`type:error`,`url:http://tla.msr-inria.inria.fr/bugs`,`msg:Oops, this seems to be a bug in TLAPM.\nPlease give feedback to developers.\n\n\n ${e.exception}\n`]:[`type:warning`,`msg:${t.location===void 0?``:`${t.location}\n\n`}${t.message}`])},Te=(t,n)=>{let r={message:``};try{return t(r)}catch(t){if(!(t instanceof e.A))throw t;we(t,r,n);return}},Ee=(e,t,r)=>{let i=t.method.timeLimitMs,a=t.kind===`decided`?`; time-used: ${(t.timeUsedMs/1e3).toFixed(1)} (${Math.round(100*t.timeUsedMs/i)}%)`:``,o=i===0?``:`time-limit: ${i===1/0?`inf`:Number((i/1e3).toPrecision(6))}${a}`,s=[t.method.tactic,o].filter(Boolean).join(`; `),c=n.i(t),l=n.a(t),u=t.kind===`reused`,d=t.kind===`decided`||t.kind===`failed`?t.note:void 0,f=t.kind===`failed`||u?t.shipped:void 0;be(e,l?`proved`:`failed`,[`prover:${t.method.prover}`,...s===``?[]:[`meth:${s}`],...c===void 0?[]:[`reason:${c}`],`already:${u}`,...l?[]:[`obl:${u?``:d??`
11
+ `}${f??n.r(e,t,{...r,isTemporal:t.method.prover===`ls4`})}`]])},De=(e,t)=>{if(e.channel===`stdout`)return console.log(e.text);let n=e.channel===`toolbox`||e.channel===`toolboxOnly`;if(t&&n)return ye([`type:warning`,`msg:${e.text}`]);e.channel!==`toolboxOnly`&&console.error(e.text)},Oe=(e,t)=>be(e,`failed`,[`prover:fail`,`meth:time-limit: inf`,`reason:${t}`,`already:false`,`obl:${e.text}`]),ke=[/^unsat/m,/SPASS beiseite: Proof found/,/SZS status Theorem/],Ae=(e,t,n,r,i)=>{let o=`${t}.out`;(0,a.writeFileSync)(t,n);let c=performance.now();(0,s.spawnSync)(`sh`,[`-c`,`file=${xe(t)}; ${e} >${xe(o)}`],{stdio:[`ignore`,`inherit`,`inherit`],timeout:Number.isFinite(r)?r:void 0});let l=performance.now()-c,u=(0,a.existsSync)(o)?(0,a.readFileSync)(o,`utf8`):``;return i||[t,o].forEach(e=>(0,a.rmSync)(e,{force:!0})),{verdict:ke.some(e=>e.test(u))?`unsat`:u.startsWith(`sat`)?`sat`:`unknown`,output:u,timeUsedMs:l}},je=async(e,t,r,i)=>{let o=me(i.fingerprints),s=i.solver,c=await n.s(e.obligations,{...i.backends,workers:i.workers,results:o.results,isFingerprinted:i.isFingerprinted,isProving:i.isProving,...i.isKeepingFiles&&{onInput:(e,n)=>(0,a.writeFileSync)(`${t}/${e}`,n)},...s!==void 0&&{solveSmt:async(e,n,r)=>Ae(s,`${t}/${e}`,n,r,i.isKeepingFiles)},onReport:(e,t)=>{if(e.attempts.forEach(e=>{e.kind===`decided`&&e.errorOutput!==void 0&&process.stdout.write(e.errorOutput),e.kind===`failed`&&e.warning!==void 0&&process.stderr.write(`${e.warning}\n`)}),e.warnings.forEach(e=>De(e,i.isToolbox)),i.isToolbox){if(e.obligation.status===`trivial`)return be(t,`trivial`,[`prover:tlapm`,`already:false`]);if(t.kind.kind===`Error`)return Oe(t,`user error`);e.attempts.forEach(e=>Ee(t,e,i.printing))}}}),l=`${t}/${e.name}.thy`;if((0,a.writeFileSync)(l,n.n(e.name,c,e.obligations)),console.log(`(* created new ${JSON.stringify(l)} *)`),o.save(r),console.log(`(* fingerprints written in ${JSON.stringify(r)} *)`),!i.isProving)return!1;let u=c.flatMap((t,n)=>`reason`in t.obligation?[{report:t,obligation:e.obligations[n]}]:[]);i.isToolbox&&u.filter(e=>e.report.attempts.length===0&&e.obligation.kind.kind!==`Error`).forEach(e=>Oe(e.obligation,`unexpected error`)),u.toReversed().forEach(e=>console.error(`${n.v(e.obligation.locus)}${n._(n.g(`[ERROR]: @[<v2>Could not prove or check:@,%a@]`,n.h(e.obligation.sequent,i.printing)),35)}`));let d=`${e.obligations.length} obligation${e.obligations.length>1?`s`:``}`;return console.error(u.length===0?`${n.v(e.location)}[INFO]: All ${d} proved.`:`${n.v(e.location)}[ERROR]: ${u.length}/${d} failed.\nThere were backend errors processing module \`${JSON.stringify(e.name)}\`.`),u.length>0},Me=/* @__PURE__ */ new Set([`tempfiles`,`hidden`,`alldefs`,`rw+`,`rw`,`rwsetext`,`disable_arithmetic`,`no_smt_set_extensionality`,`smarter_types`]),Ne=async r=>{let o=he.parse(r),s=!o.has(`-N`)&&!o.has(`--summary`),l=o.options.flatMap(e=>e.name===`--debug`?e.values[0].split(`,`):[]).reduce((e,t)=>t.startsWith(`-`)?new Set([...e].filter(e=>e!==t.slice(1))):/* @__PURE__ */ new Set([...e,t]),/* @__PURE__ */ new Set),u={isShowingHidden:l.has(`hidden`),isShowingAllDefinitions:l.has(`alldefs`)},d=[`rwsetext`,`rw`,`rw+`].filter(e=>l.has(e)),f=l.has(`smarter_types`)&&!l.has(`disable_arithmetic`),m=f&&d.length>0?`smarter_types with --debug ${d.at(-1)}`:[...l].find(e=>!Me.has(e)),h=o.unknown[0]??(s&&o.has(`--printallobs`)?`--printallobs`:void 0)??(m===void 0?void 0:`--debug ${m}`);if(h!==void 0)return console.error(`Error: tla-ts tlapm does not support the tlapm option ${h}.`),1;if(o.incomplete)return console.error(`Error: option '${o.incomplete.name}' needs an argument.`),1;let g=o.options.find(e=>_e.has(e.name)&&e.values.some(e=>!/^-?\d+$/.test(e)));if(g)return console.error(`Error: option '${g.name}' expects an integer.`),1;if(o.get(`--stretch`)?.some(e=>Number.isNaN(Number(e))))return console.error(`Error: option '--stretch' expects a float.`),1;if(o.has(`--version`))return console.log(n.t),e.nt.success;let _=p(o.positionals).map(e=>e.path),v=_.map(e=>e.endsWith(`.tla`)?e:`${e}.tla`);if(v.length===0)return console.error(ge),1;let y=o.has(`--toolbox`)||o.has(`--line`);y&&console.log(`\n\\* TLAPM version ${n.t}\n\\* launched at ${t.Ht(/* @__PURE__ */ new Date)} with command line:\n\\* ${[`tla-ts`,`tlapm`,...r].map(xe).join(` `)}\n`);let b=o.options.reduce((e,t)=>{let[r,i]=t.values.map(Number);return t.name===`--toolbox`?{start:r,end:i===0?1/0:i}:t.name===`--line`?r===0?n.f:{start:r,end:r}:e},n.f),x=v.reduce((e,t)=>e.includes((0,i.dirname)(t))?e:[(0,i.dirname)(t),...e],ve(o)),S=/* @__PURE__ */ new Set,C=Te(t=>{let r=v.findIndex(e=>!(0,a.existsSync)(e));if(r!==-1){let t=_[r];throw console.error(`File "<unknown>":\nError: File ${JSON.stringify(t)} not found`),new e.A(`File ${t} not found`,{failure:`Module.Parser.parse_file`})}return n.m(v.map(e=>({file:`./${e}`,source:(0,a.readFileSync)(e,`utf8`)})),e=>{S.add(e);let t=x.map(t=>`${t}/${e}.tla`).find(a.existsSync);if(t!==void 0)return{file:t,source:(0,a.readFileSync)(t,`utf8`)};let r=n.l.get(e);return r===void 0?void 0:{file:`${e}.tla`,source:r}},{lines:b,printing:u,onWarning:e=>{e.channel===`error`?(t.location=e.locus&&n.y(e.locus),t.message=`${e.text}\n\n${t.message}`):De(e,y)}})},y);if(!C)return 3;let w=o.get(`--cache-dir`)?.[0]??process.env.TLAPM_CACHE_DIR??`.tlacache`,T=o.get(`--nofpl`)?.map(Number)??[0,0],E=o.get(`--method`)?.[0],D={isToolbox:y,isProving:!o.has(`--noproving`),workers:Math.max(1,Number(o.get(`--threads`)?.[0]??(0,c.availableParallelism)())),isFingerprinted:e=>!o.has(`--nofp`)&&!(e.locus&&e.locus.startLine>=T[0]&&e.locus.endLine<=T[1]),fingerprints:/* @__PURE__ */ new Map,backends:{defaultMethods:E===void 0?void 0:n.d(E),stretch:Number(o.get(`--stretch`)?.[0]??1),isFlattened:!o.has(`--noflatten`),smtLogic:l.has(`disable_arithmetic`)?`UF`:o.get(`--smt-logic`)?.[0]??`UFNIA`,smtEncoding:{isArithmetic:!l.has(`disable_arithmetic`),rewriteLevel:[`rwsetext`,`rw`,`rw+`].findLastIndex(e=>l.has(e))+1,isSetExtensional:!l.has(`no_smt_set_extensionality`),isTyped:f}},printing:u,isKeepingFiles:l.has(`tempfiles`),solver:o.get(`--solver`)?.[0]??process.env.TLAPM_SMT_SOLVER},O=[];for(let[t,r]of C.entries()){let i=`${w}/${r.name}.tlaps`,c=`${i}/fingerprints`,l=o.get(`--usefp`)?.[0]??c;if((0,a.mkdirSync)(i,{recursive:!0}),o.has(`--cleanfp`)&&(0,a.existsSync)(c)&&((0,a.rmSync)(c),console.log(`(* fingerprints file ${JSON.stringify(c)} removed *)`)),!o.has(`--cleanfp`)&&(0,a.existsSync)(l)&&r.summary.total!==0&&(console.log(o.has(`--nofp`)?`(* will not use fingerprints (because of option \`--nofp\`), but will now load fingerprints from the file \`${l}\`, in order to overwrite with the new fingerprints, and then save the results at the end. *)`:`(* loading fingerprints in ${JSON.stringify(l)} *)`),P(D.fingerprints,l,o.has(`--safefp`))),o.has(`--summary`)&&console.log(n.p(r)),y&&(r.obligations.forEach(e=>be(e,`to be proved`,o.has(`--printallobs`)?[`obl:${e.text}`]:[])),ye([`type:obligationsnumber`,`count:${r.obligations.length}`])),o.has(`--strict`)&&O.push(...Ce(r,b.start>0||b.end<1/0,o.has(`--summary`))),!s)continue;pe(c,[...S,...C.slice(0,t+1).map(e=>e.name)].map(e=>`${e}.tla`));let u=await je(r,i,c,D).catch(t=>{if(!(t instanceof e.A))throw t;return t});if(u instanceof e.A)return console.error(`${n.v(u.locus)}Error: ${u.message}`),we(u,{location:u.locus&&n.y(u.locus),message:u.message},y),3;if(u&&o.has(`--strict`)&&O.push(Se.failed),u&&!o.has(`--strict`)&&!y)return console.error(` tlapm ending abnormally with Failure("backend errors: there are unproved obligations")
11
12
  Raised at Stdlib.failwith in file "stdlib.ml", line 29, characters 17-33
12
13
  Called from Tlapm_lib.process_module in file "src/tlapm_lib.ml", lines 492-493, characters 12-37
13
14
  Called from Tlapm_lib.main.f in file "src/tlapm_lib.ml", line 640, characters 23-43
14
15
  Called from Stdlib__List.fold_left in file "list.ml", line 125, characters 24-34
15
16
  Called from Tlapm_lib.main in file "src/tlapm_lib.ml", line 643, characters 13-40
16
17
  Called from Tlapm_lib.init in file "src/tlapm_lib.ml", line 659, characters 8-59
17
- `),3}return Object.values(xe).find(e=>S.includes(e))??t.W.success},I={builtin:1,number:2,string:3,ident:4,added:5},Oe=()=>({labelFlag:!1,labelRoot:`Lbl_`,fairnessOption:``,checkTermination:!1,specOption:!1,myspecOption:!1,inputVersionNumber:1903}),ke=e=>{let t={result:0,digitsAfterDecimal:0,isAfterDecimal:!1};for(let n of e)if(n===`.`)t.isAfterDecimal=!0;else if(n<`0`||n>`9`||(t.result=10*t.result+Number(n),t.isAfterDecimal&&(t.digitsAfterDecimal+=1),t.digitsAfterDecimal>3))return-1;return t.result*10**Math.max(0,3-t.digitsAfterDecimal)},L=[`unfair`,`wf`,`sf`],R=()=>({col:0,line:0,macroCol:0,macroLine:-1,lbl:``}),Ae=e=>e.macroLine<0?`line ${e.line}, column ${e.col}`:`line ${e.line}, column ${e.col} of macro called at line ${e.macroLine}, column ${e.macroCol}`,je=e=>{if(e.kind!==`LabeledStmt`)throw new t.c(`ClassCastException: ${e.kind}`);return e},Me=(e,n)=>{if(n<0||n>=e.length)throw new t.c(`ArrayIndexOutOfBoundsException: ${n}`);return e[n]},Ne=(e,t,n)=>({string:e,column:t,type:n}),Pe=e=>e.type===I.string?e.string.length+2:e.string.length,Fe=(e=[])=>({tokens:e,anchorTokens:void 0,anchorTokCol:void 0}),Ie=e=>{for(;e.tokens.length>0&&e.tokens[0].length===0;)e.tokens.shift();for(;e.tokens.length>0&&e.tokens[e.tokens.length-1].length===0;)e.tokens.pop();let t=Math.min(999999,...e.tokens.filter(e=>e.length>0).map(e=>e[0].column));e.tokens.forEach(e=>e.forEach(e=>{e.column-=t}));let n=[],r=[];e.tokens.forEach((t,i)=>{if(r.push(0),n.push(void 0),t.length===0)return;let a=t[0].column,o=e.tokens.slice(0,i).findLast(e=>e.length>0&&e[0].column<=a);if(o===void 0)return;let s=o.findIndex((e,t)=>t>0&&e.column>a),c=o[(s===-1?o.length:s)-1];n[i]=c,r[i]=c.column}),e.anchorTokens=n,e.anchorTokCol=r},Le=e=>{let t=Fe(e);return Ie(t),t},Re=e=>{let n=e.anchorTokens,r=e.anchorTokCol;if(n===void 0||r===void 0)throw new t.c(`NullPointerException: TLAExpr.renormalize`);e.tokens.forEach((e,i)=>{let a=n[i];if(a===void 0)return;let o=a.column-r[i];if(r[i]=a.column,o<0)throw new t.s(`TLAExpr.renormalize() found anchor has moved to left.`);e.forEach(e=>{e.column+=o})})},ze=e=>Le(e.tokens.map(e=>e.map(e=>({...e})))),Be=(e,t,n)=>{let r=t.tokens.length;e.tokens.splice(0,0,...t.tokens.slice(0,r-1));let i=t.tokens[r-1],a=e.tokens[r-1],o=i[i.length-1],s=o.column+Pe(o)+n;a.forEach(e=>{e.column+=s}),a.splice(0,0,...i);let c=[...t.anchorTokens??[]],l=[...t.anchorTokCol??[]];for(let t=r;t<e.tokens.length;t++)c.push(e.anchorTokens?.[t-r+1]),l.push(e.anchorTokCol?.[t-r+1]??0);e.anchorTokens=c,e.anchorTokCol=l,Re(e)},Ve=e=>e.tokens.length===1&&e.tokens[0].length===1,He=(e,t)=>Me(Me(e.tokens,t.line),t.item),Ue=(e,n,r)=>{if(e.tokens.length<=n.line)throw new t.o(`TLAExpr.StepCoord called with line too big`);if(e.tokens[n.line].length<=n.item)throw new t.o(`TLAExpr.StepCoord called with col too big`);let i={line:n.line,item:n.item};for(let t=0;t<r;t++)if(i.item+=1,e.tokens[i.line].length===i.item){for(i.item=0,i.line+=1;i.line<e.tokens.length&&e.tokens[i.line].length===0;)i.line+=1;if(i.line===e.tokens.length)return}return i},We=(e,t,n)=>{for(let r=e.tokens.length===0?void 0:{...n};r!==void 0;){let n=He(e,r),i=n.type===I.string;if(!i&&n.string===t)return r;let a=!i&&(n.string===`[`||n.string===`,`)?Ue(e,r,2):void 0,o=a===void 0?void 0:He(e,a),s=o!==void 0&&o.type!==I.string&&[`:`,`|->`,`↦`].includes(o.string),c=i?1:n.string===`.`?2:s?3:1;r=Ue(e,r,c)}},Ge=(e,t,n,r)=>{let i=He(e,n);if(Ve(e)){let n=ze(t);e.tokens=n.tokens,e.anchorTokens=n.anchorTokens,e.anchorTokCol=n.anchorTokCol;return}let a=e.tokens[n.line],o=n.item+1<a.length?a[n.item+1].column-(i.column+Pe(i)):0,s=a.splice(n.item+1),c={lineIndex:n.line,indent:+!!r+i.column,isInserting:!r},l=()=>e.tokens[c.lineIndex];if(Ve(t)){let e=t.tokens[0][0];i.string=e.string,i.type=e.type}else{r&&(i.string=`(`,i.type=I.builtin);let n=ze(t);if(n.tokens.forEach((t,r)=>{if(t.forEach(e=>{e.column+=c.indent,c.isInserting?(i.string=e.string,i.type=e.type,c.isInserting=!1):l().push(e)}),r+1>=n.tokens.length)return;c.indent=0,c.lineIndex+=1;let a=c.lineIndex;e.tokens.splice(a,0,[]);let o=e.anchorTokens??[],s=e.anchorTokCol??[];e.anchorTokens=e.tokens.map((e,t)=>t<a?o[t]:t===a?n.anchorTokens?.[r+1]:o[t-1]),e.anchorTokCol=e.tokens.map((e,t)=>t<a?s[t]:t===a?n.anchorTokCol?.[r+1]??0:s[t-1])}),r){let e=l()[l().length-1];l().push(Ne(`)`,e.column+Pe(e),I.builtin))}}let u=l(),d={line:c.lineIndex,item:u.length-1};if(s.length>0){let e=u[u.length-1],t=e.column+Pe(e)+o-s[0].column;s.forEach(e=>{e.column+=t,u.push(e)})}return Re(e),Ue(e,d,1)},Ke=(e,n,r,i=!0)=>{let a=r.map(t=>We(e,t,{line:0,item:0}));for(;;){let o=a.reduce((e,t,n)=>t!==void 0&&(e===void 0||t.line<e.position.line||t.line===e.position.line&&t.item<e.position.item)?{index:n,position:t}:e,void 0);if(o===void 0)return;let s=Ue(e,o.position,1),c=Ge(e,n[o.index],o.position,i);a[o.index]=c===void 0?void 0:We(e,r[o.index],c),a.forEach((e,n)=>{if(n!==o.index&&e!==void 0&&c!==void 0){if(s===void 0)throw new t.c(`NullPointerException: TLAExpr.substituteForAll`);e.line===o.position.line&&(e.item+=c.item-s.item),e.line+=c.line-s.line}})}},qe=(e,t,n)=>{let r=ze(e);return Ke(r,t,n),r},Je=(e,t,n)=>e.map(e=>qe(e,t,n)),Ye=(e,t)=>{let n=e=>t===`1.7.4`?``:`(col${e.column}) `,r=e.tokens.map(e=>e.map(e=>e.type===I.string?`"\\"", "${e.string}", "\\""`:e.string===`\\/`?`"${n(e)}\\\\/"`:e.string.startsWith(`\\`)?`"\\${e.string}"`:e.string===`/\\`?`"${n(e)}/\\\\"`:`"${e.string}"`)),i=r.findIndex(e=>e.length>0);return`<< ${r.map((e,t)=>{let n=i!==-1&&t>i;return e.map((e,t)=>n||t>0?`, ${e}`:e).join(``)}).join(`
18
- `)} >>`},Xe=(e,t,n)=>{let r=e=>Ye(e,n),i=[0],a={value:0},o=e=>(i[a.value+1]=i[a.value]+e.length,a.value+=1,e),s=()=>(--a.value,``),c=()=>`\n${` `.repeat(i[a.value])}`,l=t<1500,u=e=>`${o(`<<`)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${`kind`in e?m(e):r(e)}`).join(``)}>>${s()}`,d=e=>`${o(`<<`)}${e.map(e=>`"${e}"`).join(`, `)}>>${s()}`,f=e=>`${o(`<< `)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${u(e)}`).join(``)} >>${s()}`,p=e=>e?`"="`:`"\\\\in"`,m=e=>{switch(e.kind){case`Uniprocess`:return`${o(``)}[type |-> "uniprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Multiprocess`:return`${o(``)}[type |-> "multiprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` procs |-> `)}${u(e.procs)}]${s()}${s()}`;case`Procedure`:return l?`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}", ${c()}minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Process`:return l?`${o(``)}[name |-> "${e.name}", ${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}",${c()} fairness |-> "${L[e.fairness]}", minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`VarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> ${p(e.isEq)}, val |-> ${r(e.val)}]${s()}`;case`PVarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> "=", val |-> ${r(e.val)}]${s()}`;case`LabeledStmt`:return`${o(``)}[label |-> "${e.label}",${c()}${o(` stmts |-> `)}${u(e.stmts)}]${s()}${s()}`;case`While`:return`${o(``)}[type |-> "while", ${c()} test |-> ${r(e.test)},${c()}${o(` labDo |-> `)}${u(e.labDo)},${s()}${c()}${o(` unlabDo |-> `)}${u(e.unlabDo)}]${s()}${s()}`;case`Assign`:return`${o(``)}[type |-> "assignment",${c()}${o(` ass |-> `)}${u(e.ass)}]${s()}${s()}`;case`SingleAssign`:return`${o(``)}[lhs |-> ${m(e.lhs)},${c()} rhs |-> ${r(e.rhs)}]${s()}`;case`Lhs`:return`[var |-> "${e.var}", sub |-> ${r(e.sub)}]`;case`If`:return`${o(``)}[type |-> "if", ${c()} test |-> ${r(e.test)},${c()}${o(` then |-> `)}${u(e.Then)},${s()}${c()}${o(` else |-> `)}${u(e.Else)}]${s()}${s()}`;case`Either`:return`${o(``)}[type |-> "either", ${c()}${o(` ors |-> `)}${f(e.ors)}]${s()}${s()}`;case`With`:return`${o(``)}[type |-> "with", ${c()} var |-> "${e.var}",${c()} eqOrIn |-> ${p(e.isEq)},${c()} exp |-> ${r(e.exp)},${c()}${o(` do |-> `)}${u(e.Do)}]${s()}${s()}`;case`When`:return`${o(``)}[type |-> "when", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`PrintS`:return`${o(``)}[type |-> "print", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Assert`:return`${o(``)}[type |-> "assert", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Skip`:return`[type |-> "skip"]`;case`LabelIf`:return`${o(``)}[type |-> "labelIf",${c()} test |-> ${r(e.test)},${c()}${o(` unlabThen |-> `)}${u(e.unlabThen)},${s()}${c()}${o(` labThen |-> `)}${u(e.labThen)},${s()}${c()}${o(` unlabElse |-> `)}${u(e.unlabElse)},${s()}${c()}${o(` labElse |-> `)}${u(e.labElse)}]${s()}${c()}${s()}`;case`LabelEither`:return`${o(``)}[type |-> "labelEither",${c()}${o(` clauses |-> `)}${u(e.clauses)}]${s()}${c()}${s()}`;case`Clause`:return`${o(``)}${o(`[unlabOr |-> `)}${u(e.unlabOr)},${s()}${c()}${o(` labOr |-> `)}${u(e.labOr)}]${s()}${c()}${s()}`;case`Call`:return`${o(``)}[type |-> "call",${c()} returnTo |-> "${e.returnTo}",${c()} to |-> "${e.to}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`;case`Return`:return`[type |-> "return", from |-> "${e.from??`null`}"]`;case`CallReturn`:return`${o(``)}[type |-> "callReturn",${c()} from |-> "${e.from??`null`}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`CallGoto`:return`${o(``)}[type |-> "callGoto",${c()} after |-> "${e.after}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`Goto`:return`[type |-> "goto", to |-> "${e.to}"]`;case`Macro`:return`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${o(`<<`)}${e.params.join(`, ${c()}`)}>>${s()},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`MacroCall`:return`${o(``)}[type |-> "macrocall",${c()} name |-> "${e.name}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`}};return m(e)},Ze=(e,t,n)=>({lines:e,currentLine:t<e.length?Array.from(e[t]):void 0,line:t,column:n,vcolumn:t<e.length?Array.from(e[t].slice(0,n)).length:0}),Qe=e=>{if(e.currentLine===void 0)return` `;if(e.currentLine.length===e.column)return e.line+=1,e.column=0,e.vcolumn=0,e.currentLine=e.line>=e.lines.length?void 0:Array.from(e.lines[e.line]),`
19
- `;let t=e.currentLine[e.column];return e.column+=1,e.vcolumn+=1,t},$e=e=>{if(e.column>0)--e.column,--e.vcolumn;else{if(e.line===0)throw new t.o(`PcalCharReader.backspace trying to move past beginning of reader`);--e.line,e.currentLine=Array.from(e.lines[e.line]),e.column=Math.max(e.currentLine.length-1,0),e.vcolumn=e.column}},et=e=>{for(;;){let t=Qe(e);if(t===` `)return` `;if(t!==` `&&t!==`
20
- `)break}return $e(e),`${(e.currentLine??[]).slice(e.column).join(``)}\n`},tt=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`⟨`]),nt=/* @__PURE__ */ new Set([`>>_`,`⟩_`,`]_`,`)`,`}`,`]`,`>>`,`⟩`]),rt=/* @__PURE__ */ new Set([...tt,...nt,...`_ ASSUME ASSUMPTION AXIOM BOOLEAN CASE CONSTANT CONSTANTS EXCEPT EXTENDS FALSE IF INSTANCE LOCAL MODULE OTHER STRING THEOREM TRUE VARIABLE VARIABLES WITH WF_ SF_`.split(` `),...`\\A ∀ \\forall \\E ∃ \\exists \\AA \\EE ~ ¬ \\lnot \\neg <> ◇ CHOOSE ENABLED UNCHANGED SUBSET UNION DOMAIN ' ^+ ⁺ ^* ^#`.split(` `),...`=> ⇒ \\cdot ⋅ <=> ⇔ \\equiv ≡ ~> ↝ -+-> ⇸ \\subseteq ⊆ \\subset ⊂ \\supset ⊃ \\supseteq ⊇ \\ll ≪ \\gg ≫ \\ \\cap \\intersect ∩ \\cup \\union ∪ /\\ ∧ \\/ ∨ \\land \\lor \\X × - + * / ^ | || ‖ & && ++ -- ** // ^^ |- ⊢ |= ⊨ -| ⊣ =| ⫤ <: :> := ≔ ::= ⩴`.split(` `),...`(+) ⊕ (-) ⊖ \\oplus \\ominus (.) ⊙ \\odot (/) ⊘ \\oslash (\\X) ⊗ \\otimes \\uplus ⊎ \\sqcap ⊓ \\sqcup ⊔ \\div ÷ \\star ⋆ \\o ∘ \\circ \\bigcirc ◯ \\bullet ●`.split(` `),...`\\in ∈ \\notin ∉ = # /= ≠ < > =< <= ≤ >= ≥ \\prec ≺ \\succ ≻ \\preceq ⪯ \\succeq ⪰ \\sim ∼ \\simeq ≃ \\approx ≈ \\doteq ≐ \\asymp ≍ \\sqsubset ⊏ \\sqsupset ⊐ \\sqsubseteq ⊑ \\sqsupseteq ⊒ \\propto ∝`.split(` `),...`: -> → |-> ↦ <- ← == ≜ ELSE THEN LET IN [] □ .. ‥ ... … $ $$ ? ?? ⁇ % %% ## @@ !! ‼ \\times \\leq \\geq \\mod \\wr ≀ ≅ ! ; , . -. @`.split(` `)]),it=e=>/^[A-Za-z_]$/.test(e),at=e=>/^[0-9]$/.test(e),ot=e=>e===` `||e===`\f`||e===`\r`,st=new Set([...rt].filter(e=>!it(e[0])&&!(e[0]===`\\`&&it(e[1]??``))).flatMap(e=>Array.from(e,(t,n)=>e.slice(0,e.length-n)))),ct=/* @__PURE__ */ new Set("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ ~!@#$%^&*()_-+={}[]|:;<,>.?/`'0123456789"),lt=new Set(`; do then := ≔ begin variable variables || ‖ end else elsif if either or while with call return goto print assert skip procedure define process fair`.split(` `)),z={...I,dashes:6,endModule:7},ut=()=>({delimiter:``,delimiterLine:0,delimiterCol:0,commentDepth:0}),dt=(e,n,r,i)=>{let a={lines:[],line:[],token:``,state:`start`,column:n.vcolumn,nextColumn:n.vcolumn,nextChar:Qe(n),parenDepth:0,isInQuantifier:!1,isExprEnd:!1,previousToken:` `},o=()=>{a.nextColumn=n.vcolumn,a.nextChar=Qe(n)},s=()=>{a.token+=a.nextChar,o()},c=()=>{a.state=`start`,a.column=a.nextColumn},l=()=>{a.lines.push(a.line),a.line=[],a.column=0},u=e=>{throw new t.s(`${e} \`${a.token}' found at\n line ${n.line+1}, column ${a.column+1}`)},d=()=>{a.isExprEnd=!0,e.delimiter=a.token,e.delimiterCol=a.column,e.delimiterLine=n.line-+(a.nextChar===`
21
- `)},f=e=>{if(!r){d(),a.token=``;return}e>z.ident&&u(`Illegal token in an expression`);let t=a.token;e!==z.string&&(lt.has(t)&&!(e===z.ident&&[`.`,`[`,`,`].includes(a.previousToken))||(t===`,`&&!a.isInQuantifier&&!i||t===`)`||t===`}`)&&a.parenDepth===0)?(a.parenDepth!==0&&u(`Expression with an unmatched (, [, {, or << followed by`),a.isInQuantifier&&u("Expression with \\A or \\E but no following `:` followed by"),d(),a.line.length>0&&l()):(e===z.builtin&&tt.has(t)&&(a.parenDepth+=1),e===z.builtin&&nt.has(t)&&(--a.parenDepth,a.parenDepth<0&&u(`Extra (unmatching)`)),a.previousToken=e===z.string?` `:t,[`\\A`,`∀`,`\\E`,`∃`].includes(t)&&a.parenDepth===0&&(a.isInQuantifier=!0),a.isInQuantifier&&t===`:`&&a.parenDepth===0&&(a.isInQuantifier=!1),(t!==``||e===z.string)&&a.line.push(Ne(t,a.column,e)),a.token=``)},p=e=>{f(e),c()},m=e=>{s(),a.state=e},h=e=>{o(),a.state=e},g=r=>{switch(a.state){case`start`:if(ot(r))return o(),c();if(it(r))return m(`id`);if(r===`ℕ`||r===`ℤ`||r===`ℝ`)return s(),p(z.ident);if(at(r))return m(`numOrId`);if(r===`\\`)return m(`bs`);if(r===`-`)return m(`dash1`);if(r===`=`)return m(`eq1`);if(r===`(`)return h(`leftParen`);if(r===`"`)return h(`string`);if(r===`
22
- `)return o(),l(),c();if(st.has(r))return m(`builtIn`);if(r===` `){a.state=`done`;return}return s(),u(`Illegal lexeme`);case`id`:return a.token===`WF_`||a.token===`SF_`?p(z.builtin):it(r)||at(r)?s():p(rt.has(a.token)?z.builtin:z.ident);case`numOrId`:return at(r)?s():it(r)?m(`id`):p(z.number);case`bs`:if([`b`,`B`,`o`,`O`,`h`,`H`].includes(r))return m(`numOrBi`);if(it(r)){a.state=`bsBuiltIn`;return}if(r===`*`){o(),a.token=``,a.state=`lineComment`;return}a.state=`builtIn`;return;case`numOrBi`:a.state=at(r)?`num`:`bsBuiltIn`;return;case`num`:if(at(r))return s();if(!it(r))return p(z.number);s(),a.token.startsWith(`\\`)&&u(`Illegal lexeme`),a.state=`id`;return;case`bsBuiltIn`:return it(r)&&r!==`_`?s():rt.has(a.token)?p(z.builtin):u(`Illegal lexeme `);case`builtIn`:if(st.has(a.token+r))return s();if(!rt.has(a.token)){for($e(n);!rt.has(a.token);)$e(n),a.token.length===0&&u(`Illegal lexeme`),a.token=Array.from(a.token).slice(0,-1).join(``);o()}return p(z.builtin);case`dash1`:case`dash2`:if(r===`-`)return m(a.state===`dash1`?`dash2`:`dash3`);a.state=`builtIn`;return;case`dash3`:return r!==`-`&&u(`Illegal lexeme`),m(`dashes`);case`dashes`:return r===`-`?s():p(z.dashes);case`eq1`:case`eq2`:if(r===`=`)return m(a.state===`eq1`?`eq2`:`eq3`);a.state=`builtIn`;return;case`eq3`:return r!==`=`&&u(`Illegal lexeme`),m(`eqs`);case`eqs`:return r===`=`?s():p(z.endModule);case`leftParen`:if(r===`*`)return e.commentDepth=1,h(`comment`);a.token=`(`,a.state=`builtIn`;return;case`string`:if(r===`\\`)return m(`escString`);if(r===`"`)return o(),p(z.string);s(),ct.has(r)||u(`Illegal character in string`);return;case`escString`:s(),[`"`,`\\`,`t`,`n`,`f`,`r`].includes(r)||u(`Illegal character following \\ in string`),a.state=`string`;return;case`lineComment`:return r===`(`?h(`lineComParen`):r===`*`&&e.commentDepth>0?h(`lineComStar`):r===`
23
- `||r===` `?(a.token=``,e.commentDepth=0,c()):e.commentDepth===0?s():o();case`lineComParen`:if(r===`*`)return e.commentDepth+=1,h(`lineComment`);e.commentDepth===0&&(a.token+=`(`),a.state=`lineComment`;return;case`lineComStar`:if(r===`)`){if(--e.commentDepth,e.commentDepth<0)throw new t.o(`Failure of assertion: case LINE_COM_STAR`);return h(`lineComment`)}e.commentDepth===0&&(a.token+=`*`),a.state=`lineComment`;return;case`comment`:case`orComment`:{let n=a.state===`comment`;if(r===`*`)return h(n?`commentStar`:`orCommentStar`);if(r===`(`)return h(n?`commentParen`:`orCommentParen`);if(r===`
24
- `){a.token=``,o(),l(),a.state=`orComment`;return}if(r===` `)throw new t.s(n?`Input ended in the middle of a comment`:`Input ended in the middle of a multi-line comment`);return e.commentDepth===1?s():o()}case`commentStar`:case`orCommentStar`:{let n=a.state===`commentStar`?`comment`:`orComment`;if(r!==`)`){e.commentDepth===1&&(a.token+=`*`),a.state=n;return}if(o(),--e.commentDepth,n===`orComment`&&e.commentDepth<0)throw new t.o(`Assertion failure`);if(e.commentDepth!==0){a.state=n;return}return a.token=``,c()}case`commentParen`:case`orCommentParen`:{let t=a.state===`commentParen`?`comment`:`orComment`;if(r===`*`)return e.commentDepth+=1,h(t);e.commentDepth===1&&(a.token+=`(`),a.state=t;return}}};for(;a.state!==`done`&&!a.isExprEnd;)g(a.nextChar);return a.nextChar!==`
25
- `&&$e(n),Le(a.lines)},ft=(e,t,n)=>dt(e,t,!0,n),pt=(e,t)=>(dt(e,t,!1,!1),e.delimiter),mt=(e,t)=>({params:e,tokenizer:ut(),lookahead:{tokens:Array.from({length:10},()=>``),columns:Array.from({length:10},()=>0),lines:Array.from({length:10},()=>0)},lastToken:{column:0,line:0,text:``},isInMacro:!1,log:t}),ht=()=>Le([[Ne(`defaultInitValue`,0,0)]]),gt=(e,t)=>[...e,...t.filter((n,r)=>!e.includes(n)&&t.indexOf(n)===r)],_t=(e,t)=>!t.some(t=>e.includes(t)),vt=(e,t)=>{t.splice(0,t.length,...e)},yt=(e,n,r)=>{let i=e.params,a=e.lookahead,o=e.lastToken,s={lookaheadSize:0,addedLabels:[],addedLabelsLocs:[],nextLabelNum:1,allLabels:/* @__PURE__ */ new Set,hasLabel:!1,hasDefaultInitialization:!1,currentProcedure:void 0,procedures:[],cSyntax:!1,plusLabels:[],minusLabels:[],proceduresCalled:[],gotoUsed:!1,gotoDoneUsed:!1,omitPC:i.inputVersionNumber>=1500},c=e=>{throw new t.s(`${e}\n line ${o.line}, column ${o.column}`)},l=()=>{if(s.lookaheadSize===0)return et(n),o.column=n.vcolumn+1,o.line=n.line+1,o.text=pt(e.tokenizer,n),o.text;o.column=a.columns[0]+1,o.line=a.lines[0]+1;let t=a.tokens[0];for(let e=1;e<s.lookaheadSize;e++)a.tokens[e-1]=a.tokens[e],a.columns[e-1]=a.columns[e],a.lines[e-1]=a.lines[e];return--s.lookaheadSize,o.text=t,t},u=r=>{for(;s.lookaheadSize<r;){let r=s.lookaheadSize;if(et(n)===` `)throw new t.s(`Premature end of file, perhaps because of unclosed comment, near\n line ${a.lines[r]+1}, column ${a.columns[r]+1}`);a.columns[r]=n.vcolumn,a.lines[r]=n.line,a.tokens[r]=pt(e.tokenizer,n),s.lookaheadSize+=1}return a.tokens[r-1]},d=r=>{if(r<s.lookaheadSize)throw new t.o(`ParseAlgorithm.PeekPastAlgToken called to peek after a token
26
- it has already peeked at`);for(;r>s.lookaheadSize;)a.tokens[s.lookaheadSize]=pt(e.tokenizer,n),s.lookaheadSize+=1;return et(n)},f=(r=!1)=>{if(s.lookaheadSize!==0)throw new t.o(`ParseAlgorithm: GetExpr called after lookahead`);let i=ft(e.tokenizer,n,r);return a.tokens[0]=e.tokenizer.delimiter,a.columns[0]=e.tokenizer.delimiterCol,a.lines[0]=e.tokenizer.delimiterLine,s.lookaheadSize=1,i},p=(e,n)=>{if(e===`;`){let e=u(1);if(`end begin else elsif or do macro procedure process fair define } {`.split(` `).includes(e))return;if(`if either while with call return goto print assert skip`.split(` `).includes(e))throw new t.s(`Missing \`;' before line ${a.lines[0]+1}, column ${a.columns[0]+1}`)}let r=l();r!==e&&r!==n&&c(`Expected "${e}" but found "${r}"`)},m=e=>{let t=l();t!==e&&c(`Expected "${e}" but found "${t}"`)},h=()=>{let e=l();return e===`=`?!0:e===`\\in`||e===`∈`?!1:c(`Expected "=" or "\\in" but found "${e}"`)},g=()=>p(u(1)===`,`?`,`:`;`),_=()=>p(s.cSyntax?`{`:`begin`),v=e=>{s.cSyntax?p(`}`):(p(`end`),p(e))},y=()=>{u(1)===`variables`?m(`variables`):p(`variable`)},b=()=>{let e={...R(),kind:`VarDecl`,var:l(),col:o.column,line:o.line,isEq:!0,val:ht()};if(![`=`,`\\in`,`∈`].includes(u(1)))return s.hasDefaultInitialization=!0,e;if(e.isEq=h(),e.val=f(),e.val.tokens.length===0)throw new t.c(`NullPointerException`);return e},x=()=>{y();let e=[],t=[`begin`,`{`,`procedure`,`process`,`fair`,`define`,`macro`];for(;!t.includes(u(1));)e.push(b()),g();return e},S=()=>{let e={...R(),kind:`PVarDecl`,var:l(),col:o.column,line:o.line,val:ht()};if(u(1)!==`=`)return s.hasDefaultInitialization=!0,e;if(p(`=`),e.val=f(),e.val.tokens.length===0)throw new t.c(`NullPointerException`);return e},C=()=>{y();let e=[];for(;u(1)!==`begin`&&u(1)!==`{`;)e.push(S()),g();return e},w=()=>{if(`while if assert print else elsif either or end with when await skip call return goto`.split(` `).includes(u(1)))return!1;let e=et(n);return e.length>0&&e[0]===`:`&&!(e.length>1&&e[1]===`=`)},T=()=>{if(!w())return``;let t=l();e.isInMacro&&c(`A label may not appear in a macro.`),t===`Done`&&c("Cannot use `Done' as a label."),t===`Error`&&c("Cannot use `Error' as a label."),p(`:`),s.hasLabel=!0,s.allLabels.add(t);let n=u(1);return n!==`+`&&n!==`-`||(p(n),(n===`+`?s.plusLabels:s.minusLabels).push(t),s.omitPC=!1),t},E=()=>{let e=[],t=e=>!s.cSyntax&&[`end`,`else`,`elsif`,`or`].includes(e)||s.cSyntax&&e===`}`;for(;!t(u(1));)e.push(...O());return s.cSyntax&&e.length===0&&c(`Empty statement list`),e},D=e=>{m(`{`);let n=E();if(p(`}`),p(`;`),e!==``){if(n[0].lbl!==``)throw new t.s(`Duplicate labeling of statement`,n[0]);n[0].lbl=e}return n},O=()=>{let e=T();if(s.cSyntax&&u(1)===`{`)return D(e);let t=ee();return t.lbl=e,[t]},ee=()=>{let e=u(1);if(e===`if`)return k(0);if(e===`either`)return A();if(e===`with`)return j(0);if(e===`when`||e===`await`){m(e);let n=o.column,r=o.line,i=f();if(i.tokens.length===0)throw new t.c(`NullPointerException`);return p(`;`),{...R(),kind:`When`,col:n,line:r,exp:i}}if(e===`print`||e===`assert`){m(e);let t=o.column,n=o.line,r=f();return r.tokens.length===0&&c(`Empty expression in ${e} statement at `),p(`;`),{...R(),kind:e===`print`?`PrintS`:`Assert`,col:t,line:n,exp:r}}if(e===`skip`){m(`skip`);let e={...R(),kind:`Skip`,col:o.column,line:o.line};return p(`;`),e}if(e===`call`)return N();if(e===`return`){m(`return`);let e={...R(),kind:`Return`,col:o.column,line:o.line,from:s.currentProcedure};return p(`;`),e}if(e===`goto`){m(`goto`);let e=o.column,t=o.line,n=l();return s.gotoUsed=!0,(n===`Done`||n===`"Done"`)&&(s.gotoDoneUsed=!0),p(`;`),{...R(),kind:`Goto`,col:e,line:t,to:n}}return e===`while`?te():d(1)[0]===`(`?ae():re()},te=()=>{m(`while`);let e=o.column,t=o.line;s.cSyntax&&p(`(`);let n=f();s.cSyntax&&p(`)`),n.tokens.length===0&&c(`Empty while test at `),s.cSyntax||p(`do`);let r=s.cSyntax?O():E();return s.cSyntax||(p(`end`),p(`while`),p(`;`)),r.length===0&&c(`Missing body of while statement at`),{...R(),kind:`While`,col:e,line:t,test:n,unlabDo:r,labDo:[]}},k=e=>{m(e===0?`if`:`elsif`);let t={...R(),kind:`LabelIf`,col:o.column,line:o.line,test:Fe(),unlabThen:[],labThen:[],unlabElse:[],labElse:[]};s.cSyntax&&p(`(`),t.test=f(),s.cSyntax&&p(`)`),t.test.tokens.length===0&&c(`Empty if test at `),s.cSyntax||p(`then`),t.unlabThen=s.cSyntax?O():E();let n=u(1);return n===`else`&&(m(`else`),t.unlabElse=s.cSyntax?O():E()),!s.cSyntax&&n===`elsif`&&(t.unlabElse=[k(e+1)]),!s.cSyntax&&![`else`,`elsif`,`end`].includes(n)&&c(`Expecting "else", "elsif", or "end"`),!s.cSyntax&&e===0&&(p(`end`),p(`if`),p(`;`)),t.unlabElse.length===0&&Me(t.unlabThen,t.unlabThen.length-1),t},A=()=>{m(`either`);let e={...R(),kind:`LabelEither`,col:o.column,line:o.line,clauses:[]};for(;;){let n={...R(),kind:`Clause`,unlabOr:s.cSyntax?O():E(),labOr:[]};if(n.unlabOr.length===0)throw new t.s("`either' statement with empty `or' clause",e);if(e.clauses.push(n),u(1)!==`or`)break;m(`or`)}if(s.cSyntax||(m(`end`),p(`either`),p(`;`)),e.clauses.length===1)throw new t.s("`either' statement has no `or'",e);return e},j=e=>{e===0&&(p(`with`),s.cSyntax&&p(`(`));let n={...R(),kind:`With`,col:o.column,line:o.line,var:l(),isEq:!0,exp:Fe(),Do:[]};n.isEq=h(),n.exp=f(),s.cSyntax&&u(1)===`)`||g(),n.exp.tokens.length===0&&c(`Empty with expression at `);let r=!s.cSyntax&&u(1)===`do`,i=s.cSyntax&&u(1)===`)`;if(r&&p(`do`),i&&m(`)`),n.Do=r?E():i?O():[j(e+1)],r&&(p(`end`),p(`with`),p(`;`)),n.Do.length===0)throw new t.s(`Missing body of with statement`,n);return n},ne=()=>{let e=a.columns[0]+1,t=a.lines[0]+1,n={...R(),kind:`Lhs`,col:e,line:t,var:l(),sub:f()};p(`:=`,`≔`);let r=f();return r.tokens.length===0&&c(`Empty right-hand side of assignment at `),{...R(),kind:`SingleAssign`,col:e,line:t,lhs:n,rhs:r}},re=()=>{let e={...R(),kind:`Assign`,col:a.columns[0]+1,line:a.lines[0]+1,ass:[ne()]};for(;u(1)===`||`||u(1)===`‖`;){l();try{e.ass.push(ne())}catch(e){if(!(e instanceof t.s))throw e;c(`Bad assignment statement at `)}}return p(`;`),e},M=()=>{let e=[];if(d(0)[0]!==`)`)for(;;){let t=f();if(e.push(t),t.tokens.length===0&&c(`Empty argument in call statement at `),u(1)===`)`)break;p(`,`)}return p(`)`),p(`;`),e},ie=()=>{m(`call`);let e={...R(),kind:`Call`,col:o.column,line:o.line,returnTo:``,to:l(),args:[]};return p(`(`),e.args=M(),s.proceduresCalled.includes(e.to)||s.proceduresCalled.push(e.to),e},N=()=>{let e=ie();if(u(1)===`return`)return m(`return`),p(`;`),{...R(),kind:`CallReturn`,col:e.col,line:e.line,to:e.to,from:s.currentProcedure,args:e.args};if(u(1)!==`goto`)return e;m(`goto`);let t={...R(),kind:`CallGoto`,col:e.col,line:e.line,to:e.to,after:l(),args:e.args};return s.gotoUsed=!0,(t.to===`Done`||t.to===`"Done"`)&&(s.gotoDoneUsed=!0),p(`;`),t},ae=()=>{let e={...R(),kind:`MacroCall`,name:l(),col:o.column,line:o.line,args:[]};return m(`(`),e.args=M(),e},oe=t=>{e.isInMacro=!0,m(`macro`);let n={...R(),kind:`Macro`,col:o.column,line:o.line,name:l(),params:[],body:[]};for(p(`(`);u(1)!==`)`;)n.params.length>0&&p(`,`),n.params.push(l());return m(`)`),_(),n.body=E(),v(`macro`),u(1)===`;`&&l(),_e(n.body,t),e.isInMacro=!1,n},se=()=>{p(`procedure`);let e={...R(),kind:`Procedure`,col:o.column,line:o.line,name:l(),minusLabels:[],plusLabels:[],proceduresCalled:[],params:[],decls:[],body:[]};for(s.currentProcedure=e.name,s.plusLabels=[],s.minusLabels=[],s.proceduresCalled=[],p(`(`);u(1)!==`)`;)e.params.length>0&&p(`,`),e.params.push(S());return m(`)`),u(1)!==`begin`&&u(1)!==`{`&&(e.decls=C()),_(),e.body=E(),v(`procedure`),u(1)===`;`&&l(),s.currentProcedure=void 0,e.plusLabels=s.plusLabels,e.minusLabels=s.minusLabels,e.proceduresCalled=s.proceduresCalled,e},ce=()=>{p(`process`);let e=o.column,t=o.line;s.cSyntax&&p(`(`);let n=l(),r=h(),i=f();s.plusLabels=[],s.minusLabels=[],s.proceduresCalled=[],s.cSyntax&&p(`)`),i.tokens.length===0&&c(`Empty process id at `);let a=u(1)===`begin`||u(1)===`{`?[]:x();_();let d=E();return v(`process`),u(1)===`;`&&l(),{...R(),kind:`Process`,col:e,line:t,name:n,fairness:0,minusLabels:s.minusLabels,plusLabels:s.plusLabels,proceduresCalled:s.proceduresCalled,isEq:r,id:i,decls:a,body:d}},le=()=>{let e=`${i.labelRoot}${s.nextLabelNum}`;return s.nextLabelNum+=1,s.allLabels.has(e)?le():e},ue=e=>{e.lbl===``&&(e.lbl=le(),s.addedLabels.push(e.lbl),s.addedLabelsLocs.push(Ae(e)))},de=(e,n,r,i,a)=>{vt(i,a);let o={isNextLabeled:n,hasLabel:!1},c=e=>{ue(e),o.hasLabel=!0,a.length=0};return e.forEach(e=>{if(e.lbl!==``&&(o.hasLabel=!0,a.length=0,r))throw new t.s("Label in `with' statement",e);if(o.isNextLabeled){if(r)throw new t.s("Statement follows `call' or `return' inside a `with' statement.",e);c(e),o.isNextLabeled=!1}switch(e.kind){case`LabelIf`:{let t=[],n=[],i=de(e.unlabThen,!1,r,a,t);o.isNextLabeled=de(e.unlabElse,!1,r,a,n)||i,vt(gt(t,n),a);return}case`LabelEither`:{let t=[];e.clauses.forEach(e=>{let n=[];o.isNextLabeled=de(e.unlabOr,!1,r,a,n)||o.isNextLabeled,vt(gt(n,t),t)}),vt(t,a);return}case`While`:if(r)throw new t.s("`while' inside a `with' statement",e);c(e),de(e.unlabDo,!1,!1,a,[]),o.isNextLabeled=!1;return;case`With`:{let t=[];o.isNextLabeled=de(e.Do,!1,!0,r?[...i]:[],t),vt(t,a),!r&&!_t(i,a)&&c(e);return}}let n=e.kind===`Call`||e.kind===`CallGoto`,l=e.kind===`Return`||e.kind===`CallReturn`,u=e.kind===`Assign`?gt([],e.ass.map(e=>e.lhs.var)):n||l?[`stack`,...l||e.to===s.currentProcedure?s.procedures.flatMap(e=>[...e.params,...e.decls].map(e=>e.var)):[]]:[];if(o.isNextLabeled=n||l||e.kind===`Goto`,_t(a,u))vt(gt(a,u),a);else{if(r)throw new t.s(e.kind===`Assign`?"Second assignment to same variable inside a `with' statement":"Call or return makes second assignment to a variable inside a `with' statement",e);c(e),vt(u,a)}}),o.hasLabel||o.isNextLabeled},fe=e=>{let t=e=>{let t=e.findIndex(e=>e.lbl!==``),n=t===-1?e:e.slice(0,t);return fe(n),{unlabeled:n,labeled:pe(t===-1?[]:e.slice(t))}};e.forEach(e=>{switch(e.kind){case`LabelIf`:{let n=t(e.unlabThen);e.unlabThen=n.unlabeled,e.labThen=n.labeled;let r=t(e.unlabElse);e.unlabElse=r.unlabeled,e.labElse=r.labeled;return}case`LabelEither`:e.clauses.forEach(e=>{let n=t(e.unlabOr);e.unlabOr=n.unlabeled,e.labOr=n.labeled});return;case`While`:{let n=t(e.unlabDo);e.unlabDo=n.unlabeled,e.labDo=n.labeled}}})},pe=e=>{let n=[];return e.forEach(e=>{if(e.lbl===``&&n.length>0)n[n.length-1].stmts.push(e);else{if(e.lbl===``)throw new t.o(`Failure of assertion: Missing Label in MakeLabeledStmtSeq`);n.push({...R(),kind:`LabeledStmt`,col:e.col,line:e.line,macroCol:e.macroCol,macroLine:e.macroLine,label:e.lbl,stmts:[e]})}}),n.forEach(e=>fe(e.stmts)),n},me=(e,n)=>{let r=e[n];switch(r.kind){case`LabelIf`:{let t=P(r.unlabThen);r.labThen.forEach(e=>P(e.stmts));let i=P(r.unlabElse);return r.labElse.forEach(e=>P(e.stmts)),r.labThen.length>0||r.labElse.length>0||t===2||i===2?2:(e[n]={...R(),kind:`If`,test:r.test,Then:r.unlabThen,Else:r.unlabElse},+(t+i>0))}case`LabelEither`:{let t=r.clauses.reduce((e,t)=>{let n=Math.max(e,P(t.unlabOr));return t.labOr.forEach(e=>P(e.stmts)),t.labOr.length>0?2:n},0);return t===2?2:(e[n]={...R(),kind:`Either`,ors:r.clauses.map(e=>e.unlabOr)},t)}case`With`:{let e=P(r.Do);if(e===2)throw new t.s(`with statement at ${Ae(r)} contains a labeled statement`);return e}case`While`:if(n!==0)throw new t.o("ParseAlgorithm.ClassifyStmtSeq encountered `while' not at beginning of StmtSeq.");return P(r.unlabDo),r.labDo.forEach(e=>P(e.stmts)),0;case`Call`:return e[n+1]?.kind===`Return`?0:1;case`Return`:case`CallReturn`:if(s.currentProcedure===void 0)throw new t.s(`return statement not in a procedure at ${Ae(r)}`);return 1;case`Goto`:case`CallGoto`:return 1;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`MacroCall`:return 0;default:throw new t.o(`ParseAlgorithm.ClassifyStmtSeq encountered the unexpected statement type ${r.kind}`)}},P=e=>{for(let n=0;n<e.length;n++){let r=me(e,n);if(r!==0){if(n===e.length-1)return r;throw new t.o(`Translator discovered later than it should have that\n Statement at ${Ae(e[n+1])} must have a label`)}}return 0},F=e=>{de(e,!0,!1,[],[]);let t=pe(e);return t.forEach(e=>P(e.stmts)),t},he=(e,n,r,i,a)=>{let o=e=>qe(e,n,r),s=e=>e.map(e=>he(e,n,r,i,a)),c=e=>e.map(e=>({...R(),kind:`LabeledStmt`,label:e.label,stmts:e.stmts.map(e=>he(e,n,r,-1,0))})),l={...R(),col:e.col,line:e.line,macroCol:i>0?a:e.macroCol,macroLine:i>0?i:e.macroLine};switch(e.kind){case`Assign`:return{...l,kind:`Assign`,ass:e.ass.map(e=>ge(e,n,r,i,a))};case`If`:return{...l,kind:`If`,test:o(e.test),Then:s(e.Then),Else:s(e.Else)};case`Either`:return{...l,kind:`Either`,ors:e.ors.map(s)};case`With`:return{...l,kind:`With`,var:e.var,isEq:e.isEq,exp:o(e.exp),Do:s(e.Do)};case`When`:case`Assert`:case`PrintS`:return{...l,kind:e.kind,exp:o(e.exp)};case`Skip`:return{...l,kind:`Skip`,macroCol:i>0?a:0,macroLine:i>0?i:-1};case`While`:return{...l,kind:`While`,test:o(e.test),unlabDo:s(e.unlabDo),labDo:c(e.labDo)};case`LabelIf`:return{...l,kind:`LabelIf`,test:o(e.test),unlabThen:s(e.unlabThen),labThen:c(e.labThen),unlabElse:s(e.unlabElse),labElse:c(e.labElse)};case`LabelEither`:return{...l,kind:`LabelEither`,clauses:e.clauses.map(e=>({...R(),kind:`Clause`,labOr:c(e.labOr),unlabOr:s(e.unlabOr)}))};case`Call`:return{...l,kind:`Call`,to:e.to,returnTo:e.returnTo,args:Je(e.args,n,r)};case`Return`:return{...l,kind:`Return`,from:e.from};case`CallReturn`:return{...l,kind:`CallReturn`,to:e.to,from:e.from,args:Je(e.args,n,r)};case`CallGoto`:return{...l,kind:`CallGoto`,to:e.to,after:e.after,args:Je(e.args,n,r)};case`Goto`:return{...l,kind:`Goto`,to:e.to};default:throw new t.o(`Found unexpected statement type in macro at${Ae(e)}`)}},ge=(e,n,r,i,a)=>{let o=qe(e.rhs,n,r),s={...R(),kind:`Lhs`,var:e.lhs.var,sub:e.lhs.sub.tokens.length===0?e.lhs.sub:qe(e.lhs.sub,n,r)},c={...R(),kind:`SingleAssign`,col:e.col,line:e.line,macroCol:i>0?a:e.macroCol,macroLine:i>0?i:e.macroLine,lhs:s,rhs:o},l=r.indexOf(s.var);if(l===-1)return c;let u=n[l],d=He(u,{line:0,item:0});if(d.type!==I.ident)throw new t.s(`Macro expansion substitutes \`${d.string}' for assignment variable\n at ${Ae(c)}`);if(s.var=d.string,Ue(u,{line:0,item:0},1)===void 0)return c;let f=ze(u);return f.tokens[0].splice(0,1),Ie(f),s.sub.tokens.length===0?s.sub=f:Be(s.sub,f,0),c},_e=(e,t)=>{let n=e.flatMap(e=>{switch(e.kind){case`LabelIf`:return _e(e.unlabThen,t),_e(e.unlabElse,t),[e];case`LabelEither`:return e.clauses.forEach(e=>_e(e.unlabOr,t)),[e];case`With`:return _e(e.Do,t),[e];case`While`:return _e(e.unlabDo,t),[e];case`MacroCall`:return ve(e,t);default:return[e]}});e.splice(0,e.length,...n)},ve=(e,n)=>{let r=n.findLast(t=>t.name===e.name);if(r===void 0)throw new t.s(`Macro ${e.name} undefined,\n at ${Ae(e)}`);if(r.params.length!==e.args.length)throw new t.s(`Macro ${e.name} called with wrong number of arguments at \n ${Ae(e)}`);let i=r.body.map(t=>he(t,e.args,r.params,e.line,e.col));return i.length>0&&(i[0].lbl=e.lbl),i},ye=e=>{e.forEach((n,r)=>{if(e.slice(r+1).some(e=>e.name===n.name))throw new t.s(`Multiple definitions of macro name \`${n.name}'`)})},be=e=>{if(e.length===0)return;let t=()=>{s.omitPC=!1},n=e[0];if(e.length>1||n.kind!==`LabeledStmt`)return t();if(n.stmts.length===0)return;let r=n.stmts[0];if(n.stmts.length>1||r.kind!==`While`||!Ve(r.test)||r.test.tokens[0][0].string!==`TRUE`)return t();r.labDo.length>0&&(s.omitPC=!1),r.unlabDo.some(e=>[`LabelIf`,`LabelEither`,`LabeledStmt`].includes(e.kind))&&(s.omitPC=!1)},xe=()=>{let e=s.addedLabels.length>1?`Missing labels at the following locations:`:`Missing label at the following location:`;throw new t.s([e,...s.addedLabelsLocs].join(`
27
- `))},Se=e=>s.procedures.forEach(t=>{s.currentProcedure=t.name,_e(t.body,e),t.body=F(t.body)}),Ce=()=>{r&&l()!==`algorithm`&&c("`--fair' not followed by `algorithm'");let t=l();s.cSyntax=u(1)===`{`,s.cSyntax&&m(`{`);let n=u(1)===`variable`||u(1)===`variables`?x():[],a={value:Fe()};u(1)===`define`&&(m(`define`),s.cSyntax&&p(`{`),a.value=f(!0),v(`define`),p(`;`));let o=[];for(;u(1)===`macro`;)o.push(oe(o));for(;u(1)===`procedure`;)s.procedures.push(se()),s.omitPC=!1;if(u(1)===`fair`&&(u(2)===`process`||u(2)===`+`&&u(3)===`process`)||u(1)===`process`){let r=[];for(;u(1)===`fair`||u(1)===`process`;){let e=u(1)===`fair`;e&&m(`fair`);let t=e&&u(1)===`+`;t&&m(`+`);let n=t||!e&&i.fairnessOption===`sf`?2:e||i.fairnessOption===`wf`?1:0;r.push({...ce(),fairness:n})}return v(`algorithm`),ye(o),r.forEach(e=>{_e(e.body,o),e.body=F(e.body),be(e.body)}),Se(o),s.addedLabels.length>0&&(i.labelFlag||xe(),e.log(`Labels added.`)),(s.gotoDoneUsed||s.gotoUsed)&&(s.omitPC=!1),{...R(),kind:`Multiprocess`,name:t,decls:n,defs:a.value,macros:o,prcds:s.procedures,procs:r}}i.inputVersionNumber===1500&&u(1)===`fair`&&(p(`fair`),u(1)===`+`&&p(`+`),i.fairnessOption=`wf`),r&&([``,`wf`,`wfNext`].includes(i.fairnessOption)||e.log(`Warning: Option \`${i.fairnessOption}' specified for --fair algorithm.`),i.fairnessOption=`wf`),_();let d=E();ye(o),_e(d,o),Se(o),s.cSyntax&&p(`}`),v(`algorithm`);let h=F(d);return s.addedLabels.length>0&&(s.hasLabel&&!i.labelFlag&&xe(),e.log(`Labels added.`)),(s.gotoUsed||s.gotoDoneUsed)&&(s.omitPC=!1),be(h),{...R(),kind:`Uniprocess`,name:t,decls:n,defs:a.value,macros:o,prcds:s.procedures,body:h}};try{return{ast:Ce(),omitPC:s.omitPC,hasDefaultInitialization:s.hasDefaultInitialization}}catch(e){if(!(e instanceof t.c))throw e;return c(`Unknown error at or before`)}},B={global:0,label:1,procedure:2,process:3,processVar:4,procedureVar:5,parameter:6},bt=[`Global variable`,`Label`,`Procedure`,`Process`,`Process variable`,`Procedure variable`,`Parameter`],xt=/* @__PURE__ */ new Set([B.global,B.processVar,B.procedureVar,B.parameter]),St=(e,t,n,r)=>e.symbols.find(e=>e.id===n&&e.context===r&&e.type===t),Ct=(e,t,n)=>e.symbols.find(e=>e.id===t&&e.context===n),wt=(e,t)=>{let n=e.procedures.findIndex(e=>e.name===t);return n===-1?e.procedures.length:n},Tt=(e,t,n,r)=>!(t===B.procedureVar||t===B.processVar||t===B.parameter?St(e,B.global,n,``)!==void 0||Ct(e,n,r)!==void 0:St(e,t,n,r)!==void 0)&&(e.symbols.push({type:t,id:n,context:r,useThis:n}),!0),Et=(e,t,n,r)=>St(e,t,n,r)?.useThis??n,Dt=(e,t,n)=>{let r=Ct(e,t,n);return r===void 0?t:xt.has(r.type)?r.useThis:t},Ot=e=>{let n={symbols:[],procedures:[],processNames:[],errorReport:``},r=(e,t)=>{Tt(n,B.label,e.label,t)||(n.errorReport+=`\nLabel ${e.label} redefined at line ${e.line}, column ${e.col}`),e.stmts.forEach(e=>i(e,t))},i=(e,n)=>{let a=e=>e.forEach(e=>i(e,n)),o=e=>e.forEach(e=>r(e,n));switch(e.kind){case`While`:a(e.unlabDo),o(e.labDo);return;case`If`:a(e.Then),a(e.Else);return;case`With`:a(e.Do);return;case`LabelIf`:a(e.unlabThen),o(e.labThen),a(e.unlabElse),o(e.labElse);return;case`Either`:e.ors.forEach(a);return;case`LabelEither`:e.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`Call`:case`Return`:case`CallReturn`:case`CallGoto`:case`Goto`:return;default:throw new t.o(`Unexpected AST type ${e.kind}`)}},a=(e,t,r=t===``?B.global:B.processVar)=>{Tt(n,r,e.var,t)||(n.errorReport+=`\n${bt[r]} ${e.var} redefined at line ${e.line}, column ${e.col}`)};if(Tt(n,B.global,`pc`,``),e.prcds.length>0&&Tt(n,B.global,`stack`,``),e.decls.forEach(e=>a(e,``)),e.prcds.forEach(e=>{let t=wt(n,e.name)<n.procedures.length;t&&(n.errorReport+=`\nProcedure ${e.name} redefined at line ${e.line}, column ${e.col}`),t||n.procedures.push({name:e.name,params:e.params,decls:e.decls,initialPC:e.body.length===0?void 0:je(e.body[0]).label}),Tt(n,B.procedure,e.name,``),e.decls.forEach(t=>a(t,e.name,B.procedureVar)),e.params.forEach(t=>a(t,e.name,B.parameter)),e.body.forEach(t=>r(je(t),e.name))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>{let t=n.processNames.includes(e.name);t&&(n.errorReport+=`\nProcess ${e.name} redefined at line ${e.line}, column ${e.col}`),t||n.processNames.push(e.name),Tt(n,B.process,e.name,``),e.decls.forEach(t=>a(t,e.name)),e.body.forEach(t=>r(je(t),e.name))}),e.kind===`Uniprocess`&&e.body.forEach(e=>r(je(e),``)),n.errorReport.length>0)throw new t.s(n.errorReport);return n},kt=e=>{let t=t=>e.symbols.filter(e=>e.useThis===t).length>1,n={isAny:!1};for(let r=0;r<=7;r+=1)e.symbols.forEach(e=>{if(e.type===r){e.useThis=e.id;for(let n=1;r>0&&t(e.useThis);n+=1)e.useThis+=n===1?`_`:e.context[n-2]??String(r);e.id!==e.useThis&&(n.isAny=!0)}});return n.isAny},At=e=>{let n=e.symbols.filter(e=>e.id===`defaultInitValue`).map(e=>`${bt[e.type]} name`);if(n.length>0)throw new t.s(`Cannot use \`defaultInitValue' as ${n.join(` or `)}`)},jt=(e,n,r)=>{let i=(e,t)=>{let r=[],i=[];e.tokens.forEach(e=>e.forEach(e=>{if(e.type!==I.ident)return;let a=Dt(n,e.string,t);r.includes(e.string)||a===e.string||(r.push(e.string),i.push(Le([[Pt(a)]])))})),i.length>0&&Ke(e,i,r,!1)},a=(e,t)=>{e.var=Dt(n,e.var,t),i(e.val,t)},o=(e,t)=>e.forEach((r,i)=>{e[i]=Et(n,B.label,r,t)}),s=(e,t)=>e===void 0?void 0:Et(n,B.procedure,e,t),c=(e,t)=>{e.label=Et(n,B.label,e.label,t),e.stmts.forEach(e=>l(e,t))},l=(e,r)=>{let a=e=>e.forEach(e=>l(e,r)),o=e=>e.forEach(e=>c(e,r)),u=e=>e.forEach(e=>i(e,r));switch(e.kind){case`LabeledStmt`:c(e,r);return;case`While`:a(e.unlabDo),o(e.labDo),i(e.test,r);return;case`Assign`:e.ass.forEach(e=>{e.lhs.var=Dt(n,e.lhs.var,r),i(e.lhs.sub,r),i(e.rhs,r)});return;case`If`:a(e.Then),a(e.Else),i(e.test,r);return;case`With`:i(e.exp,r),a(e.Do);return;case`When`:case`PrintS`:case`Assert`:i(e.exp,r);return;case`Skip`:return;case`LabelIf`:i(e.test,r),a(e.unlabThen),o(e.labThen),a(e.unlabElse),o(e.labElse);return;case`Call`:e.returnTo=Et(n,B.procedure,e.returnTo,r),e.to=Et(n,B.procedure,e.to,r),u(e.args);return;case`Return`:e.from=s(e.from,r);return;case`CallReturn`:e.from=s(e.from,r),e.to=Et(n,B.procedure,e.to,r),u(e.args);return;case`CallGoto`:e.after=Et(n,B.procedure,e.after,r),e.to=Et(n,B.procedure,e.to,r),u(e.args);return;case`Goto`:if(St(n,B.label,e.to,r)===void 0&&e.to!==`Done`)throw new t.s(`goto to non-existent label \`${e.to}' at line ${e.line}, column ${e.col}`);e.to=Et(n,B.label,e.to,r);return;case`Either`:e.ors.forEach(a);return;case`LabelEither`:e.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;default:throw new t.o(`Unexpected AST type${e.kind}`)}},u=e=>{e.decls.forEach(t=>a(t,e.name)),e.params.forEach(t=>a(t,e.name)),e.body.forEach(t=>c(je(t),e.name));let t=Me(n.procedures,wt(n,e.name));o(e.plusLabels,e.name),o(e.minusLabels,e.name),t.initialPC!==void 0&&(t.initialPC=Et(n,B.label,t.initialPC,e.name)),e.name=Et(n,B.procedure,e.name,``),t.name=e.name},d=e=>{e.decls.forEach(t=>a(t,e.name)),e.body.forEach(t=>c(je(t),e.name)),o(e.plusLabels,e.name),o(e.minusLabels,e.name),e.name=Et(n,B.process,e.name,``)};e.decls.forEach(e=>a(e,``)),e.kind===`Multiprocess`&&((e,t)=>{e.forEach(u);let n=e.map(e=>e.name),i=e.map(e=>n.map(t=>e.proceduresCalled.includes(t)));n.forEach((e,t)=>i.forEach(e=>e.forEach((n,r)=>{e[r]=n||e[t]&&i[t][r]}))),e.forEach((e,t)=>{e.proceduresCalled=n.filter((e,n)=>i[t][n])});for(let e of t){d(e);let t=e.proceduresCalled;for(let e=0;e<t.length;e+=1){let a=n.indexOf(t[e]);if(a===-1){r(`\nUnrecoverable error:\n -- Could not find procedure name \`${t[e]}'.\n`);return}n.forEach((e,n)=>{i[a][n]&&!t.includes(e)&&t.push(e)})}}})(e.prcds,e.procs),e.kind===`Uniprocess`&&(e.prcds.forEach(u),e.body.forEach(e=>c(je(e),``)))},Mt=e=>Ne(e,0,I.string),Nt=e=>Ne(e,0,I.added),V=e=>Ne(e,0,I.builtin),Pt=e=>Ne(e,0,I.ident),Ft=(e,t)=>{let n=[];return e.forEach(e=>{let r=n.at(-1),i=r===void 0?0:r.column+Pe(r)+t;n.push(Ne(e.string,i,e.type))}),Le([n])},It=e=>e.tokens.forEach((t,n)=>{let r={column:n===0||n===e.tokens.length-1?1:6};t.forEach(e=>{if(e.column=r.column,r.column+=Pe(e),e.type===I.builtin)switch(e.string){case`|->`:case`↦`:e.column=Math.max(16,e.column+1),r.column=e.column+5;return;case`[`:case`<<`:r.column+=1;return;case`]`:case`>>`:e.column+=1,r.column+=1;return;case`\\o`:e.column+=1,r.column+=2}})}),Lt=(e,t,n,r=0,i=0)=>({...R(),kind:`SingleAssign`,line:r,col:i,lhs:{...R(),kind:`Lhs`,var:e,sub:t},rhs:n}),Rt=(e,t=0,n=0)=>({...R(),kind:`Assign`,line:t,col:n,ass:e}),zt=(e,t,n=0,r=0)=>Rt([Lt(e,Le([]),t,n,r)],n,r),Bt=e=>{if(e.tokens.length>1)return!1;let t=Me(e.tokens,0);return t.length===1?t[0].string===`TRUE`:t.length===3&&t[0].string===`(`&&t[1].string===`TRUE`&&t[2].string===`)`},Vt=e=>({...R(),kind:`When`,exp:Ft([Nt(`pc`),V(`=`),Mt(e)],1)}),Ht=e=>zt(`pc`,Le([[Mt(e??`null`)]])),Ut=e=>[Pt(`Head`),V(`(`),Nt(`stack`),V(`)`),V(`.`),Pt(e)],Wt=()=>[Pt(`Tail`),V(`(`),Nt(`stack`),V(`)`)],Gt=e=>Le([Ut(e)]),Kt=(e,t,n,r)=>{let i=[[V(`<<`),V(`[`),Pt(`procedure`),V(`|->`),Mt(e),V(`,`)],[Pt(`pc`),V(`|->`),...t]];n.forEach(e=>{i[i.length-1].push(V(`,`)),i.push([Pt(e.var),V(`|->`),Pt(e.var)])}),i[i.length-1].push(V(`]`),V(`>>`)),i.push(r);let a=Fe(i);return It(a),Ie(a),a},qt=(e,n,r)=>{if(n.params.length!==r.args.length)throw new t.s(`Procedure ${r.to} called with wrong number of arguments`,r);return n.params.forEach((t,n)=>e.ass.push(Lt(t.var,Le([]),r.args[n],r.line,r.col))),[e,...n.decls.map(e=>zt(e.var,e.val,r.line,r.col)),Ht(n.initialPC)]},Jt=(e,n,r)=>{let i={procedure:void 0},a=(e,r)=>{let i=wt(n,e.to);if(i===n.procedures.length)throw new t.s(`Call of non-existent procedure ${e.to}`,e);let a=n.procedures[i],o=Kt(e.to,[Mt(r)],[...a.decls,...a.params],[V(`\\o`),Nt(`stack`)]);return qt(zt(`stack`,o,e.line,e.col),a,e)},o=e=>{e.from??=i.procedure;let r=e.from;if(r===void 0)throw new t.s("`return' statement not in procedure",e);let a=wt(n,r);if(a>=n.procedures.length)throw new t.s(`Error in procedure (perhaps name used elsewhere)`,e);let o=n.procedures[a],s=(t,n)=>Rt([Lt(t,Fe(),n,e.line,e.col)],e.line,e.col);return[s(`pc`,Gt(`pc`)),...o.decls.map(e=>s(e.var,Gt(e.var))),...o.params.map(e=>s(e.var,Gt(e.var))),s(`stack`,Le([Wt()]))]},s=e=>{let r=e.from;if(r===void 0)throw new t.s(`\`return' statement following \`call' at ${Ae(e)} not in a procedure`);let i=Me(n.procedures,wt(n,r)),a=wt(n,e.to);if(a===n.procedures.length)throw new t.s(`Call of non-existent procedure ${e.to}`,e);let o=n.procedures[a],s=Rt([],e.line,e.col);if(r!==e.to){i.decls.forEach(t=>s.ass.push(Lt(t.var,Fe(),Gt(t.var),e.line,e.col)));let t=Kt(e.to,Ut(`pc`),[...o.decls,...o.params],[V(`\\o`),...Wt()]);s.ass.push(Lt(`stack`,Le([]),t,e.line,e.col))}return qt(s,o,e)},c=(e,t)=>{if(e.length===0)return{stmts:[],labeledStmts:[],needsGoto:!r};let n={stmts:e,labeledStmts:[],needsGoto:!1},i=e[e.length-1];switch(i.kind){case`LabelIf`:case`LabelEither`:{let r=i.kind===`LabelIf`?p(i,t):m(i,t);e.pop(),e.push(r.stmt),n.labeledStmts=r.labeledStmts;break}case`Goto`:e.pop(),e.push(Ht(i.to));break;case`Call`:e.pop(),e.push(...a(i,t));break;case`Return`:e.pop(),e.push(...o(i));break;case`CallReturn`:e.pop(),e.push(...s(i));break;case`CallGoto`:e.pop(),e.push(...a({...R(),kind:`Call`,returnTo:``,to:i.to,args:i.args,line:i.line,col:i.col},i.after));break;case`If`:{let e=c(i.Then,t),a=c(i.Else,t);n.labeledStmts.push(...e.labeledStmts,...a.labeledStmts),i.Then=e.stmts,i.Else=a.stmts,r||(n.needsGoto=e.needsGoto&&a.needsGoto,n.needsGoto||(e.needsGoto&&i.Then.push(Ht(t)),a.needsGoto&&i.Else.push(Ht(t))));break}case`Either`:{let e=i.ors.map((e,r)=>{let a=c(e,t);return i.ors[r]=a.stmts,n.labeledStmts.push(...a.labeledStmts),a});n.needsGoto=e.every(e=>e.needsGoto),!r&&!n.needsGoto&&e.forEach((e,n)=>{e.needsGoto&&i.ors[n].push(Ht(t))});break}case`With`:{let e=c(i.Do,t);i.Do=e.stmts,n.labeledStmts.push(...e.labeledStmts),n.needsGoto=e.needsGoto;break}default:n.needsGoto=!0}return r&&(n.needsGoto=!1),n},l=(e,t)=>{let n=c(e,t);return n.needsGoto&&n.stmts.push(Ht(t)),n},u=(e,t)=>{let n=e.stmts.at(0);if(n?.kind===`While`)return f(e,n,t);let i=l([...e.stmts],t),a=[];return r||(i.stmts.unshift(Vt(e.label)),a.push({...R(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:i.stmts})),a.push(...i.labeledStmts),a},d=(e,t)=>e.flatMap((n,r)=>u(n,r<e.length-1?e[r+1].label:t)),f=(e,t,n)=>{let i=t.labDo.length===0?e.label:t.labDo[0].label,a=l([...t.unlabDo],i),o=l(e.stmts.slice(1),n),s=Bt(t.test),c=s?a.stmts:[{...R(),kind:`If`,test:t.test,Then:a.stmts,Else:o.stmts}];return[{...R(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:[...r?[]:[Vt(e.label)],...c]},...d(t.labDo,e.label),...a.labeledStmts,...s?[]:o.labeledStmts]},p=(e,t)=>{let n=l(e.unlabThen,e.labThen.length===0?t:e.labThen[0].label),r=l(e.unlabElse,e.labElse.length===0?t:e.labElse[0].label),i=d(e.labThen,t);return i.push(...d(e.labElse,t)),i.push(...n.labeledStmts,...r.labeledStmts),{stmt:{...R(),kind:`If`,col:e.col,line:e.line,test:e.test,Then:n.stmts,Else:r.stmts},labeledStmts:i}},m=(e,t)=>{let n=[],r=[];return e.clauses.forEach(e=>{let i=l(e.unlabOr,e.labOr.length>0?e.labOr[0].label:t);n.push(i.stmts),r.push(...i.labeledStmts),r.push(...d(e.labOr,t))}),{stmt:{...R(),kind:`Either`,col:e.col,line:e.line,ors:n},labeledStmts:r}},h=(e,t)=>d(e.map(je),t),g=e=>{i.procedure=e.name;let t=h(e.body,Et(n,B.label,`Error`,``));return i.procedure=void 0,{...R(),kind:`Procedure`,col:e.col,line:e.line,name:e.name,minusLabels:[],plusLabels:[],proceduresCalled:[],params:e.params,decls:e.decls,body:t}},_=e=>({...R(),kind:`Process`,col:e.col,line:e.line,name:e.name,fairness:0,minusLabels:[],plusLabels:[],proceduresCalled:[],isEq:e.isEq,id:e.id,decls:e.decls,body:h(e.body,`Done`)}),v=e.prcds.map(g);return e.kind===`Uniprocess`?{...R(),kind:`Uniprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:v,body:h(e.body,`Done`)}:{...R(),kind:`Multiprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:v,procs:e.procs.map(_)}},Yt=(e,n)=>{let r=n?[]:[`pc`];if(r.push(...e.decls.map(e=>e.var)),e.prcds.length>0&&r.push(`stack`),e.prcds.forEach(e=>{r.push(...e.params.map(e=>e.var)),r.push(...e.decls.map(e=>e.var))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>r.push(...e.decls.map(e=>e.var))),r.length===0)throw new t.s(`The algorithm has no variables.`);let i=(e,t)=>{let n=r.indexOf(t);return n===-1?0:(e[n]+=1,e[n])},a=(e,t)=>t.forEach((t,n)=>{e[n]=Math.max(e[n],t)}),o=e=>[...e].sort((e,t)=>e.lhs.var<t.lhs.var?-1:+(e.lhs.var>t.lhs.var)),s=(e,n)=>{let s=[...n];e.ass=o(e.ass),new Set(e.ass.map(e=>e.lhs.var)).forEach(n=>{let a=e.ass.filter(e=>e.lhs.var===n);if(!r.includes(n))throw new t.s(`Assignment to undeclared variable ${n}`,a[0]);let o=a.some(e=>e.lhs.sub.tokens.length===0);if(i(s,n)>1||a.length>1&&o)throw new t.s(`Multiple assignment to ${n}`,e)}),a(n,s)},c=(e,n)=>{switch(e.kind){case`Assign`:s(e,n);return;case`If`:{let t=[...n],r=[...n];e.Then.forEach(e=>c(e,t)),e.Else.forEach(e=>c(e,r)),a(n,t),a(n,r);return}case`Either`:{let t=[...n];e.ors.forEach(e=>{let r=[...n];e.forEach(e=>c(e,r)),a(t,r)}),a(n,t);return}case`With`:e.Do.forEach(e=>c(e,n));return;case`When`:case`PrintS`:case`Assert`:case`Skip`:return;default:throw new t.o(`Unexpected AST type ${e.kind}`)}},l=e=>e.forEach(e=>{let t=r.map(()=>0);je(e).stmts.forEach(e=>c(e,t))});e.prcds.forEach(e=>l(e.body)),(e.kind===`Uniprocess`?[e.body]:e.procs.map(e=>e.body)).forEach(l)},Xt=(e,t,n,r)=>{let i=Ot(e);kt(i)&&r(`Warning: symbols were renamed.`),jt(e,i,r),Yt(Jt(e,i,t),t),n&&At(i)},Zt=`[ \\t\\n\\x0B\\f\\r]`,Qt=RegExp(`\\\\\\* BEGIN TRANSLATION${Zt}+\\(${Zt}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([pP]([lL][uU][sS])?[cC][aA][lL]\\))${Zt}*(=${Zt}*"(?<pcal>[0-9A-Fa-f]*)"|\\\\in${Zt}*STRING)${Zt}*\\/\\\\${Zt}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([tT][lL][aA]\\+?\\))${Zt}*(=${Zt}*"(?<tla>[0-9A-Fa-f]*)"|\\\\in${Zt}*STRING)${Zt}*\\)`),$t=e=>process.getBuiltinModule(`node:zlib`).crc32(Buffer.from(e,`utf8`)).toString(16),en=(e,t)=>e.log(`\nUnrecoverable error:\n -- ${t}.\n`),tn=(e,t)=>en(e,t.node===void 0||t.node.line===0?t.message:`${t.message}\n at ${Ae(t.node)}`),nn=e=>e.map(e=>`${Array.from(e).reduce((e,t)=>t===` `?e+` `.repeat(8-e.length%8):e+t,``)} `),rn=(e,t,n,r)=>{for(let i=Math.max(t,0);i<e.length;i++){let t=e[i],a=t.indexOf(n);if(a===-1)continue;let o=a+n.length,s=t.slice(o).search(/[^ ]/);if(s!==-1&&o+s===t.indexOf(r))return i}return-1},an=(e,t)=>{for(;t.line<e.length;){let n=e[t.line];for(;t.column<n.length&&n[t.column]===` `;)t.column+=1;if(t.column<n.length)return n;t.line+=1,t.column=0}return``},on=(e,t,n)=>{let r=Array.from(e.slice(t)).findIndex(e=>n.includes(e));return r===-1?e.length:t+e.slice(t,t+r).length},sn=e=>/^[\p{L}\p{Nd}_]$/u.test(e),cn=(e,t,n)=>{for(;t.line<e.length;){let r=an(e,t);if(r.slice(t.column).startsWith(n)){let e=t.column+n.length;if(e>=r.length||!/^[\p{L}_]$/u.test(r[e]))return t.column=on(r,e,` `),!0}t.column=on(r,t.column,` `)}return!1},ln=(e,t)=>en(e,`Command-line error: ${t}`),un=(e,t)=>{let n=e.params,r={isFirst:!0,isExplicitNof:!1},i=t=>(r.isFirst&&=(n.fairnessOption=``,!1),n.fairnessOption===``?(n.fairnessOption=t,!0):(ln(e,`Can only have one of -wf, -sf, -wfNext, and -nof options`),!1));for(let a=0;a<t.length;a++){let o=t[a],s=t[a+1];switch(o){case`-spec`:case`spec`:case`-myspec`:case`myspec`:{let t=o.endsWith(`myspec`);if(n[t?`myspecOption`:`specOption`]=!0,n.specOption&&n.myspecOption){ln(e,`
28
- Can have at most one of the options -spec, -myspec, -spec2, -myspec2, writeAST`);return}if(s===void 0){ln(e,`Specification name must follow \`-${t?`myspec`:`spec`}' option`);return}a+=1;continue}case`-termination`:case`termination`:n.checkTermination=!0;continue;case`-noold`:case`-nocfg`:case`-noDoneDisjunct`:case`noDoneDisjunct`:continue;case`-wf`:case`wf`:case`-sf`:case`sf`:case`-wfNext`:case`wfNext`:case`-nof`:case`nof`:if(!i(o.replace(/^-/,``)))return;o.endsWith(`nof`)&&(r.isExplicitNof=!0);continue;case`-label`:case`label`:n.labelFlag=!0;continue;case`-labelRoot`:case`labelRoot`:if(s===void 0){ln(e,"Label root must follow `-labelRoot' option");return}if(!/^[a-zA-Z][a-zA-Z0-9_]*$/.test(s)){ln(e,`Label root must be a valid PlusCal identifier (must start with a letter and contain only letters, numbers, and underscores)`);return}n.labelRoot=s,a+=1;continue;case`-version`:case`version`:{if(s===void 0){ln(e,"Version number must follow `-version' option");return}let t=ke(s);if(t<0||t>1903){en(e,t<0?`Illegal version ${s} specified.`:`Specified version ${s} later than current version 1.12`),ln(e,`Bad version number`);return}n.inputVersionNumber=t,a+=1;continue}case`-lineWidth`:if(!/^[+-]?\d+$/.test(s??``)||Number(s)<60){ln(e,"Integer value at least 60 must follow `-lineWidth' option");return}a+=1;continue;default:ln(e,`Unknown or illegal option in options statement: ${o}`);return}}n.checkTermination&&n.fairnessOption===``&&!r.isExplicitNof&&(n.fairnessOption=`wf`)},dn=(e,t,n)=>{if(an(t,n),n.column+=7,!an(t,n).slice(n.column).startsWith(`(`)){en(e,"`PlusCal options' not followed by '('");return}n.column+=1;let r=[];for(;;){let e=an(t,n);if(n.line>=t.length||e[n.column]===`)`)break;if(e[n.column]===`,`){n.column+=1;continue}let i=on(e,n.column,` ,)`);r.push(e.slice(n.column,i)),n.column=i}n.line>=t.length?en(e,`No closing ')' found in options statement`):un(e,r)},fn=(e,n,r)=>{let i={depth:0,isDone:!1,isInString:!1};for(let a=n;!i.isDone&&a<e.length;a++){let o=e[a],s=a===n?r:0,c=[o.slice(0,s)];i.isInString=!1;for(let e=s;!i.isDone&&e<o.length;e++){let t=o[e],n=o.slice(e,e+2);if(n===`(*`&&!i.isInString)i.depth+=1,c.push(` `),e+=1;else if(n===`*)`&&!i.isInString&&i.depth===0)c.push(n),i.isDone=!0;else if(n===`*)`&&!i.isInString)--i.depth,c.push(` `),e+=1;else if(i.depth>0)c.push(` `);else if(i.isInString&&t===`\\`&&n.length===2)c.push(n),e+=1;else{if(!i.isInString&&n===`\\*`){c.push(` `);break}t===`"`&&(i.isInString=!i.isInString),c.push(t)}}if(i.isInString)return new t.s(`Unterminated string in line ${a+1}`);e[a]=c.join(``)}},pn=(e,n)=>{let r=10*2**Math.max(0,Math.ceil(Math.log2(n/10)));throw new t.c(`java.lang.ArrayIndexOutOfBoundsException: Index ${e} out of bounds for length ${r}`)},mn=(e,n,r)=>{if(!n.some(e=>e.indexOf(`algorithm`)>0))return/* @__PURE__ */ new Set([`NO_PLUSCAL_EXISTS`]);let i=nn(n),a={line:0,column:0};for(;cn(i,a,`PlusCal`);){let t=an(i,a).slice(a.column),n=Array.from(t).findIndex(e=>!sn(e));if(t.startsWith(`options`)&&(n===-1?t.length:n)===7){dn(e,i,a);break}}let o={line:0,column:-1,isFound:!1,isFair:!1};for(;o.line<i.length;o.line++){let e=i[o.line];if(/^=+$/.test(e))break;let t=e.indexOf(`--algorithm`),n=e.indexOf(`--fair`);if(t!==-1){o.column=t+11,o.isFound=!0;break}if(n!==-1){o.column=n+6,o.isFound=!0,o.isFair=!0;break}}let s=/* @__PURE__ */ new Set,c=rn(i,0,`BEGIN`,`TRANSLATION`);c===-1&&s.add(`NO_TRANSLATION_EXISTS`);let l=rn(i,c+1,`END`,`TRANSLATION`);if(l===-1&&s.add(`NO_TRANSLATION_EXISTS`),c===-1&&l===-1)return s;if(!o.isFound)return s.add(`NO_PLUSCAL_EXISTS`),s;let u=fn(i,o.line,o.column);if(u!==void 0)return tn(e,u),/* @__PURE__ */ new Set([`ERROR_ENCOUNTERED`]);let d={ast:void 0};try{let t=yt(e,Ze(i,o.line,o.column),o.isFair);d.ast=t.ast,Xt(t.ast,t.omitPC,t.hasDefaultInitialization,e.log)}catch(n){if(!(n instanceof t.s))throw n;tn(e,n)}c===-1&&pn(-1,i.length);let f=Qt.exec(i[c]);if(f===null)return s.add(`NO_PCAL_CHECKSUMS_EXIST`),s;let p=f.groups?.pcal,m=o.isFair&&r!==`1.7.4`?`fair`:d.ast===void 0?void 0:Xe(d.ast,e.params.inputVersionNumber,r);p!==void 0&&(m===void 0||p!==$t(m))&&s.add(`PCAL_DIVERGENCE_EXISTS`);let h=f.groups?.tla;if(h!==void 0){if(l===-1)throw new t.c(`java.lang.IllegalArgumentException: fromIndex(${c+1}) > toIndex(-1)`);let e=n.slice(c+1,l).join(``);h!==$t(e)&&s.add(`TLA_DIVERGENCE_EXISTS`)}return s.size===0?/* @__PURE__ */ new Set([`NO_DIVERGENCE`]):s},hn=[[`STRING`,0,0,[],[]],[`FALSE`,0,0,[],[]],[`TRUE`,0,0,[],[]],[`BOOLEAN`,0,0,[],[]],[`=`,2,0,[2,2],[1,1]],[`/=`,2,0,[2,2],[1,1]],[`.`,2,0,void 0,void 0],[`'`,1,2,[1],[0]],[`\\lnot`,1,0,[3],[1]],[`\\neg`,1,0,void 0,void 0],[`\\land`,2,0,[3,3],[1,1]],[`\\lor`,2,0,[3,3],[1,1]],[`\\equiv`,2,0,[3,3],[1,1]],[`=>`,2,0,[3,3],[1,1]],[`SUBSET`,1,0,[2],[1]],[`UNION`,1,0,[2],[1]],[`DOMAIN`,1,0,[2],[1]],[`\\subseteq`,2,0,[2,2],[1,1]],[`\\in`,2,0,[2,2],[1,1]],[`\\notin`,2,0,[2,2],[1,1]],[`\\`,2,0,[2,2],[1,1]],[`\\intersect`,2,0,[2,2],[1,1]],[`\\union`,2,0,[2,2],[1,1]],[`\\times`,2,0,[2,2],[1,1]],[`~>`,2,3,[3,3],[0,0]],[`[]`,1,3,[3],[0]],[`<>`,1,3,[3],[0]],[`ENABLED`,1,1,[2],[0]],[`UNCHANGED`,1,2,[1],[0]],[`\\cdot`,2,2,[2,2],[0,0]],[`-+->`,2,3,[3,3],[0,0]],[`$AngleAct`,2,2,[2,1],[0,0]],[`$BoundedChoose`,-1,0,[2],[1]],[`$BoundedExists`,-1,0,[3],[1]],[`$BoundedForall`,-1,0,[3],[1]],[`$CartesianProd`,-1,0,[2],[1]],[`$Case`,-1,0,[3],[1]],[`$ConjList`,-1,0,[3],[1]],[`$DisjList`,-1,0,[3],[1]],[`$Except`,-1,0,[2],[1]],[`$FcnApply`,2,0,[2,2],[1,1]],[`$FcnConstructor`,-1,0,[3],[1]],[`$IfThenElse`,3,0,[3,3,3],[1,1,1]],[`$NonRecursiveFcnSpec`,1,0,[3],[1]],[`$Pair`,2,0,[3,3],[1,1]],[`$RcdConstructor`,-1,0,[3],[1]],[`$RcdSelect`,2,0,[2,0],[1,1]],[`$RecursiveFcnSpec`,1,0,[3],[1]],[`$Seq`,-1,0,[2],[1]],[`$SetEnumerate`,-1,0,[2],[1]],[`$SetOfAll`,-1,0,[2],[1]],[`$SetOfFcns`,-1,0,[2],[1]],[`$SetOfRcds`,-1,0,[2],[1]],[`$SF`,2,3,[1,2],[0,0]],[`$SquareAct`,2,2,[2,1],[0,0]],[`$SubsetOf`,1,0,[2],[1]],[`$TemporalExists`,1,3,[3],[0]],[`$TemporalForall`,1,3,[3],[0]],[`$TemporalWhile`,2,3,[3,3],[0,0]],[`$Tuple`,-1,0,[2],[1]],[`$UnboundedChoose`,1,0,[2],[1]],[`$UnboundedExists`,1,0,[3],[1]],[`$UnboundedForall`,1,0,[3],[1]],[`$WF`,2,3,[1,2],[0,0]],[`$Nop`,1,0,[3],[1]],[`$Qed`,0,0,[],[]],[`$Pfcase`,1,0,[3],[1]],[`$Have`,1,0,[3],[1]],[`$Take`,1,0,[3],[1]],[`$Pick`,1,0,[3],[1]],[`$Witness`,-1,0,[2],[1]],[`$Suffices`,1,0,[3],[1]]],gn={file:`--TLA+ BUILTINS--`,beginLine:0,beginColumn:0,endLine:0,endColumn:0},H=e=>({id:e,levelChecked:0,level:0,levelParams:/* @__PURE__ */ new Set,allParams:/* @__PURE__ */ new Set,nonLeibnizParams:/* @__PURE__ */ new Set,argLevelParams:/* @__PURE__ */ new Map,levelCorrect:!0,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map}),_n=e=>hn.map(([t,n,r,i,a])=>{let o=e(),s=n<0?void 0:Array.from({length:n},(t,n)=>({...H(e()),kind:`FormalParam`,name:`Formal_${n}`,arity:0,location:void 0})),c=i!==void 0&&a!==void 0,l=a?.map(e=>e>0);return{...H(o),levelChecked:c?99:0,level:r,kind:`OpDef`,defKind:`BuiltIn`,name:t,arity:n,params:s,body:void 0,isLocal:!1,location:gn,module:void 0,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:n<0?(a??[]).slice(0,1):a??[],isLeibnizArg:c?l:void 0,isLeibniz:l?.every(Boolean)??!0,opLevelCond:void 0,maxLevels:n<0?(i??[]).slice(0,1):i??[],minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0}}),vn=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},yn=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,bn=e=>e?.kind===`OpAppl`&&e.isAbsent===!0,xn=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Sn=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),Cn=(e,t)=>(e&2147483647)%t,wn=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[Cn(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},Tn=(e,t,n=t)=>e.buckets[Cn(xn(n),e.buckets.length)].find(e=>e.key===t)?.value,En=(e,t,n,r=t)=>{let i=xn(r),a=e.buckets[Cn(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&wn(e),e.buckets[Cn(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},Dn=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),On=`\0module `,U=()=>({table:Sn(),symbols:[]}),kn=e=>e.kind===`Module`?On+e.name:e.name,An=(e,t)=>{En(e.table,kn(t),t,t.name),e.symbols.push(t)},jn=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,Mn=(e,t)=>Tn(e.table,t),Nn=(e,t)=>Tn(e.table,On+t,t),Pn=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),Fn=(e,t)=>Dn(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),In=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),Ln=/* @__PURE__ */ new Map([[`$Qed`,`QED step`],[`$Pfcase`,`CASE`],[`$Have`,`HAVE`],[`$Take`,`TAKE`],[`$Pick`,`PICK`],[`$Witness`,`WITNESS`],[`$Suffices`,`SUFFICES`]]),Rn=e=>{let t=e.split(`!`);return t.some(e=>e.length===0)?[e]:t},zn=e=>{switch(e.kind){case`Identifier`:return Rn(e.name).map(e=>({op:`Name`,name:e,args:void 0}));case`Apply`:{let t=Rn(e.operator),n=e.argumentCounts??t.map((n,r)=>r===t.length-1?e.args.length:0),r={value:0};return t.map((t,i)=>{let a=e.args.slice(r.value,r.value+n[i]);return r.value+=n[i],{op:`Name`,name:t,args:a.length>0?a:void 0}})}case`Subexpression`:return e.selectors.map(e=>{switch(e.kind){case`Name`:return{op:`Name`,name:e.name,args:e.args.length>0?e.args:void 0};case`Operand`:return{op:e.operand,name:String(e.operand),args:void 0};case`Bound`:return{op:`Null`,name:`!(...)`,args:e.args};case`At`:return{op:`@`,name:`@`,args:void 0};case`Colon`:return{op:`:`,name:`:`,args:void 0}}})}},Bn=e=>{let t=e[e.length-1];return t.op!==`Name`||t.args===void 0},Vn=e=>typeof e.op==`number`?`argument selector ${e.name}`:e.name,Hn=(e,t)=>typeof e==`number`?e>0&&e<=t?e:-1:e===`<<`?t>0?1:-1:e===`>>`&&t===2?2:-1,Un=e=>e.kind===`OpDecl`||e.kind===`FormalParam`||e.kind===`OpDef`&&(e.defKind===`BuiltIn`||e.defKind===`NumberedProofStep`),Wn=e=>e.kind===`FormalParam`||e.kind===`OpDecl`||e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`||e.kind===`Module`,Gn=e=>(e.bounded?.length??0)>0?(e.bounded??[]).flat():e.unbounded??[],Kn=(e,t)=>e===void 0?t:{...e,endLine:t.endLine,endColumn:t.endColumn},qn=e=>(t,n,r,i,a)=>{let o=[],s=[],c=[],l=e=>t[e].location??a,u={name:void 0,nameLocation:void 0,node:void 0,index:0,mode:`FindingOpName`,previousMode:void 0,letInContext:void 0,definitionArityFound:0,definitionArgs:[],isInSuffices:!1},d=e=>e.args??[];for(;u.index<t.length;){let f=t[u.index];if((f.op!==`Name`&&f.op!==`Null`||n!==0)&&f.args!==void 0)return e.addError(l(u.index),`Selector \`${f.name}' should not have argument(s).`);switch(u.mode){case`FindingOpName`:{let f,p,m=[];for(;f===void 0&&u.index<t.length;){let n=t[u.index];if(p=n.op===`Name`?u.name===void 0?e.resolveSynonym(n.name):`${u.name}!${e.resolveSynonym(n.name)}`:void 0,u.name===void 0&&n.op!==`Name`)return e.addError(l(u.index),`Need name or step number here, not \`${n.name}'.`);p!==void 0&&(f=u.letInContext===void 0?e.resolveSymbol(p):Mn(u.letInContext,p)),f===void 0&&(p!==void 0&&(u.name=p,u.nameLocation=Kn(u.nameLocation,l(u.index))),m.push(...d(n)),u.index++)}if(f===void 0&&e.version===`1.7.4`){let n=t.length-1;return e.addError(l(n),`Unknown operator: \`${Vn(t[n])}'.`)}if(f===void 0)return e.addError(u.nameLocation??a,`Unknown operator: \`${u.name}'.`);if(f.kind===`Module`)return e.addError(l(u.index),`Module name (${t[u.index].name}) not allowed here.`);if(u.node=f,u.nameLocation=Kn(u.nameLocation,l(u.index)),u.name=p,Un(f)&&t.length!==1)return e.addError(l(u.index),`Cannot take subexpression of \`${u.name}'.`);let h=jn(f);if(n===0){if(m.push(...d(t[u.index])),u.definitionArityFound+m.length!==h)return e.addError(t[u.index].argsLocation??a,`The operator ${u.name} requires ${h-u.definitionArityFound} arguments.`);m.forEach((t,n)=>u.definitionArgs.push(e.generateArgument(f,n+u.definitionArityFound,t,l(u.index))))}if(u.definitionArityFound=h,f.kind===`OpDef`&&f.defKind===`ModuleInstance`){if(u.index===t.length-1&&!(i||r))return e.addError(l(u.index),`Operator name ${u.name} is incomplete.`)}else{let n=f.kind===`OpDef`&&f.defKind===`UserDefined`||f.kind===`ThmOrAssumpDef`?f:void 0;if(f.kind===`OpDef`&&f.defKind===`UserDefined`&&!f.isDefined&&t.length!==1)return e.addError(l(u.index),`Subexpression of \`${u.name}' used inside the operator's definition.`);if(u.index!==t.length-1&&n!==void 0){s.push(...n.params??[]),u.name=void 0,u.nameLocation=void 0,u.mode=t[u.index+1].op===`Name`?`FollowingLabels`:`FindingSubExpr`,c.push(...u.definitionArgs),u.definitionArityFound=0,u.definitionArgs=[];let e=n.body;for(;e?.kind===`SubstIn`;)o.push(e),e=e.body;for(;e?.kind===`APSubstIn`;)o.push(e),e=e.body;u.mode===`FindingSubExpr`&&(u.node=e)}}u.previousMode=`FindingOpName`;break}case`FollowingLabels`:{let r=u.node,i=r?.kind===`OpDef`||r?.kind===`ThmOrAssumpDef`||r?.kind===`Label`?r.labels.get(f.name):void 0;if(i===void 0)return e.addError(l(u.index),`Cannot find label \`${f.name}'.`);if(u.node=i,e.isOutOfLabelScope(i))return e.addError(l(u.index),`Accessing subexpression labeled \`${f.name}' of ASSUME/PROVE clause within the scope of a declaration\n from outside that declaration's scope.`);if(n===0){if(i.params.length!==d(f).length)return e.addError(l(u.index),`Label \`${f.name}' used with wrong number of arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...i.params),u.index<t.length-1&&t[u.index+1].op!==`Name`&&(u.mode=`FindingSubExpr`),u.mode===`FindingSubExpr`&&(u.node=i.body),u.previousMode=`FollowingLabels`;break}case`FindingSubExpr`:{let n=u.node,r=()=>e.addError(l(u.index),`Nonexistent operand specified by \`${Vn(f)}'.`);if(f.op===`:`){if(!(u.previousMode!==`FindingSubExpr`&&(u.index===t.length-1&&u.previousMode===`FindingOpName`||u.index<t.length-1&&t[u.index+1].op===`Name`)))return e.addError(l(u.index),`\`!:' can be used only after a name and either at the end after an
29
- operator name or before an operator name.`)}else if(n===void 0)return e.addError(l(u.index),`Subexpression selection failed, probably due to an error in the selected expression.`);else if(n.kind===`LetIn`){if(Hn(f.op,1)!==1)return e.addError(l(u.index),`A LET/IN expression has only one operand.`);u.node=n.body}else if(n.kind===`OpAppl`){let i=n.operator,a=n.operands,o=i.kind===`FormalParam`||i.kind===`OpDecl`&&i.declKind===2||i.kind===`OpDef`&&i.defKind===`UserDefined`,p=()=>e.addError(l(u.index),`Internal error: Expecting $Pair and didn't find it.`),m=e=>e?.kind===`OpAppl`&&e.operator.name===`$Pair`,h=Hn(f.op,a.length);if(o){let e=Hn(f.op,i.arity);if(e===-1)return r();u.node=a[e-1]}else if(i.kind===`OpDef`&&i.defKind===`BuiltIn`){if(i.name===`$RcdConstructor`||i.name===`$SetOfRcds`){if(h===-1)return r();let e=a[h-1];if(!m(e))return p();u.node=e.operands[1]}else if(i.name===`$Case`){if(u.index===t.length-1)return e.addError(l(u.index),`Subexpression of CASE must have form !i!j.`);if(h===-1)return r();let n=a[h-1];if(!m(n))return p();u.index++;let i=Hn(t[u.index].op,2);if(i===-1)return e.addError(l(u.index),`Second selector for CASE subexpression must specify one of two operands.`);if(u.node=n.operands[i-1],u.node===void 0)return e.addError(l(u.index),`Selecting OTHER in a CASE statement.`)}else if(i.name===`$Except`){if(h>1)return e.addError(l(u.index),`Selecting subexpression of an EXCEPT not yet implemented.`);if(h===-1)return r();u.node=a[h-1]}else if((n.bounded?.length??0)===0&&(n.unbounded?.length??0)===0){if(h===-1)return r();u.node=a[h-1]}else if(f.op===`Null`||f.op===`@`){let t=Gn(n);if(s.push(...t),f.op===`Null`){if(d(f).length!==t.length)return e.addError(l(u.index),`Selector with ${d(f).length} argument(s) used for quantifier with ${t.length} bound identifier(s).`);c.push(...d(f).map(e.generateExpression))}u.node=a[0]}else{let e=Hn(f.op,n.ranges.length);if(e===-1)return r();u.node=n.ranges[e-1]}}else return e.addError(l(u.index),`Choosing operand \`${f.name}' of subexpression with no operands.`)}else if(n.kind===`AssumeProve`){if(n.isSuffices&&!u.isInSuffices){if(Hn(f.op,1)!==1)return e.addError(l(u.index),`Accessing non-existent subexpression of a SUFFICES`);u.isInSuffices=!0}else{u.isInSuffices=!1;let i=Hn(f.op,1+n.assumptions.length);if(i===-1)return r();if(e.isOutOfClauseScope(n,i))return e.addError(l(u.index),`Accessing ASSUME/PROVE clause within the scope of a declaration
30
- from outside that declaration's scope.`);if(i<=n.assumptions.length){if(u.node=n.assumptions[i-1],u.node.kind===`NewSymb`&&u.index!==t.length-1)return e.addError(l(u.index),`Selected a subexpression of a NEW clause of an ASSUME.`)}else u.node=n.goal}}else if(n.kind===`OpArg`){let t=n.op;if(t.kind!==`OpDef`||t.name!==`LAMBDA`)return e.addError(l(u.index),`Trying to select subexpression of an operator argument.`);if(f.op!==`Null`&&f.op!==`@`)return e.addError(l(u.index),`Cannot use !${f.name} to select subexpression of a LAMBDA.`);if(f.op===`Null`){if(t.arity!==d(f).length)return e.addError(l(u.index),`Selector with ${d(f).length} arguments used for LAMBDA expression taking ${t.arity} arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...t.params??[]),u.node=t.body}else if(n.kind===`Label`)u.node=n.body,u.index--;else return e.addError(l(u.index),`Selecting subexpression of expression that has none.`);if(u.node===void 0)return e.addError(l(u.index),`An unexpected null node specified by '${f.name}'.\nThis is probably due to a previous error.`);if(u.index!==t.length-1){let n=t[u.index+1];if(n.op===`Name`){for(;u.node?.kind===`Label`;)u.node=u.node.body;if(u.node?.kind!==`LetIn`)return e.addError(l(u.index),`A name selector here must be from a LET clause.`);u.letInContext=u.node.context,u.mode=`FindingOpName`}else if(n.op===`:`)return e.addError(l(u.index),`!: should not follow an operand selector.`)}u.previousMode=`FindingSubExpr`;break}}u.index++}let f=u.node;if(f===void 0)return e.addError(a,`Subexpression selection failed, probably due to an error in the selected expression.`);if(f.kind===`AssumeProve`||f.kind===`NewSymb`)return r?f:e.addError(a,f.kind===`AssumeProve`?`Selected ASSUME/PROVE instead of expression.`:`Selected a NEW declaration as an expression or operator.`);if(n<0){let t=f.kind===`OpDef`&&(f.defKind===`UserDefined`||f.defKind===`NumberedProofStep`||f.defKind===`ModuleInstance`&&i)||f.kind===`ThmOrAssumpDef`;return u.previousMode!==`FindingOpName`||!t?e.addError(a,`DEF clause entry should describe a defined operator.`):f.kind===`OpDef`&&f.step!==void 0&&f.step.kind!==`DefStep`?e.addError(a,`DEF clause entry refers to a non-definition step.`):f}if(f.kind===`OpDef`&&f.defKind===`NumberedProofStep`)return e.addError(a,r?`Step number of non-fact used as a fact`:`Step number of non-expression step used as an expression.`);if(n>0){let t=s.length+(f.kind===`OpArg`?jn(f.op):u.previousMode===`FindingOpName`&&Wn(f)?jn(f):0);if(n!==t)return e.addError(a,`Expected arity ${n} but found operator of arity ${t}.`)}let p=f;if(u.previousMode===`FindingOpName`&&s.length+o.length>0){if(p.kind!==`OpDef`&&p.kind!==`ThmOrAssumpDef`)return e.addError(t[t.length-1].location??a,`Internal Error: Found unexpected node kind after FindingOpName`);c.push(...u.definitionArgs);let n=(p.params??[]).map(t=>{let n=e.createFormalParam(t.name,t.arity,t.location);return s.push(n),t.arity===0?e.createOpAppl(n,[],a):e.createOpArg(n,a)});p=e.createOpAppl(p,n,a)}if(p.kind===`OpArg`){if(n===0)return e.addError(a,`Selected operator argument when expression expected.`);if(s.length+o.length>0){let t=p.op;s.push(...Array.from({length:jn(t)},(t,n)=>e.createFormalParam(`NewParam${n}`,0,void 0))),p=e.createOpAppl(t,u.definitionArgs,a)}}if(!r){if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`AssumeProve`||p.kind===`Label`&&p.isAssumeProve)return e.addError(a,`ASSUME/PROVE used where an expression is required.`);if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`OpAppl`){let t=Ln.get(p.body.operator.name);if(t!==void 0)return e.addError(a,`${t} proof step selected instead of expression.`)}}if(p.kind===`FormalParam`||p.kind===`OpDecl`||p.kind===`ThmOrAssumpDef`||p.kind===`OpDef`&&(p.defKind===`UserDefined`||p.defKind===`BuiltIn`))return n>0?e.createOpArg(p,a):e.createOpAppl(p,u.definitionArgs,a);if(p.kind===`OpArg`)return p;if(p.kind===`OpDef`||p.kind===`Module`)return(r||i)&&p.kind===`OpDef`?p:e.addError(a,`Module instantiation selected instead of expression.`);let m=o.reduceRight((t,n)=>e.copySubstIn(n,t),p),h=s.length>0?e.createLambda(s,m,a):void 0;return n>0?h===void 0||s.length!==n?e.addError(a,`Expected operator argument with arity ${n} but found one of arity ${s.length}.`):e.createOpArg(h,a):s.length===c.length?h===void 0?e.createOpAppl(e.getBuiltin(`$Nop`),[m],a):e.createOpAppl(h,c,a):e.addError(a,`Expected ${s.length} arguments but found ${c.length}.`)},Jn=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),Yn=(e,t)=>`${e}:${t}`,Xn=(e,t)=>{let r=n.Zt(t).filter(e=>e.kind!==`End`).map(n.Xt),i=[0,0];for(let e=0;e<t.length;e++)t[e]===`
31
- `&&i.push(e+1);return{name:e,source:t,tokens:r,lineOffsets:i,tokenIndexes:new Map(r.map((e,t)=>[Yn(e.line,e.column),t]))}},W=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,Zn=(e,t,n)=>{let r=0,i=e.tokens.length;for(;r<i;){let a=r+i>>>1,o=e.tokens[a];o.line<t.line||o.line===t.line&&(n?o.column<=t.column:o.column<t.column)?r=a+1:i=a}return r},Qn=(e,t)=>e.tokenIndexes.get(Yn(t.line,t.column))??Math.min(Zn(e,t,!1),e.tokens.length-1),$n=(e,t)=>Math.max(Zn(e,t,!0)-1,0),er=(e,t)=>{let n=e.tokens[t].text,r=Jn.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(W(e,a,n))i++;else if(W(e,a,r)&&(i--,i===0))return a;return t},tr=(e,t)=>({start:Qn(e,t.start),end:$n(e,t.end)}),G=(e,t)=>{let n=t.location.range;if(n)return tr(e,n);let r=Qn(e,t.location);return{start:r,end:er(e,r)}},nr=(e,t)=>{let n=t.start-1,r=t.end+1;return W(e,n,`(`)&&W(e,r,`)`)&&er(e,n)===r?nr(e,{start:n,end:r}):t},rr=(e,t)=>{let n=t.start-1,r=t.end+1;return W(e,n,`(`)&&er(e,n)===r&&(W(e,n-1,`(`)||W(e,n-1,`,`))?rr(e,{start:n,end:r}):t},K=(e,t)=>({file:e.name,beginLine:e.tokens[t.start].line,beginColumn:e.tokens[t.start].column,endLine:e.tokens[t.end].line,endColumn:e.tokens[t.end].endColumn}),q=(e,t)=>K(e,{start:t,end:t}),ir=(e,t,r)=>{let i=0,a=e.lineOffsets[t];for(;a<e.source.length;){if(i=e.source[a]===` `?n.qt(i):i+1,i>=r)return a;a++}return a},ar=(e,t)=>{let n=e.tokens[t],r=ir(e,n.line,n.column);return e.source.slice(r,ir(e,n.line,n.endColumn)+1)},or=(e,t)=>{let n=e.tokens[t],r=e.tokens[t+1];return n?.kind===`Operator`&&n.text===`[]`&&r?.kind===`Keyword`&&(r.text===`ASSUME`||r.text===`PROVE`)&&r.line===n.line&&r.column===n.endColumn+1},sr=e=>{let r=Xn(``,e),i=r.tokens.reduce((e,t,n)=>{if(!or(r,n))return e;let i=ir(r,t.line,t.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},e);if(i!==e&&n.W(e)!==void 0)throw new t.O(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return i},cr=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:ir(e,n.line,n.endColumn)+1,a=e.source.slice(i,ir(e,r.line,r.column)),o=[],s=0;for(;s<a.length;)if(a.startsWith(`\\*`,s)){let e=a.indexOf(`
32
- `,s),t=e===-1?a.length:e+1;o.push(a.slice(s,t)),s=t}else if(a.startsWith(`(*`,s)){let e=1,t=s,n=s+2;for(;e>0&&n<a.length;){let r=a.startsWith(`(*`,n),i=a.startsWith(`*)`,n);r||i?(e+=r?1:-1,n+=2,o.push(a.slice(t,n)),t=n):n++}t<n&&o.push(a.slice(t,n)),s=n}else s++;return o},lr=(e,t,n,r)=>{let i=[];for(let a=t;a<n&&i.length<r.length;a++){let t=e.tokens[a];t.kind===`Identifier`&&t.text===r[i.length]&&i.push(a)}return i},ur=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(W(e,i,r))return i;return-1},dr=new Map(n.G.flatMap(([e,...t])=>t.map(t=>[t,e]))),fr=e=>e.split(`!`).map(e=>dr.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),pr={Constant:{declKind:24,level:0},Variable:{declKind:25,level:1},State:{declKind:26,level:1},Action:{declKind:27,level:2},Temporal:{declKind:28,level:3}},mr=e=>/^[A-Za-z0-9_]+$/.test(e),hr=e=>e!==`!!`&&e.includes(`!`),gr=e=>e.contexts[e.contexts.length-1],_r=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=Mn(e.contexts[n],t);if(r)return r}},vr=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,yr=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,br=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||xr(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&xr(n.module)}return!1},xr=e=>Fn(e,2).length===0&&Fn(e,3).length===0,Sr=e=>[...e.kind===`Let`?e.instances??[]:[],...n.Ut(e).flatMap(Sr)],Cr=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:Cr(e)):Sr(e),wr=(e,t)=>{let n=/* @__PURE__ */ new Set;for(let r of e.units)if(r.kind===`Module`&&n.add(r.module.name),r.kind===`Instance`&&r.instance.module===t)return n.has(t);return!1},Tr=e=>BigInt(e.startsWith(`\\`)?`0${e.slice(1).replace(/^h/i,`x`)}`:e).toString(),Er=e=>{let t=[],n=[],r=/* @__PURE__ */ new Map,i=(a,o)=>{let s=a===e,c=(e,t)=>e.forEach(e=>{t.push(e),r.has(e)||r.set(e,a.name)}),l=e=>!o.has(e);c(a.extends.filter(l),t),c(a.units.flatMap(e=>e.kind===`Instance`?[e.instance]:e.kind===`Definition`?Sr(e.definition.body):e.kind===`Theorem`&&s?Cr(e.theorem.statement):e.kind===`Assumption`&&s?Sr(e.assumption.expression):[]).map(e=>e.module).filter(e=>l(e)&&!wr(a,e)),n);let u=new Map(o);a.modules.forEach(e=>{let t=new Map(u),n=/* @__PURE__ */ new Set,r=e=>{n.has(e)||(n.add(e),e.extends.forEach(e=>{let n=t.get(e);n!==void 0&&(n.modules.forEach(e=>{t.has(e.name)||t.set(e.name,e)}),r(n))}))};r(e),i(e,t),u.set(e.name,e)})};return i(e,/* @__PURE__ */ new Map),{extendees:t,instancees:n,importers:r}},Dr=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),Or=e=>{let t=e.kind===`Apply`?zn(e):void 0;return Dr.has(e.kind)||t!==void 0&&Bn(t)},kr=/* @__PURE__ */ new Map([[`Identifier`,`N_GeneralId`],[`Subexpression`,`N_GeneralId`],[`Number`,`N_Number`],[`Decimal`,`N_Real`],[`SetEnumeration`,`N_SetEnumerate`],[`SetFilter`,`N_SubsetOf`],[`SetMap`,`N_SetOfAll`],[`Tuple`,`N_Tuple`],[`FunctionApplication`,`N_FcnAppl`],[`FunctionConstruction`,`N_FcnConst`],[`FunctionSet`,`N_SetOfFcns`],[`Record`,`N_RcdConstructor`],[`RecordSet`,`N_SetOfRcds`],[`FieldAccess`,`N_RecordComponent`],[`Except`,`N_Except`],[`Prime`,`N_PostfixExpr`],[`Always`,`N_PrefixExpr`],[`Eventually`,`N_PrefixExpr`],[`Enabled`,`N_PrefixExpr`],[`Unchanged`,`N_PrefixExpr`],[`Forall`,`N_BoundedQuant`],[`Exists`,`N_BoundedQuant`],[`UnboundedQuantifier`,`N_UnboundedQuant`],[`Choose`,`N_UnBoundedOrBoundedChoose`],[`If`,`N_IfThenElse`],[`Case`,`N_Case`],[`Let`,`N_LetIn`],[`BoxAction`,`N_ActionExpr`],[`AngleAction`,`N_ActionExpr`],[`WeakFairness`,`N_FairnessExpr`],[`StrongFairness`,`N_FairnessExpr`]]),Ar=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),jr=/* @__PURE__ */ new Set([`'`,`^+`,`^*`,`^#`]),Mr=(e,t)=>jr.has(t)?`N_GenPostfixOp`:e.kind===`Lambda`||t===`~`||t===`-.`?`N_GenNonExpPrefixOp`:`N_GenInfixOp`,Nr=(e,r,i={})=>{let a=[],o=(e,t)=>vn(a,{location:e,text:t,isWarning:!1}),s=(e,t)=>vn(a,{location:e,text:t,isWarning:!0}),c={value:i.version===`1.7.4`?-1:0},l=()=>++c.value,u={id:0},d=(e,t)=>{let n=_r(e,t.name);if(n===t)return;if(n===void 0){An(gr(e),t);return}let r=t.kind===`FormalParam`||vr(n)!==vr(t)||jn(n)!==jn(t);n.kind===`OpDef`&&n.defKind===`BuiltIn`&&!(r&&i.version===`1.7.4`)?o(t.location,`Symbol ${t.name} is a built-in operator, and cannot be redefined.`):r?o(t.location,`Multiply-defined symbol '${t.name}': this definition or declaration conflicts \nwith the one at ${yn(n.location)}.`):br(t,n)||s(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${yn(n.location)}.`)};i.version!==`1.7.4`&&_n(l);let f=_n(l);l();let p=new Map(f.map(e=>[e.name,e])),m=/* @__PURE__ */ new Map,h=/* @__PURE__ */ new Map,g=(e,r)=>{let a=e===i.rootFileName&&i.rootFilePath||`${e}.tla`,o=n=>new t.E(`Could not parse module ${e} from file ${a}`,e,n),s=i.version===`1.7.4`?n.Kt(r):void 0;if(s!==void 0)throw o(s);try{return n.H(sr(r))}catch(e){throw e instanceof t.O?o(n.W(r)??`***Parse Error***\n${e.message}`):e}},_=(e,n,r)=>{let a=h.get(e);if(a)return a;if(n===void 0)throw new t.S(e,r,i.version!==`1.7.4`);i.onParse?.(e);let o=g(e,n);if(o.name!==e)throw new t.E(`File name '${e}' does not match the name '${o.name}' of the top level module it contains.`,void 0);let s={file:Xn(o.name,n),module:o};return h.set(e,s),s},v=[],y=/* @__PURE__ */ new Set,b=[],x=(e,n,i)=>{let a=b.indexOf(e);if(a!==-1)throw new t.E(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...b.slice(a),e].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(y.has(e))return;y.add(e),b.push(e);let o=D(e,_(e,n,i).module);[...o.extendees,...o.instancees].forEach(t=>x(t,r(t),e)),b.pop(),v.push(e)},S=/* @__PURE__ */ new Set,C=(e,t)=>S.has(`${e} ${t}`),w=(e,t,n)=>{let r=h.get(e);if(!r||n.has(e))return;n.add(e);let i=D(e,r.module),a=i[t].find(t=>!C(e,t));if(a!==void 0)return{name:a,importer:e,namingModule:i.importers.get(a)??e};for(let r of[...i.extendees,...i.instancees]){let i=C(e,r)?w(r,t,n):void 0;if(i)return i}},T=t=>{_(t,e);let n=()=>w(t,`extendees`,/* @__PURE__ */ new Set)??w(t,`instancees`,/* @__PURE__ */ new Set);for(let e=n();e!==void 0;e=n())h.has(e.name)||_(e.name,r(e.name),e.namingModule),S.add(`${e.importer} ${e.name}`)},E=i.rootFileName??g(``,e).name,D=(e,t)=>{let n=Er(t);return e!==E||i.rootExtendees===void 0||(n.extendees.splice(t.extends.length,0,...i.rootExtendees),i.rootExtendees.forEach(t=>{n.importers.has(t)||n.importers.set(t,e)})),n};T(E),x(E,e);let O=(e,n,r,a)=>{let c={curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0},f=[],h=[],g=[],_=[],v=/* @__PURE__ */ new WeakSet,y=()=>_.push({labels:/* @__PURE__ */ new Map,params:[]}),b=()=>_.pop()?.labels??/* @__PURE__ */ new Map,x={depth:0,isDeclared:[],goal:void 0,goalClause:0},S=/* @__PURE__ */ new WeakMap,C=/* @__PURE__ */ new WeakMap,w=e=>{let t=e.kind===`AssumeProve`?S.get(e):void 0;t&&(t.isInProof=!1)},T=e=>K(n,G(n,e)),E=e=>e.range?tr(n,e.range):{start:Qn(n,e),end:Qn(n,e)},D={kind:`Module`,id:l(),name:e.name,location:K(n,E(e.location)),extendees:[],context:gr(a),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};r&&r.definitions.push(D);let ee=e=>{for(let t=a.contexts.length-1;t>=0;t--){let n=Nn(a.contexts[t],e);if(n?.kind===`Module`)return n}return m.get(e)},te=e=>{let n=ee(e);if(n===void 0)throw new t.O(`Could not find module ${e}`);return n},k=(e,t)=>{a.contexts.push(e);let n=t();return a.contexts.pop(),n},A=(e,t,n,r)=>{let i={...H(l()),kind:`FormalParam`,name:e,arity:t,location:n};return r&&d(a,i),i},j=e=>({...H(l()),kind:`OpDef`,defKind:`UserDefined`,arity:e.params?.length??0,params:[],body:void 0,isLocal:!1,module:D,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:(e.params??[]).map(()=>0),isLeibnizArg:(e.params??[]).map(()=>!0),isLeibniz:!0,opLevelCond:void 0,maxLevels:(e.params??[]).map(()=>3),minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0,...e}),ne=e=>{e.letInLevel=c.curLevel,c.unresolvedSum>0&&(e.recursiveSection=c.recursiveSectionCount,e.inRecursiveSection=c.unresolvedCount[c.curLevel]>0,D.opDefsInRecursiveSection.push(e))},re=(e,t,n,r={},i=l())=>({...H(i),kind:`OpAppl`,operator:e,operands:t,unbounded:r.unbounded,bounded:r.bounded,tupleOrs:r.tupleOrs,ranges:r.ranges??[],location:n}),M=()=>({...re(ie(`$Nop`),[],gn,{},u.id),isNull:!0}),ie=e=>{let n=p.get(e);if(!n)throw new t.A(`SANY has no builtin operator ${e}`);return n},N=(e,t,n,r={})=>re(ie(e),t,n,r),ae=(e,t)=>({...H(l()),kind:`String`,value:e,location:t}),oe=(e,t)=>({...H(l()),kind:`OpArg`,op:e,location:t}),se=(e,n)=>{let r=_r(a,fr(e));if(r===void 0||r.kind===`Module`)throw new t.O(`Unknown operator: \`${e}' at line ${n.beginLine}, column ${n.beginColumn} of module ${n.file}`);return r},ce=(e,t,n)=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`)return;let r=e.params??[];r.length===t.length?r.forEach((r,i)=>{let a=t[i];r.arity===0&&a.kind===`OpArg`&&o(n,`Operator used in argument number ${i+1} has incorrect number of arguments.`);let s=a.kind===`OpArg`&&jn(a.op)===r.arity&&!(a.op.kind===`OpDef`&&(a.op.params??[]).some(e=>e.arity>0));r.arity>0&&!s&&o(n,`Argument number ${i+1} to operator '${e.name}' \nshould be a ${r.arity}-parameter operator.`)}):o(n,`Wrong number of arguments (${t.length}) given to operator '${e.name}', \nwhich requires ${r.length} arguments.`)},le=qn({version:i.version,resolveSymbol:e=>_r(a,e),resolveSynonym:fr,generateExpression:e=>L(e),generateArgument:(e,t,n,r)=>ve(e,t,n,r),createOpAppl:(e,t,n)=>{let r=re(e,t,n);return ce(e,t,n),r},createOpArg:oe,createFormalParam:(e,t,n)=>A(e,t,n,!1),createLambda:(e,t,r)=>j({name:`LAMBDA`,params:e,body:t,location:r,preComments:cr(n,Qn(n,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>Be(`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:ie,addError:(e,t)=>(o(e,t),M()),isOutOfLabelScope:e=>{let t=C.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=S.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}}),ue=(e,t)=>{let r={value:t.start};return e.map(e=>{let i=e.op===`Name`?e.name:e.op===`Null`?`(`:String(e.op),a=ur(n,r.value,t.end,i);if(a===-1)return e;if(e.op===`Null`){let t=er(n,a);return r.value=t+1,{...e,location:K(n,{start:a,end:t})}}r.value=a+1;let o=q(n,a);if(e.args===void 0||!W(n,a+1,`(`))return{...e,location:o};let s=er(n,a+1);return r.value=s+1,{...e,location:o,argsLocation:K(n,{start:a+1,end:s})}})},de=(e,r,i,a)=>{let o=zn(e);if(o===void 0)throw new t.O(`Expected a name, found ${e.kind}`);return le(ue(o,G(n,e)),r,i,a,T(e))},fe=e=>{let n=de(e,0,!1,!1);if(n.kind!==`OpAppl`)throw new t.O(`Expected an expression`);return n},pe=e=>{if(e.kind!==`OpAppl`)return;let t=f.find(t=>t.name===e.operator.name);t&&(t.node.operator=ie(`$RecursiveFcnSpec`))},me=e=>e.reduce((e,t)=>{let n=e[e.length-1];return n!==void 0&&n[0].set===t.set&&t.pattern.kind===`Name`&&n[0].pattern.kind===`Name`?n.push(t):e.push([t]),e},[]),P=(e,t)=>R(e,t,me(e).map(e=>L(e[0].set))),F=(e,t)=>{let n=_.at(-1);n?.params.push(e);let r=L(t);return n?.params.pop(),r},he=e=>{let t=G(n,e),r=lr(n,t.start,t.end,e.params);return k(U(),()=>{let i=e.params.map((e,t)=>A(e,0,q(n,r[t]),!0)),a=F(i,e.body);return j({name:`LAMBDA`,params:i,body:a,location:K(n,t),preComments:cr(n,t.start)})})},ge=e=>e.kind===`OperatorReference`?e.operator:e.kind===`Lambda`&&e.body.kind===`Apply`?e.body.operator:n.tokens[Qn(n,e.location)].text,_e=(e,n)=>{let r=T(e);if(e.kind===`Lambda`)return e.location.range===void 0?oe(se(ge(e),r),r):oe(he(e),r);if(!Or(e))return o(r,`Arity ${n.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${n.name}'.`),M();if(e.kind===`OperatorReference`)return oe(se(e.operator,r),r);let i=de(e,n.arity,!1,!1);if(i.kind===`OpArg`||i.kind===`OpAppl`&&i.isNull===!0)return i;throw new t.O(`Expected an operator argument at line ${r.beginLine}, column ${r.beginColumn}`)},ve=(e,r,i,s)=>{let c=e.kind===`OpDef`&&(e.defKind===`UserDefined`||e.defKind===`ModuleInstance`)?e.params?.[r]?.arity??0:0;if(c===0)return L(i);let l=G(n,i),u=K(n,l),d=`${r+1} (counting from 1)`,f=rr(n,l);if(f!==l||!Or(i))return o(K(n,f),`An expression appears as argument number ${d} to operator '${e.name}', in a position an operator is required.`),M();if(i.kind===`Identifier`||i.kind===`Subexpression`||i.kind===`Apply`){let e=de(i,c,!1,!1);if(e.kind===`OpArg`||e.kind===`OpAppl`)return e;throw new t.O(`Expected an operator argument at ${yn(u)}`)}if(i.kind===`Lambda`&&i.location.range!==void 0){let t=he(i),n=jn(t);return n===c?oe(t,u):(o(s,`Lambda expression with arity ${n} used as argument ${r+1} of operator \`${e.name}', \nbut an operator of arity ${c} is required.`),M())}let p=ge(i),m=_r(a,fr(p));if(m===void 0)return o(u,`Could not find declaration or definition of symbol '${p}'.`),M();let h=jn(m);return h===c?oe(m,u):(o(s,`Operator with incorrect arity passed as argument. \nOperator '${m.name}' of arity ${h} is argument number ${d} to operator \`${yn(e.location)}', \nbut an operator of arity ${c} was expected.`),M())},ye=e=>{let t=T(e);if(e.isBulleted)return N(e.kind===`And`?`$ConjList`:`$DisjList`,e.operands.map(L),t);let r=G(n,e),i=e.kind===`And`?`\\land`:`\\lor`,[a,...o]=e.operands;return o.reduce((e,t,a)=>{let s=nr(n,G(n,t)),c=a===o.length-1?r.end:s.end;return N(i,[e,L(t)],K(n,{start:r.start,end:c}))},L(a))},be=e=>{let t=G(n,e),r=e.arms.map((r,i)=>{let a=nr(n,G(n,r.condition)),o=i===e.arms.length-1&&e.other===void 0,s=nr(n,G(n,r.body)),c=[L(r.condition),L(r.body)];return N(`$Pair`,c,K(n,{start:a.start,end:o?t.end:s.end}))}),i=e.other;if(i){let e=nr(n,G(n,i)),a=xe(e.start,`OTHER`);r.push(N(`$Pair`,[void 0,L(i)],K(n,{start:a,end:t.end})))}return N(`$Case`,r,K(n,t))},xe=(e,t)=>{for(let r=e;r>=0;r--)if(W(n,r,t))return r;return e},Se=e=>{let t=G(n,e),r=K(n,t),i=[L(e.function)],a=N(`$Except`,i,r),o=G(n,e.function),s={value:ur(n,o.end+1,t.end,`EXCEPT`)+1};return e.updates.forEach(e=>{let r=ur(n,s.value,t.end,`!`),o=nr(n,G(n,e.value)),c=K(n,{start:r,end:o.end}),l={value:r+1},u=e.path.map(e=>{if(e.kind===`Field`){let t=Ce(l.value,e.name);return l.value=t+1,ae(e.name,q(n,t))}let r=ur(n,l.value,t.end,`[`),i=er(n,r);return l.value=i+1,e.args.length===1?L(e.args[0]):N(`$Tuple`,e.args.map(L),K(n,{start:r,end:i}))}),d=N(`$Seq`,u,c),f=N(`$Pair`,[d],c);g.push(f),h.push(a),f.operands.push(L(e.value)),g.pop(),h.pop(),i.push(f),s.value=o.end+1}),a},Ce=(e,t)=>{for(let r=e;r<n.tokens.length;r++)if(n.tokens[r].text===t&&n.tokens[r].kind!==`String`)return r;return e},we=(e,t)=>{let r=G(n,t),i={value:r.start+1},a=t.fields.map((e,r)=>{let a=Ce(i.value,e.name),s=nr(n,G(n,e.value));return i.value=s.end+1,t.fields.slice(0,r).some(t=>t.name===e.name)&&o(q(n,a),`Non-unique fields in constructor.`),N(`$Pair`,[ae(e.name,q(n,a)),L(e.value)],K(n,{start:a,end:s.end}))}),s=N(e,a,K(n,r));return D.records.push(s),s},Te=e=>({line:n.tokens[e].line,column:n.tokens[e].column}),Ee=e=>{let t=[],r=e;for(;n.tokens[r]?.kind===`Identifier`;){let e=W(n,r+1,`(`)?er(n,r+1):r,i=n.tokens.slice(r+1,e).filter(e=>e.text===`_`).length;if(t.push({name:n.tokens[r].text,arity:i,location:{...Te(r),range:{module:n.name,start:Te(r),end:Te(e)}}}),!W(n,e+1,`,`))break;r=e+2}return t},De=e=>{let t=[...e.definitions.map(e=>({unit:{kind:`Definition`,definition:e},span:Me(e)})),...(e.instances??[]).map(e=>({unit:{kind:`Instance`,instance:e},span:Me(e)}))],r=G(n,e).start,i=nr(n,G(n,e.body)).start,a=[];for(let e=r+1;e<i;e++){let r=t.some(t=>t.span.start<=e&&e<=t.span.end);W(n,e,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:Ee(e+1)},span:{start:e,end:e}})}return[...t,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},I=e=>{let t=U();return k(t,()=>{c.curLevel++,c.unresolvedCount[c.curLevel]=0;let n=[],r=[];De(e).forEach(e=>{e.kind===`Recursive`?Le(e.declarations):e.kind===`Instance`?Ve(e.instance,n,r):e.definition.kind===`Function`?Fe(e.definition,n):Ne(e.definition,n)}),Re(),c.curLevel=Math.max(c.curLevel-1,0);let i=L(e.body);return{...H(l()),kind:`LetIn`,opDefs:n,instances:r,body:i,context:t,location:T(e)}})},Oe=e=>{let t=G(n,e),r=K(n,t);return k(U(),()=>{let i=e.pattern,a=i.kind===`Name`?[i.name]:i.names;if(e.set===void 0){let o=lr(n,t.start,t.end,a),s=a.map((e,r)=>A(e,0,q(n,i.kind===`Name`?t.start:o[r]),!0)),c=F(s,e.body);return N(`$UnboundedChoose`,[c],r,{unbounded:s})}let o=L(e.set),s=G(n,e.set),c=lr(n,t.start,s.start,a),l=a.map((e,t)=>A(e,0,q(n,c[t]),!0)),u=F(l,e.body);return N(`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},ke=e=>{if(mr(e.operator)||hr(e.operator)||e.args.length>2||_r(a,fr(e.operator))!==void 0)return;let t=G(n,e);if(n.tokens[t.start].text===e.operator&&W(n,t.start+1,`(`))return;let r=nr(n,G(n,e.args[0])),i=e.args.length===1&&r.start!==t.start,o=i?t.start:r.end+1,s=ar(n,o);return{index:o,name:i&&s===`-`?`-.`:s,fixity:i?`prefix`:e.args.length===2?`infix`:`postfix`}},L=e=>{let t=T(e);switch(e.kind){case`Number`:return{...H(l()),kind:`Numeral`,value:Tr(e.text??String(e.value)),location:t};case`Decimal`:{let[n,r]=e.text.split(`.`),i=BigInt(n+r),a=i<=9223372036854775807n;return{...H(l()),kind:`Decimal`,mantissa:i.toString(),exponent:String(a?-r.length:r.length),integralPart:n,fractionalPart:r,location:t}}case`String`:return ae(e.value,t);case`Identifier`:{let t=fe(e);return pe(t),t}case`Apply`:{let r=ke(e);if(r!==void 0)return o(q(n,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),o(t,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...M(),isAbsent:!0};let i=fe(e);return(hr(e.operator)||mr(e.operator))&&pe(i),i}case`Bracket`:return o(q(n,G(n,e).start),"Unsupported expression type `['."),{...M(),isAbsent:!0};case`OperatorReference`:case`Lambda`:{let r=n.tokens[G(n,e).start].text;return o(t,r===`LAMBDA`?`LAMBDA expression used where an expression is required.`:`Unsupported expression type \`${Mr(e,r)}'.`),{...M(),isAbsent:!0}}case`And`:case`Or`:return ye(e);case`Prime`:return N(`'`,[L(e.expression)],t);case`Unchanged`:return N(`UNCHANGED`,[L(e.expression)],t);case`Enabled`:return N(`ENABLED`,[L(e.expression)],t);case`Always`:return N(`[]`,[L(e.expression)],t);case`Eventually`:return N(`<>`,[L(e.expression)],t);case`If`:return N(`$IfThenElse`,[L(e.condition),L(e.consequent),L(e.alternative)],t);case`Case`:return be(e);case`Let`:return I(e);case`Forall`:case`Exists`:{let r=G(n,e);return k(U(),()=>{let n=P(e.bounds,r.start),i=F(n.bounded.flat(),e.body);return N(e.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,[i],t,n)})}case`UnboundedQuantifier`:{let r=G(n,e),i=G(n,e.body),a=lr(n,r.start,i.start,e.names),o=e.isTemporal?e.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:e.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return k(U(),()=>{let r=e.names.map((e,t)=>A(e,0,q(n,a[t]),!0)),i=F(r,e.body);return N(o,[i],t,{unbounded:r})})}case`Choose`:return Oe(e);case`SetEnumeration`:return N(`$SetEnumerate`,e.elements.map(L),t);case`Tuple`:return N(`$Tuple`,e.elements.map(L),t);case`SetFilter`:{let r=L(e.bound.set),i=G(n,e);return k(U(),()=>{let n=R([e.bound],i.start,[r]),a=F(n.bounded.flat(),e.predicate);return N(`$SubsetOf`,[a],t,n)})}case`SetMap`:{let r=G(n,e.expression);return k(U(),()=>{let n=P(e.bounds,r.end+1),i=F(n.bounded.flat(),e.expression);return N(`$SetOfAll`,[i],t,n)})}case`FunctionConstruction`:{let r=G(n,e);return k(U(),()=>{let n=P(e.bounds,r.start),i=F(n.bounded.flat(),e.body);return N(`$FcnConstructor`,[i],t,n)})}case`FunctionSet`:return N(`$SetOfFcns`,[L(e.domain),L(e.range)],t);case`Record`:return we(`$RcdConstructor`,e);case`RecordSet`:return we(`$SetOfRcds`,e);case`Except`:return Se(e);case`ExceptAt`:{let e=h[h.length-1],n=g[g.length-1];return e===void 0||n===void 0?(o(t,`@ used where its meaning is not defined.`),M()):{...H(l()),kind:`At`,except:e,component:n,location:n.location}}case`FunctionApplication`:{let n=L(e.function);if(bn(n))return n;pe(n);let r=e.args.length===1?L(e.args[0]):N(`$Tuple`,e.args.map(L),t);return N(`$FcnApply`,[n,r],t)}case`FieldAccess`:{let r=L(e.record),i=G(n,e);return N(`$RcdSelect`,[r,ae(e.field,q(n,i.end))],t)}case`Product`:return N(`$CartesianProd`,e.factors.map(L),t);case`BoxAction`:case`AngleAction`:return N(e.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[L(e.action),L(e.subscript)],t);case`WeakFairness`:case`StrongFairness`:return N(e.kind===`WeakFairness`?`$WF`:`$SF`,[L(e.subscript),L(e.action)],t);case`Label`:return Ae(e);case`Subexpression`:return fe(e)}},R=(e,t,r)=>{let i=me(e),a={value:t};return{bounded:i.map(e=>{let t=G(n,e[0].set),r=e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=lr(n,a.value,t.start,r);return a.value=t.end+1,r.map((e,t)=>A(e,0,q(n,i[t]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},Ae=e=>{let t=T(e),r=_.at(-1);if(r===void 0)return o(t,`Label not in definition or proof step.`),M();if(x.isDeclared.slice(2,x.depth+1).some(Boolean))return o(t,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),M();if(h.length>0&&g.length>0)return o(t,`Labels inside EXCEPT clauses are not yet implemented.`),M();y();let i=L(e.body),s=b(),c=lr(n,G(n,e).start,G(n,e.body).start,e.params),u=e.params.map((t,r)=>{let i=_r(a,t);if(i?.kind===`FormalParam`)return i;let s=q(n,c[r]);return o(s,`Illegal parameter ${t} of label \`${e.name}'.`),A(t,0,s,!1)}),d={...H(l()),kind:`Label`,name:e.name,params:u,body:i,labels:s,isAssumeProve:!1,location:t},f=/* @__PURE__ */ new Set;if(u.forEach(e=>{f.has(e)&&o(t,`Repeated formal parameter ${e.name} \nin label \`${d.name}'.`),f.add(e)}),r.params.flat().forEach(e=>{f.delete(e)||o(t,`Label ${d.name} must contain formal parameter \`${e.name}'.`)}),f.size>0){let e=[...f].map(e=>`${e.name} `).join(``);o(t,`Label ${d.name} declares extra parameter(s) ${e}`)}r.labels.has(d.name)?o(t,`Duplicate label \`${d.name}'.`):r.labels.set(d.name,d);let p=x.goal;return p&&C.set(d,{scope:p,clause:x.goalClause}),d},je=(e,t,r)=>{let i={value:t.start};return e.params.map(e=>{let t=e.location?Qn(n,e.location):Ce(i.value,e.name),a=z(t,e.arity);return i.value=a.end+1,A(fr(e.name),e.arity,K(n,a),r)})},Me=e=>{let t=E(e.location);return e.isLocal&&!W(n,t.start,`LOCAL`)&&W(n,t.start-1,`LOCAL`)?{start:t.start-1,end:t.end}:t},Ne=(e,t)=>{let r=Me(e),i=K(n,r),s=fr(e.name),l={start:e.isLocal?r.start+1:r.start,end:r.end},u=k(U(),()=>{let t=je(e,l,!0),n=_r(a,s);if(n?.kind===`OpDef`&&n.inRecursive&&!n.isDefined){let e=n.params?.length===t.length&&(t.length===0||t[t.length-1].arity===0);n.letInLevel===c.curLevel?(e||o(i,`Definition of ${n.name} has different arity than its RECURSIVE declaration.`),n.params=t):o(i,`Recursive operator ${s} defined at wrong LET/IN level.`)}else n!==void 0&&o(i,`Operator ${s} already defined or declared.`);return y(),{params:t,body:L(e.body),existing:n}}),f=b(),p=u.existing,m=u.params,h=cr(n,r.start);if(p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined&&p.letInLevel===c.curLevel){p.weights=m.map(()=>0),p.maxLevels=m.map(()=>3),p.isLeibnizArg=m.map(()=>!0),p.labels=f,Pe(p,u.body,i,h),D.definitions.push(p),t?.push(p);return}let g=j({name:s,params:m,body:u.body,isLocal:e.isLocal,location:i,preComments:h,labels:f});d(a,g),ne(g),D.definitions.push(g),t?.push(g)},Pe=(e,t,n,r)=>{e.isDefined=!0,e.body=t,e.location=n,e.preComments=r,e.inRecursive&&(c.unresolvedCount[c.curLevel]--,c.unresolvedSum--)},Fe=(e,t)=>{let r=Me(e),i=K(n,r),s=U(),l=e.isLocal?r.start+1:r.start,u=k(s,()=>P(e.bounds,l+1)),p=_r(a,e.name),m=k(s,()=>A(e.name,0,i,p===void 0)),h=N(`$NonRecursiveFcnSpec`,[],i,{unbounded:[m],...u}),g=p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined,_=g&&p.letInLevel===c.curLevel;_?p.arity!==0&&o(i,`Function ${p.name} has operator arguments in its RECURSIVE declaration.`):g?o(i,`Recursive function ${e.name} defined at wrong LET/IN level.`):p!==void 0&&o(i,`Function name \`${e.name}' already defined or declared.`);let v=cr(n,r.start),x=p===void 0?j({name:e.name,params:[],body:h,isLocal:e.isLocal,location:i,preComments:v}):p.kind===`OpDef`&&(_||!g)?p:void 0;_?p.arity===0&&Pe(p,h,i,v):p===void 0&&x!==void 0&&(d(a,x),ne(x)),x!==void 0&&(D.definitions.push(x),t?.push(x)),f.unshift({name:e.name,node:h}),y();let S=()=>F(u.bounded.flat(),e.body),C=x===void 0?S():k(s,S),w=b();x!==void 0&&(x.labels=w),f.shift(),h.operands=[C],h.operator.name===`$NonRecursiveFcnSpec`&&(h.unbounded=void 0)},Ie=[],Le=e=>{c.unresolvedSum===0&&c.recursiveSectionCount++,c.unresolvedCount[c.curLevel]+=e.length,c.unresolvedSum+=e.length,e.forEach(e=>{let t=ut(e);l();let r=Array.from({length:e.arity},()=>A(``,0,void 0,!1)),i=j({name:fr(e.name),params:r,location:K(n,t),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:c.recursiveSectionCount,letInLevel:c.curLevel});d(a,i),Ie.push(i),D.opDefsInRecursiveSection.push(i)})},Re=()=>{c.unresolvedCount[c.curLevel]!==0&&(Ie.filter(e=>e.letInLevel===c.curLevel&&!e.isDefined).forEach(e=>o(e.location,`Symbol ${e.name} declared in RECURSIVE statement but not defined.`)),c.unresolvedSum-=c.unresolvedCount[c.curLevel])},ze=(e,t,r)=>{l();let s=Dn(t.table).filter(e=>e.kind===`OpDecl`),c=s.flatMap(e=>{let t=_r(a,e.name);return t===void 0?[]:[{op:e,expr:e.declKind===3||e.declKind===2&&e.arity===0?re(t,[],r):oe(t,r),isImplicit:!0}]}),u=(e,t)=>{let n=t.kind===`OpArg`?jn(t.op):0,r=e.arity>0&&t.kind===`OpAppl`&&t.isNull===!0;n!==e.arity&&!r&&o(t.location,`An operator must be substituted for symbol '${e.name}', and it must have arity ${e.arity}.`)},d=Me(e),f={value:ur(n,d.start,d.end,`WITH`)+1};return e.substitutions.forEach(e=>{let i=ur(n,f.value,d.end,e.name);i!==-1&&(f.value=G(n,e.expression).end+1);let a=Mn(t,fr(e.name));if(a?.kind!==`OpDecl`){o(i===-1?r:q(n,i),`Identifier '${i===-1?e.name:ar(n,i)}' 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 s=a.arity===0?L(e.expression):_e(e.expression,a);u(a,s);let l=c.find(e=>e.op.name===a.name);l&&!l.isImplicit?o(T(e.expression),`Multiple substitutions for symbol '${a.name}' in substitution.`):l?(l.expr=s,l.isImplicit=!1):c.push({op:a,expr:s,isImplicit:!1})}),c.filter(e=>e.isImplicit&&i.version!==`1.7.4`).forEach(e=>u(e.op,e.expr)),s.filter(e=>!c.some(t=>t.op.name===e.name)).forEach(e=>o(r,`Substitution missing for symbol ${e.name} declared at ${yn(e.location)} \nand instantiated in module ${D.name}.`)),c},Be=(e,t,n,r,i,a=D)=>(bn(n)&&o(i,e===`SubstIn`?`Substitution error, probably due to error
33
- in module being instantiated.`:`Substitution error, probably due to error in module being instantiated.`),{...H(l()),kind:e,substs:t,body:n,instantiatingModule:a,instantiatedModule:r,location:i}),Ve=(e,t,r)=>{let o=Me(e),s=K(n,o),c=cr(n,o.start),u=e.name??``,f=U(),p=e.isLocal?o.start+1:o.start;e.params.length>0&&a.contexts.push(f);let m=je(e,{start:p,end:o.end},e.params.length>0),h=te(e.module),g=h.context,_=ze(e,g,s);e.params.length>0&&a.contexts.pop(),Dn(g.table).forEach(n=>{if(n.kind!==`OpDef`||n.isLocal||n.defKind!==`UserDefined`&&n.defKind!==`ModuleInstance`)return;let r=[...m,...n.params??[]],i=`${u}!${n.name}`,o=n.defKind===`UserDefined`?j({name:i,params:r,body:_.length>0&&n.body?Be(`SubstIn`,_,n.body,h,s):n.body,isLocal:e.isLocal,location:s,source:n.source??n,preComments:c,labels:n.labels}):j({defKind:`ModuleInstance`,name:i,params:r,isLocal:e.isLocal,location:s,module:n.module,source:n.source??n,preComments:c});d(a,o),n.defKind===`UserDefined`&&ne(o),(t??D.definitions).push(o)}),Dn(g.table).forEach(n=>{if(n.kind!==`ThmOrAssumpDef`||n.isLocal)return;let r=_.length>0?Be(`APSubstIn`,_,n.body,h,s):n.body,i={...H(l()),kind:`ThmOrAssumpDef`,name:`${u}!${n.name}`,isTheorem:n.isTheorem,body:r,params:[...m,...n.params],isLocal:e.isLocal,location:s,module:D,source:n.source??n,labels:n.labels,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]};d(a,i),(t??D.definitions).push(i)});let v={...H(l()),kind:`Instance`,name:u,isLocal:e.isLocal,params:m,module:h,substs:_,location:s};(r??D.topLevel).push(v);let y=j({defKind:`ModuleInstance`,name:u,params:m,isLocal:e.isLocal,location:s,preComments:c});d(a,y),i.version!==`1.7.4`&&t?.push(y)},He=(e,t=!0,r)=>{let i=Me(e),o=r??K(n,i),s=cr(n,i.start),c=te(e.module),u=c.context,f=ze(e,u,o),p=e.isLocal,m=xr(c);Dn(u.table).forEach(e=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`||e.isLocal)return;let t=(t,n)=>{let r=j({name:e.name,params:e.params,body:n,isLocal:p,location:o,module:t,source:e.source??e,preComments:s,labels:e.labels});return d(a,r),r},n=()=>(d(a,e),e),r=e.module===void 0||xr(e.module),i=m||r?p?t(e.module,e.body):n():t(D,e.body&&Be(`SubstIn`,f,e.body,c,o));D.definitions.push(i),ne(i)}),Dn(u.table).forEach(e=>{if(e.kind!==`ThmOrAssumpDef`||e.isLocal)return;let n=(t,n)=>{let r={...e,...H(l()),body:n,isLocal:p,location:o,module:t,source:e.source??e};return d(a,r),r},r=m?p?n(e.module,e.body):(d(a,e),e):xr(e.module)?p?n(D,e.body):e:n(D,Be(`APSubstIn`,f,e.body,c,o));t&&D.definitions.push(r)});let h={...H(l()),kind:`Instance`,name:void 0,isLocal:p,params:[],module:c,substs:f,location:o};return t&&D.topLevel.push(h),h},Ue=e=>{let t=ee(e.name)??(e.name===D.name?D:void 0);return t===void 0?(o(q(n,Qn(n,e.location)+1),`Module \`${e.name}' used without being extended or instantiated.`),[]):[t]},We=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return Ue(e);let n=zn(e);if(n===void 0||!Bn(n))return[L(e)];let r=de(e,0,!0,!1);if(r.kind===`ThmOrAssumpDef`)throw new t.O(`Expected a fact`);return[r]}),Ge=e=>W(n,e.start,`(`)&&er(n,e.start)===e.end,Ke=e=>nr(n,G(n,e)),qe=(e,t)=>Ke(e.args[0]).start===t.start?e.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:n.tokens[t.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,Je=(e,t)=>Ge(t)?`N_ParenExpr`:e.kind===`String`?ar(n,t.start):e.kind===`Apply`?qe(e,t):kr.get(e.kind),Ye=(e,t)=>{if(e.kind===`String`&&!Ge(t))return!1;if(e.kind===`Identifier`&&!e.name.includes(`!`))return!0;let n=Je(e,t);return n===void 0||Ar.has(n)?void 0:!0},Xe=(e,t)=>{let r=(e,t=Ke(e))=>({last:t,lastKind:Je(e,t)});if(Ge(t))return{hasChildlessFirstChild:!1,...r(e,{start:t.start+1,end:t.end-1})};switch(e.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...r(e.kind===`If`?e.condition:e.action)};case`Tuple`:case`SetEnumeration`:{let i=e.elements[0];return i===void 0?{hasChildlessFirstChild:!1,last:{start:t.end,end:t.end},lastKind:n.tokens[t.end].text}:{hasChildlessFirstChild:!1,...r(i)}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...r(e.expression,{start:t.start+1,end:t.end})};case`Prime`:return{hasChildlessFirstChild:Ye(e.expression,Ke(e.expression)),last:{start:t.end,end:t.end},lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let t=e.kind===`FunctionApplication`?e.function:e.record,r=Ke(t),i=r.end+1;return{hasChildlessFirstChild:Ye(t,r),last:{start:i,end:i},lastKind:n.tokens[i].text}}case`Apply`:{let n=qe(e,t);if(n===`N_OpApplication`)return e.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:{start:t.start+1,end:t.end},lastKind:`N_OpArgs`};if(n===`N_PrefixExpr`)return{hasChildlessFirstChild:!0,...r(e.args[0],{start:t.start+1,end:t.end})};let i=Ke(e.args[0]),a=i.end+1;return{hasChildlessFirstChild:Ye(e.args[0],i),last:{start:a,end:a},lastKind:n===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`}}}},Ze=e=>{let t=nr(n,G(n,e));if((e.kind===`Identifier`||e.kind===`Subexpression`||e.kind===`OperatorReference`)&&!Ge(t))return!1;let r=Xe(e,t);if(r?.hasChildlessFirstChild===void 0||r.lastKind===void 0)return!1;let i=K(n,r.last);return r.hasChildlessFirstChild&&o(K(n,t),`Was expecting a GeneralId.`),r.lastKind===`N_OpArgs`?o(i,"Selector `!(...)' should not have argument(s)."):(o(i,`Unexpected token found.`),o(i,`Need name or step number here, not \`${r.lastKind}'.`)),o(K(n,t),`DEF clause entry should describe a defined operator.`),!0},Qe=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return Ue(e);if(Ze(e))return[];let t=de(e.kind===`OperatorReference`?{kind:`Identifier`,name:e.operator,location:e.location}:e,-1,!1,!0);return t.kind===`OpDef`||t.kind===`ThmOrAssumpDef`&&!t.name.startsWith(`<`)?[t]:(o(T(e),`DEF clause entry should describe a defined operator.`),[])}),$e=(e,t)=>{e.isOnly||e.facts.length+e.defs.length>0||o(t,`Empty BY, USE, or HIDE`)},et=e=>{let t=K(n,E(e.location));$e(e,t);let r=We(e.facts),i=Qe(e.defs);return r.length+i.length===0&&o(t,`Empty USE or HIDE statement.`),e.kind===`Hide`&&r.filter(e=>e.kind===`OpAppl`&&e.operator.kind!==`ThmOrAssumpDef`).forEach(e=>o(e.location,`The only expression allowed as a fact in a HIDE is
34
- the name of a theorem, assumption, or step.`)),{...H(l()),kind:`UseOrHide`,facts:r,defs:i,isOnly:e.isOnly,isHide:e.kind===`Hide`,location:t}},tt=e=>{let t=E(e.location),r=e.set&&L(e.set),i=Ce(t.start,e.name),o=pr[e.level],s={...H(l()),levelChecked:1,level:o.level,kind:`OpDecl`,name:fr(e.name),arity:e.arity,declKind:o.declKind,location:K(n,z(i,e.arity)),module:D};return d(a,s),{...H(l()),kind:`NewSymb`,declaration:s,set:r,location:K(n,t)}},nt=(e,t,r)=>{let i=E(e.location),s=or(n,i.start-1),c=G(n,e.conclusion).start,u=n.tokens.findLastIndex((e,t)=>t<c&&e.kind===`Keyword`&&e.text===`PROVE`),d=K(n,{start:s?i.start-1:i.start,end:i.start});s!==or(n,u-1)&&o(d,s?`[]ASSUME matched by PROVE instead of []PROVE`:`ASSUME matched by []PROVE instead of PROVE`);let f=l();t>1&&a.contexts.push(U()),s&&a.contexts.some(e=>v.has(e))&&o(d,`[]ASSUME used within the scope of an ordinary ASSUME's assumptions`),s||v.add(gr(a));let p={isDeclaredBefore:[!1],hasGoal:r!==void 0,isSuffices:r?.isSuffices??!1,isInProof:!0};x.depth=t,x.isDeclared[t]=!1,t===1&&(x.goal=r&&p,x.goalClause=0);let m=e.assumptions.map((e,n)=>{let r=e.kind===`NewSymbol`,i=e.kind===`AssumeProve`?nt(e,t+1):r?tt(e):L(e);return x.depth=t,r&&(x.isDeclared[t]=!0),p.isDeclaredBefore.push(p.isDeclaredBefore[n]||r),t===1&&x.goalClause++,i}),h=L(e.conclusion);t>1&&a.contexts.pop(),x.depth=t-1,t===1&&(x.goal=void 0);let g={...H(f),kind:`AssumeProve`,assumptions:m,goal:h,isSuffices:p.isSuffices,isBoxed:s,location:K(n,{start:s?i.start-1:i.start,end:i.end})};return S.set(g,p),g},rt=(e,t,n,r,i,a=!0)=>({...H(e),kind:`ThmOrAssumpDef`,name:t,isTheorem:a,body:n,params:[],isLocal:!1,location:r,module:D,source:void 0,labels:i,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]}),it=e=>{let t=K(n,E(e.location));e.kind===`By`&&$e(e,t);let r=e.kind===`By`?We(e.facts):[],i=e.kind===`By`?Qe(e.defs):[];return e.kind===`By`&&l(),e.kind===`By`&&r.length+i.length===0&&o(t,`Empty BY`),{...H(l()),kind:`LeafProof`,facts:r,defs:i,isOmitted:e.kind===`Omitted`,isOnly:e.kind===`By`&&e.isOnly,location:t}},at=(e,t)=>{let r=e.body,i=K(n,t);switch(r.kind){case`Have`:return{node:N(`$Have`,[L(r.expression)],i),isPick:!1};case`Case`:return{node:N(`$Pfcase`,[L(r.expression)],i),isPick:!1};case`Witness`:return{node:N(`$Witness`,r.expressions.map(L),i),isPick:!1};case`Qed`:return{node:N(`$Qed`,[],i),isPick:!1};case`Take`:case`Pick`:{let e=r.kind===`Pick`,o=e?`$Pick`:`$Take`;e&&a.contexts.push(U());let s=e=>r.kind===`Pick`?[F(e,r.body)]:[];if(r.bounds.length>0){let n=P(r.bounds,t.start),a=s(n.bounded.flat());return{node:N(o,a,i,n),isPick:e}}let c=lr(n,t.start,t.end+1,r.names),l=r.names.map((e,t)=>A(e,0,q(n,c[t]),!0)),u=s(l);return{node:N(o,u,i,{unbounded:l}),isPick:e}}}},ot=e=>{if((e.kind===`And`||e.kind===`Or`)&&!e.isBulleted)return!0;if(e.kind!==`Apply`||e.args.length!==2)return!1;let t=nr(n,G(n,e.args[0])),r=G(n,e).start;return t.start===r&&!W(n,t.end+1,`(`)},st=e=>{if(e.kind!==`Steps`)return it(e);let r=U();a.contexts.push(r);let i=[],o=[],s={previousRight:void 0},c=(e,r,a)=>{if(e.kind===`Define`){let r=e.definitions.map(e=>{let n=[];e.kind===`Instance`?Ve(e,n,i):e.kind===`Function`?Fe(e,n):Ne(e,n);let r=n[e.kind===`Instance`?n.length-1:0];if(r?.kind!==`OpDef`)throw new t.O(`A DEFINE step defines no operator`);return r});return{...H(l()),kind:`DefStep`,defs:r,location:K(n,a)}}if(e.kind===`Use`||e.kind===`Hide`)return{...et(e),location:K(n,r)};if(e.kind===`Instance`)return He(e,!1,K(n,a))},u=e.steps.map(e=>{let r=E(e.location),i=tr(n,e.head),u={start:i.start+1,end:i.end},f=e.body;e.name!==void 0&&y();let p=e.name===void 0?void 0:l();f.kind!==`Assert`&&(s.previousRight=void 0);let m=c(f,r,u);if(m!==void 0)return e.name!==void 0&&d(a,j({defKind:`NumberedProofStep`,name:e.name,location:K(n,r),labels:b(),step:m})),m;let h=f.kind===`Assert`&&f.statement.kind===`AssumeProve`;h&&(s.previousRight=void 0);let g=f.kind===`Assert`&&f.isSuffices,_=U(),v=f.kind===`Assert`?{node:(t=>{if(t.kind===`AssumeProve`){let n=k(_,()=>nt(t,1,e.name===void 0?void 0:{isSuffices:g}));return n.isSuffices=g,n}if(g){let e=L(t);return N(`$Suffices`,[e],K(n,u))}let r=s.previousRight,i=r!==void 0&&t.kind===`Apply`&&ot(t)&&t.args[0].kind===`ExceptAt`,a=i?L(t.args[1]):void 0,o=i?re(se(t.operator,T(t)),[N(`$Nop`,[r],T(t.args[0])),a],T(t)):L(t),c=o.kind===`OpAppl`?o.operands[1]:void 0;return s.previousRight=ot(t)?c:void 0,o})(f.statement),isPick:!1}:at(e,u);if(v===void 0)throw new t.O(`Unexpected proof step ${f.kind}`);let x=v.isPick?a.contexts.pop():void 0,S=e.name===void 0||p===void 0?void 0:rt(p,e.name,v.node,q(n,Qn(n,e.location)),b());S&&d(a,S);let C=h&&!g;C&&a.contexts.push(_);let D=e.proof&&st(e.proof);return C&&a.contexts.pop(),w(v.node),h&&g&&(o.push(_),a.contexts.push(_)),x?.symbols.forEach(e=>d(a,e)),{...H(l()),kind:`Theorem`,definition:S,body:v.node,proof:D,isSuffices:g,location:K(n,r)}});return o.forEach(()=>{a.contexts.pop()?.symbols.forEach(e=>An(r,e))}),a.contexts.pop(),{...H(l()),kind:`NonLeafProof`,steps:u,instances:i,proofLevel:e.level,location:K(n,E(e.location))}},ct=e=>{let t=K(n,E(e.location)),r=e.statement,i=U();e.name!==void 0&&y();let o=e.name===void 0?void 0:l();r.kind===`AssumeProve`&&a.contexts.push(i);let s=r.kind===`AssumeProve`?nt(r,1,e.name===void 0?void 0:{isSuffices:!1}):L(r),c=e.name===void 0||o===void 0?void 0:rt(o,e.name,s,t,b());c&&(r.kind===`AssumeProve`&&a.contexts.pop(),d(a,c),D.definitions.push(c),r.kind===`AssumeProve`&&a.contexts.push(i));let u=e.proof&&st(e.proof);r.kind===`AssumeProve`&&a.contexts.pop(),w(s);let f={...H(l()),kind:`Theorem`,definition:c,body:s,proof:u,isSuffices:!1,location:t};D.topLevel.push(f)},lt=e=>{let t=E(e.location),r=K(n,t);e.name!==void 0&&y();let i=L(e.expression),o=e.name===void 0?void 0:rt(l(),e.name,i,r,b(),!1);o&&(d(a,o),D.definitions.push(o));let s={...H(l()),kind:`Assume`,definition:o,body:i,location:r};D.topLevel.push(s)},z=(e,t)=>t===0?{start:e,end:e}:W(n,e,`_`)?{start:e,end:W(n,e+2,`_`)?e+2:e+1}:W(n,e+1,`(`)?{start:e,end:er(n,e+1)}:{start:e,end:W(n,e+1,`_`)?e+1:e},ut=e=>z(E(e.location).start,e.arity),dt=(e,t)=>{let r=ut(e);e.name===`@`&&t===3&&o(K(n,r),`Attempted to declare '@' as a variable.`);let i={...H(l()),levelChecked:1,level:+(t===3),kind:`OpDecl`,name:fr(e.name),arity:e.arity,declKind:t,location:K(n,r),module:D};return t===2&&(i.levelParams.add(i),i.allParams.add(i)),d(a,i),i};e.extends.forEach(e=>{let t=te(e);D.extendees.push(t);let n=gr(a);t.context.symbols.forEach(e=>{if(e.kind!==`Module`&&e.kind!==`FormalParam`&&e.kind!==`OpDecl`&&e.isLocal)return;let t=e.kind===`Module`?Nn(n,e.name):Mn(n,e.name);t===void 0?An(n,e):t!==e&&t.kind!==e.kind?o(e.location,`The ${yr(e)} of '${e.name}' conflicts with \nits ${yr(t)} at ${yn(t.location)}.`):t!==e&&!br(t,e)&&s(e.location,`Warning: the ${yr(t)} of '${e.name}' conflicts with \nits ${yr(t)} at ${yn(t.location)}.`)}),D.topLevel.push(...t.topLevel)});let ft=(e,t)=>{c.unresolvedSum!==0&&o(K(n,E(e)),`${t} may not appear within a recursive definition section.`)};return e.units.forEach(e=>{switch(e.kind){case`Variables`:ft(e.location,`A VARIABLE declaration`),e.declarations.forEach(e=>dt(e,3));break;case`Constants`:ft(e.location,`A declaration`),e.declarations.forEach(e=>dt(e,2));break;case`Recursive`:Le(e.declarations);break;case`Definition`:e.definition.kind===`Function`?Fe(e.definition,void 0):Ne(e.definition,void 0);break;case`Instance`:e.instance.name===void 0?He(e.instance):Ve(e.instance,void 0,void 0);break;case`Assumption`:ft(e.assumption.location,`An ASSUME`),lt(e.assumption);break;case`Theorem`:ft(e.theorem.location,`A THEOREM`),ct(e.theorem);break;case`Use`:ft(e.use.location,`A USE or HIDE`),D.topLevel.push(et(e.use));break;case`Module`:{ft(e.module.location,`A MODULE `);let t={contexts:[...a.contexts,U()]},r=O(e.module,n,D,t),i=ee(r.name);i===void 0?An(gr(a),r):i!==r&&o(r.location,`Multiply-defined module '${r.name}': this definition or declaration conflicts \nwith the one at ${yn(i.location)}.`);break}}}),Re(),D},ee=v.map(e=>{i.onAnalyze?.(e),u.id=Array.from({length:4},l)[1];let t=_(e,void 0),n=U();f.toReversed().forEach(e=>An(n,e));let r=O(t.module,t.file,void 0,{contexts:[n]});return m.set(e,r),i.onModule?.(r,a),r});return{root:ee[ee.length-1],modules:ee,messages:a}},J=(e,t,n,r)=>vn(e.messages,{location:t,text:n,isWarning:!1,...r!==void 0&&!e.isTlc174&&{code:r}}),Y=(e,t)=>{for(let n of t)e.add(n)},Pr=(e,t,n)=>`${e.id}:${t}:${n.id}`,Fr=(e,t,n,r)=>{e.set(Pr(t,n,r),{op:t,index:n,param:r})},Ir=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(t)&&e.set(r,t)})},Lr=(e,t,n)=>{e.set(t,Math.min(n,e.get(t)??3))},Rr=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(r)&&Lr(e,r,t)})},zr=(e,t)=>`${e.id}:${t}`,Br=(e,t,n,r)=>{let i=zr(t,n),a=e.get(i)?.level??0;e.set(i,{param:t,position:n,level:Math.max(r,a)})},Vr=(e,t,n=()=>!0)=>{t.forEach(t=>{n(t)&&Br(e,t.param,t.position,t.level)})},Hr=(e,t)=>{e.levelParams=t.levelParams,e.allParams=t.allParams,e.levelConstraints=t.levelConstraints,e.argLevelConstraints=t.argLevelConstraints,e.argLevelParams=t.argLevelParams},Ur=(e,t)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Rr(e.levelConstraints,t.levelConstraints),Vr(e.argLevelConstraints,t.argLevelConstraints),Ir(e.argLevelParams,t.argLevelParams)},Wr=(e,t)=>t.includes(e.op)||t.includes(e.param),Gr=e=>e.kind===`OpDecl`||e.kind===`FormalParam`,Kr=e=>e.kind!==`Module`,qr=e=>e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`,Jr=(e,t)=>e.kind===`OpDef`&&e.arity<0?0:t,Yr=(e,t)=>e.kind===`OpDef`?e.weights[Jr(e,t)]??0:0,Xr=(e,t)=>e.maxLevels[Jr(e,t)]??3,Zr=(e,t,n)=>e.minMaxLevel?.[t]?.[n]??0,Qr=(e,t)=>e.kind===`OpDef`?e.isLeibnizArg?.[Jr(e,t)]??!0:e.isLeibnizArg[t]??!0,$r=(e,t,n,r)=>e.opLevelCond?.[t]?.[n]?.[r]??!1,ei=e=>[...e.unbounded??[],...(e.bounded??[]).flat()],ti=(e,t)=>t.find(t=>t.op===e)?.expr,ni=(e,t,n)=>{let r=ti(e,t);return r===void 0?/* @__PURE__ */ new Set([e]):n?r.allParams:r.levelParams},ri=(e,t)=>{let n=/* @__PURE__ */ new Map;return e.forEach((e,r)=>{let i=ti(e.op,t);if(i===void 0){n.set(r,e);return}if(i.kind!==`OpArg`||!Gr(i.op))return;let a=i.op;ni(e.param,t,!1).forEach(t=>Fr(n,a,e.index,t))}),n},ii=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map;return e.levelConstraints.forEach((e,r)=>{let i=n||r.kind!==`OpDecl`?e:r.declKind===2?0:r.declKind===3?1:e;ni(r,t,!1).forEach(e=>Lr(a,e,i))}),e.argLevelParams.forEach(e=>{let n=ti(e.op,t);if(n?.kind!==`OpArg`||n.op.kind!==`OpDef`)return;X(n.op,r,i);let o=Xr(n.op,e.index);ni(e.param,t,!1).forEach(e=>Lr(a,e,o))}),a},ai=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map;return e.argLevelConstraints.forEach(e=>{let n=ti(e.param,t);n===void 0?Br(i,e.param,e.position,e.level):n.kind===`OpArg`&&Gr(n.op)&&Br(i,n.op,e.position,e.level)}),e.argLevelParams.forEach(e=>{let a=ti(e.param,t);if(a===void 0)return;let o=ti(e.op,t),s=o===void 0?e.op:o.kind===`OpArg`?o.op:void 0;s!==void 0&&Gr(s)&&(X(a,n,r),Br(i,s,e.index,a.level))}),i},oi=(e,t)=>Fn(e,3).length>0||(hi(e,t),Pn(e).some(e=>(e.body?.level??0)!==0))?!1:e.topLevel.every(e=>e.kind!==`Theorem`||e.level===0),si=(e,t,n)=>{e.minMaxLevel=t.map(e=>Array.from({length:e.arity},(t,r)=>n.argLevelConstraints.get(zr(e,r))?.level??0)),e.opLevelCond=t.map(e=>t.map(t=>Array.from({length:e.arity},(r,i)=>n.argLevelParams.has(Pr(e,i,t))))),Y(e.levelParams,n.levelParams),Y(e.allParams,n.allParams),Y(e.nonLeibnizParams,n.nonLeibnizParams),t.forEach((t,n)=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.has(t)&&(e.nonLeibnizParams.delete(t),e.isLeibnizArg&&(e.isLeibnizArg[n]=!1),e.isLeibniz=!1)}),e.levelConstraints=new Map(n.levelConstraints),t.forEach(t=>e.levelConstraints.delete(t)),e.argLevelConstraints=new Map(n.argLevelConstraints),t.forEach(t=>{for(let n=0;n<t.arity;n++)e.argLevelConstraints.delete(zr(t,n))}),Ir(e.argLevelParams,n.argLevelParams,e=>!t.some(t=>t===e.op)||!t.some(t=>t===e.param))},ci=(e,t,n,r,i)=>{e.operands.forEach((a,o)=>{if(a===void 0||(a.level>Xr(t,o)&&(n&&X(a,r,i)&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${o+1} exceeds the maximum level allowed by the operator.`),e.levelCorrect=!1),a.kind!==`OpArg`||!qr(a.op)))return;let s=a.op;X(s,r,i);let c=jn(s);for(let l=0;l<c;l++){let c=Zr(t,o,l);Xr(s,l)>=c||(n&&X(a,r,i)&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe permitted level of argument ${l+1} of the operator argument ${o+1} \nmust be at least ${c}.`),e.levelCorrect=!1)}e.operands.forEach((n,l)=>{for(let u=0;u<c;u++)n===void 0||!$r(t,o,l,u)||n.level<=Xr(s,u)||(X(a,r,i)&&X(n,r,i)&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${l+1} exceeds the maximum level allowed by the operator.`,`HIGHER_ORDER_OPERATOR_COPARAMETER_LEVEL_CONSTRAINTS_EXCEEDED`),e.levelCorrect=!1)})}),e.ranges.forEach((n,a)=>{let o=X(n,r,i);n.level<=2||(o&&J(i,e.location,`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${yn(e.bounded?.[a]?.[0]?.location)} \nexceeds the maximum level allowed by the operator.`),e.levelCorrect=!1)})},li=(e,t,n,r,i)=>{let a=t.params??[],o=t=>e.operands.find((e,n)=>a[n]===t);Rr(e.levelConstraints,t.levelConstraints),e.operands.forEach(t=>{t!==void 0&&Rr(e.levelConstraints,t.levelConstraints,e=>!n.has(e))}),e.ranges.forEach(t=>Rr(e.levelConstraints,t.levelConstraints)),e.operands.forEach((n,r)=>{let i=Xr(t,r);n?.levelParams.forEach(t=>Lr(e.levelConstraints,t,i))}),e.operands.forEach((n,a)=>{if(n?.kind!==`OpArg`||!qr(n.op))return;let o=n.op;X(o,r,i);let s=jn(o);e.operands.forEach((n,r)=>{for(let i=0;i<s;i++){if(!$r(t,a,r,i))continue;let s=Xr(o,i);n?.levelParams.forEach(t=>Lr(e.levelConstraints,t,s)),!o.isLeibniz&&!Qr(o,i)&&n&&Y(e.nonLeibnizParams,n.allParams)}})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n?.kind===`OpArg`&&qr(n.op)&&(X(n.op,r,i),Lr(e.levelConstraints,t.param,Xr(n.op,t.index)))}),Vr(e.argLevelConstraints,t.argLevelConstraints),e.operands.forEach(t=>{t&&Vr(e.argLevelConstraints,t.argLevelConstraints)}),e.ranges.forEach(t=>Vr(e.argLevelConstraints,t.argLevelConstraints)),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Gr(n.op))return;let i=n.op;for(let n=0;n<i.arity;n++)Br(e.argLevelConstraints,i,n,Zr(t,r,n));e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&$r(t,r,a,o)&&Br(e.argLevelConstraints,i,o,n.level)})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n!==void 0&&(X(n,r,i),Br(e.argLevelConstraints,t.op,t.index,n.level))}),e.operands.forEach(t=>{t!==void 0&&Ir(e.argLevelParams,t.argLevelParams,e=>!n.has(e.param))}),e.ranges.forEach(t=>Ir(e.argLevelParams,t.argLevelParams)),t.argLevelParams.forEach((t,n)=>{let a=o(t.op);if(a===void 0){let a=o(t.param);a===void 0?e.argLevelParams.set(n,t):(X(a,r,i),a.levelParams.forEach(n=>Fr(e.argLevelParams,t.op,t.index,n)))}else a.kind===`OpArg`&&Gr(a.op)&&Fr(e.argLevelParams,a.op,t.index,t.param)}),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Gr(n.op))return;let i=n.op;e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&$r(t,r,a,o)&&n.levelParams.forEach(t=>Fr(e.argLevelParams,i,o,t))})})},ui=/* @__PURE__ */ new Map([[`\\land`,`\\land`],[`\\lor`,`\\lor`],[`=>`,`=>`],[`\\equiv`,`\\equiv`],[`$ConjList`,`Conjunction list`],[`$DisjList`,`Disjunction list`]]),di=(e,t)=>{let n=(n,r)=>{J(t,n,r),t.isTlc174||(e.levelCorrect=!1)},r=e.operator.name,i=e.operands[0];if((r===`[]`||r===`<>`)&&i?.level===2&&i.kind===`OpAppl`){let t=r===`[]`;i.operator.name!==(t?`$SquareAct`:`$AngleAct`)&&n(e.location,t?`[] followed by action not of form [A]_v.`:`<> followed by action not of form <<A>>_v.`)}r!==`~>`&&r!==`-+->`||i?.level!==2&&e.operands[1]?.level!==2||n(e.location,`Action used where only temporal formula or state predicate allowed.`);let a=ui.get(r);a!==void 0&&e.operands.some(e=>e?.level===3)&&e.operands.some(e=>e?.level===2)&&n(e.location,`${a} has both temporal formula and action as arguments.`),e.level===3&&(r===`$BoundedExists`||r===`$BoundedForall`)&&e.ranges.forEach(e=>{e.level===2&&n(e.location,`Action-level bound of quantified temporal formula.`)})},fi=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.operands.filter(e=>e!==void 0);r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.ranges.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)});let i=e.operator;if(qr(i)){let r=X(i,t,n);ci(e,i,r,t,n),e.level=e.operands.reduce((e,t,n)=>t!==void 0&&Yr(i,n)===1?Math.max(e,t.level):e,i.level),e.ranges.forEach(t=>{e.level=Math.max(e.level,t.level)}),Y(e.levelParams,i.levelParams),Y(e.allParams,i.allParams),Y(e.nonLeibnizParams,i.nonLeibnizParams),e.operands.forEach((t,n)=>{t!==void 0&&(Yr(i,n)===1&&Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),Qr(i,n)||Y(e.nonLeibnizParams,t.allParams))}),e.ranges.forEach(t=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams)});let a=new Set(ei(e));a.forEach(t=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.delete(t)}),li(e,i,a,t,n)}else X(i,t,n),e.level=r.reduce((e,t)=>Math.max(e,t.level),i.kind===`Module`?0:i.level),e.levelParams=/* @__PURE__ */ new Set([i]),e.allParams.add(i),r.forEach((t,n)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),Rr(e.levelConstraints,t.levelConstraints),Br(e.argLevelConstraints,i,n,t.level),Vr(e.argLevelConstraints,t.argLevelConstraints),t.levelParams.forEach(t=>Fr(e.argLevelParams,i,n,t)),Ir(e.argLevelParams,t.argLevelParams)});return di(e,n),e.levelCorrect},pi=(e,t,n)=>{if(e.levelChecked>=t||!e.inRecursiveSection&&e.levelChecked>0)return e.levelCorrect;e.levelChecked=t;let r=e.body;if(r===void 0)return e.levelCorrect=e.step===void 0||X(e.step,t,n),e.levelCorrect;e.levelCorrect=X(r,t,n),e.level=Math.max(e.level,r.level);let i=e.params??[];return i.forEach((t,n)=>{let i=r.levelConstraints.get(t);i!==void 0&&(e.maxLevels[n]=Math.min(e.maxLevels[n],i)),r.levelParams.has(t)&&(e.weights[n]=Math.max(e.weights[n],1))}),si(e,i,r),e.levelCorrect},mi=(e,t,n)=>(e.levelChecked>=t||(e.levelChecked=t,e.maxLevels=e.params.map(()=>3),e.isLeibnizArg=e.params.map((t,n)=>n===e.params.length-1),e.params.length>0&&(e.isLeibniz=!0),e.levelCorrect=X(e.body,t,n),e.level=e.body.level,e.params.forEach((t,n)=>{let r=e.body.levelConstraints.get(t);r!==void 0&&(e.maxLevels[n]=r)}),si(e,e.params,e.body)),e.levelCorrect),hi=(e,t)=>{if(e.isLevelChecked)return e.levelCorrect;e.isLevelChecked=!0;let n=e.opDefsInRecursiveSection,r=0;for(;r<n.length;){let e=n[r].recursiveSection,i=r;for(;i<n.length&&n[i].recursiveSection===e;){let e=n[i];e.inRecursive?(e.levelChecked=1,e.maxLevels=e.maxLevels.map(()=>2),e.weights=e.weights.map(()=>1)):e.levelChecked=0,i++}let a=n.slice(r,i),o=/* @__PURE__ */ new Set,s=/* @__PURE__ */ new Set,c=0;a.forEach(e=>{e.inRecursive&&(e.levelChecked=0),pi(e,1,t),e.inRecursive&&(e.maxLevels.forEach((n,r)=>{n>=2||J(t,e.location,`Argument ${r+1} of recursive operator ${e.name} is primed`)}),c=Math.max(c,e.level),Y(o,e.levelParams),Y(s,e.allParams))}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=2),e.level=Math.max(e.level,c),Y(e.levelParams,o),Y(e.allParams,s)}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=1),pi(e,2,t)}),r=i}e.levelCorrect=!0;let i=t=>{t||(e.levelCorrect=!1)};e.definitions.filter(e=>e.kind===`Module`).forEach(e=>i(hi(e,t)));let a=Pn(e);return a.forEach(e=>i(pi(e,1,t))),In(e).forEach(e=>i(mi(e,1,t))),e.topLevel.forEach(e=>i(X(e,1,t))),oi(e,t)||Fn(e,2).forEach(t=>Lr(e.levelConstraints,t,0)),a.forEach(t=>{Rr(e.levelConstraints,t.levelConstraints),Vr(e.argLevelConstraints,t.argLevelConstraints),Ir(e.argLevelParams,t.argLevelParams,e=>!Wr(e,t.params??[]))}),e.topLevel.forEach(t=>{Rr(e.levelConstraints,t.levelConstraints),Vr(e.argLevelConstraints,t.argLevelConstraints),Ir(e.argLevelParams,t.argLevelParams)}),e.levelCorrect},gi=(e,t,n,r)=>(e.levelChecked>=n||(e.levelChecked=n,t.forEach(t=>{Kr(t)&&(t.kind!==`OpDef`||t.defKind!==`ModuleInstance`)&&(e.levelCorrect=X(t,n,r)&&e.levelCorrect,e.level=Math.max(e.level,t.level),Ur(e,t),Y(e.nonLeibnizParams,t.nonLeibnizParams))})),e.levelCorrect),_i=(e,t)=>{e?.kind===`NonLeafProof`&&e.steps.forEach(e=>{if(e.kind!==`Theorem`||e.body.kind!==`OpAppl`)return;let n=e.body.operator.name;n===`$Take`||n===`$Witness`||n===`$Have`?e.body.level!==0&&J(t,e.body.location,`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`):n===`$Pfcase`?(e.body.level!==0&&J(t,e.body.location,`Non-constant CASE for temporal goal.`),_i(e.proof,t)):n===`$Qed`&&_i(e.proof,t)})},vi=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelParams=/* @__PURE__ */ new Set,e.levelCorrect=!0;let r=e.module;hi(r,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)});let i=oi(r,n);e.substs.forEach(a=>{!i&&a.expr.level>a.op.level&&(X(a.expr,t,n)&&J(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${a.op.name}' \nmust be at most ${a.op.level}.`),e.levelCorrect=!1),a.expr.kind!==`OpArg`||a.expr.op.kind!==`OpDef`||a.expr.op.defKind!==`UserDefined`&&a.expr.op.defKind!==`BuiltIn`||a.expr.op.isLeibniz||J(n,e.location,`Error in instantiating module '${r.name}':\n A non-Leibniz operator substituted for '${a.op.name}'.`)}),e.substs.forEach(i=>{let a=r.levelConstraints.get(i.op);if(a!==void 0&&i.expr.level>a&&(X(i.expr,t,n)&&J(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${i.op.name}' \nmust be at most ${a}.`),e.levelCorrect=!1),i.op.arity<=0||i.expr.kind!==`OpArg`||i.expr.op.kind!==`OpDef`)return;let o=i.expr.op,s=X(o,t,n);for(let t=0;t<i.op.arity;t++){let a=r.argLevelConstraints.get(zr(i.op,t))?.level;a===void 0||Xr(o,t)>=a||(s&&J(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the argument ${t+1} of the operator ${o.name} \nmust be at least ${a}.`),e.levelCorrect=!1)}}),r.argLevelParams.forEach(i=>{e.substs.forEach(a=>{e.substs.forEach(o=>{if(i.op!==a.op||i.param!==o.op||a.expr.kind!==`OpArg`)return;let s=a.expr.op,c=X(s,t,n);if(s.kind!==`OpDef`)return;let l=Xr(s,i.index);o.expr.level<=l||(c&&X(o.expr,t,n)&&J(n,e.location,`Level error when instantiating module '${r.name}':\nThe level of the argument ${i.index} of the operator ${a.op.name}' \nmust be at most ${l}.`),e.levelCorrect=!1)})})});let a=t=>!e.params.some(e=>e===t);return Rr(e.levelConstraints,ii(r,e.substs,i,t,n),a),e.substs.forEach(t=>Rr(e.levelConstraints,t.expr.levelConstraints,a)),Vr(e.argLevelConstraints,ai(r,e.substs,t,n),e=>a(e.param)),e.substs.forEach(t=>Vr(e.argLevelConstraints,t.expr.argLevelConstraints,e=>a(e.param))),Ir(e.argLevelParams,ri(r.argLevelParams,e.substs),t=>!Wr(t,e.params)),e.substs.forEach(t=>Ir(e.argLevelParams,t.expr.argLevelParams,t=>!Wr(t,e.params))),e.levelCorrect},X=(e,t,n)=>{if(!Kr(e))return hi(e,n);switch(e.kind){case`OpAppl`:return fi(e,t,n);case`OpDef`:return pi(e,t,n);case`ThmOrAssumpDef`:return mi(e,t,n);case`FormalParam`:return e.levelChecked===0&&(e.levelChecked=t,e.levelParams.add(e),e.allParams.add(e)),!0;case`OpDecl`:return!0;case`Numeral`:case`String`:case`Decimal`:return e.levelChecked<t&&(e.levelChecked=t),!0;case`OpArg`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t;let r=e.op;return e.levelCorrect=X(r,t,n),r.kind===`Module`||(e.level=r.level,Hr(e,r)),e.levelCorrect}case`LetIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.opDefs.filter(e=>e.kind!==`OpDef`||e.defKind!==`ModuleInstance`);return r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.body,t,n)||(e.levelCorrect=!1),e.instances.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.level=e.body.level,e.levelParams=new Set(e.body.levelParams),e.allParams=new Set(e.body.allParams),Rr(e.levelConstraints,e.body.levelConstraints),r.forEach(t=>Rr(e.levelConstraints,t.levelConstraints)),Vr(e.argLevelConstraints,e.body.argLevelConstraints),r.forEach(t=>Vr(e.argLevelConstraints,t.argLevelConstraints)),Ir(e.argLevelParams,e.body.argLevelParams),r.forEach(t=>{let n=t.kind===`OpDef`?t.params??[]:[];Ir(e.argLevelParams,t.argLevelParams,e=>!Wr(e,n))}),e.instances.forEach(t=>Ir(e.argLevelParams,t.argLevelParams)),e.levelCorrect}case`Label`:{if(e.levelChecked>=t)return!0;e.levelChecked=t,e.params.forEach(e=>X(e,t,n));let r=X(e.body,t,n);return e.level=e.body.level,Hr(e,e.body),r}case`At`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=e.except.operands,i=r[0];if(i===void 0)return!0;X(i,t,n),e.level=i.level;let a=[i];for(let i of r.slice(1))if(i!==void 0){if(X(i,t,n),i===e.component)break;e.level=Math.max(e.level,i.level),a.push(i)}return a.forEach(t=>Ur(e,t)),!0}case`SubstIn`:case`APSubstIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.body;X(r,t,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)}),e.level=e.substs.reduce((e,t)=>r.levelParams.has(t.op)?Math.max(e,t.expr.level):e,r.level),r.levelParams.forEach(t=>Y(e.levelParams,ni(t,e.substs,!1))),e.kind===`APSubstIn`?r.allParams.forEach(t=>Y(e.allParams,ni(t,e.substs,!0))):(e.allParams=new Set(r.allParams),e.nonLeibnizParams=new Set(r.nonLeibnizParams),e.substs.forEach(t=>{e.allParams.has(t.op)&&(e.allParams.delete(t.op),Y(e.allParams,t.expr.allParams),Y(e.nonLeibnizParams,t.expr.nonLeibnizParams),e.nonLeibnizParams.has(t.op)&&(e.nonLeibnizParams.delete(t.op),Y(e.nonLeibnizParams,t.expr.allParams)))}));let i=oi(e.instantiatedModule,n);return e.levelConstraints=ii(r,e.substs,i,t,n),e.argLevelConstraints=ai(r,e.substs,t,n),e.argLevelParams=ri(r.argLevelParams,e.substs),e.levelCorrect}case`Instance`:return vi(e,t,n);case`Assume`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=X(e.body,t,n),i=!e.definition||X(e.definition,t,n);return e.level=e.body.level,Hr(e,e.body),e.level!==0&&J(n,e.location,`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${e.level}.`),r&&i}case`Theorem`:{if(e.levelChecked>=t)return!0;let r=gi(e,[e.definition??e.body,...e.proof?[e.proof]:[]],t,n),i=e.body;return i.kind===`OpAppl`&&i.operator.name===`$Pick`&&i.level===3&&i.ranges.forEach(e=>{e.level!==0&&J(n,e.location,`Non-constant bound of temporal PICK.`)}),i.level===3&&_i(e.proof,n),r}case`LeafProof`:case`UseOrHide`:return gi(e,e.facts,t,n);case`NonLeafProof`:return gi(e,[...e.steps,...e.instances],t,n);case`DefStep`:return gi(e,e.defs,t,n);case`NewSymb`:return e.levelChecked>=t||(e.levelChecked=t,e.level=e.declaration.level,e.set===void 0)||(e.levelCorrect=X(e.set,t,n),e.level=Math.max(e.level,e.set.level),e.level===3&&(e.levelCorrect=!1,J(n,e.location,`Level error:
35
- Temporal formula used as set.`)),Hr(e,e.set)),e.levelCorrect;case`AssumeProve`:return e.levelChecked>=t||(e.levelChecked=t,e.levelCorrect=!0,e.assumptions.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.goal,t,n),e.level=e.assumptions.reduce((e,t)=>Math.max(e,t.level),e.goal.level),[e.goal,...e.assumptions].forEach(t=>Ur(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&Lr(e.levelConstraints,t,2)})),e.levelCorrect}},yi=e=>{switch(e.kind){case`OpAppl`:return[...e.ranges,...e.operands];case`OpDef`:case`ThmOrAssumpDef`:case`Label`:return[e.body];case`LetIn`:return[...e.opDefs,...e.instances,e.body];case`SubstIn`:case`APSubstIn`:return[e.body,...e.substs.map(e=>e.expr)];case`Instance`:return e.substs.map(e=>e.expr);case`AssumeProve`:return[...e.assumptions,e.goal];case`NewSymb`:return[e.set];default:return[]}},bi=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),xi=e=>{let t=/* @__PURE__ */ new Set,n=e=>{if(e===void 0||t.has(e))return!1;if(t.add(e),e.kind===`OpAppl`){let t=e.operator;if(t.kind===`OpDecl`||t.kind===`FormalParam`)return!0;if(t.kind===`OpDef`){if(t.name===`BOOLEAN`)return!0;let e=t.module?.name;if(e!==void 0&&bi.get(e)===t.name||n(t))return!0}}return yi(e).some(n)};return n(e)},Si=e=>e.operands.filter(e=>e?.kind===`OpAppl`),Ci=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},wi=e=>JSON.stringify([e.operands.length,...Si(e).map(e=>Ci(e)?.value).sort()]),Ti=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),Ti(e,t))}),t),Ei=e=>{let t=e.records.map(t=>({domain:wi(t),warnings:Si(t).flatMap(t=>{let n=Ci(t),r=n&&Mn(e.context,n.value);return n===void 0||r===void 0?[]:[{location:n.location,text:`The field name "${n.value}" in the record constructor is identical to the existing definition or declaration\nnamed ${n.value}, located at ${yn(r.location)}.\nThe field in the record will not take the value of the ${n.value} definition or declaration.\nIn TLA+, field names in records are strings, regardless of any similarly named declarations or definitions.\nTherefore, DOMAIN [${n.value} |-> ...] = {"${n.value}"} holds true.`,isWarning:!0}]})})),n=new Set(t.flatMap(e=>e.warnings.length>0?[e.domain]:[])),r=/* @__PURE__ */ new Set;return[...[...Ti(e)].flatMap(e=>e.records),...e.records].forEach(e=>{let t=wi(e);n.has(t)&&!r.has(t)&&Si(e).some(xi)&&r.add(t)}),t.flatMap(e=>r.has(e.domain)?[]:e.warnings)},Di=e=>`${yn(e.location)}\n\n${e.text}`,Oi=e=>{let t=e.filter(e=>!e.isWarning),n=e.filter(e=>e.isWarning);return[t.length>0?`*** Errors: ${t.length}\n\n`:``,...t.map(e=>`${Di(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${Di(e)}\n\n\n`)].join(``)},ki=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Ai=e=>{let t=/* @__PURE__ */ new Set,n=[],r=e=>{t.add(e.name),n.push(...e.extends),e.modules.forEach(r)};return r(e),n.filter(e=>!t.has(e))},ji=e=>{try{return n.H(sr(e))}catch(e){if(e instanceof t.O)return;throw e}},Mi=(e,t)=>t===`1.7.4`&&n.Kt(e)!==void 0?void 0:ji(e)?.name,Ni=(e,r,o={})=>{let s=(0,i.basename)(e,`.tla`),c=n.R(o.version),l=o.fileName??s,u=(0,a.existsSync)(e)?(0,a.readFileSync)(e,`utf8`):c.get(s),d=[],f=e=>{d.push(e),o.onPrint?.(e)},p=e=>f(`${e}\n`),m=o.version===`1.7.4`,h=m&&o.isXmlExport,g=e=>{o.isXmlExport||p(e)},_=o.describeFile,v=/* @__PURE__ */ new Map([[s,(0,a.existsSync)(e)?`file`:`standard`]]),y={value:!1},b=[],x={isReported:!1,isAborted:!1},S=mt(Oe(),p),C=/* @__PURE__ */ new Map,w=[],T=()=>w.splice(0).forEach(e=>e.isError?o.onPrintError?.(`${e.text}\n`):p(e.text)),E=e=>{let t=C.get(e),n=t?.module.location.range;if(t===void 0||n===void 0)return;let r=t.text.split(/\r\n|\r|\n/),i=mn(S,r.slice(n.start.line-1,n.end.line),o.version),a=i.has(`TLA_DIVERGENCE_EXISTS`),s=i.has(`PCAL_DIVERGENCE_EXISTS`),c=a===s?void 0:`The ${a?`TLA+ translation`:`PlusCal algorithm`} in module ${e} has changed since its last translation.`;if(m){let t=a&&s?`The PlusCal algorithm and its TLA+ translation in module ${e} filename since the last translation.`:c;t===void 0?i.has(`ERROR_ENCOUNTERED`)&&w.push({text:`A unexpected problem was encountered attempting to validate the specification for ${e}`,isError:!0}):w.push({text:`!! WARNING: ${t}`,isError:!1});return}let l=a&&s?`Both the PlusCal algorithm and its TLA+ translation in module ${e} have changed since the last translation.`:c??(i.has(`ERROR_ENCOUNTERED`)?`An unexpected problem was encountered attempting to validate the specification for ${e}`:void 0);if(l===void 0)return;let u=!i.has(`ERROR_ENCOUNTERED`)||a||s;b.some(e=>e.text===l)||b.push({location:e,text:l,isWarning:u})},D=(e,t)=>{if(o.isXmlExport||C.has(e))return;let n=ji(t);if(n===void 0||n.name!==e)return;let r=[...C.values()].filter(t=>Ai(t.module).includes(e));C.set(e,{text:t,module:n}),r.forEach(()=>E(e)),Ai(n).filter(t=>t!==e&&C.has(t)).forEach(E)},O=()=>{if(T(),x.isReported)return;x.isReported=!0;let e=b.filter(e=>e.isWarning);e.length>0&&(g(`Warnings (${e.length}) during syntax parsing of ${l}:\n\n`),e.forEach(e=>g(`${Di(e)}\n\n\n`))),e.length!==b.length&&(p(Oi(b)),y.value=!0,x.isAborted=!0)},ee=e=>{let t=c.get(e),i=r(e),a=i===void 0&&t===void 0&&u!==void 0&&!m?n.B(u,e):void 0,o=i??a;return v.set(e,i===void 0?a===void 0?`standard`:`root file`:`file`),o!==void 0&&D(e,o),o??t},te=(()=>{try{if(u===void 0)throw new t.E(`Cannot find source file for module ${l}`,void 0);return D(s,u),Nr(u,ee,{rootFileName:s,rootFilePath:o.isXmlExport?`${l.replace(/\.tla$/,``)}.tla`:void 0,version:o.version,rootExtendees:o.rootExtendees,onParse:e=>{_&&p(`Parsing file ${_(e,v.get(e)??`file`)}`),e===s&&E(s),T()},onAnalyze:e=>{O(),(_||h)&&!x.isAborted&&p(`Semantic processing of module ${e}`)},onModule:(e,t)=>{if(x.isAborted||(t.every(e=>e.isWarning)&&hi(e,{messages:t,isTlc174:m}),t.length===0))return;if(t.some(e=>!e.isWarning)&&(y.value=!0),m)return p(`Semantic errors:\n\n${Oi(t)}`);let n=t.filter(e=>e.isWarning);n.length>0&&(g(`*** Warnings: ${n.length}\n`),n.forEach(e=>g(`${Di(e)}\n\n\n`)));let r=t.filter(e=>!e.isWarning);r.length!==0&&(p(`Semantic errors:\n\n*** Errors: ${r.length}\n`),r.forEach(e=>p(`${Di(e)}\n\n`)))}})}catch(e){if(y.value=!0,e instanceof t.c){p(`\nFatal errors while parsing TLA+ spec in file ${l}\n`),p(e.message),p(Oi(b));return}if(!(e instanceof t.E))throw e;let n={location:e.location,text:e.message,isWarning:!1},r=m&&e.parseError?.includes(` and token "" `);if(e.parseError!==void 0&&!r&&!h&&p(e.parseError),p(`\nFatal errors while parsing TLA+ spec in file ${l}\n`),r){p(`java.lang.NullPointerException: Cannot invoke "String.length()" because "str" is null`);return}if(m){p(`tla2sany.semantic.AbortException`),f(`*** Abort messages: 1\n\n${Di(n)}\n\n\n`);return}p(Di(n)),p(Oi(x.isReported?[n]:[...b,n]))}})();if(te!==void 0&&O(),te!==void 0&&!y.value&&!o.isXmlExport&&!m){let e=te.modules.filter(e=>!ki.has(e.name));_&&e.forEach(e=>p(`Linting of module ${e.name}`)),e.flatMap(Ei).forEach(e=>p(`${Di(e)}\n\n\n`))}return{text:d.join(``),isFailed:y.value,specification:x.isAborted?void 0:te}},Pi={success:t.W.success,"assumption-violation":t.W.assumptionViolation,deadlock:t.W.deadlock,"invariant-violation":t.W.safetyViolation,"property-violation":t.W.safetyViolation,"liveness-violation":t.W.livenessViolation,"postcondition-violation":t.W.assumptionViolation,error:t.W.error},Fi=e=>/^[+-]?\d+$/.test(e)&&BigInt.asIntN(64,BigInt(e))===BigInt(e),Ii=e=>e?e[0]===`auto`?(0,s.availableParallelism)():Math.max(1,Number.parseInt(e[0],10)||1):1,Li=[`constrained`,`stuttering`,`strict`],Ri=(e,t)=>e.endsWith(t)?e:`${e}${t}`,zi=e=>{if(e.length===1)return{path:Ri(e[0],`.dump`)};let t=e[0].toLowerCase();return{path:Ri(e[1],`.dot`),dot:!0,colorize:t.includes(`colorize`),actionLabels:t.includes(`actionlabels`),snapshot:t.includes(`snapshot`)}},Bi=(e,t)=>e.print(n.dt.computingInitProgress,n.ft.none,`Computed ${t} initial states...`),Vi=(e,t)=>e===`invariant-violation`?{code:n.dt.invariantViolatedInitial,text:`Invariant ${t} is violated by the initial state:`}:{code:n.dt.propertyViolatedInitial,text:`Property ${t} is violated by the initial state:`},Hi=(e,t)=>t?.forEach(t=>{if(typeof t==`string`)return console.log(t);if(t.kind===`initial-states-progress`)return Bi(e,t.count);let r=Vi(t.status,t.name);e.print(r.code,n.ft.error,`${r.text}\n${n.At(t.state)}`)}),Ui=(e,t,r={code:n.dt.behaviorUpToThisPoint,text:`The behavior up to this point is:`},i=!1)=>{t.length>0&&e.print(r.code,n.ft.error,r.text),t.forEach((t,r)=>{(r>0||i)&&Hi(e,t.output),e.print(n.dt.statePrint2,n.ft.state,`${r+1}: <${t.label??t.action??`Initial predicate`}>\n${n.At(t.state)}`)})},Wi={code:n.dt.counterExample,text:`The following behavior constitutes a counter-example:
36
- `},Gi=(e,t)=>t===`1.7.4`||e.length===0?`Temporal properties were violated.
37
- `:e.length===1?`Temporal property ${e[0]} was violated.\n`:`Temporal properties ${e.slice(0,-1).join(`, `)}${e.length>2?`,`:``} and ${e[e.length-1]} were violated.\n`,Ki=e=>e.filter((t,n)=>t!==e[n-1]).map((e,t)=>`${t}) ${n.Y(e)}\n`).toReversed().join(``),qi=e=>{if(e.length===0)return` The error call stack is empty.
38
- `;let t=[];return e.forEach((n,r)=>{let i=n.location.range;n!==e[r-1]&&i&&t.push(`${t.length}. Line ${i.start.line}, column ${i.start.column} to line ${i.end.line}, column ${i.end.column} in ${i.module}\n`)}),`${t.join(``)}\n`},Ji=(e,t)=>{let r=t.generated,i=t.distinct,a=n.gt(/* @__PURE__ */ new Date);r===i?e.print(n.dt.initGenerated1,n.ft.none,`Finished computing initial states: ${i} distinct state${i===1?``:`s`} generated at ${a}.`):e.print(n.dt.initGenerated2,n.ft.none,`Finished computing initial states: ${r} state${r===1?``:`s`} generated, with ${i} of them distinct at ${a}.`)},Yi=(e,t,r)=>{let i=Math.max(Date.now()-(r??0),1)/6e4,a=e=>e.toLocaleString(`en-US`),o=(e,t)=>r===void 0?``:` (${a(Math.floor(e/i))} ${t}/min)`;e.print(n.dt.progress,n.ft.none,`Progress(${Math.max(t.depth,1)}) at ${n.gt(/* @__PURE__ */ new Date)}: ${a(t.generatedStates)} states generated${o(t.generatedStates,`s`)}, ${a(t.distinctStates)} distinct states found${o(t.distinctStates,`ds`)}, ${a(t.queuedStates)} states left on queue.`)},Xi=(e,t)=>(0,i.join)(e,`${t}.class`),Zi=(e,t,r,a)=>{let s=e.print;switch(t.kind){case`parsed`:r.isParsed=!0,e.isTool&&s(n.dt.sanyFinished,n.ft.none,`SANY finished.`),s(n.dt.starting,n.ft.none,`Starting... (${n.gt(/* @__PURE__ */ new Date)})`);return;case`constant-level-invariant`:if(e.version===`1.7.4`)return;s(n.dt.constantLevelInvariant,n.ft.warning,`The invariant ${t.name} is a constant-level formula (i.e., it contains no variables, primes, or temporal operators) and evaluates to TRUE. To assert constant-level formulas in your spec, use ASSUME ConstInv. If you optionally want to give the assumption a name, write ASSUME YourAssumption == ConstInv instead. See https://explain.tlapl.us/assumptions-and-invariants for additional details.`);return;case`state-level-property`:if(e.version===`1.7.4`)return;s(n.dt.stateLevelProperty,n.ft.warning,`The formula ${t.name} is a state-level formula, but it was used as a PROPERTY (or PROPERTIES), where a temporal formula is typically expected. State-level formulas used as PROPERTY or PROPERTIES are only checked in the initial state. To verify that the formula ${t.name} holds in all states of every behavior, use INVARIANT ${t.name} instead. Alternatively, applying the "always" temporal operator ([]) to the state-level formula ${t.name} changes it into a temporal formula, asserting that ${t.name} holds in all states of every behavior. See https://explain.tlapl.us/invariants-and-properties for additional details.`);return;case`liveness-initializing`:t.isSymmetric&&s(n.dt.livenessSymmetry,n.ft.warning,`Declaring symmetry during liveness checking is dangerous. It might cause TLC to miss violations of the stated liveness properties. Please check liveness without symmetry defined.`),t.isConstrained&&e.version===`1.7.4`&&s(n.dt.livenessConstraints,n.ft.warning,`Declaring state or action constraints during liveness checking is dangerous: Please read section 14.3.5 on page 247 of Specifying Systems (https://lamport.azurewebsites.net/tla/book.html) and optionally the discussion at https://discuss.tlapl.us/msg00994.html for more details.`);return;case`liveness-prepared`:s(n.dt.temporalBranches,n.ft.none,`Implied-temporal checking--satisfiability problem has ${t.branches} branches.`);return;case`java-override`:{let e=(0,o.pathToFileURL)((0,i.resolve)(Xi(a,t.module))).href;s(t.isMatched?n.dt.javaOverrideLoaded:n.dt.javaOverrideMismatch,t.isMatched?n.ft.none:n.ft.warning,`${t.isMatched?`Loading`:`Failed to match`} ${t.operator} operator override from ${e.replace(`file:///`,`file:/`)} with signature: <Java Method: ${t.signature}>.`);return}case`initial-states-started`:s(n.dt.computingInit,n.ft.none,`Computing initial states...`);return;case`initial-states-progress`:Bi(e,t.count);return;case`initial-states-computed`:Ji(e,t.initialStates);return;case`progress`:Yi(e,t.statistics,r.startTime);return;case`liveness-started`:{r.livenessStartTime=Date.now(),t.isComplete&&Yi(e,t.statistics);let i=t.branches>1?`${t.branches} branches of `:``,a=t.branches*t.states;s(n.dt.checkingTemporal,n.ft.none,`Checking ${i}temporal properties for the ${t.isComplete?`complete`:`current`} state space with ${a} total distinct states at (${n.gt(/* @__PURE__ */ new Date)})`);return}case`liveness-finished`:Qi(e,r);return;case`sequential-fallback`:process.stderr.write(`Warning: the search created the string ${JSON.stringify(t.string)}, so tla-ts checks the model again with one worker. Workers agree on the order of strings only when the strings exist before the search.\n`);return;case`warning`:s(t.code,n.ft.warning,t.text);return;case`violation`:$i(t.status,t.violation,e)}},Qi=(e,t)=>{t.livenessStartTime!==void 0&&(e.print(n.dt.checkingTemporalEnd,n.ft.none,`Finished checking temporal properties in ${n._t(Date.now()-t.livenessStartTime)} at ${n.gt(/* @__PURE__ */ new Date)}`),t.livenessStartTime=void 0)},$i=(e,t,r)=>{let i=r.print,a=t.name,o=t.loopStart,s=o===void 0&&t.trace.length===1&&(e===`invariant-violation`||e===`liveness-violation`),c={code:n.dt.temporalPropertyViolated,text:Gi(t.properties??[a],r.version)},l={success:void 0,error:void 0,"assumption-violation":t.message?{code:n.dt.assumptionEvaluationError,text:n.mt(n.dt.assumptionEvaluationError,`Evaluating assumption ${a} failed.\n${t.message}`,r.isTool)}:{code:n.dt.assumptionFalse,text:`Assumption ${a} is false.`},deadlock:{code:n.dt.deadlockReached,text:`Deadlock reached.`},"invariant-violation":s?Vi(`invariant-violation`,a):{code:n.dt.invariantViolatedBehavior,text:`Invariant ${a} is violated.`},"property-violation":c,"liveness-violation":o===void 0?s?Vi(`liveness-violation`,a):{code:n.dt.actionPropertyViolatedBehavior,text:`Action property ${a} is violated.`}:c,"postcondition-violation":{code:t.postcondition?.code??n.dt.general,text:t.message??`Postcondition ${a} is false.`}}[e],u=e===`property-violation`,d=o!==void 0&&!u,f=u||d,p=f&&r.version!==`1.7.4`;if(p&&Hi(r,t.trace[0]?.output),t.counts&&console.log(t.counts),l){let e=s?`${l.text}\n${n.At(t.trace[0].state)}`:l.text;i(l.code,n.ft.error,e)}if(s||(f||Hi(r,t.trace[0]?.output),Ui(r,t.trace,f?Wi:void 0,f&&!p),Hi(r,t.traceOutput)),d){let e=t.loopLabel;o===t.trace.length-1?i(n.dt.statePrint3,n.ft.state,`${o+2}: Stuttering`):r.isTool?i(n.dt.backToState,n.ft.state,`${o+1}: Back to state${e?`: <${e}>\n`:``}`):console.log(`Back to state ${o+1}${e?`: <${e}>\n`:``}`)}t.warning&&r.version!==`1.7.4`&&i(t.warning.code,n.ft.warning,t.warning.text);let m=t.unwitnessed??(e===`postcondition-violation`?void 0:t.postcondition);return m?.counts&&console.log(m.counts),m&&i(m.code,n.ft.error,m.message),!s&&e!==`assumption-violation`},ea=(e,t)=>e.print(n.dt.nestedExpression,n.ft.error,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\n${qi(t)}`),ta=(e,r,i)=>{let a=r.print;if(e.failure){let i=e.failure,o=r.isTool?i.toolMessage:i.message,s=()=>{let e=i.fingerprint;if(e){let t=i.callStack?.length&&r.version!==`1.7.4`?qi(i.callStack):Ki(e.sources);a(n.dt.fingerprintFailed,n.ft.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${t}\nReason:\n${n.ht(e.reason,r.isTool)}`)}else i.callStack&&ea(r,i.callStack)};i.isCallStackFirst&&s();let c=i.initialState&&(()=>{try{return`While working on the initial state:\n${n.At(i.initialState)}`}catch(e){throw e instanceof t._?t.K(new t._(`${t.P}${e.message}`),t.W.error):e}})();a(c?n.dt.initialState:i.code,n.ft.error,c?`${o}\n${c}`:o),Hi(r,i.trace[0]?.output),Ui(r,i.trace);let l=i.traceFailure;l&&a(l.code,n.ft.error,r.isTool?l.toolMessage:l.message),Hi(r,i.traceOutput);let u=i.postcondition;u?.counts&&console.log(u.counts),u&&a(u.code,n.ft.error,u.message),i.isCallStackFirst||s()}else if(e.violation){if(!$i(e.status,e.violation,r))return;let t=e.additionalViolation;t&&$i(`property-violation`,t,r),e.liveCallStack&&ea(r,e.liveCallStack)}else{Qi(r,i);let t=n.f(e.distinctStates,e.generatedStates),o=e.fingerprintDistance===void 0?[]:[` based on the actual fingerprints: val = ${n.l(n.u(e.fingerprintDistance))}`];a(n.dt.success,n.ft.none,[`Model checking completed. No error has been found.`,` Estimates of the probability that TLC did not check all reachable states`,` because two distinct states had the same fingerprint:`,` calculated (optimistic): val = ${n.l(t)}`,...o].join(`
39
- `))}if(e.failure?.isWithoutStatistics)return;e.status!==`success`&&Qi(r,i),r.isTool&&Yi(r,e,i.startTime),a(n.dt.stats,n.ft.none,`${e.generatedStates} states generated, ${e.distinctStates} distinct states found, ${e.queuedStates} states left on queue.`);let o=r.version===`1.7.4`,s=o?e.outDegrees??e.violationOutDegrees:e.outDegrees;(!o||s)&&a(n.dt.searchDepth,n.ft.none,`The depth of the complete state graph search is ${o?Math.max(e.depth,1):e.depth}.`);let c=s&&n.p(s);c&&a(n.dt.stateGraphOutdegree,n.ft.none,c)},na=e=>n.z([e]).toString(),ra=(e,t,n,r,o)=>{let c=n.temporaryDirectory??(0,s.tmpdir)(),l=(0,a.existsSync)(c)?(0,a.realpathSync)(c):(0,i.resolve)(c),u=(0,i.join)(l,`tlc-${na((0,i.resolve)(e))}`),d=S(n);return(n,s)=>{let c=`${n}.tla`;if(s===`file`)return(0,a.realpathSync)(p(t,n)??e);if(o===`1.7.4`)return(0,i.join)(l,c);if(s===`root file`){let t=r===void 0?l:(0,i.resolve)(r),o=(0,a.realpathSync)(e);return`${(0,i.join)(t,na(`${o} ${n}`),c)} (${o})`}let f=(0,i.join)(u,c);return d===void 0?f:`${f} (${g(d)}${c})`}},ia=e=>e.print(n.dt.version,n.ft.none,`TLC2 Version ${C} (rev: tla-ts)`),aa=(e,t)=>(ia(e),e.print(n.dt.commandLineError,n.ft.error,`${t}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1),oa=(e,t,r)=>e.print(n.dt.modelChecking,n.ft.none,`Running breadth-first search Model-Checking with fp 0 and seed ${BigInt(t)} with ${r} worker${r===1?``:`s`} on ${(0,s.availableParallelism)()} cores with ${Math.floor((0,c.getHeapStatistics)().heap_size_limit/1024/1024)}MB heap and 0MB offheap memory [pid: ${process.pid}] (${(0,s.type)()} ${(0,s.release)()} ${(0,s.arch)()}, Node.js ${process.versions.node} ${process.arch.endsWith(`64`)?64:32}bit, MemFPSet, MemStateQueue).`),sa=(e,t)=>{let n=[...e.unknown,...e.options.map(e=>e.name)],r=(e,t=e)=>n.some(n=>n===e||n.toLowerCase()===t.toLowerCase()),i=r(`-generateSpecTE`)||!r(`-noGenerateSpecTE`,`-noTE`)&&!r(`-tool`)&&!r(`-continue`);return t!==`1.7.4`&&i&&!r(`-noGenerateSpecTEBin`,`-noTEBin`)},ca=async(e,o,s,c)=>{let l=o.has(`-seed`)?o.get(`-seed`)?.[0]:`0`;if(l===void 0)return aa(c,`Error: seed required.`);if(!Fi(l))return aa(c,`Error: An integer for seed required. But encountered ${l}`);let u=o.has(`-lncheck`)?o.get(`-lncheck`)?.[0]?.toLowerCase():`default`;if(u===void 0)return aa(c,`Error: expect a strategy such as final for -lncheck option.`);let d=o.get(`-dump`);if(d?.length===0)return aa(c,`Error: A file name for dumping states required.`);let f=d?.length===2&&Li.find(e=>d[0].toLowerCase().includes(e));if(f)return console.error(`Error: tla-ts does not support the -dump format ${f}.`),1;let p=o.get(`-fp`)?.[0];if(p!==void 0&&Number(p)!==0)return console.error(`Error: tla-ts fingerprints states as TLC does with -fp 0, not -fp ${p}.`),1;let g=Ii(o.get(`-workers`)),v=c.version;ia(c),oa(c,l,g);let y=o.get(`-config`)?.[0]??(o.has(`-config`)?void 0:e.replace(/\.tla$/,`.cfg`));if(!y||!(0,a.existsSync)(y))return c.print(n.dt.configFileError,n.ft.error,`TLC encountered the following error when trying to read the configuration file ${y??``}:\nFile not found.`),t.W.configParseError;let b=(0,i.basename)(e,`.tla`),C={startTime:Date.now(),livenessStartTime:void 0,isParsed:!1},w=()=>{let e=Date.now()-C.startTime;c.print(n.dt.finished,n.ft.none,`Finished in ${c.isTool?`${e}ms`:n._t(e)} at (${n.gt(/* @__PURE__ */ new Date)})`)},T=()=>c.print(n.dt.parsingFailed,n.ft.error,`Parsing or semantic analysis failed.`),E=e=>(e instanceof t.O?T():_(e,c),w(),t.V(e)),D=(()=>{try{return r.h((0,a.readFileSync)(y,`utf8`),v)}catch(e){if(!(e instanceof t.h))throw e;return e}})();if(D instanceof t.h&&v===`1.7.4`)return c.print(n.dt.general,n.ft.error,`${t.H(`tlc2.tool.ConfigFileException`)}${n.ht(D.message,c.isTool)}`),w(),t.W.error;if(D instanceof t.h)return E(D);o.has(`-deadlock`)&&(D.checkDeadlock=!1);let O=(0,i.dirname)(e),ee=[O,...s.libraries],te=m(ee),k=sa(o,v);c.isTool&&c.print(n.dt.startingSany,n.ft.none,`Starting SANY...`);let A=(0,i.isAbsolute)(e),j=A?b:e.replace(/\.tla$/,``),ne=S(s),re=v===`1.7.4`?da(e,s,ne):void 0;if(re?!(0,a.existsSync)(e)&&!n.I.has(b)&&re(`${b}.tla`):!(0,a.existsSync)(e)&&!n.L.has(b)&&h(A?O:process.cwd(),A?`${b}.tla`:`./${j}.tla`,[...A||O===`.`?[]:[O],...s.libraries]),Ni(e,re?x(te,re):te,{fileName:j,describeFile:ra(e,ee,s,o.get(`-metadir`)?.[0],v),version:v,rootExtendees:k?[`_TLCTrace`]:void 0,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}).isFailed)return Zi(c,{kind:`parsed`},C,O),T(),w(),t.W.specParseError;try{let s=(0,a.readFileSync)(e,`utf8`),f=n.V(s).name;if(f!==b)throw new t.E(`File name '${b}' does not match the name '${f}' of the top level module it contains.`,void 0);let p=await r.m({workers:g,livenessCheck:[`final`,`seqfinal`,`off`].includes(u)?`final`:`default`,seed:BigInt(l),dump:d&&zi(d),isTool:c.isTool,isContinued:o.has(`-continue`),isTraceRecorded:k,isSanyReported:!0,isWarningEnabled:!o.has(`-nowarning`),version:v,onProgress:e=>Zi(c,e,C,O),source:s,config:D,onPause:()=>(0,a.readSync)(0,Buffer.alloc(1)),loadModule:te,loadClass:e=>{let t=Xi(O,e);return(0,a.existsSync)(t)?(0,a.readFileSync)(t):void 0},readFile:e=>(0,a.existsSync)(e)?(0,a.readFileSync)(e,`utf8`):void 0,writeFile:(e,t)=>{(0,a.mkdirSync)((0,i.dirname)((0,i.resolve)(e)),{recursive:!0}),(0,a.writeFileSync)(e,t)}});return ta(p,c,C),w(),p.failure?.exitCode??Pi[p.status]}catch(e){if(!(e instanceof t.g))throw e;return e instanceof t.O&&console.log(la(e,b)),C.isParsed||Zi(c,{kind:`parsed`},C,O),E(e)}},la=(e,n)=>{let r=e instanceof t.E;if(!r&&!e.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${e.message}\n\n`;let i=r?e.location===void 0?`Unknown location\n\n${e.message}`:`In module ${e.location}\n\n${e.message}`:`In module ${n}\n\nCould not parse module ${n} from file ${n}.tla`;return`${e.failure?`***Parse Error***\n${e.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${n}\n\n${i}\n*** Errors: 1\n\n${i}\n\n\n`},ua=async(e,r)=>{let o=me.parse(e),s=f(o.positionals),c=o.has(`-config`),l=s.map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.tla`)&&(!e.isGlobbed||c||(0,a.existsSync)(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(l.length===0)return console.error(F),1;if(c&&l.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let u=[...new Set(l.map(e=>(0,a.existsSync)(e)||(0,i.isAbsolute)(e)?e:r.libraries.map(t=>(0,i.join)(t,e)).find(a.existsSync)??e))],d=[];for(let[e,t]of u.entries()){e>0&&console.log(``),u.length>1&&console.log(`Checking ${(0,i.basename)(t)} with ${(0,i.basename)(t,`.tla`)}.cfg`);let a=n.pt(o.has(`-tool`),!o.has(`-nowarning`),r.tlcVersion??`master`);d.push(await v(()=>ca(t,o,r,a),a))}return d.find(e=>e!==t.W.success)??t.W.success},da=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),a=(!(0,i.isAbsolute)(e)&&r!==``?[r]:t.libraries).map(b),o=a.length>0?a[a.length-1]:(0,i.isAbsolute)(e)?r:``;return e=>y(`${o}${e}`,a,n)},fa={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},pa=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),ma={"&":`&amp;`,"<":`&lt;`,">":`&gt;`,"\r":`&#13;`},ha=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:ma[e]),ga=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,_a=e=>{let t=(e.cdata??e.text)?.match(ga)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=_a(t);if(e)return e}},va=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${ha(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)va(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},ya=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),ba=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},xa={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},Sa={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Ca=yn(`--TLA+ BUILTINS--`),wa=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},Ta=(e,t=16)=>e>t*.75?Ta(e,t*2):t,Ea=(e,t)=>(e^e>>>16)&t-1,Da=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},Oa=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),ka=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,Aa=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=Da(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(ka,``)}).join(`
40
- `)},ja=e=>{let t=Da(e),n=e=>Oa(e).startsWith(`\\*`);return t.filter(n).length<Math.floor(t.length/2)?e:t.map(e=>{if(!n(e))return e;let t=e.indexOf(`\\*`)+2;return e.slice(e[t]===` `?t+1:t)}).join(`
41
- `)},Ma=(e,n,r)=>{let i=r.version===`1.7.4`,a=/* @__PURE__ */ new Set,o=/* @__PURE__ */ new Map,s={isSet:!1},c=[],l=(e,t)=>{if(!i)return t();c.push(...e);let n=t();return c.length-=e.length,n},u=(e,n)=>{let r=[...c,...n].reverse(),i=[e,...r.map(e=>`\tat tla2sany.${e.at}`)].join(`
42
- `),a=r.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${i}\n`).join(``);return t.K(new t.x(i,a),fa.uncaughtException)},d=e=>u(`java.lang.NullPointerException: Cannot invoke "tla2sany.semantic.${e.nullType}.export(org.w3c.dom.Document, tla2sany.xml.SymbolContext)" because ${e.nullValue} is null`,[e]),f=(e,t)=>(a.has(e.id)||(a.add(e.id),o.set(e.id,l([...t?[t]:[],...wa(e.kind,yn(e.location))],()=>g(e)))),Z(ba(e),[Q(`UID`,e.id)])),p=(e,t,n)=>{let r=t.levelChecked===0?[]:[Q(`level`,t.level)],i=n?[ya(n),...r]:r;return{...e,children:[...i,...e.children]}},m=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[f(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),h=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
43
- `),n=r.isUncommented?ja(Aa(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:n,children:[]}]:[]},g=e=>{switch(e.kind){case`FormalParam`:return p(Z(`FormalParamNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity)]),e,e.location);case`OpDecl`:return p(Z(`OpDeclNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Q(`kind`,e.declKind)]),e,e.location);case`OpDef`:{if(e.defKind===`NumberedProofStep`)throw i?u(pa(37),[Sa]):t.K(new t.A(pa(37)),fa.uncaughtException);if(e.defKind===`ModuleInstance`)return p(Z(`ModuleInstanceKind`,[Q(`uniquename`,e.name),...e.isLocal&&!i?[Z(`local`)]:[]]),e,e.location);let n=e.params??[];if(e.defKind===`BuiltIn`)return p(Z(`BuiltInKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),...e.params?[m(n,e.isLeibnizArg,$.builtInParam)]:[]]),e,e.location);let r=e.body,a=e.module;if(r===void 0&&i)throw d($.body);if(r===void 0||a===void 0)throw Error(`The definition of ${e.name} has no body`);return p(i?Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`body`,[x(r,$.body)]),...e.params?[m(n,e.isLeibnizArg,$.param)]:[],...e.inRecursive?[Z(`recursive`)]:[]]):Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`originalOperator`,[f(e.source??e)]),Z(`originallyDefinedInModule`,[f(a)]),Z(`body`,[x(r,$.body)]),m(n,e.isLeibnizArg,$.param),...h(e.preComments),...e.inRecursive?[Z(`recursive`)]:[],...e.recursiveSection>=0?[Q(`recursiveSection`,e.recursiveSection)]:[],...e.isLocal?[Z(`local`)]:[]]),e,e.location)}case`ThmOrAssumpDef`:return p(Z(e.isTheorem?`TheoremDefNode`:`AssumeDef`,[Q(`uniquename`,e.name),x(e.body,$.theoremDefinitionBody)]),e,e.location);case`Module`:return Z(`ModuleNode`,[ya(e.location),..._(e)]);case`Theorem`:return p(Z(`TheoremNode`,[...e.definition?[Z(`definition`,[f(e.definition,$.theoremDefinition)])]:[],Z(`body`,[x(e.body,$.theorem)]),...e.proof?[x(e.proof,$.proof)]:[],...e.isSuffices?[Z(`suffices`)]:[]]),e,e.location);case`Assume`:return Z(`AssumeNode`,[ya(e.location),...e.body.levelChecked===0?[]:[Q(`level`,e.body.level)],...e.definition?[Z(`definition`,[f(e.definition,$.assumeDefinition)])]:[],Z(`body`,[x(e.body,$.assume)])])}},_=e=>{let t=t=>!r.isRestricted||t.module===e;return[Q(`uniquename`,e.name),...i?[]:[Z(`extends`,[...new Set(e.extendees.map(e=>e.name))].toSorted().map(e=>Q(`uniquename`,e)))],...Fn(e,2).filter(t).map(e=>f(e,$.constant)),...Fn(e,3).filter(t).map(e=>f(e,$.variable)),...Pn(e).filter(t).map(e=>f(e,$.definition)),...e.topLevel.map(e=>e.kind===`Instance`||e.kind===`UseOrHide`?x(e,$.topLevel):f(e,$.topLevel)),...e.definitions.filter(e=>!i&&e.kind===`Module`).map(e=>f(e))]},v=(e,t)=>l([t],()=>Z(`Subst`,[f(e.op,$.substOperator),x(e.expr,$.substExpression)])),y=e=>{if(e.isNull&&i)throw u(pa(0),[$.operator,...wa(`OpDef`,Ca),Sa]);let t=e.operands[e.operands.length-1];e.operator.name===`$Case`&&e.operands.length>1&&t?.kind===`OpAppl`&&t.operator.name===`$Pair`&&t.operands[0]===void 0&&(s.isSet=!0);let n=f(e.operator,$.operator),r=e.operands.map((e,t)=>e===void 0||t===0&&s.isSet&&bn(e)?i?Q(`StringNode`,`$Other`):Z(`StringNode`,[Q(`StringValue`,`$Other`)]):x(e,$.operand)),a=e.tupleOrs,o=e.unbounded===void 0&&e.bounded===void 0?[]:[Z(`boundSymbols`,[...(e.unbounded??[]).map((e,t)=>Z(`unbound`,[f(e,$.unbound),...a?.[t]?[Z(`tuple`)]:[]])),...(e.bounded??[]).map((t,n)=>Z(`bound`,[...t.map(e=>f(e,$.bound)),...a?.[n]?[Z(`tuple`)]:[],x(e.ranges[n],$.range)]))])];return Z(`OpApplNode`,[Z(`operator`,[n]),Z(`operands`,r),...o])},b=(e,t)=>e.kind===`Module`||e.kind===`OpDef`?f(e,t):x(e,t),x=(e,t)=>{if(!i)return S(e);if(e.kind===`OpAppl`&&e.isAbsent&&`nullType`in t)throw d(t);let n=[t,{at:`semantic.SemanticNode.export(SemanticNode.java:379)`,failedFor:yn(e.location)},{at:`semantic.LevelNode.getSemanticElement(LevelNode.java:333)`}];return l(n,()=>S(e))},S=e=>{switch(e.kind){case`OpAppl`:return p(y(e),e,e.location);case`Numeral`:return p(Z(`NumeralNode`,[Q(`IntValue`,e.value)]),e,e.location);case`String`:return p(Z(`StringNode`,[Q(`StringValue`,e.value)]),e,e.location);case`Decimal`:return p(Z(`DecimalNode`,[Q(`mantissa`,e.mantissa),Q(`exponent`,e.exponent),...i?[]:[Q(`integralPart`,e.integralPart),Q(`fractionalPart`,e.fractionalPart)]]),e,e.location);case`LetIn`:{let t=x(e.body,$.letBody);return p(Z(`LetInNode`,[Z(`body`,[t]),Z(`opDefs`,e.opDefs.map(e=>f(e,$.letDefinition)))]),e,e.location)}case`Label`:return p(Z(`LabelNode`,[Q(`uniquename`,e.name),Q(`arity`,e.params.length),Z(`body`,[x(e.body,$.labelBody)]),Z(`params`,e.params.map(e=>f(e,$.labelParam)))]),e,e.location);case`OpArg`:return p(Z(`OpArgNode`,[Z(`argument`,[f(e.op,$.argument)])]),e,e.location);case`At`:{let t=e.except.operands[0],n=e.component.operands[0];if(t===void 0||n===void 0)throw Error(`An @ refers to an incomplete EXCEPT`);return p(Z(`AtNode`,[x(t,$.exceptObject),x(n,$.exceptComponents)]),e,e.location)}case`SubstIn`:case`APSubstIn`:{let t=xa[e.kind],n=e.substs.map(e=>v(e,t.subst)),r=x(e.body,t.body);return p(Z(e.kind===`SubstIn`?`SubstInNode`:`APSubstInNode`,[Z(`substs`,n),Z(`body`,[r]),Z(`instFrom`,[f(e.instantiatingModule,t.from)]),Z(`instTo`,[f(e.instantiatedModule,t.to)])]),e,e.location)}case`Instance`:{let t=e.substs.map(e=>v(e,$.instanceSubst)),n=e.params.map(e=>f(e,$.instanceParam));return Z(`InstanceNode`,[ya(e.location),Q(`level`,0),...e.name===void 0?[]:[Q(`uniquename`,e.name)],Q(`module`,e.module.name),Z(`substs`,t),Z(`params`,n),...e.isLocal&&!i?[Z(`local`)]:[]])}case`UseOrHide`:return p(Z(`UseOrHideNode`,[Z(`facts`,e.facts.map(e=>b(e,$.useFact))),Z(`defs`,e.defs.map(e=>f(e,$.useDefinition))),...e.isOnly?[Z(`only`)]:[],...e.isHide?[Z(`hide`)]:[]]),e,e.location);case`NewSymb`:return p(Z(`NewSymbNode`,[f(e.declaration,$.newDeclaration),...e.set&&!(i&&bn(e.set))?[x(e.set,$.newSet)]:[]]),e,e.location);case`AssumeProve`:return p(Z(`AssumeProveNode`,[Z(`assumes`,e.assumptions.map(e=>x(e,$.assumption))),Z(`prove`,[x(e.goal,$.goal)]),...e.isSuffices?[Z(`suffices`)]:[],...e.isBoxed?[Z(`boxed`)]:[]]),e,e.location);case`LeafProof`:{let t=e.facts.length===0&&e.defs.length===0,n=e.isOmitted?Z(`omitted`):t?Z(`obvious`):Z(`by`,[Z(`facts`,e.facts.map(e=>b(e,$.byFact))),Z(`defs`,e.defs.map(e=>f(e,$.byDefinition))),...e.isOnly?[Z(`only`)]:[]]);return p(n,e,e.location)}case`NonLeafProof`:return p(Z(`steps`,[...i?[]:[Q(`proofLevel`,e.proofLevel)],...e.steps.map(e=>e.kind===`Theorem`?f(e,$.step):x(e,$.step))]),e,e.location);case`DefStep`:return p(Z(`DefStepNode`,e.defs.map(e=>f(e,$.defStep))),e,e.location)}},C=(r.isRestricted?[n]:e).map(e=>f(e,$.main)),w=Ta(o.size),T=Z(`context`,[...o.entries()].toSorted(([e],[t])=>Ea(e,w)-Ea(t,w)).map(([e,t])=>Z(`entry`,[Q(`UID`,e),t])));return Z(`modules`,[Q(`RootModule`,n.name),T,...C])},Na=(e,n={version:`master`,isRestricted:!1,isUncommented:!1,isTerse:!1})=>{let r=Ma(e.modules,e.root,n),i=_a(r);if(i){let e=i.character.codePointAt(0)??0;throw t.K(new t.A(`The spec contains the character U+${e.toString(16).toUpperCase().padStart(4,`0`)} in the ${i.tag} element. XML 1.0 cannot represent that character in character data, not even as a numeric character reference, so the spec cannot be exported until the character is removed from it.`),fa.unrepresentableCharacter)}let a=[`<?xml version="1.0" encoding="UTF-8" standalone="no"?>`];return va(r,0,n.isTerse?0:2,a),n.isTerse?a.join(``):`${a.join(`
44
- `)}\n`},Pa=(()=>{let e=e=>`\x1b[1m${e}\x1b[0m`,t=[[`-I`,`Include; use given directory path to resolve module dependencies.`],[`-help`,`Print this usage information.`],[`-o`,`Offline mode; skip XML schema validation step.`],[`-r`,`Restrict mode; include only declarations and definitions of the specified module, excluding extended or instantiated modules.`],[`-t`,`Terse; format XML output without tabs or newlines.`],[`-u`,`Uncomment; process boxed comments and single-line comments (\\*) in pre-comments to extract their content.`]],n=[`Only one root TLA+ file can be parsed per run.`,`Multiple directory search paths can be given by providing multiple -I arguments.`,`XML schema validation does not require network access.`];return[``,e(`NAME`),``,` tla2sany.xml.XMLExporter - Emit SANY's parse tree as XML - Version 2.2 created 08 July 2020`,``,``,e(`SYNOPSIS`),``,`\t${e(`tla2sany.xml.XMLExporter`)} [${e(`-Iortu`)}] [${e(`-help`)}] FILE`,``,e(`DESCRIPTION`),``,` Given a TLA+ file, parse that file with SANY then translate the module's semantic parse tree to XML, including all the modules depended on. The XML is printed to stdout and its output format is given by an XML Schema file (.xsd) found at https://proofs.tlapl.us/doc/web/sany.xsd.`,``,e(`OPTIONS`),``,...t.map(([t,n])=>`\t${e(t)}\n\t\t${n}`),``,e(`TIPS`),``,...n.flatMap(e=>[`\t${e}`,``]),``].join(`
45
- `)})(),Fa=e=>(process.stderr.write(`ERROR: ${e}\n${Pa}`),fa.argsParsingFailure),Ia=(e,n)=>{try{return process.stdout.write(Na(e,n)),t.W.success}catch(e){if(!(e instanceof t.A))throw e;let n=t.V(e),r=e instanceof t.x?e.unwound:``;return console.error(n===fa.uncaughtException?`${r}Exception in thread "main" ${e.message}`:`ERROR: ${e.message}`),n}},La=(e,t)=>{let n={flags:/* @__PURE__ */ new Set,includes:[],error:void 0},r={index:-1};for(let i=0;i<e.length-1;i++)if(t.has(e[i]))n.flags.add(e[i]),r.index=i;else if(e[i]===`-I`){if(i++,i>e.length-2)return{...n,error:`missing-include`};n.includes.push(e[i]),r.index=i}return r.index===e.length-2?n:{...n,error:`several-files`}},Ra=e=>{if(e.length===0)return Fa(`at least one .tla file must be given`);let r=La(e,/* @__PURE__ */ new Set([`-o`,`-t`,`-r`,`-u`]));if(r.error===`missing-include`)return Fa(`the -I flag must be followed by a directory and at least one .tla file`);if(r.error===`several-files`)return Fa(`Only one TLA file to check allowed!`);let o=e[e.length-1];if(o===`-help`)return process.stdout.write(Pa),t.W.success;let s=o.endsWith(`.tla`)?o:`${o}.tla`,c=[`.`,...r.includes],l=c.map(e=>(0,i.resolve)(e,s)).find(a.existsSync);l===void 0&&!n.L.has(s.slice(0,-4))&&h(process.cwd(),`./${s}`,r.includes);let u=Ni(l??s,m(c),{fileName:o,isXmlExport:!0});return process.stderr.write(u.text),u.isFailed||u.specification===void 0?(console.error(`ERROR: Failed to parse module.`),fa.specParsingFailure):Ia(u.specification,{version:`master`,isRestricted:r.flags.has(`-r`),isUncommented:r.flags.has(`-u`),isTerse:r.flags.has(`-t`)})},za=(e,t)=>(console.error(`Exception in thread "main" ${e}\n\tat tla2sany.xml.XMLExporter.main(XMLExporter.java:${t})`),fa.uncaughtException),Ba=(e,r)=>{if(e.length===0)return za(`java.lang.IllegalArgumentException: at least one .tla file must be given`,59);let o=La(e,/* @__PURE__ */ new Set([`-o`]));if(o.error===`missing-include`)return za(`java.lang.IllegalArgumentException: the -I flag must be followed by a directory and at least one .tla file`,71);if(o.error===`several-files`)return za(`java.lang.IllegalArgumentException: Only one TLA file to check allowed!`,83);let s=e[e.length-1],c=`${s.replace(/\.tla$/i,``)}.tla`,l=(o.includes.length===0?[`/`]:o.includes).map(b),u=[`.`,...l],d=e=>y(`${l[l.length-1]}${e}`,l,r),f=u.map(e=>(0,i.resolve)(e,c)).find(a.existsSync);if(f===void 0&&!n.I.has((0,i.basename)(c,`.tla`)))return d(c),t.W.success;let p=Ni(f??c,x(m(u),d),{fileName:s,isXmlExport:!0,version:`1.7.4`});return process.stderr.write(p.text),p.specification===void 0?za(`tla2sany.xml.XMLExportingException: spec ${(f&&Mi((0,a.readFileSync)(f,`utf8`),`1.7.4`))??`null`} is malformed - does not have a root module`,110):Ia(p.specification,{version:`1.7.4`,isRestricted:!1,isUncommented:!1,isTerse:!0})},Va=[`tlc2.TLC`,`tla2sany.xml.XMLExporter`],Ha=e=>{let t={libraries:[]};for(let n=0;n<e.length;n++){let r=e[n];if(r===`-cp`||r===`-classpath`||r===`--class-path`)n++,t.classPath=e[n];else if(r===`-jar`)return t.classPath=e[n+1],{mainClass:`tlc2.TLC`,args:e.slice(n+2),java:t};else if(r.startsWith(`-DTLA-Library=`))t.libraries.push(...r.slice(14).split(i.delimiter));else if(r.startsWith(`-Djava.io.tmpdir=`))t.temporaryDirectory=r.slice(17);else if(r.startsWith(`-Dtla-ts.tlc=`))t.tlcVersion=r.slice(13)===`1.7.4`?`1.7.4`:`master`;else if(!r.startsWith(`-D`)&&!r.startsWith(`-X`))return n>0||Va.includes(r)?{mainClass:r,args:e.slice(n+1),java:t}:void 0}},Ua=async e=>{if(e[0]===`tlapm`)return v(()=>De(e.slice(1)));let t=Ha(e);return t===void 0?ua(e,{libraries:[]}):(t.java.tlcVersion??=await u(S(t.java)),t.mainClass===`tlc2.TLC`?ua(t.args,t.java):t.mainClass===`tla2sany.xml.XMLExporter`?v(()=>t.java.tlcVersion===`1.7.4`?Ba(t.args,S(t.java)):Ra(t.args)):(console.error(`Error: tla-ts runs the Java classes ${Va.join(` and `)}, not ${t.mainClass}.`),1))},Wa=async()=>{process.exitCode=await Ua(process.argv.slice(2))};exports.runCli=Wa;
18
+ `),3}return Object.values(Se).find(e=>O.includes(e))??e.nt.success},Pe=(1n<<63n)-1n,Fe=1n<<16n,Ie=(e,t)=>{let n=e.map(e=>{let t=BigInt.asIntN(32,e);return t<0n?t:BigInt.asIntN(64,e)}),r=n.toSorted((e,t)=>e<t?-1:+(e>t)),i=r.slice(1).map((e,t)=>e-r[t]).filter(e=>e<=Pe),a=/* @__PURE__ */ new Map;e.forEach((e,r)=>{let i=e&t-1n,o=a.get(i),s=n[r];o?(o.min=s<o.min?s:o.min,o.max=s>o.max?s:o.max):a.set(i,{min:s,max:s})});let o=[...a.values()].map(e=>e.max-e.min).filter(e=>e>Pe).map(e=>e===Pe+1n?-e:(1n<<64n)-e);return[...i,...o].reduce((e,t)=>t<e?t:e,Pe)},Le=(n,r)=>{let i=t.qt(r)?`tlc2.tool.EvalException`:`java.lang.RuntimeException`;return n===``?e.$(i):`TLC threw an unexpected exception.\nThis was probably caused by an error in the spec or model.\nThe error occurred when TLC was ${n}.\nThe exception was a ${i}\n: `},Re=r=>{let i=r.onOutput,a=r.isTool??!1,o=r.isContinued??!1,s=t.p(r),c=s.config,l=s.environment,u=l.runtime,d=s.search;if(!d)throw new e.B(`tla-ts can't search a specification without variables`);let f=(e,t,n=t,r=!0)=>i({kind:`message`,code:e,isError:r,message:t,toolMessage:n}),p=d.properties.liveness;if(p.length>0){r.onProgress?.({kind:`liveness-initializing`,isSymmetric:d.isSymmetric,isConstrained:d.isConstrained});let i=e.ot(()=>t.Yt(()=>n.x(p,d.spec.temporals,l,{getFingerprint:()=>0,getSuccessors:()=>[]})))?.branches;i&&r.onProgress?.({kind:`liveness-prepared`,branches:i})}if((r.workers??1)!==1)return f(t.Lt.general,`Depth-First Iterative Deepening mode does not support multiple workers (https://github.com/tlaplus/tlaplus/issues/548). Please run TLC with a single worker.`),e.nt.error;if(p.length>0)return f(t.Lt.general,`Depth-First Iterative Deepening mode does not support checking liveness properties (https://github.com/tlaplus/tlaplus/issues/548). Please check liveness properties in Breadth-First-Search mode.`),e.nt.error;u.generatedStates=-1,u.distinctStates=-1,u.initialStates=-1,u.queueSize=-1,u.diameter=-1,u.isStarted=!0;let m=t.m(s.specification.assumptions,l,f);if(m!==void 0)return m;let h=s.getDescription().actions,g=/* @__PURE__ */ new Map,_={level:1,leveled:0,buckets:Fe},v=(e,t)=>{let n=g.get(e);return n===void 0?(BigInt(g.size)>=_.buckets*20n&&(_.buckets*=2n),g.set(e,_.level<<2|_.leveled|t),0):(g.set(e,n|t),n)},y=e=>g.get(e)??0,b=e=>(e&2)===_.leveled||(e&1)==1,x=e=>e===0||e>>>2===_.level,S=0,C={isDone:!1,errorCode:0,continuedCode:0,isKeepingCallStack:!1,errorEntry:void 0,stopCode:`searching`,isMoreLevel:!1},w=(e,t,n)=>!o&&C.isDone?!1:(C.errorEntry=e,C.errorCode=n,C.isDone=!0,C.isKeepingCallStack=t,C.stopCode=`error`,!0),T=e=>d.toRecord(e.map(e=>e??t.Et(`null`))),E=()=>{let e=`${S} states generated, ${g.size} distinct states found`;a&&f(t.Lt.depthFirstProgress,`Progress: ${e}.`,`Progress(-1) at ${t.Ht(/* @__PURE__ */ new Date)}: ${e}, -1 states left on queue.`,!1),f(t.Lt.depthFirstStats,`${e}.`,void 0,!1)},D=()=>i({kind:`success`,optimistic:t.o(g.size,S),actual:g.size===0&&S===0?0:t.i(Ie([...g.keys()],_.buckets))}),O=/* @__PURE__ */ new WeakMap,k;u.getLevel=e=>O.get(e)??0,u.getCurrentState=()=>k;let A=[],ee,te=()=>{let e=[],n=t=>(e.push(t),!1),r=d.spec.init;r&&t.$(r,l,n,d.spec.scope,n),S=e.length;for(let n of e){if(!n.every(e=>e!==void 0))return f(t.Lt.initialStateIncomplete,`State is not completely specified by the initial predicate:\n${t.Ot(T(n))}`),t.Lt.initialStateIncomplete;ee=n,O.set(n,1);let e=d.satisfiesConstraints(n),r=e?u.getFingerprint(n):0n,i=e?v(r,0):0;if(e&&i===0&&A.push({state:n,fingerprint:r}),i!==0)continue;let s=()=>c.alias===void 0?d.toRecord(n):d.evaluateAlias(c.alias,n,n,a),l=o?d.getViolatedInvariants(n):[d.findViolatedInvariant(n)].filter(e=>e!==void 0);for(let e of l){if(f(t.Lt.invariantViolatedInitial,`Invariant ${e.name} is violated by the initial state:\n${t.Ot(s())}`),!o)return t.Lt.invariantViolatedInitial;C.continuedCode=t.Lt.invariantViolatedInitial}let p=d.findFailedInitialPredicate(n);if(p)return f(t.Lt.propertyViolatedInitial,`Property ${p.name} is violated by the initial state:\n${t.Ot(s())}`),t.Lt.propertyViolatedInitial}return 0},ne=(n,r)=>{let i=[];try{return t.et(n.expression,r,l,n=>{if(i.length===t.Nt())throw new e.I;return i.push(n.state),!1},n.scope),{successors:i,incomplete:void 0}}catch(t){if(!(t instanceof e.C))throw t;return{successors:i,incomplete:t}}},re=(n,r,i)=>{try{let e=i?d.findViolatedInvariant(r,n):void 0;if(e)return{code:t.Lt.invariantViolatedBehavior,text:`Invariant ${e.name} is violated.`,isViolated:!0};let a=d.findViolatedActionProperty(n,r);return a&&{code:t.Lt.actionPropertyViolatedBehavior,text:`Action property ${a.name} is violated.`,isViolated:!0}}catch(n){if(!(n instanceof e.b)||!t.Jt(n))throw n;return{code:t.Gt(n,!0).code,text:n.message.slice(0,n.message.indexOf(`
19
+ `)),isViolated:!1}}},j=[],ie=[],ae=(e,n,r,a,o)=>{f(e,n,r),f(t.Lt.behaviorUpToThisPoint,`The behavior up to this point is:`);let s=[...j.slice(0,a+1).map(e=>e.state),...o?[o]:[]];i({kind:`behavior`,states:s.map(T),isInvariant:e===t.Lt.invariantViolatedBehavior})},oe=(n,i,a)=>{let s=j[n],l=s.state,f=!0,p=!0,m=!0,g,_=(e,t,r)=>(w(s,r,e)&&ae(e,t,t,n,g),m);k=l;try{for(let i of h){let s=ne(i,l),c=s.incomplete,y=s.successors.length+ +!!c;S+=y,f&&=y===0;for(let r of s.successors){g=r,O.set(r,n+2);let i=d.satisfiesConstraints(r,l)&&d.satisfiesActionConstraints(l,r),s=i?u.getFingerprint(r):0n,c=i?v(s,0):0;if(i&&(p&&=(c&1)==1,m&&=!x(c),!b(c))){if(a.length===t.Nt())throw new e.I;a.push({state:r,fingerprint:s})}let f=re(l,r,c===0);if(f?.isViolated&&o)ae(f.code,f.text,f.text,n,r),C.continuedCode=f.code;else if(f)return _(f.code,f.text,!f.isViolated)}if(c)return g=c.state,_(t.Lt.incompleteSuccessor,t.f(c.variables,i.name,h.length,r.version),!1);g=void 0}return f&&c.checkDeadlock?_(t.Lt.deadlockReached,`Deadlock reached.`,!1):((p||i&&m)&&v(s.fingerprint,1),m)}catch(r){let i=e.tt(r)?new e.P:r;if(!(i instanceof e.b))throw r;let a=i instanceof e.P;if(w(s,!a,a?t.Lt.stackOverflow:t.Lt.general)){let e=Le(`computing the set of next states`,i);ae(a?t.Lt.stackOverflow:t.Lt.general,a?i.message:`${e}${i.message}`,a?i.message:`${e}${t.Vt(i.message,!0)}`,n,g)}throw i}},M=(e,t)=>{for(;e.length>0;){let n=y(e[0].fingerprint);if(!b(n)&&t<n>>>2)return!0;e[0]=e[e.length-1],e.pop()}return!1},se=n=>{let r=[...A];C.stopCode=`searching`,C.isMoreLevel=!1;let i=0;try{for(;C.stopCode===`searching`;){for(;r.length>0&&b(y(r[0].fingerprint));)r[0]=r[r.length-1],r.pop();if(r.length===0){C.stopCode=`done`;return}j[0]=r[0],ie[0]=[],i=0;let e=n<2,t=oe(0,e,ie[0]);for(C.isMoreLevel||=!t,i=1;!e;){if(!M(ie[i-1],i)){let e=j[i-1];if(g.set(e.fingerprint,y(e.fingerprint)&-3|_.leveled),i===1)break;i--;continue}j[i]=ie[i-1][0],ie[i]=[];let e=i>=n-1,t=oe(i,e,ie[i]);if(C.isMoreLevel||=!t,i++,e)break}}}catch(n){if(!(n instanceof e.b))throw n;if(C.stopCode=`error`,w(j[i],!0,t.Lt.general)){let e=Le(``,n);f(t.Lt.general,`${e}${n.message}`,`${e}${t.Vt(n.message,!0)}`)}}},N=n=>{let r=t.J(l);try{if(h.every(e=>{let i=[];return t.ot([e],n.state,r,e=>i.push(e)),S+=i.length,i.every(e=>e.every(e=>e!==void 0)&&d.checkReplayedSuccessor(n.state,e,r,()=>v(u.getFingerprint(e),0)===0))}))return}catch(t){if(!(t instanceof e.b)&&!e.tt(t))throw t}i({kind:`nested-expressions`,callStack:r.callStack?.expressions??[]})},ce=t=>{E();let n=[t,C.errorCode,C.continuedCode].find(e=>e!==0);return n===void 0?e.nt.success:e.it(n)},P=()=>{try{return{code:te(),error:void 0}}catch(t){let n=e.tt(t)?new e.P:t;if(!(n instanceof e.b))throw t;return{code:0,error:n}}},le=P();if(le.error){let n=le.error,i=t.Jt(n)&&n.cause instanceof e.b?n.cause:n,a=ee,o=a?``:Le(`computing initial states`,i),s=a?`\nWhile working on the initial state:\n${t.Ot(T(a))}`:``;f(a?t.Lt.initialState:t.Lt.general,`${o}${i.message}${s}`,`${o}${t.Vt(i.message,!0)}${s}`),S=0,A.length=0;let c=P().error!==void 0;return c&&f(t.Lt.nestedExpression,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\ntlc2.tool.impl.FastTool@${(Number(BigInt.asUintN(28,t.Ct([r.source])))|268435456).toString(16)}`),E(),c?e.nt.specEvaluationFailure:e.Q(i)}if(le.code!==0)return e.it(le.code);if(f(t.Lt.depthFirstInitGenerated,`Finished computing initial states: ${S} states generated, with ${A.length} of them distinct.`,void 0,!1),h.length===0)return D(),ce(0);let ue=!1,de=t.Lt.general;for(let e=2;e<=r.maxDepth;e++){if(ue){let e=C.errorEntry;!e&&C.continuedCode===0&&(de=0,D()),e&&C.isKeepingCallStack&&N(e);break}if(f(t.Lt.depthFirstLevel,`Starting level ${e}: ${S} states generated, ${g.size} distinct states found.`,void 0,!1),_.level++,_.leveled=2-_.leveled,se(e),C.isDone=!1,de=C.isKeepingCallStack?0:C.errorCode,de!==0)return ce(de);ue=C.stopCode===`error`||!C.isMoreLevel}return ce(de)},ze=/* @__PURE__ */ new Set([t.Lt.invariantEvaluationFailed,t.Lt.actionPropertyEvaluationFailed,t.Lt.incompleteSuccessor]),Be=2147483647,Ve=(e,n)=>e.every((e,r)=>t.Ft(e,n[r])),He=e=>{let t=[];for(let n=e;n;n=n.predecessor){let e=n.predecessor;e&&Ve(n.state,e.state)||t.unshift(n)}return t.forEach((e,n)=>{e.predecessor=t[n-1],e.level=n+1}),t},Ue=(e,t,n)=>{let r=e.map(e=>t(e.state)),i=/* @__PURE__ */ new Map,a=[],o=[];r.forEach((t,n)=>{if(i.has(t)||(i.set(t,a.length),a.push(e[n].state),o.push([])),n===0)return;let s=i.get(r[n-1])??0,c=i.get(t)??0;s!==c&&!o[s].includes(c)&&o[s].push(c)});let s=n(o,a);if(!s)return;s.addInitialState(0,a[0]),a.forEach((e,t)=>s.addState(t,e,o[t].map(e=>({index:e,state:a[e]}))));let c=s.findViolation();if(!c)return;let l=e=>e.filter((t,n)=>n===0||t!==e[n-1]).length,u=[...c.prefix,...c.cycle],d=l(u),f=l(u.slice(0,c.prefix.length+1));return{length:d,loopStart:r[d-1]===t(a[u[c.prefix.length]])?d-1:f-1,properties:s.getViolatedProperties(e.slice(0,d).map(e=>e.state),f-1)}},We=(e,t,n,r,i)=>{let a=t.map(()=>/* @__PURE__ */ new Map),o=t=>e===`rlaction`?t.action:r(t.state),s=e=>i(e.predecessor?.state,e.state,-10);return{getNextActionIndex:r=>{if(e===`random`)return Math.floor(n.nextDouble()*t.length);let i=o(r);a.forEach(e=>{e.has(i)||e.set(i,0)});let s=a.map(e=>Math.exp(e.get(i)??0)),c=s.reduce((e,t)=>e+t,0),l=s.map((e,t)=>({index:t,weight:e/c})).sort((e,t)=>t.weight-e.weight),u=n.nextDouble(),d=0;return(l.find((e,t)=>(d=t===0?e.weight:d+e.weight,d>=u))??l[l.length-1]).index},markDisabled:(t,n)=>{e!==`random`&&(e===`rlaction`&&s(n),a[t].set(o(n),-Number.MAX_VALUE))},learnTrace:e=>{for(let n=e;n.predecessor;n=n.predecessor){let e=o(n),r=a.reduce((t,n)=>Math.max(t,n.get(e)??-Number.MAX_VALUE),-Number.MAX_VALUE),i=a[t.indexOf(n.action)],c=o(n.predecessor);i.set(c,.7*(i.get(c)??0)+.3*(s(n)+.7*r))}}}},Ge=r=>{let i=r.onSimulation,a=t.p(r),o=a.config,s=a.specification,c=a.environment,l=c.runtime,u=a.search,d=r.seed??0n,f=r.traceDepth===-1?Be:r.traceDepth,p=r.traceCount??(1n<<63n)-1n,m=t.mt(d);for(let e=0n;e<r.aril;e++)m.nextDouble();let h=t.mt(m.nextLong()),g={generatedStates:0,traces:0,levelMean:0,levelM2:0,seed:d,aril:r.aril},_=(e,t,n=t,r=!0)=>i({kind:`message`,code:e,isError:r,message:t,toolMessage:n}),v=()=>i({kind:`summary`,statistics:{...g}}),y=/* @__PURE__ */ new WeakMap,b=a.getDescription(),x=b.inits,S=b.actions,C=0,w=0;if(l.getLevel=e=>y.get(e)?.level??0,l.getBehavior=e=>{let t=y.get(e);return t?He(t).map(e=>e.state):[e]},l.getSimulationValue=(n,i)=>{let a=i&&y.get(i);switch(n){case`diameter`:return w===0?0:C+1;case`generated`:case`distinct`:case`queue`:throw new e.k(`TLCGet(${n}) was undefined.`);case`action`:return a&&t.D(a.action);case`config`:return t.Dt([[`mode`,r.isGenerating?`generate`:`simulate`],[`depth`,f===Be?-1:f],[`traces`,Number(BigInt.asIntN(32,p))],[`deadlock`,o.checkDeadlock],[`seed`,String(d)],[`aril`,String(r.aril)],[`worker`,1],[`install`,`unknown`],[`sched`,r.scheduler]]);case`stats`:{let e=/* @__PURE__ */ new Map;for(let t=a;t&&t.level>1;t=t.predecessor)e.set(t.action.name,(e.get(t.action.name)??0)+1);return t.Dt([[`traces`,g.traces],[`duration`,Math.floor((Date.now()-l.startedAt)/1e3)],[`generated`,g.generatedStates],[`behavior`,t.Dt([[`actions`,t.Dt([...e])],[`id`,w]])],[`worker`,0],[`distinct`,-1],[`distinctvalues`,-1],[`retries`,-1],[`actions`,t.Dt([])],[`levelmean`,g.levelMean],[`levelvariance`,Math.round(g.levelM2/(g.traces+1))]])}}},l.isStarted=!0,!u)throw new e.B(`tla-ts can't simulate a specification without variables`);let T=e=>{let n=u.findPostconditionViolation(e);if(n)return n.counts!==void 0&&(r.onPrint??console.log)(n.counts),_(n.code,n.message,t.Bt(n.code,n.message,!0)),n},E=u.properties.liveness,D=(r,i)=>e.ot(()=>t.Yt(()=>n.x(E,u.spec.temporals,c,{getFingerprint:e=>Number(BigInt.asIntN(32,l.getFingerprint(e.state))),getSuccessors:e=>r[e].map(e=>({index:e,state:i[e]}))}))),O=D([],[])?.branches;O&&r.onProgress?.({kind:`liveness-prepared`,branches:O});let k=t.m(s.assumptions,c,_);if(k!==void 0)return k;let A=x[x.length-1],ee=(e,t,n)=>{let r={state:e,action:t,predecessor:n,level:(n?.level??0)+1};return y.set(e,r),r},te=e=>u.toRecord(e.map(e=>e??t.Et(`null`))),ne=e=>e.map((n,i)=>({action:n.action.name,label:t.C(n.action,r.version,n.level===1),state:o.alias===void 0||!n.state.every(e=>e!==void 0)?te(n.state):u.evaluateAlias(o.alias,n.state,(e[i+1]??n).state,r.isTool??!1)})),re=e=>t.pt(e.map(e=>u.toRecord(e.state)),e.slice(1).map(e=>t.D(e.action)),void 0),j=[],ie=e=>e.every(e=>e!==void 0),ae=[],oe=(n,r)=>{let i=Ke(n);if(!r)return _(t.Lt.general,`${qe(i)}${i.message}`,`${qe(i)}${t.Vt(i.message,!0)}`),v(),e.nt.error;let a=t.Gt(i,!1),o=`While working on the initial state:\n${t.Ot(te(r))}`;return _(t.Lt.initialState,`${a.message}\n${o}`,`${a.toolMessage}\n${o}`),v(),e.it(t.Lt.initialState)},M=u.spec.init,se=n=>{if(ae.length===t.Nt())throw new e.I;return ae.push(n),!1};try{M&&t.$(M,c,se,u.spec.scope,se)}catch(e){return oe(e,void 0)}g.generatedStates=ae.length,_(t.Lt.computingInitProgress,`Computed ${ae.length} initial states...`,void 0,!1);for(let n of ae){if(!ie(n))return _(t.Lt.initialStateIncomplete,`State is not completely specified by the initial predicate:\n${t.Ot(te(n))}`),e.nt.error;try{let r=ee(n,A,void 0),i=u.findViolatedInvariant(n);if(i){let n=ne([r])[0].state;return _(t.Lt.invariantViolatedInitial,`Invariant ${i.name} is violated by the initial state:\n${t.Ot(n)}`),l.counterExample=re([r]),T(!0),e.nt.safetyViolation}let a=u.findFailedInitialPredicate(n);if(a){let n=ne([r])[0].state;return _(t.Lt.propertyViolatedInitial,`Property ${a.name} is violated by the initial state:\n${t.Ot(n)}`),l.counterExample=re([r]),T(!0),e.nt.livenessViolation}u.satisfiesConstraints(n)&&(u.trackStatePossible(n),j.push(r))}catch(e){return oe(e,n)}}if(ae.length===0)return _(t.Lt.noInitialStates,`There is no state satisfying the initial state predicate.`),e.nt.error;if(j.length===0)return _(t.Lt.noInitialStatesInModel,`There is no state satisfying the initial state predicate and the state-constraint(s).`),e.nt.error;_(t.Lt.initGenerated1,`Finished computing initial states: ${j.length} distinct state generated at ${t.Ht(/* @__PURE__ */ new Date)}.`,void 0,!1);let N=(e,t,n)=>({code:e,message:t,toolMessage:t,node:n,isException:!1,isSummarized:!0}),ce=(n,i)=>{let a=[],o;l.deferred=void 0;try{t.et(i.expression,n.state,c,r=>{let s=ee(r.state,i,n);s.deferred=l.deferred,l.deferred=void 0,g.generatedStates++;try{let e=u.findViolatedInvariant(s.state,n.state);if(e)return o=N(t.Lt.invariantViolatedBehavior,`Invariant ${e.name} is violated.`,s),!0;let r=u.findViolatedActionProperty(n.state,s.state);if(r)return o=N(t.Lt.actionPropertyViolatedBehavior,`Action property ${r.name} is violated.`,s),!0}catch(n){if(!(n instanceof e.b)||!t.Jt(n))throw n;let r=t.Gt(n,!0);return o={...N(r.code,r.message,s),toolMessage:r.toolMessage},!0}if(!u.satisfiesConstraints(s.state,n.state)||(u.trackStatePossible(s.state),!u.satisfiesActionConstraints(n.state,s.state)))return!1;if(u.trackActionPossible(n.state,s.state),a.length===t.Nt())throw new e.I;return a.push(s),!1},i.scope,r.isGenerating?h:void 0)}catch(o){if(!(o instanceof e.C))throw o;let s=ee(o.state.map(e=>e??t.Et(`null`)),i,n),c=t.f(o.variables,i.name,S.length,r.version);return{successors:a,error:N(t.Lt.incompleteSuccessor,c,s)}}return{successors:a,error:o}},P=j[0],le=We(r.scheduler,S,h,l.getFingerprint,u.getReward),ue=e=>{if(E.length===0)return;let n=He(e),i=Ue(n,l.getFingerprint,D);if(!i)return;let a=n[i.length];return{name:i.properties[0],properties:i.properties,trace:ne(n.slice(0,i.length)),loopStart:i.loopStart,loopLabel:a&&t.C(a.action,r.version,a.level===1)}},de=()=>{P=j[Math.floor(h.nextDouble()*j.length)];for(let e=0;e<f;e++){if(l.isStopped)return`stopped`;let e=le.getNextActionIndex(P),n=t.ht(h),r=[];for(let t=0;t<S.length;t++){let t=ce(P,S[e]);if(t.error)return t.error;if(r=t.successors,r.length>0)break;le.markDisabled(e,P),e=(e+n)%S.length}if(r.length===0){if(o.checkDeadlock)return N(t.Lt.deadlockReached,`Deadlock reached.`,P);break}P=r[Math.floor(h.nextDouble()*r.length)],P.deferred?.(P.state)}if(l.isStopped)return`stopped`;let e=ue(P);if(e)return{...N(t.Lt.temporalPropertyViolated,``,P),isException:!0,violation:e};let n=Math.min(f,P.level),i=n-g.levelMean;g.levelMean+=Math.trunc(i/Math.max(g.traces,1)),g.levelM2+=i*(n-g.levelMean),r.scheduler===`rl`&&le.learnTrace(P)},fe=(n,r)=>{let i=Ke(n),a=t.qt(i)?void 0:t.Wt(i.message);if(a)return{code:a.code,message:i.message,toolMessage:t.Bt(a.code,i.message,!0),node:r,isException:!0,isSummarized:!1};let o=qe(i);return{code:t.Lt.general,message:`${o}${i.message}`,toolMessage:`${o}${t.Vt(i.message,!0)}`,node:r,isException:!0,isSummarized:o!==e.G}},pe=t.mt(d);l.getRandom=()=>pe;let me=[],he=r.isContinued??!1;for(;;){g.traces++,w=g.traces;let e=(()=>{try{return de()}catch(e){return fe(e,P)}})();if(e===`stopped`||(C++,e&&me.push(e),e?.isException)||BigInt(C)>=p)break;if(e!==void 0&&(!he||ze.has(e.code))&&r.traceCount===void 0){g.traces++;break}}let ge=me.findIndex(e=>e.isException||!he||ze.has(e.code)),_e=ge===-1?me:me.slice(0,ge+1);_e.forEach(e=>{e.violation?(r.onProgress?.({kind:`violation`,status:`liveness-violation`,violation:e.violation}),v()):(_(e.code,e.message,e.toolMessage),i({kind:`behavior`,trace:ne(He(e.node)),isLastStateOnly:f===Be}),e.isSummarized&&v())});let ve=_e[_e.length-1],ye=ve?e.it(ve.code):e.nt.success;ve&&(l.counterExample=re(He(ve.node)));let be=T(ve!==void 0),xe=be?e.it(be.code):e.nt.success,Se=Math.max(ye,xe);return i({kind:`progress`,statistics:{...g}}),Se===e.nt.success&&v(),Se},Ke=t=>{if(e.tt(t))return new e.P;if(!(t instanceof e.b))throw t;return t},qe=n=>t.qt(n)?e.W:e.G,Je={builtin:1,number:2,string:3,ident:4,added:5},Ye=()=>({labelFlag:!1,labelRoot:`Lbl_`,fairnessOption:``,checkTermination:!1,specOption:!1,myspecOption:!1,inputVersionNumber:1903}),Xe=e=>{let t=0,n=0,r=!1;for(let i of e)if(i===`.`)r=!0;else if(i<`0`||i>`9`||(t=10*t+Number(i),r&&(n+=1),n>3))return-1;return t*10**Math.max(0,3-n)},Ze=[`unfair`,`wf`,`sf`],F=()=>({col:0,line:0,macroCol:0,macroLine:-1,lbl:``}),Qe=e=>e.macroLine<0?`line ${e.line}, column ${e.col}`:`line ${e.line}, column ${e.col} of macro called at line ${e.macroLine}, column ${e.macroCol}`,$e=t=>{if(t.kind!==`LabeledStmt`)throw new e.c(`ClassCastException: ${t.kind}`);return t},et=(t,n)=>{if(n<0||n>=t.length)throw new e.c(`ArrayIndexOutOfBoundsException: ${n}`);return t[n]},tt=(e,t,n)=>({string:e,column:t,type:n}),nt=e=>e.type===Je.string?e.string.length+2:e.string.length,rt=(e=[])=>({tokens:e,anchorTokens:void 0,anchorTokCol:void 0}),it=e=>{for(;e.tokens.length>0&&e.tokens[0].length===0;)e.tokens.shift();for(;e.tokens.length>0&&e.tokens[e.tokens.length-1].length===0;)e.tokens.pop();let t=Math.min(999999,...e.tokens.filter(e=>e.length>0).map(e=>e[0].column));e.tokens.forEach(e=>e.forEach(e=>{e.column-=t}));let n=[],r=[];e.tokens.forEach((t,i)=>{if(r.push(0),n.push(void 0),t.length===0)return;let a=t[0].column,o=e.tokens.slice(0,i).findLast(e=>e.length>0&&e[0].column<=a);if(o===void 0)return;let s=o.findIndex((e,t)=>t>0&&e.column>a),c=o[(s===-1?o.length:s)-1];n[i]=c,r[i]=c.column}),e.anchorTokens=n,e.anchorTokCol=r},at=e=>{let t=rt(e);return it(t),t},ot=t=>{let n=t.anchorTokens,r=t.anchorTokCol;if(n===void 0||r===void 0)throw new e.c(`NullPointerException: TLAExpr.renormalize`);t.tokens.forEach((t,i)=>{let a=n[i];if(a===void 0)return;let o=a.column-r[i];if(r[i]=a.column,o<0)throw new e.s(`TLAExpr.renormalize() found anchor has moved to left.`);t.forEach(e=>{e.column+=o})})},st=e=>at(e.tokens.map(e=>e.map(e=>({...e})))),ct=(e,t,n)=>{let r=t.tokens.length;e.tokens.splice(0,0,...t.tokens.slice(0,r-1));let i=t.tokens[r-1],a=e.tokens[r-1],o=i[i.length-1],s=o.column+nt(o)+n;a.forEach(e=>{e.column+=s}),a.splice(0,0,...i);let c=[...t.anchorTokens??[]],l=[...t.anchorTokCol??[]];for(let t=r;t<e.tokens.length;t++)c.push(e.anchorTokens?.[t-r+1]),l.push(e.anchorTokCol?.[t-r+1]??0);e.anchorTokens=c,e.anchorTokCol=l,ot(e)},lt=e=>e.tokens.length===1&&e.tokens[0].length===1,ut=(e,t)=>et(et(e.tokens,t.line),t.item),dt=(t,n,r)=>{if(t.tokens.length<=n.line)throw new e.o(`TLAExpr.StepCoord called with line too big`);if(t.tokens[n.line].length<=n.item)throw new e.o(`TLAExpr.StepCoord called with col too big`);let i={line:n.line,item:n.item};for(let e=0;e<r;e++)if(i.item+=1,t.tokens[i.line].length===i.item){for(i.item=0,i.line+=1;i.line<t.tokens.length&&t.tokens[i.line].length===0;)i.line+=1;if(i.line===t.tokens.length)return}return i},ft=(e,t,n)=>{for(let r=e.tokens.length===0?void 0:{...n};r!==void 0;){let n=ut(e,r),i=n.type===Je.string;if(!i&&n.string===t)return r;let a=!i&&(n.string===`[`||n.string===`,`)?dt(e,r,2):void 0,o=a===void 0?void 0:ut(e,a),s=o!==void 0&&o.type!==Je.string&&[`:`,`|->`,`↦`].includes(o.string),c=i?1:n.string===`.`?2:s?3:1;r=dt(e,r,c)}},pt=(e,t,n,r)=>{let i=ut(e,n);if(lt(e)){let n=st(t);e.tokens=n.tokens,e.anchorTokens=n.anchorTokens,e.anchorTokCol=n.anchorTokCol;return}let a=e.tokens[n.line],o=n.item+1<a.length?a[n.item+1].column-(i.column+nt(i)):0,s=a.splice(n.item+1),c=n.line,l=+!!r+i.column,u=!r,d=()=>e.tokens[c];if(lt(t)){let e=t.tokens[0][0];i.string=e.string,i.type=e.type}else{r&&(i.string=`(`,i.type=Je.builtin);let n=st(t);if(n.tokens.forEach((t,r)=>{if(t.forEach(e=>{e.column+=l,u?(i.string=e.string,i.type=e.type,u=!1):d().push(e)}),r+1>=n.tokens.length)return;l=0,c+=1;let a=c;e.tokens.splice(a,0,[]);let o=e.anchorTokens??[],s=e.anchorTokCol??[];e.anchorTokens=e.tokens.map((e,t)=>t<a?o[t]:t===a?n.anchorTokens?.[r+1]:o[t-1]),e.anchorTokCol=e.tokens.map((e,t)=>t<a?s[t]:t===a?n.anchorTokCol?.[r+1]??0:s[t-1])}),r){let e=d()[d().length-1];d().push(tt(`)`,e.column+nt(e),Je.builtin))}}let f=d(),p={line:c,item:f.length-1};if(s.length>0){let e=f[f.length-1],t=e.column+nt(e)+o-s[0].column;s.forEach(e=>{e.column+=t,f.push(e)})}return ot(e),dt(e,p,1)},mt=(t,n,r,i=!0)=>{let a=r.map(e=>ft(t,e,{line:0,item:0}));for(;;){let o=a.reduce((e,t,n)=>t!==void 0&&(e===void 0||t.line<e.position.line||t.line===e.position.line&&t.item<e.position.item)?{index:n,position:t}:e,void 0);if(o===void 0)return;let s=dt(t,o.position,1),c=pt(t,n[o.index],o.position,i);a[o.index]=c===void 0?void 0:ft(t,r[o.index],c),a.forEach((t,n)=>{if(n!==o.index&&t!==void 0&&c!==void 0){if(s===void 0)throw new e.c(`NullPointerException: TLAExpr.substituteForAll`);t.line===o.position.line&&(t.item+=c.item-s.item),t.line+=c.line-s.line}})}},ht=(e,t,n)=>{let r=st(e);return mt(r,t,n),r},gt=(e,t,n)=>e.map(e=>ht(e,t,n)),_t=(e,t)=>{let n=e=>t===`1.7.4`?``:`(col${e.column}) `,r=e.tokens.map(e=>e.map(e=>e.type===Je.string?`"\\"", "${e.string}", "\\""`:e.string===`\\/`?`"${n(e)}\\\\/"`:e.string.startsWith(`\\`)?`"\\${e.string}"`:e.string===`/\\`?`"${n(e)}/\\\\"`:`"${e.string}"`)),i=r.findIndex(e=>e.length>0);return`<< ${r.map((e,t)=>{let n=i!==-1&&t>i;return e.map((e,t)=>n||t>0?`, ${e}`:e).join(``)}).join(`
20
+ `)} >>`},vt=(e,t,n)=>{let r=e=>_t(e,n),i=[0],a=0,o=e=>(i[a+1]=i[a]+e.length,a+=1,e),s=()=>(--a,``),c=()=>`\n${` `.repeat(i[a])}`,l=t<1500,u=e=>`${o(`<<`)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${`kind`in e?m(e):r(e)}`).join(``)}>>${s()}`,d=e=>`${o(`<<`)}${e.map(e=>`"${e}"`).join(`, `)}>>${s()}`,f=e=>`${o(`<< `)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${u(e)}`).join(``)} >>${s()}`,p=e=>e?`"="`:`"\\\\in"`,m=e=>{switch(e.kind){case`Uniprocess`:return`${o(``)}[type |-> "uniprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Multiprocess`:return`${o(``)}[type |-> "multiprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` procs |-> `)}${u(e.procs)}]${s()}${s()}`;case`Procedure`:return l?`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}", ${c()}minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Process`:return l?`${o(``)}[name |-> "${e.name}", ${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}",${c()} fairness |-> "${Ze[e.fairness]}", minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`VarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> ${p(e.isEq)}, val |-> ${r(e.val)}]${s()}`;case`PVarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> "=", val |-> ${r(e.val)}]${s()}`;case`LabeledStmt`:return`${o(``)}[label |-> "${e.label}",${c()}${o(` stmts |-> `)}${u(e.stmts)}]${s()}${s()}`;case`While`:return`${o(``)}[type |-> "while", ${c()} test |-> ${r(e.test)},${c()}${o(` labDo |-> `)}${u(e.labDo)},${s()}${c()}${o(` unlabDo |-> `)}${u(e.unlabDo)}]${s()}${s()}`;case`Assign`:return`${o(``)}[type |-> "assignment",${c()}${o(` ass |-> `)}${u(e.ass)}]${s()}${s()}`;case`SingleAssign`:return`${o(``)}[lhs |-> ${m(e.lhs)},${c()} rhs |-> ${r(e.rhs)}]${s()}`;case`Lhs`:return`[var |-> "${e.var}", sub |-> ${r(e.sub)}]`;case`If`:return`${o(``)}[type |-> "if", ${c()} test |-> ${r(e.test)},${c()}${o(` then |-> `)}${u(e.Then)},${s()}${c()}${o(` else |-> `)}${u(e.Else)}]${s()}${s()}`;case`Either`:return`${o(``)}[type |-> "either", ${c()}${o(` ors |-> `)}${f(e.ors)}]${s()}${s()}`;case`With`:return`${o(``)}[type |-> "with", ${c()} var |-> "${e.var}",${c()} eqOrIn |-> ${p(e.isEq)},${c()} exp |-> ${r(e.exp)},${c()}${o(` do |-> `)}${u(e.Do)}]${s()}${s()}`;case`When`:return`${o(``)}[type |-> "when", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`PrintS`:return`${o(``)}[type |-> "print", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Assert`:return`${o(``)}[type |-> "assert", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Skip`:return`[type |-> "skip"]`;case`LabelIf`:return`${o(``)}[type |-> "labelIf",${c()} test |-> ${r(e.test)},${c()}${o(` unlabThen |-> `)}${u(e.unlabThen)},${s()}${c()}${o(` labThen |-> `)}${u(e.labThen)},${s()}${c()}${o(` unlabElse |-> `)}${u(e.unlabElse)},${s()}${c()}${o(` labElse |-> `)}${u(e.labElse)}]${s()}${c()}${s()}`;case`LabelEither`:return`${o(``)}[type |-> "labelEither",${c()}${o(` clauses |-> `)}${u(e.clauses)}]${s()}${c()}${s()}`;case`Clause`:return`${o(``)}${o(`[unlabOr |-> `)}${u(e.unlabOr)},${s()}${c()}${o(` labOr |-> `)}${u(e.labOr)}]${s()}${c()}${s()}`;case`Call`:return`${o(``)}[type |-> "call",${c()} returnTo |-> "${e.returnTo}",${c()} to |-> "${e.to}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`;case`Return`:return`[type |-> "return", from |-> "${e.from??`null`}"]`;case`CallReturn`:return`${o(``)}[type |-> "callReturn",${c()} from |-> "${e.from??`null`}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`CallGoto`:return`${o(``)}[type |-> "callGoto",${c()} after |-> "${e.after}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`Goto`:return`[type |-> "goto", to |-> "${e.to}"]`;case`Macro`:return`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${o(`<<`)}${e.params.join(`, ${c()}`)}>>${s()},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`MacroCall`:return`${o(``)}[type |-> "macrocall",${c()} name |-> "${e.name}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`}};return m(e)},yt=(e,t,n)=>({lines:e,currentLine:t<e.length?Array.from(e[t]):void 0,line:t,column:n,vcolumn:t<e.length?Array.from(e[t].slice(0,n)).length:0}),bt=e=>{if(e.currentLine===void 0)return` `;if(e.currentLine.length===e.column)return e.line+=1,e.column=0,e.vcolumn=0,e.currentLine=e.line>=e.lines.length?void 0:Array.from(e.lines[e.line]),`
21
+ `;let t=e.currentLine[e.column];return e.column+=1,e.vcolumn+=1,t},xt=t=>{if(t.column>0)--t.column,--t.vcolumn;else{if(t.line===0)throw new e.o(`PcalCharReader.backspace trying to move past beginning of reader`);--t.line,t.currentLine=Array.from(t.lines[t.line]),t.column=Math.max(t.currentLine.length-1,0),t.vcolumn=t.column}},St=e=>{for(;;){let t=bt(e);if(t===` `)return` `;if(t!==` `&&t!==`
22
+ `)break}return xt(e),`${(e.currentLine??[]).slice(e.column).join(``)}\n`},Ct=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`⟨`]),wt=/* @__PURE__ */ new Set([`>>_`,`⟩_`,`]_`,`)`,`}`,`]`,`>>`,`⟩`]),Tt=/* @__PURE__ */ new Set([...Ct,...wt,...`_ ASSUME ASSUMPTION AXIOM BOOLEAN CASE CONSTANT CONSTANTS EXCEPT EXTENDS FALSE IF INSTANCE LOCAL MODULE OTHER STRING THEOREM TRUE VARIABLE VARIABLES WITH WF_ SF_`.split(` `),...`\\A ∀ \\forall \\E ∃ \\exists \\AA \\EE ~ ¬ \\lnot \\neg <> ◇ CHOOSE ENABLED UNCHANGED SUBSET UNION DOMAIN ' ^+ ⁺ ^* ^#`.split(` `),...`=> ⇒ \\cdot ⋅ <=> ⇔ \\equiv ≡ ~> ↝ -+-> ⇸ \\subseteq ⊆ \\subset ⊂ \\supset ⊃ \\supseteq ⊇ \\ll ≪ \\gg ≫ \\ \\cap \\intersect ∩ \\cup \\union ∪ /\\ ∧ \\/ ∨ \\land \\lor \\X × - + * / ^ | || ‖ & && ++ -- ** // ^^ |- ⊢ |= ⊨ -| ⊣ =| ⫤ <: :> := ≔ ::= ⩴`.split(` `),...`(+) ⊕ (-) ⊖ \\oplus \\ominus (.) ⊙ \\odot (/) ⊘ \\oslash (\\X) ⊗ \\otimes \\uplus ⊎ \\sqcap ⊓ \\sqcup ⊔ \\div ÷ \\star ⋆ \\o ∘ \\circ \\bigcirc ◯ \\bullet ●`.split(` `),...`\\in ∈ \\notin ∉ = # /= ≠ < > =< <= ≤ >= ≥ \\prec ≺ \\succ ≻ \\preceq ⪯ \\succeq ⪰ \\sim ∼ \\simeq ≃ \\approx ≈ \\doteq ≐ \\asymp ≍ \\sqsubset ⊏ \\sqsupset ⊐ \\sqsubseteq ⊑ \\sqsupseteq ⊒ \\propto ∝`.split(` `),...`: -> → |-> ↦ <- ← == ≜ ELSE THEN LET IN [] □ .. ‥ ... … $ $$ ? ?? ⁇ % %% ## @@ !! ‼ \\times \\leq \\geq \\mod \\wr ≀ ≅ ! ; , . -. @`.split(` `)]),Et=e=>/^[A-Za-z_]$/.test(e),Dt=e=>/^[0-9]$/.test(e),Ot=e=>e===` `||e===`\f`||e===`\r`,kt=new Set([...Tt].filter(e=>!Et(e[0])&&!(e[0]===`\\`&&Et(e[1]??``))).flatMap(e=>Array.from(e,(t,n)=>e.slice(0,e.length-n)))),At=/* @__PURE__ */ new Set("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ ~!@#$%^&*()_-+={}[]|:;<,>.?/`'0123456789"),jt=new Set(`; do then := ≔ begin variable variables || ‖ end else elsif if either or while with call return goto print assert skip procedure define process fair`.split(` `)),I={...Je,dashes:6,endModule:7},Mt=()=>({delimiter:``,delimiterLine:0,delimiterCol:0,commentDepth:0}),Nt=(t,n,r,i)=>{let a=[],o=[],s=``,c=`start`,l=n.vcolumn,u=n.vcolumn,d=bt(n),f=0,p=!1,m=!1,h=` `,g=()=>{u=n.vcolumn,d=bt(n)},_=()=>{s+=d,g()},v=()=>{c=`start`,l=u},y=()=>{a.push(o),o=[],l=0},b=t=>{throw new e.s(`${t} \`${s}' found at\n line ${n.line+1}, column ${l+1}`)},x=()=>{m=!0,t.delimiter=s,t.delimiterCol=l,t.delimiterLine=n.line-+(d===`
23
+ `)},S=e=>{r?(e>I.ident&&b(`Illegal token in an expression`),e!==I.string&&(jt.has(s)&&!(e===I.ident&&[`.`,`[`,`,`].includes(h))||(s===`,`&&!p&&!i||s===`)`||s===`}`)&&f===0)?(f!==0&&b(`Expression with an unmatched (, [, {, or << followed by`),p&&b("Expression with \\A or \\E but no following `:` followed by"),x(),o.length>0&&y()):(e===I.builtin&&Ct.has(s)&&(f+=1),e===I.builtin&&wt.has(s)&&(--f,f<0&&b(`Extra (unmatching)`)),h=e===I.string?` `:s,[`\\A`,`∀`,`\\E`,`∃`].includes(s)&&f===0&&(p=!0),p&&s===`:`&&f===0&&(p=!1),(s!==``||e===I.string)&&o.push(tt(s,l,e)),s=``)):(x(),s=``)},C=e=>{S(e),v()},w=e=>{_(),c=e},T=e=>{g(),c=e},E=r=>{switch(c){case`start`:if(Ot(r))return g(),v();if(Et(r))return w(`id`);if(r===`ℕ`||r===`ℤ`||r===`ℝ`)return _(),C(I.ident);if(Dt(r))return w(`numOrId`);if(r===`\\`)return w(`bs`);if(r===`-`)return w(`dash1`);if(r===`=`)return w(`eq1`);if(r===`(`)return T(`leftParen`);if(r===`"`)return T(`string`);if(r===`
24
+ `)return g(),y(),v();if(kt.has(r))return w(`builtIn`);if(r===` `){c=`done`;return}return _(),b(`Illegal lexeme`);case`id`:return s===`WF_`||s===`SF_`?C(I.builtin):Et(r)||Dt(r)?_():C(Tt.has(s)?I.builtin:I.ident);case`numOrId`:return Dt(r)?_():Et(r)?w(`id`):C(I.number);case`bs`:if([`b`,`B`,`o`,`O`,`h`,`H`].includes(r))return w(`numOrBi`);if(Et(r)){c=`bsBuiltIn`;return}if(r===`*`){g(),s=``,c=`lineComment`;return}c=`builtIn`;return;case`numOrBi`:c=Dt(r)?`num`:`bsBuiltIn`;return;case`num`:if(Dt(r))return _();if(!Et(r))return C(I.number);_(),s.startsWith(`\\`)&&b(`Illegal lexeme`),c=`id`;return;case`bsBuiltIn`:return Et(r)&&r!==`_`?_():Tt.has(s)?C(I.builtin):b(`Illegal lexeme `);case`builtIn`:if(kt.has(s+r))return _();if(!Tt.has(s)){for(xt(n);!Tt.has(s);)xt(n),s.length===0&&b(`Illegal lexeme`),s=Array.from(s).slice(0,-1).join(``);g()}return C(I.builtin);case`dash1`:case`dash2`:if(r===`-`)return w(c===`dash1`?`dash2`:`dash3`);c=`builtIn`;return;case`dash3`:return r!==`-`&&b(`Illegal lexeme`),w(`dashes`);case`dashes`:return r===`-`?_():C(I.dashes);case`eq1`:case`eq2`:if(r===`=`)return w(c===`eq1`?`eq2`:`eq3`);c=`builtIn`;return;case`eq3`:return r!==`=`&&b(`Illegal lexeme`),w(`eqs`);case`eqs`:return r===`=`?_():C(I.endModule);case`leftParen`:if(r===`*`)return t.commentDepth=1,T(`comment`);s=`(`,c=`builtIn`;return;case`string`:if(r===`\\`)return w(`escString`);if(r===`"`)return g(),C(I.string);_(),At.has(r)||b(`Illegal character in string`);return;case`escString`:_(),[`"`,`\\`,`t`,`n`,`f`,`r`].includes(r)||b(`Illegal character following \\ in string`),c=`string`;return;case`lineComment`:return r===`(`?T(`lineComParen`):r===`*`&&t.commentDepth>0?T(`lineComStar`):r===`
25
+ `||r===` `?(s=``,t.commentDepth=0,v()):t.commentDepth===0?_():g();case`lineComParen`:if(r===`*`)return t.commentDepth+=1,T(`lineComment`);t.commentDepth===0&&(s+=`(`),c=`lineComment`;return;case`lineComStar`:if(r===`)`){if(--t.commentDepth,t.commentDepth<0)throw new e.o(`Failure of assertion: case LINE_COM_STAR`);return T(`lineComment`)}t.commentDepth===0&&(s+=`*`),c=`lineComment`;return;case`comment`:case`orComment`:{let n=c===`comment`;if(r===`*`)return T(n?`commentStar`:`orCommentStar`);if(r===`(`)return T(n?`commentParen`:`orCommentParen`);if(r===`
26
+ `){s=``,g(),y(),c=`orComment`;return}if(r===` `)throw new e.s(n?`Input ended in the middle of a comment`:`Input ended in the middle of a multi-line comment`);return t.commentDepth===1?_():g()}case`commentStar`:case`orCommentStar`:{let n=c===`commentStar`?`comment`:`orComment`;if(r!==`)`){t.commentDepth===1&&(s+=`*`),c=n;return}if(g(),--t.commentDepth,n===`orComment`&&t.commentDepth<0)throw new e.o(`Assertion failure`);if(t.commentDepth!==0){c=n;return}return s=``,v()}case`commentParen`:case`orCommentParen`:{let e=c===`commentParen`?`comment`:`orComment`;if(r===`*`)return t.commentDepth+=1,T(e);t.commentDepth===1&&(s+=`(`),c=e;return}}};for(;c!==`done`&&!m;)E(d);return d!==`
27
+ `&&xt(n),at(a)},Pt=(e,t,n)=>Nt(e,t,!0,n),Ft=(e,t)=>(Nt(e,t,!1,!1),e.delimiter),It=(e,t)=>({params:e,tokenizer:Mt(),lookahead:{tokens:Array.from({length:10},()=>``),columns:Array.from({length:10},()=>0),lines:Array.from({length:10},()=>0)},lastToken:{column:0,line:0,text:``},isInMacro:!1,log:t}),Lt=()=>at([[tt(`defaultInitValue`,0,0)]]),Rt=(e,t)=>[...e,...t.filter((n,r)=>!e.includes(n)&&t.indexOf(n)===r)],zt=(e,t)=>!t.some(t=>e.includes(t)),Bt=(e,t)=>{t.splice(0,t.length,...e)},Vt=(t,n,r)=>{let i=t.params,a=t.lookahead,o=t.lastToken,s=0,c=[],l=[],u=1,d=/* @__PURE__ */ new Set,f=!1,p=!1,m,h=[],g=!1,_=[],v=[],y=[],b=!1,x=!1,S=i.inputVersionNumber>=1500,C=t=>{throw new e.s(`${t}\n line ${o.line}, column ${o.column}`)},w=()=>{if(s===0)return St(n),o.column=n.vcolumn+1,o.line=n.line+1,o.text=Ft(t.tokenizer,n),o.text;o.column=a.columns[0]+1,o.line=a.lines[0]+1;let e=a.tokens[0];for(let e=1;e<s;e++)a.tokens[e-1]=a.tokens[e],a.columns[e-1]=a.columns[e],a.lines[e-1]=a.lines[e];return--s,o.text=e,e},T=r=>{for(;s<r;){let r=s;if(St(n)===` `)throw new e.s(`Premature end of file, perhaps because of unclosed comment, near\n line ${a.lines[r]+1}, column ${a.columns[r]+1}`);a.columns[r]=n.vcolumn,a.lines[r]=n.line,a.tokens[r]=Ft(t.tokenizer,n),s+=1}return a.tokens[r-1]},E=r=>{if(r<s)throw new e.o(`ParseAlgorithm.PeekPastAlgToken called to peek after a token
28
+ it has already peeked at`);for(;r>s;)a.tokens[s]=Ft(t.tokenizer,n),s+=1;return St(n)},D=(r=!1)=>{if(s!==0)throw new e.o(`ParseAlgorithm: GetExpr called after lookahead`);let i=Pt(t.tokenizer,n,r);return a.tokens[0]=t.tokenizer.delimiter,a.columns[0]=t.tokenizer.delimiterCol,a.lines[0]=t.tokenizer.delimiterLine,s=1,i},O=(e,t)=>{let n=w();n!==e&&n!==t&&C(`Expected "${e}" but found "${n}"`)},k=(t,n)=>{if(t===`;`){let t=T(1);if(`end begin else elsif or do macro procedure process fair define } {`.split(` `).includes(t))return;if(`if either while with call return goto print assert skip`.split(` `).includes(t))throw new e.s(`Missing \`;' before line ${a.lines[0]+1}, column ${a.columns[0]+1}`)}O(t,n)},A=()=>{let e=w();return e===`=`?!0:e===`\\in`||e===`∈`?!1:C(`Expected "=" or "\\in" but found "${e}"`)},ee=()=>k(T(1)===`,`?`,`:`;`),te=()=>k(g?`{`:`begin`),ne=e=>{g?k(`}`):(k(`end`),k(e))},re=()=>{T(1)===`variables`?O(`variables`):k(`variable`)},j=()=>{let t={...F(),kind:`VarDecl`,var:w(),col:o.column,line:o.line,isEq:!0,val:Lt()};if(![`=`,`\\in`,`∈`].includes(T(1)))return p=!0,t;if(t.isEq=A(),t.val=D(),t.val.tokens.length===0)throw new e.c(`NullPointerException`);return t},ie=()=>{re();let e=[],t=[`begin`,`{`,`procedure`,`process`,`fair`,`define`,`macro`];for(;!t.includes(T(1));)e.push(j()),ee();return e},ae=()=>{let t={...F(),kind:`PVarDecl`,var:w(),col:o.column,line:o.line,val:Lt()};if(T(1)!==`=`)return p=!0,t;if(k(`=`),t.val=D(),t.val.tokens.length===0)throw new e.c(`NullPointerException`);return t},oe=()=>{re();let e=[];for(;T(1)!==`begin`&&T(1)!==`{`;)e.push(ae()),ee();return e},M=()=>{if(`while if assert print else elsif either or end with when await skip call return goto`.split(` `).includes(T(1)))return!1;let e=St(n);return e.length>0&&e[0]===`:`&&!(e.length>1&&e[1]===`=`)},se=()=>{if(!M())return``;let e=w();t.isInMacro&&C(`A label may not appear in a macro.`),e===`Done`&&C("Cannot use `Done' as a label."),e===`Error`&&C("Cannot use `Error' as a label."),k(`:`),f=!0,d.add(e);let n=T(1);return n!==`+`&&n!==`-`||(k(n),(n===`+`?_:v).push(e),S=!1),e},N=()=>{let e=[],t=e=>!g&&[`end`,`else`,`elsif`,`or`].includes(e)||g&&e===`}`;for(;!t(T(1));)e.push(...P());return g&&e.length===0&&C(`Empty statement list`),e},ce=t=>{O(`{`);let n=N();if(k(`}`),k(`;`),t!==``){if(n[0].lbl!==``)throw new e.s(`Duplicate labeling of statement`,n[0]);n[0].lbl=t}return n},P=()=>{let e=se();if(g&&T(1)===`{`)return ce(e);let t=le();return t.lbl=e,[t]},le=()=>{let t=T(1);if(t===`if`)return de(0);if(t===`either`)return fe();if(t===`with`)return pe(0);if(t===`when`||t===`await`){O(t);let n=o.column,r=o.line,i=D();if(i.tokens.length===0)throw new e.c(`NullPointerException`);return k(`;`),{...F(),kind:`When`,col:n,line:r,exp:i}}if(t===`print`||t===`assert`){O(t);let e=o.column,n=o.line,r=D();return r.tokens.length===0&&C(`Empty expression in ${t} statement at `),k(`;`),{...F(),kind:t===`print`?`PrintS`:`Assert`,col:e,line:n,exp:r}}if(t===`skip`){O(`skip`);let e={...F(),kind:`Skip`,col:o.column,line:o.line};return k(`;`),e}if(t===`call`)return ve();if(t===`return`){O(`return`);let e={...F(),kind:`Return`,col:o.column,line:o.line,from:m};return k(`;`),e}if(t===`goto`){O(`goto`);let e=o.column,t=o.line,n=w();return b=!0,(n===`Done`||n===`"Done"`)&&(x=!0),k(`;`),{...F(),kind:`Goto`,col:e,line:t,to:n}}return t===`while`?ue():E(1)[0]===`(`?ye():he()},ue=()=>{O(`while`);let e=o.column,t=o.line;g&&k(`(`);let n=D();g&&k(`)`),n.tokens.length===0&&C(`Empty while test at `),g||k(`do`);let r=g?P():N();return g||(k(`end`),k(`while`),k(`;`)),r.length===0&&C(`Missing body of while statement at`),{...F(),kind:`While`,col:e,line:t,test:n,unlabDo:r,labDo:[]}},de=e=>{O(e===0?`if`:`elsif`);let t={...F(),kind:`LabelIf`,col:o.column,line:o.line,test:rt(),unlabThen:[],labThen:[],unlabElse:[],labElse:[]};g&&k(`(`),t.test=D(),g&&k(`)`),t.test.tokens.length===0&&C(`Empty if test at `),g||k(`then`),t.unlabThen=g?P():N();let n=T(1);return n===`else`&&(O(`else`),t.unlabElse=g?P():N()),!g&&n===`elsif`&&(t.unlabElse=[de(e+1)]),!g&&![`else`,`elsif`,`end`].includes(n)&&C(`Expecting "else", "elsif", or "end"`),!g&&e===0&&(k(`end`),k(`if`),k(`;`)),t.unlabElse.length===0&&et(t.unlabThen,t.unlabThen.length-1),t},fe=()=>{O(`either`);let t={...F(),kind:`LabelEither`,col:o.column,line:o.line,clauses:[]};for(;;){let n={...F(),kind:`Clause`,unlabOr:g?P():N(),labOr:[]};if(n.unlabOr.length===0)throw new e.s("`either' statement with empty `or' clause",t);if(t.clauses.push(n),T(1)!==`or`)break;O(`or`)}if(g||(O(`end`),k(`either`),k(`;`)),t.clauses.length===1)throw new e.s("`either' statement has no `or'",t);return t},pe=t=>{t===0&&(k(`with`),g&&k(`(`));let n={...F(),kind:`With`,col:o.column,line:o.line,var:w(),isEq:!0,exp:rt(),Do:[]};n.isEq=A(),n.exp=D(),g&&T(1)===`)`||ee(),n.exp.tokens.length===0&&C(`Empty with expression at `);let r=!g&&T(1)===`do`,i=g&&T(1)===`)`;if(r&&k(`do`),i&&O(`)`),n.Do=r?N():i?P():[pe(t+1)],r&&(k(`end`),k(`with`),k(`;`)),n.Do.length===0)throw new e.s(`Missing body of with statement`,n);return n},me=()=>{let e=a.columns[0]+1,t=a.lines[0]+1,n={...F(),kind:`Lhs`,col:e,line:t,var:w(),sub:D()};k(`:=`,`≔`);let r=D();return r.tokens.length===0&&C(`Empty right-hand side of assignment at `),{...F(),kind:`SingleAssign`,col:e,line:t,lhs:n,rhs:r}},he=()=>{let t={...F(),kind:`Assign`,col:a.columns[0]+1,line:a.lines[0]+1,ass:[me()]};for(;T(1)===`||`||T(1)===`‖`;){w();try{t.ass.push(me())}catch(t){if(!(t instanceof e.s))throw t;C(`Bad assignment statement at `)}}return k(`;`),t},ge=()=>{let e=[];if(E(0)[0]!==`)`)for(;;){let t=D();if(e.push(t),t.tokens.length===0&&C(`Empty argument in call statement at `),T(1)===`)`)break;k(`,`)}return k(`)`),k(`;`),e},_e=()=>{O(`call`);let e={...F(),kind:`Call`,col:o.column,line:o.line,returnTo:``,to:w(),args:[]};return k(`(`),e.args=ge(),y.includes(e.to)||y.push(e.to),e},ve=()=>{let e=_e();if(T(1)===`return`)return O(`return`),k(`;`),{...F(),kind:`CallReturn`,col:e.col,line:e.line,to:e.to,from:m,args:e.args};if(T(1)!==`goto`)return e;O(`goto`);let t={...F(),kind:`CallGoto`,col:e.col,line:e.line,to:e.to,after:w(),args:e.args};return b=!0,(t.to===`Done`||t.to===`"Done"`)&&(x=!0),k(`;`),t},ye=()=>{let e={...F(),kind:`MacroCall`,name:w(),col:o.column,line:o.line,args:[]};return O(`(`),e.args=ge(),e},be=e=>{t.isInMacro=!0,O(`macro`);let n={...F(),kind:`Macro`,col:o.column,line:o.line,name:w(),params:[],body:[]};for(k(`(`);T(1)!==`)`;)n.params.length>0&&k(`,`),n.params.push(w());return O(`)`),te(),n.body=N(),ne(`macro`),T(1)===`;`&&w(),Ne(n.body,e),t.isInMacro=!1,n},xe=()=>{k(`procedure`);let e={...F(),kind:`Procedure`,col:o.column,line:o.line,name:w(),minusLabels:[],plusLabels:[],proceduresCalled:[],params:[],decls:[],body:[]};for(m=e.name,_=[],v=[],y=[],k(`(`);T(1)!==`)`;)e.params.length>0&&k(`,`),e.params.push(ae());return O(`)`),T(1)!==`begin`&&T(1)!==`{`&&(e.decls=oe()),te(),e.body=N(),ne(`procedure`),T(1)===`;`&&w(),m=void 0,e.plusLabels=_,e.minusLabels=v,e.proceduresCalled=y,e},Se=()=>{k(`process`);let e=o.column,t=o.line;g&&k(`(`);let n=w(),r=A(),i=D();_=[],v=[],y=[],g&&k(`)`),i.tokens.length===0&&C(`Empty process id at `);let a=T(1)===`begin`||T(1)===`{`?[]:ie();te();let s=N();return ne(`process`),T(1)===`;`&&w(),{...F(),kind:`Process`,col:e,line:t,name:n,fairness:0,minusLabels:v,plusLabels:_,proceduresCalled:y,isEq:r,id:i,decls:a,body:s}},Ce=()=>{let e=`${i.labelRoot}${u}`;return u+=1,d.has(e)?Ce():e},we=e=>{e.lbl===``&&(e.lbl=Ce(),c.push(e.lbl),l.push(Qe(e)))},Te=(t,n,r,i,a)=>{Bt(i,a);let o=n,s=!1,c=e=>{we(e),s=!0,a.length=0};return t.forEach(t=>{if(t.lbl!==``&&(s=!0,a.length=0,r))throw new e.s("Label in `with' statement",t);if(o){if(r)throw new e.s("Statement follows `call' or `return' inside a `with' statement.",t);c(t),o=!1}switch(t.kind){case`LabelIf`:{let e=[],n=[],i=Te(t.unlabThen,!1,r,a,e);o=Te(t.unlabElse,!1,r,a,n)||i,Bt(Rt(e,n),a);return}case`LabelEither`:{let e=[];t.clauses.forEach(t=>{let n=[];o=Te(t.unlabOr,!1,r,a,n)||o,Bt(Rt(n,e),e)}),Bt(e,a);return}case`While`:if(r)throw new e.s("`while' inside a `with' statement",t);c(t),Te(t.unlabDo,!1,!1,a,[]),o=!1;return;case`With`:{let e=[];o=Te(t.Do,!1,!0,r?[...i]:[],e),Bt(e,a),!r&&!zt(i,a)&&c(t);return}}let n=t.kind===`Call`||t.kind===`CallGoto`,l=t.kind===`Return`||t.kind===`CallReturn`,u=t.kind===`Assign`?Rt([],t.ass.map(e=>e.lhs.var)):n||l?[`stack`,...l||t.to===m?h.flatMap(e=>[...e.params,...e.decls].map(e=>e.var)):[]]:[];if(o=n||l||t.kind===`Goto`,zt(a,u))Bt(Rt(a,u),a);else{if(r)throw new e.s(t.kind===`Assign`?"Second assignment to same variable inside a `with' statement":"Call or return makes second assignment to a variable inside a `with' statement",t);c(t),Bt(u,a)}}),s||o},Ee=e=>{let t=e=>{let t=e.findIndex(e=>e.lbl!==``),n=t===-1?e:e.slice(0,t);return Ee(n),{unlabeled:n,labeled:De(t===-1?[]:e.slice(t))}};e.forEach(e=>{switch(e.kind){case`LabelIf`:{let n=t(e.unlabThen);e.unlabThen=n.unlabeled,e.labThen=n.labeled;let r=t(e.unlabElse);e.unlabElse=r.unlabeled,e.labElse=r.labeled;return}case`LabelEither`:e.clauses.forEach(e=>{let n=t(e.unlabOr);e.unlabOr=n.unlabeled,e.labOr=n.labeled});return;case`While`:{let n=t(e.unlabDo);e.unlabDo=n.unlabeled,e.labDo=n.labeled}}})},De=t=>{let n=[];return t.forEach(t=>{if(t.lbl===``&&n.length>0)n[n.length-1].stmts.push(t);else{if(t.lbl===``)throw new e.o(`Failure of assertion: Missing Label in MakeLabeledStmtSeq`);n.push({...F(),kind:`LabeledStmt`,col:t.col,line:t.line,macroCol:t.macroCol,macroLine:t.macroLine,label:t.lbl,stmts:[t]})}}),n.forEach(e=>Ee(e.stmts)),n},Oe=(t,n)=>{let r=t[n];switch(r.kind){case`LabelIf`:{let e=ke(r.unlabThen);r.labThen.forEach(e=>ke(e.stmts));let i=ke(r.unlabElse);return r.labElse.forEach(e=>ke(e.stmts)),r.labThen.length>0||r.labElse.length>0||e===2||i===2?2:(t[n]={...F(),kind:`If`,test:r.test,Then:r.unlabThen,Else:r.unlabElse},+(e+i>0))}case`LabelEither`:{let e=r.clauses.reduce((e,t)=>{let n=Math.max(e,ke(t.unlabOr));return t.labOr.forEach(e=>ke(e.stmts)),t.labOr.length>0?2:n},0);return e===2?2:(t[n]={...F(),kind:`Either`,ors:r.clauses.map(e=>e.unlabOr)},e)}case`With`:{let t=ke(r.Do);if(t===2)throw new e.s(`with statement at ${Qe(r)} contains a labeled statement`);return t}case`While`:if(n!==0)throw new e.o("ParseAlgorithm.ClassifyStmtSeq encountered `while' not at beginning of StmtSeq.");return ke(r.unlabDo),r.labDo.forEach(e=>ke(e.stmts)),0;case`Call`:return t[n+1]?.kind===`Return`?0:1;case`Return`:case`CallReturn`:if(m===void 0)throw new e.s(`return statement not in a procedure at ${Qe(r)}`);return 1;case`Goto`:case`CallGoto`:return 1;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`MacroCall`:return 0;default:throw new e.o(`ParseAlgorithm.ClassifyStmtSeq encountered the unexpected statement type ${r.kind}`)}},ke=t=>{for(let n=0;n<t.length;n++){let r=Oe(t,n);if(r!==0){if(n===t.length-1)return r;throw new e.o(`Translator discovered later than it should have that\n Statement at ${Qe(t[n+1])} must have a label`)}}return 0},Ae=e=>{Te(e,!0,!1,[],[]);let t=De(e);return t.forEach(e=>ke(e.stmts)),t},je=(t,n,r,i,a)=>{let o=e=>ht(e,n,r),s=e=>e.map(e=>je(e,n,r,i,a)),c=e=>e.map(e=>({...F(),kind:`LabeledStmt`,label:e.label,stmts:e.stmts.map(e=>je(e,n,r,-1,0))})),l={...F(),col:t.col,line:t.line,macroCol:i>0?a:t.macroCol,macroLine:i>0?i:t.macroLine};switch(t.kind){case`Assign`:return{...l,kind:`Assign`,ass:t.ass.map(e=>Me(e,n,r,i,a))};case`If`:return{...l,kind:`If`,test:o(t.test),Then:s(t.Then),Else:s(t.Else)};case`Either`:return{...l,kind:`Either`,ors:t.ors.map(s)};case`With`:return{...l,kind:`With`,var:t.var,isEq:t.isEq,exp:o(t.exp),Do:s(t.Do)};case`When`:case`Assert`:case`PrintS`:return{...l,kind:t.kind,exp:o(t.exp)};case`Skip`:return{...l,kind:`Skip`,macroCol:i>0?a:0,macroLine:i>0?i:-1};case`While`:return{...l,kind:`While`,test:o(t.test),unlabDo:s(t.unlabDo),labDo:c(t.labDo)};case`LabelIf`:return{...l,kind:`LabelIf`,test:o(t.test),unlabThen:s(t.unlabThen),labThen:c(t.labThen),unlabElse:s(t.unlabElse),labElse:c(t.labElse)};case`LabelEither`:return{...l,kind:`LabelEither`,clauses:t.clauses.map(e=>({...F(),kind:`Clause`,labOr:c(e.labOr),unlabOr:s(e.unlabOr)}))};case`Call`:return{...l,kind:`Call`,to:t.to,returnTo:t.returnTo,args:gt(t.args,n,r)};case`Return`:return{...l,kind:`Return`,from:t.from};case`CallReturn`:return{...l,kind:`CallReturn`,to:t.to,from:t.from,args:gt(t.args,n,r)};case`CallGoto`:return{...l,kind:`CallGoto`,to:t.to,after:t.after,args:gt(t.args,n,r)};case`Goto`:return{...l,kind:`Goto`,to:t.to};default:throw new e.o(`Found unexpected statement type in macro at${Qe(t)}`)}},Me=(t,n,r,i,a)=>{let o=ht(t.rhs,n,r),s={...F(),kind:`Lhs`,var:t.lhs.var,sub:t.lhs.sub.tokens.length===0?t.lhs.sub:ht(t.lhs.sub,n,r)},c={...F(),kind:`SingleAssign`,col:t.col,line:t.line,macroCol:i>0?a:t.macroCol,macroLine:i>0?i:t.macroLine,lhs:s,rhs:o},l=r.indexOf(s.var);if(l===-1)return c;let u=n[l],d=ut(u,{line:0,item:0});if(d.type!==Je.ident)throw new e.s(`Macro expansion substitutes \`${d.string}' for assignment variable\n at ${Qe(c)}`);if(s.var=d.string,dt(u,{line:0,item:0},1)===void 0)return c;let f=st(u);return f.tokens[0].splice(0,1),it(f),s.sub.tokens.length===0?s.sub=f:ct(s.sub,f,0),c},Ne=(e,t)=>{let n=e.flatMap(e=>{switch(e.kind){case`LabelIf`:return Ne(e.unlabThen,t),Ne(e.unlabElse,t),[e];case`LabelEither`:return e.clauses.forEach(e=>Ne(e.unlabOr,t)),[e];case`With`:return Ne(e.Do,t),[e];case`While`:return Ne(e.unlabDo,t),[e];case`MacroCall`:return Pe(e,t);default:return[e]}});e.splice(0,e.length,...n)},Pe=(t,n)=>{let r=n.findLast(e=>e.name===t.name);if(r===void 0)throw new e.s(`Macro ${t.name} undefined,\n at ${Qe(t)}`);if(r.params.length!==t.args.length)throw new e.s(`Macro ${t.name} called with wrong number of arguments at \n ${Qe(t)}`);let i=r.body.map(e=>je(e,t.args,r.params,t.line,t.col));return i.length>0&&(i[0].lbl=t.lbl),i},Fe=t=>{t.forEach((n,r)=>{if(t.slice(r+1).some(e=>e.name===n.name))throw new e.s(`Multiple definitions of macro name \`${n.name}'`)})},Ie=e=>{if(e.length===0)return;let t=()=>{S=!1},n=e[0];if(e.length>1||n.kind!==`LabeledStmt`)return t();if(n.stmts.length===0)return;let r=n.stmts[0];if(n.stmts.length>1||r.kind!==`While`||!lt(r.test)||r.test.tokens[0][0].string!==`TRUE`)return t();r.labDo.length>0&&(S=!1),r.unlabDo.some(e=>[`LabelIf`,`LabelEither`,`LabeledStmt`].includes(e.kind))&&(S=!1)},Le=()=>{let t=c.length>1?`Missing labels at the following locations:`:`Missing label at the following location:`;throw new e.s([t,...l].join(`
29
+ `))},Re=e=>h.forEach(t=>{m=t.name,Ne(t.body,e),t.body=Ae(t.body)}),ze=()=>{r&&w()!==`algorithm`&&C("`--fair' not followed by `algorithm'");let e=w();g=T(1)===`{`,g&&O(`{`);let n=T(1)===`variable`||T(1)===`variables`?ie():[],a=rt();T(1)===`define`&&(O(`define`),g&&k(`{`),a=D(!0),ne(`define`),k(`;`));let o=[];for(;T(1)===`macro`;)o.push(be(o));for(;T(1)===`procedure`;)h.push(xe()),S=!1;if(T(1)===`fair`&&(T(2)===`process`||T(2)===`+`&&T(3)===`process`)||T(1)===`process`){let r=[];for(;T(1)===`fair`||T(1)===`process`;){let e=T(1)===`fair`;e&&O(`fair`);let t=e&&T(1)===`+`;t&&O(`+`);let n=t||!e&&i.fairnessOption===`sf`?2:e||i.fairnessOption===`wf`?1:0;r.push({...Se(),fairness:n})}return ne(`algorithm`),Fe(o),r.forEach(e=>{Ne(e.body,o),e.body=Ae(e.body),Ie(e.body)}),Re(o),c.length>0&&(i.labelFlag||Le(),t.log(`Labels added.`)),(x||b)&&(S=!1),{...F(),kind:`Multiprocess`,name:e,decls:n,defs:a,macros:o,prcds:h,procs:r}}i.inputVersionNumber===1500&&T(1)===`fair`&&(k(`fair`),T(1)===`+`&&k(`+`),i.fairnessOption=`wf`),r&&([``,`wf`,`wfNext`].includes(i.fairnessOption)||t.log(`Warning: Option \`${i.fairnessOption}' specified for --fair algorithm.`),i.fairnessOption=`wf`),te();let s=N();Fe(o),Ne(s,o),Re(o),g&&k(`}`),ne(`algorithm`);let l=Ae(s);return c.length>0&&(f&&!i.labelFlag&&Le(),t.log(`Labels added.`)),(b||x)&&(S=!1),Ie(l),{...F(),kind:`Uniprocess`,name:e,decls:n,defs:a,macros:o,prcds:h,body:l}};try{return{ast:ze(),shouldOmitPC:S,hasDefaultInitialization:p}}catch(t){if(!(t instanceof e.c))throw t;return C(`Unknown error at or before`)}},L={global:0,label:1,procedure:2,process:3,processVar:4,procedureVar:5,parameter:6},Ht=[`Global variable`,`Label`,`Procedure`,`Process`,`Process variable`,`Procedure variable`,`Parameter`],Ut=/* @__PURE__ */ new Set([L.global,L.processVar,L.procedureVar,L.parameter]),Wt=(e,t,n,r)=>e.symbols.find(e=>e.id===n&&e.context===r&&e.type===t),Gt=(e,t,n)=>e.symbols.find(e=>e.id===t&&e.context===n),Kt=(e,t)=>{let n=e.procedures.findIndex(e=>e.name===t);return n===-1?e.procedures.length:n},qt=(e,t,n,r)=>!(t===L.procedureVar||t===L.processVar||t===L.parameter?Wt(e,L.global,n,``)!==void 0||Gt(e,n,r)!==void 0:Wt(e,t,n,r)!==void 0)&&(e.symbols.push({type:t,id:n,context:r,useThis:n}),!0),Jt=(e,t,n,r)=>Wt(e,t,n,r)?.useThis??n,Yt=(e,t,n)=>{let r=Gt(e,t,n);return r===void 0?t:Ut.has(r.type)?r.useThis:t},Xt=t=>{let n={symbols:[],procedures:[],processNames:[],errorReport:``},r=(e,t)=>{qt(n,L.label,e.label,t)||(n.errorReport+=`\nLabel ${e.label} redefined at line ${e.line}, column ${e.col}`),e.stmts.forEach(e=>i(e,t))},i=(t,n)=>{let a=e=>e.forEach(e=>i(e,n)),o=e=>e.forEach(e=>r(e,n));switch(t.kind){case`While`:a(t.unlabDo),o(t.labDo);return;case`If`:a(t.Then),a(t.Else);return;case`With`:a(t.Do);return;case`LabelIf`:a(t.unlabThen),o(t.labThen),a(t.unlabElse),o(t.labElse);return;case`Either`:t.ors.forEach(a);return;case`LabelEither`:t.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`Call`:case`Return`:case`CallReturn`:case`CallGoto`:case`Goto`:return;default:throw new e.o(`Unexpected AST type ${t.kind}`)}},a=(e,t,r=t===``?L.global:L.processVar)=>{qt(n,r,e.var,t)||(n.errorReport+=`\n${Ht[r]} ${e.var} redefined at line ${e.line}, column ${e.col}`)};if(qt(n,L.global,`pc`,``),t.prcds.length>0&&qt(n,L.global,`stack`,``),t.decls.forEach(e=>a(e,``)),t.prcds.forEach(e=>{let t=Kt(n,e.name)<n.procedures.length;t&&(n.errorReport+=`\nProcedure ${e.name} redefined at line ${e.line}, column ${e.col}`),t||n.procedures.push({name:e.name,params:e.params,decls:e.decls,initialPC:e.body.length===0?void 0:$e(e.body[0]).label}),qt(n,L.procedure,e.name,``),e.decls.forEach(t=>a(t,e.name,L.procedureVar)),e.params.forEach(t=>a(t,e.name,L.parameter)),e.body.forEach(t=>r($e(t),e.name))}),t.kind===`Multiprocess`&&t.procs.forEach(e=>{let t=n.processNames.includes(e.name);t&&(n.errorReport+=`\nProcess ${e.name} redefined at line ${e.line}, column ${e.col}`),t||n.processNames.push(e.name),qt(n,L.process,e.name,``),e.decls.forEach(t=>a(t,e.name)),e.body.forEach(t=>r($e(t),e.name))}),t.kind===`Uniprocess`&&t.body.forEach(e=>r($e(e),``)),n.errorReport.length>0)throw new e.s(n.errorReport);return n},Zt=e=>{let t=t=>e.symbols.filter(e=>e.useThis===t).length>1,n=!1;for(let r=0;r<=7;r+=1)e.symbols.forEach(e=>{if(e.type===r){e.useThis=e.id;for(let n=1;r>0&&t(e.useThis);n+=1)e.useThis+=n===1?`_`:e.context[n-2]??String(r);e.id!==e.useThis&&(n=!0)}});return n},Qt=t=>{let n=t.symbols.filter(e=>e.id===`defaultInitValue`).map(e=>`${Ht[e.type]} name`);if(n.length>0)throw new e.s(`Cannot use \`defaultInitValue' as ${n.join(` or `)}`)},$t=(t,n,r)=>{let i=(e,t)=>{let r=[],i=[];e.tokens.forEach(e=>e.forEach(e=>{if(e.type!==Je.ident)return;let a=Yt(n,e.string,t);r.includes(e.string)||a===e.string||(r.push(e.string),i.push(at([[nn(a)]])))})),i.length>0&&mt(e,i,r,!1)},a=(e,t)=>{e.var=Yt(n,e.var,t),i(e.val,t)},o=(e,t)=>e.forEach((r,i)=>{e[i]=Jt(n,L.label,r,t)}),s=(e,t)=>e===void 0?void 0:Jt(n,L.procedure,e,t),c=(e,t)=>{e.label=Jt(n,L.label,e.label,t),e.stmts.forEach(e=>l(e,t))},l=(t,r)=>{let a=e=>e.forEach(e=>l(e,r)),o=e=>e.forEach(e=>c(e,r)),u=e=>e.forEach(e=>i(e,r));switch(t.kind){case`LabeledStmt`:c(t,r);return;case`While`:a(t.unlabDo),o(t.labDo),i(t.test,r);return;case`Assign`:t.ass.forEach(e=>{e.lhs.var=Yt(n,e.lhs.var,r),i(e.lhs.sub,r),i(e.rhs,r)});return;case`If`:a(t.Then),a(t.Else),i(t.test,r);return;case`With`:i(t.exp,r),a(t.Do);return;case`When`:case`PrintS`:case`Assert`:i(t.exp,r);return;case`Skip`:return;case`LabelIf`:i(t.test,r),a(t.unlabThen),o(t.labThen),a(t.unlabElse),o(t.labElse);return;case`Call`:t.returnTo=Jt(n,L.procedure,t.returnTo,r),t.to=Jt(n,L.procedure,t.to,r),u(t.args);return;case`Return`:t.from=s(t.from,r);return;case`CallReturn`:t.from=s(t.from,r),t.to=Jt(n,L.procedure,t.to,r),u(t.args);return;case`CallGoto`:t.after=Jt(n,L.procedure,t.after,r),t.to=Jt(n,L.procedure,t.to,r),u(t.args);return;case`Goto`:if(Wt(n,L.label,t.to,r)===void 0&&t.to!==`Done`)throw new e.s(`goto to non-existent label \`${t.to}' at line ${t.line}, column ${t.col}`);t.to=Jt(n,L.label,t.to,r);return;case`Either`:t.ors.forEach(a);return;case`LabelEither`:t.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;default:throw new e.o(`Unexpected AST type${t.kind}`)}},u=e=>{e.decls.forEach(t=>a(t,e.name)),e.params.forEach(t=>a(t,e.name)),e.body.forEach(t=>c($e(t),e.name));let t=et(n.procedures,Kt(n,e.name));o(e.plusLabels,e.name),o(e.minusLabels,e.name),t.initialPC!==void 0&&(t.initialPC=Jt(n,L.label,t.initialPC,e.name)),e.name=Jt(n,L.procedure,e.name,``),t.name=e.name},d=e=>{e.decls.forEach(t=>a(t,e.name)),e.body.forEach(t=>c($e(t),e.name)),o(e.plusLabels,e.name),o(e.minusLabels,e.name),e.name=Jt(n,L.process,e.name,``)};t.decls.forEach(e=>a(e,``)),t.kind===`Multiprocess`&&((e,t)=>{e.forEach(u);let n=e.map(e=>e.name),i=e.map(e=>n.map(t=>e.proceduresCalled.includes(t)));n.forEach((e,t)=>i.forEach(e=>e.forEach((n,r)=>{e[r]=n||e[t]&&i[t][r]}))),e.forEach((e,t)=>{e.proceduresCalled=n.filter((e,n)=>i[t][n])});for(let e of t){d(e);let t=e.proceduresCalled;for(let e=0;e<t.length;e+=1){let a=n.indexOf(t[e]);if(a===-1){r(`\nUnrecoverable error:\n -- Could not find procedure name \`${t[e]}'.\n`);return}n.forEach((e,n)=>{i[a][n]&&!t.includes(e)&&t.push(e)})}}})(t.prcds,t.procs),t.kind===`Uniprocess`&&(t.prcds.forEach(u),t.body.forEach(e=>c($e(e),``)))},en=e=>tt(e,0,Je.string),tn=e=>tt(e,0,Je.added),R=e=>tt(e,0,Je.builtin),nn=e=>tt(e,0,Je.ident),rn=(e,t)=>{let n=[];return e.forEach(e=>{let r=n.at(-1),i=r===void 0?0:r.column+nt(r)+t;n.push(tt(e.string,i,e.type))}),at([n])},an=e=>e.tokens.forEach((t,n)=>{let r=n===0||n===e.tokens.length-1?1:6;t.forEach(e=>{if(e.column=r,r+=nt(e),e.type===Je.builtin)switch(e.string){case`|->`:case`↦`:e.column=Math.max(16,e.column+1),r=e.column+5;return;case`[`:case`<<`:r+=1;return;case`]`:case`>>`:e.column+=1,r+=1;return;case`\\o`:e.column+=1,r+=2}})}),on=(e,t,n,r=0,i=0)=>({...F(),kind:`SingleAssign`,line:r,col:i,lhs:{...F(),kind:`Lhs`,var:e,sub:t},rhs:n}),sn=(e,t=0,n=0)=>({...F(),kind:`Assign`,line:t,col:n,ass:e}),cn=(e,t,n=0,r=0)=>sn([on(e,at([]),t,n,r)],n,r),ln=e=>{if(e.tokens.length>1)return!1;let t=et(e.tokens,0);return t.length===1?t[0].string===`TRUE`:t.length===3&&t[0].string===`(`&&t[1].string===`TRUE`&&t[2].string===`)`},un=e=>({...F(),kind:`When`,exp:rn([tn(`pc`),R(`=`),en(e)],1)}),dn=e=>cn(`pc`,at([[en(e??`null`)]])),fn=e=>[nn(`Head`),R(`(`),tn(`stack`),R(`)`),R(`.`),nn(e)],pn=()=>[nn(`Tail`),R(`(`),tn(`stack`),R(`)`)],mn=e=>at([fn(e)]),hn=(e,t,n,r)=>{let i=[[R(`<<`),R(`[`),nn(`procedure`),R(`|->`),en(e),R(`,`)],[nn(`pc`),R(`|->`),...t]];n.forEach(e=>{i[i.length-1].push(R(`,`)),i.push([nn(e.var),R(`|->`),nn(e.var)])}),i[i.length-1].push(R(`]`),R(`>>`)),i.push(r);let a=rt(i);return an(a),it(a),a},gn=(t,n,r)=>{if(n.params.length!==r.args.length)throw new e.s(`Procedure ${r.to} called with wrong number of arguments`,r);return n.params.forEach((e,n)=>t.ass.push(on(e.var,at([]),r.args[n],r.line,r.col))),[t,...n.decls.map(e=>cn(e.var,e.val,r.line,r.col)),dn(n.initialPC)]},_n=(t,n,r)=>{let i,a=(t,r)=>{let i=Kt(n,t.to);if(i===n.procedures.length)throw new e.s(`Call of non-existent procedure ${t.to}`,t);let a=n.procedures[i],o=hn(t.to,[en(r)],[...a.decls,...a.params],[R(`\\o`),tn(`stack`)]);return gn(cn(`stack`,o,t.line,t.col),a,t)},o=t=>{t.from??=i;let r=t.from;if(r===void 0)throw new e.s("`return' statement not in procedure",t);let a=Kt(n,r);if(a>=n.procedures.length)throw new e.s(`Error in procedure (perhaps name used elsewhere)`,t);let o=n.procedures[a],s=(e,n)=>sn([on(e,rt(),n,t.line,t.col)],t.line,t.col);return[s(`pc`,mn(`pc`)),...o.decls.map(e=>s(e.var,mn(e.var))),...o.params.map(e=>s(e.var,mn(e.var))),s(`stack`,at([pn()]))]},s=t=>{let r=t.from;if(r===void 0)throw new e.s(`\`return' statement following \`call' at ${Qe(t)} not in a procedure`);let i=et(n.procedures,Kt(n,r)),a=Kt(n,t.to);if(a===n.procedures.length)throw new e.s(`Call of non-existent procedure ${t.to}`,t);let o=n.procedures[a],s=sn([],t.line,t.col);if(r!==t.to){i.decls.forEach(e=>s.ass.push(on(e.var,rt(),mn(e.var),t.line,t.col)));let e=hn(t.to,fn(`pc`),[...o.decls,...o.params],[R(`\\o`),...pn()]);s.ass.push(on(`stack`,at([]),e,t.line,t.col))}return gn(s,o,t)},c=(e,t)=>{if(e.length===0)return{stmts:[],labeledStmts:[],needsGoto:!r};let n={stmts:e,labeledStmts:[],needsGoto:!1},i=e[e.length-1];switch(i.kind){case`LabelIf`:case`LabelEither`:{let r=i.kind===`LabelIf`?p(i,t):m(i,t);e.pop(),e.push(r.stmt),n.labeledStmts=r.labeledStmts;break}case`Goto`:e.pop(),e.push(dn(i.to));break;case`Call`:e.pop(),e.push(...a(i,t));break;case`Return`:e.pop(),e.push(...o(i));break;case`CallReturn`:e.pop(),e.push(...s(i));break;case`CallGoto`:e.pop(),e.push(...a({...F(),kind:`Call`,returnTo:``,to:i.to,args:i.args,line:i.line,col:i.col},i.after));break;case`If`:{let e=c(i.Then,t),a=c(i.Else,t);n.labeledStmts.push(...e.labeledStmts,...a.labeledStmts),i.Then=e.stmts,i.Else=a.stmts,r||(n.needsGoto=e.needsGoto&&a.needsGoto,n.needsGoto||(e.needsGoto&&i.Then.push(dn(t)),a.needsGoto&&i.Else.push(dn(t))));break}case`Either`:{let e=i.ors.map((e,r)=>{let a=c(e,t);return i.ors[r]=a.stmts,n.labeledStmts.push(...a.labeledStmts),a});n.needsGoto=e.every(e=>e.needsGoto),!r&&!n.needsGoto&&e.forEach((e,n)=>{e.needsGoto&&i.ors[n].push(dn(t))});break}case`With`:{let e=c(i.Do,t);i.Do=e.stmts,n.labeledStmts.push(...e.labeledStmts),n.needsGoto=e.needsGoto;break}default:n.needsGoto=!0}return r&&(n.needsGoto=!1),n},l=(e,t)=>{let n=c(e,t);return n.needsGoto&&n.stmts.push(dn(t)),n},u=(e,t)=>{let n=e.stmts.at(0);if(n?.kind===`While`)return f(e,n,t);let i=l([...e.stmts],t),a=[];return r||(i.stmts.unshift(un(e.label)),a.push({...F(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:i.stmts})),a.push(...i.labeledStmts),a},d=(e,t)=>e.flatMap((n,r)=>u(n,r<e.length-1?e[r+1].label:t)),f=(e,t,n)=>{let i=t.labDo.length===0?e.label:t.labDo[0].label,a=l([...t.unlabDo],i),o=l(e.stmts.slice(1),n),s=ln(t.test),c=s?a.stmts:[{...F(),kind:`If`,test:t.test,Then:a.stmts,Else:o.stmts}];return[{...F(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:[...r?[]:[un(e.label)],...c]},...d(t.labDo,e.label),...a.labeledStmts,...s?[]:o.labeledStmts]},p=(e,t)=>{let n=l(e.unlabThen,e.labThen.length===0?t:e.labThen[0].label),r=l(e.unlabElse,e.labElse.length===0?t:e.labElse[0].label),i=d(e.labThen,t);return i.push(...d(e.labElse,t)),i.push(...n.labeledStmts,...r.labeledStmts),{stmt:{...F(),kind:`If`,col:e.col,line:e.line,test:e.test,Then:n.stmts,Else:r.stmts},labeledStmts:i}},m=(e,t)=>{let n=[],r=[];return e.clauses.forEach(e=>{let i=l(e.unlabOr,e.labOr.length>0?e.labOr[0].label:t);n.push(i.stmts),r.push(...i.labeledStmts),r.push(...d(e.labOr,t))}),{stmt:{...F(),kind:`Either`,col:e.col,line:e.line,ors:n},labeledStmts:r}},h=(e,t)=>d(e.map($e),t),g=e=>{i=e.name;let t=h(e.body,Jt(n,L.label,`Error`,``));return i=void 0,{...F(),kind:`Procedure`,col:e.col,line:e.line,name:e.name,minusLabels:[],plusLabels:[],proceduresCalled:[],params:e.params,decls:e.decls,body:t}},_=e=>({...F(),kind:`Process`,col:e.col,line:e.line,name:e.name,fairness:0,minusLabels:[],plusLabels:[],proceduresCalled:[],isEq:e.isEq,id:e.id,decls:e.decls,body:h(e.body,`Done`)}),v=t.prcds.map(g);return t.kind===`Uniprocess`?{...F(),kind:`Uniprocess`,col:t.col,line:t.line,name:t.name,decls:t.decls,defs:t.defs,macros:[],prcds:v,body:h(t.body,`Done`)}:{...F(),kind:`Multiprocess`,col:t.col,line:t.line,name:t.name,decls:t.decls,defs:t.defs,macros:[],prcds:v,procs:t.procs.map(_)}},vn=(t,n)=>{let r=n?[]:[`pc`];if(r.push(...t.decls.map(e=>e.var)),t.prcds.length>0&&r.push(`stack`),t.prcds.forEach(e=>{r.push(...e.params.map(e=>e.var)),r.push(...e.decls.map(e=>e.var))}),t.kind===`Multiprocess`&&t.procs.forEach(e=>r.push(...e.decls.map(e=>e.var))),r.length===0)throw new e.s(`The algorithm has no variables.`);let i=(e,t)=>{let n=r.indexOf(t);return n===-1?0:(e[n]+=1,e[n])},a=(e,t)=>t.forEach((t,n)=>{e[n]=Math.max(e[n],t)}),o=e=>[...e].sort((e,t)=>e.lhs.var<t.lhs.var?-1:+(e.lhs.var>t.lhs.var)),s=(t,n)=>{let s=[...n];t.ass=o(t.ass),new Set(t.ass.map(e=>e.lhs.var)).forEach(n=>{let a=t.ass.filter(e=>e.lhs.var===n);if(!r.includes(n))throw new e.s(`Assignment to undeclared variable ${n}`,a[0]);let o=a.some(e=>e.lhs.sub.tokens.length===0);if(i(s,n)>1||a.length>1&&o)throw new e.s(`Multiple assignment to ${n}`,t)}),a(n,s)},c=(t,n)=>{switch(t.kind){case`Assign`:s(t,n);return;case`If`:{let e=[...n],r=[...n];t.Then.forEach(t=>c(t,e)),t.Else.forEach(e=>c(e,r)),a(n,e),a(n,r);return}case`Either`:{let e=[...n];t.ors.forEach(t=>{let r=[...n];t.forEach(e=>c(e,r)),a(e,r)}),a(n,e);return}case`With`:t.Do.forEach(e=>c(e,n));return;case`When`:case`PrintS`:case`Assert`:case`Skip`:return;default:throw new e.o(`Unexpected AST type ${t.kind}`)}},l=e=>e.forEach(e=>{let t=r.map(()=>0);$e(e).stmts.forEach(e=>c(e,t))});t.prcds.forEach(e=>l(e.body)),(t.kind===`Uniprocess`?[t.body]:t.procs.map(e=>e.body)).forEach(l)},yn=(e,t,n,r)=>{let i=Xt(e);Zt(i)&&r(`Warning: symbols were renamed.`),$t(e,i,r),vn(_n(e,i,t),t),n&&Qt(i)},bn=`[ \\t\\n\\x0B\\f\\r]`,xn=RegExp(`\\\\\\* BEGIN TRANSLATION${bn}+\\(${bn}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([pP]([lL][uU][sS])?[cC][aA][lL]\\))${bn}*(=${bn}*"(?<pcal>[0-9A-Fa-f]*)"|\\\\in${bn}*STRING)${bn}*\\/\\\\${bn}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([tT][lL][aA]\\+?\\))${bn}*(=${bn}*"(?<tla>[0-9A-Fa-f]*)"|\\\\in${bn}*STRING)${bn}*\\)`),Sn=e=>process.getBuiltinModule(`node:zlib`).crc32(Buffer.from(e,`utf8`)).toString(16),Cn=(e,t)=>e.log(`\nUnrecoverable error:\n -- ${t}.\n`),wn=(e,t)=>Cn(e,t.node===void 0||t.node.line===0?t.message:`${t.message}\n at ${Qe(t.node)}`),Tn=e=>e.map(e=>`${Array.from(e).reduce((e,t)=>t===` `?e+` `.repeat(8-e.length%8):e+t,``)} `),En=(e,t,n,r)=>{for(let i=Math.max(t,0);i<e.length;i++){let t=e[i],a=t.indexOf(n);if(a===-1)continue;let o=a+n.length,s=t.slice(o).search(/[^ ]/);if(s!==-1&&o+s===t.indexOf(r))return i}return-1},Dn=(e,t)=>{for(;t.line<e.length;){let n=e[t.line];for(;t.column<n.length&&n[t.column]===` `;)t.column+=1;if(t.column<n.length)return n;t.line+=1,t.column=0}return``},On=(e,t,n)=>{let r=Array.from(e.slice(t)).findIndex(e=>n.includes(e));return r===-1?e.length:t+e.slice(t,t+r).length},kn=e=>/^[\p{L}\p{Nd}_]$/u.test(e),An=(e,t,n)=>{for(;t.line<e.length;){let r=Dn(e,t);if(r.slice(t.column).startsWith(n)){let e=t.column+n.length;if(e>=r.length||!/^[\p{L}_]$/u.test(r[e]))return t.column=On(r,e,` `),!0}t.column=On(r,t.column,` `)}return!1},jn=(e,t)=>Cn(e,`Command-line error: ${t}`),Mn=(e,t)=>{let n=e.params,r=!0,i=!1,a=t=>(r&&=(n.fairnessOption=``,!1),n.fairnessOption===``?(n.fairnessOption=t,!0):(jn(e,`Can only have one of -wf, -sf, -wfNext, and -nof options`),!1));for(let r=0;r<t.length;r++){let o=t[r],s=t[r+1];switch(o){case`-spec`:case`spec`:case`-myspec`:case`myspec`:{let t=o.endsWith(`myspec`);if(n[t?`myspecOption`:`specOption`]=!0,n.specOption&&n.myspecOption){jn(e,`
30
+ Can have at most one of the options -spec, -myspec, -spec2, -myspec2, writeAST`);return}if(s===void 0){jn(e,`Specification name must follow \`-${t?`myspec`:`spec`}' option`);return}r+=1;continue}case`-termination`:case`termination`:n.checkTermination=!0;continue;case`-noold`:case`-nocfg`:case`-noDoneDisjunct`:case`noDoneDisjunct`:continue;case`-wf`:case`wf`:case`-sf`:case`sf`:case`-wfNext`:case`wfNext`:case`-nof`:case`nof`:if(!a(o.replace(/^-/,``)))return;o.endsWith(`nof`)&&(i=!0);continue;case`-label`:case`label`:n.labelFlag=!0;continue;case`-labelRoot`:case`labelRoot`:if(s===void 0){jn(e,"Label root must follow `-labelRoot' option");return}if(!/^[a-zA-Z][a-zA-Z0-9_]*$/.test(s)){jn(e,`Label root must be a valid PlusCal identifier (must start with a letter and contain only letters, numbers, and underscores)`);return}n.labelRoot=s,r+=1;continue;case`-version`:case`version`:{if(s===void 0){jn(e,"Version number must follow `-version' option");return}let t=Xe(s);if(t<0||t>1903){Cn(e,t<0?`Illegal version ${s} specified.`:`Specified version ${s} later than current version 1.12`),jn(e,`Bad version number`);return}n.inputVersionNumber=t,r+=1;continue}case`-lineWidth`:if(!/^[+-]?\d+$/.test(s??``)||Number(s)<60){jn(e,"Integer value at least 60 must follow `-lineWidth' option");return}r+=1;continue;default:jn(e,`Unknown or illegal option in options statement: ${o}`);return}}n.checkTermination&&n.fairnessOption===``&&!i&&(n.fairnessOption=`wf`)},Nn=(e,t,n)=>{if(Dn(t,n),n.column+=7,!Dn(t,n).slice(n.column).startsWith(`(`)){Cn(e,"`PlusCal options' not followed by '('");return}n.column+=1;let r=[];for(;;){let e=Dn(t,n);if(n.line>=t.length||e[n.column]===`)`)break;if(e[n.column]===`,`){n.column+=1;continue}let i=On(e,n.column,` ,)`);r.push(e.slice(n.column,i)),n.column=i}n.line>=t.length?Cn(e,`No closing ')' found in options statement`):Mn(e,r)},Pn=(t,n,r)=>{let i=0,a=!1,o=!1;for(let s=n;!a&&s<t.length;s++){let c=t[s],l=s===n?r:0,u=[c.slice(0,l)];o=!1;for(let e=l;!a&&e<c.length;e++){let t=c[e],n=c.slice(e,e+2);if(n===`(*`&&!o)i+=1,u.push(` `),e+=1;else if(n===`*)`&&!o&&i===0)u.push(n),a=!0;else if(n===`*)`&&!o)--i,u.push(` `),e+=1;else if(i>0)u.push(` `);else if(o&&t===`\\`&&n.length===2)u.push(n),e+=1;else{if(!o&&n===`\\*`){u.push(` `);break}t===`"`&&(o=!o),u.push(t)}}if(o)return new e.s(`Unterminated string in line ${s+1}`);t[s]=u.join(``)}},Fn=(t,n)=>{let r=10*2**Math.max(0,Math.ceil(Math.log2(n/10)));throw new e.c(`java.lang.ArrayIndexOutOfBoundsException: Index ${t} out of bounds for length ${r}`)},In=(t,n,r)=>{if(!n.some(e=>e.indexOf(`algorithm`)>0))return/* @__PURE__ */ new Set([`NO_PLUSCAL_EXISTS`]);let i=Tn(n),a={line:0,column:0};for(;An(i,a,`PlusCal`);){let e=Dn(i,a).slice(a.column),n=Array.from(e).findIndex(e=>!kn(e));if(e.startsWith(`options`)&&(n===-1?e.length:n)===7){Nn(t,i,a);break}}let o=0,s=-1,c=!1;for(;o<i.length;o++){let e=i[o];if(/^=+$/.test(e))break;let t=e.indexOf(`--algorithm`),n=e.indexOf(`--fair`);if(t!==-1){s=t+11;break}if(n!==-1){s=n+6,c=!0;break}}let l=/* @__PURE__ */ new Set,u=En(i,0,`BEGIN`,`TRANSLATION`);u===-1&&l.add(`NO_TRANSLATION_EXISTS`);let d=En(i,u+1,`END`,`TRANSLATION`);if(d===-1&&l.add(`NO_TRANSLATION_EXISTS`),u===-1&&d===-1)return l;if(s===-1)return l.add(`NO_PLUSCAL_EXISTS`),l;let f=Pn(i,o,s);if(f!==void 0)return wn(t,f),/* @__PURE__ */ new Set([`ERROR_ENCOUNTERED`]);let p;try{let e=Vt(t,yt(i,o,s),c);p=e.ast,yn(e.ast,e.shouldOmitPC,e.hasDefaultInitialization,t.log)}catch(n){if(!(n instanceof e.s))throw n;wn(t,n)}u===-1&&Fn(-1,i.length);let m=xn.exec(i[u]);if(m===null)return l.add(`NO_PCAL_CHECKSUMS_EXIST`),l;let h=m.groups?.pcal,g=c&&r!==`1.7.4`?`fair`:p===void 0?void 0:vt(p,t.params.inputVersionNumber,r);h!==void 0&&(g===void 0||h!==Sn(g))&&l.add(`PCAL_DIVERGENCE_EXISTS`);let _=m.groups?.tla;if(_!==void 0){if(d===-1)throw new e.c(`java.lang.IllegalArgumentException: fromIndex(${u+1}) > toIndex(-1)`);let t=n.slice(u+1,d).join(``);_!==Sn(t)&&l.add(`TLA_DIVERGENCE_EXISTS`)}return l.size===0?/* @__PURE__ */ new Set([`NO_DIVERGENCE`]):l},Ln=[[`STRING`,0,0,[],[]],[`FALSE`,0,0,[],[]],[`TRUE`,0,0,[],[]],[`BOOLEAN`,0,0,[],[]],[`=`,2,0,[2,2],[1,1]],[`/=`,2,0,[2,2],[1,1]],[`.`,2,0,void 0,void 0],[`'`,1,2,[1],[0]],[`\\lnot`,1,0,[3],[1]],[`\\neg`,1,0,void 0,void 0],[`\\land`,2,0,[3,3],[1,1]],[`\\lor`,2,0,[3,3],[1,1]],[`\\equiv`,2,0,[3,3],[1,1]],[`=>`,2,0,[3,3],[1,1]],[`SUBSET`,1,0,[2],[1]],[`UNION`,1,0,[2],[1]],[`DOMAIN`,1,0,[2],[1]],[`\\subseteq`,2,0,[2,2],[1,1]],[`\\in`,2,0,[2,2],[1,1]],[`\\notin`,2,0,[2,2],[1,1]],[`\\`,2,0,[2,2],[1,1]],[`\\intersect`,2,0,[2,2],[1,1]],[`\\union`,2,0,[2,2],[1,1]],[`\\times`,2,0,[2,2],[1,1]],[`~>`,2,3,[3,3],[0,0]],[`[]`,1,3,[3],[0]],[`<>`,1,3,[3],[0]],[`ENABLED`,1,1,[2],[0]],[`UNCHANGED`,1,2,[1],[0]],[`\\cdot`,2,2,[2,2],[0,0]],[`-+->`,2,3,[3,3],[0,0]],[`$AngleAct`,2,2,[2,1],[0,0]],[`$BoundedChoose`,-1,0,[2],[1]],[`$BoundedExists`,-1,0,[3],[1]],[`$BoundedForall`,-1,0,[3],[1]],[`$CartesianProd`,-1,0,[2],[1]],[`$Case`,-1,0,[3],[1]],[`$ConjList`,-1,0,[3],[1]],[`$DisjList`,-1,0,[3],[1]],[`$Except`,-1,0,[2],[1]],[`$FcnApply`,2,0,[2,2],[1,1]],[`$FcnConstructor`,-1,0,[3],[1]],[`$IfThenElse`,3,0,[3,3,3],[1,1,1]],[`$NonRecursiveFcnSpec`,1,0,[3],[1]],[`$Pair`,2,0,[3,3],[1,1]],[`$RcdConstructor`,-1,0,[3],[1]],[`$RcdSelect`,2,0,[2,0],[1,1]],[`$RecursiveFcnSpec`,1,0,[3],[1]],[`$Seq`,-1,0,[2],[1]],[`$SetEnumerate`,-1,0,[2],[1]],[`$SetOfAll`,-1,0,[2],[1]],[`$SetOfFcns`,-1,0,[2],[1]],[`$SetOfRcds`,-1,0,[2],[1]],[`$SF`,2,3,[1,2],[0,0]],[`$SquareAct`,2,2,[2,1],[0,0]],[`$SubsetOf`,1,0,[2],[1]],[`$TemporalExists`,1,3,[3],[0]],[`$TemporalForall`,1,3,[3],[0]],[`$TemporalWhile`,2,3,[3,3],[0,0]],[`$Tuple`,-1,0,[2],[1]],[`$UnboundedChoose`,1,0,[2],[1]],[`$UnboundedExists`,1,0,[3],[1]],[`$UnboundedForall`,1,0,[3],[1]],[`$WF`,2,3,[1,2],[0,0]],[`$Nop`,1,0,[3],[1]],[`$Qed`,0,0,[],[]],[`$Pfcase`,1,0,[3],[1]],[`$Have`,1,0,[3],[1]],[`$Take`,1,0,[3],[1]],[`$Pick`,1,0,[3],[1]],[`$Witness`,-1,0,[2],[1]],[`$Suffices`,1,0,[3],[1]]],Rn={file:`--TLA+ BUILTINS--`,beginLine:0,beginColumn:0,endLine:0,endColumn:0},z=e=>({id:e,levelChecked:0,level:0,levelParams:/* @__PURE__ */ new Set,allParams:/* @__PURE__ */ new Set,nonLeibnizParams:/* @__PURE__ */ new Set,argLevelParams:/* @__PURE__ */ new Map,levelCorrect:!0,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map}),zn=e=>Ln.map(([t,n,r,i,a])=>{let o=e(),s=n<0?void 0:Array.from({length:n},(t,n)=>({...z(e()),kind:`FormalParam`,name:`Formal_${n}`,arity:0,location:void 0})),c=i!==void 0&&a!==void 0,l=a?.map(e=>e>0);return{...z(o),levelChecked:c?99:0,level:r,kind:`OpDef`,defKind:`BuiltIn`,name:t,arity:n,params:s,body:void 0,isLocal:!1,location:Rn,module:void 0,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:n<0?(a??[]).slice(0,1):a??[],isLeibnizArg:c?l:void 0,isLeibniz:l?.every(Boolean)??!0,opLevelCond:void 0,maxLevels:n<0?(i??[]).slice(0,1):i??[],minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0}}),Bn=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},Vn=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,Hn=e=>e?.kind===`OpAppl`&&e.nullKind===`absent`,Un=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),Wn=(e,t)=>(e&2147483647)%t,Gn=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[Wn(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},Kn=(e,n,r=n)=>e.buckets[Wn(t.Zt(r),e.buckets.length)].find(e=>e.key===n)?.value,qn=(e,n,r,i=n)=>{let a=t.Zt(i),o=e.buckets[Wn(a,e.buckets.length)].find(e=>e.key===n);o?o.value=r:(e.count>=e.threshold&&Gn(e),e.buckets[Wn(a,e.buckets.length)].unshift({hash:a,key:n,value:r}),e.count++)},Jn=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),Yn=`\0module `,B=()=>({table:Un(),symbols:[]}),Xn=e=>e.kind===`Module`?Yn+e.name:e.name,Zn=(e,t)=>{qn(e.table,Xn(t),t,t.name),e.symbols.push(t)},Qn=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,$n=(e,t)=>Kn(e.table,t),er=(e,t)=>Kn(e.table,Yn+t,t),tr=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),nr=(e,t)=>Jn(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),rr=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),ir=/* @__PURE__ */ new Map([[`$Qed`,`QED step`],[`$Pfcase`,`CASE`],[`$Have`,`HAVE`],[`$Take`,`TAKE`],[`$Pick`,`PICK`],[`$Witness`,`WITNESS`],[`$Suffices`,`SUFFICES`]]),ar=e=>{if(e.length>3&&e.endsWith(`!!!`))return[...ar(e.slice(0,-3)),`!!`];let t=e.split(`!`);return t.some(e=>e.length===0)?[e]:t},or=e=>{switch(e.kind){case`Identifier`:return ar(e.name).map(e=>({op:`Name`,name:e,args:void 0}));case`Apply`:{let t=ar(e.operator),n=e.argumentCounts??t.map((n,r)=>r===t.length-1?e.args.length:0),r=0;return t.map((t,i)=>{let a=e.args.slice(r,r+n[i]);return r+=n[i],{op:`Name`,name:t,args:a.length>0?a:void 0}})}case`Subexpression`:return e.selectors.map(e=>{switch(e.kind){case`Name`:return{op:`Name`,name:e.name,args:e.args.length>0?e.args:void 0};case`Operand`:return{op:e.operand,name:String(e.operand),args:void 0};case`Bound`:return{op:`Null`,name:`!(...)`,args:e.args};case`At`:return{op:`@`,name:`@`,args:void 0};case`Colon`:return{op:`:`,name:`:`,args:void 0}}})}},sr=e=>{let t=e[e.length-1];return t.op!==`Name`||t.args===void 0},cr=e=>typeof e.op==`number`?`argument selector ${e.name}`:e.name,lr=(e,t)=>typeof e==`number`?e>0&&e<=t?e:-1:e===`<<`?t>0?1:-1:e===`>>`&&t===2?2:-1,ur=e=>e.kind===`OpDecl`||e.kind===`FormalParam`||e.kind===`OpDef`&&(e.defKind===`BuiltIn`||e.defKind===`NumberedProofStep`),dr=e=>e.kind===`FormalParam`||e.kind===`OpDecl`||e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`||e.kind===`Module`,fr=e=>(e.bounded?.length??0)>0?(e.bounded??[]).flat():e.unbounded??[],pr=(e,t)=>e===void 0?t:{...e,endLine:t.endLine,endColumn:t.endColumn},mr=e=>(t,n,r,i,a)=>{let o=[],s=[],c=[],l={name:void 0,nameLocation:void 0,node:void 0,index:0,mode:`FindingOpName`,previousMode:void 0,letInContext:void 0,definitionArityFound:0,definitionArgs:[],isInSuffices:!1},u=()=>t[l.index].location??a,d=e=>e.args??[];for(;l.index<t.length;){let f=t[l.index];if((f.op!==`Name`&&f.op!==`Null`||n!==0)&&f.args!==void 0)return e.addError(u(),`Selector \`${f.name}' should not have argument(s).`);switch(l.mode){case`FindingOpName`:{let f,p,m=[];for(;f===void 0&&l.index<t.length;){let n=t[l.index];if(p=n.op===`Name`?l.name===void 0?e.resolveSynonym(n.name):`${l.name}!${e.resolveSynonym(n.name)}`:void 0,l.name===void 0&&n.op!==`Name`)return e.addError(u(),`Need name or step number here, not \`${n.name}'.`);p!==void 0&&(f=l.letInContext===void 0?e.resolveSymbol(p):$n(l.letInContext,p)),f===void 0&&(p!==void 0&&(l.name=p,l.nameLocation=pr(l.nameLocation,u())),m.push(...d(n)),l.index++)}if(f===void 0&&e.version===`1.7.4`){let n=t.length-1;return e.addError(t[n].location??a,`Unknown operator: \`${cr(t[n])}'.`)}if(f===void 0)return e.addError(l.nameLocation??a,`Unknown operator: \`${l.name}'.`);if(f.kind===`Module`)return e.addError(u(),`Module name (${t[l.index].name}) not allowed here.`);if(l.node=f,l.nameLocation=pr(l.nameLocation,u()),l.name=p,ur(f)&&t.length!==1)return e.addError(u(),`Cannot take subexpression of \`${l.name}'.`);let h=Qn(f);if(n===0){if(m.push(...d(t[l.index])),l.definitionArityFound+m.length!==h)return e.addError(t[l.index].argsLocation??a,`The operator ${l.name} requires ${h-l.definitionArityFound} arguments.`);m.forEach((t,n)=>l.definitionArgs.push(e.generateArgument(f,n+l.definitionArityFound,t,u())))}if(l.definitionArityFound=h,f.kind===`OpDef`&&f.defKind===`ModuleInstance`){if(l.index===t.length-1&&!(i||r))return e.addError(u(),`Operator name ${l.name} is incomplete.`)}else{let n=f.kind===`OpDef`&&f.defKind===`UserDefined`||f.kind===`ThmOrAssumpDef`?f:void 0;if(f.kind===`OpDef`&&f.defKind===`UserDefined`&&!f.isDefined&&t.length!==1)return e.addError(u(),`Subexpression of \`${l.name}' used inside the operator's definition.`);if(l.index!==t.length-1&&n!==void 0){s.push(...n.params??[]),l.name=void 0,l.nameLocation=void 0,l.mode=t[l.index+1].op===`Name`?`FollowingLabels`:`FindingSubExpr`,c.push(...l.definitionArgs),l.definitionArityFound=0,l.definitionArgs=[];let e=n.body;for(;e?.kind===`SubstIn`;)o.push(e),e=e.body;for(;e?.kind===`APSubstIn`;)o.push(e),e=e.body;l.mode===`FindingSubExpr`&&(l.node=e)}}l.previousMode=`FindingOpName`;break}case`FollowingLabels`:{let r=l.node,i=r?.kind===`OpDef`||r?.kind===`ThmOrAssumpDef`||r?.kind===`Label`?r.labels.get(f.name):void 0;if(i===void 0)return e.addError(u(),`Cannot find label \`${f.name}'.`);if(l.node=i,e.isOutOfLabelScope(i))return e.addError(u(),`Accessing subexpression labeled \`${f.name}' of ASSUME/PROVE clause within the scope of a declaration\n from outside that declaration's scope.`);if(n===0){if(i.params.length!==d(f).length)return e.addError(u(),`Label \`${f.name}' used with wrong number of arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...i.params),l.index<t.length-1&&t[l.index+1].op!==`Name`&&(l.mode=`FindingSubExpr`),l.mode===`FindingSubExpr`&&(l.node=i.body),l.previousMode=`FollowingLabels`;break}case`FindingSubExpr`:{let n=l.node,r=()=>e.addError(u(),`Nonexistent operand specified by \`${cr(f)}'.`);if(f.op===`:`){if(!(l.previousMode!==`FindingSubExpr`&&(l.index===t.length-1&&l.previousMode===`FindingOpName`||l.index<t.length-1&&t[l.index+1].op===`Name`)))return e.addError(u(),`\`!:' can be used only after a name and either at the end after an
31
+ operator name or before an operator name.`)}else if(n===void 0)return e.addError(u(),`Subexpression selection failed, probably due to an error in the selected expression.`);else if(n.kind===`LetIn`){if(lr(f.op,1)!==1)return e.addError(u(),`A LET/IN expression has only one operand.`);l.node=n.body}else if(n.kind===`OpAppl`){let i=n.operator,a=n.operands,o=i.kind===`FormalParam`||i.kind===`OpDecl`&&i.declKind===2||i.kind===`OpDef`&&i.defKind===`UserDefined`,p=()=>e.addError(u(),`Internal error: Expecting $Pair and didn't find it.`),m=e=>e?.kind===`OpAppl`&&e.operator.name===`$Pair`,h=lr(f.op,a.length);if(o){let e=lr(f.op,i.arity);if(e===-1)return r();l.node=a[e-1]}else if(i.kind===`OpDef`&&i.defKind===`BuiltIn`){if(i.name===`$RcdConstructor`||i.name===`$SetOfRcds`){if(h===-1)return r();let e=a[h-1];if(!m(e))return p();l.node=e.operands[1]}else if(i.name===`$Case`){if(l.index===t.length-1)return e.addError(u(),`Subexpression of CASE must have form !i!j.`);if(h===-1)return r();let n=a[h-1];if(!m(n))return p();l.index++;let i=lr(t[l.index].op,2);if(i===-1)return e.addError(u(),`Second selector for CASE subexpression must specify one of two operands.`);if(l.node=n.operands[i-1],l.node===void 0)return e.addError(u(),`Selecting OTHER in a CASE statement.`)}else if(i.name===`$Except`){if(h>1)return e.addError(u(),`Selecting subexpression of an EXCEPT not yet implemented.`);if(h===-1)return r();l.node=a[h-1]}else if((n.bounded?.length??0)===0&&(n.unbounded?.length??0)===0){if(h===-1)return r();l.node=a[h-1]}else if(f.op===`Null`||f.op===`@`){let t=fr(n);if(s.push(...t),f.op===`Null`){if(d(f).length!==t.length)return e.addError(u(),`Selector with ${d(f).length} argument(s) used for quantifier with ${t.length} bound identifier(s).`);c.push(...d(f).map(e.generateExpression))}l.node=a[0]}else{let e=lr(f.op,n.ranges.length);if(e===-1)return r();l.node=n.ranges[e-1]}}else return e.addError(u(),`Choosing operand \`${f.name}' of subexpression with no operands.`)}else if(n.kind===`AssumeProve`){if(n.isSuffices&&!l.isInSuffices){if(lr(f.op,1)!==1)return e.addError(u(),`Accessing non-existent subexpression of a SUFFICES`);l.isInSuffices=!0}else{l.isInSuffices=!1;let i=lr(f.op,1+n.assumptions.length);if(i===-1)return r();if(e.isOutOfClauseScope(n,i))return e.addError(u(),`Accessing ASSUME/PROVE clause within the scope of a declaration
32
+ from outside that declaration's scope.`);if(i<=n.assumptions.length){if(l.node=n.assumptions[i-1],l.node.kind===`NewSymb`&&l.index!==t.length-1)return e.addError(u(),`Selected a subexpression of a NEW clause of an ASSUME.`)}else l.node=n.goal}}else if(n.kind===`OpArg`){let t=n.op;if(t.kind!==`OpDef`||t.name!==`LAMBDA`)return e.addError(u(),`Trying to select subexpression of an operator argument.`);if(f.op!==`Null`&&f.op!==`@`)return e.addError(u(),`Cannot use !${f.name} to select subexpression of a LAMBDA.`);if(f.op===`Null`){if(t.arity!==d(f).length)return e.addError(u(),`Selector with ${d(f).length} arguments used for LAMBDA expression taking ${t.arity} arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...t.params??[]),l.node=t.body}else if(n.kind===`Label`)l.node=n.body,l.index--;else return e.addError(u(),`Selecting subexpression of expression that has none.`);if(l.node===void 0)return e.addError(u(),`An unexpected null node specified by '${f.name}'.\nThis is probably due to a previous error.`);if(l.index!==t.length-1){let n=t[l.index+1];if(n.op===`Name`){for(;l.node?.kind===`Label`;)l.node=l.node.body;if(l.node?.kind!==`LetIn`)return e.addError(u(),`A name selector here must be from a LET clause.`);l.letInContext=l.node.context,l.mode=`FindingOpName`}else if(n.op===`:`)return e.addError(u(),`!: should not follow an operand selector.`)}l.previousMode=`FindingSubExpr`;break}}l.index++}let f=l.node;if(f===void 0)return e.addError(a,`Subexpression selection failed, probably due to an error in the selected expression.`);if(f.kind===`AssumeProve`||f.kind===`NewSymb`)return r?f:e.addError(a,f.kind===`AssumeProve`?`Selected ASSUME/PROVE instead of expression.`:`Selected a NEW declaration as an expression or operator.`);if(n<0){let t=f.kind===`OpDef`&&(f.defKind===`UserDefined`||f.defKind===`NumberedProofStep`||f.defKind===`ModuleInstance`&&i)||f.kind===`ThmOrAssumpDef`;return l.previousMode!==`FindingOpName`||!t?e.addError(a,`DEF clause entry should describe a defined operator.`):f.kind===`OpDef`&&f.step!==void 0&&f.step.kind!==`DefStep`?e.addError(a,`DEF clause entry refers to a non-definition step.`):f}if(f.kind===`OpDef`&&f.defKind===`NumberedProofStep`)return e.addError(a,r?`Step number of non-fact used as a fact`:`Step number of non-expression step used as an expression.`);if(n>0){let t=s.length+(f.kind===`OpArg`?Qn(f.op):l.previousMode===`FindingOpName`&&dr(f)?Qn(f):0);if(n!==t)return e.addError(a,`Expected arity ${n} but found operator of arity ${t}.`)}let p=f;if(l.previousMode===`FindingOpName`&&s.length+o.length>0){if(p.kind!==`OpDef`&&p.kind!==`ThmOrAssumpDef`)return e.addError(t[t.length-1].location??a,`Internal Error: Found unexpected node kind after FindingOpName`);c.push(...l.definitionArgs);let n=(p.params??[]).map(t=>{let n=e.createFormalParam(t.name,t.arity,t.location);return s.push(n),t.arity===0?e.createOpAppl(n,[],a):e.createOpArg(n,a)});p=e.createOpAppl(p,n,a)}if(p.kind===`OpArg`){if(n===0)return e.addError(a,`Selected operator argument when expression expected.`);if(s.length+o.length>0){let t=p.op;s.push(...Array.from({length:Qn(t)},(t,n)=>e.createFormalParam(`NewParam${n}`,0,void 0))),p=e.createOpAppl(t,l.definitionArgs,a)}}if(!r){if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`AssumeProve`)return e.addError(a,`ASSUME/PROVE used where an expression is required.`);if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`OpAppl`){let t=ir.get(p.body.operator.name);if(t!==void 0)return e.addError(a,`${t} proof step selected instead of expression.`)}}if(p.kind===`FormalParam`||p.kind===`OpDecl`||p.kind===`ThmOrAssumpDef`||p.kind===`OpDef`&&(p.defKind===`UserDefined`||p.defKind===`BuiltIn`))return n>0?e.createOpArg(p,a):e.createOpAppl(p,l.definitionArgs,a);if(p.kind===`OpArg`)return p;if(p.kind===`OpDef`||p.kind===`Module`)return(r||i)&&p.kind===`OpDef`?p:e.addError(a,`Module instantiation selected instead of expression.`);let m=o.reduceRight((t,n)=>e.copySubstIn(n,t),p),h=s.length>0?e.createLambda(s,m,a):void 0;return n>0?h===void 0||s.length!==n?e.addError(a,`Expected operator argument with arity ${n} but found one of arity ${s.length}.`):e.createOpArg(h,a):s.length===c.length?h===void 0?e.createOpAppl(e.getBuiltin(`$Nop`),[m],a):e.createOpAppl(h,c,a):e.addError(a,`Expected ${s.length} arguments but found ${c.length}.`)},hr=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),gr=(e,t)=>`${e}:${t}`,_r=(e,n)=>{let r=t.rn(n).filter(e=>e.kind!==`End`).map(t.nn),i=[0,0];for(let e=0;e<n.length;e++)n[e]===`
33
+ `&&i.push(e+1);return{name:e,source:n,tokens:r,lineOffsets:i,tokenIndexes:new Map(r.map((e,t)=>[gr(e.line,e.column),t]))}},V=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,vr=(e,t,n)=>{let r=0,i=e.tokens.length;for(;r<i;){let a=r+i>>>1,o=e.tokens[a];o.line<t.line||o.line===t.line&&(n?o.column<=t.column:o.column<t.column)?r=a+1:i=a}return r},yr=(e,t)=>e.tokenIndexes.get(gr(t.line,t.column))??Math.min(vr(e,t,!1),e.tokens.length-1),br=(e,t)=>Math.max(vr(e,t,!0)-1,0),xr=(e,t)=>{let n=e.tokens[t].text,r=hr.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(V(e,a,n))i++;else if(V(e,a,r)&&(i--,i===0))return a;return t},Sr=(e,t)=>({start:yr(e,t.start),end:br(e,t.end)}),H=(e,t)=>{let n=t.location.range;if(n)return Sr(e,n);let r=yr(e,t.location);return{start:r,end:xr(e,r)}},Cr=(e,t)=>{let n=t.start-1,r=t.end+1;return V(e,n,`(`)&&V(e,r,`)`)&&xr(e,n)===r?Cr(e,{start:n,end:r}):t},wr=(e,t)=>{let n=t.start-1,r=t.end+1;return V(e,n,`(`)&&xr(e,n)===r&&(V(e,n-1,`(`)||V(e,n-1,`,`))?wr(e,{start:n,end:r}):t},U=(e,t)=>({file:e.name,beginLine:e.tokens[t.start].line,beginColumn:e.tokens[t.start].column,endLine:e.tokens[t.end].line,endColumn:e.tokens[t.end].endColumn}),W=(e,t)=>U(e,{start:t,end:t}),Tr=(e,n,r)=>{let i=0,a=e.lineOffsets[n];for(;a<e.source.length;){if(i=e.source[a]===` `?t.tn(i):i+1,i>=r)return a;a++}return a},Er=(e,t)=>{let n=e.tokens[t],r=Tr(e,n.line,n.column);return e.source.slice(r,Tr(e,n.line,n.endColumn)+1)},Dr=(e,t)=>{let n=e.tokens[t],r=e.tokens[t+1];return n?.kind===`Operator`&&n.text===`[]`&&r?.kind===`Keyword`&&(r.text===`ASSUME`||r.text===`PROVE`)&&r.line===n.line&&r.column===n.endColumn+1},Or=n=>{let r=_r(``,n),i=r.tokens.reduce((e,t,n)=>{if(!Dr(r,n))return e;let i=Tr(r,t.line,t.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},n);if(i!==n&&t.S(n)!==void 0)throw new e.F(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return i},kr=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:Tr(e,n.line,n.endColumn)+1,a=e.source.slice(i,Tr(e,r.line,r.column)),o=[],s=0;for(;s<a.length;)if(a.startsWith(`\\*`,s)){let e=a.indexOf(`
34
+ `,s),t=e===-1?a.length:e+1;o.push(a.slice(s,t)),s=t}else if(a.startsWith(`(*`,s)){let e=1,t=s,n=s+2;for(;e>0&&n<a.length;){let r=a.startsWith(`(*`,n),i=a.startsWith(`*)`,n);r||i?(e+=r?1:-1,n+=2,o.push(a.slice(t,n)),t=n):n++}t<n&&o.push(a.slice(t,n)),s=n}else s++;return o},Ar=(e,t,n,r)=>{let i=[];for(let a=t;a<n&&i.length<r.length;a++){let t=e.tokens[a];t.kind===`Identifier`&&t.text===r[i.length]&&i.push(a)}return i},jr=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(V(e,i,r))return i;return-1},Mr=new Map(t.dt.flatMap(([e,...t])=>t.map(t=>[t,e]))),Nr=e=>e.split(`!`).map(e=>Mr.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),Pr=e=>e[e.length-1],Fr=(e,t)=>{for(let n=e.length-1;n>=0;n--){let r=$n(e[n],t);if(r)return r}},Ir=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,Lr=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||Rr(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&Rr(n.module)}return!1},Rr=e=>nr(e,2).length===0&&nr(e,3).length===0,G=(e,t)=>{let n=Fr(e.contexts,t.name);if(n===t)return;if(n===void 0){Zn(Pr(e.contexts),t);return}let r=t.kind===`FormalParam`||Ir(n)!==Ir(t)||Qn(n)!==Qn(t);n.kind===`OpDef`&&n.defKind===`BuiltIn`&&!(r&&e.version===`1.7.4`)?e.addError(t.location,`Symbol ${t.name} is a built-in operator, and cannot be redefined.`):r?e.addError(t.location,`Multiply-defined symbol '${t.name}': this definition or declaration conflicts \nwith the one at ${Vn(n.location)}.`):Lr(t,n)||e.addWarning(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${Vn(n.location)}.`)},zr=e=>e.labelScopes.push({labels:/* @__PURE__ */ new Map,params:[]}),Br=e=>e.labelScopes.pop()?.labels??/* @__PURE__ */ new Map,Vr=(e,t)=>{let n=t.kind===`AssumeProve`?e.assumeProveScopes.get(t):void 0;n&&(n.isInProof=!1)},Hr=(e,t)=>U(e,H(e,t)),Ur=(e,t)=>t.range?Sr(e,t.range):{start:yr(e,t),end:yr(e,t)},Wr=(e,t)=>U(e,Ur(e,t)),Gr=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=er(e.contexts[n],t);if(r?.kind===`Module`)return r}return e.externalModules.get(t)},Kr=(t,n)=>{let r=Gr(t,n);if(r===void 0)throw new e.F(`Could not find module ${n}`);return r},qr=(e,t,n)=>{e.contexts.push(t);let r=n();return e.contexts.pop(),r},Jr=(e,t,n,r,i)=>{let a={...z(e.getId()),kind:`FormalParam`,name:t,arity:n,location:r};return i&&G(e,a),a},Yr=(e,t)=>({...z(e.getId()),kind:`OpDef`,defKind:`UserDefined`,arity:t.params?.length??0,params:[],body:void 0,isLocal:!1,module:e.currentModule,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:(t.params??[]).map(()=>0),isLeibnizArg:(t.params??[]).map(()=>!0),isLeibniz:!0,opLevelCond:void 0,maxLevels:(t.params??[]).map(()=>3),minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0,...t}),Xr=(e,t)=>{t.letInLevel=e.curLevel,e.unresolvedSum>0&&(t.recursiveSection=e.recursiveSectionCount,t.inRecursiveSection=e.unresolvedCount[e.curLevel]>0,e.currentModule.opDefsInRecursiveSection.push(t))},Zr=(e,t,n,r,i={},a=e.getId())=>({...z(a),kind:`OpAppl`,operator:t,operands:n,unbounded:i.unbounded,bounded:i.bounded,tupleOrs:i.tupleOrs,ranges:i.ranges??[],location:r}),Qr=e=>({...Zr(e,$r(e,`$Nop`),[],Rn,{},e.nullApplicationId),nullKind:`null`}),$r=(t,n)=>{let r=t.builtinsByName.get(n);if(!r)throw new e.B(`SANY has no builtin operator ${n}`);return r},K=(e,t,n,r,i={})=>Zr(e,$r(e,t),n,r,i),ei=(e,t,n)=>({...z(e.getId()),kind:`String`,value:t,location:n}),ti=(e,t,n)=>({...z(e.getId()),kind:`OpArg`,op:t,location:n}),ni=(t,n,r)=>{let i=Fr(t.contexts,Nr(n));if(i===void 0||i.kind===`Module`)throw new e.F(`Unknown operator: \`${n}' at line ${r.beginLine}, column ${r.beginColumn} of module ${r.file}`);return i},ri=(e,t,n,r)=>{if(t.kind!==`OpDef`||t.defKind!==`UserDefined`)return;let i=t.params??[];i.length===n.length?i.forEach((i,a)=>{let o=n[a];i.arity===0&&o.kind===`OpArg`&&e.addError(r,`Operator used in argument number ${a+1} has incorrect number of arguments.`);let s=o.kind===`OpArg`&&Qn(o.op)===i.arity&&!(o.op.kind===`OpDef`&&(o.op.params??[]).some(e=>e.arity>0));i.arity>0&&!s&&e.addError(r,`Argument number ${a+1} to operator '${t.name}' \nshould be a ${i.arity}-parameter operator.`)}):e.addError(r,`Wrong number of arguments (${n.length}) given to operator '${t.name}', \nwhich requires ${i.length} arguments.`)},ii=/* @__PURE__ */ new Map([[`Identifier`,`N_GeneralId`],[`Subexpression`,`N_GeneralId`],[`Number`,`N_Number`],[`Decimal`,`N_Real`],[`SetEnumeration`,`N_SetEnumerate`],[`SetFilter`,`N_SubsetOf`],[`SetMap`,`N_SetOfAll`],[`Tuple`,`N_Tuple`],[`FunctionApplication`,`N_FcnAppl`],[`FunctionConstruction`,`N_FcnConst`],[`FunctionSet`,`N_SetOfFcns`],[`Record`,`N_RcdConstructor`],[`RecordSet`,`N_SetOfRcds`],[`FieldAccess`,`N_RecordComponent`],[`Except`,`N_Except`],[`Prime`,`N_PostfixExpr`],[`Always`,`N_PrefixExpr`],[`Eventually`,`N_PrefixExpr`],[`Enabled`,`N_PrefixExpr`],[`Unchanged`,`N_PrefixExpr`],[`Forall`,`N_BoundedQuant`],[`Exists`,`N_BoundedQuant`],[`UnboundedQuantifier`,`N_UnboundedQuant`],[`Choose`,`N_UnBoundedOrBoundedChoose`],[`If`,`N_IfThenElse`],[`Case`,`N_Case`],[`Let`,`N_LetIn`],[`BoxAction`,`N_ActionExpr`],[`AngleAction`,`N_ActionExpr`],[`WeakFairness`,`N_FairnessExpr`],[`StrongFairness`,`N_FairnessExpr`]]),ai=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),oi=(e,t)=>V(e,t.start,`(`)&&xr(e,t.start)===t.end,si=(e,t)=>Cr(e,H(e,t)),ci=(e,t,n)=>si(e,t.args[0]).start===n.start?t.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:e.tokens[n.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,li=(e,t,n)=>oi(e,n)?`N_ParenExpr`:t.kind===`String`?Er(e,n.start):t.kind===`Apply`?ci(e,t,n):ii.get(t.kind),ui=(e,t,n)=>{if(t.kind===`String`&&!oi(e,n))return!1;if(t.kind===`Identifier`&&!t.name.includes(`!`))return!0;let r=li(e,t,n);return r===void 0||ai.has(r)?void 0:!0},di=(e,t,n)=>{let r=(t,n=si(e,t))=>({last:n,lastKind:li(e,t,n)});if(oi(e,n))return{hasChildlessFirstChild:!1,...r(t,{start:n.start+1,end:n.end-1})};switch(t.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...r(t.kind===`If`?t.condition:t.action)};case`Tuple`:case`SetEnumeration`:{let i=t.elements[0];return i===void 0?{hasChildlessFirstChild:!1,last:{start:n.end,end:n.end},lastKind:e.tokens[n.end].text}:{hasChildlessFirstChild:!1,...r(i)}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...r(t.expression,{start:n.start+1,end:n.end})};case`Prime`:return{hasChildlessFirstChild:ui(e,t.expression,si(e,t.expression)),last:{start:n.end,end:n.end},lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let n=t.kind===`FunctionApplication`?t.function:t.record,r=si(e,n),i=r.end+1;return{hasChildlessFirstChild:ui(e,n,r),last:{start:i,end:i},lastKind:e.tokens[i].text}}case`Apply`:{let i=ci(e,t,n);if(i===`N_OpApplication`)return t.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:{start:n.start+1,end:n.end},lastKind:`N_OpArgs`};if(i===`N_PrefixExpr`)return{hasChildlessFirstChild:!0,...r(t.args[0],{start:n.start+1,end:n.end})};let a=si(e,t.args[0]),o=a.end+1;return{hasChildlessFirstChild:ui(e,t.args[0],a),last:{start:o,end:o},lastKind:i===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`}}}},fi=(e,t)=>{let n=si(e.file,t);if((t.kind===`Identifier`||t.kind===`Subexpression`||t.kind===`OperatorReference`)&&!oi(e.file,n))return!1;let r=di(e.file,t,n);if(r?.hasChildlessFirstChild===void 0||r.lastKind===void 0)return!1;let i=U(e.file,r.last);return r.hasChildlessFirstChild&&e.addError(U(e.file,n),`Was expecting a GeneralId.`),r.lastKind===`N_OpArgs`?e.addError(i,"Selector `!(...)' should not have argument(s)."):(e.addError(i,`Unexpected token found.`),e.addError(i,`Need name or step number here, not \`${r.lastKind}'.`)),e.addError(U(e.file,n),`DEF clause entry should describe a defined operator.`),!0},pi=e=>/^[A-Za-z0-9_]+$/.test(e),mi=e=>e!==`!!`&&e.includes(`!`),hi=e=>BigInt(e.startsWith(`\\`)?`0${e.slice(1).replace(/^h/i,`x`)}`:e).toString(),gi=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),_i=e=>{let t=e.kind===`Apply`?or(e):void 0;return gi.has(e.kind)||t!==void 0&&sr(t)},vi=/* @__PURE__ */ new Set([`'`,`^+`,`^*`,`^#`]),yi=(e,t)=>vi.has(t)?`N_GenPostfixOp`:e.kind===`Lambda`||t===`~`||t===`-.`?`N_GenNonExpPrefixOp`:`N_GenInfixOp`,bi=(e,t,n)=>{let r=n.start;return t.map(t=>{let i=t.op===`Name`?t.name:t.op===`Null`?`(`:String(t.op),a=jr(e,r,n.end,i);if(a===-1)return t;if(t.op===`Null`){let n=xr(e,a);return r=n+1,{...t,location:U(e,{start:a,end:n})}}r=a+1;let o=W(e,a);if(t.args===void 0||!V(e,a+1,`(`))return{...t,location:o};let s=xr(e,a+1);return r=s+1,{...t,location:o,argsLocation:U(e,{start:a+1,end:s})}})},xi=(t,n,r,i,a)=>{let o=or(n);if(o===void 0)throw new e.F(`Expected a name, found ${n.kind}`);return t.selectorToNode(bi(t.file,o,H(t.file,n)),r,i,a,Hr(t.file,n))},Si=(t,n)=>{let r=xi(t,n,0,!1,!1);if(r.kind!==`OpAppl`)throw new e.F(`Expected an expression`);return r},Ci=(e,t)=>{if(t.kind!==`OpAppl`)return;let n=e.functions.find(e=>e.name===t.operator.name);n&&(n.node.operator=$r(e,`$RecursiveFcnSpec`))},wi=e=>e.reduce((e,t)=>{let n=e[e.length-1];return n!==void 0&&n[0].set===t.set&&t.pattern.kind===`Name`&&n[0].pattern.kind===`Name`?n.push(t):e.push([t]),e},[]),Ti=(e,t,n)=>Wi(e,t,n,wi(t).map(t=>q(e,t[0].set))),Ei=(e,t,n)=>{let r=e.labelScopes.at(-1);r?.params.push(t);let i=q(e,n);return r?.params.pop(),i},Di=(e,t,n,r,i,a)=>qr(e,B(),()=>{let o=Ti(e,n,r),s=Ei(e,o.bounded.flat(),i);return K(e,t,[s],a,o)}),Oi=(e,t)=>{let n=H(e.file,t),r=Ar(e.file,n.start,n.end,t.params);return qr(e,B(),()=>{let i=t.params.map((t,n)=>Jr(e,t,0,W(e.file,r[n]),!0)),a=Ei(e,i,t.body);return Yr(e,{name:`LAMBDA`,params:i,body:a,location:U(e.file,n),preComments:kr(e.file,n.start)})})},ki=(e,t)=>t.kind===`OperatorReference`?t.operator:t.kind===`Lambda`&&t.body.kind===`Apply`?t.body.operator:e.tokens[yr(e,t.location)].text,Ai=(t,n,r)=>{let i=Hr(t.file,n);if(n.kind===`Lambda`)return n.location.range!==void 0&&n.operator===void 0?ti(t,Oi(t,n),i):ti(t,ni(t,ki(t.file,n),i),i);if(!_i(n))return t.addError(i,`Arity ${r.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${r.name}'.`),Qr(t);if(n.kind===`OperatorReference`)return ti(t,ni(t,n.operator,i),i);let a=xi(t,n,r.arity,!1,!1);if(a.kind===`OpArg`||a.kind===`OpAppl`&&a.nullKind!==void 0)return a;throw new e.F(`Expected an operator argument at line ${i.beginLine}, column ${i.beginColumn}`)},ji=(t,n,r,i,a)=>{let o=n.kind===`OpDef`&&(n.defKind===`UserDefined`||n.defKind===`ModuleInstance`)?n.params?.[r]?.arity??0:0;if(o===0)return q(t,i);let s=H(t.file,i),c=U(t.file,s),l=`${r+1} (counting from 1)`,u=wr(t.file,s);if(u!==s||!_i(i))return t.addError(U(t.file,u),`An expression appears as argument number ${l} to operator '${n.name}', in a position an operator is required.`),Qr(t);if(i.kind===`Identifier`||i.kind===`Subexpression`||i.kind===`Apply`){let n=xi(t,i,o,!1,!1);if(n.kind===`OpArg`||n.kind===`OpAppl`)return n;throw new e.F(`Expected an operator argument at ${Vn(c)}`)}if(i.kind===`Lambda`&&i.location.range!==void 0&&i.operator===void 0){let e=Oi(t,i),s=Qn(e);return s===o?ti(t,e,c):(t.addError(a,`Lambda expression with arity ${s} used as argument ${r+1} of operator \`${n.name}', \nbut an operator of arity ${o} is required.`),Qr(t))}let d=ki(t.file,i),f=Fr(t.contexts,Nr(d));if(f===void 0)return t.addError(c,`Could not find declaration or definition of symbol '${d}'.`),Qr(t);let p=Qn(f);return p===o?ti(t,f,c):(t.addError(a,`Operator with incorrect arity passed as argument. \nOperator '${f.name}' of arity ${p} is argument number ${l} to operator \`${Vn(n.location)}', \nbut an operator of arity ${o} was expected.`),Qr(t))},Mi=(e,t)=>{let n=Hr(e.file,t);if(t.isBulleted)return K(e,t.kind===`And`?`$ConjList`:`$DisjList`,t.operands.map(t=>q(e,t)),n);let r=H(e.file,t),i=t.kind===`And`?`\\land`:`\\lor`,[a,...o]=t.operands;return o.reduce((t,n,a)=>{let s=si(e.file,n),c=a===o.length-1?r.end:s.end;return K(e,i,[t,q(e,n)],U(e.file,{start:r.start,end:c}))},q(e,a))},Ni=(e,t)=>{let n=H(e.file,t),r=t.arms.map((r,i)=>{let a=si(e.file,r.condition),o=i===t.arms.length-1&&t.other===void 0,s=si(e.file,r.body),c=[q(e,r.condition),q(e,r.body)];return K(e,`$Pair`,c,U(e.file,{start:a.start,end:o?n.end:s.end}))}),i=t.other;if(i){let t=si(e.file,i),a=Pi(e.file,t.start,`OTHER`);r.push(K(e,`$Pair`,[void 0,q(e,i)],U(e.file,{start:a,end:n.end})))}return K(e,`$Case`,r,U(e.file,n))},Pi=(e,t,n)=>{for(let r=t;r>=0;r--)if(V(e,r,n))return r;return t},Fi=(e,t)=>{let n=H(e.file,t),r=U(e.file,n),i=[q(e,t.function)],a=K(e,`$Except`,i,r),o=H(e.file,t.function),s=jr(e.file,o.end+1,n.end,`EXCEPT`)+1;return t.updates.forEach(t=>{let r=jr(e.file,s,n.end,`!`),o=si(e.file,t.value),c=U(e.file,{start:r,end:o.end}),l=r+1,u=t.path.map(t=>{if(t.kind===`Field`){let n=Ii(e.file,l,t.name);return l=n+1,ei(e,t.name,W(e.file,n))}let r=jr(e.file,l,n.end,`[`),i=xr(e.file,r);return l=i+1,t.args.length===1?q(e,t.args[0]):K(e,`$Tuple`,t.args.map(t=>q(e,t)),U(e.file,{start:r,end:i}))}),d=K(e,`$Seq`,u,c),f=K(e,`$Pair`,[d],c);e.exceptSpecStack.push(f),e.exceptStack.push(a),f.operands.push(q(e,t.value)),e.exceptSpecStack.pop(),e.exceptStack.pop(),i.push(f),s=o.end+1}),a},Ii=(e,t,n)=>{for(let r=t;r<e.tokens.length;r++)if(e.tokens[r].text===n&&e.tokens[r].kind!==`String`)return r;return t},Li=(e,t,n)=>{let r=H(e.file,n),i=r.start+1,a=n.fields.map((t,r)=>{let a=Ii(e.file,i,t.name),o=si(e.file,t.value);return i=o.end+1,n.fields.slice(0,r).some(e=>e.name===t.name)&&e.addError(W(e.file,a),`Non-unique fields in constructor.`),K(e,`$Pair`,[ei(e,t.name,W(e.file,a)),q(e,t.value)],U(e.file,{start:a,end:o.end}))}),o=K(e,t,a,U(e.file,r));return e.currentModule.records.push(o),o},Ri=(e,t)=>({line:e.tokens[t].line,column:e.tokens[t].column}),zi=(e,t)=>{let n=[],r=t;for(;e.tokens[r]?.kind===`Identifier`;){let t=V(e,r+1,`(`)?xr(e,r+1):r,i=e.tokens.slice(r+1,t).filter(e=>e.text===`_`).length;if(n.push({name:e.tokens[r].text,arity:i,location:{...Ri(e,r),range:{module:e.name,start:Ri(e,r),end:Ri(e,t)}}}),!V(e,t+1,`,`))break;r=t+2}return n},Bi=(e,t)=>{let n=[...t.definitions.map(t=>({unit:{kind:`Definition`,definition:t},span:qi(e,t)})),...(t.instances??[]).map(t=>({unit:{kind:`Instance`,instance:t},span:qi(e,t)}))],r=H(e,t).start,i=si(e,t.body).start,a=[];for(let t=r+1;t<i;t++){let r=n.some(e=>e.span.start<=t&&t<=e.span.end);V(e,t,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:zi(e,t+1)},span:{start:t,end:t}})}return[...n,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},Vi=(e,t)=>{let n=B();return qr(e,n,()=>{e.curLevel++,e.unresolvedCount[e.curLevel]=0;let r=[],i=[];Bi(e.file,t).forEach(t=>{t.kind===`Recursive`?Zi(e,t.declarations):t.kind===`Instance`?ta(e,t.instance,r,i):t.definition.kind===`Function`?Xi(e,t.definition,r):Ji(e,t.definition,r)}),Qi(e),e.curLevel=Math.max(e.curLevel-1,0);let a=q(e,t.body);return{...z(e.getId()),kind:`LetIn`,opDefs:r,instances:i,body:a,context:n,location:Hr(e.file,t)}})},Hi=(e,t)=>{let n=H(e.file,t),r=U(e.file,n);return qr(e,B(),()=>{let i=t.pattern,a=i.kind===`Name`?[i.name]:i.names;if(t.set===void 0){let o=Ar(e.file,n.start,n.end,a),s=a.map((t,r)=>Jr(e,t,0,W(e.file,i.kind===`Name`?n.start:o[r]),!0)),c=Ei(e,s,t.body);return K(e,`$UnboundedChoose`,[c],r,{unbounded:s})}let o=q(e,t.set),s=H(e.file,t.set),c=Ar(e.file,n.start,s.start,a),l=a.map((t,n)=>Jr(e,t,0,W(e.file,c[n]),!0)),u=Ei(e,l,t.body);return K(e,`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},Ui=(e,t)=>{if(pi(t.operator)||mi(t.operator)||t.args.length>2||Fr(e.contexts,Nr(t.operator))!==void 0)return;let n=H(e.file,t);if(e.file.tokens[n.start].text===t.operator&&V(e.file,n.start+1,`(`))return;let r=si(e.file,t.args[0]),i=t.args.length===1&&r.start!==n.start,a=i?n.start:r.end+1,o=Er(e.file,a);return{index:a,name:i&&o===`-`?`-.`:o,fixity:i?`prefix`:t.args.length===2?`infix`:`postfix`}},q=(e,t)=>{let n=Hr(e.file,t);switch(t.kind){case`Number`:return{...z(e.getId()),kind:`Numeral`,value:hi(t.text??String(t.value)),location:n};case`Decimal`:{let[r,i]=t.text.split(`.`),a=BigInt(r+i),o=a<=9223372036854775807n;return{...z(e.getId()),kind:`Decimal`,mantissa:a.toString(),exponent:String(o?-i.length:i.length),integralPart:r,fractionalPart:i,location:n}}case`String`:return ei(e,t.value,n);case`Identifier`:{let n=Si(e,t);return Ci(e,n),n}case`Apply`:{let r=Ui(e,t);if(r!==void 0)return e.addError(W(e.file,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),e.addError(n,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...Qr(e),nullKind:`absent`};let i=Si(e,t);return(mi(t.operator)||pi(t.operator))&&Ci(e,i),i}case`Bracket`:return e.addError(W(e.file,H(e.file,t).start),"Unsupported expression type `['."),{...Qr(e),nullKind:`absent`};case`OperatorReference`:case`Lambda`:{let r=e.file.tokens[H(e.file,t).start].text;return e.addError(n,r===`LAMBDA`?`LAMBDA expression used where an expression is required.`:`Unsupported expression type \`${yi(t,r)}'.`),{...Qr(e),nullKind:`absent`}}case`And`:case`Or`:return Mi(e,t);case`Prime`:return K(e,`'`,[q(e,t.expression)],n);case`Unchanged`:return K(e,`UNCHANGED`,[q(e,t.expression)],n);case`Enabled`:return K(e,`ENABLED`,[q(e,t.expression)],n);case`Always`:return K(e,`[]`,[q(e,t.expression)],n);case`Eventually`:return K(e,`<>`,[q(e,t.expression)],n);case`If`:return K(e,`$IfThenElse`,[q(e,t.condition),q(e,t.consequent),q(e,t.alternative)],n);case`Case`:return Ni(e,t);case`Let`:return Vi(e,t);case`Forall`:case`Exists`:return Di(e,t.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,t.bounds,H(e.file,t).start,t.body,n);case`UnboundedQuantifier`:{let r=H(e.file,t),i=H(e.file,t.body),a=Ar(e.file,r.start,i.start,t.names),o=t.isTemporal?t.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:t.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return qr(e,B(),()=>{let r=t.names.map((t,n)=>Jr(e,t,0,W(e.file,a[n]),!0)),i=Ei(e,r,t.body);return K(e,o,[i],n,{unbounded:r})})}case`Choose`:return Hi(e,t);case`SetEnumeration`:return K(e,`$SetEnumerate`,t.elements.map(t=>q(e,t)),n);case`Tuple`:return K(e,`$Tuple`,t.elements.map(t=>q(e,t)),n);case`SetFilter`:{let r=q(e,t.bound.set),i=H(e.file,t);return qr(e,B(),()=>{let a=Wi(e,[t.bound],i.start,[r]),o=Ei(e,a.bounded.flat(),t.predicate);return K(e,`$SubsetOf`,[o],n,a)})}case`SetMap`:return Di(e,`$SetOfAll`,t.bounds,H(e.file,t.expression).end+1,t.expression,n);case`FunctionConstruction`:return Di(e,`$FcnConstructor`,t.bounds,H(e.file,t).start,t.body,n);case`FunctionSet`:return K(e,`$SetOfFcns`,[q(e,t.domain),q(e,t.range)],n);case`Record`:return Li(e,`$RcdConstructor`,t);case`RecordSet`:return Li(e,`$SetOfRcds`,t);case`Except`:return Fi(e,t);case`ExceptAt`:{let t=e.exceptStack[e.exceptStack.length-1],r=e.exceptSpecStack[e.exceptSpecStack.length-1];return t===void 0||r===void 0?(e.addError(n,`@ used where its meaning is not defined.`),Qr(e)):{...z(e.getId()),kind:`At`,except:t,component:r,location:r.location}}case`FunctionApplication`:{let r=q(e,t.function);if(Hn(r))return r;Ci(e,r);let i=r.kind===`OpAppl`?r.operator:void 0,a=i?.kind===`OpDef`&&i.defKind===`UserDefined`?i.body:void 0;if(a?.kind===`OpAppl`&&(a.operator.name===`$NonRecursiveFcnSpec`||a.operator.name===`$RecursiveFcnSpec`)){let r=(a.bounded??[]).reduce((e,t,n)=>e+(a.tupleOrs?.[n]?1:t.length),0);if(t.args.length>=2&&r!==t.args.length)return e.addError(n,`Function '${i?.name}' is defined with ${r} parameters, but is applied to ${t.args.length} arguments.`),Qr(e)}let o=t.args.length===1?q(e,t.args[0]):K(e,`$Tuple`,t.args.map(t=>q(e,t)),n);return K(e,`$FcnApply`,[r,o],n)}case`FieldAccess`:{let r=q(e,t.record),i=H(e.file,t);return K(e,`$RcdSelect`,[r,ei(e,t.field,W(e.file,i.end))],n)}case`Product`:return K(e,`$CartesianProd`,t.factors.map(t=>q(e,t)),n);case`BoxAction`:case`AngleAction`:return K(e,t.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[q(e,t.action),q(e,t.subscript)],n);case`WeakFairness`:case`StrongFairness`:return K(e,t.kind===`WeakFairness`?`$WF`:`$SF`,[q(e,t.subscript),q(e,t.action)],n);case`Label`:return Gi(e,t);case`Subexpression`:return Si(e,t)}},Wi=(e,t,n,r)=>{let i=wi(t),a=n;return{bounded:i.map(t=>{let n=H(e.file,t[0].set),r=t.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=Ar(e.file,a,n.start,r);return a=n.end+1,r.map((t,n)=>Jr(e,t,0,W(e.file,i[n]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},Gi=(e,t)=>{let n=Hr(e.file,t),r=e.labelScopes.at(-1);if(r===void 0)return e.addError(n,`Label not in definition or proof step.`),Qr(e);if(e.assumeProveState.isDeclared.slice(2,e.assumeProveState.depth+1).some(Boolean))return e.addError(n,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),Qr(e);if(e.exceptStack.length>0&&e.exceptSpecStack.length>0)return e.addError(n,`Labels inside EXCEPT clauses are not yet implemented.`),Qr(e);zr(e);let i=q(e,t.body),a=Br(e),o=Ar(e.file,H(e.file,t).start,H(e.file,t.body).start,t.params),s=t.params.map((n,r)=>{let i=Fr(e.contexts,n);if(i?.kind===`FormalParam`)return i;let a=W(e.file,o[r]);return e.addError(a,`Illegal parameter ${n} of label \`${t.name}'.`),Jr(e,n,0,a,!1)}),c={...z(e.getId()),kind:`Label`,name:t.name,params:s,body:i,labels:a,isAssumeProve:!1,location:n},l=/* @__PURE__ */ new Set;if(s.forEach(t=>{l.has(t)&&e.addError(n,`Repeated formal parameter ${t.name} \nin label \`${c.name}'.`),l.add(t)}),r.params.flat().forEach(t=>{l.delete(t)||e.addError(n,`Label ${c.name} must contain formal parameter \`${t.name}'.`)}),l.size>0){let t=[...l].map(e=>`${e.name} `).join(``);e.addError(n,`Label ${c.name} declares extra parameter(s) ${t}`)}r.labels.has(c.name)?e.addError(n,`Duplicate label \`${c.name}'.`):r.labels.set(c.name,c);let u=e.assumeProveState.goal;return u&&e.labelGoals.set(c,{scope:u,clause:e.assumeProveState.goalClause}),c},Ki=(e,t,n,r)=>{let i=n.start;return t.params.map(t=>{let n=t.location?yr(e.file,t.location):Ii(e.file,i,t.name),a=ia(e.file,n,t.arity);i=a.end+1;let o=t.arity===1&&V(e.file,n+1,`_`);return Jr(e,o?e.file.tokens[n].spelling??t.name:Nr(t.name),t.arity,U(e.file,a),r)})},qi=(e,t)=>{let n=Ur(e,t.location);return t.isLocal&&!V(e,n.start,`LOCAL`)&&V(e,n.start-1,`LOCAL`)?{start:n.start-1,end:n.end}:n},Ji=(e,t,n)=>{let r=qi(e.file,t),i=U(e.file,r),a=Nr(t.name),o={start:t.isLocal?r.start+1:r.start,end:r.end},s=qr(e,B(),()=>{let n=Ki(e,t,o,!0),r=Fr(e.contexts,a);if(r?.kind===`OpDef`&&r.inRecursive&&!r.isDefined){let t=r.params?.length===n.length&&n.every(e=>e.arity===0);r.letInLevel===e.curLevel?(t||e.addError(i,`Definition of ${r.name} has different arity than its RECURSIVE declaration.`),r.params=n):e.addError(i,`Recursive operator ${a} defined at wrong LET/IN level.`)}else r!==void 0&&e.addError(i,`Operator ${a} already defined or declared.`);return zr(e),{params:n,body:q(e,t.body),existing:r}}),c=Br(e),l=s.existing,u=s.params,d=kr(e.file,r.start);if(l?.kind===`OpDef`&&l.inRecursive&&!l.isDefined&&l.letInLevel===e.curLevel){l.weights=u.map(()=>0),l.maxLevels=u.map(()=>3),l.isLeibnizArg=u.map(()=>!0),l.labels=c,Yi(e,l,s.body,i,d),e.currentModule.definitions.push(l),n?.push(l);return}let f=Yr(e,{name:a,params:u,body:s.body,isLocal:t.isLocal,location:i,preComments:d,labels:c});G(e,f),Xr(e,f),e.currentModule.definitions.push(f),n?.push(f)},Yi=(e,t,n,r,i)=>{t.isDefined=!0,t.body=n,t.location=r,t.preComments=i,t.inRecursive&&(e.unresolvedCount[e.curLevel]--,e.unresolvedSum--)},Xi=(e,t,n)=>{let r=qi(e.file,t),i=U(e.file,r),a=B(),o=t.isLocal?r.start+1:r.start,s=qr(e,a,()=>Ti(e,t.bounds,o+1)),c=qr(e,a,()=>Fr(e.contexts,t.name)),l=qr(e,a,()=>Jr(e,t.name,0,i,c===void 0)),u=K(e,`$NonRecursiveFcnSpec`,[],i,{unbounded:[l],...s}),d=c?.kind===`OpDef`&&c.inRecursive&&!c.isDefined,f=d&&c.letInLevel===e.curLevel;f?c.arity!==0&&e.addError(i,`Function ${c.name} has operator arguments in its RECURSIVE declaration.`):d?e.addError(i,`Recursive function ${t.name} defined at wrong LET/IN level.`):c!==void 0&&e.addError(i,`Function name \`${t.name}' already defined or declared.`);let p=kr(e.file,r.start),m=c===void 0?Yr(e,{name:t.name,params:[],body:u,isLocal:t.isLocal,location:i,preComments:p}):c.kind===`OpDef`&&(f||!d)?c:void 0;f?c.arity===0&&Yi(e,c,u,i,p):c===void 0&&m!==void 0&&(G(e,m),Xr(e,m)),m!==void 0&&(e.currentModule.definitions.push(m),n?.push(m)),e.functions.unshift({name:t.name,node:u}),zr(e);let h=()=>Ei(e,s.bounded.flat(),t.body),g=m===void 0?h():qr(e,a,h),_=Br(e);m!==void 0&&(m.labels=_),e.functions.shift(),u.operands=[g],u.operator.name===`$NonRecursiveFcnSpec`&&(u.unbounded=void 0)},Zi=(e,t)=>{e.unresolvedSum===0&&e.recursiveSectionCount++,e.unresolvedCount[e.curLevel]+=t.length,e.unresolvedSum+=t.length,t.forEach(t=>{let n=aa(e.file,t);e.getId();let r=Array.from({length:t.arity},()=>Jr(e,``,0,void 0,!1)),i=Yr(e,{name:Nr(t.name),params:r,location:U(e.file,n),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:e.recursiveSectionCount,letInLevel:e.curLevel});G(e,i),e.recursiveDeclarations.push(i),e.currentModule.opDefsInRecursiveSection.push(i)})},Qi=e=>{e.unresolvedCount[e.curLevel]!==0&&(e.recursiveDeclarations.filter(t=>t.letInLevel===e.curLevel&&!t.isDefined).forEach(t=>e.addError(t.location,`Symbol ${t.name} declared in RECURSIVE statement but not defined.`)),e.unresolvedSum-=e.unresolvedCount[e.curLevel])},$i=(e,t,n,r)=>{e.getId();let i=Jn(n.table).filter(e=>e.kind===`OpDecl`),a=i.flatMap(t=>{let n=Fr(e.contexts,t.name);if(n===void 0)return[];let i=t.declKind===3||t.declKind===2&&t.arity===0;return i&&ri(e,n,[],r),[{op:t,expr:i?Zr(e,n,[],r):ti(e,n,r),isImplicit:!0}]}),o=(t,n)=>{(n.kind===`OpArg`?Qn(n.op):0)!==t.arity&&e.addError(n.location,`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity}.`)},s=qi(e.file,t),c=jr(e.file,s.start,s.end,`WITH`)+1;return t.substitutions.forEach(t=>{let i=jr(e.file,c,s.end,t.name);i!==-1&&(c=H(e.file,t.expression).end+1);let l=$n(n,Nr(t.name));if(l?.kind!==`OpDecl`){e.addError(i===-1?r:W(e.file,i),`Identifier '${i===-1?t.name:Er(e.file,i)}' 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 u=l.arity===0?q(e,t.expression):Ai(e,t.expression,l);o(l,u);let d=a.find(e=>e.op.name===l.name);d&&!d.isImplicit?e.addError(Hr(e.file,t.expression),`Multiple substitutions for symbol '${l.name}' in substitution.`):d?(d.expr=u,d.isImplicit=!1):a.push({op:l,expr:u,isImplicit:!1})}),a.filter(t=>t.isImplicit&&e.version!==`1.7.4`).forEach(e=>o(e.op,e.expr)),i.filter(e=>!a.some(t=>t.op.name===e.name)).forEach(t=>e.addError(r,`Substitution missing for symbol ${t.name} declared at ${Vn(t.location)} \nand instantiated in module ${e.currentModule.name}.`)),a},ea=(e,t,n,r,i,a,o=e.currentModule)=>(Hn(r)&&e.addError(a,t===`SubstIn`?`Substitution error, probably due to error
35
+ in module being instantiated.`:`Substitution error, probably due to error in module being instantiated.`),{...z(e.getId()),kind:t,substs:n,body:r,instantiatingModule:o,instantiatedModule:i,location:a}),ta=(e,t,n,r)=>{let i=qi(e.file,t),a=U(e.file,i),o=kr(e.file,i.start),s=t.name??``,c=B(),l=t.isLocal?i.start+1:i.start;t.params.length>0&&e.contexts.push(c);let u=Ki(e,t,{start:l,end:i.end},t.params.length>0),d=Kr(e,t.module),f=d.context,p=$i(e,t,f,a);t.params.length>0&&e.contexts.pop(),Jn(f.table).forEach(r=>{if(r.kind!==`OpDef`||r.isLocal||r.defKind!==`UserDefined`&&r.defKind!==`ModuleInstance`)return;let i=[...u,...r.params??[]],c=`${s}!${r.name}`,l=r.defKind===`UserDefined`?Yr(e,{name:c,params:i,body:p.length>0&&r.body?ea(e,`SubstIn`,p,r.body,d,a):r.body,isLocal:t.isLocal,location:a,source:r.source??r,preComments:o,labels:r.labels}):Yr(e,{defKind:`ModuleInstance`,name:c,params:i,isLocal:t.isLocal,location:a,module:r.module,source:r.source??r,preComments:o});G(e,l),r.defKind===`UserDefined`&&Xr(e,l),(n??e.currentModule.definitions).push(l)}),Jn(f.table).forEach(r=>{if(r.kind!==`ThmOrAssumpDef`||r.isLocal)return;let i=p.length>0?ea(e,`APSubstIn`,p,r.body,d,a):r.body,o={...z(e.getId()),kind:`ThmOrAssumpDef`,name:`${s}!${r.name}`,isTheorem:r.isTheorem,body:i,params:[...u,...r.params],isLocal:t.isLocal,location:a,module:e.currentModule,source:r.source??r,labels:r.labels,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]};G(e,o),(n??e.currentModule.definitions).push(o)});let m={...z(e.getId()),kind:`Instance`,name:s,isLocal:t.isLocal,params:u,module:d,substs:p,location:a};(r??e.currentModule.topLevel).push(m);let h=Yr(e,{defKind:`ModuleInstance`,name:s,params:u,isLocal:t.isLocal,location:a,preComments:o});G(e,h),e.version!==`1.7.4`&&n?.push(h)},na=(e,t)=>(G(e,t),t),ra=(e,t,n=!0,r)=>{let i=qi(e.file,t),a=r??U(e.file,i),o=kr(e.file,i.start),s=Kr(e,t.module),c=s.context,l=$i(e,t,c,a),u=t.isLocal,d=Rr(s);Jn(c.table).forEach(t=>{if(t.kind!==`OpDef`||t.defKind!==`UserDefined`||t.isLocal)return;let n=(n,r)=>{let i=Yr(e,{name:t.name,params:t.params,body:r,isLocal:u,location:a,module:n,source:t.source??t,preComments:o,labels:t.labels});return G(e,i),i},r=t.module===void 0||Rr(t.module),i=d||r?u?n(t.module,t.body):na(e,t):n(e.currentModule,t.body&&ea(e,`SubstIn`,l,t.body,s,a));e.currentModule.definitions.push(i),Xr(e,i)}),Jn(c.table).forEach(t=>{if(t.kind!==`ThmOrAssumpDef`||t.isLocal)return;let r=(n,r)=>{let i={...t,...z(e.getId()),body:r,isLocal:u,location:a,module:n,source:t.source??t};return G(e,i),i},i=d?u?r(t.module,t.body):na(e,t):Rr(t.module)?u?r(e.currentModule,t.body):t:r(e.currentModule,ea(e,`APSubstIn`,l,t.body,s,a));n&&e.currentModule.definitions.push(i)});let f={...z(e.getId()),kind:`Instance`,name:void 0,isLocal:u,params:[],module:s,substs:l,location:a};return n&&e.currentModule.topLevel.push(f),f},ia=(e,t,n)=>n===0?{start:t,end:t}:V(e,t,`_`)?{start:t,end:V(e,t+2,`_`)?t+2:t+1}:V(e,t+1,`(`)?{start:t,end:xr(e,t+1)}:{start:t,end:V(e,t+1,`_`)?t+1:t},aa=(e,t)=>ia(e,Ur(e,t.location).start,t.arity),oa=(e,t,n)=>{let r=aa(e.file,t);t.name===`@`&&n===3&&e.addError(U(e.file,r),`Attempted to declare '@' as a variable.`);let i={...z(e.getId()),levelChecked:1,level:+(n===3),kind:`OpDecl`,name:Nr(t.name),arity:t.arity,declKind:n,location:U(e.file,r),module:e.currentModule};return n===2&&(i.levelParams.add(i),i.allParams.add(i)),G(e,i),i},sa=(e,t,n)=>{e.unresolvedSum!==0&&e.addError(Wr(e.file,t),`${n} may not appear within a recursive definition section.`)},ca={Constant:{declKind:24,level:0},Variable:{declKind:25,level:1},State:{declKind:26,level:1},Action:{declKind:27,level:2},Temporal:{declKind:28,level:3}},la=(e,t)=>{let n=Gr(e,t.name)??(t.name===e.currentModule.name?e.currentModule:void 0);return n===void 0?(e.addError(W(e.file,yr(e.file,t.location)+1),`Module \`${t.name}' used without being extended or instantiated.`),[]):[n]},ua=(t,n)=>n.flatMap(n=>{if(n.kind===`ModuleFact`)return la(t,n);let r=or(n);if(r===void 0||!sr(r))return[q(t,n)];let i=xi(t,n,0,!0,!1);if(i.kind===`ThmOrAssumpDef`)throw new e.F(`Expected a fact`);return[i]}),da=(e,t)=>t.flatMap(t=>{if(t.kind===`ModuleFact`)return la(e,t);if(fi(e,t))return[];let n=xi(e,t.kind===`OperatorReference`?{kind:`Identifier`,name:t.operator,location:t.location}:t,-1,!1,!0);return n.kind===`OpDef`||n.kind===`ThmOrAssumpDef`&&!n.name.startsWith(`<`)?[n]:(e.addError(Hr(e.file,t),`DEF clause entry should describe a defined operator.`),[])}),fa=(e,t,n)=>{t.isOnly||t.facts.length+t.defs.length>0||e.addError(n,`Empty BY, USE, or HIDE`)},pa=(e,t)=>{let n=Wr(e.file,t.location);fa(e,t,n);let r=ua(e,t.facts),i=da(e,t.defs);return r.length+i.length===0&&e.addError(n,`Empty USE or HIDE statement.`),t.kind===`Hide`&&r.filter(e=>e.kind===`OpAppl`&&e.operator.kind!==`ThmOrAssumpDef`).forEach(t=>e.addError(t.location,`The only expression allowed as a fact in a HIDE is
36
+ the name of a theorem, assumption, or step.`)),{...z(e.getId()),kind:`UseOrHide`,facts:r,defs:i,isOnly:t.isOnly,isHide:t.kind===`Hide`,location:n}},ma=(e,t)=>{let n=Ur(e.file,t.location),r=t.set&&q(e,t.set),i=Ii(e.file,n.start,t.name),a=ca[t.level],o={...z(e.getId()),levelChecked:1,level:a.level,kind:`OpDecl`,name:Nr(t.name),arity:t.arity,declKind:a.declKind,location:U(e.file,ia(e.file,i,t.arity)),module:e.currentModule};return G(e,o),{...z(e.getId()),kind:`NewSymb`,declaration:o,set:r,location:U(e.file,n)}},ha=(e,t,n,r)=>{let i=Ur(e.file,t.location),a=Dr(e.file,i.start-1),o=H(e.file,t.conclusion).start,s=e.file.tokens.findLastIndex((e,t)=>t<o&&e.kind===`Keyword`&&e.text===`PROVE`),c=U(e.file,{start:a?i.start-1:i.start,end:i.start});a!==Dr(e.file,s-1)&&e.addError(c,a?`[]ASSUME matched by PROVE instead of []PROVE`:`ASSUME matched by []PROVE instead of PROVE`);let l=e.getId();n>1&&e.contexts.push(B()),a&&e.contexts.some(t=>e.assumeContexts.has(t))&&e.addError(c,`[]ASSUME used within the scope of an ordinary ASSUME's assumptions`),a||e.assumeContexts.add(Pr(e.contexts));let u={isDeclaredBefore:[!1],hasGoal:r!==void 0,isSuffices:r?.isSuffices??!1,isInProof:!0};e.assumeProveState.depth=n,e.assumeProveState.isDeclared[n]=!1,n===1&&(e.assumeProveState.goal=r&&u,e.assumeProveState.goalClause=0);let d=t.assumptions.map((t,r)=>{let i=t.kind===`NewSymbol`,a=t.kind===`AssumeProve`?ha(e,t,n+1):i?ma(e,t):q(e,t);return e.assumeProveState.depth=n,i&&(e.assumeProveState.isDeclared[n]=!0),u.isDeclaredBefore.push(u.isDeclaredBefore[r]||i),n===1&&e.assumeProveState.goalClause++,a}),f=q(e,t.conclusion);n>1&&e.contexts.pop(),e.assumeProveState.depth=n-1,n===1&&(e.assumeProveState.goal=void 0);let p={...z(l),kind:`AssumeProve`,assumptions:d,goal:f,isSuffices:u.isSuffices,isBoxed:a,location:U(e.file,{start:a?i.start-1:i.start,end:i.end})};return e.assumeProveScopes.set(p,u),p},ga=(e,t,n,r,i,a,o=!0)=>({...z(t),kind:`ThmOrAssumpDef`,name:n,isTheorem:o,body:r,params:[],isLocal:!1,location:i,module:e.currentModule,source:void 0,labels:a,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]}),_a=(e,t)=>{let n=Wr(e.file,t.location);t.kind===`By`&&fa(e,t,n);let r=t.kind===`By`?ua(e,t.facts):[],i=t.kind===`By`?da(e,t.defs):[];return t.kind===`By`&&e.getId(),t.kind===`By`&&r.length+i.length===0&&e.addError(n,`Empty BY`),{...z(e.getId()),kind:`LeafProof`,facts:r,defs:i,isOmitted:t.kind===`Omitted`,isOnly:t.kind===`By`&&t.isOnly,location:n}},va=(e,t,n)=>{let r=U(e.file,n);switch(t.kind){case`Have`:return K(e,`$Have`,[q(e,t.expression)],r);case`Case`:return K(e,`$Pfcase`,[q(e,t.expression)],r);case`Witness`:return K(e,`$Witness`,t.expressions.map(t=>q(e,t)),r);case`Qed`:return K(e,`$Qed`,[],r);case`Take`:case`Pick`:{let i=t.kind===`Pick`,a=i?`$Pick`:`$Take`;i&&e.contexts.push(B());let o=n=>t.kind===`Pick`?[Ei(e,n,t.body)]:[];if(t.bounds.length>0){let i=Ti(e,t.bounds,n.start),s=o(i.bounded.flat());return K(e,a,s,r,i)}let s=Ar(e.file,n.start,n.end+1,t.names),c=t.names.map((t,n)=>Jr(e,t,0,W(e.file,s[n]),!0)),l=o(c);return K(e,a,l,r,{unbounded:c})}}},ya=(e,t)=>{if((t.kind===`And`||t.kind===`Or`)&&!t.isBulleted)return!0;if(t.kind!==`Apply`||t.args.length!==2)return!1;let n=si(e,t.args[0]),r=H(e,t).start;return n.start===r&&!V(e,n.end+1,`(`)},ba=(t,n)=>{if(n.kind!==`Steps`)return _a(t,n);let r=B();t.contexts.push(r);let i=[],a=[],o,s=(n,r,a)=>{if(n.kind===`Define`){let r=n.definitions.map(n=>{let r=[];n.kind===`Instance`?ta(t,n,r,i):n.kind===`Function`?Xi(t,n,r):Ji(t,n,r);let a=r[n.kind===`Instance`?r.length-1:0];if(a?.kind!==`OpDef`)throw new e.F(`A DEFINE step defines no operator`);return a});return{...z(t.getId()),kind:`DefStep`,defs:r,location:U(t.file,a)}}if(n.kind===`Use`||n.kind===`Hide`)return{...pa(t,n),location:U(t.file,r)};if(n.kind===`Instance`)return ra(t,n,!1,U(t.file,a))},c=n.steps.map(n=>{let r=Ur(t.file,n.location),i=Sr(t.file,n.head),c={start:i.start+1,end:i.end},l=n.body;n.name!==void 0&&/^<[*+]>/.test(n.token)&&t.addError(W(t.file,r.start),`<*> and <+> cannot be used for a named step.`),n.name!==void 0&&zr(t);let u=n.name===void 0?void 0:t.getId();l.kind!==`Assert`&&(o=void 0);let d=s(l,r,c);if(d!==void 0)return n.name!==void 0&&G(t,Yr(t,{defKind:`NumberedProofStep`,name:n.name,location:U(t.file,r),labels:Br(t),step:d})),d;let f=l.kind===`Assert`&&l.statement.kind===`AssumeProve`;f&&(o=void 0);let p=l.kind===`Assert`&&l.isSuffices,m=B(),h=l.kind===`Assert`?(e=>{if(e.kind===`AssumeProve`){let r=qr(t,m,()=>ha(t,e,1,n.name===void 0?void 0:{isSuffices:p}));return r.isSuffices=p,r}if(p){let n=q(t,e);return K(t,`$Suffices`,[n],U(t.file,c))}let r=o!==void 0&&e.kind===`Apply`&&ya(t.file,e)&&e.args[0].kind===`ExceptAt`,i=r?q(t,e.args[1]):void 0,a=r?Zr(t,ni(t,e.operator,Hr(t.file,e)),[K(t,`$Nop`,[o],Hr(t.file,e.args[0])),i],Hr(t.file,e)):q(t,e),s=a.kind===`OpAppl`?a.operands[1]:void 0;return o=ya(t.file,e)?s:void 0,a})(l.statement):va(t,l,c);if(h===void 0)throw new e.F(`Unexpected proof step ${l.kind}`);let g=l.kind===`Pick`?t.contexts.pop():void 0,_=n.name===void 0||u===void 0?void 0:ga(t,u,n.name,h,W(t.file,yr(t.file,n.location)),Br(t));_&&G(t,_);let v=f&&!p;v&&t.contexts.push(m);let y=n.proof&&ba(t,n.proof);return v&&t.contexts.pop(),Vr(t,h),f&&p&&(a.push(m),t.contexts.push(m)),g?.symbols.forEach(e=>G(t,e)),{...z(t.getId()),kind:`Theorem`,definition:_,body:h,proof:y,isSuffices:p,location:U(t.file,r)}});return a.forEach(()=>{t.contexts.pop()?.symbols.forEach(e=>Zn(r,e))}),t.contexts.pop(),{...z(t.getId()),kind:`NonLeafProof`,steps:c,instances:i,proofLevel:n.level,location:Wr(t.file,n.location)}},xa=(e,t)=>{let n=Wr(e.file,t.location),r=t.statement,i=B();t.name!==void 0&&zr(e);let a=t.name===void 0?void 0:e.getId();r.kind===`AssumeProve`&&e.contexts.push(i);let o=r.kind===`AssumeProve`?ha(e,r,1,t.name===void 0?void 0:{isSuffices:!1}):q(e,r),s=t.name===void 0||a===void 0?void 0:ga(e,a,t.name,o,n,Br(e));s&&(r.kind===`AssumeProve`&&e.contexts.pop(),G(e,s),e.currentModule.definitions.push(s),r.kind===`AssumeProve`&&e.contexts.push(i));let c=t.proof&&ba(e,t.proof);r.kind===`AssumeProve`&&e.contexts.pop(),Vr(e,o);let l={...z(e.getId()),kind:`Theorem`,definition:s,body:o,proof:c,isSuffices:!1,location:n};e.currentModule.topLevel.push(l)},Sa=(e,t)=>{let n=Wr(e.file,t.location);t.name!==void 0&&zr(e);let r=q(e,t.expression),i=t.name===void 0?void 0:ga(e,e.getId(),t.name,r,n,Br(e),!1);i&&(G(e,i),e.currentModule.definitions.push(i));let a={...z(e.getId()),kind:`Assume`,definition:i,body:r,location:n};e.currentModule.topLevel.push(a)},Ca=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,wa=e=>[...e.kind===`Let`?e.instances??[]:[],...t.Qt(e).flatMap(wa)],Ta=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:Ta(e)):wa(e),Ea=e=>e?.kind===`Steps`?e.steps.flatMap(e=>[...e.body.kind===`Instance`?[e.body]:[],...e.body.kind===`Define`?e.body.definitions.flatMap(e=>e.kind===`Instance`?[e]:[]):[],...Ea(e.proof)]):[],Da=(e,n)=>{let r=/* @__PURE__ */ new Set;for(let t of e.units)if(t.kind===`Module`&&r.add(t.module.name),t.kind===`Instance`&&t.instance.module===n.module)return r.has(n.module);return e.modules.some(e=>e.name===n.module&&t.gt(e.location,n.location))},Oa=e=>{let t=[],n=[],r=/* @__PURE__ */ new Map,i=(a,o)=>{let s=a===e,c=(e,t)=>e.forEach(e=>{t.push(e),r.has(e)||r.set(e,a.name)}),l=e=>!o.has(e);c(a.extends.filter(l),t),c(a.units.flatMap(e=>e.kind===`Instance`?[e.instance]:e.kind===`Definition`?wa(e.definition.body):e.kind===`Theorem`&&s?[...Ta(e.theorem.statement),...Ea(e.theorem.proof)]:e.kind===`Assumption`&&s?wa(e.assumption.expression):[]).filter(e=>l(e.module)&&!Da(a,e)).map(e=>e.module),n);let u=new Map(o);a.modules.forEach(e=>{let t=new Map(u),n=/* @__PURE__ */ new Set,r=e=>{n.has(e)||(n.add(e),e.extends.forEach(e=>{let n=t.get(e);n!==void 0&&(n.modules.forEach(e=>{t.has(e.name)||t.set(e.name,e)}),r(n))}))};r(e),i(e,t),u.set(e.name,e)})};return i(e,/* @__PURE__ */ new Map),{extendees:t,instancees:n,importers:r}},ka=(n,r,i={})=>{let a=[],o=(e,t)=>Bn(a,{location:e,text:t,isWarning:!1}),s=(e,t)=>Bn(a,{location:e,text:t,isWarning:!0}),c=i.version===`1.7.4`?-1:0,l=()=>++c,u=0;i.version!==`1.7.4`&&zn(l);let d=zn(l);l();let f=new Map(d.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=(n,r)=>{let a=n===i.rootFileName&&i.rootFilePath||`${n}.tla`,o=t=>new e.M(`Could not parse module ${n} from file ${a}`,n,t),s=i.version===`1.7.4`?t.en(r):void 0;if(s!==void 0)throw o(s);try{return t.b(Or(r))}catch(n){throw n instanceof e.F?o(t.S(r)??`***Parse Error***\n${n.message}`):n}},g=(t,n,r)=>{let a=m.get(t);if(a)return a;if(n===void 0)throw new e.O(t,r,i.version!==`1.7.4`);i.onParse?.(t);let o=h(t,n);if(o.name!==t)throw new e.M(`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`,void 0);let s={file:_r(o.name,n),module:o};return m.set(t,s),s},_=[],v=/* @__PURE__ */ new Set,y=[],b=(t,n,i)=>{let a=y.indexOf(t);if(a!==-1)throw new e.M(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...y.slice(a),t].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(v.has(t))return;v.add(t),y.push(t);let o=E(t,g(t,n,i).module);[...o.extendees,...o.instancees].forEach(e=>b(e,r(e),t)),y.pop(),_.push(t)},x=/* @__PURE__ */ new Set,S=(e,t)=>x.has(`${e} ${t}`),C=(e,t,n)=>{let r=m.get(e);if(!r||n.has(e))return;n.add(e);let i=E(e,r.module),a=i[t].find(t=>!S(e,t));if(a!==void 0)return{name:a,importer:e,namingModule:i.importers.get(a)??e};for(let r of[...i.extendees,...i.instancees]){let i=S(e,r)?C(r,t,n):void 0;if(i)return i}},w=e=>{g(e,n);let t=()=>C(e,`extendees`,/* @__PURE__ */ new Set)??C(e,`instancees`,/* @__PURE__ */ new Set);for(let e=t();e!==void 0;e=t())m.has(e.name)||g(e.name,r(e.name),e.namingModule),x.add(`${e.importer} ${e.name}`)},T=i.rootFileName??h(``,n).name,E=(e,t)=>{let n=Oa(t);return e!==T||i.rootExtendees===void 0||(n.extendees.splice(t.extends.length,0,...i.rootExtendees),i.rootExtendees.forEach(t=>{n.importers.has(t)||n.importers.set(t,e)})),n};w(T),b(T,n);let D=(e,t,n,r)=>{let a={kind:`Module`,id:l(),name:e.name,location:Wr(t,e.location),extendees:[],context:Pr(r),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};n&&n.definitions.push(a);let c={version:i.version,addError:o,addWarning:s,getId:l,builtinsByName:f,externalModules:p,nullApplicationId:u,file:t,contexts:r,currentModule:a,curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0,functions:[],exceptStack:[],exceptSpecStack:[],labelScopes:[],assumeContexts:/* @__PURE__ */ new WeakSet,assumeProveState:{depth:0,isDeclared:[],goal:void 0,goalClause:0},assumeProveScopes:/* @__PURE__ */ new WeakMap,labelGoals:/* @__PURE__ */ new WeakMap,recursiveDeclarations:[],selectorToNode:mr({version:i.version,resolveSymbol:e=>Fr(r,e),resolveSynonym:Nr,generateExpression:e=>q(c,e),generateArgument:(e,t,n,r)=>ji(c,e,t,n,r),createOpAppl:(e,t,n)=>{let r=Zr(c,e,t,n);return ri(c,e,t,n),r},createOpArg:(e,t)=>ti(c,e,t),createFormalParam:(e,t,n)=>Jr(c,e,t,n,!1),createLambda:(e,n,r)=>Yr(c,{name:`LAMBDA`,params:e,body:n,location:r,preComments:kr(t,yr(t,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>ea(c,`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:e=>$r(c,e),addError:(e,t)=>(o(e,t),Qr(c)),isOutOfLabelScope:e=>{let t=c.labelGoals.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=c.assumeProveScopes.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}})};return e.extends.forEach(e=>{let t=Kr(c,e);a.extendees.push(t);let n=Pr(r);t.context.symbols.forEach(e=>{if(e.kind!==`Module`&&e.kind!==`FormalParam`&&e.kind!==`OpDecl`&&e.isLocal)return;let t=e.kind===`Module`?er(n,e.name):$n(n,e.name);t===void 0?Zn(n,e):t!==e&&t.kind!==e.kind?o(e.location,`The ${Ca(e)} of '${e.name}' conflicts with \nits ${Ca(t)} at ${Vn(t.location)}.`):t!==e&&!Lr(t,e)&&s(e.location,`Warning: the ${Ca(t)} of '${e.name}' conflicts with \nits ${Ca(t)} at ${Vn(t.location)}.`)}),a.topLevel.push(...t.topLevel)}),e.units.forEach(e=>{switch(e.kind){case`Variables`:sa(c,e.location,`A VARIABLE declaration`),e.declarations.forEach(e=>oa(c,e,3));break;case`Constants`:sa(c,e.location,`A declaration`),e.declarations.forEach(e=>oa(c,e,2));break;case`Recursive`:Zi(c,e.declarations);break;case`Definition`:e.definition.kind===`Function`?Xi(c,e.definition,void 0):Ji(c,e.definition,void 0);break;case`Instance`:e.instance.name===void 0?ra(c,e.instance):ta(c,e.instance,void 0,void 0);break;case`Assumption`:sa(c,e.assumption.location,`An ASSUME`),Sa(c,e.assumption);break;case`Theorem`:sa(c,e.theorem.location,`A THEOREM`),xa(c,e.theorem);break;case`Use`:sa(c,e.use.location,`A USE or HIDE`),a.topLevel.push(pa(c,e.use));break;case`Module`:{sa(c,e.module.location,`A MODULE `);let n=D(e.module,t,a,[...r,B()]),i=Gr(c,n.name);i===void 0?Zn(Pr(r),n):i!==n&&o(n.location,`Multiply-defined module '${n.name}': this definition or declaration conflicts \nwith the one at ${Vn(i.location)}.`);break}}}),Qi(c),a},O=_.map(e=>{i.onAnalyze?.(e),u=Array.from({length:4},l)[1];let t=g(e,void 0),n=B();d.toReversed().forEach(e=>Zn(n,e));let r=D(t.module,t.file,void 0,[n]);return p.set(e,r),i.onModule?.(r,a),r});return{root:O[O.length-1],modules:O,messages:a}},Aa=(e,t,n,r)=>Bn(e.messages,{location:t,text:n,isWarning:!1,...r!==void 0&&!e.isTlc174&&{code:r}}),J=(e,t)=>{for(let n of t)e.add(n)},ja=(e,t,n)=>`${e.id}:${t}:${n.id}`,Ma=(e,t,n,r)=>{e.set(ja(t,n,r),{op:t,index:n,param:r})},Na=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(t)&&e.set(r,t)})},Pa=(e,t,n)=>{e.set(t,Math.min(n,e.get(t)??3))},Fa=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(r)&&Pa(e,r,t)})},Ia=(e,t)=>`${e.id}:${t}`,La=(e,t,n,r)=>{let i=Ia(t,n),a=e.get(i)?.level??0;e.set(i,{param:t,position:n,level:Math.max(r,a)})},Ra=(e,t,n=()=>!0)=>{t.forEach(t=>{n(t)&&La(e,t.param,t.position,t.level)})},za=(e,t)=>{e.levelParams=t.levelParams,e.allParams=t.allParams,e.levelConstraints=t.levelConstraints,e.argLevelConstraints=t.argLevelConstraints,e.argLevelParams=t.argLevelParams},Ba=(e,t)=>{J(e.levelParams,t.levelParams),J(e.allParams,t.allParams),Fa(e.levelConstraints,t.levelConstraints),Ra(e.argLevelConstraints,t.argLevelConstraints),Na(e.argLevelParams,t.argLevelParams)},Va=(e,t)=>t.includes(e.op)||t.includes(e.param),Ha=e=>e.kind===`OpDecl`||e.kind===`FormalParam`,Ua=e=>e.kind!==`Module`,Wa=e=>e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`,Ga=(e,t)=>e.kind===`OpDef`&&e.arity<0?0:t,Ka=(e,t)=>e.kind===`OpDef`?e.weights[Ga(e,t)]??0:0,qa=(e,t)=>e.maxLevels[Ga(e,t)]??3,Ja=(e,t,n)=>e.minMaxLevel?.[t]?.[n]??0,Ya=(e,t)=>e.kind===`OpDef`?e.isLeibnizArg?.[Ga(e,t)]??!0:e.isLeibnizArg[t]??!0,Xa=(e,t,n,r)=>e.opLevelCond?.[t]?.[n]?.[r]??!1,Za=e=>[...e.unbounded??[],...(e.bounded??[]).flat()],Qa=(e,t)=>t.find(t=>t.op===e)?.expr,$a=(e,t,n)=>{let r=Qa(e,t);return r===void 0?/* @__PURE__ */ new Set([e]):n?r.allParams:r.levelParams},eo=(e,t)=>{let n=/* @__PURE__ */ new Map;return e.forEach((e,r)=>{let i=Qa(e.op,t);if(i===void 0){n.set(r,e);return}if(i.kind!==`OpArg`||!Ha(i.op))return;let a=i.op;$a(e.param,t,!1).forEach(t=>Ma(n,a,e.index,t))}),n},to=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map;return e.levelConstraints.forEach((e,r)=>{let i=n||r.kind!==`OpDecl`?e:r.declKind===2?0:r.declKind===3?1:e;$a(r,t,!1).forEach(e=>Pa(a,e,i))}),e.argLevelParams.forEach(e=>{let n=Qa(e.op,t);if(n?.kind!==`OpArg`||n.op.kind!==`OpDef`)return;Y(n.op,r,i);let o=qa(n.op,e.index);$a(e.param,t,!1).forEach(e=>Pa(a,e,o))}),a},no=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map;return e.argLevelConstraints.forEach(e=>{let n=Qa(e.param,t);n===void 0?La(i,e.param,e.position,e.level):n.kind===`OpArg`&&Ha(n.op)&&La(i,n.op,e.position,e.level)}),e.argLevelParams.forEach(e=>{let a=Qa(e.param,t);if(a===void 0)return;let o=Qa(e.op,t),s=o===void 0?e.op:o.kind===`OpArg`?o.op:void 0;s!==void 0&&Ha(s)&&(Y(a,n,r),La(i,s,e.index,a.level))}),i},ro=(e,t)=>nr(e,3).length>0||(po(e,t),tr(e).some(e=>(e.body?.level??0)!==0))?!1:e.topLevel.every(e=>e.kind!==`Theorem`||e.level===0),io=(e,t,n)=>{e.minMaxLevel=t.map(e=>Array.from({length:e.arity},(t,r)=>n.argLevelConstraints.get(Ia(e,r))?.level??0)),e.opLevelCond=t.map(e=>t.map(t=>Array.from({length:e.arity},(r,i)=>n.argLevelParams.has(ja(e,i,t))))),J(e.levelParams,n.levelParams),J(e.allParams,n.allParams),J(e.nonLeibnizParams,n.nonLeibnizParams),t.forEach((t,n)=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.has(t)&&(e.nonLeibnizParams.delete(t),e.isLeibnizArg&&(e.isLeibnizArg[n]=!1),e.isLeibniz=!1)}),e.levelConstraints=new Map(n.levelConstraints),t.forEach(t=>e.levelConstraints.delete(t)),e.argLevelConstraints=new Map(n.argLevelConstraints),t.forEach(t=>{for(let n=0;n<t.arity;n++)e.argLevelConstraints.delete(Ia(t,n))}),Na(e.argLevelParams,n.argLevelParams,e=>!t.some(t=>t===e.op)||!t.some(t=>t===e.param))},ao=(e,t,n,r,i)=>{e.operands.forEach((a,o)=>{if(a===void 0||(a.level>qa(t,o)&&(n&&Y(a,r,i)&&Aa(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${o+1} exceeds the maximum level allowed by the operator.`),e.levelCorrect=!1),a.kind!==`OpArg`||!Wa(a.op)))return;let s=a.op;Y(s,r,i);let c=Qn(s);for(let l=0;l<c;l++){let c=Ja(t,o,l);qa(s,l)>=c||(n&&Y(a,r,i)&&Aa(i,e.location,`Level error in applying operator ${t.name}:\nThe permitted level of argument ${l+1} of the operator argument ${o+1} \nmust be at least ${c}.`),e.levelCorrect=!1)}e.operands.forEach((n,l)=>{for(let u=0;u<c;u++)n===void 0||!Xa(t,o,l,u)||n.level<=qa(s,u)||(Y(a,r,i)&&Y(n,r,i)&&Aa(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${l+1} exceeds the maximum level allowed by the operator.`,`HIGHER_ORDER_OPERATOR_COPARAMETER_LEVEL_CONSTRAINTS_EXCEEDED`),e.levelCorrect=!1)})}),e.ranges.forEach((n,a)=>{let o=Y(n,r,i);n.level<=2||(o&&Aa(i,e.location,`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${Vn(e.bounded?.[a]?.[0]?.location)} \nexceeds the maximum level allowed by the operator.`),e.levelCorrect=!1)})},oo=(e,t,n,r,i)=>{let a=t.params??[],o=t=>e.operands.find((e,n)=>a[n]===t);Fa(e.levelConstraints,t.levelConstraints),e.operands.forEach(t=>{t!==void 0&&Fa(e.levelConstraints,t.levelConstraints,e=>!n.has(e))}),e.ranges.forEach(t=>Fa(e.levelConstraints,t.levelConstraints)),e.operands.forEach((n,r)=>{let i=qa(t,r);n?.levelParams.forEach(t=>Pa(e.levelConstraints,t,i))}),e.operands.forEach((n,a)=>{if(n?.kind!==`OpArg`||!Wa(n.op))return;let o=n.op;Y(o,r,i);let s=Qn(o);e.operands.forEach((n,r)=>{for(let i=0;i<s;i++){if(!Xa(t,a,r,i))continue;let s=qa(o,i);n?.levelParams.forEach(t=>Pa(e.levelConstraints,t,s)),!o.isLeibniz&&!Ya(o,i)&&n&&J(e.nonLeibnizParams,n.allParams)}})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n?.kind===`OpArg`&&Wa(n.op)&&(Y(n.op,r,i),Pa(e.levelConstraints,t.param,qa(n.op,t.index)))}),Ra(e.argLevelConstraints,t.argLevelConstraints),e.operands.forEach(t=>{t&&Ra(e.argLevelConstraints,t.argLevelConstraints)}),e.ranges.forEach(t=>Ra(e.argLevelConstraints,t.argLevelConstraints)),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Ha(n.op))return;let i=n.op;for(let n=0;n<i.arity;n++)La(e.argLevelConstraints,i,n,Ja(t,r,n));e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&Xa(t,r,a,o)&&La(e.argLevelConstraints,i,o,n.level)})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n!==void 0&&(Y(n,r,i),La(e.argLevelConstraints,t.op,t.index,n.level))}),e.operands.forEach(t=>{t!==void 0&&Na(e.argLevelParams,t.argLevelParams,e=>!n.has(e.param))}),e.ranges.forEach(t=>Na(e.argLevelParams,t.argLevelParams)),t.argLevelParams.forEach((t,n)=>{let a=o(t.op);if(a===void 0){let a=o(t.param);a===void 0?e.argLevelParams.set(n,t):(Y(a,r,i),a.levelParams.forEach(n=>Ma(e.argLevelParams,t.op,t.index,n)))}else a.kind===`OpArg`&&Ha(a.op)&&Ma(e.argLevelParams,a.op,t.index,t.param)}),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Ha(n.op))return;let i=n.op;e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&Xa(t,r,a,o)&&n.levelParams.forEach(t=>Ma(e.argLevelParams,i,o,t))})})},so=/* @__PURE__ */ new Map([[`\\land`,`\\land`],[`\\lor`,`\\lor`],[`=>`,`=>`],[`\\equiv`,`\\equiv`],[`$ConjList`,`Conjunction list`],[`$DisjList`,`Disjunction list`]]),co=(e,t)=>{let n=(n,r)=>{Aa(t,n,r),t.isTlc174||(e.levelCorrect=!1)},r=e.operator.name,i=e.operands[0];if((r===`[]`||r===`<>`)&&i?.level===2&&i.kind===`OpAppl`){let t=r===`[]`;i.operator.name!==(t?`$SquareAct`:`$AngleAct`)&&n(e.location,t?`[] followed by action not of form [A]_v.`:`<> followed by action not of form <<A>>_v.`)}r!==`~>`&&r!==`-+->`||i?.level!==2&&e.operands[1]?.level!==2||n(e.location,`Action used where only temporal formula or state predicate allowed.`);let a=so.get(r);a!==void 0&&e.operands.some(e=>e?.level===3)&&e.operands.some(e=>e?.level===2)&&n(e.location,`${a} has both temporal formula and action as arguments.`),e.level===3&&(r===`$BoundedExists`||r===`$BoundedForall`)&&e.ranges.forEach(e=>{e.level===2&&n(e.location,`Action-level bound of quantified temporal formula.`)})},lo=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.operands.filter(e=>e!==void 0);r.forEach(r=>{Y(r,t,n)||(e.levelCorrect=!1)}),e.ranges.forEach(r=>{Y(r,t,n)||(e.levelCorrect=!1)});let i=e.operator;if(Wa(i)){let r=Y(i,t,n);ao(e,i,r,t,n),e.level=e.operands.reduce((e,t,n)=>t!==void 0&&Ka(i,n)===1?Math.max(e,t.level):e,i.level),e.ranges.forEach(t=>{e.level=Math.max(e.level,t.level)}),J(e.levelParams,i.levelParams),J(e.allParams,i.allParams),J(e.nonLeibnizParams,i.nonLeibnizParams),e.operands.forEach((t,n)=>{t!==void 0&&(Ka(i,n)===1&&J(e.levelParams,t.levelParams),J(e.allParams,t.allParams),J(e.nonLeibnizParams,t.nonLeibnizParams),Ya(i,n)||J(e.nonLeibnizParams,t.allParams))}),e.ranges.forEach(t=>{J(e.levelParams,t.levelParams),J(e.allParams,t.allParams),J(e.nonLeibnizParams,t.nonLeibnizParams)});let a=new Set(Za(e));a.forEach(t=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.delete(t)}),oo(e,i,a,t,n)}else Y(i,t,n),e.level=r.reduce((e,t)=>Math.max(e,t.level),i.kind===`Module`?0:i.level),e.levelParams=/* @__PURE__ */ new Set([i]),e.allParams.add(i),r.forEach((t,n)=>{J(e.levelParams,t.levelParams),J(e.allParams,t.allParams),J(e.nonLeibnizParams,t.nonLeibnizParams),Fa(e.levelConstraints,t.levelConstraints),La(e.argLevelConstraints,i,n,t.level),Ra(e.argLevelConstraints,t.argLevelConstraints),t.levelParams.forEach(t=>Ma(e.argLevelParams,i,n,t)),Na(e.argLevelParams,t.argLevelParams)});return co(e,n),e.levelCorrect},uo=(e,t,n)=>{if(e.levelChecked>=t||!e.inRecursiveSection&&e.levelChecked>0)return e.levelCorrect;e.levelChecked=t;let r=e.body;if(r===void 0)return e.levelCorrect=e.step===void 0||Y(e.step,t,n),e.levelCorrect;e.levelCorrect=Y(r,t,n),e.level=Math.max(e.level,r.level);let i=e.params??[];return i.forEach((t,n)=>{let i=r.levelConstraints.get(t);i!==void 0&&(e.maxLevels[n]=Math.min(e.maxLevels[n],i)),r.levelParams.has(t)&&(e.weights[n]=Math.max(e.weights[n],1))}),io(e,i,r),e.levelCorrect},fo=(e,t,n)=>(e.levelChecked>=t||(e.levelChecked=t,e.maxLevels=e.params.map(()=>3),e.isLeibnizArg=e.params.map((t,n)=>n===e.params.length-1),e.params.length>0&&(e.isLeibniz=!0),e.levelCorrect=Y(e.body,t,n),e.level=e.body.level,e.params.forEach((t,n)=>{let r=e.body.levelConstraints.get(t);r!==void 0&&(e.maxLevels[n]=r)}),io(e,e.params,e.body)),e.levelCorrect),po=(e,t)=>{if(e.isLevelChecked)return e.levelCorrect;e.isLevelChecked=!0;let n=e.opDefsInRecursiveSection,r=0;for(;r<n.length;){let e=n[r].recursiveSection,i=r;for(;i<n.length&&n[i].recursiveSection===e;){let e=n[i];e.inRecursive?(e.levelChecked=1,e.maxLevels=e.maxLevels.map(()=>2),e.weights=e.weights.map(()=>1)):e.levelChecked=0,i++}let a=n.slice(r,i),o=/* @__PURE__ */ new Set,s=/* @__PURE__ */ new Set,c=0;a.forEach(e=>{e.inRecursive&&(e.levelChecked=0),uo(e,1,t),e.inRecursive&&(e.maxLevels.forEach((n,r)=>{n>=2||Aa(t,e.location,`Argument ${r+1} of recursive operator ${e.name} is primed`)}),c=Math.max(c,e.level),J(o,e.levelParams),J(s,e.allParams))}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=2),e.level=Math.max(e.level,c),J(e.levelParams,o),J(e.allParams,s)}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=1),uo(e,2,t)}),r=i}e.levelCorrect=!0;let i=t=>{t||(e.levelCorrect=!1)};e.definitions.filter(e=>e.kind===`Module`).forEach(e=>i(po(e,t)));let a=tr(e);return a.forEach(e=>i(uo(e,1,t))),rr(e).forEach(e=>i(fo(e,1,t))),e.topLevel.forEach(e=>i(Y(e,1,t))),ro(e,t)||nr(e,2).forEach(t=>Pa(e.levelConstraints,t,0)),a.forEach(t=>{Fa(e.levelConstraints,t.levelConstraints),Ra(e.argLevelConstraints,t.argLevelConstraints),Na(e.argLevelParams,t.argLevelParams,e=>!Va(e,t.params??[]))}),e.topLevel.forEach(t=>{Fa(e.levelConstraints,t.levelConstraints),Ra(e.argLevelConstraints,t.argLevelConstraints),Na(e.argLevelParams,t.argLevelParams)}),e.levelCorrect},mo=(e,t,n,r)=>(e.levelChecked>=n||(e.levelChecked=n,t.forEach(t=>{Ua(t)&&(t.kind!==`OpDef`||t.defKind!==`ModuleInstance`)&&(e.levelCorrect=Y(t,n,r)&&e.levelCorrect,e.level=Math.max(e.level,t.level),Ba(e,t),J(e.nonLeibnizParams,t.nonLeibnizParams))})),e.levelCorrect),ho=(e,t)=>{e?.kind===`NonLeafProof`&&e.steps.forEach(e=>{if(e.kind!==`Theorem`||e.body.kind!==`OpAppl`)return;let n=e.body.operator.name;n===`$Take`||n===`$Witness`||n===`$Have`?e.body.level!==0&&Aa(t,e.body.location,`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`):n===`$Pfcase`?(e.body.level!==0&&Aa(t,e.body.location,`Non-constant CASE for temporal goal.`),ho(e.proof,t)):n===`$Qed`&&ho(e.proof,t)})},go=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelParams=/* @__PURE__ */ new Set,e.levelCorrect=!0;let r=e.module;po(r,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{Y(r.expr,t,n)||(e.levelCorrect=!1)});let i=ro(r,n);e.substs.forEach(a=>{!i&&a.expr.level>a.op.level&&(Y(a.expr,t,n)&&Aa(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${a.op.name}' \nmust be at most ${a.op.level}.`),e.levelCorrect=!1),a.expr.kind!==`OpArg`||a.expr.op.kind!==`OpDef`||a.expr.op.defKind!==`UserDefined`&&a.expr.op.defKind!==`BuiltIn`||a.expr.op.isLeibniz||Aa(n,e.location,`Error in instantiating module '${r.name}':\n A non-Leibniz operator substituted for '${a.op.name}'.`)}),e.substs.forEach(i=>{let a=r.levelConstraints.get(i.op);if(a!==void 0&&i.expr.level>a&&(Y(i.expr,t,n)&&Aa(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${i.op.name}' \nmust be at most ${a}.`),e.levelCorrect=!1),i.op.arity<=0||i.expr.kind!==`OpArg`||i.expr.op.kind!==`OpDef`)return;let o=i.expr.op,s=Y(o,t,n);for(let t=0;t<i.op.arity;t++){let a=r.argLevelConstraints.get(Ia(i.op,t))?.level;a===void 0||qa(o,t)>=a||(s&&Aa(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the argument ${t+1} of the operator ${o.name} \nmust be at least ${a}.`),e.levelCorrect=!1)}}),r.argLevelParams.forEach(i=>{e.substs.forEach(a=>{e.substs.forEach(o=>{if(i.op!==a.op||i.param!==o.op||a.expr.kind!==`OpArg`)return;let s=a.expr.op,c=Y(s,t,n);if(s.kind!==`OpDef`)return;let l=qa(s,i.index);o.expr.level<=l||(c&&Y(o.expr,t,n)&&Aa(n,e.location,`Level error when instantiating module '${r.name}':\nThe level of the argument ${i.index} of the operator ${a.op.name}' \nmust be at most ${l}.`),e.levelCorrect=!1)})})});let a=t=>!e.params.some(e=>e===t);return Fa(e.levelConstraints,to(r,e.substs,i,t,n),a),e.substs.forEach(t=>Fa(e.levelConstraints,t.expr.levelConstraints,a)),Ra(e.argLevelConstraints,no(r,e.substs,t,n),e=>a(e.param)),e.substs.forEach(t=>Ra(e.argLevelConstraints,t.expr.argLevelConstraints,e=>a(e.param))),Na(e.argLevelParams,eo(r.argLevelParams,e.substs),t=>!Va(t,e.params)),e.substs.forEach(t=>Na(e.argLevelParams,t.expr.argLevelParams,t=>!Va(t,e.params))),e.levelCorrect},Y=(e,t,n)=>{if(!Ua(e))return po(e,n);switch(e.kind){case`OpAppl`:return lo(e,t,n);case`OpDef`:return uo(e,t,n);case`ThmOrAssumpDef`:return fo(e,t,n);case`FormalParam`:return e.levelChecked===0&&(e.levelChecked=t,e.levelParams.add(e),e.allParams.add(e)),!0;case`OpDecl`:return!0;case`Numeral`:case`String`:case`Decimal`:return e.levelChecked<t&&(e.levelChecked=t),!0;case`OpArg`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t;let r=e.op;return e.levelCorrect=Y(r,t,n),r.kind===`Module`||(e.level=r.level,za(e,r)),e.levelCorrect}case`LetIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.opDefs.filter(e=>e.kind!==`OpDef`||e.defKind!==`ModuleInstance`);return r.forEach(r=>{Y(r,t,n)||(e.levelCorrect=!1)}),Y(e.body,t,n)||(e.levelCorrect=!1),e.instances.forEach(r=>{Y(r,t,n)||(e.levelCorrect=!1)}),e.level=e.body.level,e.levelParams=new Set(e.body.levelParams),e.allParams=new Set(e.body.allParams),Fa(e.levelConstraints,e.body.levelConstraints),r.forEach(t=>Fa(e.levelConstraints,t.levelConstraints)),Ra(e.argLevelConstraints,e.body.argLevelConstraints),r.forEach(t=>Ra(e.argLevelConstraints,t.argLevelConstraints)),Na(e.argLevelParams,e.body.argLevelParams),r.forEach(t=>{let n=t.kind===`OpDef`?t.params??[]:[];Na(e.argLevelParams,t.argLevelParams,e=>!Va(e,n))}),e.instances.forEach(t=>Na(e.argLevelParams,t.argLevelParams)),e.levelCorrect}case`Label`:{if(e.levelChecked>=t)return!0;e.levelChecked=t,e.params.forEach(e=>Y(e,t,n));let r=Y(e.body,t,n);return e.level=e.body.level,za(e,e.body),r}case`At`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=e.except.operands,i=r[0];if(i===void 0)return!0;Y(i,t,n),e.level=i.level;let a=[i];for(let i of r.slice(1))if(i!==void 0){if(Y(i,t,n),i===e.component)break;e.level=Math.max(e.level,i.level),a.push(i)}return a.forEach(t=>Ba(e,t)),!0}case`SubstIn`:case`APSubstIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.body;Y(r,t,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{Y(r.expr,t,n)||(e.levelCorrect=!1)}),e.level=e.substs.reduce((e,t)=>r.levelParams.has(t.op)?Math.max(e,t.expr.level):e,r.level),r.levelParams.forEach(t=>J(e.levelParams,$a(t,e.substs,!1))),e.kind===`APSubstIn`?r.allParams.forEach(t=>J(e.allParams,$a(t,e.substs,!0))):(e.allParams=new Set(r.allParams),e.nonLeibnizParams=new Set(r.nonLeibnizParams),e.substs.forEach(t=>{e.allParams.has(t.op)&&(e.allParams.delete(t.op),J(e.allParams,t.expr.allParams),J(e.nonLeibnizParams,t.expr.nonLeibnizParams),e.nonLeibnizParams.has(t.op)&&(e.nonLeibnizParams.delete(t.op),J(e.nonLeibnizParams,t.expr.allParams)))}));let i=ro(e.instantiatedModule,n);return e.levelConstraints=to(r,e.substs,i,t,n),e.argLevelConstraints=no(r,e.substs,t,n),e.argLevelParams=eo(r.argLevelParams,e.substs),e.levelCorrect}case`Instance`:return go(e,t,n);case`Assume`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=Y(e.body,t,n),i=!e.definition||Y(e.definition,t,n);return e.level=e.body.level,za(e,e.body),e.level!==0&&Aa(n,e.location,`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${e.level}.`),r&&i}case`Theorem`:{if(e.levelChecked>=t)return!0;let r=mo(e,[e.definition??e.body,...e.proof?[e.proof]:[]],t,n),i=e.body;return i.kind===`OpAppl`&&i.operator.name===`$Pick`&&i.level===3&&i.ranges.forEach(e=>{e.level!==0&&Aa(n,e.location,`Non-constant bound of temporal PICK.`)}),i.level===3&&ho(e.proof,n),r}case`LeafProof`:case`UseOrHide`:return mo(e,e.facts,t,n);case`NonLeafProof`:return mo(e,[...e.steps,...e.instances],t,n);case`DefStep`:return mo(e,e.defs,t,n);case`NewSymb`:return e.levelChecked>=t||(e.levelChecked=t,e.level=e.declaration.level,e.set===void 0)||(e.levelCorrect=Y(e.set,t,n),e.level=Math.max(e.level,e.set.level),e.level===3&&(e.levelCorrect=!1,Aa(n,e.location,`Level error:
37
+ Temporal formula used as set.`)),za(e,e.set)),e.levelCorrect;case`AssumeProve`:return e.levelChecked>=t||(e.levelChecked=t,e.levelCorrect=!0,e.assumptions.forEach(r=>{Y(r,t,n)||(e.levelCorrect=!1)}),Y(e.goal,t,n),e.level=e.assumptions.reduce((e,t)=>Math.max(e,t.level),e.goal.level),[e.goal,...e.assumptions].forEach(t=>Ba(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&Pa(e.levelConstraints,t,2)})),e.levelCorrect}},_o=e=>{switch(e.kind){case`OpAppl`:return[...e.ranges,...e.operands];case`OpDef`:case`ThmOrAssumpDef`:case`Label`:return[e.body];case`LetIn`:return[...e.opDefs,...e.instances,e.body];case`SubstIn`:case`APSubstIn`:return[e.body,...e.substs.map(e=>e.expr)];case`Instance`:return e.substs.map(e=>e.expr);case`AssumeProve`:return[...e.assumptions,e.goal];case`NewSymb`:return[e.set];default:return[]}},vo=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),yo=e=>{let t=/* @__PURE__ */ new Set,n=e=>{if(e===void 0||t.has(e))return!1;if(t.add(e),e.kind===`OpAppl`){let t=e.operator;if(t.kind===`OpDecl`||t.kind===`FormalParam`)return!0;if(t.kind===`OpDef`){if(t.name===`BOOLEAN`)return!0;let e=t.module?.name;if(e!==void 0&&vo.get(e)===t.name||n(t))return!0}}return _o(e).some(n)};return n(e)},bo=e=>e.operands.filter(e=>e?.kind===`OpAppl`),xo=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},So=e=>JSON.stringify([e.operands.length,...bo(e).map(e=>xo(e)?.value).sort()]),Co=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),Co(e,t))}),t),wo=e=>{let t=e.records.map(t=>({domain:So(t),warnings:bo(t).flatMap(t=>{let n=xo(t),r=n&&$n(e.context,n.value);return n===void 0||r===void 0?[]:[{location:n.location,text:`The field name "${n.value}" in the record constructor is identical to the existing definition or declaration\nnamed ${n.value}, located at ${Vn(r.location)}.\nThe field in the record will not take the value of the ${n.value} definition or declaration.\nIn TLA+, field names in records are strings, regardless of any similarly named declarations or definitions.\nTherefore, DOMAIN [${n.value} |-> ...] = {"${n.value}"} holds true.`,isWarning:!0}]})})),n=new Set(t.flatMap(e=>e.warnings.length>0?[e.domain]:[])),r=/* @__PURE__ */ new Set;return[...[...Co(e)].flatMap(e=>e.records),...e.records].forEach(e=>{let t=So(e);n.has(t)&&!r.has(t)&&bo(e).some(yo)&&r.add(t)}),t.flatMap(e=>r.has(e.domain)?[]:e.warnings)},To=e=>`${Vn(e.location)}\n\n${e.text}`,Eo=e=>{let t=e.filter(e=>!e.isWarning),n=e.filter(e=>e.isWarning);return[t.length>0?`*** Errors: ${t.length}\n\n`:``,...t.map(e=>`${To(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${To(e)}\n\n\n`)].join(``)},Do=4802,Oo=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),ko=e=>{let t=/* @__PURE__ */ new Set,n=[],r=e=>{t.add(e.name),n.push(...e.extends),e.modules.forEach(r)};return r(e),n.filter(e=>!t.has(e))},Ao=n=>{try{return t.b(Or(n))}catch(t){if(t instanceof e.F)return;throw t}},jo=(e,n)=>n===`1.7.4`&&t.en(e)!==void 0?void 0:Ao(e)?.name,Mo=(n,r,o={})=>{let s=(0,i.basename)(n,`.tla`),c=t.ut(o.version),l=o.fileName??s,u=(0,a.existsSync)(n),d=u?(0,a.readFileSync)(n,`utf8`):c.get(s),f=[],p=e=>{f.push(e),o.onPrint?.(e)},m=e=>p(`${e}\n`),h=o.version===`1.7.4`,g=h&&o.isXmlExport,_=e=>{o.isXmlExport||m(e)},v=o.describeFile,y=/* @__PURE__ */ new Map([[s,u?`file`:`standard`]]),b=!1,x=[],S=!1,C=!1,w=It(Ye(),m),T=/* @__PURE__ */ new Map,E=[],D=()=>E.splice(0).forEach(e=>e.isError?o.onPrintError?.(`${e.text}\n`):m(e.text)),O=e=>{let t=T.get(e),n=t?.module.location.range;if(t===void 0||n===void 0)return;let r=t.text.split(/\r\n|\r|\n/),i=In(w,r.slice(n.start.line-1,n.end.line),o.version),a=i.has(`TLA_DIVERGENCE_EXISTS`),s=i.has(`PCAL_DIVERGENCE_EXISTS`),c=a===s?void 0:`The ${a?`TLA+ translation`:`PlusCal algorithm`} in module ${e} has changed since its last translation.`;if(h){let t=a&&s?`The PlusCal algorithm and its TLA+ translation in module ${e} filename since the last translation.`:c;t===void 0?i.has(`ERROR_ENCOUNTERED`)&&E.push({text:`A unexpected problem was encountered attempting to validate the specification for ${e}`,isError:!0}):E.push({text:`!! WARNING: ${t}`,isError:!1});return}let l=a&&s?`Both the PlusCal algorithm and its TLA+ translation in module ${e} have changed since the last translation.`:c??(i.has(`ERROR_ENCOUNTERED`)?`An unexpected problem was encountered attempting to validate the specification for ${e}`:void 0);if(l===void 0)return;let u=!i.has(`ERROR_ENCOUNTERED`)||a||s;x.some(e=>e.text===l)||x.push({location:e,text:l,isWarning:u})},k=(e,t)=>{if(o.isXmlExport||T.has(e))return;let n=Ao(t);if(n===void 0||n.name!==e)return;let r=[...T.values()].filter(t=>ko(t.module).includes(e));T.set(e,{text:t,module:n}),r.forEach(()=>O(e)),ko(n).filter(t=>t!==e&&T.has(t)).forEach(O)},A=()=>{if(D(),S)return;S=!0;let e=x.filter(e=>e.isWarning);e.length>0&&(_(`Warnings (${e.length}) during syntax parsing of ${l}:\n\n`),e.forEach(e=>_(`${To(e)}\n\n\n`))),e.length!==x.length&&(m(Eo(x)),b=!0,C=!0)},ee=e=>{let n=c.get(e),i=r(e),a=i===void 0&&n===void 0&&d!==void 0&&!h?t.v(d,e):void 0,o=i??a;return y.set(e,i===void 0?a===void 0?`standard`:`root file`:`file`),o!==void 0&&k(e,o),o??n},te=(()=>{try{if(d===void 0)throw new e.M(`Cannot find source file for module ${l}`,void 0);return k(s,d),ka(d,ee,{rootFileName:s,rootFilePath:o.isXmlExport?`${l.replace(/\.tla$/,``)}.tla`:void 0,version:o.version,rootExtendees:o.rootExtendees,onParse:e=>{v&&m(`Parsing file ${v(e,y.get(e)??`file`)}`),e===s&&O(s),D()},onAnalyze:e=>{A(),(v||g)&&!C&&m(`Semantic processing of module ${e}`)},onModule:(e,t)=>{if(C||(t.every(e=>e.isWarning)&&po(e,{messages:t,isTlc174:h}),t.length===0))return;if(t.some(e=>!e.isWarning)&&(b=!0),h)return m(`Semantic errors:\n\n${Eo(t)}`);let n=t.filter(e=>e.isWarning);n.length>0&&(_(`*** Warnings: ${n.length}\n`),n.forEach(e=>_(`${To(e)}\n\n\n`)));let r=t.filter(e=>!e.isWarning);r.length!==0&&(m(`Semantic errors:\n\n*** Errors: ${r.length}\n`),r.forEach(e=>m(`${To(e)}\n\n`)))}})}catch(t){if(b=!0,t instanceof e.c){m(`\nFatal errors while parsing TLA+ spec in file ${l}\n`),m(t.message),m(Eo(x));return}if(!(t instanceof e.M))throw t;let n={location:t.location,text:t.message,isWarning:!1},r=h&&t.parseError?.includes(` and token "" `);if(t.parseError!==void 0&&!r&&!g&&m(t.parseError),m(`\nFatal errors while parsing TLA+ spec in file ${l}\n`),r){m(`java.lang.NullPointerException: Cannot invoke "String.length()" because "str" is null`);return}if(h){m(`tla2sany.semantic.AbortException`),p(`*** Abort messages: 1\n\n${To(n)}\n\n\n`);return}m(To(n)),m(Eo(S?[n]:[...x,n]))}})();if(te!==void 0&&A(),te!==void 0&&!b&&!o.isXmlExport&&!h){let e=te.modules.filter(e=>!Oo.has(e.name));v&&e.forEach(e=>m(`Linting of module ${e.name}`));let t=o.suppressedCodes?.includes(Do)?[]:e.flatMap(wo),n=o.errorCodes?.includes(Do)?`Warning treated as error: `:``;t.forEach(e=>m(`${n}${To(e)}\n\n\n`)),n&&t.length>0&&(b=!0)}return{text:f.join(``),isFailed:b,specification:C?void 0:te}},No=e=>e.kind===`OpDef`&&e.defKind!==`BuiltIn`&&e.defKind!==`ModuleInstance`,Po=(e,t)=>e.context.symbols.find(e=>No(e)&&e.name===t),Fo=t=>e.at(new e.b(`Parsing or semantic analysis failed.Parsing or semantic analysis failed.${t}`),e.nt.specParseError),Io=(n,r,i,a,o)=>{let s=r.replace(`__DebuggerExpr__`,`__DebuggerModule__`),c=`---- MODULE ${s} ----\nEXTENDS ${n}\n\n${r} == ${i}\n====`,l=e=>Fo(`Unknown location\n\n${e} while parsing breakpoint expression "${i}"`);try{t.y(c)}catch(t){throw t instanceof e.F?Fo(`Syntax error while parsing breakpoint expression "${i}"`):t}let u=!1,d=!1,f=(()=>{try{return ka(c,a,{version:o,onModule:(e,t)=>{let n=()=>t.every(e=>e.isWarning);if(!n())return;let r=po(e,{messages:t,isTlc174:o===`1.7.4`});e.name===s&&(u=!0,d=r&&n())}})}catch(t){throw t instanceof e.F?l(`Semantic error`):t}})();if(!u)throw l(`Semantic error`);if(!d)throw l(`Level-checking error`);let p=Po(f.root,r)?.level??0;if(p===3)throw Fo(`Unknown location\n\nDebug expressions must be action-level or below; actual level: ${p} (Temporal)`);return p},Lo=(e,n,r,i,a)=>{let o=Date.now(),s=r.map((e,t)=>({expression:e.expression,name:Po(n,e.expression)?e.expression:`__DebuggerExpr__${o+t}`})),c=s.map(e=>e.name),l=s.filter(e=>e.name!==e.expression);if(l.length===0)return{names:c,source:e};let u=t=>t===n.name?e:i(t),d=n.context.symbols.find(e=>e.kind===`OpDecl`&&e.declKind===3),f=l.map(e=>{let t=`${e.name} == `;return Io(n.name,e.name,e.expression,u,a)===0&&d?`${e.name} ==\nLET ${e.name}State == ${d.name} IN\n${` `.repeat(t.length)}${e.expression}`:`${t}${e.expression}`}),p=e.split(`
38
+ `),m=(t.y(e).location.range?.end.line??p.length)-1,h=p[m].search(/={4,}/);return{names:c,source:[...p.slice(0,m),p[m].slice(0,h),...f,p[m].slice(h),...p.slice(m+1)].join(`
39
+ `)}},Ro=(1n<<63n)-1n,zo=[[-123456,-123456],[-1,0],[1e3,1003],[1005,1005],[1101,1102],[2e3,2001],[2100,2149],[2154,2274],[2279,2287],[2300,2301],[2400,2405],[2501,2502],[2772,2780],[3e3,3002],[3100,3114],[4e3,4002],[5001,5007],[7e3,7010],[2e4,2e4]],Bo=[[4003,4005],[4200,4206],[4220,4224],[4240,4247],[4260,4262],[4270,4275],[4290,4294],[4310,4315],[4330,4337],[4350,4357]],Vo=/* @__PURE__ */ new Map([[4800,`EXTENDED_MODULES_SYMBOL_UNIFICATION_AMBIGUITY`],[4801,`INSTANCED_MODULES_SYMBOL_UNIFICATION_AMBIGUITY`],[4802,`RECORD_CONSTRUCTOR_FIELD_NAME_CLASH`],[4803,`PLUSCAL_ALGORITHM_AND_TRANSLATION_CHANGED_SINCE_LAST_TRANSLATION`],[4804,`PLUSCAL_ALGORITHM_CHANGED_SINCE_LAST_TRANSLATION`],[4805,`PLUSCAL_TRANSLATION_CHANGED_SINCE_LAST_TRANSLATION`]]),Ho=(e,t,n)=>({module:e,constant:n,operators:[{kind:`postcondition`,operator:t}]}),Uo={json:Ho(`_JsonTrace`,`_JsonTrace`,`_JsonTraceFile`),tla:Ho(`_TLAPlusCounterExample`,`_TLAPlusCounterExample`,`_TLAPlusCounterExampleFile`),tlc:Ho(`_TLCTrace`,`_TLCTrace`,`_TLCTraceFile`),tlcplain:Ho(`_TLCTracePlain`,`_TLCTrace`,`_TLCTraceFile`),tlctespec:Ho(`_TLCTESpec`,`_TLCTrace`,`_TLCTraceFile`),tlcaction:Ho(`_TLCActionTrace`,`_TLCTrace`,`_TLCTraceFile`),dot:Ho(`_DotTrace`,`_DotTrace`,`_DotTraceFile`)},Wo=(e,t)=>({module:e,constant:`${t}InputFile`,operators:[{kind:`constraint`,operator:`${t}Constraint`},{kind:`view`,operator:`${t}View`}]}),Go={tlc:Wo(`_TLCTrace`,`_TLCTrace`),json:Wo(`_JsonTrace`,`_JsonTrace`)},Ko=(e,t)=>e.some(e=>t>=e[0]&&t<=e[1]),qo=(e,t)=>{if(e===``)return[e];let n=e.split(t);for(;n.at(-1)===``;)n.pop();return n},Jo=(e,t)=>[...new Set(e.filter(e=>t.includes(e)))].sort((e,t)=>e-t),Yo=(e,t)=>{if(!/^[+-]?\d+$/.test(e))return;let n=BigInt(e);return BigInt.asIntN(t,n)===n?n:void 0},Xo=e=>/^[+-]?(NaN|Infinity|(\d+\.?\d*|\.\d+)([eE][+-]?\d+)?[fFdD]?)$/.test(e.trim())?Number.parseFloat(e.trim().replace(/[fFdD]$/,``)):void 0,Zo=()=>({specs:[],configPath:void 0,seed:0n,aril:0n,workers:1,coverage:void 0,livenessCheck:`default`,dump:void 0,fingerprintIndex:0,maxSetSize:void 0,isLazyValueExpanded:!0,isViewPrinted:!1,metadir:void 0,recoverDirectory:void 0,mode:`model-check`,dfidDepth:void 0,traceDepth:100,traceCount:void 0,scheduler:`random`,isTool:!1,isContinued:!1,isDeadlockChecked:!0,isWarningEnabled:!0,isTraceSpecForced:!1,isTraceSpecDisabled:!1,isTraceBinaryDisabled:!1,traceSpecPath:void 0,isDiffTrace:!1,suppressedCodes:[],errorCodes:[],userFile:void 0,invariants:[],moduleOperators:[]}),Qo={"-modelcheck":()=>{},"-difftrace":e=>{e.isDiffTrace=!0},"-deadlock":e=>{e.isDeadlockChecked=!1},"-cleanup":()=>{},"-nowarning":e=>{e.isWarningEnabled=!1},"-gzip":()=>{},"-terse":e=>{e.isLazyValueExpanded=!1},"-continue":e=>{e.isContinued=!0},"-view":e=>{e.isViewPrinted=!0},"-debug":()=>{},"-tool":e=>{e.isTool=!0}},$o=(e,t,n)=>(r,i)=>{let a=Yo(i,e);return a===void 0?`${t} But encountered ${i}`:n(r,a,i)},es=(e,t,n,r)=>({missing:t,apply:$o(32,n,(t,n)=>{let i=BigInt.asIntN(32,n*60000n);if(i<0n)return`Error: expect a nonnegative integer for -${e} option.`;r(t,Number(i)/6e4)})}),ts={"-teSpecOutDir":{missing:`Error: expected a path for -teSpecOutDir option.`,apply:(e,t)=>{e.traceSpecPath=t}},"-userFile":{missing:`Error: need to specify the full qualified file.`,apply:(e,t)=>{try{(0,a.closeSync)((0,a.openSync)(t,`w`))}catch{return`Error: Failed to create user output log file.`}e.userFile=t}},"-lncheck":{missing:`Error: expect a strategy such as final for -lncheck option.`,apply:(e,t)=>{e.livenessCheck=t.toLowerCase()}},"-config":{missing:`Error: expect a file name for -config option.`,apply:(e,t)=>{let n=t.replace(/\.cfg$/,``);e.configPath=n.endsWith(`.tla`)?n:`${n}.cfg`}},"-coverage":es(`coverage`,`Error: coverage report interval required.`,`Error: An integer for coverage report interval required.`,(e,t)=>{e.coverage=t}),"-checkpoint":es(`checkpoint`,`Error: checkpoint interval required.`,`Error: An integer for checkpoint interval is required.`,()=>{}),"-depth":{missing:`Error: trace length required.`,apply:$o(32,`Error: An integer for trace length required.`,(e,t)=>{e.traceDepth=Number(t)})},"-seed":{missing:`Error: seed required.`,apply:$o(64,`Error: An integer for seed required.`,(e,t)=>{e.seed=t})},"-aril":{missing:`Error: aril required.`,apply:$o(64,`Error: An integer for aril required.`,(e,t)=>{e.aril=t})},"-maxSetSize":{missing:`Error: maxSetSize required.`,apply:$o(32,`Error: An integer for maxSetSize required.`,(e,n,r)=>{if(n<1n)return`Error: Value in interval [0, ${t.wt}] for maxSetSize required. But encountered ${r}`;e.maxSetSize=Number(n)})},"-recover":{missing:`Error: need to specify the metadata directory for recovery.`,apply:(e,t)=>{e.recoverDirectory=t}},"-metadir":{missing:`Error: need to specify the metadata directory.`,apply:(e,t)=>{e.metadir=t}},"-workers":{missing:`Error: expect an integer or 'auto' for -workers option.`,apply:(e,t)=>{let n=t.trim().toLowerCase()===`auto`?BigInt((0,c.availableParallelism)()):Yo(t,32);if(n===void 0)return`Error: worker number or 'auto' required. But encountered ${t}`;if(n<1n)return`Error: at least one worker required.`;e.workers=Number(n)}},"-dfid":{missing:`Error: expect a nonnegative integer for -dfid option.`,apply:$o(32,`Error: expect a nonnegative integer for -dfid option.`,(e,t)=>{if(t<0n)return`Error: expect a nonnegative integer for -dfid option.`;e.dfidDepth=Number(t)})},"-fp":{missing:`Error: expect an integer for -fp option.`,apply:$o(32,`Error: A number for -fp is required.`,(e,t)=>{if(t<0n||t>=131)return`Error: The number for -fp must be between 0 and 130 (inclusive).`;e.fingerprintIndex=Number(t)})},"-fpmem":{missing:`Error: fpset memory size required.`,apply:(e,t)=>{let n=Xo(t);if(n===void 0||n<0)return`Error: An positive integer or a fraction for fpset memory size/percentage required. But encountered ${t}`;n>1&&process.stdout.write(`Using -fpmem with an abolute memory value has been deprecated. Please allocate memory for the TLC process via the JVM mechanisms and use -fpmem to set the fraction to be used for fingerprint storage.
40
+ `)}},"-fpbits":{missing:`Error: fpbits required.`,apply:$o(32,`Error: An integer for fpbits required.`,(e,t,n)=>t<0n||t>30n?`Error: Value in interval [0, 30] for fpbits required. But encountered ${n}`:void 0)}},ns={"-loadtrace":{name:`-loadTrace`,missing:`Error: A format and a file name for loading traces required.`,formats:Go},"-dumptrace":{name:`-dumpTrace`,missing:`Error: A format and a file name for dumping traces required.`,formats:Uo}},rs=e=>{let t=Zo(),n=0,r=e=>({kind:`command-line`,error:e,isTool:t.isTool}),i=()=>({kind:`uncaught`,error:`java.lang.ArrayIndexOutOfBoundsException: Index ${e.length} out of bounds for length ${e.length}`,isTool:t.isTool}),a={tlc:[],sany:[]},o={tlc:[],sany:[]},s=()=>e[n],c=()=>e[n++];for(;n<e.length;){let l=c();if(Object.hasOwn(Qo,l))Qo[l](t);else if(Object.hasOwn(ts,l)){let e=c();if(e===void 0)return r(ts[l].missing);let n=ts[l].apply(t,e);if(n!==void 0)return r(n)}else if(l===`-simulate`||l===`-generate`){t.mode=l===`-generate`?`generate`:`simulate`;let e=s();if(e===void 0||![`stats=`,`file=`,`num=`,`sched`].some(t=>e.includes(t)))continue;n++;let i=e.split(`,`).some(e=>e.startsWith(`file=`));t.scheduler=e.split(`,`).includes(`sched=rl`)?`rl`:e.split(`,`).includes(`sched=rlaction`)?`rlaction`:`random`;for(let n of e.split(`,`).filter(e=>e.startsWith(`num=`))){let e=n.replace(`num=`,``);if(t.traceCount=Yo(e,64),t.traceCount===void 0)return{kind:`uncaught`,error:`java.lang.NumberFormatException: For input string: "${e}"`,isTool:t.isTool}}if((t.traceCount??Ro)===Ro&&i)return r(`Error: You need to specify a 'num' argument when using the 'file' argument, for example: '"num=5,file=test.txt"'.`)}else if(l===`-suppressMessages`||l===`-messagesAsErrors`){let e=c();if(e===void 0)return r(`Error: ${l} requires a comma-separated list of message codes.`);let t=l===`-suppressMessages`?a:o;for(let n of qo(e,`,`)){let e=n.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``),i=Yo(e,32);if(i===void 0)return r(`Error: For input string: "${e}"`);let o=Number(i);if(Ko(zo,o))t.tlc.push(o);else{if(!Vo.has(o)&&!Ko(Bo,o))return r(`Error: unknown message code: ${o}`);if(t===a&&!Vo.has(o))return r(`Error: code ${o} is an error and cannot be suppressed.`);t.sany.push(o)}}}else if(l===`-inv`){let e=c();if(e===void 0)return i();t.invariants.push({modules:[...new Set([...e.matchAll(/INSTANCE\s+(\w+)/g)].map(e=>e[1]))],expression:e})}else if(l===`-invlevel`){let e=c();if(e===void 0)return i();if(Yo(e,32)===void 0)return r(`Error: An integer for -invlevel required. But encountered ${e}`);t.invariants.push({modules:[`TLC`,`Naturals`],expression:`LET _T == INSTANCE TLC _N == INSTANCE Naturals IN _N!<(_T!TLCGet("level"), ${e})`})}else if(l===`-debugger`){let e=s();e!==void 0&&[`port=`,`nosuspend`,`nohalt`,`suspend`,`halt`].some(t=>e.includes(t))&&n++}else if(l===`-generateSpecTE`)t.isTraceSpecForced=!0,s()===`nomonolith`&&n++;else if(l===`-noGenerateSpecTE`||l.toLowerCase()===`-note`)t.isTraceSpecDisabled=!0;else if(l===`-noGenerateSpecTEBin`||l.toLowerCase()===`-notebin`)t.isTraceBinaryDisabled=!0;else{if(l===`-help`||l===`-h`)return`usage`;if(l===`-dump`){let i=s();if(i?.startsWith(`class,`))return r(`Trying to instantiate a custom IStateWriter implementation ${i.replaceAll(`class,`,``)}.`);let a=i?.startsWith(`dot`)&&n+1<e.length?2:1;if(t.dump=e.slice(n,n+a),n+=a,t.dump.length===0)return r(`Error: A file name for dumping states required.`)}else if(Object.hasOwn(ns,l.toLowerCase())){let i=ns[l.toLowerCase()];if(n+1>=e.length)return r(i.missing);let a=c(),o=c();if(!Object.hasOwn(i.formats,a.toLowerCase()))return r(`Error: Unknown format ${a} given to ${i.name}.`);let s=i.formats[a.toLowerCase()];t.moduleOperators.push(...s.operators.map(e=>({...e,module:s.module,constants:{[s.constant]:o}})))}else if(l.toLowerCase()===`-postcondition`){let e=c();if(e===void 0)return r(`Error: Module!Operator for postCondition required.`);if(!e.includes(`!`))return r(`Module!Operator for postCondition required. Encountered: ${e}`);let n=qo(e,`!`);if(n.length!==2)return r(`Module!Operator for postCondition must be of the form module!operator. Encountered: ${e}`);if(n[0]===``)return r(`Module name for postCondition required. Encountered: ${e}`);if(n[0].includes(`.`))return r(`Module name for postCondition must not contain a dot. Encountered: ${n[0]}`);if(n[1].includes(`.`))return r(`Operator name for postCondition must not contain a dot. Encountered: ${n[1]}`);t.moduleOperators.push({kind:`postcondition`,module:n[0],operator:n[1]})}else{if(l.startsWith(`-`))return r(`Error: unrecognized option: ${l}`);t.specs.push(l)}}}if(!t.isWarningEnabled&&a.tlc.length+a.sany.length>0)return r(`Error: -nowarning already suppresses all warnings, making -suppressMessages redundant. Remove -nowarning to suppress only the specified messages, or remove -suppressMessages to suppress all warnings.`);let l=Jo(a.tlc,o.tlc),u=l.length>0?l.map(String):Jo(a.sany,o.sany).map(e=>Vo.get(e)??String(e));return u.length>0?r(`Error: The following codes were set to both -suppressMessages and -messagesAsErrors: [${u.join(`, `)}]`):(t.suppressedCodes=[...a.tlc,...a.sany],t.errorCodes=[...o.tlc,...o.sany],t)},is=(e,n)=>e.print(t.Lt.computingInitProgress,t.Rt.none,`Computed ${n} initial states...`),as=(e,n)=>e===`invariant-violation`?{code:t.Lt.invariantViolatedInitial,text:`Invariant ${n} is violated by the initial state:`}:{code:t.Lt.propertyViolatedInitial,text:`Property ${n} is violated by the initial state:`},os=(e,n)=>n?.forEach(n=>{if(typeof n==`string`)return console.log(n);if(n.kind===`initial-states-progress`)return is(e,n.count);let r=as(n.status,n.name);e.print(r.code,t.Rt.error,`${r.text}\n${t.Ot(n.state)}`)}),ss={code:t.Lt.behaviorUpToThisPoint,text:`The behavior up to this point is:`},cs={code:t.Lt.counterExample,text:`The following behavior constitutes a counter-example:
41
+ `},ls={"error-trace":{heading:ss,isLastDiffed:!1},simulation:{heading:ss,isLastDiffed:!0},"counter-example":{heading:cs,isLastDiffed:!0}},us=(n,r,i)=>{let a=ls[i].heading,o=i===`counter-example`&&n.version===`1.7.4`;r.length>0&&n.print(a.code,t.Rt.error,a.text);try{r.forEach((e,a)=>{(a>0||o)&&os(n,e.output);let s=n.isDiffTrace&&a>0&&(ls[i].isLastDiffed||a<r.length-1);n.print(t.Lt.statePrint2,t.Rt.state,`${a+1}: <${e.label??e.action??`Initial predicate`}>\n${t.Ot(e.state,s?r[a-1].state:void 0)}`)})}catch(r){if(!(r instanceof e.g))throw r;n.print(t.Lt.general,t.Rt.error,r.message)}},ds=(e,t)=>t===`1.7.4`||e.length===0?`Temporal properties were violated.
42
+ `:e.length===1?`Temporal property ${e[0]} was violated.\n`:`Temporal properties ${e.slice(0,-1).join(`, `)}${e.length>2?`,`:``} and ${e[e.length-1]} were violated.\n`,fs=e=>e.filter((t,n)=>t!==e[n-1]).map((e,n)=>`${n}) ${t.Y(e)}\n`).toReversed().join(``),ps=e=>{if(e.length===0)return` The error call stack is empty.
43
+ `;let t=[];return e.forEach((n,r)=>{let i=n.location.range;n!==e[r-1]&&i&&t.push(`${t.length}. Line ${i.start.line}, column ${i.start.column} to line ${i.end.line}, column ${i.end.column} in ${i.module}\n`)}),`${t.join(``)}\n`},ms=(e,n)=>{let r=n.generated,i=n.distinct,a=t.Ht(/* @__PURE__ */ new Date);r===i?e.print(t.Lt.initGenerated1,t.Rt.none,`Finished computing initial states: ${i} distinct state${i===1?``:`s`} generated at ${a}.`):e.print(t.Lt.initGenerated2,t.Rt.none,`Finished computing initial states: ${r} state${r===1?``:`s`} generated, with ${i} of them distinct at ${a}.`)},hs=(e,n,r)=>{let i=Math.max(Date.now()-(r??0),1)/6e4,a=e=>e.toLocaleString(`en-US`),o=(e,t)=>r===void 0?``:` (${a(Math.floor(e/i))} ${t}/min)`;e.print(t.Lt.progress,t.Rt.none,`Progress(${Math.max(n.depth,1)}) at ${t.Ht(/* @__PURE__ */ new Date)}: ${a(n.generatedStates)} states generated${o(n.generatedStates,`s`)}, ${a(n.distinctStates)} distinct states found${o(n.distinctStates,`ds`)}, ${a(n.queuedStates)} states left on queue.`)},gs={init:t.Lt.coverageInit,next:t.Lt.coverageNext,invariant:t.Lt.coverageProperty,implied:t.Lt.coverageProperty,constraint:t.Lt.coverageConstraint},_s=(e,n,r)=>{let i=(n,r)=>e.print(n,t.Rt.none,r);i(t.Lt.coverageStart,`The coverage statistics at ${t.Ht(/* @__PURE__ */ new Date)} (see https://explain.tlapl.us/module-coverage-statistics for how to interpret the following statistics).`),n.variables.forEach(e=>i(t.Lt.coverageVariable,`<${e.label}>: ${e.distinct}`)),n.relations.forEach(e=>{let n=gs[e.kind];i(n,n===t.Lt.coverageProperty?`<${e.label}>`:`<${e.label}>: ${e.distinct}:${e.generated}`),e.expressions.forEach(e=>{let n=` ${`|`.repeat(e.depth)}${e.location}`;e.cost>0?i(t.Lt.coverageValueCost,`${n}: ${e.count}:${e.cost}`):i(t.Lt.coverageValue,`${n}: ${e.count}`)})}),Date.now()-r>3e5?i(t.Lt.coverageEndOverhead,`End of statistics (please note that for performance reasons large models
44
+ are best checked with coverage and cost statistics disabled).`):i(t.Lt.coverageEnd,`End of statistics.`)},vs=(e,t)=>(0,i.join)(e,`${t}.class`),ys=(e,n,r,a)=>{let s=e.print;switch(n.kind){case`parsed`:r.isParsed=!0,e.isTool&&s(t.Lt.sanyFinished,t.Rt.none,`SANY finished.`),s(t.Lt.starting,t.Rt.none,`Starting... (${t.Ht(/* @__PURE__ */ new Date)})`);return;case`constant-level-invariant`:if(e.version===`1.7.4`)return;s(t.Lt.constantLevelInvariant,t.Rt.warning,`The invariant ${n.name} is a constant-level formula (i.e., it contains no variables, primes, or temporal operators) and evaluates to TRUE. To assert constant-level formulas in your spec, use ASSUME ConstInv. If you optionally want to give the assumption a name, write ASSUME YourAssumption == ConstInv instead. See https://explain.tlapl.us/assumptions-and-invariants for additional details.`);return;case`state-level-property`:if(e.version===`1.7.4`)return;s(t.Lt.stateLevelProperty,t.Rt.warning,`The formula ${n.name} is a state-level formula, but it was used as a PROPERTY (or PROPERTIES), where a temporal formula is typically expected. State-level formulas used as PROPERTY or PROPERTIES are only checked in the initial state. To verify that the formula ${n.name} holds in all states of every behavior, use INVARIANT ${n.name} instead. Alternatively, applying the "always" temporal operator ([]) to the state-level formula ${n.name} changes it into a temporal formula, asserting that ${n.name} holds in all states of every behavior. See https://explain.tlapl.us/invariants-and-properties for additional details.`);return;case`liveness-initializing`:n.isSymmetric&&s(t.Lt.livenessSymmetry,t.Rt.warning,`Declaring symmetry during liveness checking is dangerous. It might cause TLC to miss violations of the stated liveness properties. Please check liveness without symmetry defined.`),n.isConstrained&&e.version===`1.7.4`&&s(t.Lt.livenessConstraints,t.Rt.warning,`Declaring state or action constraints during liveness checking is dangerous: Please read section 14.3.5 on page 247 of Specifying Systems (https://lamport.azurewebsites.net/tla/book.html) and optionally the discussion at https://discuss.tlapl.us/msg00994.html for more details.`);return;case`liveness-prepared`:s(t.Lt.temporalBranches,t.Rt.none,`Implied-temporal checking--satisfiability problem has ${n.branches} branches.`);return;case`java-override`:{let e=(0,o.pathToFileURL)((0,i.resolve)(vs(a,n.module))).href;s(n.isMatched?t.Lt.javaOverrideLoaded:t.Lt.javaOverrideMismatch,n.isMatched?t.Rt.none:t.Rt.warning,`${n.isMatched?`Loading`:`Failed to match`} ${n.operator} operator override from ${e.replace(`file:///`,`file:/`)} with signature: <Java Method: ${n.signature}>.`);return}case`initial-states-started`:s(t.Lt.computingInit,t.Rt.none,`Computing initial states...`);return;case`initial-states-progress`:is(e,n.count);return;case`initial-states-computed`:ms(e,n.initialStates);return;case`progress`:hs(e,n.statistics,r.startTime),n.statistics.coverage&&_s(e,n.statistics.coverage,r.startTime);return;case`liveness-started`:{r.livenessStartTime=Date.now(),n.isComplete&&hs(e,n.statistics);let i=n.branches>1?`${n.branches} branches of `:``,a=n.branches*n.states;s(t.Lt.checkingTemporal,t.Rt.none,`Checking ${i}temporal properties for the ${n.isComplete?`complete`:`current`} state space with ${a} total distinct states at (${t.Ht(/* @__PURE__ */ new Date)})`);return}case`liveness-finished`:bs(e,r);return;case`sequential-fallback`:process.stderr.write(`Warning: the search ordered the string ${JSON.stringify(n.string)} against another string it created, so tla-ts checks the model again with one worker. Workers don't agree on the order of strings the search creates.\n`);return;case`warning`:s(n.code,t.Rt.warning,n.text);return;case`violation`:Ss(n.status,n.violation,e)}},bs=(e,n)=>{n.livenessStartTime!==void 0&&(e.print(t.Lt.checkingTemporalEnd,t.Rt.none,`Finished checking temporal properties in ${t.Ut(Date.now()-n.livenessStartTime)} at ${t.Ht(/* @__PURE__ */ new Date)}`),n.livenessStartTime=void 0)},xs=(e,n)=>{n&&(n.counts&&console.log(n.counts),e.print(n.code,t.Rt.error,t.Bt(n.code,n.message,e.isTool)))},Ss=(e,n,r)=>{let i=r.print,a=n.name,o=n.loopStart,s=o===void 0&&n.trace.length===1&&(e===`invariant-violation`||e===`liveness-violation`),c={code:t.Lt.temporalPropertyViolated,text:ds(n.properties??[a],r.version)},l={success:void 0,error:void 0,"assumption-violation":n.message?{code:t.Lt.assumptionEvaluationError,text:t.Bt(t.Lt.assumptionEvaluationError,`Evaluating assumption ${a} failed.\n${n.message}`,r.isTool)}:{code:t.Lt.assumptionFalse,text:`Assumption ${a} is false.`},deadlock:{code:t.Lt.deadlockReached,text:`Deadlock reached.`},"invariant-violation":s?as(`invariant-violation`,a):{code:t.Lt.invariantViolatedBehavior,text:`Invariant ${a} is violated.`},"property-violation":c,"liveness-violation":o===void 0?s?as(`liveness-violation`,a):{code:t.Lt.actionPropertyViolatedBehavior,text:`Action property ${a} is violated.`}:c,"postcondition-violation":{code:n.postcondition?.code??t.Lt.general,text:t.Bt(n.postcondition?.code??t.Lt.general,n.message??`Postcondition ${a} is false.`,r.isTool)}}[e],u=e===`property-violation`,d=o!==void 0&&!u,f=u||d;if(f&&r.version!==`1.7.4`&&os(r,n.trace[0]?.output),n.counts&&console.log(n.counts),l){let e=s?`${l.text}\n${t.Ot(n.trace[0].state)}`:l.text;i(l.code,t.Rt.error,e)}if(s||(f||os(r,n.trace[0]?.output),us(r,n.trace,f?`counter-example`:`error-trace`)),os(r,n.traceOutput),d){let e=n.loopLabel;o===n.trace.length-1?i(t.Lt.statePrint3,t.Rt.state,`${o+2}: Stuttering`):r.isTool?i(t.Lt.backToState,t.Rt.state,`${o+1}: Back to state${e?`: <${e}>\n`:``}`):console.log(`Back to state ${o+1}${e?`: <${e}>\n`:``}`)}n.warning&&r.version!==`1.7.4`&&i(n.warning.code,t.Rt.warning,n.warning.text);let p=n.unwitnessed??(e===`postcondition-violation`?void 0:n.postcondition);return os(r,n.postconditionOutput),xs(r,p),!s&&e!==`assumption-violation`},Cs=(e,n)=>e.print(t.Lt.nestedExpression,t.Rt.error,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\n${ps(n)}`),ws=(e,n,r)=>e.print(t.Lt.success,t.Rt.none,[`Model checking completed. No error has been found.`,` Estimates of the probability that TLC did not check all reachable states`,` because two distinct states had the same fingerprint:`,` calculated (optimistic): val = ${t.r(n)}`,...r===void 0?[]:[` based on the actual fingerprints: val = ${t.r(r)}`]].join(`
45
+ `)),Ts=(e,n)=>{switch(n.kind){case`message`:e.print(n.code,n.isError?t.Rt.error:t.Rt.none,e.isTool?n.toolMessage:n.message);return;case`behavior`:n.states.forEach((r,i)=>n.isInvariant?e.print(t.Lt.statePrint2,t.Rt.state,`${i+1}: \n${t.Ot(r,e.isDiffTrace?n.states[i-1]:void 0)}`):e.print(t.Lt.statePrint1,t.Rt.state,`${i+1}:\n${t.Ot(r)}`));return;case`nested-expressions`:Cs(e,n.callStack);return;case`success`:ws(e,n.optimistic,n.actual)}},Es=(n,r,i)=>{let a=r.print;if(n.failure){let i=n.failure,o=r.isTool?i.toolMessage:i.message,s=()=>{let e=i.fingerprint;if(e){let n=i.callStack?.length&&r.version!==`1.7.4`?ps(i.callStack):fs(e.sources);a(t.Lt.fingerprintFailed,t.Rt.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${n}\nReason:\n${t.Vt(e.reason,r.isTool)}`)}else i.callStack&&Cs(r,i.callStack)};i.isCallStackFirst&&s();let c=i.initialState&&(()=>{try{return`While working on the initial state:\n${t.Ot(i.initialState)}`}catch(t){throw t instanceof e.b?e.at(new e.b(`${e.G}${t.message}`),e.nt.error):t}})();a(c?t.Lt.initialState:i.code,t.Rt.error,c?`${o}\n${c}`:o),os(r,i.trace[0]?.output),us(r,i.trace,`error-trace`);let l=i.traceFailure;l&&a(l.code,t.Rt.error,r.isTool?l.toolMessage:l.message),os(r,i.traceOutput),xs(r,i.postcondition),i.isCallStackFirst||s()}else if(n.violation){if(!Ss(n.status,n.violation,r))return;let e=n.additionalViolation;e&&Ss(`property-violation`,e,r),n.liveCallStack&&Cs(r,n.liveCallStack)}else n.status===`success`&&(bs(r,i),ws(r,t.o(n.distinctStates,n.generatedStates),n.fingerprintDistance===void 0?void 0:t.i(n.fingerprintDistance)));if(n.failure?.isWithoutStatistics)return;n.status!==`success`&&bs(r,i),n.coverage&&_s(r,n.coverage,i.startTime),r.isTool&&hs(r,n,i.startTime),a(t.Lt.stats,t.Rt.none,`${n.generatedStates} states generated, ${n.distinctStates} distinct states found, ${n.queuedStates} states left on queue.`);let o=r.version===`1.7.4`,s=o?n.outDegrees??n.violationOutDegrees:n.outDegrees;(!o||s)&&a(t.Lt.searchDepth,t.Rt.none,`The depth of the complete state graph search is ${o?Math.max(n.depth,1):n.depth}.`);let c=s&&t.s(s);c&&a(t.Lt.stateGraphOutdegree,t.Rt.none,c)},Ds=e=>e.print(t.Lt.version,t.Rt.none,`TLC2 Version ${T} (rev: tla-ts)`),Os=(e,n,r)=>{let i=t.zt({isTool:e,version:n});return Ds(i),i.print(t.Lt.commandLineError,t.Rt.error,`${r}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1},ks=(e,n)=>{let r=`${n.workers} worker${n.workers===1?``:`s`} on ${(0,c.availableParallelism)()} cores with ${Math.floor((0,l.getHeapStatistics)().heap_size_limit/1024/1024)}MB heap and 0MB offheap memory [pid: ${process.pid}] (${(0,c.type)()} ${(0,c.release)()} ${(0,c.arch)()}, Node.js ${process.versions.node} ${process.arch.endsWith(`64`)?64:32}bit`;n.mode===`model-check`&&n.dfidDepth!==void 0?e.print(t.Lt.depthFirstModelChecking,t.Rt.none,`Running depth-first search Model-Checking with fp ${n.fingerprintIndex} and seed ${n.seed} with ${r}).`):n.mode===`model-check`?e.print(t.Lt.modelChecking,t.Rt.none,`Running breadth-first search Model-Checking with fp ${n.fingerprintIndex} and seed ${n.seed} with ${r}, MemFPSet, MemStateQueue).`):e.print(t.Lt.simulating,t.Rt.none,`Running ${n.scheduler===`rl`?`RL`:`Random`} Simulation with seed ${n.seed} with ${r}).`)},As=(e,n)=>{let r=e.print;switch(n.kind){case`message`:r(n.code,n.isError?t.Rt.error:t.Rt.none,e.isTool?n.toolMessage:n.message);return;case`behavior`:{let i=n.trace[n.trace.length-1];if(!n.isLastStateOnly){us(e,n.trace,`simulation`);return}r(t.Lt.errorState,t.Rt.none,`The error state is:
46
+ `),r(t.Lt.statePrint1,t.Rt.state,`:\n${t.Ot(i.state)}`);return}case`progress`:{let i=n.statistics;if(e.isTool){js(e,i);return}let a=i.levelM2/(i.traces+1);r(t.Lt.simulationProgress,t.Rt.none,`Progress: ${i.generatedStates} states checked, ${i.traces} traces generated (trace length: mean=${i.levelMean}, var(x)=${Math.round(a)}, sd=${Math.round(Math.sqrt(a))})`);return}case`summary`:e.isTool&&js(e,n.statistics),r(t.Lt.simulationStats,t.Rt.none,`The number of states generated: ${n.statistics.generatedStates}\nSimulation using seed ${n.statistics.seed} and aril ${n.statistics.aril}`)}},js=(e,n)=>e.print(t.Lt.simulationProgress,t.Rt.none,`Progress(${n.traces}) at ${t.Ht(/* @__PURE__ */ new Date)}: ${n.generatedStates} states generated, -1 distinct states found, -1 states left on queue.`),Ms=[{name:`-checkpoint`,sampleValue:`minutes`,description:`interval between check point; defaults to 30`,isOptional:!0},{name:`-cleanup`,description:`clean up the states directory`,isOptional:!0},{name:`-config`,sampleValue:`file`,description:`provide the configuration file; defaults to SPEC.cfg`,isOptional:!0},{name:`-continue`,description:`continue running even when an invariant is violated; default
47
+ behavior is to halt on first violation`,isOptional:!0},{name:`-coverage`,sampleValue:`minutes`,description:`interval between the collection of coverage information;
48
+ if not specified, no coverage will be collected`,isOptional:!0},{name:`-deadlock`,description:`if specified DO NOT CHECK FOR DEADLOCK. Setting the flag is
49
+ the same as setting CHECK_DEADLOCK to FALSE in config
50
+ file. When -deadlock is specified, config entry is
51
+ ignored; default behavior is to check for deadlocks`,isOptional:!0},{name:`-postCondition`,sampleValue:`mod!oper`,description:`evaluate the given (constant-level) operator oper in the TLA+
52
+ module mod at the end of model-checking.`,isOptional:!0},{name:`-difftrace`,description:`show only the differences between successive states when
53
+ printing trace information; defaults to printing
54
+ full state descriptions`,isOptional:!0},{name:`-dumpTrace`,sampleValue:`format file`,description:`in case of a property violation, formats the TLA+ error trace
55
+ as the given format and dumps the output to the specified
56
+ file. The file is relative to the same directory as the
57
+ main spec. At the time of writing, TLC supports the "tla"
58
+ and the "json" formats. To dump to multiple formats, the
59
+ -dumpTrace parameter may appear multiple times.
60
+ The git commits 1eb815620 and 386eaa19f show that adding new
61
+ formats is easy.
62
+ `,isOptional:!0},{name:`-inv`,sampleValue:`expr`,description:`evaluate the given (state-level) TLA+ formula expr as an invariant`,isOptional:!0},{name:`-invlevel`,sampleValue:`n`,description:`with n \\in Nat, evaluate the invariant TLCGet("level") < n,
63
+ where TLCGet("level") represents the distance of the current
64
+ state to some initial state. In other words, TLC will print the
65
+ first trace it encounters with length n. After that, TLC will
66
+ stop, unless the '-continue' parameter is specified.`,isOptional:!0},{name:`-debug`,description:`print various debugging information - not for production use
67
+ `,isOptional:!0},{name:`-dump`,sampleValue:`format file`,description:`dump all states into the specified file.
68
+ The format parameter can be omitted, or it can be a comma-separated
69
+ list beginning with 'dot' that may also contain a subset of
70
+ the items 'colorize', 'actionlabels', and 'constrained'. If format is
71
+ omitted, TLC writes a list of all reachable states, described by TLA+
72
+ formulas, on file. Otherwise, TLC writes the state graph in dot format,
73
+ the input format of the GraphViz program for displaying graphs.
74
+ The parameter 'colorize' indicates that state transitions should be
75
+ colored according to the action generating the transition,
76
+ and 'actionlabels' indicates that they should be labeled with
77
+ the name of the action. The parameter 'constrained' causes TLC to include
78
+ states in the dot file that are excluded from the model via a state or
79
+ action constraint.`,isOptional:!0},{name:`-fp`,sampleValue:`N`,description:`use the Nth irreducible polynomial from the list stored
80
+ in the class FP64`,isOptional:!0},{name:`-fpbits`,sampleValue:`num`,description:`the number of MSB used by MultiFPSet to create nested
81
+ FPSets; defaults to 1`,isOptional:!0},{name:`-fpmem`,sampleValue:`num`,description:`a value in (0.0,1.0) representing the ratio of total
82
+ physical memory to devote to storing the fingerprints
83
+ of found states; defaults to 0.25`,isOptional:!0},{name:`-noGenerateSpecTE`,description:`Whether to skip generating a trace exploration (TE) spec in
84
+ the event of TLC finding a state or behavior that does
85
+ not satisfy the invariants; TLC's default behavior is to
86
+ generate this spec.`,isOptional:!0},{name:`-teSpecOutDir`,sampleValue:`some-dir-name`,description:`Directory to which to output the TE spec if TLC generates
87
+ an error trace. Can be a relative (to root spec dir)
88
+ or absolute path. By default the TE spec is output
89
+ to the same directory as the main spec.`,isOptional:!0},{name:`-gzip`,description:`control if gzip is applied to value input/output streams;
90
+ defaults to 'off'`,isOptional:!0},{name:`-h`,description:`display these help instructions`,isOptional:!0},{name:`-loadTrace`,sampleValue:`format file`,description:`load a trace from the specified file in the given format
91
+ to use as a constraint. The file is relative to the same
92
+ directory as the main spec. At the time of writing, TLC
93
+ supports the "tlc" and the "json" formats.
94
+ Note: -loadTrace is not supported in simulation mode.
95
+ `,isOptional:!0},{name:`-maxSetSize`,sampleValue:`num`,description:`the size of the largest set which TLC will enumerate; defaults
96
+ to 1000000 (10^6)`,isOptional:!0},{name:`-metadir`,sampleValue:`path`,description:`specify the directory in which to store metadata; defaults to
97
+ SPEC-directory/states if not specified`,isOptional:!0},{name:`-nowarning`,description:`disable all warnings; defaults to reporting warnings`,isOptional:!0},{name:`-suppressMessages`,sampleValue:`codes`,description:`suppress specific messages; comma-separated list of
98
+ message codes; cannot be combined with -nowarning
99
+ SANY message codes can be found in https://github.com/tlaplus/tlaplus/blob/master/tlatools/org.lamport.tlatools/src/tla2sany/semantic/ErrorCode.java#L38
100
+ TLC message codes can be found in https://github.com/tlaplus/tlaplus/blob/master/tlatools/org.lamport.tlatools/src/tlc2/output/EC.java#L19`,isOptional:!0},{name:`-messagesAsErrors`,sampleValue:`codes`,description:`treat specific messages as errors; comma-separated list of
101
+ message codes
102
+ SANY message codes can be found in https://github.com/tlaplus/tlaplus/blob/master/tlatools/org.lamport.tlatools/src/tla2sany/semantic/ErrorCode.java#L38
103
+ TLC message codes can be found in https://github.com/tlaplus/tlaplus/blob/master/tlatools/org.lamport.tlatools/src/tlc2/output/EC.java#L19`,isOptional:!0},{name:`-recover`,sampleValue:`id`,description:`recover from the checkpoint with the specified id`,isOptional:!0},{name:`-terse`,description:`do not expand values in Print statements; defaults to
104
+ expanding values`,isOptional:!0},{name:`-tool`,description:`run in 'tool' mode, surrounding output with message codes;
105
+ if '-generateSpecTE' is specified, this is enabled
106
+ automatically`,isOptional:!0},{name:`-userFile`,sampleValue:`file`,description:`an absolute path to a file in which to log user output (for
107
+ example, that which is produced by Print)`,isOptional:!0},{name:`-workers`,sampleValue:`num`,description:`the number of TLC worker threads; defaults to 1. Use 'auto'
108
+ to automatically select the number of threads based on the
109
+ number of available cores.`,isOptional:!0},{name:`-debugger`,sampleValue:`nosuspend`,description:`run simulation or model-checking in debug mode such that TLC's
110
+ state-space exploration can be temporarily halted and variables
111
+ be inspected. The only debug front-end so far is the TLA+
112
+ VSCode extension, which has to be downloaded and configured
113
+ separately, though other front-ends could be implemeted via the
114
+ debug-adapter-protocol.
115
+ Specifying the optional parameter 'nosuspend' causes
116
+ TLC to start state-space exploration without waiting for a
117
+ debugger front-end to connect. Without 'nosuspend', TLC
118
+ suspends state-space exploration before the first ASSUME is
119
+ evaluated (but after constants are processed). With 'nohalt',
120
+ TLC does not halt state-space exploration when an evaluation
121
+ or runtime error is caught. Without 'nohalt', evaluation or
122
+ runtime errors can be inspected in the debugger before TLC
123
+ terminates. The optional parameter 'port=1274' makes the
124
+ debugger listen on port 1274 instead of on the standard
125
+ port 4712, and 'port=0' lets the debugger choose a port.
126
+ Multiple optional parameters must be comma-separated.
127
+ Specifying '-debugger' implies '-workers 1'.`,isOptional:!1,subOptions:`nosuspend`},{name:`SPEC`,isOptional:!1}],Ns=[[...Ms,{name:`-dfid`,sampleValue:`num`,description:`run the model check in depth-first iterative deepening
128
+ starting with an initial depth of 'num'`,isOptional:!0},{name:`-view`,description:`apply VIEW (if provided) when printing out states`,isOptional:!0}],[...Ms,{name:`-depth`,sampleValue:`num`,description:`specifies the depth of random simulation; defaults to 100`,isOptional:!0},{name:`-seed`,sampleValue:`num`,description:`provide the seed for random simulation; defaults to a
129
+ random long pulled from a pseudo-RNG`,isOptional:!0},{name:`-aril`,sampleValue:`num`,description:`adjust the seed for random simulation; defaults to 0`,isOptional:!0},{name:`-simulate`,description:`run in simulation mode; optional parameters may be specified
130
+ comma delimited: 'num=X' where X is the maximum number of
131
+ total traces to generate and/or 'file=Y' where Y is the
132
+ absolute-pathed prefix for trace file modules to be written
133
+ by the simulation workers; for example Y='/a/b/c/tr' would
134
+ produce, e.g, '/a/b/c/tr_1_15'`,isOptional:!1,subOptions:`file=X,num=Y`}]],Ps=[`When using the '-generateSpecTE' you can version the generated specification by doing:
135
+ ./tla2tools.jar -generateSpecTE MySpec.tla && NAME="SpecTE-$(date +%s)" && sed -e "s/MODULE SpecTE/MODULE $NAME/g" SpecTE.tla > $NAME.tla`,`If, while checking a SpecTE created via '-generateSpecTE', you get an error message concerning
136
+ CONSTANT declaration and you've previous used 'integers' as model values, rename your
137
+ model values to start with a non-numeral and rerun the model check to generate a new SpecTE.`,`If, while checking a SpecTE created via '-generateSpecTE', you get a warning concerning
138
+ duplicate operator definitions, this is likely due to the 'monolith' specification
139
+ creation. Try re-running TLC adding the 'nomonolith' option to the '-generateSpecTE'
140
+ parameter.`,`When using more than one worker, the reported depth might differ across runs. For small models, use a single worker. For large models, the diameter will almost always appear deterministic.`],X=e=>`\u001b[1m${e}\u001b[0m`,Fs=e=>`\u001b[3m${e}\u001b[0m`,Is=e=>e.name.startsWith(`-`)&&!e.name.startsWith(`--`),Ls=(e,t)=>e.name<t.name?-1:+(e.name>t.name),Rs=e=>e.subOptions===void 0?``:` [${e.subOptions}]`,zs=e=>{let t=[...e].sort(Ls),n=t.filter(e=>e.sampleValue===void 0&&e.isOptional&&Is(e)),r=n.filter(e=>e.name.length===2).map(e=>e.name.slice(1)).join(``),i=t.filter(e=>e.sampleValue===void 0&&!e.isOptional).sort((e,t)=>Is(e)===Is(t)?Ls(e,t):Is(e)?-1:1);return[X(`TLC`),...r===``?[]:[`[${X(`-${r}`)}]`],...n.filter(e=>e.name.length!==2).map(e=>`[${X(e.name)}${Rs(e)}]`),...t.filter(e=>e.sampleValue===void 0&&e.isOptional&&e.name.startsWith(`--`)).map(e=>`[${X(e.name)}${Rs(e)}]`),...t.filter(e=>e.sampleValue!==void 0&&e.isOptional).map(e=>`[${X(e.name)} ${e.subOptions===void 0?``:`[${e.subOptions}] `}${Fs(e.sampleValue??``)}]`),...t.filter(e=>e.sampleValue!==void 0&&!e.isOptional).map(e=>`${X(e.name)} ${Fs(e.sampleValue??``)}`),...i.map(e=>`${e.name}${Rs(e)}`)].join(` `)},Bs=()=>(/* @__PURE__ */ new Date()).toISOString().replace(/^(\d+)-(\d+)-(\d+)T(\d+):(\d+):(\d+).*$/,`Version $1.$2.$3.$4$5$6`),Vs=()=>{let e=[...new Map(Ns.flat().map(e=>[e.name,e])).values()].sort(Ls).filter(e=>e.sampleValue!==void 0||e.isOptional||Is(e)),t=(e,t)=>e.replace(/\r\n|\r|\n/g,`\n${t}`);return[``,`${X(`NAME`)}\n`,`\tTLC - provides model checking and simulation of TLA+ specifications - ${Bs()}\n\n`,`${X(`SYNOPSIS`)}\n`,...Ns.map(e=>`\t${zs(e)}`),``,`${X(`DESCRIPTION`)}\n`,`\t${t(`The model checker (TLC) provides the functionalities of model checking
141
+ or simulation of TLA+ specifications. It may be invoked from the command
142
+ line, or via the model checking functionality of the Toolbox.
143
+
144
+ By default, TLC starts in the model checking mode using breadth-first
145
+ approach for the state space exploration.
146
+
147
+ A pretty-printed and in-depth description of TLC can be found at:
148
+
149
+ https://lamport.azurewebsites.net/tla/current-tools.pdf`.replace(/TLC(\)|\s|$)/g,`${X(`TLC`)}$1`),` `)}`,``,`${X(`OPTIONS`)}\n`,...e.map(e=>`\t${X(e.name)}${e.sampleValue===void 0?``:` ${Fs(e.sampleValue)}`}\n\t\t${t(e.description??``,` `)}`),``,`${X(`TIPS`)}\n`,...Ps.map(e=>`\t${t(e,` `)}\n`)].join(`
150
+ `)},Hs=async t=>{let n=(await Promise.resolve().then(()=>require("./compile.cjs"))).compile((0,a.readFileSync)(t,`utf8`),t),r=`\\* Generated by tla-ts from ${(0,i.basename)(t)}. Edit ${(0,i.basename)(t)} instead.`,o=(0,i.join)((0,i.dirname)(t),`${n.name}.tla`),s=(0,i.join)((0,i.dirname)(t),`${n.name}.cfg`);for(let n of[o,s])if((0,a.existsSync)(n)&&!(0,a.readFileSync)(n,`utf8`).startsWith(r))throw new e.L(`${n} already exists, and tla-ts didn't generate it from ${t}`);return(0,a.writeFileSync)(o,`${r}\n${n.source}\n`),(0,a.writeFileSync)(s,`${r}\n${n.config}\n`),o},Us={success:e.nt.success,"assumption-violation":e.nt.assumptionViolation,deadlock:e.nt.deadlock,"invariant-violation":e.nt.safetyViolation,"property-violation":e.nt.safetyViolation,"liveness-violation":e.nt.livenessViolation,"postcondition-violation":e.nt.assumptionViolation,error:e.nt.error},Ws=t=>{if((0,a.statSync)(t,{throwIfNoEntry:!1})?.isDirectory())throw new e.b(`${t} (Is a directory)`)},Gs=(e,t)=>e.endsWith(t)?e:`${e}${t}`,Ks=e=>{if(e.length===1)return{path:Gs(e[0],`.dump`)};let t=e[0].toLowerCase();return{path:Gs(e[1],`.dot`),dot:!0,colorize:t.includes(`colorize`),actionLabels:t.includes(`actionlabels`),snapshot:t.includes(`snapshot`),constrained:t.includes(`constrained`),stuttering:t.includes(`stuttering`),strict:t.includes(`strict`)}},qs=e=>t.Ct([e]).toString(),Js=(e,t,n,r,o)=>{let s=n.temporaryDirectory??(0,c.tmpdir)(),l=(0,a.existsSync)(s)?(0,a.realpathSync)(s):(0,i.resolve)(s),u=(0,i.join)(l,`tlc-${qs((0,i.resolve)(e))}`),d=w(n);return(n,s)=>{let c=`${n}.tla`;if(s===`file`)return(0,a.realpathSync)(m(t,n)??e);if(o===`1.7.4`)return(0,i.join)(l,c);if(s===`root file`){let t=r===void 0?l:(0,i.resolve)(r),o=(0,a.realpathSync)(e);return`${(0,i.join)(t,qs(`${o} ${n}`),c)} (${o})`}let f=(0,i.join)(u,c);return d===void 0?f:`${f} (${_(d)}${c})`}},Ys=(e,t)=>{let n=e.split(/\r?\n/),r=n.findIndex(e=>e.match(/^-----*\s*CONFIG\s+(\S+?)\s*-----*$/)?.[1]===t);if(r===-1)return`
151
+ `;let i=n.findIndex((e,t)=>t>r&&e.startsWith(`====`));return`${n.slice(r+1,i===-1?void 0:i).join(`
152
+ `).trim()}\n`},Xs=e=>e.replace(/\/+/g,`/`).replace(/(.)\/$/,`$1`),Zs=e=>{let t=Xs(e),n=t.lastIndexOf(`/`);return n===-1?`.`:t.slice(0,Math.max(n,1))},Qs=(e,t)=>e.endsWith(`/`)?`${e}${t}`:`${e}/${t}`,$s=(e,t,n,r)=>{if(t===`1.7.4`||!e.isTraceSpecForced&&(e.isTraceSpecDisabled||e.isTool||e.isContinued||(0,i.basename)(n).includes(`_TTrace`)))return;let a=e.traceSpecPath,o=`${(0,i.basename)(n)}_TTrace_${Math.floor(r/1e3)}`,s=a===void 0?{directory:Zs(n),module:o}:a.toLowerCase().endsWith(`.tla`)?{directory:Zs(a),module:(0,i.basename)(a).replace(/\.tla$/,``)}:{directory:Xs(a),module:o};return{...s,traceFile:e.isTraceBinaryDisabled?void 0:Qs(s.directory,`${s.module}.bin`)}},ec={ENOENT:`No such file or directory`,ENOTDIR:`Not a directory`,EISDIR:`Is a directory`,EACCES:`Permission denied`},tc=(t,n)=>{try{(0,a.writeFileSync)(t,n)}catch(n){let r=n instanceof Error&&`code`in n?ec[String(n.code)]:void 0;throw r===void 0?n:new e.b(`${t} (${r})`)}},nc=e=>{try{(0,a.mkdirSync)(e,{recursive:!0})}catch{}},rc=e=>{let n=/* @__PURE__ */ new Date,r=`${t.Xt(n.getFullYear()%100)}-${t.Xt(n.getMonth()+1)}-${t.Xt(n.getDate())}-${t.Xt(n.getHours())}-${t.Xt(n.getMinutes())}-${t.Xt(n.getSeconds())}.${t.Xt(n.getMilliseconds(),3)}`,o=(0,i.join)(e.metadir??`states`,r);return(0,a.mkdirSync)(o,{recursive:!0}),o},ic=async(r,o,s,c,l)=>{let u=o.livenessCheck,d=l.version;Ds(l);let f=o.recoverDirectory;if(f!==void 0)throw(0,a.existsSync)((0,i.join)(f,`vars.chkpt`))?new e.x(`tla-ts can't recover a model check from the checkpoint in ${f}.`):new e.D(f);ks(l,o);let p=o.configPath??r.replace(/\.tla$/,`.cfg`);if(!(0,a.existsSync)(p))return l.print(t.Lt.configFileError,t.Rt.error,`TLC encountered the following error when trying to read the configuration file ${p}:\nFile not found.`),e.nt.configParseError;let m=(0,i.basename)(r,`.tla`),_={startTime:Date.now(),livenessStartTime:void 0,isParsed:!1},b=()=>{let e=Date.now()-_.startTime;l.print(t.Lt.finished,t.Rt.none,`Finished in ${l.isTool?`${e}ms`:t.Ut(e)} at (${t.Ht(/* @__PURE__ */ new Date)})`)},x=()=>l.print(t.Lt.parsingFailed,t.Rt.error,`Parsing or semantic analysis failed.`),S=t=>(t instanceof e.F?x():y(t,l),b(),v(t)),T=(()=>{try{let e=(0,a.readFileSync)(p,`utf8`);return t.$t(p.endsWith(`.tla`)?Ys(e,p.replaceAll(`.tla`,``)):e,d)}catch(t){if(!(t instanceof e._))throw t;return t}})();if(T instanceof e._&&d===`1.7.4`)return l.print(t.Lt.general,t.Rt.error,`${e.$(`tlc2.tool.ConfigFileException`)}${t.Vt(T.message,l.isTool)}`),b(),e.nt.error;if(T instanceof e._)return S(T);o.isDeadlockChecked||(T.checkDeadlock=!1);let E=(0,i.dirname)(r),D=[E,...c.libraries],O=h(D),k=$s(o,d,r.replace(/\.tla$/,``),_.startTime),A=e=>o.moduleOperators.filter(t=>t.kind===e).map(e=>e.module);l.isTool&&l.print(t.Lt.startingSany,t.Rt.none,`Starting SANY...`);let ee=(0,i.isAbsolute)(r),te=ee?m:r.replace(/\.tla$/,``),ne=w(c),re=d===`1.7.4`?sc(r,c,ne):void 0;re?!(0,a.existsSync)(r)&&!t.ct.has(m)&&re(`${m}.tla`):!(0,a.existsSync)(r)&&!t.lt.has(m)&&g(ee?E:process.cwd(),ee?`${m}.tla`:`./${te}.tla`,[...ee||E===`.`?[]:[E],...c.libraries]);let j=Mo(r,re?C(O,re):O,{fileName:te,describeFile:Js(r,D,c,o.metadir,d),version:d,rootExtendees:[...A(`postcondition`),...k?.traceFile===void 0?[]:[`_TLCTrace`],...o.invariants.flatMap(e=>e.modules),...A(`constraint`),...A(`view`).slice(0,1)],suppressedCodes:o.suppressedCodes,errorCodes:o.errorCodes,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}),ie=j.specification;if(j.isFailed||ie===void 0)return ys(l,{kind:`parsed`},_,E),x(),b(),e.nt.specParseError;try{let i=(0,a.readFileSync)(r,`utf8`),c=t.y(i).name;if(c!==m)throw new e.M(`File name '${m}' does not match the name '${c}' of the top level module it contains.`,void 0);let f=o.userFile,p=t.ut(d),h=Lo(i,ie.root,o.invariants,e=>O(e)??p.get(e)??t.v(i,e),d);T.invariants.push(...h.names);let g={workers:o.workers,livenessCheck:u===`off`?`off`:[`final`,`seqfinal`].includes(u)?`final`:`default`,seed:o.seed,fingerprintPolynomial:o.fingerprintIndex,maxSetSize:o.maxSetSize,isLazyValueExpanded:o.isLazyValueExpanded,isViewPrinted:o.isViewPrinted,dump:s,isTool:l.isTool,isContinued:o.isContinued,moduleOperators:o.moduleOperators,traceSpec:k,coverage:o.coverage,isSanyReported:!0,isWarningEnabled:o.isWarningEnabled,version:d,onProgress:e=>ys(l,e,_,E),onPrint:f===void 0?void 0:e=>(0,a.appendFileSync)(f,`${e}\n`),source:h.source,config:T,onPause:()=>(0,a.readSync)(0,Buffer.alloc(1)),loadModule:O,loadClass:e=>{let t=vs(E,e);return(0,a.existsSync)(t)?(0,a.readFileSync)(t):void 0},readFile:e=>(Ws(e),(0,a.existsSync)(e)?(0,a.readFileSync)(e,`utf8`):void 0),writeFile:tc,makeDirectory:nc};if(o.mode!==`model-check`){let e=Ge({...g,traceDepth:o.traceDepth,traceCount:o.traceCount,aril:o.aril,isGenerating:o.mode===`generate`,scheduler:o.scheduler,onSimulation:e=>As(l,e)});return b(),e}if(o.dfidDepth!==void 0){let e=Re({...g,maxDepth:o.dfidDepth,onOutput:e=>Ts(l,e)});return b(),e}let v=await n.b(g);if(Es(v,l,_),b(),k&&v.traceSpec!==void 0){let n=Qs(k.directory,`${k.module}.tla`);nc(k.directory);let r=(()=>{try{tc(n,v.traceSpec);return}catch(t){if(!(t instanceof e.b))throw t;return t}})();l.print(r?t.Lt.traceSpecFailed:t.Lt.traceSpecWritten,t.Rt.none,r?`Failed to generate trace exploration spec; error message: ${r.message}`:`Trace exploration spec path: ${n}`)}return v.failure?.exitCode??Us[v.status]}catch(t){if(!(t instanceof e.y))throw t;return t instanceof e.F&&console.log(ac(t,m)),_.isParsed||ys(l,{kind:`parsed`},_,E),S(t)}},ac=(t,n)=>{let r=t instanceof e.M;if(!r&&!t.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${t.message}\n\n`;let i=r?t.location===void 0?`Unknown location\n\n${t.message}`:`In module ${t.location}\n\n${t.message}`:`In module ${n}\n\nCould not parse module ${n} from file ${n}.tla`;return`${t.failure?`***Parse Error***\n${t.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${n}\n\n${i}\n*** Errors: 1\n\n${i}\n\n\n`},oc=async(n,r)=>{let o=r.tlcVersion??`master`,s=rs(n);if(s===`usage`)return console.log(Vs()),1;if(`error`in s)return s.kind===`uncaught`?(console.error(`Exception in thread "main" ${s.error}`),1):Os(s.isTool,o,s.error);let c=s.dump&&Ks(s.dump);c?.path.startsWith("${metadir}")&&(c.path=c.path.replaceAll("${metadir}",rc(s)));let l=c?.path;if(l!==void 0)try{(0,a.closeSync)((0,a.openSync)(l,`w`))}catch{return console.log(`Error: Unable to write to file ${l}`),Os(s.isTool,o,`Error: Given file name ${l} for dumping states invalid.`)}let u=s.configPath!==void 0;if(u&&s.specs.length>1)return Os(s.isTool,o,`Error: more than one input files: ${s.specs[0].replace(/\.tla$/,``)} and ${s.specs[1]}`);let d=p(s.specs).map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg|ts)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.ts`)||e.path.endsWith(`.tla`)&&(!e.isGlobbed||u||(0,a.existsSync)(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(d.length===0)return Os(s.isTool,o,`Error: Missing input TLA+ module.`);if(u&&d.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let f=[...new Set(d.map(e=>(0,a.existsSync)(e)||(0,i.isAbsolute)(e)?e:r.libraries.map(t=>(0,i.join)(t,e)).find(a.existsSync)??e))],m=[];for(let[e,n]of f.entries()){e>0&&console.log(``);let a=t.zt({isTool:s.isTool,isWarningEnabled:s.isWarningEnabled,isDiffTrace:s.isDiffTrace,version:o,suppressedCodes:s.suppressedCodes,errorCodes:s.errorCodes});m.push(await b(async()=>{let e=n.endsWith(`.ts`)?await Hs(n):n;return f.length>1&&console.log(`Checking ${(0,i.basename)(e)} with ${(0,i.basename)(e,`.tla`)}.cfg`),ic(e,s,c,r,a)},a))}return m.find(t=>t!==e.nt.success)??e.nt.success},sc=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),a=(!(0,i.isAbsolute)(e)&&r!==``?[r]:t.libraries).map(S),o=a.length>0?a[a.length-1]:(0,i.isAbsolute)(e)?r:``;return e=>x(`${o}${e}`,a,n)},cc={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},lc=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),uc={"&":`&amp;`,"<":`&lt;`,">":`&gt;`,"\r":`&#13;`},dc=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:uc[e]),fc=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,pc=e=>{let t=(e.cdata??e.text)?.match(fc)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=pc(t);if(e)return e}},mc=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${dc(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)mc(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},hc=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),gc=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},_c={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},vc={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},yc=Vn(`--TLA+ BUILTINS--`),bc=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},xc=(e,t=16)=>e>t*.75?xc(e,t*2):t,Sc=(e,t)=>(e^e>>>16)&t-1,Cc=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},wc=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),Tc=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,Ec=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=Cc(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(Tc,``)}).join(`
153
+ `)},Dc=e=>{let t=Cc(e),n=e=>wc(e).startsWith(`\\*`);return t.filter(n).length<Math.floor(t.length/2)?e:t.map(e=>{if(!n(e))return e;let t=e.indexOf(`\\*`)+2;return e.slice(e[t]===` `?t+1:t)}).join(`
154
+ `)},Oc=(t,n,r)=>{let i=r.version===`1.7.4`,a=/* @__PURE__ */ new Set,o=/* @__PURE__ */ new Map,s=!1,c=[],l=(e,t)=>{if(!i)return t();c.push(...e);let n=t();return c.length-=e.length,n},u=(t,n)=>{let r=[...c,...n].reverse(),i=[t,...r.map(e=>`\tat tla2sany.${e.at}`)].join(`
155
+ `),a=r.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${i}\n`).join(``);return e.at(new e.T(i,a),cc.uncaughtException)},d=e=>u(`java.lang.NullPointerException: Cannot invoke "tla2sany.semantic.${e.nullType}.export(org.w3c.dom.Document, tla2sany.xml.SymbolContext)" because ${e.nullValue} is null`,[e]),f=(e,t)=>(a.has(e.id)||(a.add(e.id),o.set(e.id,l([...t?[t]:[],...bc(e.kind,Vn(e.location))],()=>g(e)))),Z(gc(e),[Q(`UID`,e.id)])),p=(e,t)=>{let n=t.levelChecked===0?[]:[Q(`level`,t.level)],r=t.location?[hc(t.location),...n]:n;return{...e,children:[...r,...e.children]}},m=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[f(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),h=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
156
+ `),n=r.isUncommented?Dc(Ec(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:n,children:[]}]:[]},g=t=>{switch(t.kind){case`FormalParam`:return p(Z(`FormalParamNode`,[Q(`uniquename`,t.name),Q(`arity`,t.arity)]),t);case`OpDecl`:return p(Z(`OpDeclNode`,[Q(`uniquename`,t.name),Q(`arity`,t.arity),Q(`kind`,t.declKind)]),t);case`OpDef`:{if(t.defKind===`NumberedProofStep`)throw i?u(lc(37),[vc]):e.at(new e.B(lc(37)),cc.uncaughtException);if(t.defKind===`ModuleInstance`)return p(Z(`ModuleInstanceKind`,[Q(`uniquename`,t.name),...t.isLocal&&!i?[Z(`local`)]:[]]),t);let n=t.params??[];if(t.defKind===`BuiltIn`)return p(Z(`BuiltInKind`,[Q(`uniquename`,t.name),Q(`arity`,t.arity),...t.params?[m(n,t.isLeibnizArg,$.builtInParam)]:[]]),t);let r=t.body,a=t.module;if(r===void 0&&i)throw d($.body);if(r===void 0||a===void 0)throw Error(`The definition of ${t.name} has no body`);return p(Z(`UserDefinedOpKind`,[Q(`uniquename`,t.name),Q(`arity`,t.arity),...i?[]:[Z(`originalOperator`,[f(t.source??t)]),Z(`originallyDefinedInModule`,[f(a)])],Z(`body`,[x(r,$.body)]),...t.params||!i?[m(n,t.isLeibnizArg,$.param)]:[],...i?[]:h(t.preComments),...t.inRecursive?[Z(`recursive`)]:[],...t.recursiveSection>=0&&!i?[Q(`recursiveSection`,t.recursiveSection)]:[],...t.isLocal&&!i?[Z(`local`)]:[]]),t)}case`ThmOrAssumpDef`:return p(Z(t.isTheorem?`TheoremDefNode`:`AssumeDef`,[Q(`uniquename`,t.name),x(t.body,$.theoremDefinitionBody)]),t);case`Module`:return Z(`ModuleNode`,[hc(t.location),..._(t)]);case`Theorem`:return p(Z(`TheoremNode`,[...t.definition?[Z(`definition`,[f(t.definition,$.theoremDefinition)])]:[],Z(`body`,[x(t.body,$.theorem)]),...t.proof?[x(t.proof,$.proof)]:[],...t.isSuffices?[Z(`suffices`)]:[]]),t);case`Assume`:return Z(`AssumeNode`,[hc(t.location),...t.body.levelChecked===0?[]:[Q(`level`,t.body.level)],...t.definition?[Z(`definition`,[f(t.definition,$.assumeDefinition)])]:[],Z(`body`,[x(t.body,$.assume)])])}},_=e=>{let t=t=>!r.isRestricted||t.module===e;return[Q(`uniquename`,e.name),...i?[]:[Z(`extends`,[...new Set(e.extendees.map(e=>e.name))].toSorted().map(e=>Q(`uniquename`,e)))],...nr(e,2).filter(t).map(e=>f(e,$.constant)),...nr(e,3).filter(t).map(e=>f(e,$.variable)),...tr(e).filter(t).map(e=>f(e,$.definition)),...e.topLevel.map(e=>e.kind===`Instance`||e.kind===`UseOrHide`?x(e,$.topLevel):f(e,$.topLevel)),...e.definitions.filter(e=>!i&&e.kind===`Module`).map(e=>f(e))]},v=(e,t)=>l([t],()=>Z(`Subst`,[f(e.op,$.substOperator),x(e.expr,$.substExpression)])),y=e=>{if(e.nullKind!==void 0&&i)throw u(lc(0),[$.operator,...bc(`OpDef`,yc),vc]);let t=e.operands[e.operands.length-1];e.operator.name===`$Case`&&e.operands.length>1&&t?.kind===`OpAppl`&&t.operator.name===`$Pair`&&t.operands[0]===void 0&&(s=!0);let n=f(e.operator,$.operator),r=e.operands.map((e,t)=>e===void 0||t===0&&s&&Hn(e)?i?Q(`StringNode`,`$Other`):Z(`StringNode`,[Q(`StringValue`,`$Other`)]):x(e,$.operand)),a=e.tupleOrs,o=e.unbounded===void 0&&e.bounded===void 0?[]:[Z(`boundSymbols`,[...(e.unbounded??[]).map((e,t)=>Z(`unbound`,[f(e,$.unbound),...a?.[t]?[Z(`tuple`)]:[]])),...(e.bounded??[]).map((t,n)=>Z(`bound`,[...t.map(e=>f(e,$.bound)),...a?.[n]?[Z(`tuple`)]:[],x(e.ranges[n],$.range)]))])];return Z(`OpApplNode`,[Z(`operator`,[n]),Z(`operands`,r),...o])},b=(e,t)=>e.kind===`Module`||e.kind===`OpDef`?f(e,t):x(e,t),x=(e,t)=>{if(!i)return S(e);if(e.kind===`OpAppl`&&e.nullKind===`absent`&&`nullType`in t)throw d(t);return l([t,{at:`semantic.SemanticNode.export(SemanticNode.java:379)`,failedFor:Vn(e.location)},{at:`semantic.LevelNode.getSemanticElement(LevelNode.java:333)`}],()=>S(e))},S=e=>{switch(e.kind){case`OpAppl`:return p(y(e),e);case`Numeral`:return p(Z(`NumeralNode`,[Q(`IntValue`,e.value)]),e);case`String`:return p(Z(`StringNode`,[Q(`StringValue`,e.value)]),e);case`Decimal`:return p(Z(`DecimalNode`,[Q(`mantissa`,e.mantissa),Q(`exponent`,e.exponent),...i?[]:[Q(`integralPart`,e.integralPart),Q(`fractionalPart`,e.fractionalPart)]]),e);case`LetIn`:{let t=x(e.body,$.letBody);return p(Z(`LetInNode`,[Z(`body`,[t]),Z(`opDefs`,e.opDefs.map(e=>f(e,$.letDefinition)))]),e)}case`Label`:return p(Z(`LabelNode`,[Q(`uniquename`,e.name),Q(`arity`,e.params.length),Z(`body`,[x(e.body,$.labelBody)]),Z(`params`,e.params.map(e=>f(e,$.labelParam)))]),e);case`OpArg`:return p(Z(`OpArgNode`,[Z(`argument`,[f(e.op,$.argument)])]),e);case`At`:{let t=e.except.operands[0],n=e.component.operands[0];if(t===void 0||n===void 0)throw Error(`An @ refers to an incomplete EXCEPT`);return p(Z(`AtNode`,[x(t,$.exceptObject),x(n,$.exceptComponents)]),e)}case`SubstIn`:case`APSubstIn`:{let t=_c[e.kind],n=e.substs.map(e=>v(e,t.subst)),r=x(e.body,t.body);return p(Z(e.kind===`SubstIn`?`SubstInNode`:`APSubstInNode`,[Z(`substs`,n),Z(`body`,[r]),Z(`instFrom`,[f(e.instantiatingModule,t.from)]),Z(`instTo`,[f(e.instantiatedModule,t.to)])]),e)}case`Instance`:{let t=e.substs.map(e=>v(e,$.instanceSubst)),n=e.params.map(e=>f(e,$.instanceParam));return Z(`InstanceNode`,[hc(e.location),Q(`level`,0),...e.name===void 0?[]:[Q(`uniquename`,e.name)],Q(`module`,e.module.name),Z(`substs`,t),Z(`params`,n),...e.isLocal&&!i?[Z(`local`)]:[]])}case`UseOrHide`:return p(Z(`UseOrHideNode`,[Z(`facts`,e.facts.map(e=>b(e,$.useFact))),Z(`defs`,e.defs.map(e=>f(e,$.useDefinition))),...e.isOnly?[Z(`only`)]:[],...e.isHide?[Z(`hide`)]:[]]),e);case`NewSymb`:return p(Z(`NewSymbNode`,[f(e.declaration,$.newDeclaration),...e.set&&!(i&&Hn(e.set))?[x(e.set,$.newSet)]:[]]),e);case`AssumeProve`:return p(Z(`AssumeProveNode`,[Z(`assumes`,e.assumptions.map(e=>x(e,$.assumption))),Z(`prove`,[x(e.goal,$.goal)]),...e.isSuffices?[Z(`suffices`)]:[],...e.isBoxed?[Z(`boxed`)]:[]]),e);case`LeafProof`:{let t=e.facts.length===0&&e.defs.length===0,n=e.isOmitted?Z(`omitted`):t?Z(`obvious`):Z(`by`,[Z(`facts`,e.facts.map(e=>b(e,$.byFact))),Z(`defs`,e.defs.map(e=>f(e,$.byDefinition))),...e.isOnly?[Z(`only`)]:[]]);return p(n,e)}case`NonLeafProof`:return p(Z(`steps`,[...i?[]:[Q(`proofLevel`,e.proofLevel)],...e.steps.map(e=>e.kind===`Theorem`?f(e,$.step):x(e,$.step))]),e);case`DefStep`:return p(Z(`DefStepNode`,e.defs.map(e=>f(e,$.defStep))),e)}},C=(r.isRestricted?[n]:t).map(e=>f(e,$.main)),w=xc(o.size),T=Z(`context`,[...o.entries()].toSorted(([e],[t])=>Sc(e,w)-Sc(t,w)).map(([e,t])=>Z(`entry`,[Q(`UID`,e),t])));return Z(`modules`,[Q(`RootModule`,n.name),T,...C])},kc=(t,n={version:`master`,isRestricted:!1,isUncommented:!1,isTerse:!1})=>{let r=Oc(t.modules,t.root,n),i=pc(r);if(i){let t=i.character.codePointAt(0)??0;throw e.at(new e.B(`The spec contains the character U+${t.toString(16).toUpperCase().padStart(4,`0`)} in the ${i.tag} element. XML 1.0 cannot represent that character in character data, not even as a numeric character reference, so the spec cannot be exported until the character is removed from it.`),cc.unrepresentableCharacter)}let a=[`<?xml version="1.0" encoding="UTF-8" standalone="no"?>`];return mc(r,0,n.isTerse?0:2,a),n.isTerse?a.join(``):`${a.join(`
157
+ `)}\n`},Ac=(()=>{let e=[[`-I`,`Include; use given directory path to resolve module dependencies.`],[`-help`,`Print this usage information.`],[`-o`,`Offline mode; skip XML schema validation step.`],[`-r`,`Restrict mode; include only declarations and definitions of the specified module, excluding extended or instantiated modules.`],[`-t`,`Terse; format XML output without tabs or newlines.`],[`-u`,`Uncomment; process boxed comments and single-line comments (\\*) in pre-comments to extract their content.`]],t=[`Only one root TLA+ file can be parsed per run.`,`Multiple directory search paths can be given by providing multiple -I arguments.`,`XML schema validation does not require network access.`];return[``,X(`NAME`),``,` tla2sany.xml.XMLExporter - Emit SANY's parse tree as XML - Version 2.2 created 08 July 2020`,``,``,X(`SYNOPSIS`),``,`\t${X(`tla2sany.xml.XMLExporter`)} [${X(`-Iortu`)}] [${X(`-help`)}] FILE`,``,X(`DESCRIPTION`),``,` Given a TLA+ file, parse that file with SANY then translate the module's semantic parse tree to XML, including all the modules depended on. The XML is printed to stdout and its output format is given by an XML Schema file (.xsd) found at https://proofs.tlapl.us/doc/web/sany.xsd.`,``,X(`OPTIONS`),``,...e.map(([e,t])=>`\t${X(e)}\n\t\t${t}`),``,X(`TIPS`),``,...t.flatMap(e=>[`\t${e}`,``]),``].join(`
158
+ `)})(),jc=e=>(process.stderr.write(`ERROR: ${e}\n${Ac}`),cc.argsParsingFailure),Mc=(t,n)=>{try{return process.stdout.write(kc(t,n)),e.nt.success}catch(t){if(!(t instanceof e.B))throw t;let n=e.Q(t),r=t instanceof e.T?t.unwound:``;return console.error(n===cc.uncaughtException?`${r}Exception in thread "main" ${t.message}`:`ERROR: ${t.message}`),n}},Nc={"no-file":{message:`at least one .tla file must be given`,line174:59},"missing-include":{message:`the -I flag must be followed by a directory and at least one .tla file`,line174:71},"several-files":{message:`Only one TLA file to check allowed!`,line174:83}},Pc=(e,t)=>{let n={flags:/* @__PURE__ */ new Set,includes:[],error:void 0};if(e.length===0)return{...n,error:`no-file`};let r=-1;for(let i=0;i<e.length-1;i++)if(t.has(e[i]))n.flags.add(e[i]),r=i;else if(e[i]===`-I`){if(i++,i>e.length-2)return{...n,error:`missing-include`};n.includes.push(e[i]),r=i}return r===e.length-2?n:{...n,error:`several-files`}},Fc=n=>{let r=Pc(n,/* @__PURE__ */ new Set([`-o`,`-t`,`-r`,`-u`]));if(r.error)return jc(Nc[r.error].message);let o=n[n.length-1];if(o===`-help`)return process.stdout.write(Ac),e.nt.success;let s=o.endsWith(`.tla`)?o:`${o}.tla`,c=[`.`,...r.includes],l=c.map(e=>(0,i.resolve)(e,s)).find(a.existsSync);l===void 0&&!t.lt.has(s.slice(0,-4))&&g(process.cwd(),`./${s}`,r.includes);let u=Mo(l??s,h(c),{fileName:o,isXmlExport:!0});return process.stderr.write(u.text),u.isFailed||u.specification===void 0?(console.error(`ERROR: Failed to parse module.`),cc.specParsingFailure):Mc(u.specification,{version:`master`,isRestricted:r.flags.has(`-r`),isUncommented:r.flags.has(`-u`),isTerse:r.flags.has(`-t`)})},Ic=(e,t)=>(console.error(`Exception in thread "main" ${e}\n\tat tla2sany.xml.XMLExporter.main(XMLExporter.java:${t})`),cc.uncaughtException),Lc=(n,r)=>{let o=Pc(n,/* @__PURE__ */ new Set([`-o`]));if(o.error)return Ic(`java.lang.IllegalArgumentException: ${Nc[o.error].message}`,Nc[o.error].line174);let s=n[n.length-1],c=`${s.replace(/\.tla$/i,``)}.tla`,l=(o.includes.length===0?[`/`]:o.includes).map(S),u=[`.`,...l],d=e=>x(`${l[l.length-1]}${e}`,l,r),f=u.map(e=>(0,i.resolve)(e,c)).find(a.existsSync);if(f===void 0&&!t.ct.has((0,i.basename)(c,`.tla`)))return d(c),e.nt.success;let p=Mo(f??c,C(h(u),d),{fileName:s,isXmlExport:!0,version:`1.7.4`});return process.stderr.write(p.text),p.specification===void 0?Ic(`tla2sany.xml.XMLExportingException: spec ${(f&&jo((0,a.readFileSync)(f,`utf8`),`1.7.4`))??`null`} is malformed - does not have a root module`,110):Mc(p.specification,{version:`1.7.4`,isRestricted:!1,isUncommented:!1,isTerse:!0})},Rc=[`tlc2.TLC`,`tla2sany.xml.XMLExporter`],zc=e=>{let t={libraries:[]};for(let n=0;n<e.length;n++){let r=e[n];if(r===`-cp`||r===`-classpath`||r===`--class-path`)n++,t.classPath=e[n];else if(r===`-jar`)return t.classPath=e[n+1],{mainClass:`tlc2.TLC`,args:e.slice(n+2),java:t};else if(r.startsWith(`-DTLA-Library=`))t.libraries.push(...r.slice(14).split(i.delimiter));else if(r.startsWith(`-Djava.io.tmpdir=`))t.temporaryDirectory=r.slice(17);else if(r.startsWith(`-Dtla-ts.tlc=`))t.tlcVersion=r.slice(13)===`1.7.4`?`1.7.4`:`master`;else if(!r.startsWith(`-D`)&&!r.startsWith(`-X`))return n>0||Rc.includes(r)?{mainClass:r,args:e.slice(n+1),java:t}:void 0}},Bc=async e=>{if(e[0]===`tlapm`)return b(()=>Ne(e.slice(1)));let t=zc(e);return t===void 0?oc(e,{libraries:[]}):(t.java.tlcVersion??=await d(w(t.java)),t.mainClass===`tlc2.TLC`?oc(t.args,t.java):t.mainClass===`tla2sany.xml.XMLExporter`?b(()=>t.java.tlcVersion===`1.7.4`?Lc(t.args,w(t.java)):Fc(t.args)):(console.error(`Error: tla-ts runs the Java classes ${Rc.join(` and `)}, not ${t.mainClass}.`),1))},Vc=async()=>{process.exitCode=await Bc(process.argv.slice(2))};exports.runCli=Vc;