tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545

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 (538) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +58 -54
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +4 -1
  8. package/dist/index.d.ts +4 -1
  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 +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +45 -44
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +43 -40
  21. package/dist/transfer.js +43 -40
  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 +3 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +336 -88
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/dependencies.ts +23 -2
  36. package/src/dfid.ts +9 -2
  37. package/src/environment.ts +27 -5
  38. package/src/errors.ts +30 -3
  39. package/src/evaluate.ts +9 -3
  40. package/src/exit-codes.ts +5 -2
  41. package/src/instances.ts +1 -1
  42. package/src/levels.ts +3 -2
  43. package/src/lexer.ts +5 -3
  44. package/src/liveness-checker.ts +572 -204
  45. package/src/liveness.ts +47 -32
  46. package/src/obligations/action.ts +10 -6
  47. package/src/obligations/anonymize.ts +33 -14
  48. package/src/obligations/enabled-axioms.ts +218 -0
  49. package/src/obligations/equality.ts +1 -3
  50. package/src/obligations/expression.ts +18 -6
  51. package/src/obligations/format.ts +0 -2
  52. package/src/obligations/generate.ts +22 -17
  53. package/src/obligations/index.ts +36 -6
  54. package/src/obligations/levels.ts +24 -11
  55. package/src/obligations/module.ts +1 -3
  56. package/src/obligations/normalize.ts +24 -13
  57. package/src/obligations/operators.ts +0 -2
  58. package/src/obligations/pragma.ts +53 -16
  59. package/src/obligations/printer.ts +43 -13
  60. package/src/obligations/proof.ts +3 -2
  61. package/src/obligations/regroup.ts +0 -2
  62. package/src/obligations/simplify.ts +17 -7
  63. package/src/obligations/source.ts +71 -17
  64. package/src/obligations/subexpression.ts +45 -18
  65. package/src/obligations/substitution.ts +1 -3
  66. package/src/obligations/temporal.ts +0 -2
  67. package/src/obligations/tuples.ts +0 -2
  68. package/src/parallel-worker.ts +8 -2
  69. package/src/parallel.ts +7 -2
  70. package/src/parser.ts +633 -186
  71. package/src/pretty-print.ts +1 -1
  72. package/src/prover/deciders.ts +11 -8
  73. package/src/prover/isabelle/decide.ts +3 -25
  74. package/src/prover/isabelle/encode.ts +71 -41
  75. package/src/prover/isabelle/isar/attrib.ts +250 -0
  76. package/src/prover/isabelle/isar/context.ts +335 -0
  77. package/src/prover/isabelle/isar/induct.ts +382 -0
  78. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  79. package/src/prover/isabelle/isar/method.ts +506 -198
  80. package/src/prover/isabelle/isar/proof.ts +570 -14
  81. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  82. package/src/prover/isabelle/isar/theory.ts +479 -69
  83. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  84. package/src/prover/isabelle/isar/type-check.ts +83 -8
  85. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  86. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  88. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  91. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  92. package/src/prover/isabelle/provers/classical.ts +45 -20
  93. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  94. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  95. package/src/prover/isabelle/pure/consts.ts +0 -2
  96. package/src/prover/isabelle/pure/conv.ts +0 -2
  97. package/src/prover/isabelle/pure/drule.ts +63 -4
  98. package/src/prover/isabelle/pure/envir.ts +0 -2
  99. package/src/prover/isabelle/pure/goal.ts +1 -3
  100. package/src/prover/isabelle/pure/logic.ts +0 -2
  101. package/src/prover/isabelle/pure/name.ts +0 -2
  102. package/src/prover/isabelle/pure/net.ts +0 -2
  103. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  104. package/src/prover/isabelle/pure/pattern.ts +0 -2
  105. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  106. package/src/prover/isabelle/pure/rewriter.ts +1 -8
  107. package/src/prover/isabelle/pure/search.ts +0 -2
  108. package/src/prover/isabelle/pure/seq.ts +0 -2
  109. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  110. package/src/prover/isabelle/pure/table.ts +0 -2
  111. package/src/prover/isabelle/pure/tactic.ts +0 -2
  112. package/src/prover/isabelle/pure/tactical.ts +0 -2
  113. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  114. package/src/prover/isabelle/pure/term.ts +0 -2
  115. package/src/prover/isabelle/pure/thm.ts +0 -2
  116. package/src/prover/isabelle/pure/type.ts +0 -2
  117. package/src/prover/isabelle/pure/unify.ts +0 -2
  118. package/src/prover/isabelle/pure/variable.ts +0 -2
  119. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  120. package/src/prover/isabelle/tla/context.ts +51 -9
  121. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  122. package/src/prover/isabelle/tla/logic.ts +40 -1
  123. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  124. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  125. package/src/prover/ocaml.ts +4 -1
  126. package/src/prover/prep/action.ts +19 -12
  127. package/src/prover/prep/enabled-axioms.ts +11 -2
  128. package/src/prover/prep/methods.ts +159 -50
  129. package/src/prover/prep/normalize.ts +38 -9
  130. package/src/prover/prove.ts +343 -65
  131. package/src/prover/ptl/decide.ts +95 -50
  132. package/src/prover/ptl/encode.ts +2 -3
  133. package/src/prover/ptl/tableau.ts +28 -2
  134. package/src/prover/smt/arithmetic.ts +310 -0
  135. package/src/prover/smt/axioms.ts +12 -8
  136. package/src/prover/smt/context.ts +42 -6
  137. package/src/prover/smt/data.ts +191 -84
  138. package/src/prover/smt/encode.ts +122 -43
  139. package/src/prover/smt/extensionality.ts +5 -3
  140. package/src/prover/smt/flatten.ts +4 -6
  141. package/src/prover/smt/format.ts +28 -4
  142. package/src/prover/smt/instances.ts +7 -1
  143. package/src/prover/smt/layout.ts +91 -0
  144. package/src/prover/smt/rewrite.ts +483 -116
  145. package/src/prover/smt/simplify.ts +441 -0
  146. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  147. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  148. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  149. package/src/prover/smt/solver/act-cache.ts +0 -1
  150. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  151. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  152. package/src/prover/smt/solver/aig.ts +889 -0
  153. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  154. package/src/prover/smt/solver/arith-terms.ts +121 -0
  155. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  156. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  157. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  158. package/src/prover/smt/solver/ast-lt.ts +165 -11
  159. package/src/prover/smt/solver/ast-util.ts +160 -2
  160. package/src/prover/smt/solver/ast.ts +1448 -41
  161. package/src/prover/smt/solver/auf-solver.ts +0 -1
  162. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  163. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  164. package/src/prover/smt/solver/bound-manager.ts +196 -0
  165. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  166. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  167. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  168. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  169. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  170. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  171. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  172. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  173. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  174. package/src/prover/smt/solver/card2bv.ts +109 -0
  175. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  176. package/src/prover/smt/solver/cg-table.ts +39 -25
  177. package/src/prover/smt/solver/check-logic.ts +330 -0
  178. package/src/prover/smt/solver/clause.ts +0 -1
  179. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  180. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  181. package/src/prover/smt/solver/context.ts +533 -114
  182. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  183. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  184. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  185. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  186. package/src/prover/smt/solver/demodulator.ts +786 -0
  187. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  188. package/src/prover/smt/solver/der.ts +38 -10
  189. package/src/prover/smt/solver/diff-neq.ts +205 -0
  190. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  191. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  192. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  193. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  194. package/src/prover/smt/solver/e-matching.ts +6 -7
  195. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  196. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  197. package/src/prover/smt/solver/enode.ts +100 -3
  198. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  199. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  200. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  201. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  202. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  203. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  204. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  205. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  206. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  207. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  208. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  209. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  210. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  211. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  212. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  213. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  214. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  215. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  216. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  217. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  218. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  219. package/src/prover/smt/solver/expr-ref.ts +0 -1
  220. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  221. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  222. package/src/prover/smt/solver/factor.ts +163 -0
  223. package/src/prover/smt/solver/fd-solver.ts +267 -0
  224. package/src/prover/smt/solver/fingerprints.ts +15 -15
  225. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  226. package/src/prover/smt/solver/flat-literals.ts +0 -1
  227. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  228. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  229. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  230. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  231. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  232. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  233. package/src/prover/smt/solver/goal.ts +177 -15
  234. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  235. package/src/prover/smt/solver/guard-set.ts +219 -0
  236. package/src/prover/smt/solver/hash.ts +0 -1
  237. package/src/prover/smt/solver/hashtable.ts +30 -16
  238. package/src/prover/smt/solver/inf-eps.ts +63 -0
  239. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  240. package/src/prover/smt/solver/internalizer.ts +109 -36
  241. package/src/prover/smt/solver/lackr.ts +381 -0
  242. package/src/prover/smt/solver/lbool.ts +0 -1
  243. package/src/prover/smt/solver/lia2card.ts +268 -0
  244. package/src/prover/smt/solver/lia2pb.ts +154 -0
  245. package/src/prover/smt/solver/literal.ts +0 -1
  246. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  247. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  248. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  249. package/src/prover/smt/solver/lp/containers.ts +7 -2
  250. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  251. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  252. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  253. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  254. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  255. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  256. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  257. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  258. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  259. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  260. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  261. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  262. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  263. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  264. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  265. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  266. package/src/prover/smt/solver/lp/nex.ts +2 -2
  267. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  268. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  269. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  270. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  271. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  272. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  273. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  274. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  278. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  281. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  282. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  283. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  284. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  286. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  287. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  288. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  289. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  290. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  291. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  292. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  293. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  294. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  295. package/src/prover/smt/solver/macro-finder.ts +530 -0
  296. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  297. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  298. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  299. package/src/prover/smt/solver/max-cliques.ts +105 -0
  300. package/src/prover/smt/solver/maxcore.ts +309 -0
  301. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  302. package/src/prover/smt/solver/maxlex.ts +115 -0
  303. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  304. package/src/prover/smt/solver/maxsmt.ts +92 -0
  305. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  306. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  307. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  308. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  309. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  310. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  311. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  312. package/src/prover/smt/solver/model-checker.ts +17 -26
  313. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  314. package/src/prover/smt/solver/model-finder.ts +0 -1
  315. package/src/prover/smt/solver/model-generator.ts +59 -30
  316. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  317. package/src/prover/smt/solver/model-printer.ts +214 -0
  318. package/src/prover/smt/solver/mpf.ts +709 -0
  319. package/src/prover/smt/solver/mus.ts +50 -0
  320. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  321. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  322. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  323. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  324. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  325. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  326. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  327. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  328. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  329. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  330. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  331. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  332. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  333. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  334. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  335. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  336. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  337. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  338. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  339. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  340. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  341. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  342. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  343. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  344. package/src/prover/smt/solver/nlqsat.ts +484 -0
  345. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  346. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  347. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  348. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  349. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  350. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  351. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  352. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  353. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  354. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  355. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  356. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  357. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  358. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  359. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  360. package/src/prover/smt/solver/nnf.ts +105 -23
  361. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  362. package/src/prover/smt/solver/occf.ts +97 -0
  363. package/src/prover/smt/solver/opt-context.ts +792 -0
  364. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  365. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  366. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  367. package/src/prover/smt/solver/opt-solver.ts +311 -0
  368. package/src/prover/smt/solver/opt-value.ts +55 -0
  369. package/src/prover/smt/solver/optsmt.ts +692 -0
  370. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  371. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  372. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  373. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  374. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  375. package/src/prover/smt/solver/probes.ts +511 -0
  376. package/src/prover/smt/solver/propagate-values.ts +37 -21
  377. package/src/prover/smt/solver/proto-model.ts +650 -17
  378. package/src/prover/smt/solver/pull-quant.ts +28 -12
  379. package/src/prover/smt/solver/purify-arith.ts +632 -0
  380. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  381. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  382. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  383. package/src/prover/smt/solver/qe-lite.ts +37 -17
  384. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  385. package/src/prover/smt/solver/qe.ts +1499 -0
  386. package/src/prover/smt/solver/qel.ts +25 -0
  387. package/src/prover/smt/solver/qi-queue.ts +0 -1
  388. package/src/prover/smt/solver/qsat.ts +814 -0
  389. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  390. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  391. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  392. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  393. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  394. package/src/prover/smt/solver/random-gen.ts +0 -1
  395. package/src/prover/smt/solver/rational.ts +45 -1
  396. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  397. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  398. package/src/prover/smt/solver/reduce-args.ts +225 -0
  399. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  400. package/src/prover/smt/solver/ref-vector.ts +0 -1
  401. package/src/prover/smt/solver/relevancy.ts +1 -2
  402. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  403. package/src/prover/smt/solver/rewriter.ts +475 -36
  404. package/src/prover/smt/solver/rlimit.ts +38 -2
  405. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  406. package/src/prover/smt/solver/sat/big.ts +177 -0
  407. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  408. package/src/prover/smt/solver/sat/clause.ts +203 -0
  409. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  410. package/src/prover/smt/solver/sat/config.ts +122 -0
  411. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  412. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  413. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  414. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  415. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  416. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  417. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  418. package/src/prover/smt/solver/sat/probing.ts +170 -0
  419. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  420. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  421. package/src/prover/smt/solver/sat/scc.ts +142 -0
  422. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  423. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  424. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  425. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  426. package/src/prover/smt/solver/search-tree.ts +284 -0
  427. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  428. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  429. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  430. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  431. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  432. package/src/prover/smt/solver/seq-factory.ts +89 -0
  433. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  434. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  435. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  436. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  437. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  438. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  439. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  440. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  441. package/src/prover/smt/solver/seq-subset.ts +165 -0
  442. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  443. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  444. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  445. package/src/prover/smt/solver/smt-logics.ts +66 -0
  446. package/src/prover/smt/solver/smt-setup.ts +496 -0
  447. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  448. package/src/prover/smt/solver/smtlib-parser.ts +3154 -326
  449. package/src/prover/smt/solver/smtlib-script.ts +1702 -0
  450. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  451. package/src/prover/smt/solver/solver.ts +113 -22
  452. package/src/prover/smt/solver/static-features.ts +314 -0
  453. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  454. package/src/prover/smt/solver/tactic.ts +1995 -0
  455. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  456. package/src/prover/smt/solver/theory-array.ts +1240 -0
  457. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  458. package/src/prover/smt/solver/theory-char.ts +355 -0
  459. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  460. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  461. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  462. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  463. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  464. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  465. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  466. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  467. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  468. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  469. package/src/prover/smt/solver/theory-lra.ts +188 -2
  470. package/src/prover/smt/solver/theory-pb.ts +933 -0
  471. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  472. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  473. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  474. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  475. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  476. package/src/prover/smt/solver/theory-seq.ts +961 -0
  477. package/src/prover/smt/solver/theory.ts +189 -0
  478. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  479. package/src/prover/smt/solver/var-subst.ts +36 -14
  480. package/src/prover/smt/table.ts +3 -2
  481. package/src/prover/smt/types.ts +146 -0
  482. package/src/prover/tlapm/cache.ts +29 -8
  483. package/src/prover/tlapm-library.ts +3208 -0
  484. package/src/prover/verdict.ts +2 -0
  485. package/src/prover/zenon/decide.ts +10 -7
  486. package/src/prover/zenon/encode.ts +0 -2
  487. package/src/prover/zenon/eqrel.ts +0 -2
  488. package/src/prover/zenon/equality-rules.ts +24 -2
  489. package/src/prover/zenon/expr.ts +21 -2
  490. package/src/prover/zenon/index-table.ts +7 -4
  491. package/src/prover/zenon/isar-case.ts +1 -3
  492. package/src/prover/zenon/isar.ts +2 -4
  493. package/src/prover/zenon/llproof.ts +0 -2
  494. package/src/prover/zenon/mltoll.ts +0 -2
  495. package/src/prover/zenon/node.ts +20 -5
  496. package/src/prover/zenon/parse.ts +6 -2
  497. package/src/prover/zenon/phrase.ts +1 -3
  498. package/src/prover/zenon/proof.ts +0 -2
  499. package/src/prover/zenon/propositional-rules.ts +0 -2
  500. package/src/prover/zenon/rules.ts +2 -3
  501. package/src/prover/zenon/search.ts +7 -5
  502. package/src/prover/zenon/tla/functions.ts +0 -2
  503. package/src/prover/zenon/tla/llproof.ts +0 -2
  504. package/src/prover/zenon/tla/records.ts +0 -2
  505. package/src/prover/zenon/tla/rewrites.ts +0 -2
  506. package/src/prover/zenon/tla/sets.ts +7 -8
  507. package/src/prover/zenon/tla/terms.ts +0 -2
  508. package/src/prover/zenon/tla/tla.ts +0 -2
  509. package/src/resolve.ts +72 -36
  510. package/src/runtime.ts +6 -0
  511. package/src/sany/generation.ts +1 -13
  512. package/src/sany/generator-definitions.ts +1 -1
  513. package/src/sany/generator-expressions.ts +9 -17
  514. package/src/sany/generator-proofs.ts +1 -1
  515. package/src/sany/generator.ts +1 -1
  516. package/src/sany/levels.ts +0 -2
  517. package/src/sany/linter.ts +0 -2
  518. package/src/search.ts +198 -45
  519. package/src/simulate.ts +3 -0
  520. package/src/standard-definitions.ts +4 -0
  521. package/src/state-graph.ts +0 -2
  522. package/src/subexpressions.ts +4 -2
  523. package/src/successors.ts +1 -1
  524. package/src/symmetry.ts +2 -2
  525. package/src/tableau.ts +2 -2
  526. package/src/tlc/fingerprint.ts +81 -9
  527. package/src/tlc/jar-data.ts +12 -0
  528. package/src/tlc/order.ts +14 -3
  529. package/src/tlc/summary.ts +29 -14
  530. package/src/tlc/tlcext-operators.ts +61 -16
  531. package/src/tlc/trace-spec.ts +2 -3
  532. package/src/typed-tier.ts +6541 -0
  533. package/src/typescript/types.ts +2 -2
  534. package/src/values.ts +1 -1
  535. package/src/prover/isabelle/isar/statement.ts +0 -52
  536. package/src/prover/smt/solver/z3-license.txt +0 -10
  537. package/src/prover/tlaps-module.ts +0 -510
  538. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,218 @@
1
+ import {
2
+ type AstManager,
3
+ KIND_APP,
4
+ KIND_QUANTIFIER,
5
+ OP_EQ,
6
+ OP_GE,
7
+ OP_LE,
8
+ OP_ULEQ,
9
+ SORT_INT,
10
+ } from "./ast";
11
+ import { BoundManager } from "./bound-manager";
12
+ import { mkBvApp } from "./bv-decl-plugin";
13
+ import type { Goal } from "./goal";
14
+ import { FuncInterp, ProtoModel } from "./proto-model";
15
+ import { Rational } from "./rational";
16
+ import { RefVector } from "./ref-vector";
17
+ import { RewriterTpl } from "./rewriter-tpl";
18
+
19
+ const UNSIGNED_LIMIT = Rational.of(2n ** 32n);
20
+
21
+ const isUnsigned = (value: Rational) =>
22
+ value.isInt() && !value.isNegative() && value.compare(UNSIGNED_LIMIT) < 0;
23
+
24
+ const getNumBits = (value: Rational) => value.num.toString(2).length;
25
+
26
+ class EqRewriter extends RewriterTpl {
27
+ constructor(
28
+ manager: AstManager,
29
+ private fd: Map<number, number>,
30
+ ) {
31
+ super(manager);
32
+ }
33
+
34
+ override isRewritingPatterns() {
35
+ return false;
36
+ }
37
+
38
+ private getFd(variable: number, other: number) {
39
+ const manager = this.manager;
40
+ const bv = this.fd.get(variable);
41
+ if (bv === undefined || !manager.isNumeral(other)) return -1;
42
+ const width = manager.getBvSize(manager.sorts[bv]);
43
+ return manager.mkEq(bv, manager.mkBvNumeral(manager.getRationalValue(other).num, width));
44
+ }
45
+
46
+ override reduceApp(decl: number, args: number[]) {
47
+ if (decl !== OP_EQ) return -1;
48
+ const first = this.getFd(args[0], args[1]);
49
+ const result = first === -1 ? this.getFd(args[1], args[0]) : first;
50
+ if (result !== -1) this.manager.incRef(result);
51
+ return result;
52
+ }
53
+ }
54
+
55
+ interface BvModelConverter {
56
+ bvToInt: Map<number, number>;
57
+ vars: number[];
58
+ values: Rational[];
59
+ }
60
+
61
+ const convertModel = (manager: AstManager, converter: BvModelConverter, source: ProtoModel) => {
62
+ const target = new ProtoModel(manager).mkModel();
63
+ for (const entry of source.funcInterps) {
64
+ const copied = new FuncInterp(manager, entry[1].arity);
65
+ for (const funcEntry of entry[1].entries)
66
+ copied.insertNewEntry(funcEntry.args, funcEntry.result);
67
+ if (entry[1].elseExpr !== null) copied.setElse(entry[1].elseExpr);
68
+ target.registerFunc(entry[0], copied);
69
+ }
70
+ for (const sort of source.getUninterpretedSorts())
71
+ for (const value of source.getKnownUniverse(sort)) target.registerValue(value);
72
+ for (const decl of source.getConstDecls()) {
73
+ const value = source.constInterps.get(decl) as number;
74
+ const original = converter.bvToInt.get(decl);
75
+ if (original !== undefined && manager.isBvNumeral(value))
76
+ target.registerConst(original, manager.mkNumeral(manager.getBvNumeralValue(value)));
77
+ else target.registerConst(decl, value);
78
+ }
79
+ for (const [index, decl] of converter.vars.entries())
80
+ target.registerConst(
81
+ decl,
82
+ manager.mkNumeralOfSort(converter.values[index], manager.funcDecls[decl].range),
83
+ );
84
+ return target;
85
+ };
86
+
87
+ export const createEq2BvTactic = (manager: AstManager) => (goal: Goal) => {
88
+ const bounds = new BoundManager(manager);
89
+ const trail = new RefVector(manager);
90
+ const fd = new Map<number, number>();
91
+ const max = new Map<number, Rational>();
92
+ const nonFd = new Set<number>();
93
+ const hasEq = new Set<number>();
94
+ const converter: BvModelConverter = { bvToInt: new Map(), vars: [], values: [] };
95
+ for (const form of goal.forms.items) bounds.add(form);
96
+ if (bounds.isInconsistent() || goal.isProofsEnabled) {
97
+ goal.depth++;
98
+ return [goal];
99
+ }
100
+ const isVarConstPair = (expr: number, constant: number) =>
101
+ manager.isUninterpretedConst(expr) &&
102
+ manager.isNumeral(constant) &&
103
+ isUnsigned(manager.getRationalValue(constant)) &&
104
+ !nonFd.has(expr);
105
+ // is_bound: a lower bound c <= x, then an upper bound x <= c, gives x.
106
+ const getBoundVar = (form: number) => {
107
+ const op = manager.getOp(form);
108
+ if ((op !== OP_LE && op !== OP_GE) || manager.getNumArgs(form) !== 2) return -1;
109
+ const small = manager.getArg(form, op === OP_LE ? 0 : 1);
110
+ const large = manager.getArg(form, op === OP_LE ? 1 : 0);
111
+ if (isVarConstPair(large, small)) return large;
112
+ return isVarConstPair(small, large) ? small : -1;
113
+ };
114
+ const isFd = (variable: number, constant: number) => {
115
+ if (
116
+ !manager.isUninterpretedConst(variable) ||
117
+ !manager.isNumeral(constant) ||
118
+ nonFd.has(variable) ||
119
+ manager.sorts[variable] !== SORT_INT
120
+ )
121
+ return false;
122
+ const value = manager.getRationalValue(constant);
123
+ if (!isUnsigned(value)) return false;
124
+ const previous = max.get(variable);
125
+ if (previous === undefined || previous.compare(value) < 0) max.set(variable, value);
126
+ return true;
127
+ };
128
+ const collectFd = (root: number) => {
129
+ trail.push(root);
130
+ if (getBoundVar(root) !== -1) return;
131
+ const todo = [root];
132
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
133
+ if (nonFd.has(expr)) continue;
134
+ nonFd.add(expr);
135
+ if (manager.kinds[expr] === KIND_QUANTIFIER) {
136
+ todo.push(manager.getQuantifier(expr).body);
137
+ continue;
138
+ }
139
+ if (manager.kinds[expr] !== KIND_APP) continue;
140
+ if (manager.getOp(expr) === OP_EQ) {
141
+ const first = manager.getArg(expr, 0);
142
+ const second = manager.getArg(expr, 1);
143
+ for (const side of [first, second]) if (manager.isUninterpretedConst(side)) hasEq.add(side);
144
+ if (isFd(first, second) || isFd(second, first)) continue;
145
+ }
146
+ manager.pushArgs(expr, todo);
147
+ }
148
+ };
149
+ for (const form of goal.forms.items) collectFd(form);
150
+ for (const variable of max.keys()) if (nonFd.has(variable)) max.delete(variable);
151
+ for (const [variable, maximum] of max) {
152
+ const upper = bounds.uppers.get(variable);
153
+ const lower = bounds.lowers.get(variable);
154
+ const atLeast = (value: Rational, bound: Rational | undefined) =>
155
+ bound !== undefined && bound.compare(value) > 0 ? bound : value;
156
+ const value = atLeast(
157
+ upper === undefined ? maximum.add(Rational.one) : atLeast(maximum, upper.value),
158
+ lower?.value,
159
+ ).add(Rational.one);
160
+ const bits = Math.max(getNumBits(value), 2);
161
+ const fresh = manager.mkFreshConst("z", manager.mkBvSort(bits));
162
+ trail.push(fresh);
163
+ fd.set(variable, fresh);
164
+ converter.bvToInt.set(manager.decls[fresh], manager.decls[variable]);
165
+ }
166
+ if (max.size === 0) {
167
+ trail.reset();
168
+ return [goal];
169
+ }
170
+ const rewriter = new EqRewriter(manager, fd);
171
+ for (let index = 0; !goal.isInconsistent && index < goal.forms.size; index++) {
172
+ const form = goal.forms.items[index];
173
+ const variable = getBoundVar(form);
174
+ if (variable !== -1 && !hasEq.has(variable)) {
175
+ const upper = bounds.uppers.get(variable);
176
+ const lower = bounds.lowers.get(variable);
177
+ const value =
178
+ upper !== undefined && !upper.isStrict && isUnsigned(upper.value)
179
+ ? upper.value
180
+ : lower !== undefined && !lower.isStrict && isUnsigned(lower.value)
181
+ ? lower.value
182
+ : undefined;
183
+ if (value !== undefined) {
184
+ converter.vars.push(manager.decls[variable]);
185
+ converter.values.push(value);
186
+ goal.update(index, manager.trueExpr);
187
+ continue;
188
+ }
189
+ }
190
+ if (variable !== -1 && max.has(variable)) {
191
+ goal.update(index, manager.trueExpr);
192
+ continue;
193
+ }
194
+ const rewritten = rewriter.rewrite(form);
195
+ if (rewritten !== form) goal.update(index, rewritten);
196
+ manager.decRef(rewritten);
197
+ }
198
+ rewriter.release();
199
+ for (const variable of max.keys()) {
200
+ const bv = fd.get(variable) as number;
201
+ const width = manager.getBvSize(manager.sorts[bv]);
202
+ const lower = bounds.lowers.get(variable);
203
+ const upper = bounds.uppers.get(variable);
204
+ if (lower !== undefined && !lower.value.isNegative())
205
+ goal.assert(mkBvApp(manager, OP_ULEQ, [manager.mkBvNumeral(lower.value.num, width), bv]));
206
+ if (upper !== undefined && !upper.value.isNegative())
207
+ goal.assert(mkBvApp(manager, OP_ULEQ, [bv, manager.mkBvNumeral(upper.value.num, width)]));
208
+ }
209
+ for (const decl of converter.vars) manager.incDeclRef(decl);
210
+ for (const entry of converter.bvToInt) {
211
+ manager.incDeclRef(entry[0]);
212
+ manager.incDeclRef(entry[1]);
213
+ }
214
+ trail.reset();
215
+ goal.depth++;
216
+ goal.addModelConversion((model) => convertModel(manager, converter, model));
217
+ return [goal];
218
+ };
@@ -0,0 +1,403 @@
1
+ import {
2
+ OP_ADD,
3
+ OP_DIV,
4
+ OP_GE,
5
+ OP_IDIV,
6
+ OP_ITE,
7
+ OP_LE,
8
+ OP_MOD,
9
+ OP_MUL,
10
+ OP_POWER,
11
+ OP_POWER0,
12
+ OP_REM,
13
+ OP_SUB,
14
+ OP_TO_INT,
15
+ OP_TO_REAL,
16
+ OP_UMINUS,
17
+ SORT_BOOL,
18
+ SORT_INT,
19
+ SORT_REAL,
20
+ } from "../ast";
21
+ import { getExtendedNumeral } from "../ast-util";
22
+ import { type Dependency, linearize } from "../lp/dependency";
23
+ import { Explanation } from "../lp/explanation";
24
+ import { NULL_LPVAR } from "../lp/lar-solver";
25
+ import { getEuclideanDiv, Rational } from "../rational";
26
+ import type { Enode, ThEq } from "./egraph";
27
+ import {
28
+ type ArithBound,
29
+ ArithInternalize,
30
+ SOURCE_EQUALITY,
31
+ SOURCE_INEQUALITY,
32
+ } from "./arith-internalize";
33
+
34
+ export abstract class ArithAxioms extends ArithInternalize {
35
+ protected core: number[] = [];
36
+ protected eqs: [Enode, Enode][] = [];
37
+ protected explanation = new Explanation();
38
+ protected delayedEqs: { eq: ThEq; isEq: boolean }[] = [];
39
+
40
+ private mkArith(op: number, args: number[], sort: number) {
41
+ return this.manager.mkApp(op, args, sort);
42
+ }
43
+
44
+ private mkIneq(op: number, left: number, right: number) {
45
+ return this.mkArith(op, [left, right], SORT_BOOL);
46
+ }
47
+
48
+ private isZero(expr: number) {
49
+ const manager = this.manager;
50
+ return manager.isNumeral(expr) && manager.getRationalValue(expr).isZero();
51
+ }
52
+
53
+ protected mkDivAxiom(dividend: number, divisor: number) {
54
+ if (this.isZero(divisor)) return;
55
+ const manager = this.manager;
56
+ const eqz = this.eqInternalize(divisor, manager.mkRealNumeral(Rational.zero));
57
+ const quotient = this.mkArith(OP_DIV, [dividend, divisor], SORT_REAL);
58
+ const eq = this.eqInternalize(this.mkArith(OP_MUL, [divisor, quotient], SORT_REAL), dividend);
59
+ this.addClause([eqz, eq]);
60
+ }
61
+
62
+ protected mkToIntAxiom(expr: number) {
63
+ const manager = this.manager;
64
+ const arg = manager.getArg(expr, 0);
65
+ if (manager.getOp(arg) === OP_TO_REAL) {
66
+ this.addClause([this.eqInternalize(manager.getArg(arg, 0), expr)]);
67
+ return;
68
+ }
69
+ const toReal = this.mkArith(OP_TO_REAL, [expr], SORT_REAL);
70
+ const lo = this.mkIneq(
71
+ OP_LE,
72
+ this.mkArith(OP_SUB, [toReal, arg], SORT_REAL),
73
+ manager.mkRealNumeral(Rational.zero),
74
+ );
75
+ const hi = this.mkIneq(
76
+ OP_GE,
77
+ this.mkArith(OP_SUB, [arg, toReal], SORT_REAL),
78
+ manager.mkRealNumeral(Rational.one),
79
+ );
80
+ const loLit = this.mkLiteral(lo);
81
+ const hiLit = this.mkLiteral(hi);
82
+ this.addClause([loLit]);
83
+ this.addClause([hiLit ^ 1]);
84
+ }
85
+
86
+ protected mkAbsAxiom(expr: number) {
87
+ const manager = this.manager;
88
+ const arg = manager.getArg(expr, 0);
89
+ const sort = manager.sorts[expr];
90
+ const isNonneg = this.mkLiteral(
91
+ this.mkIneq(OP_GE, arg, manager.mkNumeralOfSort(Rational.zero, sort)),
92
+ );
93
+ this.addClause([isNonneg ^ 1, this.eqInternalize(expr, arg)]);
94
+ this.addClause([isNonneg, this.eqInternalize(expr, this.mkArith(OP_UMINUS, [arg], sort))]);
95
+ }
96
+
97
+ protected mkPower0Axioms(power: number, base: number) {
98
+ const manager = this.manager;
99
+ const power0 = this.mkArith(OP_POWER0, [base, manager.getArg(power, 1)], manager.sorts[power]);
100
+ const eq = this.eqInternalize(
101
+ base,
102
+ manager.mkNumeralOfSort(Rational.zero, manager.sorts[base]),
103
+ );
104
+ this.addClause([eq ^ 1, this.eqInternalize(power, power0)]);
105
+ this.addClause([
106
+ eq,
107
+ this.eqInternalize(power, manager.mkNumeralOfSort(Rational.one, manager.sorts[power])),
108
+ ]);
109
+ }
110
+
111
+ protected mkPowerAxiom(power: number, base: number, exponent: number) {
112
+ if (this.isZero(exponent)) {
113
+ this.mkPower0Axioms(power, base);
114
+ return;
115
+ }
116
+ const manager = this.manager;
117
+ const zero = manager.mkRealNumeral(Rational.zero);
118
+ const baseValue = getExtendedNumeral(manager, base);
119
+ if (baseValue?.isPositive() === true)
120
+ this.addClause([this.mkLiteral(this.mkIneq(OP_LE, power, zero)) ^ 1]);
121
+ const exponentValue = getExtendedNumeral(manager, exponent);
122
+ if (exponentValue?.isPositive() !== true || exponentValue.den <= 1n) return;
123
+ const isBaseNonneg = this.mkIneq(OP_GE, base, zero);
124
+ const baseToNum =
125
+ exponentValue.num > 1n
126
+ ? this.mkArith(
127
+ OP_POWER,
128
+ [base, manager.mkRealNumeral(Rational.of(exponentValue.num))],
129
+ manager.sorts[power],
130
+ )
131
+ : base;
132
+ const isEq = manager.mkEq(
133
+ baseToNum,
134
+ this.mkArith(
135
+ OP_POWER,
136
+ [power, manager.mkRealNumeral(Rational.of(exponentValue.den))],
137
+ manager.sorts[power],
138
+ ),
139
+ );
140
+ this.addClause([this.mkLiteral(isBaseNonneg) ^ 1, this.mkLiteral(isEq)]);
141
+ }
142
+
143
+ protected mkIsIntAxiom(expr: number) {
144
+ const arg = this.manager.getArg(expr, 0);
145
+ const toReal = this.mkArith(OP_TO_REAL, [this.mkArith(OP_TO_INT, [arg], SORT_INT)], SORT_REAL);
146
+ const eq = this.eqInternalize(toReal, arg);
147
+ this.addEquiv(this.expr2literal(expr), eq);
148
+ }
149
+
150
+ protected mkIdivModAxioms(dividend: number, divisor: number) {
151
+ if (this.isZero(divisor)) return;
152
+ const manager = this.manager;
153
+ const quotient = this.mkArith(OP_IDIV, [dividend, divisor], SORT_INT);
154
+ const remainder = this.mkArith(OP_MOD, [dividend, divisor], SORT_INT);
155
+ const zero = manager.mkNumeral(0n);
156
+ if (this.isZero(dividend)) {
157
+ const qGe0 = this.mkLiteral(this.mkIneq(OP_GE, divisor, zero));
158
+ const qLe0 = this.mkLiteral(this.mkIneq(OP_LE, divisor, zero));
159
+ const dGe0 = this.mkLiteral(this.mkIneq(OP_GE, quotient, zero));
160
+ const dLe0 = this.mkLiteral(this.mkIneq(OP_LE, quotient, zero));
161
+ const mGe0 = this.mkLiteral(this.mkIneq(OP_GE, remainder, zero));
162
+ const mLe0 = this.mkLiteral(this.mkIneq(OP_LE, remainder, zero));
163
+ for (const qLit of [qGe0, qLe0])
164
+ for (const lit of [dGe0, dLe0, mGe0, mLe0]) this.addClause([qLit, lit]);
165
+ return;
166
+ }
167
+ const eq = this.eqInternalize(
168
+ this.mkArith(
169
+ OP_ADD,
170
+ [this.mkArith(OP_MUL, [divisor, quotient], SORT_INT), remainder],
171
+ SORT_INT,
172
+ ),
173
+ dividend,
174
+ );
175
+ const modGe0 = this.mkLiteral(this.mkIneq(OP_GE, remainder, zero));
176
+ const divisorValue = manager.isNumeral(divisor)
177
+ ? manager.getRationalValue(divisor)
178
+ : Rational.zero;
179
+ if (!divisorValue.isZero()) {
180
+ const upper = manager.mkNumeral(divisorValue.abs().sub(Rational.one).num);
181
+ this.addClause([eq]);
182
+ this.addClause([modGe0]);
183
+ this.addClause([this.mkLiteral(this.mkIneq(OP_LE, remainder, upper))]);
184
+ return;
185
+ }
186
+ const minusOne = manager.mkNumeral(-1n);
187
+ const isNonneg = this.mkIneq(OP_GE, divisor, zero);
188
+ const negDivisor = this.mkArith(OP_UMINUS, [divisor], SORT_INT);
189
+ const absDivisor = this.mkArith(OP_ITE, [isNonneg, divisor, negDivisor], SORT_INT);
190
+ const eqz = this.mkLiteral(manager.mkEq(divisor, zero));
191
+ const modGe0Again = this.mkLiteral(this.mkIneq(OP_GE, remainder, zero));
192
+ const modLtQ = this.mkLiteral(
193
+ this.mkIneq(OP_LE, this.mkArith(OP_SUB, [remainder, absDivisor], SORT_INT), minusOne),
194
+ );
195
+ this.addClause([eqz, eq]);
196
+ this.addClause([eqz, modGe0Again]);
197
+ this.addClause([eqz, modLtQ]);
198
+ if (manager.getOp(divisor) !== OP_UMINUS)
199
+ this.addClause([
200
+ this.mkLiteral(
201
+ manager.mkEq(remainder, this.mkArith(OP_MOD, [dividend, negDivisor], SORT_INT)),
202
+ ),
203
+ ]);
204
+ if (!manager.isNumeral(divisor))
205
+ this.addClause([
206
+ eqz,
207
+ this.mkLiteral(
208
+ this.mkIneq(OP_LE, this.mkArith(OP_MUL, [divisor, quotient], SORT_INT), dividend),
209
+ ),
210
+ ]);
211
+ }
212
+
213
+ protected mkRemAxiom(dividend: number, divisor: number) {
214
+ const manager = this.manager;
215
+ const zero = manager.mkNumeral(0n);
216
+ const rem = this.mkArith(OP_REM, [dividend, divisor], SORT_INT);
217
+ const mod = this.mkArith(OP_MOD, [dividend, divisor], SORT_INT);
218
+ const negMod = this.mkArith(OP_UMINUS, [mod], SORT_INT);
219
+ const dgez = this.mkLiteral(this.mkIneq(OP_GE, divisor, zero));
220
+ const pos = this.eqInternalize(rem, mod);
221
+ const neg = this.eqInternalize(rem, negMod);
222
+ this.addClause([dgez ^ 1, pos]);
223
+ this.addClause([dgez, neg]);
224
+ }
225
+
226
+ protected mkBoundAxiom(first: ArithBound, second: ArithBound) {
227
+ const l1 = first.lit;
228
+ const l2 = second.lit;
229
+ const k1 = first.value;
230
+ const k2 = second.value;
231
+ if (k1.equals(k2) && first.isLower === second.isLower) return;
232
+ if (first.isLower) {
233
+ if (second.isLower) {
234
+ if (k2.compare(k1) <= 0) this.addClause([l1 ^ 1, l2]);
235
+ else this.addClause([l1, l2 ^ 1]);
236
+ } else if (k1.compare(k2) <= 0) this.addClause([l1, l2]);
237
+ else {
238
+ this.addClause([l1 ^ 1, l2 ^ 1]);
239
+ if (first.isInt && k1.equals(k2.add(Rational.one))) this.addClause([l1, l2]);
240
+ }
241
+ } else if (second.isLower) {
242
+ if (k1.compare(k2) >= 0) this.addClause([l1, l2]);
243
+ else {
244
+ this.addClause([l1 ^ 1, l2 ^ 1]);
245
+ if (first.isInt && k1.equals(k2.sub(Rational.one))) this.addClause([l1, l2]);
246
+ }
247
+ } else if (k1.compare(k2) >= 0) this.addClause([l1, l2 ^ 1]);
248
+ else this.addClause([l1 ^ 1, l2]);
249
+ }
250
+
251
+ override newEqEh(eq: ThEq) {
252
+ const v1 = eq.v1;
253
+ const v2 = eq.v2;
254
+ if (this.isBoolVar(v1)) return;
255
+ this.forcePush();
256
+ if (this.var2expr(v1) === this.var2expr(v2)) return;
257
+ this.isNewEq = true;
258
+ const first = this.var2enodeOf(v1);
259
+ const second = this.var2enodeOf(v2);
260
+ const w1 = this.registerVar(v1);
261
+ const w2 = this.registerVar(v2);
262
+ if (this.solver.areEqual(w1, w2)) return;
263
+ const constraints = this.solver.addEquality(w1, w2);
264
+ this.addEqConstraint(constraints[0], first, second);
265
+ this.addEqConstraint(constraints[1], first, second);
266
+ }
267
+
268
+ override useDiseqs() {
269
+ return true;
270
+ }
271
+
272
+ override newDiseqEh(eq: ThEq) {
273
+ this.ensureColumn(eq.v1);
274
+ this.ensureColumn(eq.v2);
275
+ this.delayedEqs.push({ eq, isEq: false });
276
+ this.ctx.trail.push(() => this.delayedEqs.pop());
277
+ }
278
+
279
+ protected ensureColumn(thVar: number) {
280
+ if (this.solver.externalToLocalColumn(thVar) === NULL_LPVAR) this.registerVar(thVar);
281
+ }
282
+
283
+ protected mkDiseqAxiom(v1: number, v2: number) {
284
+ if (this.isBoolVar(v1)) return;
285
+ this.forcePush();
286
+ const manager = this.manager;
287
+ let first = this.var2expr(v1);
288
+ let second = this.var2expr(v2);
289
+ if (manager.ids[first] > manager.ids[second]) [first, second] = [second, first];
290
+ if (manager.areDistinct(first, second)) return;
291
+ if (manager.isNumeral(first)) [first, second] = [second, first];
292
+ const eq = this.eqInternalize(first, second);
293
+ let le: number;
294
+ let ge: number;
295
+ if (manager.isNumeral(second)) {
296
+ le = this.mkLiteral(this.mkIneq(OP_LE, first, second));
297
+ ge = this.mkLiteral(this.mkIneq(OP_GE, first, second));
298
+ } else {
299
+ const sort = manager.sorts[first];
300
+ const diff = this.rewrite(this.mkArith(OP_SUB, [first, second], sort));
301
+ const zero = manager.mkNumeralOfSort(Rational.zero, sort);
302
+ if (manager.isNumeral(diff)) {
303
+ if (!manager.getRationalValue(diff).isZero()) return;
304
+ this.addUnit(eq);
305
+ return;
306
+ }
307
+ le = this.mkLiteral(this.mkIneq(OP_LE, diff, zero));
308
+ ge = this.mkLiteral(this.mkIneq(OP_GE, diff, zero));
309
+ }
310
+ this.addClause([eq ^ 1, le]);
311
+ this.addClause([eq ^ 1, ge]);
312
+ this.addClause([le ^ 1, ge ^ 1, eq]);
313
+ }
314
+
315
+ protected checkIdivBounds() {
316
+ const manager = this.manager;
317
+ let isAllValid = true;
318
+ for (let index = 0; index < this.idivTerms.length; index++) {
319
+ const term = this.idivTerms[index];
320
+ let dividend = manager.getArg(term, 0);
321
+ const divisor = manager.getArg(term, 1);
322
+ const v1 = this.internalizeDef(dividend);
323
+ this.ensureColumn(v1);
324
+ const r1 = this.getIvalue(v1);
325
+ if (!r1.x.isInt() || r1.x.isNegative() || !r1.y.isZero()) continue;
326
+ if (!manager.isNumeral(divisor) || !manager.getRationalValue(divisor).isPositive()) continue;
327
+ const r2 = manager.getRationalValue(divisor);
328
+ if (!this.isBounded(term)) continue;
329
+ const thVar = this.internalizeDef(term);
330
+ const value = this.getIvalue(thVar);
331
+ const quotient = Rational.of(getEuclideanDiv(r1.x.num, r2.num));
332
+ if (value.y.isZero() && value.x.equals(quotient)) continue;
333
+ let hi = r2.mul(quotient).add(r2).sub(Rational.one);
334
+ let lo = r2.mul(quotient);
335
+ if (manager.getOp(dividend) === OP_MUL && manager.getNumArgs(dividend) === 2) {
336
+ const factor = getExtendedNumeral(manager, manager.getArg(dividend, 0));
337
+ if (factor?.isPositive() === true) {
338
+ dividend = manager.getArg(dividend, 1);
339
+ hi = hi.div(factor).floor();
340
+ lo = lo.div(factor).ceil();
341
+ }
342
+ }
343
+ const pLeR1 = this.mkLiteral(this.mkIneq(OP_LE, dividend, manager.mkNumeral(hi.num)));
344
+ const pGeR1 = this.mkLiteral(this.mkIneq(OP_GE, dividend, manager.mkNumeral(lo.num)));
345
+ const nLeDiv = this.mkLiteral(this.mkIneq(OP_LE, term, manager.mkNumeral(quotient.num)));
346
+ const nGeDiv = this.mkLiteral(this.mkIneq(OP_GE, term, manager.mkNumeral(quotient.num)));
347
+ this.addClause([pLeR1 ^ 1, nLeDiv]);
348
+ this.addClause([pGeR1 ^ 1, nGeDiv]);
349
+ isAllValid = false;
350
+ }
351
+ return isAllValid;
352
+ }
353
+
354
+ private isBounded(expr: number): boolean {
355
+ const manager = this.manager;
356
+ const op = manager.getOp(expr);
357
+ if (op === OP_IDIV && manager.isNumeral(manager.getArg(expr, 1)))
358
+ return this.isBounded(manager.getArg(expr, 0));
359
+ return (op === OP_MOD && manager.isNumeral(manager.getArg(expr, 1))) || manager.isNumeral(expr);
360
+ }
361
+
362
+ protected getIvalue(thVar: number) {
363
+ return this.solver.getValue(this.solver.externalToLocalColumn(thVar));
364
+ }
365
+
366
+ protected fixedVarEh(thVar: number, dep: Dependency, bound: Rational) {
367
+ const manager = this.manager;
368
+ const solver = this.solver;
369
+ const node = this.var2enodeOf(thVar);
370
+ const isInt = manager.isInt(node.owner);
371
+ const other = bound.isZero()
372
+ ? solver.getExternal(this.getZero(isInt))
373
+ : bound.equals(Rational.one)
374
+ ? solver.getExternal(this.getOne(isInt))
375
+ : this.value2var.get(bound.toString());
376
+ if (other === undefined) return;
377
+ const otherNode = this.var2enodeOf(other);
378
+ if (manager.sorts[node.owner] !== manager.sorts[otherNode.owner]) return;
379
+ if (node.root === otherNode.root) return;
380
+ this.resetEvidence();
381
+ this.explanation.clear();
382
+ for (const constraint of linearize([dep])) this.consume(Rational.one, constraint);
383
+ this.propagateEq(this.core, this.eqs, node, otherNode);
384
+ }
385
+
386
+ protected resetEvidence() {
387
+ this.core = [];
388
+ this.eqs = [];
389
+ }
390
+
391
+ protected consume(coeff: Rational, constraint: number) {
392
+ this.setEvidence(constraint);
393
+ this.explanation.addPair(constraint, coeff);
394
+ }
395
+
396
+ protected setEvidence(constraint: number) {
397
+ if (constraint === -1) return;
398
+ const source = this.constraintSources[constraint];
399
+ if (source === SOURCE_INEQUALITY) this.core.push(this.inequalities[constraint]);
400
+ else if (source === SOURCE_EQUALITY)
401
+ this.eqs.push(this.equalities[constraint] as [Enode, Enode]);
402
+ }
403
+ }