tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

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 (625) 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 +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +109 -10
  8. package/dist/index.d.ts +109 -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 +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -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 +45 -59
  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 +797 -782
  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 +433 -82
  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 +360 -0
  40. package/src/cli/tlc.ts +323 -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 +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -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 +590 -311
  64. package/src/liveness.ts +180 -124
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  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 +12 -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 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  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 +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +31 -74
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +1 -44
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  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 +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -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 +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  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 +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -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 +1026 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +615 -53
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  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 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -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 +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  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 +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  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 +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -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/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,712 @@
1
+ import type { CheckOptions, TraceStep, Violation } from "./check";
2
+ import {
3
+ isStackOverflow,
4
+ TlaEvaluationError,
5
+ TlaIncompleteSuccessorError,
6
+ TlaModuleError,
7
+ TlaStackOverflowError,
8
+ TlaTooManyStatesError,
9
+ TlaUnsupportedError,
10
+ UNEXPECTED_EVAL_EXCEPTION,
11
+ UNEXPECTED_EXCEPTION,
12
+ } from "./errors";
13
+ import { EXIT_STATUS, getMessageExitStatus, withLivenessExitCode } from "./exit-codes";
14
+ import { createLivenessChecker, type LivenessChecker } from "./liveness-checker";
15
+ import { getIncompleteSuccessorMessage, prepareSearch, reportAssumptionViolation } from "./search";
16
+ import { getActionLabel, toActionValue, type SpecAction } from "./spec-description";
17
+ import { forEachInitialState, forEachSuccessor } from "./successors";
18
+ import {
19
+ formatInnerMessage,
20
+ formatNestedMessage,
21
+ formatTlcDate,
22
+ getCodedMessage,
23
+ getFailureMessage,
24
+ isEvalException,
25
+ isHeadedError,
26
+ MESSAGE_CODE,
27
+ withUnexpectedException,
28
+ } from "./tlc/messages";
29
+ import { createJavaRandom, nextPrime, type JavaRandom } from "./tlc/random";
30
+ import { createCounterExample } from "./tlc/tlcext-operators";
31
+ import {
32
+ createModelValue,
33
+ createRecord,
34
+ formatState,
35
+ getSetBound,
36
+ isSameValue,
37
+ type Value,
38
+ } from "./values";
39
+
40
+ export interface SimulationOptions extends CheckOptions {
41
+ traceDepth: number;
42
+ traceCount: bigint | undefined;
43
+ aril: bigint;
44
+ isGenerating: boolean;
45
+ scheduler: "random" | "rl" | "rlaction";
46
+ onSimulation: (output: SimulationOutput) => void;
47
+ }
48
+
49
+ export interface SimulationStatistics {
50
+ generatedStates: number;
51
+ traces: number;
52
+ levelMean: number;
53
+ levelM2: number;
54
+ seed: bigint;
55
+ aril: bigint;
56
+ }
57
+
58
+ export type SimulationOutput =
59
+ | { kind: "message"; code: number; isError: boolean; message: string; toolMessage: string }
60
+ | { kind: "behavior"; trace: TraceStep[]; isLastStateOnly: boolean }
61
+ | { kind: "progress"; statistics: SimulationStatistics }
62
+ | { kind: "summary"; statistics: SimulationStatistics };
63
+
64
+ interface TraceNode {
65
+ state: Value[];
66
+ action: SpecAction;
67
+ predecessor: TraceNode | undefined;
68
+ level: number;
69
+ deferred?: (next: Value[]) => void;
70
+ }
71
+
72
+ interface WorkerError {
73
+ code: number;
74
+ message: string;
75
+ toolMessage: string;
76
+ node: TraceNode;
77
+ isException: boolean;
78
+ isSummarized: boolean;
79
+ violation?: Violation;
80
+ }
81
+
82
+ const FATAL_CODES = new Set<number>([
83
+ MESSAGE_CODE.invariantEvaluationFailed,
84
+ MESSAGE_CODE.actionPropertyEvaluationFailed,
85
+ MESSAGE_CODE.incompleteSuccessor,
86
+ ]);
87
+
88
+ const INFINITE_DEPTH = 2147483647;
89
+
90
+ const RL_ALPHA = 0.3;
91
+ const RL_GAMMA = 0.7;
92
+ const RL_REWARD = -10;
93
+
94
+ const isSameState = (left: Value[], right: Value[]) =>
95
+ left.every((value, index) => isSameValue(value, right[index]));
96
+
97
+ const getTrace = (last: TraceNode) => {
98
+ const trace: TraceNode[] = [];
99
+ for (let node: TraceNode | undefined = last; node; node = node.predecessor) {
100
+ const predecessor = node.predecessor;
101
+ if (predecessor && isSameState(node.state, predecessor.state)) continue;
102
+ trace.unshift(node);
103
+ }
104
+ trace.forEach((node, index) => {
105
+ node.predecessor = trace[index - 1];
106
+ node.level = index + 1;
107
+ });
108
+ return trace;
109
+ };
110
+
111
+ const findTemporalViolation = (
112
+ trace: TraceNode[],
113
+ getFingerprint: (state: Value[]) => bigint,
114
+ createChecker: (successors: number[][], states: Value[][]) => LivenessChecker | undefined,
115
+ ) => {
116
+ const fingerprints = trace.map((node) => getFingerprint(node.state));
117
+ const indices = new Map<bigint, number>();
118
+ const states: Value[][] = [];
119
+ const successors: number[][] = [];
120
+ fingerprints.forEach((fingerprint, position) => {
121
+ if (!indices.has(fingerprint)) {
122
+ indices.set(fingerprint, states.length);
123
+ states.push(trace[position].state);
124
+ successors.push([]);
125
+ }
126
+ if (position === 0) return;
127
+ const source = indices.get(fingerprints[position - 1]) ?? 0;
128
+ const target = indices.get(fingerprint) ?? 0;
129
+ if (source !== target && !successors[source].includes(target)) {
130
+ successors[source].push(target);
131
+ }
132
+ });
133
+ const checker = createChecker(successors, states);
134
+ if (!checker) return undefined;
135
+ checker.addInitialState(0, states[0]);
136
+ states.forEach((state, index) =>
137
+ checker.addState(
138
+ index,
139
+ state,
140
+ successors[index].map((successor) => ({ index: successor, state: states[successor] })),
141
+ ),
142
+ );
143
+ const lasso = checker.findViolation();
144
+ if (!lasso) return undefined;
145
+ const getLength = (path: number[]) =>
146
+ path.filter((index, position) => position === 0 || index !== path[position - 1]).length;
147
+ const path = [...lasso.prefix, ...lasso.cycle];
148
+ const length = getLength(path);
149
+ const cyclePosition = getLength(path.slice(0, lasso.prefix.length + 1));
150
+ const isStuttering =
151
+ fingerprints[length - 1] === getFingerprint(states[path[lasso.prefix.length]]);
152
+ return {
153
+ length,
154
+ loopStart: isStuttering ? length - 1 : cyclePosition - 1,
155
+ properties: checker.getViolatedProperties(
156
+ trace.slice(0, length).map((node) => node.state),
157
+ cyclePosition - 1,
158
+ ),
159
+ };
160
+ };
161
+
162
+ const createScheduler = (
163
+ scheduler: SimulationOptions["scheduler"],
164
+ nextActions: SpecAction[],
165
+ random: JavaRandom,
166
+ getFingerprint: (state: Value[]) => bigint,
167
+ getReward: (state: Value[] | undefined, next: Value[], fallback: number) => number,
168
+ ) => {
169
+ const qualities = nextActions.map(() => new Map<bigint | SpecAction, number>());
170
+ const getQualityKey = (node: TraceNode) =>
171
+ scheduler === "rlaction" ? node.action : getFingerprint(node.state);
172
+ const getRewardOf = (node: TraceNode) =>
173
+ getReward(node.predecessor?.state, node.state, RL_REWARD);
174
+ return {
175
+ getNextActionIndex: (node: TraceNode) => {
176
+ if (scheduler === "random") {
177
+ return Math.floor(random.nextDouble() * nextActions.length);
178
+ }
179
+ const key = getQualityKey(node);
180
+ qualities.forEach((quality) => {
181
+ if (!quality.has(key)) quality.set(key, 0);
182
+ });
183
+ const weights = qualities.map((quality) => Math.exp(quality.get(key) ?? 0));
184
+ const total = weights.reduce((sum, weight) => sum + weight, 0);
185
+ const ranked = weights
186
+ .map((weight, index) => ({ index, weight: weight / total }))
187
+ .sort((left, right) => right.weight - left.weight);
188
+ const threshold = random.nextDouble();
189
+ let cumulativeWeight = 0;
190
+ const chosen = ranked.find((item, position) => {
191
+ cumulativeWeight = position === 0 ? item.weight : cumulativeWeight + item.weight;
192
+ return cumulativeWeight >= threshold;
193
+ });
194
+ return (chosen ?? ranked[ranked.length - 1]).index;
195
+ },
196
+ markDisabled: (index: number, node: TraceNode) => {
197
+ if (scheduler === "random") return;
198
+ // TLC's rlaction scheduler stores the reward, then overwrites it as the rl scheduler does.
199
+ if (scheduler === "rlaction") getRewardOf(node);
200
+ qualities[index].set(getQualityKey(node), -Number.MAX_VALUE);
201
+ },
202
+ learnTrace: (last: TraceNode) => {
203
+ for (let node = last; node.predecessor; node = node.predecessor) {
204
+ const key = getQualityKey(node);
205
+ const maxQuality = qualities.reduce(
206
+ (max, quality) => Math.max(max, quality.get(key) ?? -Number.MAX_VALUE),
207
+ -Number.MAX_VALUE,
208
+ );
209
+ const quality = qualities[nextActions.indexOf(node.action)];
210
+ const predecessorKey = getQualityKey(node.predecessor);
211
+ quality.set(
212
+ predecessorKey,
213
+ (1 - RL_ALPHA) * (quality.get(predecessorKey) ?? 0) +
214
+ RL_ALPHA * (getRewardOf(node) + RL_GAMMA * maxQuality),
215
+ );
216
+ }
217
+ },
218
+ };
219
+ };
220
+
221
+ export const simulate = (options: SimulationOptions): number => {
222
+ const output = options.onSimulation;
223
+ const prepared = prepareSearch(options);
224
+ const config = prepared.config;
225
+ const specification = prepared.specification;
226
+ const environment = prepared.environment;
227
+ const runtime = environment.runtime;
228
+ const search = prepared.search;
229
+ const seed = options.seed ?? 0n;
230
+ const traceDepth = options.traceDepth === -1 ? INFINITE_DEPTH : options.traceDepth;
231
+ const traceLimit = options.traceCount ?? (1n << 63n) - 1n;
232
+ const random = createJavaRandom(seed);
233
+ for (let index = 0n; index < options.aril; index++) random.nextDouble();
234
+ const workerRandom = createJavaRandom(random.nextLong());
235
+ const statistics: SimulationStatistics = {
236
+ generatedStates: 0,
237
+ traces: 0,
238
+ levelMean: 0,
239
+ levelM2: 0,
240
+ seed,
241
+ aril: options.aril,
242
+ };
243
+ const reportMessage = (code: number, text: string, toolText = text, isError = true) =>
244
+ output({ kind: "message", code, isError, message: text, toolMessage: toolText });
245
+ const printSummary = () => output({ kind: "summary", statistics: { ...statistics } });
246
+ const nodes = new WeakMap<(Value | undefined)[], TraceNode>();
247
+ const description = prepared.getDescription();
248
+ const initActions = description.inits;
249
+ const nextActions = description.actions;
250
+ let traceCount = 0;
251
+ let currentTrace = 0;
252
+ let evaluatedAction: SpecAction | undefined;
253
+ runtime.getSuccessorAction = () => evaluatedAction;
254
+ runtime.getLevel = (state) => nodes.get(state)?.level ?? 0;
255
+ runtime.getBehavior = (state) => {
256
+ const node = nodes.get(state);
257
+ return node ? getTrace(node).map((step) => step.state) : [state];
258
+ };
259
+ runtime.getSimulationValue = (key, state) => {
260
+ const node = state && nodes.get(state);
261
+ switch (key) {
262
+ case "diameter":
263
+ return currentTrace === 0 ? 0 : traceCount + 1;
264
+ case "generated":
265
+ case "distinct":
266
+ case "queue":
267
+ throw new TlaModuleError(`TLCGet(${key}) was undefined.`);
268
+ case "action":
269
+ return node && toActionValue(node.action);
270
+ case "config":
271
+ return createRecord([
272
+ ["mode", options.isGenerating ? "generate" : "simulate"],
273
+ ["depth", traceDepth === INFINITE_DEPTH ? -1 : traceDepth],
274
+ ["traces", Number(BigInt.asIntN(32, traceLimit))],
275
+ ["deadlock", config.checkDeadlock],
276
+ ["seed", String(seed)],
277
+ ["aril", String(options.aril)],
278
+ ["worker", 1],
279
+ ["install", "unknown"],
280
+ ["sched", options.scheduler],
281
+ ]);
282
+ case "stats": {
283
+ const actions = new Map<string, number>();
284
+ for (let step = node; step && step.level > 1; step = step.predecessor) {
285
+ actions.set(step.action.name, (actions.get(step.action.name) ?? 0) + 1);
286
+ }
287
+ return createRecord([
288
+ ["traces", statistics.traces],
289
+ ["duration", Math.floor((Date.now() - runtime.startedAt) / 1000)],
290
+ ["generated", statistics.generatedStates],
291
+ [
292
+ "behavior",
293
+ createRecord([
294
+ ["actions", createRecord([...actions])],
295
+ ["id", currentTrace],
296
+ ]),
297
+ ],
298
+ ["worker", 0],
299
+ ["distinct", -1],
300
+ ["distinctvalues", -1],
301
+ ["retries", -1],
302
+ ["actions", createRecord([])],
303
+ ["levelmean", statistics.levelMean],
304
+ ["levelvariance", Math.round(statistics.levelM2 / (statistics.traces + 1))],
305
+ ]);
306
+ }
307
+ }
308
+ return undefined;
309
+ };
310
+ runtime.isStarted = true;
311
+ if (!search) {
312
+ throw new TlaUnsupportedError("tla-ts can't simulate a specification without variables");
313
+ }
314
+ const reportPostcondition = (isAfterViolation: boolean) => {
315
+ const postcondition = search.findPostconditionViolation(isAfterViolation);
316
+ if (!postcondition) return undefined;
317
+ if (postcondition.counts !== undefined) (options.onPrint ?? console.log)(postcondition.counts);
318
+ reportMessage(
319
+ postcondition.code,
320
+ postcondition.message,
321
+ formatInnerMessage(postcondition.code, postcondition.message, true),
322
+ );
323
+ return postcondition;
324
+ };
325
+ const temporalProperties = search.properties.liveness;
326
+ const createTemporalChecker = (successors: number[][], states: Value[][]) =>
327
+ withLivenessExitCode(() =>
328
+ withUnexpectedException(() =>
329
+ createLivenessChecker(temporalProperties, search.spec.temporals, environment, {
330
+ getFingerprint: (successor) =>
331
+ Number(BigInt.asIntN(32, runtime.getFingerprint(successor.state))),
332
+ getSuccessors: (index) =>
333
+ successors[index].map((successor) => ({ index: successor, state: states[successor] })),
334
+ }),
335
+ ),
336
+ );
337
+ const branches = createTemporalChecker([], [])?.branches;
338
+ if (branches) options.onProgress?.({ kind: "liveness-prepared", branches });
339
+ const assumptionStatus = reportAssumptionViolation(
340
+ specification.assumptions,
341
+ environment,
342
+ reportMessage,
343
+ );
344
+ if (assumptionStatus !== undefined) return assumptionStatus;
345
+ const initAction = initActions[initActions.length - 1];
346
+ const toNode = (state: Value[], action: SpecAction, predecessor: TraceNode | undefined) => {
347
+ const node: TraceNode = { state, action, predecessor, level: (predecessor?.level ?? 0) + 1 };
348
+ nodes.set(state, node);
349
+ return node;
350
+ };
351
+ const toRecord = (state: (Value | undefined)[]) =>
352
+ search.toRecord(state.map((value) => value ?? createModelValue("null")));
353
+ const toTraceSteps = (trace: TraceNode[]): TraceStep[] =>
354
+ trace.map((node, index) => ({
355
+ action: node.action.name,
356
+ label: getActionLabel(node.action, options.version, node.level === 1),
357
+ state:
358
+ config.alias === undefined || !node.state.every((value) => value !== undefined)
359
+ ? toRecord(node.state)
360
+ : search.evaluateAlias(
361
+ config.alias,
362
+ node.state,
363
+ (trace[index + 1] ?? node).state,
364
+ options.isTool ?? false,
365
+ ),
366
+ }));
367
+ const getCounterExample = (trace: TraceNode[]) =>
368
+ createCounterExample(
369
+ trace.map((node) => search.toRecord(node.state)),
370
+ trace.slice(1).map((node) => toActionValue(node.action)),
371
+ undefined,
372
+ );
373
+
374
+ const initialStates: TraceNode[] = [];
375
+ const isComplete = (state: (Value | undefined)[]): state is Value[] =>
376
+ state.every((value) => value !== undefined);
377
+ const generated: (Value | undefined)[][] = [];
378
+ const reportInitialException = (error: unknown, state: Value[] | undefined) => {
379
+ const failure = toEvaluationError(error);
380
+ if (!state) {
381
+ reportMessage(
382
+ MESSAGE_CODE.general,
383
+ `${getUnexpectedPrefix(failure)}${failure.message}`,
384
+ `${getUnexpectedPrefix(failure)}${formatNestedMessage(failure.message, true)}`,
385
+ );
386
+ printSummary();
387
+ return EXIT_STATUS.error;
388
+ }
389
+ const text = getFailureMessage(failure, false);
390
+ const initial = `While working on the initial state:\n${formatState(toRecord(state))}`;
391
+ reportMessage(
392
+ MESSAGE_CODE.initialState,
393
+ `${text.message}\n${initial}`,
394
+ `${text.toolMessage}\n${initial}`,
395
+ );
396
+ printSummary();
397
+ return getMessageExitStatus(MESSAGE_CODE.initialState);
398
+ };
399
+ const init = search.spec.init;
400
+ const addGenerated = (state: (Value | undefined)[]) => {
401
+ if (generated.length === getSetBound()) throw new TlaTooManyStatesError();
402
+ generated.push(state);
403
+ return false;
404
+ };
405
+ try {
406
+ if (init) forEachInitialState(init, environment, addGenerated, search.spec.scope, addGenerated);
407
+ } catch (error) {
408
+ return reportInitialException(error, undefined);
409
+ }
410
+ statistics.generatedStates = generated.length;
411
+ reportMessage(
412
+ MESSAGE_CODE.computingInitProgress,
413
+ `Computed ${generated.length} initial states...`,
414
+ undefined,
415
+ false,
416
+ );
417
+ for (const state of generated) {
418
+ if (!isComplete(state)) {
419
+ reportMessage(
420
+ MESSAGE_CODE.initialStateIncomplete,
421
+ `State is not completely specified by the initial predicate:\n${formatState(toRecord(state))}`,
422
+ );
423
+ return EXIT_STATUS.error;
424
+ }
425
+ try {
426
+ const node = toNode(state, initAction, undefined);
427
+ const violated = search.findViolatedInvariant(state);
428
+ if (violated) {
429
+ const alias = toTraceSteps([node])[0].state;
430
+ reportMessage(
431
+ MESSAGE_CODE.invariantViolatedInitial,
432
+ `Invariant ${violated.name} is violated by the initial state:\n${formatState(alias)}`,
433
+ );
434
+ runtime.counterExample = getCounterExample([node]);
435
+ reportPostcondition(true);
436
+ return EXIT_STATUS.safetyViolation;
437
+ }
438
+ // Deviation from TLC: its simulator checks no implied init, tla-ts checks them after invariants.
439
+ const predicate = search.findFailedInitialPredicate(state);
440
+ if (predicate) {
441
+ const alias = toTraceSteps([node])[0].state;
442
+ reportMessage(
443
+ MESSAGE_CODE.propertyViolatedInitial,
444
+ `Property ${predicate.name} is violated by the initial state:\n${formatState(alias)}`,
445
+ );
446
+ runtime.counterExample = getCounterExample([node]);
447
+ reportPostcondition(true);
448
+ return EXIT_STATUS.livenessViolation;
449
+ }
450
+ if (search.satisfiesConstraints(state)) {
451
+ search.trackStatePossible(state);
452
+ initialStates.push(node);
453
+ }
454
+ } catch (error) {
455
+ return reportInitialException(error, state);
456
+ }
457
+ }
458
+ if (generated.length === 0) {
459
+ reportMessage(
460
+ MESSAGE_CODE.noInitialStates,
461
+ "There is no state satisfying the initial state predicate.",
462
+ );
463
+ return EXIT_STATUS.error;
464
+ }
465
+ if (initialStates.length === 0) {
466
+ reportMessage(
467
+ MESSAGE_CODE.noInitialStatesInModel,
468
+ "There is no state satisfying the initial state predicate and the state-constraint(s).",
469
+ );
470
+ return EXIT_STATUS.error;
471
+ }
472
+ reportMessage(
473
+ MESSAGE_CODE.initGenerated1,
474
+ `Finished computing initial states: ${initialStates.length} distinct state generated at ${formatTlcDate(new Date())}.`,
475
+ undefined,
476
+ false,
477
+ );
478
+
479
+ const toWorkerError = (code: number, text: string, node: TraceNode): WorkerError => ({
480
+ code,
481
+ message: text,
482
+ toolMessage: text,
483
+ node,
484
+ isException: false,
485
+ isSummarized: true,
486
+ });
487
+ const getSuccessors = (current: TraceNode, action: SpecAction) => {
488
+ const successors: TraceNode[] = [];
489
+ let failure: WorkerError | undefined;
490
+ runtime.deferred = undefined;
491
+ evaluatedAction = action;
492
+ try {
493
+ forEachSuccessor(
494
+ action.expression,
495
+ current.state,
496
+ environment,
497
+ (successor) => {
498
+ const node = toNode(successor.state, action, current);
499
+ node.deferred = runtime.deferred;
500
+ runtime.deferred = undefined;
501
+ statistics.generatedStates++;
502
+ try {
503
+ const violated = search.findViolatedInvariant(node.state, current.state);
504
+ if (violated) {
505
+ failure = toWorkerError(
506
+ MESSAGE_CODE.invariantViolatedBehavior,
507
+ `Invariant ${violated.name} is violated.`,
508
+ node,
509
+ );
510
+ return true;
511
+ }
512
+ const property = search.findViolatedActionProperty(current.state, node.state);
513
+ if (property) {
514
+ failure = toWorkerError(
515
+ MESSAGE_CODE.actionPropertyViolatedBehavior,
516
+ `Action property ${property.name} is violated.`,
517
+ node,
518
+ );
519
+ return true;
520
+ }
521
+ } catch (error) {
522
+ if (!(error instanceof TlaEvaluationError) || !isHeadedError(error)) throw error;
523
+ const text = getFailureMessage(error, true);
524
+ failure = {
525
+ ...toWorkerError(text.code, text.message, node),
526
+ toolMessage: text.toolMessage,
527
+ };
528
+ return true;
529
+ }
530
+ if (!search.satisfiesConstraints(node.state, current.state)) return false;
531
+ search.trackStatePossible(node.state);
532
+ if (!search.satisfiesActionConstraints(current.state, node.state)) return false;
533
+ search.trackActionPossible(current.state, node.state);
534
+ if (successors.length === getSetBound()) throw new TlaTooManyStatesError();
535
+ successors.push(node);
536
+ return false;
537
+ },
538
+ action.scope,
539
+ options.isGenerating ? workerRandom : undefined,
540
+ );
541
+ } catch (error) {
542
+ if (!(error instanceof TlaIncompleteSuccessorError)) throw error;
543
+ const node = toNode(
544
+ error.state.map((value) => value ?? createModelValue("null")),
545
+ action,
546
+ current,
547
+ );
548
+ const text = getIncompleteSuccessorMessage(
549
+ error.variables,
550
+ action.name,
551
+ nextActions.length,
552
+ options.version,
553
+ );
554
+ return { successors, error: toWorkerError(MESSAGE_CODE.incompleteSuccessor, text, node) };
555
+ }
556
+ return { successors, error: failure };
557
+ };
558
+ let currentNode = initialStates[0];
559
+ const scheduler = createScheduler(
560
+ options.scheduler,
561
+ nextActions,
562
+ workerRandom,
563
+ runtime.getFingerprint,
564
+ search.getReward,
565
+ );
566
+ const getTemporalViolation = (last: TraceNode): Violation | undefined => {
567
+ if (temporalProperties.length === 0) return undefined;
568
+ const trace = getTrace(last);
569
+ const found = findTemporalViolation(trace, runtime.getFingerprint, createTemporalChecker);
570
+ if (!found) return undefined;
571
+ const back = trace[found.length];
572
+ return {
573
+ name: found.properties[0],
574
+ properties: found.properties,
575
+ trace: toTraceSteps(trace.slice(0, found.length)),
576
+ loopStart: found.loopStart,
577
+ loopLabel: back && getActionLabel(back.action, options.version, back.level === 1),
578
+ };
579
+ };
580
+ const simulateTrace = (): WorkerError | "stopped" | undefined => {
581
+ currentNode = initialStates[Math.floor(workerRandom.nextDouble() * initialStates.length)];
582
+ for (let depth = 0; depth < traceDepth; depth++) {
583
+ if (runtime.isStopped) return "stopped";
584
+ let actionIndex = scheduler.getNextActionIndex(currentNode);
585
+ const prime = nextPrime(workerRandom);
586
+ let successors: TraceNode[] = [];
587
+ for (let attempt = 0; attempt < nextActions.length; attempt++) {
588
+ const result = getSuccessors(currentNode, nextActions[actionIndex]);
589
+ if (result.error) return result.error;
590
+ successors = result.successors;
591
+ if (successors.length > 0) break;
592
+ scheduler.markDisabled(actionIndex, currentNode);
593
+ actionIndex = (actionIndex + prime) % nextActions.length;
594
+ }
595
+ if (successors.length === 0) {
596
+ if (config.checkDeadlock) {
597
+ return toWorkerError(MESSAGE_CODE.deadlockReached, "Deadlock reached.", currentNode);
598
+ }
599
+ break;
600
+ }
601
+ currentNode = successors[Math.floor(workerRandom.nextDouble() * successors.length)];
602
+ currentNode.deferred?.(currentNode.state);
603
+ }
604
+ if (runtime.isStopped) return "stopped";
605
+ const violation = getTemporalViolation(currentNode);
606
+ if (violation) {
607
+ return {
608
+ ...toWorkerError(MESSAGE_CODE.temporalPropertyViolated, "", currentNode),
609
+ isException: true,
610
+ violation,
611
+ };
612
+ }
613
+ const length = Math.min(traceDepth, currentNode.level);
614
+ const delta = length - statistics.levelMean;
615
+ statistics.levelMean += Math.trunc(delta / Math.max(statistics.traces, 1));
616
+ statistics.levelM2 += delta * (length - statistics.levelMean);
617
+ if (options.scheduler === "rl") scheduler.learnTrace(currentNode);
618
+ return undefined;
619
+ };
620
+ const toException = (error: unknown, node: TraceNode): WorkerError => {
621
+ const failure = toEvaluationError(error);
622
+ const coded = isEvalException(failure) ? undefined : getCodedMessage(failure.message);
623
+ if (coded) {
624
+ return {
625
+ code: coded.code,
626
+ message: failure.message,
627
+ toolMessage: formatInnerMessage(coded.code, failure.message, true),
628
+ node,
629
+ isException: true,
630
+ isSummarized: false,
631
+ };
632
+ }
633
+ const prefix = getUnexpectedPrefix(failure);
634
+ return {
635
+ code: MESSAGE_CODE.general,
636
+ message: `${prefix}${failure.message}`,
637
+ toolMessage: `${prefix}${formatNestedMessage(failure.message, true)}`,
638
+ node,
639
+ isException: true,
640
+ isSummarized: prefix !== UNEXPECTED_EXCEPTION,
641
+ };
642
+ };
643
+
644
+ const enumerableRandom = createJavaRandom(seed);
645
+ runtime.getRandom = () => enumerableRandom;
646
+ const errors: WorkerError[] = [];
647
+ const isContinued = options.isContinued ?? false;
648
+ while (true) {
649
+ statistics.traces++;
650
+ currentTrace = statistics.traces;
651
+ const outcome = (() => {
652
+ try {
653
+ return simulateTrace();
654
+ } catch (error) {
655
+ return toException(error, currentNode);
656
+ }
657
+ })();
658
+ if (outcome === "stopped") break;
659
+ traceCount++;
660
+ if (outcome) errors.push(outcome);
661
+ if (outcome?.isException) break;
662
+ if (BigInt(traceCount) >= traceLimit) break;
663
+ // TLC's worker starts one more behavior before the Simulator stops it, unless traces are bounded.
664
+ const isStopping = outcome !== undefined && (!isContinued || FATAL_CODES.has(outcome.code));
665
+ if (isStopping && options.traceCount === undefined) {
666
+ statistics.traces++;
667
+ break;
668
+ }
669
+ }
670
+ const printed = errors.findIndex(
671
+ (error) => error.isException || !isContinued || FATAL_CODES.has(error.code),
672
+ );
673
+ const reported = printed === -1 ? errors : errors.slice(0, printed + 1);
674
+ reported.forEach((error) => {
675
+ if (error.violation) {
676
+ options.onProgress?.({
677
+ kind: "violation",
678
+ status: "liveness-violation",
679
+ violation: error.violation,
680
+ });
681
+ printSummary();
682
+ return;
683
+ }
684
+ reportMessage(error.code, error.message, error.toolMessage);
685
+ output({
686
+ kind: "behavior",
687
+ trace: toTraceSteps(getTrace(error.node)),
688
+ isLastStateOnly: traceDepth === INFINITE_DEPTH,
689
+ });
690
+ if (error.isSummarized) printSummary();
691
+ });
692
+ const last = reported[reported.length - 1];
693
+ const errorStatus = last ? getMessageExitStatus(last.code) : EXIT_STATUS.success;
694
+ if (last) runtime.counterExample = getCounterExample(getTrace(last.node));
695
+ const postcondition = reportPostcondition(last !== undefined);
696
+ const postconditionStatus = postcondition
697
+ ? getMessageExitStatus(postcondition.code)
698
+ : EXIT_STATUS.success;
699
+ const status = Math.max(errorStatus, postconditionStatus);
700
+ output({ kind: "progress", statistics: { ...statistics } });
701
+ if (status === EXIT_STATUS.success) printSummary();
702
+ return status;
703
+ };
704
+
705
+ const toEvaluationError = (error: unknown) => {
706
+ if (isStackOverflow(error)) return new TlaStackOverflowError();
707
+ if (!(error instanceof TlaEvaluationError)) throw error;
708
+ return error;
709
+ };
710
+
711
+ const getUnexpectedPrefix = (error: TlaEvaluationError) =>
712
+ isEvalException(error) ? UNEXPECTED_EVAL_EXCEPTION : UNEXPECTED_EXCEPTION;