tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0

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 (631) hide show
  1. package/README.md +8 -0
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +121 -12
  8. package/dist/index.d.ts +121 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1155 -900
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +318 -656
  41. package/src/cli/typescript.ts +0 -3
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +260 -371
  51. package/src/errors.ts +93 -58
  52. package/src/evaluate.ts +848 -374
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +97 -43
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -325
  64. package/src/liveness.ts +224 -131
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +34 -57
  88. package/src/parallel.ts +62 -72
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +129 -38
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +296 -105
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +10 -25
  612. package/src/typescript/collections.ts +34 -35
  613. package/src/typescript/compile.ts +1 -8
  614. package/src/typescript/context.ts +0 -12
  615. package/src/typescript/emit.ts +0 -1
  616. package/src/typescript/expressions.ts +0 -12
  617. package/src/typescript/formula.ts +9 -15
  618. package/src/typescript/functions.ts +6 -17
  619. package/src/typescript/model.ts +14 -16
  620. package/src/typescript/names.ts +0 -2
  621. package/src/typescript/program.ts +0 -3
  622. package/src/typescript/properties.ts +6 -8
  623. package/src/typescript/scope.ts +0 -5
  624. package/src/typescript/steps.ts +20 -28
  625. package/src/typescript/types.ts +3 -10
  626. package/src/values.ts +917 -522
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -1,8 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_grobner.h, src/math/lp/nla_grobner.cpp), MIT license, see
2
- // z3-license.txt. nla's Grobner pass: the rows around the monomials to refine become polynomial
3
- // equations, which dd::solver saturates, and the equations then yield lemmas: interval conflicts,
4
- // quotient and residue bounds, failed gcd tests, fixed variables, factorizations, and new linear
5
- // rows. Z3's nlsat conflict check (is_nla_conflict) is not ported, nor are the statistics.
6
1
  import { PddMemoryOutError } from "../../../../errors";
7
2
  import { getEuclideanMod, getGcd, getLcm, Rational } from "../rational";
8
3
  import { KIND_EQ, KIND_GE, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
@@ -40,7 +35,6 @@ const ADAPTIVE_MAX = 4 * 16;
40
35
  const ADAPTIVE_BUMP_AFTER = 2;
41
36
  const DELAY_CAP = 1000000;
42
37
 
43
- // A dependency that pdd_expr and val_of_fixed_var_with_deps extend, where Z3 passes a reference.
44
38
  interface DepRef {
45
39
  dep: Dependency;
46
40
  }
@@ -63,11 +57,9 @@ const getRationalLcm = (first: Rational, second: Rational) =>
63
57
 
64
58
  const getDenominator = (value: Rational) => Rational.of(value.den);
65
59
 
66
- // divides: whether the integer a divides the integer b, where 0 divides only 0.
67
60
  const divides = (divisor: Rational, value: Rational) =>
68
61
  divisor.isZero() ? value.isZero() : value.num % divisor.num === 0n;
69
62
 
70
- // ps_root: the root a of a^2 * M^2, a perfect square with every variable of even multiplicity.
71
63
  const getPerfectSquareRoot = (coeff: Rational, vars: number[]) => {
72
64
  if (vars.length % 2 === 1) return undefined;
73
65
  const root = coeff.root(2);
@@ -80,8 +72,6 @@ const getPerfectSquareRoot = (coeff: Rational, vars: number[]) => {
80
72
  return root;
81
73
  };
82
74
 
83
- // ps_cross: whether (c12, v12) is the cross term -2ab*M1*M2 of the perfect squares a^2*M1^2 and
84
- // b^2*M2^2.
85
75
  const isPerfectSquareCross = (
86
76
  first: Rational,
87
77
  firstVars: number[],
@@ -105,19 +95,18 @@ const isPerfectSquareCross = (
105
95
  };
106
96
 
107
97
  export class Grobner {
108
- private readonly propagatesQuotients = NLA_PARAMS.grobnerPropagateQuotients;
109
- private readonly hasGcdTest = NLA_PARAMS.grobnerGcdTest;
110
- private readonly expandsTerms = NLA_PARAMS.grobnerExpandTerms;
98
+ private propagatesQuotients = false;
99
+ private hasGcdTest = false;
100
+ private expandsTerms = false;
111
101
  private readonly manager: PddManager;
112
102
  private readonly solver: PddSolver;
113
103
  private readonly nexCreator = new NexCreator();
114
104
  private readonly rows = new IndexedUintSet();
115
- private quota: number = NLA_PARAMS.grQ;
105
+ private quota = NLA_PARAMS.grQ;
116
106
  private delayBase = 0;
117
107
  private delay = 0;
118
108
  private growthBoost = ADAPTIVE_UNIT;
119
109
  private hitStreak = 0;
120
- private readonly isAddingAllEqs = false;
121
110
  private mon2var = new Map<string, number>();
122
111
 
123
112
  constructor(private core: NlaCore) {
@@ -125,7 +114,12 @@ export class Grobner {
125
114
  this.solver = new PddSolver(this.manager, () => core.isCanceled());
126
115
  }
127
116
 
128
- // operator(): runs the pass, unless the quota of misses delays it.
117
+ updateParams() {
118
+ this.propagatesQuotients = NLA_PARAMS.grobnerPropagateQuotients;
119
+ this.hasGcdTest = NLA_PARAMS.grobnerGcdTest;
120
+ this.expandsTerms = NLA_PARAMS.grobnerExpandTerms;
121
+ }
122
+
129
123
  run() {
130
124
  if (this.core.lra.getColumnCount() > 5000) return;
131
125
  if (this.quota === 0) this.quota = NLA_PARAMS.grQ;
@@ -166,7 +160,6 @@ export class Grobner {
166
160
  if (this.quota > 0) this.quota--;
167
161
  }
168
162
 
169
- // Z3 catches every exception here, of which a failed pdd allocation is the one that can occur.
170
163
  private catchMemoryOut(propagate: () => boolean) {
171
164
  try {
172
165
  return propagate();
@@ -176,8 +169,6 @@ export class Grobner {
176
169
  }
177
170
  }
178
171
 
179
- // update_growth_boost: two productive runs in a row raise the boost by half, up to the cap, and a
180
- // miss takes back a quarter of the excess over the unit.
181
172
  private updateGrowthBoost(isProductive: boolean) {
182
173
  if (isProductive) {
183
174
  if (++this.hitStreak < ADAPTIVE_BUMP_AFTER) return;
@@ -222,7 +213,6 @@ export class Grobner {
222
213
  return this.countPropagations((equation) => this.propagateQuotientsOf(equation));
223
214
  }
224
215
 
225
- // propagate_fixed: k*x = 0 gives x = 0, and x + b = 0 gives x = -b.
226
216
  private propagateFixed(equation: Equation) {
227
217
  const poly = equation.poly;
228
218
  if (poly.isUnary()) {
@@ -233,8 +223,12 @@ export class Grobner {
233
223
  if (!poly.isOffset()) return false;
234
224
  const variable = poly.var();
235
225
  if (this.core.varIsFixed(variable)) return false;
236
- const coeff = poly.hi().val();
237
- const offset = poly.lo().val().neg();
226
+ const hi = poly.hi();
227
+ const coeff = hi.val();
228
+ hi.release();
229
+ const lo = poly.lo();
230
+ const offset = lo.val().neg();
231
+ lo.release();
238
232
  const lcm = getRationalLcm(getDenominator(coeff), getDenominator(offset));
239
233
  const ineq = mkIneq(new LarTerm([[variable, coeff.mul(lcm)]]), KIND_EQ, offset.mul(lcm));
240
234
  return this.addLemmaUnlessHolds(equation, ineq);
@@ -246,36 +240,51 @@ export class Grobner {
246
240
  return true;
247
241
  }
248
242
 
249
- // propagate_factorization: x*q = 0 gives x = 0 or q = 0, for a linear q.
250
243
  private propagateFactorizationOf(equation: Equation) {
251
244
  const factors = equation.poly.varFactors();
252
- if (factors.vars.length === 0 || !factors.poly.isLinear()) return false;
245
+ if (factors.vars.length === 0 || !factors.poly.isLinear()) {
246
+ factors.poly.release();
247
+ return false;
248
+ }
253
249
  const linear = this.linearToTerm(factors.poly);
254
250
  const ineqs = factors.vars.map((variable) => mkIneq(variable, KIND_EQ, 0));
255
251
  ineqs.push(mkIneq(linear.term, KIND_EQ, linear.offset.neg()));
256
- if (ineqs.some((ineq) => this.core.ineqHolds(ineq))) return false;
252
+ if (ineqs.some((ineq) => this.core.ineqHolds(ineq))) {
253
+ factors.poly.release();
254
+ return false;
255
+ }
257
256
  const lemma = this.addDependencies(new LemmaBuilder(this.core), equation);
258
257
  for (const ineq of ineqs) lemma.addIneq(ineq);
258
+ factors.poly.release();
259
259
  return true;
260
260
  }
261
261
 
262
- // linear_to_term: the linear polynomial times the lcm of its denominators, as a term and an
263
- // offset.
264
262
  private linearToTerm(poly: Pdd): LinearTerm {
263
+ const termPoly = poly.copy();
265
264
  let lcm = Rational.one;
266
- let current = poly;
267
- while (!current.isVal()) {
268
- lcm = getRationalLcm(lcm, getDenominator(current.hi().val()));
269
- current = current.lo();
270
- }
271
- lcm = getRationalLcm(getDenominator(current.val()), lcm);
265
+ const lcmPoly = termPoly.copy();
266
+ while (!lcmPoly.isVal()) {
267
+ const hi = lcmPoly.hi();
268
+ lcm = getRationalLcm(lcm, getDenominator(hi.val()));
269
+ hi.release();
270
+ const lo = lcmPoly.lo();
271
+ lcmPoly.assign(lo);
272
+ lo.release();
273
+ }
274
+ lcm = getRationalLcm(getDenominator(lcmPoly.val()), lcm);
272
275
  const term = new LarTerm();
273
- current = poly;
274
- while (!current.isVal()) {
275
- term.addMonomial(lcm.mul(current.hi().val()), current.var());
276
- current = current.lo();
276
+ while (!termPoly.isVal()) {
277
+ const hi = termPoly.hi();
278
+ term.addMonomial(lcm.mul(hi.val()), termPoly.var());
279
+ hi.release();
280
+ const lo = termPoly.lo();
281
+ termPoly.assign(lo);
282
+ lo.release();
277
283
  }
278
- return { term, offset: lcm.mul(current.val()) };
284
+ const offset = lcm.mul(termPoly.val());
285
+ lcmPoly.release();
286
+ termPoly.release();
287
+ return { term, offset };
279
288
  }
280
289
 
281
290
  private getValue(poly: Pdd) {
@@ -289,49 +298,64 @@ export class Grobner {
289
298
  );
290
299
  }
291
300
 
292
- // propagate_gcd_test: x^k - y = 0 limits y modulo k^2. For each residue r of x modulo k, the
293
- // gcd of the coefficients of p with k*x + r for x must divide its constant term.
294
301
  private propagateGcdTestOf(equation: Equation) {
295
- let poly = equation.poly;
296
- if (poly.isLinear() || poly.isVal() || !this.isIntPoly(poly)) return false;
297
- if (this.getValue(poly).isZero()) return false;
298
- const powers = poly.getPowers();
299
- if (powers.length === 0) return false;
300
- let lcm = Rational.one;
301
- for (const value of poly.coefficients()) lcm = getRationalLcm(lcm, getDenominator(value.coeff));
302
- if (!lcm.equals(Rational.one)) poly = poly.mul(lcm);
303
- const manager = this.manager;
304
- const failsGcdTest = (substituted: Pdd) => {
305
- let gcd = Rational.zero;
306
- let constant = Rational.zero;
307
- for (const value of substituted.coefficients()) {
308
- if (value.isConstant) {
309
- constant = constant.add(value.coeff);
310
- continue;
311
- }
312
- gcd = getRationalGcd(gcd, value.coeff);
313
- if (gcd.equals(Rational.one)) return false;
314
- }
315
- return !constant.isZero() && !divides(gcd, constant);
316
- };
317
- for (const entry of powers) {
318
- if (entry.degree > 4) continue;
319
- const scaled = manager.mkVar(entry.var).mul(manager.mkVal(Rational.fromNumber(entry.degree)));
320
- let isGcdFailing = true;
321
- for (let residue = 0; isGcdFailing && residue < entry.degree; residue++) {
322
- const replacement = scaled.add(manager.mkVal(Rational.fromNumber(residue)));
323
- if (!failsGcdTest(poly.substPdd(entry.var, replacement))) isGcdFailing = false;
302
+ const poly = equation.poly.copy();
303
+ try {
304
+ if (poly.isLinear() || poly.isVal() || !this.isIntPoly(poly)) return false;
305
+ if (this.getValue(poly).isZero()) return false;
306
+ const powers = poly.getPowers();
307
+ if (powers.length === 0) return false;
308
+ let lcm = Rational.one;
309
+ for (const value of poly.coefficients()) {
310
+ lcm = getRationalLcm(lcm, getDenominator(value.coeff));
324
311
  }
325
- if (isGcdFailing) {
326
- this.addDependencies(new LemmaBuilder(this.core), equation);
327
- return true;
312
+ if (!lcm.equals(Rational.one)) poly.mulAssign(lcm);
313
+ const manager = this.manager;
314
+ const failsGcdTest = (substituted: Pdd) => {
315
+ let gcd = Rational.zero;
316
+ let constant = Rational.zero;
317
+ for (const value of substituted.coefficients()) {
318
+ if (value.isConstant) {
319
+ constant = constant.add(value.coeff);
320
+ continue;
321
+ }
322
+ gcd = getRationalGcd(gcd, value.coeff);
323
+ if (gcd.equals(Rational.one)) return false;
324
+ }
325
+ return !constant.isZero() && !divides(gcd, constant);
326
+ };
327
+ for (const entry of powers) {
328
+ if (entry.degree > 4) continue;
329
+ const variable = manager.mkVar(entry.var);
330
+ const degree = manager.mkVal(Rational.fromNumber(entry.degree));
331
+ const scaled = variable.mul(degree);
332
+ degree.release();
333
+ variable.release();
334
+ try {
335
+ let isGcdFailing = true;
336
+ for (let residue = 0; isGcdFailing && residue < entry.degree; residue++) {
337
+ const residuePdd = manager.mkVal(Rational.fromNumber(residue));
338
+ const replacement = scaled.add(residuePdd);
339
+ residuePdd.release();
340
+ const substituted = poly.substPdd(entry.var, replacement);
341
+ if (!failsGcdTest(substituted)) isGcdFailing = false;
342
+ substituted.release();
343
+ replacement.release();
344
+ }
345
+ if (isGcdFailing) {
346
+ this.addDependencies(new LemmaBuilder(this.core), equation);
347
+ return true;
348
+ }
349
+ } finally {
350
+ scaled.release();
351
+ }
328
352
  }
353
+ return false;
354
+ } finally {
355
+ poly.release();
329
356
  }
330
- return false;
331
357
  }
332
358
 
333
- // propagate_quotients: for x*y + z = 0 over the integers, the residue of a linear variable and
334
- // bounds that relate a factor to the rest.
335
359
  private propagateQuotientsOf(equation: Equation) {
336
360
  const poly = equation.poly;
337
361
  if (poly.isLinear() || poly.isVal() || !this.isIntPoly(poly)) return false;
@@ -346,17 +370,22 @@ export class Grobner {
346
370
  if (this.propagateModResidue(equation)) return true;
347
371
  let isLemmaFound = false;
348
372
  for (const variable of nlVars) {
349
- const factor = poly.factor(variable, 1);
350
- if (!factor.rest.isLinear()) continue;
351
- const lc = lcm.equals(Rational.one) ? factor.lc : factor.lc.mul(lcm);
352
- const rest = lcm.equals(Rational.one) ? factor.rest : factor.rest.mul(lcm);
353
- if (this.addQuotientLemma(equation, variable, lc, rest)) isLemmaFound = true;
373
+ const lc = this.manager.zero();
374
+ const rest = this.manager.zero();
375
+ poly.factor(variable, 1, lc, rest);
376
+ if (rest.isLinear()) {
377
+ if (!lcm.equals(Rational.one)) {
378
+ lc.mulAssign(lcm);
379
+ rest.mulAssign(lcm);
380
+ }
381
+ if (this.addQuotientLemma(equation, variable, lc, rest)) isLemmaFound = true;
382
+ }
383
+ rest.release();
384
+ lc.release();
354
385
  }
355
386
  return isLemmaFound;
356
387
  }
357
388
 
358
- // mod_residue: when every monomial but c_v*v is a multiple of M*c_v and the constant term is
359
- // K*c_v, then v = -K modulo M, so 0 <= v < M forces v to the residue.
360
389
  private propagateModResidue(equation: Equation) {
361
390
  const poly = equation.poly;
362
391
  for (const linear of poly) {
@@ -399,14 +428,12 @@ export class Grobner {
399
428
  return false;
400
429
  }
401
430
 
402
- // The lemmas of p = v*lc + r for a linear r, by the values of v, lc and r.
403
431
  private addQuotientLemma(equation: Equation, variable: number, lc: Pdd, rest: Pdd) {
404
432
  const variableValue = this.core.val(variable);
405
433
  const restValue = this.getValue(rest);
406
434
  const lcValue = this.getValue(lc);
407
435
  if (restValue.isZero()) {
408
436
  if (variableValue.isZero() || lcValue.isZero() || !lc.isLinear()) return false;
409
- // v = 0 or lc = 0 or r != 0
410
437
  const lcTerm = this.linearToTerm(lc);
411
438
  const restTerm = this.linearToTerm(rest);
412
439
  this.addDependencies(new LemmaBuilder(this.core), equation)
@@ -416,7 +443,6 @@ export class Grobner {
416
443
  return true;
417
444
  }
418
445
  if (variableValue.isZero()) {
419
- // v = 0 => r = 0
420
446
  const lemma = this.addDependencies(new LemmaBuilder(this.core), equation);
421
447
  const restTerm = this.linearToTerm(rest);
422
448
  lemma
@@ -426,7 +452,6 @@ export class Grobner {
426
452
  }
427
453
  if (lcValue.isZero()) {
428
454
  if (!lc.isLinear()) return false;
429
- // lc = 0 => r = 0
430
455
  const lemma = this.addDependencies(new LemmaBuilder(this.core), equation);
431
456
  const lcTerm = this.linearToTerm(lc);
432
457
  const restTerm = this.linearToTerm(rest);
@@ -439,7 +464,6 @@ export class Grobner {
439
464
  const isVariablePositive = variableValue.isPositive();
440
465
  const isRestPositive = restValue.isPositive();
441
466
  if (variableValue.abs().compare(restValue.abs()) > 0) {
442
- // v*c + t = 0 with |v| > |t| != 0: v changes sign, t changes sign, or |v| <= |t|
443
467
  const lemma = new LemmaBuilder(this.core);
444
468
  const restTerm = this.linearToTerm(rest);
445
469
  this.addDependencies(lemma, equation);
@@ -460,7 +484,6 @@ export class Grobner {
460
484
  variableValue.abs().compare(one) > 0 &&
461
485
  variableValue.abs().compare(restValue.abs()) >= 0
462
486
  ) {
463
- // v*c + t = 0 & |c| > 1, |v| > 1 => |v| < |t|
464
487
  const lemma = new LemmaBuilder(this.core);
465
488
  const restTerm = this.linearToTerm(rest);
466
489
  const lcTerm = this.linearToTerm(lc);
@@ -497,7 +520,7 @@ export class Grobner {
497
520
 
498
521
  private configure() {
499
522
  this.solver.reset();
500
- try {
523
+ const isLoaded = this.catchMemoryOut(() => {
501
524
  this.setLevel2var();
502
525
  for (const lpVar of this.core.activeVarSet.elems) {
503
526
  if (this.core.lra.isBase(lpVar)) {
@@ -505,10 +528,9 @@ export class Grobner {
505
528
  }
506
529
  if (this.core.isMonicVar(lpVar) && this.core.varIsFixed(lpVar)) this.addFixedMonic(lpVar);
507
530
  }
508
- } catch (error) {
509
- if (!(error instanceof PddMemoryOutError)) throw error;
510
- return false;
511
- }
531
+ return true;
532
+ });
533
+ if (!isLoaded) return false;
512
534
  const config = getDefaultPddSolverConfig();
513
535
  config.maxSteps = this.solver.equations().length;
514
536
  config.maxSimplified = NLA_PARAMS.grobnerMaxSimplified;
@@ -530,7 +552,6 @@ export class Grobner {
530
552
  return true;
531
553
  }
532
554
 
533
- // equation_is_true: the equation holds at the values, or a free column can make it hold.
534
555
  private isEquationTrue(equation: Equation) {
535
556
  if (equation.poly.freeVars().some((variable) => this.core.lra.isFree(variable))) return true;
536
557
  return this.getValue(equation.poly).isZero();
@@ -542,8 +563,6 @@ export class Grobner {
542
563
  return interval;
543
564
  };
544
565
 
545
- // is_conflicting: the interval of the polynomial excludes 0, or a cross-nested form or a
546
- // perfect square shows that it does.
547
566
  private isEquationConflicting(equation: Equation) {
548
567
  if (this.isEquationTrue(equation)) return false;
549
568
  const interval = getPddInterval(equation.poly, "without-deps", this.getVarInterval);
@@ -563,7 +582,6 @@ export class Grobner {
563
582
  new LemmaBuilder(this.core).addExplanation(explanation);
564
583
  }
565
584
 
566
- // monomial_interval: coeff times the product of the variables' intervals.
567
585
  private getMonomialInterval(coeff: Rational, vars: number[], mode: DepsMode) {
568
586
  const result = mkDepInterval();
569
587
  setValue(result, coeff);
@@ -580,8 +598,6 @@ export class Grobner {
580
598
  return result;
581
599
  }
582
600
 
583
- // add_perfect_square_conflict: a triple of monomials a^2*M1^2, b^2*M2^2 and -2ab*M1*M2 is
584
- // (a*M1 - b*M2)^2, at least 0, which replaces their interval when its lower bound is negative.
585
601
  private addPerfectSquareConflict(equation: Equation) {
586
602
  const monomials: SortedMonomial[] = [...equation.poly].map((monomial) => ({
587
603
  coeff: monomial.coeff,
@@ -632,7 +648,6 @@ export class Grobner {
632
648
  }
633
649
  }
634
650
  if (!isFound) return false;
635
- // [0, oo) for the perfect squares is an unconditional bound, without a dependency.
636
651
  const sum = mkDepInterval();
637
652
  sum.isLowerInf = false;
638
653
  sum.lower = Rational.zero;
@@ -658,7 +673,6 @@ export class Grobner {
658
673
  return this.getMonomialInterval(monomial.coeff, monomial.vars, "without-deps");
659
674
  }
660
675
 
661
- // add_horner_conflict: the cross-nested forms of the polynomial, whose intervals may exclude 0.
662
676
  private addHornerConflict(equation: Equation) {
663
677
  const nexCreator = this.nexCreator;
664
678
  const freeVars = equation.poly.freeVars();
@@ -688,8 +702,6 @@ export class Grobner {
688
702
  return crossNested.done();
689
703
  }
690
704
 
691
- // propagate_linear_equations: an equation whose monomials all have columns and that the values
692
- // violate becomes a new row fixed to its constant.
693
705
  private propagateLinearEquations() {
694
706
  this.mon2var.clear();
695
707
  for (const monic of this.core.emons.monics)
@@ -701,8 +713,7 @@ export class Grobner {
701
713
  return changed > 0;
702
714
  }
703
715
 
704
- // The monomial's column: Z3 looks up the variables in the pdd's order in the sorted variables of
705
- // the monics.
716
+ // Like Z3, the variables are looked up in the pdd's order among the monics' sorted variables.
706
717
  private getMonomialColumn(vars: number[]) {
707
718
  return this.mon2var.get(vars.join(","));
708
719
  }
@@ -739,7 +750,6 @@ export class Grobner {
739
750
  return true;
740
751
  }
741
752
 
742
- // find_nl_cluster: the variables and rows reachable from the monomials to refine.
743
753
  private findNlCluster() {
744
754
  this.rows.clear();
745
755
  this.core.activeVarSet.clear();
@@ -749,7 +759,6 @@ export class Grobner {
749
759
  }
750
760
  }
751
761
 
752
- // add_var_and_its_factors_to_q_and_collect_new_rows.
753
762
  private addVarAndItsFactorsToQueue(lpVar: number, queue: number[]) {
754
763
  const core = this.core;
755
764
  const lra = core.lra;
@@ -769,17 +778,12 @@ export class Grobner {
769
778
  if (this.rows.has(row)) continue;
770
779
  this.rows.add(row);
771
780
  const basic = lra.core.basis[row];
772
- // A free column over the reals can be assigned.
773
781
  if (lra.isFree(basic) && basic !== lpVar) {
774
782
  if (!lra.isInt(basic)) continue;
775
- // Free integer columns count only for the gcd test, the quotients, or all equations.
776
- if (!this.isAddingAllEqs && !this.hasGcdTest && !this.propagatesQuotients) continue;
777
- // A free integer column with integer coefficients can be assigned.
778
- if (!this.isAddingAllEqs && lra.getRow(row).every((rowCell) => rowCell.coeff.isInt()))
779
- continue;
783
+ if (!this.hasGcdTest && !this.propagatesQuotients) continue;
784
+ if (lra.getRow(row).every((rowCell) => rowCell.coeff.isInt())) continue;
780
785
  }
781
- if (!this.isAddingAllEqs && lra.getRow(row).length > NLA_PARAMS.hornerRowLengthLimit)
782
- continue;
786
+ if (lra.getRow(row).length > NLA_PARAMS.hornerRowLengthLimit) continue;
783
787
  for (const rowCell of lra.getRow(row)) this.addVarAndItsFactorsToQueue(rowCell.column, queue);
784
788
  }
785
789
  }
@@ -791,30 +795,38 @@ export class Grobner {
791
795
  }
792
796
 
793
797
  private getTermPdd(term: LarTerm, ref: DepRef) {
794
- let result = this.manager.mkVal(Rational.zero);
795
- for (const entry of term.coeffs) result = result.add(this.getPdd(entry[1], entry[0], ref));
798
+ const result = this.manager.mkVal(Rational.zero);
799
+ for (const entry of term.coeffs) {
800
+ const expr = this.getPddExpr(entry[1], entry[0], ref);
801
+ result.addAssign(expr);
802
+ expr.release();
803
+ }
796
804
  return result;
797
805
  }
798
806
 
799
- // pdd_expr: coeff times the column, with fixed columns as values, terms expanded, and monics as
800
- // the products of their variables.
801
- private getPdd(coeff: Rational, lpVar: number, ref: DepRef) {
807
+ private getPddExpr(coeff: Rational, lpVar: number, ref: DepRef) {
802
808
  const core = this.core;
803
- let result = this.manager.mkVal(coeff);
809
+ const result = this.manager.mkVal(coeff);
804
810
  const vars = [lpVar];
805
811
  const zeroRef = { dep: ref.dep };
806
812
  for (let current = vars.pop(); current !== undefined; current = vars.pop()) {
807
813
  if (NLA_PARAMS.grobnerSubsFixed > 0 && core.varIsFixedToZero(current)) {
808
- result = this.manager.mkVal(this.getValOfFixedVarWithDeps(current, zeroRef));
814
+ const fixed = this.manager.mkVal(this.getValOfFixedVarWithDeps(current, zeroRef));
815
+ result.assign(fixed);
816
+ fixed.release();
809
817
  ref.dep = zeroRef.dep;
810
818
  return result;
811
819
  }
812
820
  if (NLA_PARAMS.grobnerSubsFixed === 1 && core.varIsFixed(current)) {
813
- result = result.mul(this.getValOfFixedVarWithDeps(current, ref));
821
+ result.mulAssign(this.getValOfFixedVarWithDeps(current, ref));
814
822
  } else if (this.expandsTerms && core.lra.hasTerm(current)) {
815
- result = result.mul(this.getTermPdd(core.lra.getTerm(current), ref));
823
+ const termPdd = this.getTermPdd(core.lra.getTerm(current), ref);
824
+ result.mulAssign(termPdd);
825
+ termPdd.release();
816
826
  } else if (!core.isMonicVar(current)) {
817
- result = result.mul(this.manager.mkVar(current));
827
+ const variable = this.manager.mkVar(current);
828
+ result.mulAssign(variable);
829
+ variable.release();
818
830
  } else {
819
831
  vars.push(...core.emons.get(current).vars);
820
832
  }
@@ -822,19 +834,20 @@ export class Grobner {
822
834
  return result;
823
835
  }
824
836
 
825
- // is_solved: p = 0 as v = r, for a linear p where v is the only variable bounded on one side
826
- // while several are bounded on the other, so that r has no bound on that side.
827
- private getSolvedForm(poly: Pdd) {
837
+ private getSolvedForm(poly: Pdd, solution: Pdd) {
828
838
  if (!poly.isLinear()) return null;
839
+ solution.assign(poly);
829
840
  let numLo = 0;
830
841
  let numHi = 0;
831
842
  let lo = 0;
832
843
  let hi = 0;
833
844
  let loCoeff = Rational.zero;
834
845
  let hiCoeff = Rational.zero;
835
- for (let current = poly; !current.isVal(); current = current.lo()) {
836
- const variable = current.var();
837
- const value = current.hi().val();
846
+ while (!solution.isVal()) {
847
+ const variable = solution.var();
848
+ const hiPoly = solution.hi();
849
+ const value = hiPoly.val();
850
+ hiPoly.release();
838
851
  const type = this.core.lra.core.getColumnType(variable);
839
852
  if (type === COLUMN_LOWER || type === COLUMN_UPPER) {
840
853
  if (value.isPositive() === (type === COLUMN_LOWER)) {
@@ -850,53 +863,68 @@ export class Grobner {
850
863
  return null;
851
864
  }
852
865
  if (numLo > 1 && numHi > 1) return null;
866
+ const loPoly = solution.lo();
867
+ solution.assign(loPoly);
868
+ loPoly.release();
853
869
  }
854
870
  const isLo = numLo === 1 && numHi > 1;
855
871
  if (!isLo && !(numHi === 1 && numLo > 1)) return null;
856
872
  const variable = isLo ? lo : hi;
857
873
  const coeff = isLo ? loCoeff : hiCoeff;
858
- const solution = this.manager.mkVar(variable).mul(coeff).sub(poly);
859
- return {
860
- variable,
861
- poly: coeff.equals(Rational.one) ? solution : solution.mul(Rational.one.div(coeff)),
862
- };
874
+ const variablePdd = this.manager.mkVar(variable);
875
+ const scaled = variablePdd.mul(coeff);
876
+ const difference = scaled.sub(poly);
877
+ solution.assign(difference);
878
+ difference.release();
879
+ scaled.release();
880
+ variablePdd.release();
881
+ if (!coeff.equals(Rational.one)) solution.mulAssign(Rational.one.div(coeff));
882
+ return variable;
863
883
  }
864
884
 
865
- // add_eq: adds the equation in solved form when it has one.
866
885
  private addEq(poly: Pdd, dep: Dependency) {
867
- const simplified = this.solver.simplify(poly, dep);
868
- const solved = this.getSolvedForm(simplified.poly);
869
- if (solved === null) this.solver.add(simplified.poly, simplified.dep);
870
- else this.solver.addSubst(solved.variable, solved.poly, simplified.dep);
886
+ const solution = this.manager.zero();
887
+ const simplifiedDep = this.solver.simplify(poly, dep);
888
+ const variable = this.getSolvedForm(poly, solution);
889
+ if (variable === null) this.solver.add(poly, simplifiedDep);
890
+ else this.solver.addSubst(variable, solution, simplifiedDep);
891
+ solution.release();
871
892
  }
872
893
 
873
894
  private addFixedMonic(lpVar: number) {
874
895
  const ref: DepRef = { dep: null };
875
- let product = this.manager.mkVal(Rational.one);
896
+ const product = this.manager.mkVal(Rational.one);
876
897
  for (const factor of this.core.emons.get(lpVar).vars) {
877
- product = product.mul(this.getPdd(Rational.one, factor, ref));
898
+ const expr = this.getPddExpr(Rational.one, factor, ref);
899
+ product.mulAssign(expr);
900
+ expr.release();
878
901
  }
879
- product = product.sub(this.getValOfFixedVarWithDeps(lpVar, ref));
902
+ product.subAssign(this.getValOfFixedVarWithDeps(lpVar, ref));
880
903
  this.addEq(product, ref.dep);
904
+ product.release();
881
905
  }
882
906
 
883
907
  private addRow(row: RowCell[]) {
884
908
  const ref: DepRef = { dep: null };
885
- let sum = this.manager.mkVal(Rational.zero);
886
- for (const cell of row) sum = sum.add(this.getPdd(cell.coeff, cell.column, ref));
909
+ const sum = this.manager.mkVal(Rational.zero);
910
+ for (const cell of row) {
911
+ const expr = this.getPddExpr(cell.coeff, cell.column, ref);
912
+ sum.addAssign(expr);
913
+ expr.release();
914
+ }
887
915
  this.addEq(sum, ref.dep);
916
+ sum.release();
888
917
  }
889
918
 
890
- // set_level2var: the columns by weight, then index, from the lowest level.
891
919
  private setLevel2var() {
892
920
  const core = this.core;
893
921
  const count = core.lra.getColumnCount();
894
- const weights = Array.from({ length: count }, (_, lpVar) => core.getVarWeight(lpVar));
922
+ const weights = Array.from({ length: count }, (_value, lpVar) => core.getVarWeight(lpVar));
895
923
  for (let lpVar = 0; lpVar < count; lpVar++) {
896
924
  if (!core.isMonicVar(lpVar) || !core.toRefine.has(lpVar)) continue;
897
925
  for (const factor of core.emons.get(lpVar).vars) weights[factor] += 6;
898
926
  }
899
- const level2var = Array.from({ length: count }, (_, lpVar) => lpVar).sort(
927
+ const level2var = Array.from({ length: count }, (_value, lpVar) => lpVar).sort(
900
928
  (first, second) => weights[first] - weights[second] || first - second,
901
929
  );
902
930
  this.manager.reset(level2var);