tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479

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