tla-ts 0.0.9 → 0.0.10-dev.06b481ee0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (631) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +48 -44
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +122 -12
  8. package/dist/index.d.ts +122 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1156 -888
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +330 -659
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +263 -370
  51. package/src/errors.ts +107 -57
  52. package/src/evaluate.ts +898 -369
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +137 -22
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -322
  64. package/src/liveness.ts +230 -133
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +36 -60
  88. package/src/parallel.ts +64 -73
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +135 -40
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +299 -108
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +479 -0
  612. package/src/typescript/collections.ts +614 -0
  613. package/src/typescript/compile.ts +63 -0
  614. package/src/typescript/context.ts +94 -0
  615. package/src/typescript/emit.ts +121 -0
  616. package/src/typescript/expressions.ts +496 -0
  617. package/src/typescript/formula.ts +154 -0
  618. package/src/typescript/functions.ts +284 -0
  619. package/src/typescript/model.ts +162 -0
  620. package/src/typescript/names.ts +114 -0
  621. package/src/typescript/program.ts +48 -0
  622. package/src/typescript/properties.ts +139 -0
  623. package/src/typescript/scope.ts +112 -0
  624. package/src/typescript/steps.ts +167 -0
  625. package/src/typescript/types.ts +171 -0
  626. package/src/values.ts +945 -526
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,389 @@
1
+ import { SmtInvariantError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ FAMILY_FPA,
5
+ OP_CONCAT,
6
+ OP_FPA_BV2RM,
7
+ OP_FPA_BVWRAP,
8
+ OP_FPA_FP,
9
+ OP_FPA_TO_FP,
10
+ OP_FPA_TO_IEEE_BV,
11
+ OP_FPA_TO_REAL,
12
+ OP_FPA_TO_SBV,
13
+ OP_FPA_TO_UBV,
14
+ OP_IMPLIES,
15
+ OP_ULEQ,
16
+ SORT_BOOL,
17
+ } from "./ast";
18
+ import { TACTIC_ARITH_OPTIONS } from "./arith-rewriter";
19
+ import { mkBvApp } from "./bv-decl-plugin";
20
+ import { convertMinMaxSpecials, convertUf2BvUf } from "./bv2fpa-converter";
21
+ import type { Context } from "./context";
22
+ import type { Enode } from "./enode";
23
+ import {
24
+ getFpNumeral,
25
+ getRmNumeral,
26
+ mkFpNumeral,
27
+ mkFpNumeralOfBits,
28
+ mkRmNumeral,
29
+ } from "./fpa-decl-plugin";
30
+ import { WrappedFpa2BvConverter } from "./fpa2bv-converter";
31
+ import { Fpa2BvRewriter } from "./fpa2bv-rewriter";
32
+ import { ObjHashtable } from "./hashtable";
33
+ import type { BoolVar } from "./literal";
34
+ import { mkZero } from "./mpf";
35
+ import { ProtoModel } from "./proto-model";
36
+ import { Rewriter } from "./rewriter";
37
+ import { type DependentValue, Theory } from "./theory";
38
+
39
+ const CONVERTED_OPS = new Set([
40
+ OP_FPA_TO_FP,
41
+ OP_FPA_TO_UBV,
42
+ OP_FPA_TO_SBV,
43
+ OP_FPA_TO_REAL,
44
+ OP_FPA_TO_IEEE_BV,
45
+ ]);
46
+
47
+ // m_th_rw, with arith_lhs, and the converter and the rewriter that share it.
48
+ export const mkFpaConversion = (manager: AstManager) => {
49
+ const theoryRewriter = new Rewriter(manager, {
50
+ isEliminatingAnd: false,
51
+ arith: { ...TACTIC_ARITH_OPTIONS, isArithLhs: true },
52
+ isRewritingPatterns: true,
53
+ });
54
+ const simp = new Rewriter(manager, {
55
+ isEliminatingAnd: false,
56
+ arith: TACTIC_ARITH_OPTIONS,
57
+ isRewritingPatterns: false,
58
+ });
59
+ const converter = new WrappedFpa2BvConverter(manager, simp, theoryRewriter);
60
+ return { theoryRewriter, converter, rewriter: new Fpa2BvRewriter(manager, converter) };
61
+ };
62
+
63
+ export const mkRmValue = (manager: AstManager, value: number) => {
64
+ const rm = Number(manager.getBvNumeralValue(value));
65
+ return mkRmNumeral(manager, rm <= 3 ? rm : 4);
66
+ };
67
+
68
+ // fpa2bv_converter_wrapped::bv2fpa_value, of the sign, exponent and significand or of their
69
+ // concatenation.
70
+ export const mkFpValue = (manager: AstManager, sort: number, values: number[]) => {
71
+ const sbits = BigInt(manager.getSbits(sort));
72
+ const parts = values.map((value) => manager.getBvNumeralValue(value));
73
+ const bits =
74
+ parts.length === 1
75
+ ? parts[0]
76
+ : (parts[0] << (BigInt(manager.getEbits(sort)) + sbits - 1n)) |
77
+ (parts[1] << (sbits - 1n)) |
78
+ parts[2];
79
+ return mkFpNumeralOfBits(manager, sort, bits);
80
+ };
81
+
82
+ export const mkFpZero = (manager: AstManager, sort: number) =>
83
+ mkFpNumeral(manager, mkZero(manager.getEbits(sort), manager.getSbits(sort), false));
84
+
85
+ // finalize_model: the model of the floating-point functions that the conversion made.
86
+ export const finalizeFpaModel = (
87
+ manager: AstManager,
88
+ converter: WrappedFpa2BvConverter,
89
+ model: ProtoModel,
90
+ ) => {
91
+ const target = new ProtoModel(manager);
92
+ target.incRef();
93
+ const seen = new ObjHashtable((decl) => manager.getDeclHash(decl));
94
+ convertMinMaxSpecials(converter, model, target, seen);
95
+ convertUf2BvUf(converter, model, target, seen);
96
+ for (const decl of seen) model.unregisterDecl(decl);
97
+ for (const decl of target.getConstDecls())
98
+ model.registerConst(decl, target.getSomeConstInterp(decl));
99
+ for (const decl of target.getFuncDecls()) {
100
+ const interp = target.funcInterps.get(decl);
101
+ if (interp !== undefined) model.registerFunc(decl, interp.copy());
102
+ }
103
+ target.decRef();
104
+ };
105
+
106
+ export class TheoryFpa extends Theory {
107
+ readonly name = "fpa";
108
+ private theoryRewriter: Rewriter;
109
+ private converter: WrappedFpa2BvConverter;
110
+ private rewriter: Fpa2BvRewriter;
111
+ private conversions = new Map<number, number>();
112
+ private trail: number[] = [];
113
+ private trailLimits: number[] = [];
114
+ private model: ProtoModel | undefined;
115
+
116
+ constructor(context: Context) {
117
+ super(context, FAMILY_FPA);
118
+ const conversion = mkFpaConversion(context.manager);
119
+ this.theoryRewriter = conversion.theoryRewriter;
120
+ this.converter = conversion.converter;
121
+ this.rewriter = conversion.rewriter;
122
+ }
123
+
124
+ private isFloat(expr: number) {
125
+ const sort = this.manager.sorts[expr];
126
+ return this.manager.isFpSort(sort) || this.manager.isRmSort(sort);
127
+ }
128
+
129
+ private convert(expr: number) {
130
+ const existing = this.conversions.get(expr);
131
+ if (existing !== undefined) return existing;
132
+ const manager = this.manager;
133
+ const result = this.rewriter.convert(this.theoryRewriter, expr);
134
+ this.conversions.set(expr, result);
135
+ manager.incRef(expr);
136
+ this.trail.push(expr);
137
+ return result;
138
+ }
139
+
140
+ private mkSideConditions() {
141
+ const manager = this.manager;
142
+ const converter = this.converter;
143
+ const formulas = converter.extraAssertions.items.map((assertion) => {
144
+ const rewritten = this.context.rewriter.rewrite(assertion);
145
+ manager.releaseLater(rewritten);
146
+ return rewritten;
147
+ });
148
+ converter.extraAssertions.reset();
149
+ const result = this.theoryRewriter.rewrite(manager.mkAnd(formulas));
150
+ manager.releaseLater(result);
151
+ return result;
152
+ }
153
+
154
+ private rewrite(expr: number) {
155
+ const result = this.theoryRewriter.rewrite(expr);
156
+ this.manager.releaseLater(result);
157
+ return result;
158
+ }
159
+
160
+ private assertCnstr(expr: number) {
161
+ const context = this.context;
162
+ if (expr === this.manager.trueExpr) return;
163
+ context.internalize(expr, false);
164
+ const literal = context.getLiteral(expr);
165
+ context.markLiteralAsRelevant(literal);
166
+ context.mkThAxiom([literal]);
167
+ }
168
+
169
+ private attachNewThVar(node: Enode) {
170
+ const thVar = this.varEnodes.length;
171
+ this.varEnodes.push(node);
172
+ this.context.attachThVar(node, this, thVar);
173
+ }
174
+
175
+ internalizeAtom(atom: number) {
176
+ const context = this.context;
177
+ const manager = this.manager;
178
+ if (context.isBInternalized(atom)) return true;
179
+ const boolVar = context.mkBoolVar(atom);
180
+ context.setVarTheory(boolVar, this.id);
181
+ for (let index = 0; index < manager.getNumArgs(atom); index++)
182
+ context.internalize(manager.getArg(atom, index), false);
183
+ const outer = manager.beginTemporaries();
184
+ const bvAtom = this.rewriter.convert(this.theoryRewriter, atom);
185
+ manager.releaseLater(bvAtom);
186
+ const withSideConditions = this.rewrite(manager.mkAnd([bvAtom, this.mkSideConditions()]));
187
+ this.assertCnstr(manager.mkEq(atom, withSideConditions));
188
+ manager.endTemporaries(outer);
189
+ return true;
190
+ }
191
+
192
+ internalizeTerm(term: number) {
193
+ const context = this.context;
194
+ const manager = this.manager;
195
+ for (let index = 0; index < manager.getNumArgs(term); index++)
196
+ context.internalize(manager.getArg(term, index), false);
197
+ const node = context.getEnode(term) ?? context.mkEnode(term, false, false, true);
198
+ if (this.isAttachedToVar(node)) return true;
199
+ this.attachNewThVar(node);
200
+ if (CONVERTED_OPS.has(manager.getOp(term))) {
201
+ const outer = manager.beginTemporaries();
202
+ this.assertCnstr(manager.mkEq(term, this.convert(term)));
203
+ this.assertCnstr(this.mkSideConditions());
204
+ manager.endTemporaries(outer);
205
+ }
206
+ if (!context.relevancy.isEnabled) this.relevantEh(term);
207
+ return true;
208
+ }
209
+
210
+ applySortCnstr(node: Enode) {
211
+ const manager = this.manager;
212
+ if (this.isAttachedToVar(node)) return;
213
+ this.attachNewThVar(node);
214
+ const owner = node.owner;
215
+ if (manager.isRmSort(manager.sorts[owner]) && manager.getOp(owner) !== OP_FPA_BV2RM) {
216
+ const outer = manager.beginTemporaries();
217
+ const limit = manager.mkBvNumeral(4n, 3);
218
+ this.assertCnstr(mkBvApp(manager, OP_ULEQ, [this.converter.wrap(owner), limit]));
219
+ manager.endTemporaries(outer);
220
+ }
221
+ if (!this.context.relevancy.isEnabled) this.relevantEh(owner);
222
+ }
223
+
224
+ newEqEh(first: number, second: number) {
225
+ this.assertEquality(first, second, false);
226
+ }
227
+
228
+ newDiseqEh(first: number, second: number) {
229
+ this.assertEquality(first, second, true);
230
+ }
231
+
232
+ private assertEquality(first: number, second: number, isNegated: boolean) {
233
+ const manager = this.manager;
234
+ const firstExpr = this.getExpr(first);
235
+ const secondExpr = this.getExpr(second);
236
+ if (manager.getOp(firstExpr) === OP_FPA_BVWRAP || manager.getOp(secondExpr) === OP_FPA_BVWRAP)
237
+ return;
238
+ const outer = manager.beginTemporaries();
239
+ const firstConverted = this.convert(firstExpr);
240
+ const secondConverted = this.convert(secondExpr);
241
+ const isFloatPair = this.isFloat(firstExpr) && this.isFloat(secondExpr);
242
+ const eq = isFloatPair
243
+ ? this.converter.mkEq(firstConverted, secondConverted)
244
+ : manager.mkEq(firstConverted, secondConverted);
245
+ const condition = this.rewrite(isNegated ? manager.mkNot(eq) : eq);
246
+ const exprEq = manager.mkEq(firstExpr, secondExpr);
247
+ this.assertCnstr(manager.mkEq(isNegated ? manager.mkNot(exprEq) : exprEq, condition));
248
+ this.assertCnstr(this.mkSideConditions());
249
+ manager.endTemporaries(outer);
250
+ }
251
+
252
+ override assignEh(boolVar: BoolVar, isTrue: boolean) {
253
+ const manager = this.manager;
254
+ const expr = this.context.boolVar2Expr[boolVar];
255
+ const outer = manager.beginTemporaries();
256
+ const converted = manager.mkAnd([this.convert(expr), this.mkSideConditions()]);
257
+ const constraint = isTrue
258
+ ? manager.mkApp(OP_IMPLIES, [expr, converted], SORT_BOOL)
259
+ : manager.mkApp(OP_IMPLIES, [converted, expr], SORT_BOOL);
260
+ this.assertCnstr(this.rewrite(constraint));
261
+ manager.endTemporaries(outer);
262
+ }
263
+
264
+ override relevantEh(expr: number) {
265
+ const manager = this.manager;
266
+ const op = manager.getOp(expr);
267
+ if (!this.isFloat(expr)) {
268
+ if (manager.getFamily(expr) === FAMILY_FPA && CONVERTED_OPS.has(op)) {
269
+ const outer = manager.beginTemporaries();
270
+ this.assertCnstr(manager.mkEq(expr, this.convert(expr)));
271
+ this.assertCnstr(this.mkSideConditions());
272
+ manager.endTemporaries(outer);
273
+ }
274
+ return;
275
+ }
276
+ if (op === OP_FPA_FP) return;
277
+ const outer = manager.beginTemporaries();
278
+ this.assertValueConstraints(expr);
279
+ manager.endTemporaries(outer);
280
+ }
281
+
282
+ private assertValueConstraints(expr: number) {
283
+ const manager = this.manager;
284
+ const converter = this.converter;
285
+ const wrapped = converter.wrap(expr);
286
+ const rm = getRmNumeral(manager, expr);
287
+ if (rm !== undefined) {
288
+ this.assertCnstr(manager.mkEq(wrapped, manager.mkBvNumeral(BigInt(rm), 3)));
289
+ return;
290
+ }
291
+ if (getFpNumeral(manager, expr) !== undefined) {
292
+ const value = this.convert(expr);
293
+ const concatenation = mkBvApp(manager, OP_CONCAT, converter.splitFp(value));
294
+ this.assertCnstr(manager.mkEq(wrapped, concatenation));
295
+ this.assertCnstr(this.mkSideConditions());
296
+ this.assertCnstr(manager.mkEq(expr, value));
297
+ return;
298
+ }
299
+ this.assertCnstr(manager.mkEq(converter.unwrap(wrapped, manager.sorts[expr]), expr));
300
+ if (manager.getFamily(expr) === FAMILY_FPA) return;
301
+ const converted = this.convert(expr);
302
+ if (manager.getOp(converted) !== OP_FPA_FP) return;
303
+ const [, exp, sig] = converter.splitFp(converted);
304
+ this.assertCnstr(
305
+ manager.mkEq(wrapped, mkBvApp(manager, OP_CONCAT, converter.splitFp(converted))),
306
+ );
307
+ this.assertCnstr(this.mkSideConditions());
308
+ const ebits = manager.getBvSize(manager.sorts[exp]);
309
+ const sbits = manager.getBvSize(manager.sorts[sig]);
310
+ const topExp = manager.mkBvNumeral((1n << BigInt(ebits)) - 1n, ebits);
311
+ const sigZero = manager.mkBvNumeral(0n, sbits);
312
+ const expIsAllOnes = manager.mkEq(exp, topExp);
313
+ const sigIsZero = manager.mkEq(sig, sigZero);
314
+ const sigIsNonzero = manager.mkNot(sigIsZero);
315
+ const isNan = manager.mkAnd([expIsAllOnes, sigIsNonzero]);
316
+ const canonicalSgn = manager.mkBvNumeral(0n, 1);
317
+ const canonicalSig = manager.mkBvNumeral(1n, sbits);
318
+ const canonicalNan = mkBvApp(manager, OP_CONCAT, [canonicalSgn, topExp, canonicalSig]);
319
+ this.assertCnstr(
320
+ manager.mkApp(OP_IMPLIES, [isNan, manager.mkEq(wrapped, canonicalNan)], SORT_BOOL),
321
+ );
322
+ }
323
+
324
+ override pushScopeEh() {
325
+ super.pushScopeEh();
326
+ this.trailLimits.push(this.trail.length);
327
+ }
328
+
329
+ override popScopeEh(numScopes: number) {
330
+ const manager = this.manager;
331
+ const newLevel = this.trailLimits.length - numScopes;
332
+ const limit = this.trailLimits[newLevel];
333
+ for (let index = this.trail.length - 1; index >= limit; index--) {
334
+ const expr = this.trail[index];
335
+ const converted = this.conversions.get(expr);
336
+ this.conversions.delete(expr);
337
+ if (converted !== undefined) manager.decRef(converted);
338
+ manager.decRef(expr);
339
+ }
340
+ this.trail.length = limit;
341
+ this.trailLimits.length = newLevel;
342
+ this.rewriter.reset();
343
+ super.popScopeEh(numScopes);
344
+ }
345
+
346
+ override mkValue(node: Enode): number | DependentValue | undefined {
347
+ const context = this.context;
348
+ const manager = this.manager;
349
+ const owner = this.getIteValue(node.owner);
350
+ const sort = manager.sorts[owner];
351
+ if (getRmNumeral(manager, owner) !== undefined || getFpNumeral(manager, owner) !== undefined)
352
+ return owner;
353
+ const getEnodes = (exprs: number[]) =>
354
+ exprs.map((expr) => {
355
+ const argNode = context.getEnode(expr);
356
+ if (argNode === undefined) throw new SmtInvariantError("the term was not internalized");
357
+ return argNode;
358
+ });
359
+ const op = manager.getOp(owner);
360
+ if (op === OP_FPA_FP)
361
+ return {
362
+ dependencies: getEnodes(this.converter.splitFp(owner)),
363
+ mkValue: (values) => mkFpValue(manager, sort, values),
364
+ };
365
+ if (op === OP_FPA_BV2RM)
366
+ return {
367
+ dependencies: getEnodes([manager.getArg(owner, 0)]),
368
+ mkValue: (values) => mkRmValue(manager, values[0]),
369
+ };
370
+ const wrapped = this.converter.wrap(owner);
371
+ if (context.isEInternalized(wrapped))
372
+ return {
373
+ dependencies: getEnodes([wrapped]),
374
+ mkValue: (values) =>
375
+ manager.isRmSort(sort) ? mkRmValue(manager, values[0]) : mkFpValue(manager, sort, values),
376
+ };
377
+ return mkFpZero(manager, sort);
378
+ }
379
+
380
+ override initModel(model: ProtoModel) {
381
+ this.model = model;
382
+ }
383
+
384
+ override finalizeModel() {
385
+ const model = this.model;
386
+ if (model === undefined) throw new SmtInvariantError("the model was not initialized");
387
+ finalizeFpaModel(this.manager, this.converter, model);
388
+ }
389
+ }
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/smt/theory_lra.cpp, src/smt/arith_eq_adapter.cpp), MIT license, see
2
- // z3-license.txt. The axioms of theory_lra: those of div, mod, to_int and is_int, and the
3
- // arith_eq_adapter axioms that tie an equality of terms to their two inequalities.
4
1
  import { SmtInvariantError } from "../../../errors";
5
2
  import {
6
3
  OP_ADD,
@@ -11,14 +8,19 @@ import {
11
8
  OP_LE,
12
9
  OP_MOD,
13
10
  OP_MUL,
11
+ OP_POWER,
12
+ OP_POWER0,
13
+ OP_REM,
14
14
  OP_SUB,
15
15
  OP_TO_INT,
16
16
  OP_TO_REAL,
17
+ OP_UMINUS,
17
18
  SORT_BOOL,
18
19
  SORT_INT,
19
20
  SORT_REAL,
20
21
  } from "./ast";
21
- import { Enode } from "./enode";
22
+ import { getExtendedNumeral } from "./ast-util";
23
+ import type { Enode } from "./enode";
22
24
  import { FALSE_LITERAL, getVar, isNegated, Literal, negate, TRUE_LITERAL } from "./literal";
23
25
  import { Rational } from "./rational";
24
26
  import { TheoryLraState } from "./theory-lra-state";
@@ -26,10 +28,8 @@ import { TheoryLraState } from "./theory-lra-state";
26
28
  export abstract class TheoryLraAxioms extends TheoryLraState {
27
29
  private processedEqs = new Set<string>();
28
30
 
29
- // m_restart_pairs: equalities whose axioms a backjump to the base level drops, remade on restart.
30
31
  protected restartPairs: Enode[][] = [];
31
32
 
32
- // The enode of a term, internalized first if it has none.
33
33
  protected getInternalizedEnode(expr: number) {
34
34
  const context = this.context;
35
35
  if (!context.isEInternalized(expr)) context.internalize(expr, false);
@@ -113,7 +113,8 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
113
113
  const first = context.getEnode(this.manager.getArg(expr, 0));
114
114
  const second = context.getEnode(this.manager.getArg(expr, 1));
115
115
  if (first === undefined || second === undefined) return;
116
- if (first.thVar >= 0 && second.thVar >= 0 && first !== second) this.mkEqAxioms(first, second);
116
+ if (this.getThVar(first) >= 0 && this.getThVar(second) >= 0 && first !== second)
117
+ this.mkEqAxioms(first, second);
117
118
  }
118
119
 
119
120
  newEqEh(first: number, second: number) {
@@ -131,29 +132,56 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
131
132
  else if (op === OP_TO_INT) this.mkToIntAxiom(expr);
132
133
  else if (op === OP_IS_INT) this.mkIsIntAxiom(expr);
133
134
  else if (op === OP_MOD) this.mkIdivModAxioms(manager.getArg(expr, 0), manager.getArg(expr, 1));
135
+ else if (op === OP_REM) this.mkRemAxiom(manager.getArg(expr, 0), manager.getArg(expr, 1));
136
+ else if (op === OP_POWER) this.mkPowerAxiom(expr);
137
+ }
138
+
139
+ private mkPowerAxiom(power: number) {
140
+ const manager = this.manager;
141
+ const context = this.context;
142
+ const base = manager.getArg(power, 0);
143
+ const exponent = manager.getArg(power, 1);
144
+ const zero = manager.mkRealNumeral(Rational.zero);
145
+ const baseValue = getExtendedNumeral(manager, base);
146
+ if (baseValue?.isPositive())
147
+ this.mkAxiom([negate(this.mkLiteral(manager.mkApp(OP_LE, [power, zero], SORT_BOOL)))]);
148
+ const exponentValue = getExtendedNumeral(manager, exponent);
149
+ if (exponentValue?.isPositive() && exponentValue.num === 1n && exponentValue.den > 1n) {
150
+ const isNonnegative = this.mkLiteral(manager.mkApp(OP_GE, [base, zero], SORT_BOOL));
151
+ const root = manager.mkApp(
152
+ OP_POWER,
153
+ [power, manager.mkRealNumeral(Rational.of(exponentValue.den))],
154
+ SORT_REAL,
155
+ );
156
+ const isRoot = this.mkLiteral(manager.mkEq(base, root));
157
+ this.mkAxiom([negate(isNonnegative), isRoot]);
158
+ }
159
+ const isZeroBase =
160
+ manager.isNumeral(base) &&
161
+ manager.getRationalValue(base).isZero() &&
162
+ (!manager.isNumeral(exponent) || manager.getRationalValue(exponent).isZero());
163
+ if (isZeroBase || (baseValue === undefined && exponentValue === undefined)) {
164
+ const literal = this.mkEq(power, manager.mkApp(OP_POWER0, [base, exponent], SORT_REAL));
165
+ context.markLiteralAsRelevant(literal);
166
+ context.assign(literal, null);
167
+ }
134
168
  }
135
169
 
136
- // mk_literal.
137
170
  protected mkLiteral(atom: number) {
138
171
  const context = this.context;
139
172
  if (!context.isEInternalized(atom)) context.internalize(atom, false);
140
173
  return context.getLiteral(atom);
141
174
  }
142
175
 
143
- // ensure_enode: the relevant enode of a term.
144
176
  private ensureEnode(expr: number) {
145
177
  const node = this.getInternalizedEnode(expr);
146
178
  this.context.markAsRelevant(expr);
147
179
  return node;
148
180
  }
149
181
 
150
- // mk_axiom: a theory axiom whose literals are relevant. Of two literals, the second becomes
151
- // relevant only once the first is false. A unit axiom is the clause of false and the literal, so
152
- // mk_clause drops false and the literal is justified by unit resolution with true, which lemma
153
- // minimization can see through, rather than by an axiom.
182
+ // A unit axiom is the clause of false and the literal, so Z3 justifies the literal by unit resolution, not by an axiom.
154
183
  protected mkAxiom(literals: Literal[]) {
155
184
  const context = this.context;
156
- // mkThAxiom simplifies the literals it is given, which this reads after.
157
185
  context.mkThAxiom(
158
186
  literals.length === 1 ? [context.falseLiteral, literals[0]] : literals.slice(),
159
187
  );
@@ -167,12 +195,23 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
167
195
  context.relevancy.addWatch(
168
196
  context.boolVar2Expr[getVar(literals[0])],
169
197
  isNegated(literals[0]),
170
- // simple_relevancy_eh marks the consequent without propagating.
171
198
  () => context.relevancy.markAsRelevant(consequent),
172
199
  );
173
200
  }
174
201
 
175
- // mk_div_axiom: q = 0 or q * (p / q) = p.
202
+ private mkRemAxiom(dividend: number, divisor: number) {
203
+ const manager = this.manager;
204
+ const zero = manager.mkNumeral(0n);
205
+ const remainder = manager.mkApp(OP_REM, [dividend, divisor], SORT_INT);
206
+ const mod = manager.mkApp(OP_MOD, [dividend, divisor], SORT_INT);
207
+ const negatedMod = manager.mkApp(OP_UMINUS, [mod], SORT_INT);
208
+ const isNonnegative = this.mkLiteral(manager.mkApp(OP_GE, [divisor, zero], SORT_BOOL));
209
+ const isPositiveCase = this.mkEq(remainder, mod);
210
+ const isNegativeCase = this.mkEq(remainder, negatedMod);
211
+ this.mkAxiom([negate(isNonnegative), isPositiveCase]);
212
+ this.mkAxiom([isNonnegative, isNegativeCase]);
213
+ }
214
+
176
215
  private mkDivAxiom(dividend: number, divisor: number) {
177
216
  const manager = this.manager;
178
217
  if (this.isZeroNumeral(divisor)) return;
@@ -185,7 +224,6 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
185
224
  this.mkAxiom([isZero, this.mkEq(product, dividend)]);
186
225
  }
187
226
 
188
- // mk_to_int_axiom: to_int (to_real x) = x, and to_real (to_int x) <= x < to_real (to_int x) + 1.
189
227
  private mkToIntAxiom(term: number) {
190
228
  const manager = this.manager;
191
229
  const arg = manager.getArg(term, 0);
@@ -210,7 +248,6 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
210
248
  this.mkAxiom([negate(upperLiteral)]);
211
249
  }
212
250
 
213
- // mk_is_int_axiom: is_int x if and only if to_real (to_int x) = x.
214
251
  protected mkIsIntAxiom(atom: number) {
215
252
  const manager = this.manager;
216
253
  const arg = manager.getArg(atom, 0);
@@ -223,7 +260,6 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
223
260
  this.mkAxiom([isInt, negate(eq)]);
224
261
  }
225
262
 
226
- // theory::mk_eq: the literal of an equality between two terms, internalized.
227
263
  protected mkEq(first: number, second: number) {
228
264
  const manager = this.manager;
229
265
  if (first === second) return TRUE_LITERAL;
@@ -233,11 +269,9 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
233
269
  return this.context.getLiteral(atom);
234
270
  }
235
271
 
236
- // mk_idiv_mod_axioms: q * (div p q) + (mod p q) = p and 0 <= (mod p q) < |q| when q is not 0.
237
272
  protected mkIdivModAxioms(dividend: number, divisor: number) {
238
273
  const manager = this.manager;
239
274
  if (manager.getNumeral(divisor) === 0n) return;
240
- // The expr_refs of mk_idiv_mod_axioms, released in reverse when it returns.
241
275
  const refs: number[] = [];
242
276
  const hold = (expr: number) => {
243
277
  manager.incRef(expr);
@@ -255,7 +289,6 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
255
289
  const remainder = hold(manager.mkApp(OP_MOD, [dividend, divisor], SORT_INT));
256
290
  const zero = hold(manager.mkNumeral(0n));
257
291
  if (manager.getNumeral(dividend) === 0n) {
258
- // q != 0 implies div 0 q = 0 and mod 0 q = 0.
259
292
  const isDivisorNonnegative = this.mkLiteral(manager.mkApp(OP_GE, [divisor, zero], SORT_BOOL));
260
293
  const isDivisorNonpositive = this.mkLiteral(manager.mkApp(OP_LE, [divisor, zero], SORT_BOOL));
261
294
  const consequents = [
@@ -289,7 +322,6 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
289
322
  this.mkAxiom([this.mkLiteral(manager.mkApp(OP_LE, [remainder, upper], SORT_BOOL))]);
290
323
  return;
291
324
  }
292
- // q = 0 or (mod p q) >= 0, q >= 0 or (mod p q) + q <= -1, and q <= 0 or (mod p q) - q <= -1.
293
325
  const minusOne = hold(manager.mkNumeral(-1n));
294
326
  const minusDivisor = hold(manager.mkApp(OP_MUL, [minusOne, divisor], SORT_INT));
295
327
  const isZero = this.mkLiteral(manager.mkEq(divisor, zero));
@@ -317,8 +349,6 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
317
349
  );
318
350
  this.mkAxiom([isDivisorNonnegative, isBelowNegatedDivisor]);
319
351
  this.mkEqAxioms(this.ensureEnode(combination), this.ensureEnode(dividend));
320
- // q = 0 or q * (div p q) <= p. The rewritten atom replaces the unrewritten one, which Z3
321
- // releases at once, and its own expr_ref goes at the end of the block.
322
352
  const unrewritten = manager.mkApp(
323
353
  OP_GE,
324
354
  [
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/smt/theory_lra.cpp, src/math/lp/lp_api.h), MIT license, see z3-license.txt.
2
- // The atoms of theory_lra: each is a bound on a column, with axioms between the bounds of the same
3
- // column.
4
1
  import { OP_GE, OP_IS_INT, OP_LE } from "./ast";
5
2
  import { BoolVar, Literal, mkLiteral, negate } from "./literal";
6
3
  import { Rational } from "./rational";
@@ -27,7 +24,7 @@ export abstract class TheoryLraBounds extends TheoryLraInternalize {
27
24
  const op = manager.getOp(expr);
28
25
  const boolVar = context.mkBoolVar(expr);
29
26
  this.boolVarToBound[boolVar] = undefined;
30
- context.setVarTheory(boolVar);
27
+ context.setVarTheory(boolVar, this.id);
31
28
  if (op === OP_IS_INT) {
32
29
  this.mkEnode(expr);
33
30
  if (!context.relevancy.isEnabled) this.mkIsIntAxiom(expr);
@@ -60,6 +57,27 @@ export abstract class TheoryLraBounds extends TheoryLraInternalize {
60
57
  return true;
61
58
  }
62
59
 
60
+ // mk_ge of theory_lra: the atom of an objective bound, without the enode of its term.
61
+ protected mkObjectiveBound(
62
+ atom: number,
63
+ thVar: number,
64
+ isLower: boolean,
65
+ value: Rational,
66
+ eps: Rational,
67
+ ) {
68
+ const context = this.context;
69
+ if (context.isBInternalized(atom)) return;
70
+ const boolVar = context.mkBoolVar(atom);
71
+ this.boolVarToBound[boolVar] = undefined;
72
+ context.setVarTheory(boolVar, this.id);
73
+ const apiBound = this.mkVarBound(boolVar, thVar, isLower, value, eps);
74
+ this.mkBoundAxioms(apiBound);
75
+ this.updateUnassignedBounds(thVar, 1);
76
+ this.bounds[thVar].push(apiBound);
77
+ this.boundsTrail.push(thVar);
78
+ this.boolVarToBound[boolVar] = apiBound;
79
+ }
80
+
63
81
  private updateUnassignedBounds(thVar: number, increment: number) {
64
82
  const saved = this.unassignedBounds[thVar];
65
83
  this.context.pushTrail(() => {
@@ -68,21 +86,25 @@ export abstract class TheoryLraBounds extends TheoryLraInternalize {
68
86
  this.unassignedBounds[thVar] = saved + increment;
69
87
  }
70
88
 
71
- // bound2constraint_kind: the kind of the bound when its atom is true or false.
72
89
  protected getBoundKind(bound: ApiBound, isTrue: boolean) {
73
90
  if (bound.isLower) return isTrue ? KIND_GE : bound.isInt ? KIND_LE : KIND_LT;
74
91
  return isTrue ? KIND_LE : bound.isInt ? KIND_GE : KIND_GT;
75
92
  }
76
93
 
77
- private mkVarBound(boolVar: BoolVar, thVar: number, isLower: boolean, value: Rational) {
94
+ private mkVarBound(
95
+ boolVar: BoolVar,
96
+ thVar: number,
97
+ isLower: boolean,
98
+ value: Rational,
99
+ eps = Rational.zero,
100
+ ) {
78
101
  this.pushInternalizeState();
79
102
  this.internalizeHead--;
80
103
  const column = this.registerVar(thVar);
81
104
  const isInt = this.isIntVar(thVar);
82
- const partial = { isLower, isInt };
83
105
  const kindTrue = isLower ? KIND_GE : KIND_LE;
84
106
  const kindFalse = isLower ? (isInt ? KIND_LE : KIND_LT) : isInt ? KIND_GE : KIND_GT;
85
- const constraintTrue = this.solver.mkVarBound(column, kindTrue, value);
107
+ const constraintTrue = this.solver.mkVarBound(column, kindTrue, value, eps);
86
108
  const falseValue = isInt
87
109
  ? isLower
88
110
  ? value.sub(Rational.one)
@@ -91,10 +113,9 @@ export abstract class TheoryLraBounds extends TheoryLraInternalize {
91
113
  const constraintFalse = this.solver.mkVarBound(column, kindFalse, falseValue);
92
114
  this.constraintSources[constraintTrue] = mkLiteral(boolVar);
93
115
  this.constraintSources[constraintFalse] = mkLiteral(boolVar, true);
94
- return { boolVar, thVar, column, value, constraintTrue, constraintFalse, ...partial };
116
+ return { boolVar, thVar, column, value, eps, constraintTrue, constraintFalse, isLower, isInt };
95
117
  }
96
118
 
97
- // mk_bound_axioms: implications between a new bound and its closest neighbors on the variable.
98
119
  private mkBoundAxioms(bound: ApiBound) {
99
120
  if (!this.context.isSearching) {
100
121
  this.newBounds.push(bound);
@@ -146,7 +167,6 @@ export abstract class TheoryLraBounds extends TheoryLraInternalize {
146
167
  else mkClause([negate(l1), l2]);
147
168
  }
148
169
 
149
- // flush_bound_axioms: the axioms of the bounds created before the search, per variable.
150
170
  protected flushBoundAxioms() {
151
171
  while (this.newBounds.length > 0) {
152
172
  const pending = this.newBounds.slice().sort((first, second) => first.thVar - second.thVar);