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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (587) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +41 -37
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +21 -4
  8. package/dist/index.d.ts +21 -4
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2681 -425
  15. package/dist/prove.js +2681 -425
  16. package/dist/run.cjs +41 -42
  17. package/dist/run.js +41 -42
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +97 -89
  21. package/dist/transfer.js +97 -89
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +72 -39
  26. package/src/bags.ts +50 -29
  27. package/src/builtins.ts +8 -16
  28. package/src/check-failure.ts +118 -0
  29. package/src/check-trace.ts +321 -0
  30. package/src/check.ts +828 -770
  31. package/src/cli/options.ts +6 -31
  32. package/src/cli/runtime-invariants.ts +20 -56
  33. package/src/cli/shared.ts +1 -1
  34. package/src/cli/tlapm.ts +433 -70
  35. package/src/cli/tlc-arguments.ts +224 -212
  36. package/src/cli/tlc-output.ts +701 -0
  37. package/src/cli/tlc-usage.ts +1 -2
  38. package/src/cli/tlc.ts +65 -712
  39. package/src/cli/xml-exporter.ts +23 -33
  40. package/src/codegen.ts +28 -20
  41. package/src/coverage.ts +255 -20
  42. package/src/dependencies.ts +96 -27
  43. package/src/dfid.ts +115 -50
  44. package/src/environment-config.ts +315 -0
  45. package/src/environment.ts +175 -373
  46. package/src/errors.ts +40 -5
  47. package/src/evaluate.ts +429 -139
  48. package/src/exit-codes.ts +28 -12
  49. package/src/fingerprints.ts +65 -1
  50. package/src/instances.ts +178 -17
  51. package/src/java-hash.ts +14 -0
  52. package/src/java-overrides.ts +2 -2
  53. package/src/json.ts +4 -7
  54. package/src/levels.ts +708 -272
  55. package/src/lexer.ts +17 -5
  56. package/src/liveness-checker.ts +707 -249
  57. package/src/liveness.ts +148 -95
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +39 -9
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +27 -18
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +48 -18
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +120 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +17 -31
  81. package/src/parallel.ts +29 -47
  82. package/src/parser.ts +757 -326
  83. package/src/pretty-print.ts +1 -1
  84. package/src/prover/decide-pool.ts +3 -3
  85. package/src/prover/deciders.ts +12 -9
  86. package/src/prover/isabelle/decide.ts +3 -25
  87. package/src/prover/isabelle/encode.ts +72 -42
  88. package/src/prover/isabelle/isar/attrib.ts +250 -0
  89. package/src/prover/isabelle/isar/context.ts +335 -0
  90. package/src/prover/isabelle/isar/induct.ts +382 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  92. package/src/prover/isabelle/isar/method.ts +509 -212
  93. package/src/prover/isabelle/isar/proof.ts +570 -14
  94. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  95. package/src/prover/isabelle/isar/theory.ts +487 -76
  96. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  97. package/src/prover/isabelle/isar/type-check.ts +89 -14
  98. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  99. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  101. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  102. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  103. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  104. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  105. package/src/prover/isabelle/provers/classical.ts +45 -20
  106. package/src/prover/isabelle/provers/hypsubst.ts +19 -30
  107. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  108. package/src/prover/isabelle/pure/consts.ts +0 -2
  109. package/src/prover/isabelle/pure/conv.ts +2 -10
  110. package/src/prover/isabelle/pure/drule.ts +72 -6
  111. package/src/prover/isabelle/pure/envir.ts +0 -2
  112. package/src/prover/isabelle/pure/goal.ts +1 -3
  113. package/src/prover/isabelle/pure/logic.ts +1 -3
  114. package/src/prover/isabelle/pure/name.ts +0 -2
  115. package/src/prover/isabelle/pure/net.ts +0 -2
  116. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  117. package/src/prover/isabelle/pure/pattern.ts +0 -2
  118. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  119. package/src/prover/isabelle/pure/rewriter.ts +9 -20
  120. package/src/prover/isabelle/pure/search.ts +0 -2
  121. package/src/prover/isabelle/pure/seq.ts +0 -2
  122. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  123. package/src/prover/isabelle/pure/table.ts +2 -3
  124. package/src/prover/isabelle/pure/tactic.ts +0 -2
  125. package/src/prover/isabelle/pure/tactical.ts +42 -37
  126. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  127. package/src/prover/isabelle/pure/term.ts +3 -5
  128. package/src/prover/isabelle/pure/thm.ts +14 -13
  129. package/src/prover/isabelle/pure/type.ts +0 -2
  130. package/src/prover/isabelle/pure/unify.ts +0 -2
  131. package/src/prover/isabelle/pure/variable.ts +0 -2
  132. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  133. package/src/prover/isabelle/tla/context.ts +58 -11
  134. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  135. package/src/prover/isabelle/tla/logic.ts +49 -21
  136. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  137. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  138. package/src/prover/ocaml.ts +4 -1
  139. package/src/prover/prep/action.ts +30 -31
  140. package/src/prover/prep/enabled-axioms.ts +11 -2
  141. package/src/prover/prep/fingerprint.ts +2 -5
  142. package/src/prover/prep/md5.ts +26 -29
  143. package/src/prover/prep/methods.ts +181 -51
  144. package/src/prover/prep/normalize.ts +38 -9
  145. package/src/prover/prove.ts +395 -94
  146. package/src/prover/ptl/decide.ts +95 -50
  147. package/src/prover/ptl/encode.ts +2 -3
  148. package/src/prover/ptl/tableau.ts +28 -2
  149. package/src/prover/smt/arithmetic.ts +310 -0
  150. package/src/prover/smt/axioms.ts +12 -8
  151. package/src/prover/smt/context.ts +43 -8
  152. package/src/prover/smt/data.ts +498 -379
  153. package/src/prover/smt/encode.ts +148 -57
  154. package/src/prover/smt/extensionality.ts +5 -3
  155. package/src/prover/smt/flatten.ts +4 -6
  156. package/src/prover/smt/format.ts +28 -4
  157. package/src/prover/smt/instances.ts +7 -1
  158. package/src/prover/smt/layout.ts +91 -0
  159. package/src/prover/smt/rewrite.ts +1016 -618
  160. package/src/prover/smt/simplify.ts +441 -0
  161. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
  162. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  163. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  164. package/src/prover/smt/solver/act-cache.ts +0 -1
  165. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  166. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  167. package/src/prover/smt/solver/aig.ts +889 -0
  168. package/src/prover/smt/solver/arith-rewriter.ts +624 -9
  169. package/src/prover/smt/solver/arith-terms.ts +121 -0
  170. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  171. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  172. package/src/prover/smt/solver/asserted-formulas.ts +240 -56
  173. package/src/prover/smt/solver/ast-lt.ts +165 -11
  174. package/src/prover/smt/solver/ast-util.ts +160 -2
  175. package/src/prover/smt/solver/ast.ts +1483 -45
  176. package/src/prover/smt/solver/auf-solver.ts +25 -18
  177. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  178. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  179. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  180. package/src/prover/smt/solver/bound-manager.ts +196 -0
  181. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  182. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  183. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  184. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  185. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  186. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  187. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  188. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  189. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  190. package/src/prover/smt/solver/card2bv.ts +127 -0
  191. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  192. package/src/prover/smt/solver/cg-table.ts +39 -25
  193. package/src/prover/smt/solver/check-logic.ts +330 -0
  194. package/src/prover/smt/solver/clause.ts +0 -1
  195. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  196. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  197. package/src/prover/smt/solver/context.ts +598 -128
  198. package/src/prover/smt/solver/ctx-simplify.ts +29 -14
  199. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  200. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  201. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  202. package/src/prover/smt/solver/demodulator.ts +786 -0
  203. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  204. package/src/prover/smt/solver/der.ts +38 -10
  205. package/src/prover/smt/solver/diff-neq.ts +207 -0
  206. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  207. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  208. package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
  209. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  210. package/src/prover/smt/solver/e-matching.ts +7 -8
  211. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  212. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  213. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  214. package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
  215. package/src/prover/smt/solver/enode.ts +100 -3
  216. package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
  217. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  218. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  219. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  220. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  221. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  222. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  223. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  224. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  225. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  226. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  227. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  228. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  229. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  230. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  231. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  232. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  233. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  234. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  235. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  236. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  237. package/src/prover/smt/solver/expr-ref.ts +0 -1
  238. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  239. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  240. package/src/prover/smt/solver/factor.ts +163 -0
  241. package/src/prover/smt/solver/fd-solver.ts +734 -0
  242. package/src/prover/smt/solver/fingerprints.ts +15 -15
  243. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  244. package/src/prover/smt/solver/flat-literals.ts +0 -1
  245. package/src/prover/smt/solver/fm-tactic.ts +886 -0
  246. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  247. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  248. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  249. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  250. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  251. package/src/prover/smt/solver/goal.ts +178 -15
  252. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  253. package/src/prover/smt/solver/guard-set.ts +219 -0
  254. package/src/prover/smt/solver/hash.ts +0 -1
  255. package/src/prover/smt/solver/hashtable.ts +34 -16
  256. package/src/prover/smt/solver/inf-eps.ts +63 -0
  257. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  258. package/src/prover/smt/solver/internalizer.ts +111 -39
  259. package/src/prover/smt/solver/lackr.ts +381 -0
  260. package/src/prover/smt/solver/lbool.ts +0 -1
  261. package/src/prover/smt/solver/lia2card.ts +268 -0
  262. package/src/prover/smt/solver/lia2pb.ts +154 -0
  263. package/src/prover/smt/solver/literal.ts +0 -1
  264. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  265. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  266. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  267. package/src/prover/smt/solver/lp/containers.ts +7 -2
  268. package/src/prover/smt/solver/lp/core-solver.ts +30 -11
  269. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  270. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  271. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  272. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  273. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  274. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  275. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  276. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  277. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  278. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  279. package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
  280. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  281. package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
  282. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  283. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  284. package/src/prover/smt/solver/lp/nex.ts +2 -2
  285. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  287. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  288. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  290. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  292. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  295. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  296. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  297. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  298. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  299. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  300. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  301. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  302. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  303. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  304. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  305. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  306. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  307. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  308. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  309. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  310. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  311. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  312. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  313. package/src/prover/smt/solver/macro-finder.ts +530 -0
  314. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  315. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  316. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  317. package/src/prover/smt/solver/max-cliques.ts +105 -0
  318. package/src/prover/smt/solver/maxcore.ts +310 -0
  319. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  320. package/src/prover/smt/solver/maxlex.ts +115 -0
  321. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  322. package/src/prover/smt/solver/maxsmt.ts +92 -0
  323. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  324. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  325. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  326. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  327. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  328. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  329. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  330. package/src/prover/smt/solver/model-checker.ts +19 -28
  331. package/src/prover/smt/solver/model-evaluator.ts +190 -12
  332. package/src/prover/smt/solver/model-finder.ts +12 -18
  333. package/src/prover/smt/solver/model-generator.ts +104 -35
  334. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  335. package/src/prover/smt/solver/model-printer.ts +214 -0
  336. package/src/prover/smt/solver/mpf.ts +709 -0
  337. package/src/prover/smt/solver/mus.ts +50 -0
  338. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  339. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  340. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  341. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  342. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  343. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  344. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  345. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  346. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  347. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  348. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  349. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  350. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  351. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  352. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  353. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  354. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  355. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  356. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  357. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  358. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  359. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  360. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  361. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  362. package/src/prover/smt/solver/nlqsat.ts +485 -0
  363. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
  364. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  365. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  366. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  367. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  368. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
  369. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  370. package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
  371. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  372. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  373. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  374. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  375. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  376. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  377. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  378. package/src/prover/smt/solver/nnf.ts +110 -24
  379. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  380. package/src/prover/smt/solver/occf.ts +97 -0
  381. package/src/prover/smt/solver/opt-context.ts +801 -0
  382. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  383. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  384. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  385. package/src/prover/smt/solver/opt-solver.ts +312 -0
  386. package/src/prover/smt/solver/opt-value.ts +55 -0
  387. package/src/prover/smt/solver/optsmt.ts +692 -0
  388. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  389. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  390. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  391. package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
  392. package/src/prover/smt/solver/poly-rewriter.ts +259 -57
  393. package/src/prover/smt/solver/probes.ts +577 -0
  394. package/src/prover/smt/solver/propagate-values.ts +37 -21
  395. package/src/prover/smt/solver/proto-model.ts +648 -19
  396. package/src/prover/smt/solver/pull-quant.ts +28 -12
  397. package/src/prover/smt/solver/purify-arith.ts +634 -0
  398. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +39 -19
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1499 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +829 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +22 -25
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
  422. package/src/prover/smt/solver/rewriter.ts +505 -60
  423. package/src/prover/smt/solver/rlimit.ts +45 -5
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +589 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
  468. package/src/prover/smt/solver/smtlib-script.ts +2136 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  470. package/src/prover/smt/solver/solver.ts +128 -23
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +2176 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
  487. package/src/prover/smt/solver/theory-lra-state.ts +7 -23
  488. package/src/prover/smt/solver/theory-lra.ts +189 -2
  489. package/src/prover/smt/solver/theory-pb.ts +951 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  497. package/src/prover/smt/solver/theory.ts +189 -0
  498. package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
  499. package/src/prover/smt/solver/var-subst.ts +36 -14
  500. package/src/prover/smt/table.ts +3 -2
  501. package/src/prover/smt/types.ts +146 -0
  502. package/src/prover/tlapm/cache.ts +57 -26
  503. package/src/prover/tlapm/tlapm.ts +15 -9
  504. package/src/prover/tlapm-library.ts +3208 -0
  505. package/src/prover/verdict.ts +9 -0
  506. package/src/prover/zenon/check/check.ts +1 -2
  507. package/src/prover/zenon/check/records.ts +1 -1
  508. package/src/prover/zenon/check/relations.ts +2 -1
  509. package/src/prover/zenon/check/rewrites.ts +2 -15
  510. package/src/prover/zenon/check/sets.ts +40 -58
  511. package/src/prover/zenon/check/terms.ts +1 -2
  512. package/src/prover/zenon/decide.ts +10 -7
  513. package/src/prover/zenon/encode.ts +0 -2
  514. package/src/prover/zenon/eqrel.ts +2 -2
  515. package/src/prover/zenon/equality-rules.ts +24 -2
  516. package/src/prover/zenon/expr.ts +28 -2
  517. package/src/prover/zenon/index-table.ts +16 -23
  518. package/src/prover/zenon/isar-case.ts +1 -3
  519. package/src/prover/zenon/isar.ts +37 -39
  520. package/src/prover/zenon/llproof.ts +2 -13
  521. package/src/prover/zenon/mltoll.ts +12 -30
  522. package/src/prover/zenon/node.ts +20 -5
  523. package/src/prover/zenon/parse.ts +9 -8
  524. package/src/prover/zenon/phrase.ts +1 -3
  525. package/src/prover/zenon/proof.ts +0 -2
  526. package/src/prover/zenon/propositional-rules.ts +0 -2
  527. package/src/prover/zenon/rules.ts +2 -3
  528. package/src/prover/zenon/search.ts +11 -19
  529. package/src/prover/zenon/tla/functions.ts +2 -4
  530. package/src/prover/zenon/tla/llproof.ts +9 -13
  531. package/src/prover/zenon/tla/records.ts +1 -8
  532. package/src/prover/zenon/tla/rewrites.ts +0 -2
  533. package/src/prover/zenon/tla/sets.ts +22 -22
  534. package/src/prover/zenon/tla/terms.ts +0 -2
  535. package/src/prover/zenon/tla/tla.ts +7 -8
  536. package/src/resolve.ts +1327 -328
  537. package/src/runtime.ts +25 -2
  538. package/src/sany/builtins.ts +10 -10
  539. package/src/sany/generation.ts +384 -0
  540. package/src/sany/generator-def-entries.ts +297 -0
  541. package/src/sany/generator-definitions.ts +688 -0
  542. package/src/sany/generator-expressions.ts +1123 -0
  543. package/src/sany/generator-proofs.ts +668 -0
  544. package/src/sany/generator.ts +161 -2625
  545. package/src/sany/levels.ts +0 -2
  546. package/src/sany/lexer.ts +32 -23
  547. package/src/sany/linter.ts +0 -2
  548. package/src/sany/modules.ts +4 -2
  549. package/src/sany/nodes.ts +3 -4
  550. package/src/sany/report.ts +3 -6
  551. package/src/sany/selectors.ts +46 -44
  552. package/src/sany/xml.ts +25 -58
  553. package/src/search.ts +513 -165
  554. package/src/simulate.ts +340 -251
  555. package/src/spec-description.ts +48 -55
  556. package/src/standard-definitions.ts +5 -0
  557. package/src/standard-modules.ts +72 -54
  558. package/src/state-graph.ts +0 -2
  559. package/src/subexpressions.ts +564 -138
  560. package/src/substitution-levels.ts +5 -4
  561. package/src/successors.ts +56 -28
  562. package/src/symmetry.ts +4 -3
  563. package/src/tableau.ts +2 -2
  564. package/src/tlc/fingerprint.ts +81 -9
  565. package/src/tlc/jar-data.ts +10 -0
  566. package/src/tlc/messages.ts +23 -18
  567. package/src/tlc/order.ts +14 -3
  568. package/src/tlc/random.ts +6 -5
  569. package/src/tlc/replay.ts +152 -58
  570. package/src/tlc/summary.ts +29 -14
  571. package/src/tlc/tlc-operators.ts +12 -11
  572. package/src/tlc/tlcext-operators.ts +87 -26
  573. package/src/tlc/trace-spec.ts +27 -60
  574. package/src/trace-liveness.ts +529 -0
  575. package/src/typed-tier.ts +6556 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/typescript/types.ts +2 -2
  583. package/src/values.ts +208 -227
  584. package/src/prover/isabelle/isar/statement.ts +0 -52
  585. package/src/prover/smt/solver/z3-license.txt +0 -10
  586. package/src/prover/tlaps-module.ts +0 -510
  587. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,801 @@
1
+ // MaxSMT runs on the SMT core.
2
+ import { SmtUnsupportedError } from "../../../errors";
3
+ import {
4
+ type AstManager,
5
+ FAMILY_BASIC,
6
+ FAMILY_BV,
7
+ FAMILY_PB,
8
+ OP_ADD,
9
+ KIND_APP,
10
+ OP_GE,
11
+ OP_ITE,
12
+ OP_LE,
13
+ OP_MUL,
14
+ OP_EXTRACT,
15
+ OP_UMINUS,
16
+ SORT_BOOL,
17
+ SORT_INT,
18
+ SORT_REAL,
19
+ } from "./ast";
20
+ import { mkNot } from "./ast-util";
21
+ import { mkBvApp } from "./bv-decl-plugin";
22
+ import { Goal } from "./goal";
23
+ import { getPbSum } from "./lia2card";
24
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
25
+ import type { MaxsatContext, MaxsatParams, MaxsatSolver } from "./maxsmt-base";
26
+ import { Maxsmt } from "./maxsmt";
27
+ import { isInNraFragment } from "./opt-nlsat";
28
+ import {
29
+ canReuseNlsatSolver,
30
+ giaPareto,
31
+ ParetoNlsatSolver,
32
+ type ParetoObjective,
33
+ type ParetoSolver,
34
+ } from "./opt-pareto";
35
+ import type { ProtoModel } from "./proto-model";
36
+ import { Rational } from "./rational";
37
+ import { RefVector } from "./ref-vector";
38
+ import { IncSatSolver } from "./sat/inc-sat-solver";
39
+ import { InfEps } from "./inf-eps";
40
+ import { getModelValueBound, OptParetoSolver, OptSolver } from "./opt-solver";
41
+ import { ObjectiveValue } from "./opt-value";
42
+ import { Optsmt, type OptsmtParams } from "./optsmt";
43
+ import { compileInternalTactic, convertModel, type TacticEnvironment } from "./tactic";
44
+
45
+ const NORMALIZER =
46
+ "(and-then (using-params simplify :som true) propagate-values solve-eqs simplify)";
47
+
48
+ const ZERO_ONE_NORMALIZER =
49
+ "(and-then (using-params simplify :som true) propagate-values solve-eqs simplify dt2bv " +
50
+ "(using-params lia2card :compile_equality false) eq2bv simplify)";
51
+
52
+ export const O_MAXIMIZE = 0;
53
+ export const O_MINIMIZE = 1;
54
+ export const O_MAXSMT = 2;
55
+
56
+ export interface OptObjective {
57
+ type: number;
58
+ // The minimized or maximized term, or -1 for soft constraints.
59
+ term: number;
60
+ terms: number[];
61
+ weights: Rational[];
62
+ id: string | null;
63
+ }
64
+
65
+ interface Objective extends OptObjective {
66
+ offset: Rational;
67
+ isNegated: boolean;
68
+ index: number;
69
+ maxsmt: Maxsmt | null;
70
+ }
71
+
72
+ export interface OptOptions {
73
+ priority: string;
74
+ optsmt: OptsmtParams;
75
+ isParetoNlsat: boolean;
76
+ isParetoNlsatReused: boolean;
77
+ paretoMaxLemmas: number;
78
+ hasAssumptions: boolean;
79
+ isSatEnabled: boolean;
80
+ isEliminatingZeroOne: boolean;
81
+ maxsat: MaxsatParams;
82
+ }
83
+
84
+ const isPropositional = (manager: AstManager, expr: number) => {
85
+ const atom = manager.isNot(expr) ? manager.getArg(expr, 0) : expr;
86
+ if (manager.isUninterpretedConst(atom)) return true;
87
+ const seen = new Set<number>();
88
+ const todo = [expr];
89
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
90
+ if (seen.has(current)) continue;
91
+ seen.add(current);
92
+ if (manager.kinds[current] !== KIND_APP) return false;
93
+ if (manager.getFamily(current) !== FAMILY_BASIC && !manager.isUninterpretedConst(current))
94
+ return false;
95
+ manager.pushArgs(current, todo);
96
+ }
97
+ return true;
98
+ };
99
+
100
+ // is_fd: Boolean structure over Boolean and bit-vector constants and bit-vector operations.
101
+ const isFiniteDomain = (manager: AstManager, formulas: readonly number[]) => {
102
+ const seen = new Set<number>();
103
+ const todo = [...formulas];
104
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
105
+ if (seen.has(expr)) continue;
106
+ seen.add(expr);
107
+ if (manager.kinds[expr] !== KIND_APP) return false;
108
+ const family = manager.getFamily(expr);
109
+ const sort = manager.sorts[expr];
110
+ if (
111
+ family !== FAMILY_BASIC &&
112
+ family !== FAMILY_PB &&
113
+ family !== FAMILY_BV &&
114
+ (!manager.isUninterpretedConst(expr) || (sort !== SORT_BOOL && !manager.isBvSort(sort)))
115
+ )
116
+ return false;
117
+ manager.pushArgs(expr, todo);
118
+ }
119
+ return true;
120
+ };
121
+
122
+ const SAT_MAXSAT_ENGINES = new Set([
123
+ "maxres",
124
+ "maxresw",
125
+ "rc2",
126
+ "rc2tot",
127
+ "rc2bin",
128
+ "maxres-bin",
129
+ "maxres-bin-delay",
130
+ "pd-maxres",
131
+ "bcd2",
132
+ "sls",
133
+ ]);
134
+
135
+ export class OptContext {
136
+ private boxModels: ProtoModel[] = [];
137
+ private boxIndex = -1;
138
+ private pareto: ParetoSolver | null = null;
139
+ private internal: Objective[] = [];
140
+ private normalized: ParetoObjective[] = [];
141
+ private normalizedGoal: Goal | null = null;
142
+ private normalizedTerms: RefVector;
143
+ private hiddenDecls: number[] = [];
144
+ private optSolver: OptSolver | null = null;
145
+ private satSolver: IncSatSolver | null = null;
146
+ private optsmt: Optsmt | null = null;
147
+ private rawModel: ProtoModel | null = null;
148
+ private fixedModels = new Map<ProtoModel, ProtoModel>();
149
+ model: ProtoModel | null = null;
150
+ reasonUnknown = "";
151
+
152
+ constructor(
153
+ private manager: AstManager,
154
+ private environment: TacticEnvironment,
155
+ private objectives: readonly OptObjective[],
156
+ ) {
157
+ this.normalizedTerms = new RefVector(manager);
158
+ }
159
+
160
+ private pin(expr: number) {
161
+ this.normalizedTerms.push(expr);
162
+ return expr;
163
+ }
164
+
165
+ private applyConverters(model: ProtoModel) {
166
+ for (const decl of this.hiddenDecls) model.unregisterDecl(decl);
167
+ const goal = this.normalizedGoal;
168
+ return goal === null ? model : convertModel(goal, model);
169
+ }
170
+
171
+ private fixModel(model: ProtoModel) {
172
+ const existing = this.fixedModels.get(model);
173
+ if (existing !== undefined) return existing;
174
+ const fixed = this.applyConverters(model);
175
+ fixed.incRef();
176
+ this.fixedModels.set(model, fixed);
177
+ return fixed;
178
+ }
179
+
180
+ private setModel(model: ProtoModel | null) {
181
+ const fixed = model === null ? model : this.fixModel(model);
182
+ fixed?.incRef();
183
+ this.model?.decRef();
184
+ this.model = fixed;
185
+ }
186
+
187
+ private executePareto() {
188
+ const pareto = this.pareto;
189
+ const optsmt = this.optsmt;
190
+ if (pareto === null || optsmt === null)
191
+ throw new SmtUnsupportedError("pareto optimization without a solver");
192
+ const outcome = giaPareto(
193
+ this.manager,
194
+ pareto,
195
+ this.normalized,
196
+ pareto instanceof ParetoNlsatSolver,
197
+ );
198
+ if (outcome.status !== L_TRUE || outcome.model === null) {
199
+ if (outcome.status === L_UNDEF) this.reasonUnknown = pareto.reasonUnknown;
200
+ pareto.release();
201
+ this.pareto = null;
202
+ return outcome.status;
203
+ }
204
+ this.rawModel = outcome.model;
205
+ this.updateBound(optsmt, true);
206
+ this.updateBound(optsmt, false);
207
+ this.setModel(outcome.model);
208
+ outcome.model.decRef();
209
+ return L_TRUE;
210
+ }
211
+
212
+ // On a pure NRA problem the dominance and blocking constraints go to nlsat, which decides atoms
213
+ // over irrational algebraic numerals that the SMT core does not internalize.
214
+ private mkParetoSolver(solver: OptSolver, hard: readonly number[], options: OptOptions) {
215
+ const manager = this.manager;
216
+ if (!options.isParetoNlsat || options.hasAssumptions) return new OptParetoSolver(solver);
217
+ const terms = [...hard];
218
+ for (const objective of this.internal) {
219
+ if (
220
+ objective.type === O_MAXSMT ||
221
+ manager.sorts[objective.term] !== SORT_REAL ||
222
+ !isInNraFragment(manager, [...hard, objective.term])
223
+ )
224
+ return new OptParetoSolver(solver);
225
+ terms.push(objective.term);
226
+ }
227
+ if (!options.isParetoNlsatReused || !canReuseNlsatSolver(manager, terms))
228
+ throw new SmtUnsupportedError("pareto optimization without incremental nlsat");
229
+ const pareto = new ParetoNlsatSolver(manager, this.environment, options.paretoMaxLemmas);
230
+ for (const form of hard) pareto.assert(form);
231
+ return pareto;
232
+ }
233
+
234
+ getReasonUnknown() {
235
+ if (this.reasonUnknown !== "") return this.reasonUnknown;
236
+ return (this.satSolver ?? this.optSolver)?.reasonUnknown ?? "unknown";
237
+ }
238
+
239
+ optimize(hard: readonly number[], options: OptOptions) {
240
+ if (this.pareto !== null) return this.executePareto();
241
+ if (this.boxIndex !== -1) {
242
+ if (this.boxIndex < this.boxModels.length) {
243
+ this.setModel(this.boxModels[this.boxIndex++]);
244
+ return L_TRUE;
245
+ }
246
+ this.boxIndex = -1;
247
+ return L_FALSE;
248
+ }
249
+ this.release();
250
+ const normalized = this.normalize(hard, options.isEliminatingZeroOne);
251
+ if (normalized.length === 1 && this.manager.isFalse(normalized[0])) return L_FALSE;
252
+ return this.execute(normalized, options);
253
+ }
254
+
255
+ private getMaxsatContext(optSolver: OptSolver, options: OptOptions): MaxsatContext {
256
+ const getSolver = () => this.satSolver ?? optSolver;
257
+ const isSatEnabled = () => this.satSolver !== null;
258
+ const solver: MaxsatSolver = {
259
+ assertExpr: (expr) => getSolver().assertExpr(expr),
260
+ checkSat: (assumptions) => getSolver().check(assumptions),
261
+ getModel: () => getSolver().getModel(),
262
+ getUnsatCore: () => getSolver().getUnsatCore(),
263
+ getNumAssertions: () => getSolver().getAssertions().length,
264
+ findMutexes: (vars) => ({ status: L_TRUE, mutexes: getSolver().findMutexes(vars) }),
265
+ };
266
+ return {
267
+ manager: this.manager,
268
+ params: options.maxsat,
269
+ get isSatEnabled() {
270
+ return isSatEnabled();
271
+ },
272
+ getSolver: () => solver,
273
+ getBaseModel: () => this.rawModel,
274
+ hide: (decl) => {
275
+ this.hiddenDecls.push(decl);
276
+ },
277
+ adjust: (index, value) => this.adjust(index, value),
278
+ addOffset: (index, value) => {
279
+ const objective = this.internal[index];
280
+ objective.offset = objective.isNegated
281
+ ? objective.offset.sub(value)
282
+ : objective.offset.add(value);
283
+ },
284
+ verifyModel: (index, model, value) => this.verifyModel(index, model, value),
285
+ modelUpdated: (model) => {
286
+ this.rawModel = model;
287
+ },
288
+ };
289
+ }
290
+
291
+ private adjust(index: number, value: Rational) {
292
+ const objective = this.internal[index];
293
+ return (objective.isNegated ? value.neg() : value).add(objective.offset);
294
+ }
295
+
296
+ private verifyModel(index: number, model: ProtoModel, value: Rational) {
297
+ const manager = this.manager;
298
+ const term = this.internal[index].term;
299
+ if (term === -1) return true;
300
+ const expected = this.adjust(index, value);
301
+ const copy = model.copy();
302
+ copy.incRef();
303
+ const fixed = this.applyConverters(copy);
304
+ if (fixed !== copy) {
305
+ fixed.incRef();
306
+ copy.decRef();
307
+ }
308
+ const evaluated = fixed.eval(term, true);
309
+ const actual = manager.isNumeral(evaluated)
310
+ ? manager.getRationalValue(evaluated)
311
+ : manager.isBvNumeral(evaluated)
312
+ ? Rational.of(manager.getBvNumeralValue(evaluated))
313
+ : undefined;
314
+ manager.decRef(evaluated);
315
+ fixed.decRef();
316
+ return actual !== undefined && actual.equals(expected);
317
+ }
318
+
319
+ private execute(hard: readonly number[], options: OptOptions) {
320
+ const manager = this.manager;
321
+ this.reasonUnknown = "";
322
+ if (hard.some((form) => manager.hasQuantifierFlags[form]))
323
+ throw new SmtUnsupportedError("optimization with quantified constraints");
324
+ const solver = new OptSolver(manager, this.environment);
325
+ this.optSolver = solver;
326
+ const optsmt = new Optsmt(
327
+ manager,
328
+ this.environment,
329
+ {
330
+ getBaseModel: () => this.rawModel,
331
+ setModel: (model) => {
332
+ this.rawModel = model;
333
+ },
334
+ },
335
+ options.optsmt,
336
+ );
337
+ this.optsmt = optsmt;
338
+ const context = this.getMaxsatContext(solver, options);
339
+ for (const [index, objective] of this.internal.entries()) {
340
+ if (objective.type === O_MAXSMT) {
341
+ const maxsmt = new Maxsmt(context, index);
342
+ objective.maxsmt = maxsmt;
343
+ for (const [termIndex, term] of objective.terms.entries())
344
+ maxsmt.add(term, objective.weights[termIndex]);
345
+ continue;
346
+ }
347
+ const term = objective.term;
348
+ objective.index = optsmt.add(
349
+ objective.type === O_MAXIMIZE
350
+ ? term
351
+ : this.pin(manager.mkApp(OP_UMINUS, [term], manager.sorts[term])),
352
+ );
353
+ }
354
+ this.satSolver = this.updateSolver(hard, options) ? new IncSatSolver(manager, new Map()) : null;
355
+ const checkSolver = this.satSolver ?? solver;
356
+ for (const form of hard) checkSolver.assertExpr(form);
357
+ const checked = checkSolver.check();
358
+ this.rawModel = checked === L_FALSE ? null : checkSolver.getModel();
359
+ const status = checked !== L_FALSE && this.rawModel === null ? L_UNDEF : checked;
360
+ if (status !== L_TRUE) {
361
+ this.setModel(this.rawModel);
362
+ return status;
363
+ }
364
+ optsmt.setup(solver);
365
+ this.updateBound(optsmt, true);
366
+ const count = this.internal.length;
367
+ if (count > 1 && options.priority === "pareto") {
368
+ this.pareto = this.mkParetoSolver(solver, hard, options);
369
+ return this.executePareto();
370
+ }
371
+ const result =
372
+ count === 0
373
+ ? L_TRUE
374
+ : count === 1
375
+ ? this.execute1(optsmt, this.internal[0], true, false)
376
+ : options.priority === "box"
377
+ ? this.executeBox(optsmt)
378
+ : this.executeLex(optsmt, options);
379
+ this.setModel(this.rawModel);
380
+ return result === L_TRUE && checkSolver.wasUnknown ? L_UNDEF : result;
381
+ }
382
+
383
+ // Z3 moves a MaxSAT query over finite domains to the SAT core.
384
+ private updateSolver(hard: readonly number[], options: OptOptions) {
385
+ if (!options.isSatEnabled) return false;
386
+ if (this.internal.some((objective) => objective.type !== O_MAXSMT)) return false;
387
+ const soft = this.internal.flatMap((objective) => objective.terms);
388
+ if (!isFiniteDomain(this.manager, [...soft, ...hard])) return false;
389
+ return SAT_MAXSAT_ENGINES.has(options.maxsat.maxsatEngine) && options.priority !== "pareto";
390
+ }
391
+
392
+ // The model's objective values are lower bounds, or upper bounds.
393
+ private updateBound(optsmt: Optsmt, isLower: boolean) {
394
+ const manager = this.manager;
395
+ const model = this.rawModel;
396
+ if (model === null) return;
397
+ for (const objective of this.internal) {
398
+ if (objective.type === O_MAXSMT) {
399
+ let cost = Rational.zero;
400
+ for (const [index, term] of objective.terms.entries()) {
401
+ const value = model.eval(term, false);
402
+ if (value !== manager.trueExpr) cost = cost.add(objective.weights[index]);
403
+ manager.decRef(value);
404
+ }
405
+ if (isLower) objective.maxsmt?.updateUpper(cost);
406
+ else objective.maxsmt?.updateLower(cost);
407
+ continue;
408
+ }
409
+ const value = model.eval(objective.term, false);
410
+ const bound =
411
+ getModelValueBound(manager, manager.am, value, isLower !== objective.isNegated) ??
412
+ (manager.isBvNumeral(value) ? Rational.of(manager.getBvNumeralValue(value)) : undefined);
413
+ manager.decRef(value);
414
+ if (bound === undefined) continue;
415
+ const adjusted = InfEps.of((objective.isNegated ? bound.neg() : bound).add(objective.offset));
416
+ if (isLower) optsmt.updateLowerBound(objective.index, adjusted);
417
+ else optsmt.updateUpperBound(objective.index, adjusted);
418
+ }
419
+ }
420
+
421
+ private execute1(optsmt: Optsmt, objective: Objective, isCommitted: boolean, isScoped: boolean) {
422
+ return objective.type === O_MAXSMT
423
+ ? this.executeMaxsat(objective, isCommitted, isScoped)
424
+ : this.executeMinMax(optsmt, objective.index, isCommitted, isScoped);
425
+ }
426
+
427
+ private executeMaxsat(objective: Objective, isCommitted: boolean, isScoped: boolean) {
428
+ const solver = this.satSolver ?? this.optSolver;
429
+ const maxsmt = objective.maxsmt;
430
+ if (solver === null || maxsmt === null)
431
+ throw new SmtUnsupportedError("MaxSMT without a solver");
432
+ if (isScoped) solver.push();
433
+ const status = maxsmt.run(isCommitted);
434
+ if (status !== L_FALSE && maxsmt.model !== null) this.rawModel = maxsmt.model;
435
+ if (isScoped) solver.pop(1);
436
+ if (status === L_TRUE && isCommitted) maxsmt.commitAssignment();
437
+ return status;
438
+ }
439
+
440
+ private executeMinMax(optsmt: Optsmt, index: number, isCommitted: boolean, isScoped: boolean) {
441
+ const solver = this.optSolver;
442
+ if (solver === null) throw new SmtUnsupportedError("optimization without a solver");
443
+ if (isScoped) solver.push();
444
+ const result = optsmt.lex(index);
445
+ // A later lexicographic objective cannot be optimized at an unattained real value.
446
+ const isOpen = result === L_TRUE && optsmt.hasOpenBound(index);
447
+ const isBlockingLater = isOpen && isCommitted && this.internal.length > 1;
448
+ if (isBlockingLater)
449
+ this.reasonUnknown =
450
+ "later lexicographic objectives after an unattained nonlinear optimum are not supported";
451
+ const status = isBlockingLater ? L_UNDEF : result;
452
+ const best = optsmt.getBestModel();
453
+ if (status === L_TRUE || (status === L_UNDEF && best !== null)) this.rawModel = best;
454
+ if (isScoped) solver.pop(1);
455
+ if (status === L_TRUE && isCommitted && !isOpen) optsmt.commitAssignment(index);
456
+ return status;
457
+ }
458
+
459
+ private executeLex(optsmt: Optsmt, options: OptOptions) {
460
+ const count = this.internal.length;
461
+ const isScoped =
462
+ options.maxsat.maxsatEngine !== "maxres" ||
463
+ this.internal.some((objective) => objective.type !== O_MAXSMT);
464
+ for (let index = 0; index < count; index++) {
465
+ const objective = this.internal[index];
466
+ const isLast = index + 1 === count;
467
+ const status = this.execute1(optsmt, objective, !isLast, isScoped && !isLast);
468
+ if (status !== L_TRUE) return status;
469
+ const isUnbounded = objective.type !== O_MAXSMT && optsmt.isUnbounded(objective.index, true);
470
+ if (isUnbounded) return isLast ? status : this.executeLexAfterUnbounded(optsmt, index);
471
+ if (!isLast) this.updateBound(optsmt, true);
472
+ }
473
+ return L_TRUE;
474
+ }
475
+
476
+ // Each later arithmetic objective takes the limit of its optima as the unbounded objective
477
+ // grows. A determined limit is committed before the next objective; an interval ends the search,
478
+ // and the later objectives keep their unrestricted intervals.
479
+ private executeLexAfterUnbounded(optsmt: Optsmt, unbounded: number) {
480
+ const count = this.internal.length;
481
+ for (let index = unbounded + 1; index < count; index++) {
482
+ const objective = this.internal[index];
483
+ if (objective.type === O_MAXSMT) return L_TRUE;
484
+ const status = optsmt.lexAfterUnbounded(this.internal[unbounded].index, objective.index);
485
+ const best = optsmt.getBestModel();
486
+ if (best !== null) this.rawModel = best;
487
+ if (status !== L_TRUE) return status;
488
+ if (index + 1 < count) {
489
+ const am = this.manager.am;
490
+ if (!this.getAdjusted(index, true).equals(this.getAdjusted(index, false), am))
491
+ return L_TRUE;
492
+ optsmt.commitAssignment(objective.index);
493
+ }
494
+ }
495
+ return L_TRUE;
496
+ }
497
+
498
+ private executeBox(optsmt: Optsmt) {
499
+ const solver = this.satSolver ?? this.optSolver;
500
+ if (solver === null) throw new SmtUnsupportedError("optimization without a solver");
501
+ this.boxIndex = 1;
502
+ let status = optsmt.box();
503
+ for (const objective of this.internal) {
504
+ if (status !== L_TRUE) break;
505
+ if (objective.type === O_MAXSMT) {
506
+ solver.push();
507
+ status = this.execute1(optsmt, objective, false, false);
508
+ solver.pop(1);
509
+ }
510
+ const boxModel =
511
+ objective.type === O_MAXSMT
512
+ ? this.rawModel
513
+ : (optsmt.models[objective.index] ?? this.rawModel);
514
+ if (boxModel === null) throw new SmtUnsupportedError("a box objective without a model");
515
+ boxModel.incRef();
516
+ this.boxModels.push(boxModel);
517
+ }
518
+ if (status === L_TRUE && this.boxModels.length > 0) this.rawModel = this.boxModels[0];
519
+ return status;
520
+ }
521
+
522
+ private isMulConst(term: number) {
523
+ const manager = this.manager;
524
+ if (manager.isUninterpretedConst(term) || manager.isNumeral(term)) return true;
525
+ if (manager.getOp(term) !== OP_MUL || manager.getNumArgs(term) !== 2) return false;
526
+ const args = manager.getArgs(term);
527
+ return (
528
+ (manager.isNumeral(args[0]) && manager.isUninterpretedConst(args[1])) ||
529
+ (manager.isNumeral(args[1]) && manager.isUninterpretedConst(args[0]))
530
+ );
531
+ }
532
+
533
+ private purify(term: number, hard: number[], goal: Goal) {
534
+ const manager = this.manager;
535
+ const fresh = this.pin(manager.mkFreshConst("obj", manager.sorts[term]));
536
+ const sort = manager.sorts[term];
537
+ if (sort === SORT_INT || sort === SORT_REAL)
538
+ hard.push(
539
+ this.pin(manager.mkApp(OP_GE, [fresh, term], SORT_BOOL)),
540
+ this.pin(manager.mkApp(OP_LE, [fresh, term], SORT_BOOL)),
541
+ );
542
+ else hard.push(this.pin(manager.mkEq(fresh, term)));
543
+ goal.addConverter(manager.decls[fresh]);
544
+ return fresh;
545
+ }
546
+
547
+ private purifyObjective(term: number, hard: number[], goal: Goal) {
548
+ const manager = this.manager;
549
+ if (manager.getOp(term) === OP_ADD)
550
+ return this.pin(
551
+ manager.mkApp(
552
+ OP_ADD,
553
+ manager
554
+ .getArgs(term)
555
+ .map((arg) => (this.isMulConst(arg) ? arg : this.purify(arg, hard, goal))),
556
+ manager.sorts[term],
557
+ ),
558
+ );
559
+ return manager.getOp(term) === OP_ITE || !this.isMulConst(term)
560
+ ? this.purify(term, hard, goal)
561
+ : term;
562
+ }
563
+
564
+ // is_maxsat on a minimized or maximized term: a pseudo-Boolean sum or a bit-vector.
565
+ private getMaxsat(term: number, isMax: boolean) {
566
+ const manager = this.manager;
567
+ const sum = getPbSum(manager, term, this.normalizedTerms);
568
+ if (sum !== undefined) {
569
+ let offset = sum.coeff;
570
+ const terms: number[] = [];
571
+ const weights: Rational[] = [];
572
+ for (const [index, arg] of sum.args.entries()) {
573
+ const weight = sum.coeffs[index];
574
+ const isNegative = weight.isNegative();
575
+ if (isMax) offset = offset.add(isNegative ? weight.neg() : weight);
576
+ else if (isNegative) offset = offset.add(weight);
577
+ terms.push(isNegative === isMax ? this.pin(mkNot(manager, arg)) : arg);
578
+ weights.push(isNegative ? weight.neg() : weight);
579
+ }
580
+ return { terms, weights, offset, isNegated: isMax };
581
+ }
582
+ const sort = manager.sorts[term];
583
+ if (!manager.isBvSort(sort)) return undefined;
584
+ const value = this.pin(manager.mkBvNumeral(isMax ? 1n : 0n, 1));
585
+ const terms: number[] = [];
586
+ const weights: Rational[] = [];
587
+ let offset = Rational.zero;
588
+ for (let bit = 0; bit < manager.getBvSize(sort); bit++) {
589
+ const weight = Rational.of(2n ** BigInt(bit));
590
+ weights.push(weight);
591
+ terms.push(
592
+ this.pin(manager.mkEq(value, this.pin(mkBvApp(manager, OP_EXTRACT, [term], [bit, bit])))),
593
+ );
594
+ if (isMax) offset = offset.add(weight);
595
+ }
596
+ return { terms, weights, offset, isNegated: isMax };
597
+ }
598
+
599
+ private mkAtomic(terms: number[], hard: number[], goal: Goal) {
600
+ return terms.map((term) =>
601
+ isPropositional(this.manager, term) ? term : this.purify(term, hard, goal),
602
+ );
603
+ }
604
+
605
+ private normalize(hard: readonly number[], isEliminatingZeroOne: boolean) {
606
+ const manager = this.manager;
607
+ const goal = new Goal(manager);
608
+ const decls = this.objectives.map((objective) =>
609
+ manager.mkFreshFuncDecl(
610
+ objective.type === O_MAXIMIZE
611
+ ? "maximize"
612
+ : objective.type === O_MINIMIZE
613
+ ? "minimize"
614
+ : "maxsat",
615
+ objective.type === O_MAXSMT
616
+ ? objective.terms.map(() => SORT_BOOL)
617
+ : [manager.sorts[objective.term]],
618
+ SORT_BOOL,
619
+ ),
620
+ );
621
+ for (const form of hard) goal.assert(form);
622
+ for (const [index, objective] of this.objectives.entries())
623
+ goal.assert(
624
+ manager.mkApp(
625
+ decls[index],
626
+ objective.type === O_MAXSMT ? objective.terms : [objective.term],
627
+ SORT_BOOL,
628
+ ),
629
+ );
630
+ const goals = compileInternalTactic(
631
+ this.environment,
632
+ isEliminatingZeroOne ? ZERO_ONE_NORMALIZER : NORMALIZER,
633
+ )(goal);
634
+ if (goals.length !== 1) throw new SmtUnsupportedError("a normalization into several goals");
635
+ const result = goals[0];
636
+ const forms = result.isInconsistent ? [manager.falseExpr] : [...result.forms.items];
637
+ for (const form of forms) this.normalizedTerms.push(form);
638
+ this.normalizedGoal = result;
639
+ const normalizedHard: number[] = [];
640
+ this.internal = this.objectives.map((objective) => ({
641
+ ...objective,
642
+ offset: Rational.zero,
643
+ isNegated: objective.type === O_MINIMIZE,
644
+ index: 0,
645
+ maxsmt: null,
646
+ }));
647
+ for (const form of forms) {
648
+ const index = manager.kinds[form] === KIND_APP ? decls.indexOf(manager.decls[form]) : -1;
649
+ if (index === -1) {
650
+ normalizedHard.push(form);
651
+ continue;
652
+ }
653
+ const objective = this.internal[index];
654
+ const args = manager.getArgs(form);
655
+ if (objective.type === O_MAXSMT) {
656
+ let offset = Rational.zero;
657
+ const terms: number[] = [];
658
+ const weights: Rational[] = [];
659
+ for (const [argIndex, arg] of args.entries()) {
660
+ const weight = objective.weights[argIndex];
661
+ const term = weight.isNegative() ? this.pin(mkNot(manager, arg)) : arg;
662
+ const positive = weight.isNegative() ? weight.neg() : weight;
663
+ if (weight.isNegative()) offset = offset.sub(positive);
664
+ if (manager.isTrue(term) || positive.isZero()) continue;
665
+ if (manager.isFalse(term)) {
666
+ offset = offset.add(positive);
667
+ continue;
668
+ }
669
+ terms.push(term);
670
+ weights.push(positive);
671
+ }
672
+ Object.assign(objective, {
673
+ term: -1,
674
+ terms: this.mkAtomic(terms, normalizedHard, result),
675
+ weights,
676
+ offset,
677
+ isNegated: false,
678
+ });
679
+ continue;
680
+ }
681
+ const term = args[0];
682
+ const isMax = objective.type === O_MAXIMIZE;
683
+ const maxsat = this.getMaxsat(term, isMax);
684
+ if (maxsat !== undefined) {
685
+ Object.assign(objective, {
686
+ type: O_MAXSMT,
687
+ id: null,
688
+ terms: this.mkAtomic(maxsat.terms, normalizedHard, result),
689
+ weights: maxsat.weights,
690
+ offset: maxsat.offset,
691
+ isNegated: maxsat.isNegated,
692
+ });
693
+ continue;
694
+ }
695
+ objective.term = this.purifyObjective(term, normalizedHard, result);
696
+ }
697
+ for (const objective of this.internal)
698
+ if (
699
+ objective.type !== O_MAXSMT &&
700
+ manager.sorts[objective.term] !== SORT_INT &&
701
+ manager.sorts[objective.term] !== SORT_REAL
702
+ )
703
+ objective.term = this.pin(manager.mkNumeral(0n));
704
+ this.normalized = this.internal.map((objective) => ({
705
+ term: objective.term,
706
+ isMax: objective.type === O_MAXIMIZE,
707
+ isMaxsmt: objective.type === O_MAXSMT,
708
+ terms: objective.terms,
709
+ weights: objective.weights,
710
+ }));
711
+ result.forms.reset();
712
+ return normalizedHard;
713
+ }
714
+
715
+ private getAdjusted(index: number, isLower: boolean) {
716
+ const objective = this.internal[index];
717
+ const maxsmt = objective?.maxsmt;
718
+ if (maxsmt !== null && maxsmt !== undefined)
719
+ return new ObjectiveValue(InfEps.of(isLower ? maxsmt.getLower() : maxsmt.getUpper()));
720
+ // Z3 reads the bounds of a solver it never set up, as when the hard constraints are false, as 0.
721
+ if (objective?.type === O_MAXSMT)
722
+ return new ObjectiveValue(InfEps.of(this.adjust(index, Rational.zero)));
723
+ const isMax = this.objectives[index].type === O_MAXIMIZE;
724
+ const optsmt = this.optsmt;
725
+ const value =
726
+ optsmt === null || objective === undefined
727
+ ? new ObjectiveValue(InfEps.of(Rational.zero))
728
+ : (isLower === isMax ? optsmt.lower : optsmt.upper)[objective.index];
729
+ return isMax ? value : value.negated(this.manager.am);
730
+ }
731
+
732
+ private toExpr(value: ObjectiveValue, pinned: RefVector) {
733
+ const manager = this.manager;
734
+ const bound = value.bound;
735
+ const isAlgebraic = value.exact !== null && !manager.am.isRational(value.exact);
736
+ const sort =
737
+ !isAlgebraic && bound.epsilon.isZero() && bound.value.isInt() ? SORT_INT : SORT_REAL;
738
+ const mkConst = (name: string, constSort: number) =>
739
+ manager.mkApp(manager.mkFuncDecl(name, [], constSort), [], constSort);
740
+ const mkScaled = (coefficient: Rational, term: number) =>
741
+ coefficient.equals(Rational.one)
742
+ ? term
743
+ : manager.mkApp(OP_MUL, [manager.mkNumeralOfSort(coefficient, sort), term], sort);
744
+ const args: number[] = [];
745
+ if (!bound.infinity.isZero()) args.push(mkScaled(bound.infinity, mkConst("oo", sort)));
746
+ if (isAlgebraic && value.exact !== null) args.push(manager.mkAlgebraicNumeral(value.exact));
747
+ else if (!bound.value.isZero()) args.push(manager.mkNumeralOfSort(bound.value, sort));
748
+ if (!bound.epsilon.isZero()) args.push(mkScaled(bound.epsilon, mkConst("epsilon", SORT_REAL)));
749
+ const expr =
750
+ args.length === 0
751
+ ? manager.mkNumeral(0n)
752
+ : args.length === 1
753
+ ? args[0]
754
+ : manager.mkApp(OP_ADD, args, sort);
755
+ pinned.push(expr);
756
+ return expr;
757
+ }
758
+
759
+ getObjectives(format: (expr: number) => string) {
760
+ const pinned = new RefVector(this.manager);
761
+ const lines = this.objectives.map((objective, index) => {
762
+ const lower = this.getAdjusted(index, true);
763
+ const upper = this.getAdjusted(index, false);
764
+ const name = objective.type === O_MAXSMT ? (objective.id ?? "") : format(objective.term);
765
+ if (!lower.equals(upper, this.manager.am))
766
+ return ` (${name} (interval ${format(this.toExpr(lower, pinned))} ${format(this.toExpr(upper, pinned))}))`;
767
+ if (lower.exact !== null && !lower.hasInfinitesimal()) {
768
+ const exact = this.manager.mkAlgebraicNumeral(lower.exact);
769
+ pinned.push(exact);
770
+ return ` (${name} ${format(exact)})`;
771
+ }
772
+ return ` (${name} ${format(this.toExpr(lower, pinned))})`;
773
+ });
774
+ pinned.reset();
775
+ return ["(objectives", ...lines, ")"].join("\n");
776
+ }
777
+
778
+ release() {
779
+ for (const objective of this.internal) objective.maxsmt?.release();
780
+ this.internal = [];
781
+ this.optsmt?.release();
782
+ this.optsmt = null;
783
+ this.rawModel = null;
784
+ this.pareto?.release();
785
+ this.pareto = null;
786
+ for (const model of this.boxModels) model.decRef();
787
+ this.boxModels = [];
788
+ this.boxIndex = -1;
789
+ this.setModel(null);
790
+ for (const fixed of this.fixedModels.values()) fixed.decRef();
791
+ this.fixedModels.clear();
792
+ this.hiddenDecls = [];
793
+ this.normalizedGoal = null;
794
+ this.normalizedTerms.reset();
795
+ this.normalized = [];
796
+ this.optSolver?.release();
797
+ this.optSolver = null;
798
+ this.satSolver?.release();
799
+ this.satSolver = null;
800
+ }
801
+ }