tla-ts 0.0.10-dev.094b9b512 → 0.0.10-dev.1ebc153bd

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 (530) hide show
  1. package/dist/compile.cjs +3 -3
  2. package/dist/compile.js +1 -1
  3. package/dist/deciders.cjs +37 -36
  4. package/dist/deciders.js +38 -37
  5. package/dist/index.cjs +1 -1
  6. package/dist/index.d.cts +5 -1
  7. package/dist/index.d.ts +5 -1
  8. package/dist/index.js +1 -1
  9. package/dist/parallel-worker.cjs +1 -1
  10. package/dist/parallel-worker.js +1 -1
  11. package/dist/prove-worker.cjs +1 -1
  12. package/dist/prove-worker.js +1 -1
  13. package/dist/prove.cjs +146 -58
  14. package/dist/prove.js +145 -57
  15. package/dist/run.cjs +43 -43
  16. package/dist/run.js +45 -45
  17. package/dist/tlapm.cjs +1 -1
  18. package/dist/tlapm.js +2 -2
  19. package/dist/transfer.cjs +40 -37
  20. package/dist/transfer.js +38 -35
  21. package/dist/worker.cjs +6 -6
  22. package/dist/worker.js +6 -6
  23. package/package.json +1 -1
  24. package/src/ast.ts +4 -3
  25. package/src/bags.ts +46 -28
  26. package/src/check-trace.ts +2 -16
  27. package/src/check.ts +349 -91
  28. package/src/cli/runtime-invariants.ts +20 -56
  29. package/src/cli/tlapm.ts +268 -71
  30. package/src/cli/tlc-arguments.ts +2 -2
  31. package/src/cli/tlc-output.ts +4 -5
  32. package/src/cli/tlc-usage.ts +0 -1
  33. package/src/cli/tlc.ts +26 -7
  34. package/src/cli/xml-exporter.ts +1 -1
  35. package/src/codegen.ts +9 -5
  36. package/src/dependencies.ts +72 -11
  37. package/src/dfid.ts +9 -2
  38. package/src/environment.ts +65 -36
  39. package/src/errors.ts +8 -1
  40. package/src/evaluate.ts +92 -32
  41. package/src/exit-codes.ts +5 -2
  42. package/src/instances.ts +5 -5
  43. package/src/java-overrides.ts +2 -2
  44. package/src/levels.ts +138 -90
  45. package/src/liveness-checker.ts +572 -204
  46. package/src/liveness.ts +47 -32
  47. package/src/obligations/action.ts +0 -2
  48. package/src/obligations/anonymize.ts +2 -6
  49. package/src/obligations/equality.ts +0 -2
  50. package/src/obligations/expression.ts +0 -2
  51. package/src/obligations/format.ts +0 -2
  52. package/src/obligations/generate.ts +0 -2
  53. package/src/obligations/index.ts +9 -8
  54. package/src/obligations/levels.ts +0 -2
  55. package/src/obligations/module.ts +0 -2
  56. package/src/obligations/normalize.ts +1 -6
  57. package/src/obligations/operators.ts +0 -2
  58. package/src/obligations/pragma.ts +2 -2
  59. package/src/obligations/printer.ts +5 -7
  60. package/src/obligations/proof.ts +0 -2
  61. package/src/obligations/regroup.ts +0 -2
  62. package/src/obligations/simplify.ts +0 -2
  63. package/src/obligations/subexpression.ts +1 -4
  64. package/src/obligations/substitution.ts +0 -2
  65. package/src/obligations/temporal.ts +0 -2
  66. package/src/obligations/tuples.ts +0 -2
  67. package/src/parallel-worker.ts +8 -2
  68. package/src/parallel.ts +7 -2
  69. package/src/parser.ts +256 -185
  70. package/src/pretty-print.ts +1 -1
  71. package/src/prover/deciders.ts +1 -8
  72. package/src/prover/isabelle/encode.ts +0 -2
  73. package/src/prover/isabelle/isar/attrib.ts +86 -55
  74. package/src/prover/isabelle/isar/context.ts +25 -26
  75. package/src/prover/isabelle/isar/induct.ts +2 -12
  76. package/src/prover/isabelle/isar/method.ts +6 -10
  77. package/src/prover/isabelle/isar/proof.ts +40 -39
  78. package/src/prover/isabelle/isar/rule-cases.ts +14 -22
  79. package/src/prover/isabelle/isar/theory.ts +16 -17
  80. package/src/prover/isabelle/isar/toplevel.ts +46 -56
  81. package/src/prover/isabelle/isar/type-check.ts +0 -2
  82. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  83. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  84. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  85. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  86. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  88. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  89. package/src/prover/isabelle/provers/classical.ts +1 -3
  90. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  91. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  92. package/src/prover/isabelle/pure/consts.ts +0 -2
  93. package/src/prover/isabelle/pure/conv.ts +0 -2
  94. package/src/prover/isabelle/pure/drule.ts +0 -2
  95. package/src/prover/isabelle/pure/envir.ts +0 -2
  96. package/src/prover/isabelle/pure/goal.ts +0 -2
  97. package/src/prover/isabelle/pure/logic.ts +0 -2
  98. package/src/prover/isabelle/pure/name.ts +0 -2
  99. package/src/prover/isabelle/pure/net.ts +0 -2
  100. package/src/prover/isabelle/pure/object-logic.ts +0 -2
  101. package/src/prover/isabelle/pure/pattern.ts +0 -2
  102. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  103. package/src/prover/isabelle/pure/rewriter.ts +3 -5
  104. package/src/prover/isabelle/pure/search.ts +0 -2
  105. package/src/prover/isabelle/pure/seq.ts +0 -2
  106. package/src/prover/isabelle/pure/simplifier.ts +0 -2
  107. package/src/prover/isabelle/pure/table.ts +0 -2
  108. package/src/prover/isabelle/pure/tactic.ts +0 -2
  109. package/src/prover/isabelle/pure/tactical.ts +0 -2
  110. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  111. package/src/prover/isabelle/pure/term.ts +3 -5
  112. package/src/prover/isabelle/pure/thm.ts +0 -2
  113. package/src/prover/isabelle/pure/type.ts +0 -2
  114. package/src/prover/isabelle/pure/unify.ts +0 -2
  115. package/src/prover/isabelle/pure/variable.ts +0 -2
  116. package/src/prover/isabelle/tla/classical-setup.ts +0 -2
  117. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  118. package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
  119. package/src/prover/ocaml.ts +4 -1
  120. package/src/prover/prep/action.ts +1 -0
  121. package/src/prover/prep/md5.ts +26 -29
  122. package/src/prover/prep/methods.ts +55 -6
  123. package/src/prover/prep/normalize.ts +4 -1
  124. package/src/prover/prove.ts +58 -32
  125. package/src/prover/ptl/decide.ts +43 -63
  126. package/src/prover/smt/context.ts +10 -14
  127. package/src/prover/smt/data.ts +51 -45
  128. package/src/prover/smt/encode.ts +1 -2
  129. package/src/prover/smt/rewrite.ts +3 -7
  130. package/src/prover/smt/simplify.ts +1 -1
  131. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
  132. package/src/prover/smt/solver/ackr-helper.ts +0 -3
  133. package/src/prover/smt/solver/ackr-model-converter.ts +1 -8
  134. package/src/prover/smt/solver/act-cache.ts +0 -1
  135. package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
  136. package/src/prover/smt/solver/aig-tactic.ts +25 -16
  137. package/src/prover/smt/solver/aig.ts +2 -3
  138. package/src/prover/smt/solver/arith-rewriter.ts +4 -7
  139. package/src/prover/smt/solver/arith-terms.ts +0 -2
  140. package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
  141. package/src/prover/smt/solver/array-rewriter.ts +1 -4
  142. package/src/prover/smt/solver/asserted-formulas.ts +67 -3
  143. package/src/prover/smt/solver/ast-lt.ts +2 -3
  144. package/src/prover/smt/solver/ast-util.ts +4 -5
  145. package/src/prover/smt/solver/ast.ts +171 -168
  146. package/src/prover/smt/solver/auf-solver.ts +0 -1
  147. package/src/prover/smt/solver/bit-blast-tactic.ts +2 -11
  148. package/src/prover/smt/solver/bit-blaster.ts +0 -3
  149. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  150. package/src/prover/smt/solver/bound-manager.ts +39 -29
  151. package/src/prover/smt/solver/bound-simplifier.ts +2 -5
  152. package/src/prover/smt/solver/bv-bound-chk.ts +2 -10
  153. package/src/prover/smt/solver/bv-decl-plugin.ts +13 -11
  154. package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
  155. package/src/prover/smt/solver/bv-rewriter.ts +15 -19
  156. package/src/prover/smt/solver/bv1-blast.ts +1 -11
  157. package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
  158. package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
  159. package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
  160. package/src/prover/smt/solver/card2bv.ts +3 -7
  161. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  162. package/src/prover/smt/solver/cg-table.ts +19 -16
  163. package/src/prover/smt/solver/check-logic.ts +6 -2
  164. package/src/prover/smt/solver/clause.ts +0 -1
  165. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +2 -5
  166. package/src/prover/smt/solver/conflict-resolution.ts +8 -8
  167. package/src/prover/smt/solver/context.ts +45 -15
  168. package/src/prover/smt/solver/ctx-simplify.ts +1 -3
  169. package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
  170. package/src/prover/smt/solver/datatype-decl-plugin.ts +22 -17
  171. package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
  172. package/src/prover/smt/solver/demodulator.ts +2 -5
  173. package/src/prover/smt/solver/dependent-expr-state.ts +25 -7
  174. package/src/prover/smt/solver/der.ts +0 -1
  175. package/src/prover/smt/solver/diff-neq.ts +1 -3
  176. package/src/prover/smt/solver/distribute-forall.ts +1 -11
  177. package/src/prover/smt/solver/dom-simplify.ts +1 -3
  178. package/src/prover/smt/solver/dt2bv-tactic.ts +2 -9
  179. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  180. package/src/prover/smt/solver/e-matching.ts +6 -7
  181. package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
  182. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  183. package/src/prover/smt/solver/elim-uncnstr.ts +7 -23
  184. package/src/prover/smt/solver/enode.ts +16 -10
  185. package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
  186. package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
  187. package/src/prover/smt/solver/euf/arith-internalize.ts +2 -8
  188. package/src/prover/smt/solver/euf/arith-solver.ts +0 -6
  189. package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
  190. package/src/prover/smt/solver/euf/array-internalize.ts +21 -12
  191. package/src/prover/smt/solver/euf/array-solver.ts +0 -2
  192. package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
  193. package/src/prover/smt/solver/euf/bv-internalize.ts +1 -3
  194. package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
  195. package/src/prover/smt/solver/euf/dt-solver.ts +19 -21
  196. package/src/prover/smt/solver/euf/egraph.ts +69 -53
  197. package/src/prover/smt/solver/euf/euf-solver.ts +38 -37
  198. package/src/prover/smt/solver/euf/fpa-solver.ts +37 -53
  199. package/src/prover/smt/solver/euf/mam.ts +7 -55
  200. package/src/prover/smt/solver/euf/q-ematch.ts +27 -98
  201. package/src/prover/smt/solver/euf/q-mbi.ts +4 -4
  202. package/src/prover/smt/solver/euf/q-model-fixer.ts +1 -4
  203. package/src/prover/smt/solver/euf/q-solver.ts +3 -3
  204. package/src/prover/smt/solver/euf/th-solver.ts +1 -16
  205. package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
  206. package/src/prover/smt/solver/expr-ref.ts +0 -1
  207. package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
  208. package/src/prover/smt/solver/expr2polynomial.ts +204 -80
  209. package/src/prover/smt/solver/factor.ts +37 -26
  210. package/src/prover/smt/solver/fd-solver.ts +3 -5
  211. package/src/prover/smt/solver/fingerprints.ts +0 -1
  212. package/src/prover/smt/solver/fix-dl-var.ts +2 -4
  213. package/src/prover/smt/solver/flat-literals.ts +0 -1
  214. package/src/prover/smt/solver/fm-tactic.ts +25 -14
  215. package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
  216. package/src/prover/smt/solver/fpa-rewriter.ts +12 -14
  217. package/src/prover/smt/solver/fpa2bv-converter.ts +13 -8
  218. package/src/prover/smt/solver/fpa2bv-rewriter.ts +1 -1
  219. package/src/prover/smt/solver/fpa2bv-tactic.ts +1 -3
  220. package/src/prover/smt/solver/goal.ts +6 -4
  221. package/src/prover/smt/solver/goal2nlsat.ts +57 -32
  222. package/src/prover/smt/solver/guard-set.ts +0 -1
  223. package/src/prover/smt/solver/hash.ts +0 -1
  224. package/src/prover/smt/solver/hashtable.ts +4 -1
  225. package/src/prover/smt/solver/inf-eps.ts +1 -2
  226. package/src/prover/smt/solver/inj-axiom.ts +0 -1
  227. package/src/prover/smt/solver/internalizer.ts +41 -3
  228. package/src/prover/smt/solver/lackr.ts +0 -2
  229. package/src/prover/smt/solver/lbool.ts +0 -1
  230. package/src/prover/smt/solver/lia2card.ts +1 -2
  231. package/src/prover/smt/solver/lia2pb.ts +18 -5
  232. package/src/prover/smt/solver/literal.ts +0 -1
  233. package/src/prover/smt/solver/logic-tactics.ts +9 -6
  234. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  235. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  236. package/src/prover/smt/solver/lp/containers.ts +7 -2
  237. package/src/prover/smt/solver/lp/core-solver.ts +0 -3
  238. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  239. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  240. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  241. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  242. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  243. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  244. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  245. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  246. package/src/prover/smt/solver/lp/int-cube.ts +0 -1
  247. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  248. package/src/prover/smt/solver/lp/lar-solver.ts +1 -2
  249. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  250. package/src/prover/smt/solver/lp/lp-settings.ts +1 -2
  251. package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
  252. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  253. package/src/prover/smt/solver/lp/nex.ts +2 -2
  254. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  255. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  256. package/src/prover/smt/solver/lp/nla-core.ts +26 -7
  257. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  258. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  259. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  260. package/src/prover/smt/solver/lp/nla-grobner.ts +158 -82
  261. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  262. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  263. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  264. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  265. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  266. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  267. package/src/prover/smt/solver/lp/nla-powers.ts +144 -108
  268. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  269. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  270. package/src/prover/smt/solver/lp/nla-transcendentals.ts +50 -19
  271. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  272. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  273. package/src/prover/smt/solver/lp/nra-solver.ts +138 -97
  274. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  275. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  276. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  277. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  278. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  279. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  280. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  281. package/src/prover/smt/solver/lp/union-find.ts +1 -2
  282. package/src/prover/smt/solver/macro-finder.ts +1 -4
  283. package/src/prover/smt/solver/mam-compiler.ts +14 -15
  284. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  285. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +1 -13
  286. package/src/prover/smt/solver/max-cliques.ts +0 -2
  287. package/src/prover/smt/solver/maxcore.ts +6 -15
  288. package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -2
  289. package/src/prover/smt/solver/maxlex.ts +0 -8
  290. package/src/prover/smt/solver/maxsmt-base.ts +7 -1
  291. package/src/prover/smt/solver/maxsmt.ts +0 -1
  292. package/src/prover/smt/solver/mbp/mbp-arith.ts +2 -12
  293. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
  294. package/src/prover/smt/solver/mbp/mbp-plugin.ts +10 -3
  295. package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
  296. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +1 -10
  297. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +1 -19
  298. package/src/prover/smt/solver/model-based-opt.ts +1 -2
  299. package/src/prover/smt/solver/model-checker.ts +2 -3
  300. package/src/prover/smt/solver/model-evaluator.ts +9 -6
  301. package/src/prover/smt/solver/model-finder.ts +0 -1
  302. package/src/prover/smt/solver/model-generator.ts +3 -2
  303. package/src/prover/smt/solver/model-macro-solver.ts +3 -4
  304. package/src/prover/smt/solver/model-printer.ts +0 -1
  305. package/src/prover/smt/solver/mpf.ts +2 -5
  306. package/src/prover/smt/solver/mus.ts +2 -4
  307. package/src/prover/smt/solver/muz/dl-context.ts +67 -19
  308. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
  309. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +68 -22
  310. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +7 -3
  311. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -6
  312. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +39 -11
  313. package/src/prover/smt/solver/muz/dl-mk-slice.ts +78 -16
  314. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +9 -4
  315. package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -30
  316. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -4
  317. package/src/prover/smt/solver/muz/dl-rule.ts +93 -57
  318. package/src/prover/smt/solver/muz/hnf.ts +6 -6
  319. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  320. package/src/prover/smt/solver/muz/horn-tactic.ts +15 -6
  321. package/src/prover/smt/solver/muz/rule-properties.ts +195 -37
  322. package/src/prover/smt/solver/muz/spacer-context.ts +111 -102
  323. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -4
  324. package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
  325. package/src/prover/smt/solver/muz/spacer-manager.ts +0 -6
  326. package/src/prover/smt/solver/muz/spacer-pdr.ts +4 -4
  327. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +4 -15
  328. package/src/prover/smt/solver/muz/spacer-util.ts +2 -29
  329. package/src/prover/smt/solver/muz/substitution.ts +88 -39
  330. package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
  331. package/src/prover/smt/solver/nlqsat.ts +5 -5
  332. package/src/prover/smt/solver/nlsat/algebraic.ts +197 -96
  333. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  334. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  335. package/src/prover/smt/solver/nlsat/explain.ts +379 -217
  336. package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
  337. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  338. package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
  339. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  340. package/src/prover/smt/solver/nlsat/solver.ts +118 -105
  341. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
  342. package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -19
  343. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  344. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  345. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  346. package/src/prover/smt/solver/nlsat-tactic.ts +1 -2
  347. package/src/prover/smt/solver/nnf.ts +6 -3
  348. package/src/prover/smt/solver/normalize-bounds.ts +0 -1
  349. package/src/prover/smt/solver/occf.ts +0 -1
  350. package/src/prover/smt/solver/opt-context.ts +19 -13
  351. package/src/prover/smt/solver/opt-nlsat.ts +97 -77
  352. package/src/prover/smt/solver/opt-pareto.ts +0 -2
  353. package/src/prover/smt/solver/opt-preprocess.ts +1 -2
  354. package/src/prover/smt/solver/opt-solver.ts +22 -11
  355. package/src/prover/smt/solver/opt-value.ts +0 -1
  356. package/src/prover/smt/solver/optsmt.ts +13 -12
  357. package/src/prover/smt/solver/parallel-tactic.ts +0 -2
  358. package/src/prover/smt/solver/pattern-inference.ts +2 -3
  359. package/src/prover/smt/solver/pb-rewriter.ts +15 -30
  360. package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
  361. package/src/prover/smt/solver/poly-rewriter.ts +76 -21
  362. package/src/prover/smt/solver/probes.ts +91 -28
  363. package/src/prover/smt/solver/propagate-values.ts +4 -1
  364. package/src/prover/smt/solver/proto-model.ts +9 -12
  365. package/src/prover/smt/solver/pull-quant.ts +0 -1
  366. package/src/prover/smt/solver/purify-arith.ts +50 -16
  367. package/src/prover/smt/solver/qe-arith-plugin.ts +4 -7
  368. package/src/prover/smt/solver/qe-lite-der.ts +0 -1
  369. package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
  370. package/src/prover/smt/solver/qe-lite.ts +2 -3
  371. package/src/prover/smt/solver/qe-mbp.ts +13 -24
  372. package/src/prover/smt/solver/qe.ts +48 -57
  373. package/src/prover/smt/solver/qel.ts +0 -1
  374. package/src/prover/smt/solver/qi-queue.ts +0 -1
  375. package/src/prover/smt/solver/qsat.ts +71 -97
  376. package/src/prover/smt/solver/quant-hoist.ts +2 -1
  377. package/src/prover/smt/solver/quant-tactics.ts +0 -1
  378. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  379. package/src/prover/smt/solver/quantifier-manager.ts +14 -10
  380. package/src/prover/smt/solver/quasi-macros.ts +9 -20
  381. package/src/prover/smt/solver/random-gen.ts +0 -1
  382. package/src/prover/smt/solver/rational.ts +17 -1
  383. package/src/prover/smt/solver/recfun-decl-plugin.ts +35 -21
  384. package/src/prover/smt/solver/recfun-rewriter.ts +1 -2
  385. package/src/prover/smt/solver/reduce-args.ts +0 -1
  386. package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
  387. package/src/prover/smt/solver/ref-vector.ts +0 -1
  388. package/src/prover/smt/solver/relevancy.ts +0 -1
  389. package/src/prover/smt/solver/rewriter-tpl.ts +6 -3
  390. package/src/prover/smt/solver/rewriter.ts +1 -2
  391. package/src/prover/smt/solver/rlimit.ts +17 -1
  392. package/src/prover/smt/solver/sat/asymm-branch.ts +59 -48
  393. package/src/prover/smt/solver/sat/big.ts +0 -1
  394. package/src/prover/smt/solver/sat/clause-use-list.ts +0 -8
  395. package/src/prover/smt/solver/sat/clause.ts +2 -20
  396. package/src/prover/smt/solver/sat/cleaner.ts +0 -2
  397. package/src/prover/smt/solver/sat/config.ts +6 -9
  398. package/src/prover/smt/solver/sat/consequences.ts +1 -2
  399. package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
  400. package/src/prover/smt/solver/sat/goal2sat.ts +1 -3
  401. package/src/prover/smt/solver/sat/inc-sat-solver.ts +30 -15
  402. package/src/prover/smt/solver/sat/model-converter.ts +2 -22
  403. package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
  404. package/src/prover/smt/solver/sat/pb-solver.ts +50 -26
  405. package/src/prover/smt/solver/sat/probing.ts +22 -21
  406. package/src/prover/smt/solver/sat/sat-tactic.ts +4 -4
  407. package/src/prover/smt/solver/sat/sat2goal.ts +9 -15
  408. package/src/prover/smt/solver/sat/scc.ts +1 -2
  409. package/src/prover/smt/solver/sat/simplifier.ts +16 -60
  410. package/src/prover/smt/solver/sat/solver.ts +47 -70
  411. package/src/prover/smt/solver/sat/var-queue.ts +0 -2
  412. package/src/prover/smt/solver/sat/watch-list.ts +7 -3
  413. package/src/prover/smt/solver/search-tree.ts +0 -1
  414. package/src/prover/smt/solver/seq-axioms.ts +21 -39
  415. package/src/prover/smt/solver/seq-decl-plugin.ts +10 -14
  416. package/src/prover/smt/solver/seq-derive.ts +11 -16
  417. package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
  418. package/src/prover/smt/solver/seq-eq-solver.ts +9 -10
  419. package/src/prover/smt/solver/seq-factory.ts +2 -4
  420. package/src/prover/smt/solver/seq-monadic.ts +7 -7
  421. package/src/prover/smt/solver/seq-range-predicate.ts +18 -8
  422. package/src/prover/smt/solver/seq-re-rewriter.ts +5 -130
  423. package/src/prover/smt/solver/seq-re-util.ts +8 -27
  424. package/src/prover/smt/solver/seq-regex-bisim.ts +2 -3
  425. package/src/prover/smt/solver/seq-regex-live.ts +6 -8
  426. package/src/prover/smt/solver/seq-rewriter.ts +32 -35
  427. package/src/prover/smt/solver/seq-skolem.ts +0 -24
  428. package/src/prover/smt/solver/seq-subset.ts +0 -1
  429. package/src/prover/smt/solver/seq-view-witness.ts +4 -6
  430. package/src/prover/smt/solver/smt-consequences.ts +0 -2
  431. package/src/prover/smt/solver/smt-kernel.ts +9 -5
  432. package/src/prover/smt/solver/smt-logics.ts +0 -1
  433. package/src/prover/smt/solver/smt-setup.ts +86 -20
  434. package/src/prover/smt/solver/smt2-printer.ts +0 -2
  435. package/src/prover/smt/solver/smtlib-parser.ts +1681 -721
  436. package/src/prover/smt/solver/smtlib-script.ts +1273 -793
  437. package/src/prover/smt/solver/solve-eqs.ts +13 -23
  438. package/src/prover/smt/solver/solver.ts +1 -2
  439. package/src/prover/smt/solver/static-features.ts +0 -5
  440. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  441. package/src/prover/smt/solver/tactic.ts +269 -130
  442. package/src/prover/smt/solver/term-enumeration.ts +0 -1
  443. package/src/prover/smt/solver/theory-array.ts +25 -60
  444. package/src/prover/smt/solver/theory-bv.ts +15 -54
  445. package/src/prover/smt/solver/theory-char.ts +0 -1
  446. package/src/prover/smt/solver/theory-datatype.ts +0 -1
  447. package/src/prover/smt/solver/theory-finite-set.ts +2 -2
  448. package/src/prover/smt/solver/theory-fpa.ts +46 -79
  449. package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
  450. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
  451. package/src/prover/smt/solver/theory-lra-final-check.ts +1 -2
  452. package/src/prover/smt/solver/theory-lra-internalize.ts +9 -1
  453. package/src/prover/smt/solver/theory-lra-model.ts +0 -1
  454. package/src/prover/smt/solver/theory-lra-propagate.ts +6 -5
  455. package/src/prover/smt/solver/theory-lra-state.ts +0 -1
  456. package/src/prover/smt/solver/theory-lra.ts +0 -7
  457. package/src/prover/smt/solver/theory-pb.ts +34 -15
  458. package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
  459. package/src/prover/smt/solver/theory-recfun.ts +2 -3
  460. package/src/prover/smt/solver/theory-seq-regex.ts +3 -7
  461. package/src/prover/smt/solver/theory-seq-solve.ts +6 -8
  462. package/src/prover/smt/solver/theory-seq-state.ts +8 -36
  463. package/src/prover/smt/solver/theory-seq.ts +32 -55
  464. package/src/prover/smt/solver/theory.ts +16 -2
  465. package/src/prover/smt/solver/tseitin-cnf.ts +3 -5
  466. package/src/prover/smt/solver/var-subst.ts +6 -6
  467. package/src/prover/smt/table.ts +3 -2
  468. package/src/prover/tlapm/cache.ts +8 -8
  469. package/src/prover/zenon/decide.ts +9 -13
  470. package/src/prover/zenon/encode.ts +0 -2
  471. package/src/prover/zenon/eqrel.ts +0 -2
  472. package/src/prover/zenon/equality-rules.ts +24 -2
  473. package/src/prover/zenon/expr.ts +21 -2
  474. package/src/prover/zenon/index-table.ts +7 -4
  475. package/src/prover/zenon/isar-case.ts +1 -3
  476. package/src/prover/zenon/isar.ts +2 -4
  477. package/src/prover/zenon/llproof.ts +0 -2
  478. package/src/prover/zenon/mltoll.ts +0 -2
  479. package/src/prover/zenon/node.ts +12 -13
  480. package/src/prover/zenon/parse.ts +0 -2
  481. package/src/prover/zenon/phrase.ts +1 -3
  482. package/src/prover/zenon/proof.ts +0 -2
  483. package/src/prover/zenon/propositional-rules.ts +0 -2
  484. package/src/prover/zenon/rules.ts +2 -3
  485. package/src/prover/zenon/search.ts +0 -2
  486. package/src/prover/zenon/tla/functions.ts +0 -2
  487. package/src/prover/zenon/tla/llproof.ts +0 -2
  488. package/src/prover/zenon/tla/records.ts +0 -2
  489. package/src/prover/zenon/tla/rewrites.ts +0 -2
  490. package/src/prover/zenon/tla/sets.ts +1 -3
  491. package/src/prover/zenon/tla/terms.ts +0 -2
  492. package/src/prover/zenon/tla/tla.ts +0 -2
  493. package/src/resolve.ts +625 -189
  494. package/src/runtime.ts +7 -1
  495. package/src/sany/builtins.ts +10 -10
  496. package/src/sany/generation.ts +2 -13
  497. package/src/sany/generator-definitions.ts +3 -1
  498. package/src/sany/generator-expressions.ts +36 -30
  499. package/src/sany/generator-proofs.ts +5 -3
  500. package/src/sany/generator.ts +2 -1
  501. package/src/sany/levels.ts +0 -2
  502. package/src/sany/lexer.ts +3 -3
  503. package/src/sany/linter.ts +0 -2
  504. package/src/sany/modules.ts +4 -2
  505. package/src/sany/nodes.ts +1 -1
  506. package/src/sany/selectors.ts +11 -6
  507. package/src/sany/xml.ts +2 -3
  508. package/src/search.ts +209 -56
  509. package/src/simulate.ts +3 -0
  510. package/src/spec-description.ts +2 -2
  511. package/src/standard-definitions.ts +4 -0
  512. package/src/state-graph.ts +0 -2
  513. package/src/subexpressions.ts +265 -94
  514. package/src/successors.ts +2 -1
  515. package/src/symmetry.ts +3 -3
  516. package/src/tableau.ts +2 -2
  517. package/src/tlc/fingerprint.ts +81 -9
  518. package/src/tlc/jar-data.ts +10 -0
  519. package/src/tlc/messages.ts +3 -3
  520. package/src/tlc/order.ts +14 -3
  521. package/src/tlc/summary.ts +29 -14
  522. package/src/tlc/tlc-operators.ts +3 -1
  523. package/src/tlc/tlcext-operators.ts +61 -16
  524. package/src/tlc/trace-spec.ts +5 -5
  525. package/src/typed-tier.ts +6541 -0
  526. package/src/typescript/types.ts +2 -2
  527. package/src/values.ts +46 -27
  528. package/src/prover/smt/solver/seq-regex-witness.ts +0 -100
  529. package/src/prover/smt/solver/z3-license.txt +0 -10
  530. package/src/prover/zenon/LICENSE +0 -32
@@ -1,14 +1,9 @@
1
- // Ported from Z3 (src/math/lp/nra_solver.cpp, src/math/lp/nla_coi.cpp), MIT license, see
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.
6
- import { NlsatUnsupportedError, SmtInvariantError } from "../../../../errors";
1
+ import { SmtCanceledError, SmtInvariantError } from "../../../../errors";
7
2
  import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
8
3
  import { Rational, getLcm } from "../rational";
9
4
  import { Anum } from "../nlsat/algebraic";
10
5
  import { NlsatSolver } from "../nlsat/solver";
11
- import type { Polynomial } from "../nlsat/polynomial";
6
+ import { type Polynomial, PolynomialRef, PolynomialRefVector } from "../nlsat/polynomial";
12
7
  import { isIneqAtom } from "../nlsat/types";
13
8
  import {
14
9
  KIND_EQ,
@@ -88,24 +83,33 @@ const hasLargeDyadicDenominator = (value: Rational) => {
88
83
  return den >= 1n << 24n && (den & (den - 1n)) === 0n;
89
84
  };
90
85
 
86
+ const getSortedVars = (vars: readonly number[]) =>
87
+ [...vars].sort((first, second) => first - second);
88
+
91
89
  const isDyadicArtifact = (lra: LarSolver, constraint: LarConstraint) =>
92
90
  constraint.isAuxiliary &&
93
91
  (hasLargeDyadicDenominator(constraint.rhs.x) ||
94
92
  getConstraintCoeffs(lra, constraint).some((entry) => hasLargeDyadicDenominator(entry[1])));
95
93
 
96
94
  export class NraSolver {
97
- private solver = new NlsatSolver();
95
+ private solver: NlsatSolver;
98
96
  private values: Anum[] = [];
99
97
  private lp2nl = new Map<number, number>();
98
+ private literal2constraint = new Map<number, number>();
99
+ private vars2mon = new Map<string, number>();
100
100
 
101
- constructor(private core: NlaCore) {}
101
+ constructor(private core: NlaCore) {
102
+ this.solver = new NlsatSolver(core.nraLimit);
103
+ }
102
104
 
103
105
  get am() {
104
106
  return this.solver.am;
105
107
  }
106
108
 
107
- get steps() {
108
- return this.solver.steps;
109
+ private reset() {
110
+ this.solver = new NlsatSolver(this.core.nraLimit);
111
+ this.values = [];
112
+ this.lp2nl.clear();
109
113
  }
110
114
 
111
115
  private mkDefinitions(isIncluded: (lpVar: number) => boolean) {
@@ -113,53 +117,48 @@ export class NraSolver {
113
117
  const lra = core.lra;
114
118
  const solver = this.solver;
115
119
  const pm = solver.pm;
116
- const definitions: (Polynomial | null)[] = [];
120
+ const definitions = new PolynomialRefVector(pm);
117
121
  const denominators: bigint[] = [];
122
+ const p = new PolynomialRef(pm);
123
+ const constant = new PolynomialRef(pm);
124
+ const product = new PolynomialRef(pm);
118
125
  for (let lpVar = 0; lpVar < lra.columns.length; lpVar++) {
119
126
  if (!isIncluded(lpVar)) {
120
- definitions.push(null);
127
+ definitions.push(pm.zero);
121
128
  denominators.push(0n);
122
129
  continue;
123
130
  }
124
131
  const variable = solver.mkVar(lra.isInt(lpVar));
125
132
  this.lp2nl.set(lpVar, variable);
133
+ let denominator = 1n;
126
134
  if (core.emons.isMonicVar(lpVar)) {
127
- let definition: Polynomial | null = null;
128
- let denominator = 1n;
129
- for (const factor of core.emons.get(lpVar).vars) {
135
+ for (const [index, factor] of core.emons.get(lpVar).vars.entries()) {
130
136
  denominator = denominators[factor] * denominator;
131
- definition =
132
- definition === null ? definitions[factor] : pm.mul(definition, definitions[factor]!);
137
+ p.set(index === 0 ? definitions.get(factor) : pm.mul(p.get(), definitions.get(factor)));
133
138
  }
134
- definitions.push(definition ?? pm.mkVar(variable));
135
- denominators.push(denominator);
136
- continue;
137
- }
138
- if (lra.hasTerm(lpVar)) {
139
+ } else if (lra.hasTerm(lpVar)) {
139
140
  const term = [...lra.getTerm(lpVar).coeffs];
140
- const denominator = term.reduce(
141
- (result, entry) => getLcm(entry[1].div(Rational.of(denominators[entry[0]])).den, result),
142
- 1n,
143
- );
144
- let definition: Polynomial | null = null;
145
- for (const entry of term) {
141
+ for (const entry of term)
142
+ denominator = getLcm(entry[1].div(Rational.of(denominators[entry[0]])).den, denominator);
143
+ for (const [index, entry] of term.entries()) {
146
144
  const coeff = entry[1].mul(Rational.of(denominator, denominators[entry[0]]));
147
- const scaled = pm.mul(pm.mkConst(coeff.num), definitions[entry[0]]!);
148
- definition = definition === null ? scaled : pm.add(definition, scaled);
145
+ constant.set(pm.mkConst(coeff.num));
146
+ product.set(pm.mul(constant.get(), definitions.get(entry[0])));
147
+ p.set(index === 0 ? product.get() : pm.add(p.get(), product.get()));
148
+ product.reset();
149
+ constant.reset();
149
150
  }
150
- definitions.push(definition ?? pm.zero);
151
- denominators.push(denominator);
152
- continue;
153
- }
154
- definitions.push(pm.mkVar(variable));
155
- denominators.push(1n);
151
+ } else p.set(pm.mkVar(variable));
152
+ definitions.push(p.getOrNull() ?? pm.zero);
153
+ denominators.push(denominator);
154
+ p.reset();
156
155
  }
157
156
  return { definitions, denominators };
158
157
  }
159
158
 
160
159
  private addConstraint(
161
160
  constraintIndex: number,
162
- definitions: readonly (Polynomial | null)[],
161
+ definitions: PolynomialRefVector,
163
162
  denominators: readonly bigint[],
164
163
  ) {
165
164
  const lra = this.core.lra;
@@ -172,23 +171,32 @@ export class NraSolver {
172
171
  (result, entry) => getLcm(result, entry[1].div(Rational.of(denominators[entry[0]])).den),
173
172
  rhs.den,
174
173
  );
175
- let polynomial = pm.mkConst(-(rhs.num * denominator) / rhs.den);
174
+ const p = new PolynomialRef(pm);
175
+ const poly = new PolynomialRef(pm);
176
+ const constant = new PolynomialRef(pm);
177
+ p.set(pm.mkConst(-(rhs.num * denominator) / rhs.den));
176
178
  for (const entry of coeffs) {
177
179
  const coeff = entry[1].mul(Rational.of(denominator, denominators[entry[0]]));
178
- polynomial = pm.add(polynomial, pm.mul(definitions[entry[0]]!, pm.mkConst(coeff.num)));
180
+ poly.set(definitions.get(entry[0]));
181
+ constant.set(pm.mkConst(coeff.num));
182
+ poly.set(pm.mul(poly.get(), constant.get()));
183
+ constant.reset();
184
+ p.set(pm.add(p.get(), poly.get()));
185
+ poly.reset();
179
186
  }
180
187
  const kind = constraint.kind;
181
188
  const literal =
182
189
  kind === KIND_LE
183
- ? solver.mkIneqLiteral("GT", [polynomial], [false]) ^ 1
190
+ ? solver.mkIneqLiteral("GT", [p.get()], [false]) ^ 1
184
191
  : kind === KIND_GE
185
- ? solver.mkIneqLiteral("LT", [polynomial], [false]) ^ 1
192
+ ? solver.mkIneqLiteral("LT", [p.get()], [false]) ^ 1
186
193
  : solver.mkIneqLiteral(
187
194
  kind === KIND_LT ? "LT" : kind === KIND_GT ? "GT" : "EQ",
188
- [polynomial],
195
+ [p.get()],
189
196
  [false],
190
197
  );
191
198
  solver.mkExternalClause([literal], constraintIndex);
199
+ p.reset();
192
200
  return literal;
193
201
  }
194
202
 
@@ -208,13 +216,20 @@ export class NraSolver {
208
216
  if (transcendentals.piVar !== NULL_LPVAR) solver.addPi(this.getNlVar(transcendentals.piVar));
209
217
  }
210
218
 
211
- check(maxConflicts: number, budget: number) {
219
+ check(maxConflicts: number) {
220
+ try {
221
+ return this.checkCore(maxConflicts);
222
+ } catch (error) {
223
+ if (error instanceof SmtCanceledError && this.core.nraLimit.isExhausted()) return L_UNDEF;
224
+ throw error;
225
+ }
226
+ }
227
+
228
+ private checkCore(maxConflicts: number) {
212
229
  const core = this.core;
213
230
  const lra = core.lra;
214
- this.solver = new NlsatSolver(core.limit, budget);
231
+ this.reset();
215
232
  this.solver.maxConflicts = maxConflicts;
216
- this.values = [];
217
- this.lp2nl.clear();
218
233
  const cone = getConeOfInfluence(core);
219
234
  const definitions = this.mkDefinitions((lpVar) => cone.vars.has(lpVar));
220
235
  const skipped = new Set<number>();
@@ -225,15 +240,9 @@ export class NraSolver {
225
240
  }
226
241
  this.addConstraint(constraintIndex, definitions.definitions, definitions.denominators);
227
242
  }
243
+ definitions.definitions.reset();
228
244
  this.registerTranscendentals();
229
- const result = (() => {
230
- try {
231
- return this.solver.check();
232
- } catch (error) {
233
- if (error instanceof NlsatUnsupportedError) return L_UNDEF;
234
- throw error;
235
- }
236
- })();
245
+ const result = this.solver.check();
237
246
  if (result === L_TRUE) {
238
247
  this.solver.restoreOrder();
239
248
  core.setUseNraModel(true);
@@ -321,50 +330,92 @@ export class NraSolver {
321
330
  : sign === 0;
322
331
  }
323
332
 
324
- private getClause() {
333
+ private setupAssignmentSolver() {
325
334
  const core = this.core;
326
335
  const lra = core.lra;
327
- this.solver = new NlsatSolver(core.limit);
328
- this.lp2nl.clear();
336
+ this.reset();
337
+ this.literal2constraint.clear();
338
+ this.vars2mon.clear();
329
339
  const cone = getConeOfInfluence(core);
330
340
  const definitions = this.mkDefinitions(() => true);
331
- const values = lra.columns.map((_column, lpVar) => new Anum(core.val(lpVar)));
332
- this.values = values;
333
- const literalConstraints = new Map<number, number>();
341
+ for (let lpVar = 0; lpVar < lra.columns.length; lpVar++) {
342
+ this.values.push(new Anum(core.val(lpVar)));
343
+ if (core.emons.isMonicVar(lpVar))
344
+ this.vars2mon.set(getSortedVars(core.emons.get(lpVar).vars).join(","), lpVar);
345
+ }
334
346
  for (const constraintIndex of cone.constraints) {
335
347
  const literal = this.addConstraint(
336
348
  constraintIndex,
337
349
  definitions.definitions,
338
350
  definitions.denominators,
339
351
  );
340
- literalConstraints.set(literal, constraintIndex);
352
+ this.literal2constraint.set(literal, constraintIndex);
341
353
  }
354
+ definitions.definitions.reset();
342
355
  this.registerTranscendentals();
343
- const result = this.solver.checkAssignment(values);
344
- if (result.result !== L_FALSE) return null;
345
- return { clause: result.clause, literalConstraints };
346
356
  }
347
357
 
348
- checkAssignment() {
349
- const clause = (() => {
350
- try {
351
- return this.getClause();
352
- } catch (error) {
353
- if (error instanceof NlsatUnsupportedError) return null;
354
- throw error;
358
+ private processPolynomialCheckAssignment(
359
+ polynomial: Polynomial,
360
+ nl2lp: readonly number[],
361
+ term: LarTerm,
362
+ ) {
363
+ let bound = Rational.zero;
364
+ for (let index = 0; index < polynomial.size; index++) {
365
+ const monomial = polynomial.ms[index];
366
+ const coeff = Rational.of(polynomial.as[index]);
367
+ // Like Z3, this drops degrees: only an axiom's ¬best can be nonlinear, and ¬cell is valid alone.
368
+ if (monomial.size === 0) bound = bound.sub(coeff);
369
+ else if (monomial.size === 1) term.addMonomial(coeff, nl2lp[monomial.vars[0]]);
370
+ else {
371
+ const vars = getSortedVars(monomial.vars.map((variable) => nl2lp[variable]));
372
+ term.addMonomial(coeff, this.vars2mon.get(vars.join(",")) ?? this.core.addMulDef(vars));
355
373
  }
356
- })();
357
- if (clause === null) return L_UNDEF;
358
- return this.addLemma(clause.clause, clause.literalConstraints);
374
+ }
375
+ return bound;
376
+ }
377
+
378
+ private reverseLp2nl() {
379
+ const nl2lp: number[] = [];
380
+ for (const entry of this.lp2nl) nl2lp[entry[1]] = entry[0];
381
+ return nl2lp;
382
+ }
383
+
384
+ checkAssignment() {
385
+ try {
386
+ return this.checkAssignmentCore();
387
+ } catch (error) {
388
+ if (error instanceof SmtCanceledError && this.core.nraLimit.isExhausted()) return L_UNDEF;
389
+ throw error;
390
+ }
391
+ }
392
+
393
+ private checkAssignmentCore() {
394
+ const core = this.core;
395
+ const lra = core.lra;
396
+ this.setupAssignmentSolver();
397
+ const result = this.solver.checkAssignment(this.values);
398
+ if (result.result === L_TRUE) {
399
+ core.setUseNraModel(true);
400
+ lra.initModel();
401
+ for (const constraint of lra.constraints.constraints)
402
+ if (constraint.isActive && !this.isConstraintSatisfied(constraint)) return L_UNDEF;
403
+ for (const monic of core.emons.monics)
404
+ if (!this.isMonicSatisfied(monic.variable, monic.vars)) return L_UNDEF;
405
+ core.setUseNraModel(true);
406
+ }
407
+ if (result.result === L_FALSE) return this.addLemma(result.clause);
408
+ return result.result;
359
409
  }
360
410
 
361
- private addLemma(clause: number[], literalConstraints: ReadonlyMap<number, number>) {
411
+ private addLemma(clause: readonly number[]) {
362
412
  const core = this.core;
363
413
  const solver = this.solver;
364
- const pm = solver.pm;
414
+ const nl2lp = this.reverseLp2nl();
415
+ let result = L_FALSE;
365
416
  const lemma = new LemmaBuilder(core);
366
417
  for (const literal of clause) {
367
- const constraintIndex = literalConstraints.get(literal ^ 1);
418
+ const constraintIndex = this.literal2constraint.get(literal ^ 1);
368
419
  if (constraintIndex !== undefined) {
369
420
  const explanation = new Explanation();
370
421
  explanation.push(constraintIndex);
@@ -373,23 +424,12 @@ export class NraSolver {
373
424
  }
374
425
  const atom = solver.getAtom(literal);
375
426
  if (atom === null) throw new SmtInvariantError(`nlsat literal ${literal} has no atom`);
376
- if (
377
- !isIneqAtom(atom) ||
378
- atom.polynomials.length !== 1 ||
379
- pm.totalDegree(atom.polynomials[0]) > 1
380
- ) {
381
- core.lemmas.pop();
382
- return L_UNDEF;
427
+ if (!isIneqAtom(atom) || atom.polynomials.length !== 1) {
428
+ result = L_UNDEF;
429
+ break;
383
430
  }
384
- const polynomial = atom.polynomials[0];
385
431
  const term = new LarTerm();
386
- let bound = Rational.zero;
387
- for (let index = 0; index < polynomial.size; index++) {
388
- const monomial = polynomial.ms[index];
389
- const coeff = Rational.of(polynomial.as[index]);
390
- if (monomial.size === 0) bound = bound.sub(coeff);
391
- else term.addMonomial(coeff, monomial.vars[0]);
392
- }
432
+ const bound = this.processPolynomialCheckAssignment(atom.polynomials[0], nl2lp, term);
393
433
  const isNegated = (literal & 1) === 1;
394
434
  const kind =
395
435
  atom.kind === "EQ"
@@ -405,12 +445,13 @@ export class NraSolver {
405
445
  : KIND_GT;
406
446
  const ineq = mkIneq(term, kind, bound);
407
447
  if (core.ineqHolds(ineq)) {
408
- core.lemmas.pop();
409
- return L_UNDEF;
448
+ result = L_UNDEF;
449
+ break;
410
450
  }
411
451
  lemma.addIneq(ineq);
412
452
  }
413
- core.isCheckFeasible = true;
414
- return L_FALSE;
453
+ if (result === L_FALSE) core.isCheckFeasible = true;
454
+ if (result === L_UNDEF) core.lemmas.pop();
455
+ return result;
415
456
  }
416
457
  }
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/numeric_pair.h), MIT license, see z3-license.txt.
2
1
  import { Rational } from "../rational";
3
2
 
4
3
  export class Impq {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/dd/pdd_interval.h), MIT license, see z3-license.txt.
2
1
  import {
3
2
  add,
4
3
  type DepInterval,
@@ -20,8 +19,12 @@ export const getPddInterval = (
20
19
  return result;
21
20
  }
22
21
  const varInterval = getVarInterval(poly.var(), mode);
23
- const hi = getPddInterval(poly.hi(), mode, getVarInterval);
24
- const lo = getPddInterval(poly.lo(), mode, getVarInterval);
22
+ const hiPoly = poly.hi();
23
+ const hi = getPddInterval(hiPoly, mode, getVarInterval);
24
+ hiPoly.release();
25
+ const loPoly = poly.lo();
26
+ const lo = getPddInterval(loPoly, mode, getVarInterval);
27
+ loPoly.release();
25
28
  const product = mkDepInterval();
26
29
  mul(hi, varInterval, product, mode);
27
30
  add(product, lo, result, mode);
@@ -1,5 +1,5 @@
1
- // Ported from Z3 (src/math/grobner/pdd_simplifier.h, src/math/grobner/pdd_simplifier.cpp), MIT license, see z3-license.txt.
2
1
  import { mkJoin } from "./dependency";
2
+ import type { Pdd } from "./pdd";
3
3
  import { type Equation, type PddSolver, SetUpdate, SOLVED, TO_SIMPLIFY } from "./pdd-solver";
4
4
  import { shrink } from "../array";
5
5
 
@@ -18,9 +18,12 @@ export class PddSimplifier {
18
18
  }
19
19
 
20
20
  private simplifyLinearStep(isBinary: boolean) {
21
- const linear = this.solver.toSimplify.filter((equation) =>
22
- isBinary ? equation.poly.isBinary() : equation.poly.isLinear(),
23
- );
21
+ const linear: Equation[] = [];
22
+ for (const equation of this.solver.toSimplify) {
23
+ const poly = equation.poly.copy();
24
+ if (isBinary ? poly.isBinary() : poly.isLinear()) linear.push(equation);
25
+ poly.release();
26
+ }
24
27
  if (linear.length === 0) return false;
25
28
  return this.simplifyLinear(linear);
26
29
  }
@@ -41,8 +44,10 @@ export class PddSimplifier {
41
44
  for (let index = 0, length = uses.length; index < length; index++) {
42
45
  const target = uses[index];
43
46
  if (source === target || solver.isTrivial(target)) continue;
44
- if (!source.poly.isBinary() && !target.poly.isLinear()) {
47
+ const targetPoly = target.poly.copy();
48
+ if (!source.poly.isBinary() && !targetPoly.isLinear()) {
45
49
  isAllReduced = false;
50
+ targetPoly.release();
46
51
  continue;
47
52
  }
48
53
  this.removeFromUse(target, useList, variable);
@@ -58,6 +63,7 @@ export class PddSimplifier {
58
63
  solver.pushEquation(TO_SIMPLIFY, target);
59
64
  }
60
65
  this.addToUse(target, useList);
66
+ targetPoly.release();
61
67
  }
62
68
  if (isAllReduced) linear[kept++] = source;
63
69
  }
@@ -68,7 +74,7 @@ export class PddSimplifier {
68
74
  solver.pushEquation(SOLVED, source);
69
75
  }
70
76
  }
71
- for (const equation of trivial) solver.popEquation(equation);
77
+ for (const equation of trivial) solver.delEquation(equation);
72
78
  return kept > 0 || hasConflict;
73
79
  }
74
80
 
@@ -79,32 +85,55 @@ export class PddSimplifier {
79
85
  const update = new SetUpdate(solver.toSimplify);
80
86
  for (; update.i < update.size; update.i++) {
81
87
  const first = update.get();
82
- const poly = first.poly;
83
- const second = los.get(poly.lo().root) ?? first;
84
- if (second === first) los.set(poly.lo().root, first);
85
- if (
86
- second !== first &&
87
- (poly.hi().isVal() || second.poly.hi().isVal()) &&
88
- !poly.lo().isVal()
89
- ) {
90
- first.poly = poly.sub(second.poly);
88
+ const poly = first.poly.copy();
89
+ const lo = poly.lo();
90
+ const second = los.get(lo.root) ?? first;
91
+ if (second === first) los.set(lo.root, first);
92
+ lo.release();
93
+ const secondPoly = second.poly.copy();
94
+ if (second !== first && this.isCcReducible(poly, secondPoly)) {
95
+ const difference = poly.sub(second.poly);
96
+ first.poly.assign(difference);
97
+ difference.release();
91
98
  first.dep = mkJoin(first.dep, second.dep);
92
99
  isReduced = true;
93
- if (solver.isTrivial(first) || solver.checkConflict(first)) continue;
100
+ const isTrivial = solver.isTrivial(first);
101
+ if (isTrivial) solver.retire(first);
102
+ if (isTrivial || solver.checkConflict(first)) {
103
+ secondPoly.release();
104
+ poly.release();
105
+ continue;
106
+ }
94
107
  }
95
108
  update.nextj();
109
+ secondPoly.release();
110
+ poly.release();
96
111
  }
97
112
  update.finish();
98
113
  return isReduced;
99
114
  }
100
115
 
116
+ private isCcReducible(poly: Pdd, secondPoly: Pdd) {
117
+ const hi = poly.hi();
118
+ const secondHi = hi.isVal() ? null : secondPoly.hi();
119
+ const lo = secondHi === null || secondHi.isVal() ? poly.lo() : null;
120
+ const isReducible = lo !== null && !lo.isVal();
121
+ lo?.release();
122
+ secondHi?.release();
123
+ hi.release();
124
+ return isReducible;
125
+ }
126
+
101
127
  private simplifyLeafStep() {
102
128
  const solver = this.solver;
103
129
  const useList = this.getUseList();
104
130
  for (let index = 0; index < solver.toSimplify.length; index++) {
105
131
  const source = solver.toSimplify[index];
106
- const poly = source.poly;
107
- if (poly.isVal() || !poly.hi().isVal()) continue;
132
+ const poly = source.poly.copy();
133
+ if (poly.isVal() || !this.isHiVal(poly)) {
134
+ poly.release();
135
+ continue;
136
+ }
108
137
  const leaves = useList[poly.var()].filter(
109
138
  (target) => target !== source && target.poly.varIsLeaf(poly.var()),
110
139
  );
@@ -113,16 +142,18 @@ export class PddSimplifier {
113
142
  const isLeadingTermChanged = solver.simplifyUsing(target, source);
114
143
  this.addToUse(target, useList);
115
144
  if (solver.isTrivial(target)) {
116
- solver.popEquation(target);
145
+ solver.delEquation(target);
117
146
  } else if (target.poly.isVal()) {
118
147
  solver.popEquation(target);
119
148
  solver.setConflict(target);
149
+ poly.release();
120
150
  return true;
121
151
  } else if (isLeadingTermChanged) {
122
152
  solver.popEquation(target);
123
153
  solver.pushEquation(TO_SIMPLIFY, target);
124
154
  }
125
155
  }
156
+ poly.release();
126
157
  }
127
158
  return false;
128
159
  }
@@ -134,18 +165,26 @@ export class PddSimplifier {
134
165
  let hasSolved = false;
135
166
  for (; update.i < update.size; update.i++) {
136
167
  const equation = update.get();
137
- const poly = equation.poly;
138
- if (!poly.isVal() && poly.hi().isVal() && useList[poly.var()].length === 1) {
168
+ const poly = equation.poly.copy();
169
+ if (!poly.isVal() && this.isHiVal(poly) && useList[poly.var()].length === 1) {
139
170
  solver.pushEquation(SOLVED, equation);
140
171
  hasSolved = true;
141
172
  } else {
142
173
  update.nextj();
143
174
  }
175
+ poly.release();
144
176
  }
145
177
  update.finish();
146
178
  return hasSolved;
147
179
  }
148
180
 
181
+ private isHiVal(poly: Pdd) {
182
+ const hi = poly.hi();
183
+ const isVal = hi.isVal();
184
+ hi.release();
185
+ return isVal;
186
+ }
187
+
149
188
  private addToUse(equation: Equation, useList: Equation[][]) {
150
189
  for (const variable of equation.poly.freeVars()) {
151
190
  while (useList.length <= variable) useList.push([]);