tla-ts 0.0.9 → 0.0.10-dev.63a6693bd

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 (400) hide show
  1. package/README.md +29 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +29 -29
  5. package/dist/deciders.js +42 -42
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +106 -10
  8. package/dist/index.d.ts +106 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +117 -37
  15. package/dist/prove.js +116 -36
  16. package/dist/run.cjs +143 -31
  17. package/dist/run.js +143 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +129 -104
  21. package/dist/transfer.js +129 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +48 -62
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +599 -754
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +14 -25
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +361 -0
  40. package/src/cli/tlc.ts +309 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +14 -53
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +169 -335
  51. package/src/errors.ts +71 -55
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +37 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +80 -100
  63. package/src/liveness-checker.ts +103 -153
  64. package/src/liveness.ts +150 -109
  65. package/src/obligations/action.ts +8 -39
  66. package/src/obligations/anonymize.ts +88 -82
  67. package/src/obligations/equality.ts +1 -1
  68. package/src/obligations/expression.ts +20 -21
  69. package/src/obligations/format.ts +1 -9
  70. package/src/obligations/generate.ts +46 -49
  71. package/src/obligations/index.ts +2 -13
  72. package/src/obligations/levels.ts +4 -8
  73. package/src/obligations/module.ts +28 -53
  74. package/src/obligations/normalize.ts +7 -25
  75. package/src/obligations/operators.ts +1 -2
  76. package/src/obligations/pragma.ts +1 -10
  77. package/src/obligations/printer.ts +47 -46
  78. package/src/obligations/proof.ts +1 -5
  79. package/src/obligations/regroup.ts +1 -4
  80. package/src/obligations/simplify.ts +42 -58
  81. package/src/obligations/source.ts +48 -78
  82. package/src/obligations/subexpression.ts +5 -11
  83. package/src/obligations/substitution.ts +1 -3
  84. package/src/obligations/temporal.ts +13 -19
  85. package/src/obligations/tuples.ts +3 -9
  86. package/src/parallel-worker.ts +30 -60
  87. package/src/parallel.ts +57 -71
  88. package/src/parser.ts +584 -316
  89. package/src/pcal/ast.ts +53 -86
  90. package/src/pcal/parse.ts +144 -219
  91. package/src/pcal/tokenize.ts +91 -131
  92. package/src/pcal/translate.ts +83 -130
  93. package/src/pcal/validate.ts +48 -68
  94. package/src/pretty-print.ts +7 -8
  95. package/src/prover/decide-pool.ts +8 -13
  96. package/src/prover/deciders.ts +3 -7
  97. package/src/prover/first-order.ts +0 -11
  98. package/src/prover/isabelle/decide.ts +0 -6
  99. package/src/prover/isabelle/encode.ts +11 -23
  100. package/src/prover/isabelle/isar/inner-syntax.ts +114 -115
  101. package/src/prover/isabelle/isar/method.ts +29 -53
  102. package/src/prover/isabelle/isar/proof.ts +1 -10
  103. package/src/prover/isabelle/isar/statement.ts +1 -6
  104. package/src/prover/isabelle/isar/theory.ts +26 -36
  105. package/src/prover/isabelle/isar/type-check.ts +17 -31
  106. package/src/prover/isabelle/provers/blast/blast.ts +17 -104
  107. package/src/prover/isabelle/provers/blast/branch.ts +1 -32
  108. package/src/prover/isabelle/provers/blast/prove.ts +1 -35
  109. package/src/prover/isabelle/provers/blast/rules.ts +6 -44
  110. package/src/prover/isabelle/provers/blast/state.ts +2 -28
  111. package/src/prover/isabelle/provers/blast/term.ts +9 -36
  112. package/src/prover/isabelle/provers/clasimp.ts +1 -13
  113. package/src/prover/isabelle/provers/classical.ts +14 -42
  114. package/src/prover/isabelle/provers/hypsubst.ts +28 -51
  115. package/src/prover/isabelle/pure/bicompose.ts +25 -38
  116. package/src/prover/isabelle/pure/consts.ts +1 -7
  117. package/src/prover/isabelle/pure/conv.ts +3 -17
  118. package/src/prover/isabelle/pure/drule.ts +33 -42
  119. package/src/prover/isabelle/pure/envir.ts +3 -52
  120. package/src/prover/isabelle/pure/goal.ts +1 -7
  121. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  122. package/src/prover/isabelle/pure/list.ts +0 -3
  123. package/src/prover/isabelle/pure/logic.ts +2 -15
  124. package/src/prover/isabelle/pure/name.ts +2 -9
  125. package/src/prover/isabelle/pure/net.ts +3 -59
  126. package/src/prover/isabelle/pure/object-logic.ts +3 -10
  127. package/src/prover/isabelle/pure/pattern.ts +2 -19
  128. package/src/prover/isabelle/pure/raw-simplifier.ts +17 -62
  129. package/src/prover/isabelle/pure/rewriter.ts +31 -67
  130. package/src/prover/isabelle/pure/search.ts +3 -10
  131. package/src/prover/isabelle/pure/seq.ts +1 -10
  132. package/src/prover/isabelle/pure/simplifier.ts +4 -12
  133. package/src/prover/isabelle/pure/table.ts +3 -32
  134. package/src/prover/isabelle/pure/tactic.ts +12 -22
  135. package/src/prover/isabelle/pure/tactical.ts +48 -47
  136. package/src/prover/isabelle/pure/term-ord.ts +2 -6
  137. package/src/prover/isabelle/pure/term.ts +2 -43
  138. package/src/prover/isabelle/pure/thm.ts +27 -47
  139. package/src/prover/isabelle/pure/type.ts +2 -15
  140. package/src/prover/isabelle/pure/unify.ts +20 -30
  141. package/src/prover/isabelle/pure/variable.ts +3 -7
  142. package/src/prover/isabelle/tla/classical-setup.ts +17 -24
  143. package/src/prover/isabelle/tla/context.ts +15 -18
  144. package/src/prover/isabelle/tla/logic.ts +14 -32
  145. package/src/prover/isabelle/tla/simpdata.ts +46 -43
  146. package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
  147. package/src/prover/ocaml.ts +0 -6
  148. package/src/prover/prep/action.ts +14 -54
  149. package/src/prover/prep/enabled-axioms.ts +12 -19
  150. package/src/prover/prep/fingerprint.ts +2 -21
  151. package/src/prover/prep/level-comparison.ts +8 -12
  152. package/src/prover/prep/md5.ts +0 -2
  153. package/src/prover/prep/methods.ts +33 -39
  154. package/src/prover/prep/normalize.ts +4 -28
  155. package/src/prover/prove-worker.ts +0 -2
  156. package/src/prover/prove.ts +87 -100
  157. package/src/prover/ptl/decide.ts +7 -12
  158. package/src/prover/ptl/encode.ts +14 -36
  159. package/src/prover/ptl/sat.ts +24 -32
  160. package/src/prover/ptl/tableau.ts +12 -26
  161. package/src/prover/smt/axioms.ts +0 -7
  162. package/src/prover/smt/context.ts +20 -28
  163. package/src/prover/smt/data.ts +433 -424
  164. package/src/prover/smt/encode.ts +43 -52
  165. package/src/prover/smt/extensionality.ts +0 -10
  166. package/src/prover/smt/flatten.ts +3 -22
  167. package/src/prover/smt/format.ts +5 -10
  168. package/src/prover/smt/instances.ts +0 -10
  169. package/src/prover/smt/rewrite.ts +663 -667
  170. package/src/prover/smt/solver/act-cache.ts +0 -15
  171. package/src/prover/smt/solver/arith-rewriter.ts +3 -48
  172. package/src/prover/smt/solver/array.ts +1 -3
  173. package/src/prover/smt/solver/asserted-formulas.ts +1 -43
  174. package/src/prover/smt/solver/ast-lt.ts +1 -11
  175. package/src/prover/smt/solver/ast-util.ts +1 -6
  176. package/src/prover/smt/solver/ast.ts +1 -165
  177. package/src/prover/smt/solver/auf-solver.ts +8 -44
  178. package/src/prover/smt/solver/case-split-queue.ts +1 -9
  179. package/src/prover/smt/solver/cg-table.ts +1 -18
  180. package/src/prover/smt/solver/clause.ts +1 -27
  181. package/src/prover/smt/solver/conflict-resolution.ts +0 -9
  182. package/src/prover/smt/solver/context.ts +7 -64
  183. package/src/prover/smt/solver/ctx-simplify.ts +14 -41
  184. package/src/prover/smt/solver/der.ts +2 -21
  185. package/src/prover/smt/solver/dyn-ack.ts +1 -11
  186. package/src/prover/smt/solver/e-matching.ts +4 -35
  187. package/src/prover/smt/solver/enode.ts +1 -21
  188. package/src/prover/smt/solver/expr-ref.ts +1 -5
  189. package/src/prover/smt/solver/expr-safe-replace.ts +1 -6
  190. package/src/prover/smt/solver/fingerprints.ts +1 -12
  191. package/src/prover/smt/solver/flat-literals.ts +1 -9
  192. package/src/prover/smt/solver/goal.ts +2 -14
  193. package/src/prover/smt/solver/hash.ts +0 -8
  194. package/src/prover/smt/solver/hashtable.ts +1 -12
  195. package/src/prover/smt/solver/internalizer.ts +7 -100
  196. package/src/prover/smt/solver/lbool.ts +1 -2
  197. package/src/prover/smt/solver/literal.ts +0 -3
  198. package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
  199. package/src/prover/smt/solver/lp/constraints.ts +2 -8
  200. package/src/prover/smt/solver/lp/containers.ts +12 -30
  201. package/src/prover/smt/solver/lp/core-solver.ts +10 -31
  202. package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
  203. package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
  204. package/src/prover/smt/solver/lp/dependency.ts +1 -4
  205. package/src/prover/smt/solver/lp/dioph-eq.ts +9 -102
  206. package/src/prover/smt/solver/lp/explanation.ts +1 -6
  207. package/src/prover/smt/solver/lp/gomory.ts +9 -22
  208. package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
  209. package/src/prover/smt/solver/lp/hnf.ts +11 -26
  210. package/src/prover/smt/solver/lp/int-cube.ts +15 -36
  211. package/src/prover/smt/solver/lp/int-solver.ts +4 -34
  212. package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
  213. package/src/prover/smt/solver/lp/lar-term.ts +1 -5
  214. package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
  215. package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
  216. package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
  217. package/src/prover/smt/solver/lp/nex.ts +1 -6
  218. package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
  219. package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
  220. package/src/prover/smt/solver/lp/nla-core.ts +36 -135
  221. package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
  222. package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
  223. package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
  224. package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
  225. package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
  226. package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
  227. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
  228. package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
  229. package/src/prover/smt/solver/lp/nla-order.ts +2 -13
  230. package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
  231. package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
  232. package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
  233. package/src/prover/smt/solver/lp/nla-types.ts +1 -11
  234. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
  235. package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
  236. package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
  237. package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
  238. package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
  239. package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
  240. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  241. package/src/prover/smt/solver/lp/random-updater.ts +1 -8
  242. package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
  243. package/src/prover/smt/solver/lp/union-find.ts +1 -6
  244. package/src/prover/smt/solver/mam-compiler.ts +18 -58
  245. package/src/prover/smt/solver/mam-interpreter.ts +1 -21
  246. package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
  247. package/src/prover/smt/solver/model-checker.ts +3 -37
  248. package/src/prover/smt/solver/model-evaluator.ts +3 -29
  249. package/src/prover/smt/solver/model-finder.ts +15 -32
  250. package/src/prover/smt/solver/model-generator.ts +1 -12
  251. package/src/prover/smt/solver/model-macro-solver.ts +23 -88
  252. package/src/prover/smt/solver/nlsat/algebraic.ts +63 -159
  253. package/src/prover/smt/solver/nlsat/atoms.ts +25 -23
  254. package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
  255. package/src/prover/smt/solver/nlsat/explain.ts +10 -69
  256. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
  257. package/src/prover/smt/solver/nlsat/levelwise.ts +49 -135
  258. package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
  259. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -159
  260. package/src/prover/smt/solver/nlsat/solver.ts +18 -90
  261. package/src/prover/smt/solver/nlsat/types.ts +1 -8
  262. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +2 -45
  263. package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
  264. package/src/prover/smt/solver/nnf.ts +3 -38
  265. package/src/prover/smt/solver/pattern-inference.ts +2 -15
  266. package/src/prover/smt/solver/poly-rewriter.ts +3 -23
  267. package/src/prover/smt/solver/propagate-values.ts +1 -10
  268. package/src/prover/smt/solver/proto-model.ts +3 -52
  269. package/src/prover/smt/solver/pull-quant.ts +1 -12
  270. package/src/prover/smt/solver/qe-lite-der.ts +1 -29
  271. package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
  272. package/src/prover/smt/solver/qe-lite.ts +3 -33
  273. package/src/prover/smt/solver/qi-queue.ts +1 -16
  274. package/src/prover/smt/solver/quant-tactics.ts +5 -22
  275. package/src/prover/smt/solver/quantifier-analyzer.ts +27 -47
  276. package/src/prover/smt/solver/quantifier-manager.ts +2 -13
  277. package/src/prover/smt/solver/random-gen.ts +1 -2
  278. package/src/prover/smt/solver/rational.ts +1 -8
  279. package/src/prover/smt/solver/ref-vector.ts +1 -6
  280. package/src/prover/smt/solver/relevancy.ts +2 -15
  281. package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
  282. package/src/prover/smt/solver/rewriter.ts +3 -85
  283. package/src/prover/smt/solver/rlimit.ts +2 -20
  284. package/src/prover/smt/solver/smtlib-parser.ts +80 -131
  285. package/src/prover/smt/solver/solver.ts +23 -34
  286. package/src/prover/smt/solver/sort.ts +1 -5
  287. package/src/prover/smt/solver/sticky-generations.ts +0 -5
  288. package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
  289. package/src/prover/smt/solver/theory-lra-bounds.ts +1 -7
  290. package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
  291. package/src/prover/smt/solver/theory-lra-internalize.ts +6 -43
  292. package/src/prover/smt/solver/theory-lra-model.ts +4 -19
  293. package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
  294. package/src/prover/smt/solver/theory-lra-state.ts +3 -8
  295. package/src/prover/smt/solver/theory-lra.ts +1 -8
  296. package/src/prover/smt/solver/var-subst.ts +2 -26
  297. package/src/prover/smt/table.ts +0 -8
  298. package/src/prover/tlapm/cache.ts +45 -40
  299. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  300. package/src/prover/tlapm/tlapm.ts +21 -20
  301. package/src/prover/verdict.ts +7 -2
  302. package/src/prover/zenon/check/check.ts +1 -11
  303. package/src/prover/zenon/check/definitions.ts +5 -15
  304. package/src/prover/zenon/check/equality.ts +0 -8
  305. package/src/prover/zenon/check/functions.ts +0 -4
  306. package/src/prover/zenon/check/keys.ts +0 -7
  307. package/src/prover/zenon/check/propositional.ts +0 -3
  308. package/src/prover/zenon/check/records.ts +1 -6
  309. package/src/prover/zenon/check/relations.ts +2 -14
  310. package/src/prover/zenon/check/rewrites.ts +2 -21
  311. package/src/prover/zenon/check/sets.ts +40 -61
  312. package/src/prover/zenon/check/terms.ts +1 -19
  313. package/src/prover/zenon/check/tla.ts +0 -6
  314. package/src/prover/zenon/decide.ts +0 -12
  315. package/src/prover/zenon/encode.ts +1 -8
  316. package/src/prover/zenon/eqrel.ts +2 -13
  317. package/src/prover/zenon/equality-rules.ts +0 -4
  318. package/src/prover/zenon/expr.ts +8 -26
  319. package/src/prover/zenon/index-table.ts +26 -57
  320. package/src/prover/zenon/isar-case.ts +9 -19
  321. package/src/prover/zenon/isar.ts +36 -64
  322. package/src/prover/zenon/limits.ts +0 -4
  323. package/src/prover/zenon/llproof.ts +2 -20
  324. package/src/prover/zenon/mltoll.ts +66 -104
  325. package/src/prover/zenon/node.ts +1 -11
  326. package/src/prover/zenon/ocaml.ts +1 -17
  327. package/src/prover/zenon/parse.ts +4 -12
  328. package/src/prover/zenon/phrase.ts +1 -11
  329. package/src/prover/zenon/proof.ts +0 -9
  330. package/src/prover/zenon/propositional-rules.ts +0 -5
  331. package/src/prover/zenon/rules.ts +2 -6
  332. package/src/prover/zenon/search.ts +5 -31
  333. package/src/prover/zenon/tla/functions.ts +59 -31
  334. package/src/prover/zenon/tla/llproof.ts +67 -76
  335. package/src/prover/zenon/tla/records.ts +57 -33
  336. package/src/prover/zenon/tla/rewrites.ts +12 -19
  337. package/src/prover/zenon/tla/sets.ts +83 -53
  338. package/src/prover/zenon/tla/terms.ts +0 -6
  339. package/src/prover/zenon/tla/tla.ts +66 -64
  340. package/src/randomization.ts +81 -35
  341. package/src/resolve.ts +67 -184
  342. package/src/runtime.ts +22 -22
  343. package/src/sany/builtins.ts +2 -5
  344. package/src/sany/generation.ts +394 -0
  345. package/src/sany/generator-def-entries.ts +210 -0
  346. package/src/sany/generator-definitions.ts +686 -0
  347. package/src/sany/generator-expressions.ts +1100 -0
  348. package/src/sany/generator-proofs.ts +662 -0
  349. package/src/sany/generator.ts +191 -2764
  350. package/src/sany/levels.ts +6 -34
  351. package/src/sany/lexer.ts +58 -77
  352. package/src/sany/linter.ts +1 -9
  353. package/src/sany/modules.ts +1 -5
  354. package/src/sany/nodes.ts +5 -43
  355. package/src/sany/parse-error.ts +39 -117
  356. package/src/sany/report.ts +32 -69
  357. package/src/sany/selectors.ts +49 -76
  358. package/src/sany/source.ts +1 -17
  359. package/src/sany/xml.ts +35 -117
  360. package/src/search.ts +541 -163
  361. package/src/simulate.ts +709 -0
  362. package/src/spec-description.ts +192 -100
  363. package/src/standard-definitions.ts +0 -4
  364. package/src/standard-modules.ts +264 -95
  365. package/src/state-graph.ts +52 -31
  366. package/src/subexpressions.ts +69 -52
  367. package/src/substitution-levels.ts +7 -7
  368. package/src/successors.ts +266 -99
  369. package/src/symmetry.ts +33 -25
  370. package/src/tableau.ts +27 -24
  371. package/src/tlc/fingerprint.ts +183 -67
  372. package/src/tlc/jar-data.ts +112 -6
  373. package/src/tlc/messages.ts +125 -54
  374. package/src/tlc/order.ts +39 -69
  375. package/src/tlc/random.ts +37 -49
  376. package/src/tlc/replay.ts +553 -228
  377. package/src/tlc/summary.ts +36 -47
  378. package/src/tlc/tlc-operators.ts +78 -44
  379. package/src/tlc/tlcext-operators.ts +139 -122
  380. package/src/tlc/trace-spec.ts +249 -0
  381. package/src/tlc/value-stream.ts +139 -0
  382. package/src/tlc/version.ts +1 -4
  383. package/src/transfer.ts +22 -25
  384. package/src/typescript/actions.ts +479 -0
  385. package/src/typescript/collections.ts +614 -0
  386. package/src/typescript/compile.ts +63 -0
  387. package/src/typescript/context.ts +94 -0
  388. package/src/typescript/emit.ts +121 -0
  389. package/src/typescript/expressions.ts +496 -0
  390. package/src/typescript/formula.ts +154 -0
  391. package/src/typescript/functions.ts +284 -0
  392. package/src/typescript/model.ts +162 -0
  393. package/src/typescript/names.ts +114 -0
  394. package/src/typescript/program.ts +48 -0
  395. package/src/typescript/properties.ts +139 -0
  396. package/src/typescript/scope.ts +112 -0
  397. package/src/typescript/steps.ts +167 -0
  398. package/src/typescript/types.ts +171 -0
  399. package/src/values.ts +832 -484
  400. package/src/worker.ts +7 -8
@@ -1,23 +1,8 @@
1
1
  // Ported from Z3 (src/math/lp/nra_solver.cpp, src/math/lp/nla_coi.cpp), MIT license, see
2
- // z3-license.txt. nla's bridge to nlsat. The constraints in the cone of influence of the monomials
3
- // to refine go to nlsat, with every monomial and term column replaced by its polynomial. check runs
4
- // nlsat's search on them: a model becomes nla's, and a refutation a lemma over the constraints of
5
- // its core. check_assignment instead hands nlsat the current values, and when they violate a
6
- // constraint, nlsat's linear cell around them becomes a lemma.
7
- // Deviations from Z3:
8
- // - nlsat input it does not implement (NlsatUnsupportedError) answers unknown. That is a linear
9
- // cell around an irrational section, where Z3 exits the process (levelwise.cpp,
10
- // add_linear_approximations).
11
- // - nlsat's check(rvalues) never answers satisfied, because its solver starts with the clause
12
- // [true], whose literal is unassigned outside search. So the satisfied branch of
13
- // check_assignment, which switches nla to nlsat's model, is left out.
14
- // - A lemma literal of check_assignment is always linear, because the cell bounds are, so
15
- // add_mul_def, which defines a fresh monomial column, is left out. A nonlinear literal would
16
- // answer unknown.
17
- // - nlsat counts against the budget of a check only its own steps, not those of the polynomial and
18
- // algebraic number managers, so a long search stops at a different point than Z3's. Like Z3's,
19
- // it then throws, which ends the whole check as unknown.
20
- // - Transcendental functions are not supported, so none are registered with nlsat.
2
+ // z3-license.txt.
3
+ // Deviations from Z3: unsupported nlsat input answers unknown where Z3 exits (levelwise.cpp,
4
+ // add_linear_approximations), check_assignment has no satisfied branch and no add_mul_def, the
5
+ // budget counts only nlsat's own steps, and transcendental functions are not supported.
21
6
  import { NlsatUnsupportedError, SmtInvariantError } from "../../../../errors";
22
7
  import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
23
8
  import { Rational, getLcm } from "../rational";
@@ -37,7 +22,7 @@ import {
37
22
  import { Explanation } from "./explanation";
38
23
  import type { LarSolver } from "./lar-solver";
39
24
  import { LarTerm } from "./lar-term";
40
- import { type NlaCore } from "./nla-core";
25
+ import type { NlaCore } from "./nla-core";
41
26
  import { LemmaBuilder, mkIneq } from "./nla-types";
42
27
 
43
28
  interface Occurrences {
@@ -46,14 +31,11 @@ interface Occurrences {
46
31
  terms: number[];
47
32
  }
48
33
 
49
- // lar_base_constraint::coeffs: the term of a term column, else the column itself.
50
34
  const getConstraintCoeffs = (lra: LarSolver, constraint: LarConstraint): [number, Rational][] =>
51
35
  lra.hasTerm(constraint.column)
52
36
  ? [...lra.getTerm(constraint.column).coeffs]
53
37
  : [[constraint.column, Rational.one]];
54
38
 
55
- // coi::init: the constraints reachable from the monomials to refine through shared variables,
56
- // monomials and terms, in the order the search reaches them.
57
39
  const getConeOfInfluence = (core: NlaCore) => {
58
40
  const lra = core.lra;
59
41
  const occurrences: Occurrences[] = [];
@@ -96,25 +78,19 @@ const getConeOfInfluence = (core: NlaCore) => {
96
78
  return { vars, constraints, monics };
97
79
  };
98
80
 
99
- // has_large_dyadic_denominator: a denominator 2^k with k >= 24.
100
81
  const hasLargeDyadicDenominator = (value: Rational) => {
101
82
  const den = value.den;
102
83
  return den >= 1n << 24n && (den & (den - 1n)) === 0n;
103
84
  };
104
85
 
105
- // is_dyadic_artifact: a constraint of an nla lemma's atom with a constant whose denominator is a
106
- // large power of two, the value of a column at an LP vertex. nlsat leaves it out, since clearing
107
- // such denominators blows up its resultants.
108
86
  const isDyadicArtifact = (lra: LarSolver, constraint: LarConstraint) =>
109
87
  constraint.isAuxiliary &&
110
88
  (hasLargeDyadicDenominator(constraint.rhs.x) ||
111
89
  getConstraintCoeffs(lra, constraint).some((entry) => hasLargeDyadicDenominator(entry[1])));
112
90
 
113
91
  export class NraSolver {
114
- // m_nlsat and m_values: the solver of the last check, and the values of its model.
115
92
  private solver = new NlsatSolver();
116
93
  private values: Anum[] = [];
117
- // m_lp2nl: the nlsat variable of each column the solver has.
118
94
  private lp2nl = new Map<number, number>();
119
95
 
120
96
  constructor(private core: NlaCore) {}
@@ -123,14 +99,10 @@ export class NraSolver {
123
99
  return this.solver.am;
124
100
  }
125
101
 
126
- // The steps of the last check.
127
102
  get steps() {
128
103
  return this.solver.steps;
129
104
  }
130
105
 
131
- // mk_definition: each included column as a polynomial in the included columns that are neither
132
- // monomials nor terms, scaled by an integer denominator to keep the coefficients integral.
133
- // Excluded columns have no definition.
134
106
  private mkDefinitions(isIncluded: (lpVar: number) => boolean) {
135
107
  const core = this.core;
136
108
  const lra = core.lra;
@@ -180,8 +152,6 @@ export class NraSolver {
180
152
  return { definitions, denominators };
181
153
  }
182
154
 
183
- // add_constraint: the constraint sum(coeff * v) kind rhs as den * (sum(coeff / den[v] * def[v]) -
184
- // rhs) kind 0, where den clears every denominator, in a unit clause that assumes the constraint.
185
155
  private addConstraint(
186
156
  constraintIndex: number,
187
157
  definitions: readonly (Polynomial | null)[],
@@ -217,10 +187,6 @@ export class NraSolver {
217
187
  return literal;
218
188
  }
219
189
 
220
- // check: nlsat's search on the constraints in the cone of influence, with every included column
221
- // replaced by its polynomial, giving up after maxConflicts conflicts or budget steps. A model
222
- // becomes nla's, when it satisfies every constraint and monomial, and a refutation becomes the
223
- // lemma that the constraints of its core are inconsistent.
224
190
  check(maxConflicts: number, budget: number) {
225
191
  const core = this.core;
226
192
  const lra = core.lra;
@@ -250,7 +216,6 @@ export class NraSolver {
250
216
  this.solver.restoreOrder();
251
217
  core.setUseNraModel(true);
252
218
  lra.initModel();
253
- // A violated constraint or monomial that nlsat saw would be a bug.
254
219
  for (const [constraintIndex, constraint] of lra.constraints.constraints.entries()) {
255
220
  if (!constraint.isActive || this.isConstraintSatisfied(constraint)) continue;
256
221
  if (cone.constraints.has(constraintIndex) && !skipped.has(constraintIndex))
@@ -273,8 +238,6 @@ export class NraSolver {
273
238
  return result;
274
239
  }
275
240
 
276
- // value: the model's value of a column. A monomial or term gets the value of its definition, a
277
- // column outside the cone of influence its value in lar_solver.
278
241
  value(lpVar: number) {
279
242
  const core = this.core;
280
243
  const lra = core.lra;
@@ -308,7 +271,6 @@ export class NraSolver {
308
271
  return this.values[lpVar];
309
272
  }
310
273
 
311
- // check_monic
312
274
  private isMonicSatisfied(lpVar: number, vars: readonly number[]) {
313
275
  const am = this.solver.am;
314
276
  const product = vars.reduce(
@@ -318,7 +280,6 @@ export class NraSolver {
318
280
  return am.compare(this.value(lpVar), product) === 0;
319
281
  }
320
282
 
321
- // check_constraint: the value of the left side against the right side, without δ.
322
283
  private isConstraintSatisfied(constraint: LarConstraint) {
323
284
  const am = this.solver.am;
324
285
  const sum = getConstraintCoeffs(this.core.lra, constraint).reduce(
@@ -338,8 +299,6 @@ export class NraSolver {
338
299
  : sign === 0;
339
300
  }
340
301
 
341
- // setup_assignment_solver and nlsat's check(rvalues, clause): the lemma clause, with the
342
- // constraint each literal came from, or null when nlsat finds no violated constraint.
343
302
  private getClause() {
344
303
  const core = this.core;
345
304
  const lra = core.lra;
@@ -363,7 +322,6 @@ export class NraSolver {
363
322
  return { clause: result.clause, literalConstraints };
364
323
  }
365
324
 
366
- // check_assignment
367
325
  checkAssignment() {
368
326
  const clause = (() => {
369
327
  try {
@@ -377,9 +335,6 @@ export class NraSolver {
377
335
  return this.addLemma(clause.clause, clause.literalConstraints);
378
336
  }
379
337
 
380
- // add_lemma: a literal whose negation is a constraint's literal becomes that constraint in the
381
- // explanation, and any other literal an inequality over the columns. Unknown, without the lemma,
382
- // when such an inequality already holds.
383
338
  private addLemma(clause: number[], literalConstraints: ReadonlyMap<number, number>) {
384
339
  const core = this.core;
385
340
  const solver = this.solver;
@@ -395,7 +350,6 @@ export class NraSolver {
395
350
  }
396
351
  const atom = solver.getAtom(literal);
397
352
  if (atom === null) throw new SmtInvariantError(`nlsat literal ${literal} has no atom`);
398
- // A root atom or a product of factors is unknown, and so is a nonlinear polynomial.
399
353
  if (
400
354
  !isIneqAtom(atom) ||
401
355
  atom.polynomials.length !== 1 ||
@@ -404,7 +358,6 @@ export class NraSolver {
404
358
  core.lemmas.pop();
405
359
  return L_UNDEF;
406
360
  }
407
- // process_polynomial_check_assignment, for a linear polynomial.
408
361
  const polynomial = atom.polynomials[0];
409
362
  const term = new LarTerm();
410
363
  let bound = Rational.zero;
@@ -1,5 +1,4 @@
1
- // Ported from Z3 (src/math/lp/numeric_pair.h), MIT license, see z3-license.txt. The value x + δy
2
- // of a column, where δ is a positive infinitesimal that encodes strict bounds.
1
+ // Ported from Z3 (src/math/lp/numeric_pair.h), MIT license, see z3-license.txt.
3
2
  import { Rational } from "../rational";
4
3
 
5
4
  export class Impq {
@@ -30,7 +29,6 @@ export class Impq {
30
29
  return new Impq(this.x.neg(), this.y.neg());
31
30
  }
32
31
 
33
- // Lexicographic, as δ is smaller than any positive rational.
34
32
  compare(other: Impq) {
35
33
  const byX = this.x.compare(other.x);
36
34
  return byX !== 0 ? byX : this.y.compare(other.y);
@@ -48,7 +46,6 @@ export class Impq {
48
46
  return this.y.isZero() && this.x.isInt();
49
47
  }
50
48
 
51
- // floor and ceil of numeric_pair: x + δy rounded, for a positive δ smaller than any gap.
52
49
  floor() {
53
50
  if (!this.x.isInt()) return this.x.floor();
54
51
  return this.y.isNegative() ? this.x.sub(Rational.one) : this.x;
@@ -1,6 +1,4 @@
1
- // Ported from Z3 (src/math/dd/pdd_interval.h), MIT license, see z3-license.txt. The interval of a
2
- // pdd under the intervals of its variables, as x*hi + lo by interval arithmetic. The distributed
3
- // variant, which nla does not call, is not ported.
1
+ // Ported from Z3 (src/math/dd/pdd_interval.h), MIT license, see z3-license.txt.
4
2
  import {
5
3
  add,
6
4
  type DepInterval,
@@ -1,11 +1,6 @@
1
- // Ported from Z3 (src/math/grobner/pdd_simplifier.h, src/math/grobner/pdd_simplifier.cpp), MIT
2
- // license, see z3-license.txt. The passes that dd::solver::simplify runs before saturation: solve
3
- // linear equations for their top variable, retire equations whose top variable occurs nowhere
4
- // else, subtract equations that share a lo part, and eliminate variables that occur as leaves.
5
- // The extended linear pass works only modulo 2 and the dual elimination is disabled in Z3, so
6
- // neither is ported. No pass makes a value outside an operation, so none can run out of nodes.
1
+ // Ported from Z3 (src/math/grobner/pdd_simplifier.h, src/math/grobner/pdd_simplifier.cpp), MIT license, see z3-license.txt.
7
2
  import { mkJoin } from "./dependency";
8
- import { Equation, PddSolver, SetUpdate, SOLVED, TO_SIMPLIFY } from "./pdd-solver";
3
+ import { type Equation, type PddSolver, SetUpdate, SOLVED, TO_SIMPLIFY } from "./pdd-solver";
9
4
  import { shrink } from "../array";
10
5
 
11
6
  export class PddSimplifier {
@@ -30,8 +25,6 @@ export class PddSimplifier {
30
25
  return this.simplifyLinear(linear);
31
26
  }
32
27
 
33
- // simplify_linear_step: solves each linear equation for its top variable, which it eliminates
34
- // from the others, and moves it to the solved equations.
35
28
  private simplifyLinear(linear: Equation[]) {
36
29
  const solver = this.solver;
37
30
  const useList = this.getUseList();
@@ -45,7 +38,6 @@ export class PddSimplifier {
45
38
  const variable = source.poly.var();
46
39
  const uses = useList[variable];
47
40
  let isAllReduced = true;
48
- // Equations added to the uses of the variable during the walk are not walked.
49
41
  for (let index = 0, length = uses.length; index < length; index++) {
50
42
  const target = uses[index];
51
43
  if (source === target || solver.isTrivial(target)) continue;
@@ -80,7 +72,6 @@ export class PddSimplifier {
80
72
  return kept > 0 || hasConflict;
81
73
  }
82
74
 
83
- // simplify_cc_step: replaces p*x + q and r*y + q by p*x + q and p*x - r*y, when p or r is a value.
84
75
  private simplifyCcStep() {
85
76
  const solver = this.solver;
86
77
  const los = new Map<number, Equation>();
@@ -107,7 +98,6 @@ export class PddSimplifier {
107
98
  return isReduced;
108
99
  }
109
100
 
110
- // simplify_leaf_step: removes a*x + b from the equations where x occurs as a leaf, for a value a.
111
101
  private simplifyLeafStep() {
112
102
  const solver = this.solver;
113
103
  const useList = this.getUseList();
@@ -137,8 +127,6 @@ export class PddSimplifier {
137
127
  return false;
138
128
  }
139
129
 
140
- // simplify_elim_pure_step: an equation linear in its top variable, which occurs nowhere else, is
141
- // solved.
142
130
  private simplifyElimPureStep() {
143
131
  const solver = this.solver;
144
132
  const useList = this.getUseList();
@@ -1,13 +1,8 @@
1
- // Ported from Z3 (src/math/grobner/pdd_solver.h, src/math/grobner/pdd_solver.cpp), MIT license,
2
- // see z3-license.txt. dd::solver, the Grobner basis completion that nla runs on polynomials as
3
- // pdds. Each step picks the simplest equation whose leading variable is highest, simplifies it by
4
- // the processed equations and them by it, and adds its S-polynomials with them to be simplified.
5
- // Equations move between the solved, processed and to-simplify sets, each in an array where an
6
- // equation knows its index. Z3's solver::simplify runs the simplifier, which here is PddSimplifier
7
- // in pdd-simplifier, run by its caller.
1
+ // Ported from Z3 (src/math/grobner/pdd_solver.h, src/math/grobner/pdd_solver.cpp), MIT license, see
2
+ // z3-license.txt.
8
3
  import { PddMemoryOutError } from "../../../../errors";
9
- import { Dependency, mkJoin } from "./dependency";
10
- import { Pdd, PddManager } from "./pdd";
4
+ import { type Dependency, mkJoin } from "./dependency";
5
+ import type { Pdd, PddManager } from "./pdd";
11
6
  import { shrink } from "../array";
12
7
 
13
8
  export const SOLVED = 0;
@@ -48,9 +43,6 @@ interface Subst {
48
43
 
49
44
  class PddSolverStats {
50
45
  simplified = 0;
51
- maxExprSize = 0;
52
- maxExprDegree = 0;
53
- superposed = 0;
54
46
  computeSteps = 0;
55
47
  }
56
48
 
@@ -64,8 +56,6 @@ export class Equation {
64
56
  ) {}
65
57
  }
66
58
 
67
- // scoped_update: walks a set with i and keeps the equations that nextj moves to j. finish keeps
68
- // those not walked and drops the rest, as Z3's destructor does.
69
59
  export class SetUpdate {
70
60
  i = 0;
71
61
  private j = 0;
@@ -141,10 +131,8 @@ export class PddSolver {
141
131
  if (this.var2level.length > 0) {
142
132
  this.levelp1 = Math.max(this.var2level[poly.var()] + 1, this.levelp1);
143
133
  }
144
- this.updateStats(equation);
145
134
  }
146
135
 
147
- // simplify: applies the substitutions to p, and returns it with its dependency.
148
136
  simplify(poly: Pdd, dep: Dependency) {
149
137
  let result = poly;
150
138
  let resultDep = dep;
@@ -175,7 +163,6 @@ export class PddSolver {
175
163
  const isLeadingTermChanged = substituted.differentLeadingTerm(target.poly);
176
164
  target.poly = substituted;
177
165
  target.dep = mkJoin(target.dep, dep);
178
- this.updateStats(target);
179
166
  return isLeadingTermChanged;
180
167
  };
181
168
  if (!this.isDone()) this.simplifySetUsing(this.processed, simplifier);
@@ -201,7 +188,6 @@ export class PddSolver {
201
188
  this.stats.computeSteps++;
202
189
  const equation = this.pickNext();
203
190
  if (equation === null) return false;
204
- // scoped_process: the equation goes back to processed unless the step settles it.
205
191
  let pending: Equation | null = equation;
206
192
  try {
207
193
  this.simplifyUsingAll(equation, this.processed);
@@ -261,11 +247,9 @@ export class PddSolver {
261
247
  this.isTooComplexFound = true;
262
248
  return;
263
249
  }
264
- this.stats.superposed++;
265
250
  this.add(poly, mkJoin(first.dep, second.dep));
266
251
  }
267
252
 
268
- // simplify_using(eq, eqs): reduces eq by the set until no reduction applies.
269
253
  private simplifyUsingAll(equation: Equation, set: Equation[]) {
270
254
  let isSimplified = false;
271
255
  do {
@@ -284,8 +268,6 @@ export class PddSolver {
284
268
  this.simplifySetUsing(set, (target) => this.trySimplifyUsing(target, source));
285
269
  }
286
270
 
287
- // simplify_using(set, simplifier): the simplifier returns null when it leaves the target, and
288
- // otherwise whether the leading term changed.
289
271
  private simplifySetUsing(set: Equation[], simplifier: (target: Equation) => boolean | null) {
290
272
  const update = new SetUpdate(set);
291
273
  for (; update.i < update.size; update.i++) {
@@ -306,8 +288,6 @@ export class PddSolver {
306
288
  update.finish();
307
289
  }
308
290
 
309
- // try_simplify_using: null when the target stays, and otherwise whether its leading term changed
310
- // while it was processed.
311
291
  private trySimplifyUsing(target: Equation, source: Equation) {
312
292
  if (source === target) return null;
313
293
  this.stats.simplified++;
@@ -321,12 +301,9 @@ export class PddSolver {
321
301
  target.state === PROCESSED && reduced.differentLeadingTerm(target.poly);
322
302
  target.poly = reduced;
323
303
  target.dep = mkJoin(target.dep, source.dep);
324
- this.updateStats(target);
325
304
  return isLeadingTermChanged;
326
305
  }
327
306
 
328
- // simplify_using(dst, src): reduces dst by src whatever the result, and returns whether its
329
- // leading term changed while it was processed.
330
307
  simplifyUsing(target: Equation, source: Equation) {
331
308
  if (source === target) return false;
332
309
  this.stats.simplified++;
@@ -336,7 +313,6 @@ export class PddSolver {
336
313
  if (reduced.equals(target.poly)) return isLeadingTermChanged;
337
314
  target.poly = reduced;
338
315
  target.dep = mkJoin(target.dep, source.dep);
339
- this.updateStats(target);
340
316
  return isLeadingTermChanged;
341
317
  }
342
318
 
@@ -400,9 +376,4 @@ export class PddSolver {
400
376
  equation.idx = set.length;
401
377
  set.push(equation);
402
378
  }
403
-
404
- private updateStats(equation: Equation) {
405
- this.stats.maxExprSize = Math.max(this.stats.maxExprSize, equation.poly.treeSize());
406
- this.stats.maxExprDegree = Math.max(this.stats.maxExprDegree, equation.poly.degree());
407
- }
408
379
  }