tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.d618a2d79

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 (586) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +37 -0
  8. package/dist/index.d.ts +37 -0
  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.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +47 -44
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +44 -41
  19. package/dist/transfer.js +44 -41
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +474 -718
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +8 -7
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +244 -238
  35. package/src/cli/tlc-output.ts +687 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +49 -702
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +55 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +31 -106
  47. package/src/exit-codes.ts +2 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +616 -306
  57. package/src/liveness.ts +104 -120
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +118 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +10 -30
  81. package/src/parallel.ts +50 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  310. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +814 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +1986 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +15 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +206 -44
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +22 -47
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +54 -26
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
package/src/tlc/random.ts CHANGED
@@ -8,6 +8,7 @@ import {
8
8
  formatValue,
9
9
  getFunctionDomain,
10
10
  isEmptySet,
11
+ MAXIMUM_INTEGER,
11
12
  toFiniteSet,
12
13
  type Value,
13
14
  } from "../values";
@@ -21,17 +22,16 @@ export interface JavaRandom {
21
22
 
22
23
  const MULTIPLIER = 0x5deece66dn;
23
24
  const SEED_MASK = (1n << 48n) - 1n;
24
- const MAXIMUM_INT = 2147483647;
25
25
 
26
26
  export const createJavaRandom = (seed: bigint): JavaRandom => {
27
- const state = { value: (BigInt.asUintN(64, seed) ^ MULTIPLIER) & SEED_MASK };
27
+ let state = (BigInt.asUintN(64, seed) ^ MULTIPLIER) & SEED_MASK;
28
28
  const next = (bits: number) => {
29
- state.value = (state.value * MULTIPLIER + 0xbn) & SEED_MASK;
30
- return Number(BigInt.asIntN(32, state.value >> BigInt(48 - bits)));
29
+ state = (state * MULTIPLIER + 0xbn) & SEED_MASK;
30
+ return Number(BigInt.asIntN(32, state >> BigInt(48 - bits)));
31
31
  };
32
32
  return {
33
33
  setSeed: (value) => {
34
- state.value = (BigInt.asUintN(64, value) ^ MULTIPLIER) & SEED_MASK;
34
+ state = (BigInt.asUintN(64, value) ^ MULTIPLIER) & SEED_MASK;
35
35
  },
36
36
  nextInt: (bound) => {
37
37
  const first = next(31);
@@ -39,7 +39,7 @@ export const createJavaRandom = (seed: bigint): JavaRandom => {
39
39
  if ((bound & mask) === 0) return Number((BigInt(bound) * BigInt(first)) >> 31n);
40
40
  for (let candidate = first; ; candidate = next(31)) {
41
41
  const value = candidate % bound;
42
- if (candidate - value + mask <= MAXIMUM_INT) return value;
42
+ if (candidate - value + mask <= MAXIMUM_INTEGER) return value;
43
43
  }
44
44
  },
45
45
  nextLong: () => BigInt.asIntN(64, (BigInt(next(32)) << 32n) + BigInt(next(32))),
@@ -47,7 +47,6 @@ export const createJavaRandom = (seed: bigint): JavaRandom => {
47
47
  };
48
48
  };
49
49
 
50
- // RandomGenerator.primes holds the 1341 consecutive primes from 1277011 to 1295953.
51
50
  const PRIMES: number[] = [];
52
51
 
53
52
  const isPrime = (candidate: number) => {
@@ -66,29 +65,24 @@ const getPrimes = () => {
66
65
 
67
66
  export const nextPrime = (random: JavaRandom) => {
68
67
  const primes = getPrimes();
69
- const choice = { index: primes.length };
70
- while (choice.index === primes.length) {
71
- choice.index = Math.floor(random.nextDouble() * primes.length);
72
- }
73
- return primes[choice.index];
68
+ let index = primes.length;
69
+ while (index === primes.length) index = Math.floor(random.nextDouble() * primes.length);
70
+ return primes[index];
74
71
  };
75
72
 
76
73
  const getPrimeFactors = (value: number) => {
77
74
  const factors: number[] = [];
78
- const remaining = { value };
79
- for (let divisor = 2; divisor * divisor <= remaining.value; divisor++) {
80
- while (remaining.value % divisor === 0) {
75
+ let remaining = value;
76
+ for (let divisor = 2; divisor * divisor <= remaining; divisor++) {
77
+ while (remaining % divisor === 0) {
81
78
  factors.push(divisor);
82
- remaining.value /= divisor;
79
+ remaining /= divisor;
83
80
  }
84
81
  }
85
- if (remaining.value > 1) factors.push(remaining.value);
82
+ if (remaining > 1) factors.push(remaining);
86
83
  return factors;
87
84
  };
88
85
 
89
- // EnumerableValue.computeOptimalMandA: the smallest modulus m >= max(size, 9) that isn't a
90
- // multiple of 4 and has a repeated prime factor, and the multiplier 1 + the product of its
91
- // distinct prime factors.
92
86
  const getModulusAndMultiplier = (size: number) => {
93
87
  for (let modulus = Math.max(size, 9); ; modulus++) {
94
88
  const factors = getPrimeFactors(modulus);
@@ -105,35 +99,32 @@ const getModulusAndMultiplier = (size: number) => {
105
99
  const getSubsetIndicesMaster = (count: number, size: number, random: JavaRandom) => {
106
100
  if (size <= 0) return [];
107
101
  const generator = getModulusAndMultiplier(size);
108
- const state = { index: BigInt(random.nextInt(size)) };
102
+ let index = BigInt(random.nextInt(size));
109
103
  const increment = BigInt(nextPrime(random));
110
104
  return Array.from({ length: count }, () => {
111
105
  do {
112
- state.index = (generator.multiplier * state.index + increment) % generator.modulus;
113
- } while (state.index >= size);
114
- return state.index;
106
+ index = (generator.multiplier * index + increment) % generator.modulus;
107
+ } while (index >= size);
108
+ return index;
115
109
  });
116
110
  };
117
111
 
118
- // TLC 1.7.4's EnumerableValue.SubsetEnumerator: the i-th index is (x * i + a) mod size, for a
119
- // prime x above size and a = random.nextInt(size), so the first size indices are distinct.
120
112
  const getSubsetIndices174 = (count: number, size: number, random: JavaRandom) => {
121
113
  if (size <= 0) return [];
122
- const stride = BigInt(size < 191 ? 191 : MAXIMUM_INT);
114
+ const stride = BigInt(size < 191 ? 191 : MAXIMUM_INTEGER);
123
115
  const offset = BigInt(random.nextInt(size));
124
116
  return Array.from(
125
117
  { length: Math.min(count, size) },
126
- (_, index) => (stride * BigInt(index) + offset) % BigInt(size),
118
+ (_value, index) => (stride * BigInt(index) + offset) % BigInt(size),
127
119
  );
128
120
  };
129
121
 
130
122
  const LARGE_STRIDE = (1n << 63n) - 1n - 24n;
131
123
 
132
- // For products with more than 2^31 - 1 elements.
133
124
  const getLargeSubsetIndices = (count: number, size: bigint, random: JavaRandom) => {
134
125
  const signed = random.nextLong();
135
126
  const offset = BigInt.asIntN(64, signed < 0n ? -signed : signed);
136
- return Array.from({ length: count }, (_, index) => {
127
+ return Array.from({ length: count }, (_value, index) => {
137
128
  const value = (LARGE_STRIDE * BigInt(index) + offset) % size;
138
129
  return value < 0n ? value + size : value;
139
130
  });
@@ -179,7 +170,6 @@ const getProduct = (set: Value): Product | undefined => {
179
170
  return undefined;
180
171
  };
181
172
 
182
- // TLC 1.7.4 enumerates a set of tuples to draw from it.
183
173
  export const getEnumeratedFactors = (set: Value, version: TlcVersion) =>
184
174
  version === "1.7.4" && typeof set === "object" && set.kind === "ProductSet"
185
175
  ? set.factors
@@ -202,7 +192,7 @@ export const getRandomSubset = (
202
192
  if (product) {
203
193
  const size = product.lists.reduce((total, list) => total * BigInt(list.length), 1n);
204
194
  const indices =
205
- size > BigInt(MAXIMUM_INT)
195
+ size > BigInt(MAXIMUM_INTEGER)
206
196
  ? getLargeSubsetIndices(count, size, random)
207
197
  : getSubsetIndices(count, Number(size), random);
208
198
  return indices.map((index) => product.create(getProductElements(product.lists, index)));
@@ -211,8 +201,6 @@ export const getRandomSubset = (
211
201
  return getSubsetIndices(count, elements.length, random).map((index) => elements[Number(index)]);
212
202
  };
213
203
 
214
- // TLC!RandomElement chooses each component of a set of functions, records, or tuples
215
- // separately, and otherwise indexes the enumerated set with nextDouble.
216
204
  export const getRandomElement = (set: Value, random: JavaRandom): Value => {
217
205
  if (typeof set === "object" && set.kind === "FunctionSet") {
218
206
  // TLC builds the chosen function without the interval its domain came from.
package/src/tlc/replay.ts CHANGED
@@ -40,16 +40,11 @@ import {
40
40
  import { substitutionFrames } from "../instances";
41
41
  import { MESSAGE_CODE } from "./messages";
42
42
 
43
- // Replays a failed computation as TLC's CallStackTool does, walking the predicates in the order
44
- // and nesting of Tool.getInitStates and getNextStates, so it records the nodes TLC records, and
45
- // counts the coverage TLC counts.
46
-
47
43
  interface ReplayAction {
48
44
  expression: Expression;
49
45
  scope: Scope | undefined;
50
46
  }
51
47
 
52
- // TLC's ActionItemList: the conjuncts left to process, the first at the head.
53
48
  interface ActionItem {
54
49
  kind: "Predicate" | "Unchanged" | "Changed";
55
50
  expression: Expression;
@@ -82,7 +77,6 @@ const withFrame = <Result>(replay: Replay, expression: Expression, run: () => Re
82
77
  try {
83
78
  return run();
84
79
  } catch (error) {
85
- // A quantifier enumerates its bounds outside any evaluation.
86
80
  freezeCallStack(callStack, sets.slice(depth), error);
87
81
  throw error;
88
82
  } finally {
@@ -101,8 +95,6 @@ const runAt = <Result>(replay: Replay, node: number, run: () => Result) =>
101
95
  const evaluateAt = (replay: Replay, node: number, expression: Expression, context: Context) =>
102
96
  runAt(replay, node, () => evaluate(expression, context));
103
97
 
104
- // TLC evaluates a user-defined or overridden operator's arguments under its node, but doesn't
105
- // count the node itself.
106
98
  const evaluateOperatorAt = (
107
99
  replay: Replay,
108
100
  node: number,
@@ -132,7 +124,6 @@ const assign = (partial: State, index: number, value: Value) => {
132
124
  return copy;
133
125
  };
134
126
 
135
- // SANY parses A /\ B /\ C as (A /\ B) /\ C, so the replay recreates the node of each prefix.
136
127
  const getPrefix = (expression: Expression & { kind: "And" | "Or" }, count: number): Expression => {
137
128
  const first = expression.operands[0].location;
138
129
  const range = expression.location.range;
@@ -193,13 +184,9 @@ const isTrue = (value: Value) => {
193
184
  return value;
194
185
  };
195
186
 
196
- // Once every variable has a value, TLC evaluates the conjuncts left instead of walking them,
197
- // though not under ENABLED, and the next states take this shortcut only with warnings on.
198
187
  export const isAssignedShortcut = (replay: Pick<Replay, "environment" | "isInit" | "isEnabled">) =>
199
188
  !replay.isEnabled && (replay.isInit || replay.environment.runtime.isWarningEnabled);
200
189
 
201
- // TLC counts the node that goes on to the conjuncts left for each next state they produce, but
202
- // counts an initial state only as it adds it.
203
190
  const proceed = (
204
191
  replay: Replay,
205
192
  items: ActionItem | undefined,
@@ -269,7 +256,6 @@ const isChanged = (replay: Replay, item: ActionItem, partial: State) => {
269
256
  try {
270
257
  return !isEqualLikeTlc(before, after);
271
258
  } catch (error) {
272
- // TLC's v0.equals(v1) raises a FingerprintException when v0 has a source.
273
259
  if (replay.callStack) freezeCallStack(replay.callStack, [before], error);
274
260
  throw error;
275
261
  }
@@ -322,7 +308,6 @@ const visitAt = (
322
308
  switch (expression.kind) {
323
309
  case "Let": {
324
310
  const context = getContext(replay, scope, partial);
325
- // TLC walks a LET definition's body again at each reference, under the reference.
326
311
  const definitions = expression.definitions;
327
312
  const bound = replay.coverage
328
313
  ? bindDefinitions(definitions, context, {
@@ -343,7 +328,6 @@ const visitAt = (
343
328
  }
344
329
  });
345
330
 
346
- // The value of a user-defined operator TLC evaluates instead of walking its body.
347
331
  const visitValue = (
348
332
  replay: Replay,
349
333
  value: Value,
@@ -429,7 +413,6 @@ const visitDefined = (
429
413
  return visitValue(replay, value, items, partial, node);
430
414
  };
431
415
 
432
- // A variable takes the value when it has none yet, and otherwise must already have it.
433
416
  const proceedWithValue = (
434
417
  replay: Replay,
435
418
  items: ActionItem | undefined,
@@ -451,7 +434,6 @@ const createItem = (
451
434
  rest: ActionItem | undefined,
452
435
  ): ActionItem => ({ kind, expression, scope, node, rest });
453
436
 
454
- // TLC costs a set it enumerates for each element, and for the end of the enumeration.
455
437
  const getEnumerated = (replay: Replay, set: Value, elements: Value[]) => {
456
438
  if (replay.coverage) costCoverage(replay.coverage, set, elements.length + 1);
457
439
  return elements;
@@ -482,7 +464,6 @@ const visitAssignment = (
482
464
  return proceedWithValue(replay, items, partial, index, value, node);
483
465
  }
484
466
  const set: Value = expression.operator === "\\subseteq" ? { kind: "Subset", base: value } : value;
485
- // TLC gives the power set the source of its base, so a failure to enumerate it names both.
486
467
  if (typeof set === "object" && set !== value) replay.callStack?.sources.set(set, source);
487
468
  if (assigned !== undefined) {
488
469
  return (
@@ -510,7 +491,6 @@ const ENABLED_TEMPORAL_FORMS: Partial<Record<Expression["kind"], string>> = {
510
491
  StrongFairness: "SF",
511
492
  };
512
493
 
513
- // TLC rejects a temporal formula, and a quantifier or CHOOSE without a bound, under ENABLED.
514
494
  export const getEnabledFailure = (expression: Expression) => {
515
495
  const form =
516
496
  expression.kind === "Apply" && (expression.operator === "~>" || expression.operator === "-+->")
@@ -636,7 +616,6 @@ const visitApplication = (
636
616
  case "Forall": {
637
617
  const bounds = getBindings(replay, expression, context, node);
638
618
  if (bounds.length === 0) return proceed(replay, items, partial, node);
639
- // TLC adds each binding after the first to the front of the conjuncts left.
640
619
  const rest = bounds
641
620
  .slice(1)
642
621
  .reduce<ActionItem | undefined>(
@@ -764,9 +743,7 @@ const visitUnchanged = (
764
743
  return visitUnchanged(replay, operator.body, items, operator.scope, partial, node);
765
744
  }
766
745
  }
767
- // Tool#enabledUnchanged evaluates an operator application in the partial next state, which
768
- // fails on a variable it hasn't assigned, as its comment says. tla-ts walks the operator's
769
- // body as it walks a definition without parameters.
746
+ // Deviation from TLC: Tool#enabledUnchanged evaluates the application in the partial next state and fails on an unassigned variable.
770
747
  if (replay.isEnabled && expression.kind === "Apply") {
771
748
  const context = getContext(replay, scope, partial);
772
749
  const operator = resolveApplyOperator(expression, context);
@@ -799,17 +776,16 @@ const visitUnchanged = (
799
776
 
800
777
  const createReplay = (
801
778
  environment: Environment,
802
- isInit: boolean,
779
+ kind: "init" | "next" | "enabled",
803
780
  current: Value[] | undefined,
804
781
  onState: (state: Value[]) => void,
805
- isEnabled = false,
806
782
  onIncomplete?: (state: State) => void,
807
783
  ): Replay => ({
808
784
  environment,
809
785
  callStack: environment.callStack,
810
786
  coverage: environment.coverage,
811
- isInit,
812
- isEnabled,
787
+ isInit: kind === "init",
788
+ isEnabled: kind === "enabled",
813
789
  current,
814
790
  onState,
815
791
  onIncomplete,
@@ -823,19 +799,12 @@ export const replayEnabled = (
823
799
  state: Value[],
824
800
  environment: Environment,
825
801
  ) => {
826
- const replay = createReplay(
827
- environment,
828
- false,
829
- state,
830
- () => {
831
- throw ENABLED_FOUND;
832
- },
833
- true,
834
- );
802
+ const replay = createReplay(environment, "enabled", state, () => {
803
+ throw ENABLED_FOUND;
804
+ });
835
805
  const callStack = replay.callStack;
836
806
  const depth = callStack?.expressions.length ?? 0;
837
807
  try {
838
- // liveness.ts builds the <<A>>_v of WF_v(A) at the location of A.
839
808
  if (expression.kind === "AngleAction" && expression.location === expression.action.location) {
840
809
  const changed = createItem("Changed", expression.subscript, scope, -1, undefined);
841
810
  visit(replay, expression.action, changed, scope, getEmptyState(environment), -1);
@@ -845,7 +814,6 @@ export const replayEnabled = (
845
814
  return false;
846
815
  } catch (error) {
847
816
  if (error !== ENABLED_FOUND) throw error;
848
- // The frames the walk left are those of the successor, not of a failure.
849
817
  if (callStack) {
850
818
  callStack.expressions.length = depth;
851
819
  callStack.isFrozen = false;
@@ -862,7 +830,7 @@ export const replayInitialStates = (
862
830
  ) => {
863
831
  const [first, ...others] = inits;
864
832
  if (first === undefined) return;
865
- const replay = createReplay(environment, true, undefined, onState, false, onIncomplete);
833
+ const replay = createReplay(environment, "init", undefined, onState, onIncomplete);
866
834
  const rest = others.reduceRight<ActionItem | undefined>(
867
835
  (tail, init) => createItem("Predicate", init.expression, init.scope, init.node ?? -1, tail),
868
836
  undefined,
@@ -870,14 +838,12 @@ export const replayInitialStates = (
870
838
  visit(replay, first.expression, rest, first.scope, getEmptyState(environment), first.node ?? -1);
871
839
  };
872
840
 
873
- // TLC checks the successors of an action once it has computed them all.
874
841
  export const replaySuccessors = <Action extends ReplayAction>(
875
842
  actions: Action[],
876
843
  state: Value[],
877
844
  environment: Environment,
878
845
  onState: (state: Value[], action: Action) => void,
879
846
  ) => {
880
- // TLC fails to split a next-state relation that isn't an operator application, so replays none.
881
847
  if (actions.some((action) => LITERAL_KINDS.has(action.expression.kind))) return;
882
848
  actions.forEach((action) => {
883
849
  const successors: Value[][] = [];
@@ -894,14 +860,13 @@ export const walkSuccessors = (
894
860
  onState: (state: Value[]) => void,
895
861
  onIncomplete?: (state: State) => void,
896
862
  ) => {
897
- const replay = createReplay(environment, false, state, onState, false, onIncomplete);
863
+ const replay = createReplay(environment, "next", state, onState, onIncomplete);
898
864
  visit(replay, action.expression, undefined, action.scope, getEmptyState(environment), node);
899
865
  };
900
866
 
901
- // TLC's Spec.getPrimedLocs, whose nodes TLC reports even when they never produce a state.
902
867
  export const getPrimedRanges = (actions: ReplayAction[], environment: Environment) => {
903
868
  const ranges: Expression[] = [];
904
- const context = (scope: Scope | undefined): Context => ({
869
+ const createContext = (scope: Scope | undefined): Context => ({
905
870
  environment,
906
871
  scope,
907
872
  state: undefined,
@@ -933,7 +898,11 @@ export const getPrimedRanges = (actions: ReplayAction[], environment: Environmen
933
898
  ): void => {
934
899
  switch (expression.kind) {
935
900
  case "Let":
936
- collect(expression.body, bindDefinitions(expression.definitions, context(scope)), visited);
901
+ collect(
902
+ expression.body,
903
+ bindDefinitions(expression.definitions, createContext(scope)),
904
+ visited,
905
+ );
937
906
  return;
938
907
  case "Label":
939
908
  collect(expression.body, scope, visited);
@@ -989,7 +958,7 @@ export const getPrimedRanges = (actions: ReplayAction[], environment: Environmen
989
958
  }
990
959
  const operator =
991
960
  expression.kind === "Apply"
992
- ? resolveApplyOperator(expression, context(scope))
961
+ ? resolveApplyOperator(expression, createContext(scope))
993
962
  : binding?.kind === "Operator"
994
963
  ? binding.operator
995
964
  : binding
@@ -1001,7 +970,11 @@ export const getPrimedRanges = (actions: ReplayAction[], environment: Environmen
1001
970
  const args = expression.kind === "Apply" ? expression.args : [];
1002
971
  if (operator.params.length !== args.length) return;
1003
972
  visited.add(operator.body);
1004
- collect(operator.body, bindOperatorArguments(operator, args, context(scope)), visited);
973
+ collect(
974
+ operator.body,
975
+ bindOperatorArguments(operator, args, createContext(scope)),
976
+ visited,
977
+ );
1005
978
  visited.delete(operator.body);
1006
979
  }
1007
980
  }
@@ -1,16 +1,12 @@
1
- // TLC counts how many new states each expanded state yields in 32 buckets, the last of which
2
- // holds every count from 31 up.
3
1
  export const OUT_DEGREE_BUCKETS = 32;
4
2
 
5
3
  export const getOptimisticProbability = (distinctStates: number, generatedStates: number) =>
6
4
  distinctStates * ((generatedStates - distinctStates) / 2 ** 64);
7
5
 
8
- // TLC computes the estimate from the actual fingerprints only when the optimistic one is this high.
9
6
  const ACTUAL_PROBABILITY_THRESHOLD = 1e-10;
10
7
 
11
8
  const withDecimalPoint = (text: string) => (text.includes(".") ? text : `${text}.0`);
12
9
 
13
- // Java's Double.toString, which prints a number below 1E-3 or from 1E7 up in scientific notation.
14
10
  const toJavaString = (value: number) => {
15
11
  const magnitude = Math.abs(value);
16
12
  if (magnitude >= 1e-3 && magnitude < 1e7) return withDecimalPoint(String(value));
@@ -21,37 +17,36 @@ const toJavaString = (value: number) => {
21
17
  const isDigit = (character: string | undefined) =>
22
18
  character !== undefined && character >= "0" && character <= "9";
23
19
 
24
- // TLC's ProbabilityToString, which keeps two significant digits and drops a leading zero.
25
20
  export const formatProbability = (value: number) => {
26
21
  if (value === 0) return "0.0";
27
22
  const text = toJavaString(value);
28
- const cursor = { next: 0, digits: 0, result: "" };
29
- while (text[cursor.next] === "0") cursor.next++;
30
- while (isDigit(text[cursor.next])) {
31
- cursor.result += text[cursor.next++];
32
- cursor.digits++;
23
+ let next = 0;
24
+ let digits = 0;
25
+ let result = "";
26
+ while (text[next] === "0") next++;
27
+ while (isDigit(text[next])) {
28
+ result += text[next++];
29
+ digits++;
33
30
  }
34
- if (cursor.next === text.length) return cursor.result;
35
- if (text[cursor.next] !== ".") return text;
36
- cursor.next++;
37
- if (cursor.digits >= 2) {
38
- while (isDigit(text[cursor.next])) cursor.next++;
31
+ if (next === text.length) return result;
32
+ if (text[next] !== ".") return text;
33
+ next++;
34
+ if (digits >= 2) {
35
+ while (isDigit(text[next])) next++;
39
36
  } else {
40
- cursor.result += ".";
41
- if (cursor.digits === 0) {
42
- while (text[cursor.next] === "0") cursor.result += text[cursor.next++];
37
+ result += ".";
38
+ if (digits === 0) {
39
+ while (text[next] === "0") result += text[next++];
43
40
  }
44
- while (isDigit(text[cursor.next]) && cursor.digits < 2) {
45
- cursor.result += text[cursor.next++];
46
- cursor.digits++;
41
+ while (isDigit(text[next]) && digits < 2) {
42
+ result += text[next++];
43
+ digits++;
47
44
  }
48
- if (isDigit(text[cursor.next]) && Number(text[cursor.next]) >= 5) {
49
- cursor.result = roundUp(cursor.result);
50
- }
51
- while (isDigit(text[cursor.next])) cursor.next++;
45
+ if (isDigit(text[next]) && Number(text[next]) >= 5) result = roundUp(result);
46
+ while (isDigit(text[next])) next++;
52
47
  }
53
- if (cursor.next >= text.length) return cursor.result;
54
- if (text[cursor.next] === "E") return `${cursor.result}${text.slice(cursor.next)}`;
48
+ if (next >= text.length) return result;
49
+ if (text[next] === "E") return `${result}${text.slice(next)}`;
55
50
  return text;
56
51
  };
57
52
 
@@ -65,46 +60,57 @@ const roundUp = (digits: string): string => {
65
60
  return `${front}${Number(last) + 1}`;
66
61
  };
67
62
 
68
- // 1 divided by the distance, rounded half up to two significant digits like Java's BigDecimal.
69
63
  export const getActualProbability = (distance: bigint) => {
70
- const exponent = { value: 0 };
71
- while (10n ** BigInt(exponent.value + 1) < distance * 10n) exponent.value++;
72
- const scale = 10n ** BigInt(exponent.value + 1);
64
+ let exponent = 0;
65
+ while (10n ** BigInt(exponent + 1) < distance * 10n) exponent++;
66
+ const scale = 10n ** BigInt(exponent + 1);
73
67
  const quotient = scale / distance;
74
68
  const isRoundedUp = (scale % distance) * 2n >= distance;
75
- return Number(`${quotient + (isRoundedUp ? 1n : 0n)}e-${exponent.value + 1}`);
69
+ return Number(`${quotient + (isRoundedUp ? 1n : 0n)}e-${exponent + 1}`);
76
70
  };
77
71
 
78
- // TLC splits its fingerprints into two sets by their top bit and reports the smallest distance
79
- // between two fingerprints in the same set. Sorted as signed integers, each set is contiguous.
72
+ // The fingerprints come in runs, each of which holds only fingerprints below those of the next.
80
73
  export const getFingerprintDistance = (
81
74
  distinctStates: number,
82
75
  generatedStates: number,
83
- getFingerprints: () => BigInt64Array,
76
+ forEachRun: (visit: (run: BigInt64Array) => void) => void,
84
77
  ) => {
85
78
  const probability = getOptimisticProbability(distinctStates, generatedStates);
86
79
  if (probability < ACTUAL_PROBABILITY_THRESHOLD) return undefined;
87
- const fingerprints = getFingerprints().sort();
88
- // A gap whose high words differ by at most 2^20 is below 2^53, so a number holds it exactly and
89
- // only wider gaps need a BigInt.
90
- const words = new Int32Array(fingerprints.buffer);
91
- const nearest = { narrow: Number.POSITIVE_INFINITY, wide: 0x7fff_ffff_ffff_ffffn };
92
- for (let index = 1; index < fingerprints.length; index++) {
93
- const high = words[2 * index + 1];
94
- const previousHigh = words[2 * index - 1];
95
- if (high < 0 !== previousHigh < 0) continue;
96
- const highGap = high - previousHigh;
97
- if (highGap <= 0x10_0000) {
98
- const gap = highGap * 0x1_0000_0000 + (words[2 * index] >>> 0) - (words[2 * index - 2] >>> 0);
99
- nearest.narrow = Math.min(nearest.narrow, gap);
100
- } else {
101
- const gap = fingerprints[index] - fingerprints[index - 1];
102
- if (gap < nearest.wide) nearest.wide = gap;
80
+ let narrowest = Number.POSITIVE_INFINITY;
81
+ let widest = 0x7fff_ffff_ffff_ffffn;
82
+ let previous: bigint | undefined;
83
+ forEachRun((run) => {
84
+ if (run.length === 0) return;
85
+ const fingerprints = run.sort();
86
+ if (previous !== undefined && previous < 0n === fingerprints[0] < 0n) {
87
+ const gap = fingerprints[0] - previous;
88
+ if (gap < widest) widest = gap;
103
89
  }
104
- }
105
- if (nearest.narrow === Number.POSITIVE_INFINITY) return nearest.wide;
106
- const narrow = BigInt(nearest.narrow);
107
- return narrow < nearest.wide ? narrow : nearest.wide;
90
+ previous = fingerprints[fingerprints.length - 1];
91
+ const words = new Int32Array(
92
+ fingerprints.buffer,
93
+ fingerprints.byteOffset,
94
+ fingerprints.length * 2,
95
+ );
96
+ for (let index = 1; index < fingerprints.length; index++) {
97
+ const high = words[2 * index + 1];
98
+ const previousHigh = words[2 * index - 1];
99
+ if (high < 0 !== previousHigh < 0) continue;
100
+ const highGap = high - previousHigh;
101
+ if (highGap <= 0x10_0000) {
102
+ const gap =
103
+ highGap * 0x1_0000_0000 + (words[2 * index] >>> 0) - (words[2 * index - 2] >>> 0);
104
+ narrowest = Math.min(narrowest, gap);
105
+ } else {
106
+ const gap = fingerprints[index] - fingerprints[index - 1];
107
+ if (gap < widest) widest = gap;
108
+ }
109
+ }
110
+ });
111
+ if (narrowest === Number.POSITIVE_INFINITY) return widest;
112
+ const narrow = BigInt(narrowest);
113
+ return narrow < widest ? narrow : widest;
108
114
  };
109
115
 
110
116
  export const getOutDegreeSummary = (buckets: number[]) => {
@@ -113,10 +119,10 @@ export const getOutDegreeSummary = (buckets: number[]) => {
113
119
  const degrees = buckets.flatMap((count, degree) => (count > 0 ? [degree] : []));
114
120
  const total = buckets.reduce((sum, count, degree) => sum + count * degree, 0);
115
121
  const position = Math.floor(observations * 0.95);
116
- const cumulative = { count: 0 };
122
+ let cumulativeCount = 0;
117
123
  const percentile = degrees.find((degree) => {
118
- cumulative.count += buckets[degree];
119
- return cumulative.count > position;
124
+ cumulativeCount += buckets[degree];
125
+ return cumulativeCount > position;
120
126
  });
121
127
  return `The average outdegree of the complete state graph is ${Math.round(total / observations)} (minimum is ${degrees[0]}, the maximum ${degrees[degrees.length - 1]} and the 95th percentile is ${percentile}).`;
122
128
  };
@@ -37,21 +37,17 @@ import {
37
37
  setFunctionClass,
38
38
  } from "../values";
39
39
  import { getFingerprintPolynomial } from "./fingerprint";
40
-
41
- const padTime = (value: number) => String(value).padStart(2, "0");
40
+ import { zeroPad } from "./messages";
42
41
 
43
42
  const formatCalendarVersion = (date: Date) =>
44
- `${date.getUTCFullYear()}.${padTime(date.getUTCMonth() + 1)}.${padTime(date.getUTCDate())}.${padTime(date.getUTCHours())}${padTime(date.getUTCMinutes())}${padTime(date.getUTCSeconds())}`;
43
+ `${date.getUTCFullYear()}.${zeroPad(date.getUTCMonth() + 1)}.${zeroPad(date.getUTCDate())}.${zeroPad(date.getUTCHours())}${zeroPad(date.getUTCMinutes())}${zeroPad(date.getUTCSeconds())}`;
45
44
 
46
45
  const getRegisterFunction = <Key extends Value>(registers: Map<Key, Value>) =>
47
46
  createFunction([...registers].map(([key, value]): [Value, Value] => [key, createTuple([value])]));
48
47
 
49
- // TLC doesn't normalize the records it builds, so they keep their written order.
50
48
  const createTlcRecord = (fields: [string, Value][]) =>
51
49
  setFunctionClass(createWrittenFunction(fields), "record");
52
50
 
53
- // TLC creates its model checker after it processes the spec, so these are undefined before then.
54
-
55
51
  const CHECKER_KEYS = new Set(["diameter", "generated", "distinct", "queue", "stats", "config"]);
56
52
  const TLC_174_KEYS = new Set(["diameter", "distinct", "queue", "duration", "level"]);
57
53
  const CHECKER_KEYS_174 = new Set(["diameter", "distinct", "queue", "level"]);
@@ -153,7 +149,6 @@ const getPermutations = (elements: Value[]): Value[][] =>
153
149
  ]),
154
150
  );
155
151
 
156
- // TLC sorts the value of a TLCEval argument that it caches, with every value inside it.
157
152
  const normalizeDeeply = (value: Value): void => {
158
153
  if (typeof value !== "object") return;
159
154
  if (value.kind === "Set" || value.kind === "MixedSet") {
@@ -207,7 +202,6 @@ export const createTlcOperators = (
207
202
  defineOperator(":>", 2, (args) =>
208
203
  createFunction([[getValue(args, 0, ":>"), getValue(args, 1, ":>")]]),
209
204
  ),
210
- // CombineFcn converts both arguments before it checks either.
211
205
  defineOperator("@@", 2, (args) => {
212
206
  const leftValue = getValue(args, 0, "@@");
213
207
  const rightValue = getValue(args, 1, "@@");
@@ -224,7 +218,6 @@ export const createTlcOperators = (
224
218
  defineOperator("ToString", 1, (args) =>
225
219
  rankString(formatValue(getValue(args, 0, "ToString"), true)),
226
220
  ),
227
- // The checker passes no context where TLC caches the value, which it then sorts.
228
221
  {
229
222
  ...defineLazyOperator("TLCEval", 1, (args, context) => {
230
223
  const value = convertLikeTlcEval(getThunk(args, 0, "TLCEval")());
@@ -253,23 +246,20 @@ export const createTlcOperators = (
253
246
  if (typeof result === "boolean") return result;
254
247
  throw createModuleArgumentError("second", "SortSeq", "boolean function", result);
255
248
  };
256
- // TLC's insertion sort moves each element back past the ones it precedes.
257
249
  const sorted = elements.slice(0, 1);
258
250
  elements.slice(1).forEach((element) => {
259
- const position = { index: sorted.length };
260
- while (position.index > 0 && precedes(element, sorted[position.index - 1])) position.index--;
261
- sorted.splice(position.index, 0, element);
251
+ let position = sorted.length;
252
+ while (position > 0 && precedes(element, sorted[position - 1])) position--;
253
+ sorted.splice(position, 0, element);
262
254
  });
263
255
  return createTuple(sorted);
264
256
  }),
265
- // TLC reports a failure of TLCGet, its argument's too, as one of TLCGetSet.TLCGetEval.
266
257
  runtime.version === "1.7.4"
267
258
  ? overrideWithJava(
268
259
  {
269
260
  ...defineStateOperator("TLCGet", 1, (args, context) =>
270
261
  getTlcValue(runtime, getValue(args, 0, "TLCGet"), context),
271
262
  ),
272
- // Unlike TLCGetSet.TLCGetEval, TLC.TLCGet declares no minimum level.
273
263
  isLevelConstant: true,
274
264
  },
275
265
  "public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)",
@@ -281,8 +271,7 @@ export const createTlcOperators = (
281
271
  "public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)",
282
272
  ),
283
273
  defineStateOperator("TLCSet", 2, (args) => {
284
- const key = getValue(args, 0, "TLCSet");
285
- setTlcValue(runtime, print, key, getValue(args, 1, "TLCSet"));
274
+ setTlcValue(runtime, print, getValue(args, 0, "TLCSet"), getValue(args, 1, "TLCSet"));
286
275
  return true;
287
276
  }),
288
277
  defineConstant("Any", ANY_SET),