tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

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 (625) 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 +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +109 -10
  8. package/dist/index.d.ts +109 -10
  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 +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +45 -59
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +797 -782
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -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 +687 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +323 -658
  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 +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +590 -311
  64. package/src/liveness.ts +180 -124
  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 +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  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 +119 -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 +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  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 +224 -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 +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  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 +31 -74
  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 +1 -44
  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 +0 -2
  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 +1026 -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 +615 -53
  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 +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -1,13 +1,31 @@
1
- // Ported from Z3 (src/smt/smt_context.cpp), MIT license, see z3-license.txt. The SMT kernel's
2
- // search: a CDCL loop over Boolean variables combined with an E-graph for congruence closure,
3
- // relevancy propagation, the arithmetic theory and quantifier instantiation, with Z3's default
4
- // parameters for UFNIA.
5
1
  import type { AssertedFormulas } from "./asserted-formulas";
6
- import { AstManager, FAMILY_ARITH, KIND_APP, KIND_QUANTIFIER, KIND_VAR } from "./ast";
2
+ import {
3
+ AstManager,
4
+ FAMILY_ARITH,
5
+ FAMILY_ARRAY,
6
+ FAMILY_BASIC,
7
+ FAMILY_BV,
8
+ FAMILY_CHAR,
9
+ FAMILY_DATATYPE,
10
+ FAMILY_FINITE_SET,
11
+ FAMILY_FPA,
12
+ FAMILY_PB,
13
+ FAMILY_POLY,
14
+ FAMILY_RECFUN,
15
+ FAMILY_SEQ,
16
+ KIND_APP,
17
+ KIND_QUANTIFIER,
18
+ KIND_VAR,
19
+ OP_IMPLIES,
20
+ OP_ITE,
21
+ OP_NOT,
22
+ SORT_BOOL,
23
+ } from "./ast";
7
24
  import { getCongruenceJustification, isCongruent } from "./cg-table";
8
25
  import { BJustification, type Clause, CLS_LEARNED, CLS_TH_LEMMA, HEADER_SIZE } from "./clause";
9
26
  import { ConflictResolution } from "./conflict-resolution";
10
27
  import { DynAckManager } from "./dyn-ack";
28
+ import { FingerprintSet } from "./fingerprints";
11
29
  import {
12
30
  Enode,
13
31
  EqConflictJustification,
@@ -29,83 +47,128 @@ import {
29
47
  UNDO_TH_VAR,
30
48
  } from "./internalizer";
31
49
  import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
32
- import { BoolVar, getVar, isNegated, Literal, mkLiteral, negate } from "./literal";
50
+ import { MaxCliques } from "./max-cliques";
51
+ import { BoolVar, getVar, isNegated, Literal, mkLiteral, negate, toBoolVar } from "./literal";
52
+ import type { MacroManager } from "./macro-finder";
33
53
  import { mkModel } from "./model-generator";
54
+ import { TheoryRecfun } from "./theory-recfun";
34
55
  import type { GeneratedModel } from "./model-generator";
35
56
  import type { ProtoModel } from "./proto-model";
36
57
  import { DefaultQuantifierManager } from "./quantifier-manager";
58
+ import { FC_CONTINUE, FC_DONE, FC_GIVEUP, Theory } from "./theory";
59
+ import { TheoryArray } from "./theory-array";
60
+ import { TheoryBv } from "./theory-bv";
61
+ import { TheoryFpa } from "./theory-fpa";
62
+ import { TheoryChar } from "./theory-char";
63
+ import { TheorySeq } from "./theory-seq";
64
+ import { TheoryDatatype } from "./theory-datatype";
65
+ import { TheoryFiniteSet } from "./theory-finite-set";
66
+ import { TheoryPb } from "./theory-pb";
67
+ import { TheoryPolymorphism } from "./theory-polymorphism";
37
68
  import { TheoryLra } from "./theory-lra";
38
69
  import { shrink } from "./array";
39
-
40
- export const FC_DONE = 0;
41
- export const FC_CONTINUE = 1;
42
- export const FC_GIVEUP = 2;
70
+ import {
71
+ getSmtConfig,
72
+ PS_ALWAYS_FALSE,
73
+ PS_CACHING_CONSERVATIVE,
74
+ PS_CACHING_CONSERVATIVE2,
75
+ PS_THEORY,
76
+ RS_GEOMETRIC,
77
+ RS_LUBY,
78
+ type SmtSetup,
79
+ } from "./smt-setup";
43
80
 
44
81
  const ACTIVITY_LIMIT = 1e100;
45
82
  const INV_ACTIVITY_LIMIT = 1e-100;
46
83
  const INV_DECAY = 1.052;
47
84
  const RESTART_INITIAL = 100;
48
- const RESTART_FACTOR = 1.1;
49
- // phase_caching_on and phase_caching_off: the numbers of conflicts while phase caching is on and off.
50
85
  const PHASE_CACHING_ON = 400;
51
86
  const PHASE_CACHING_OFF = 100;
52
87
  const AGILITY_FACTOR = 0.9999;
53
- // The LGC_FIXED lemma garbage collection: lemma_gc_initial conflicts between collections, and the
54
- // activity and unassigned literal thresholds of del_inactive_lemmas2.
55
88
  const LEMMA_GC_INITIAL = 5000;
56
- // theory_lra::num_final_check_levels: level 2 also runs nlsat's full check.
57
- const NUM_ARITH_FINAL_CHECK_LEVELS = 2;
58
89
  const NEW_OLD_RATIO = 16;
59
90
  const OLD_CLAUSE_ACTIVITY = 500;
60
91
  const NEW_CLAUSE_RELEVANCY = 45;
61
92
  const OLD_CLAUSE_RELEVANCY = 6;
62
93
  const RESTART_AGILITY_THRESHOLD = 0.18;
63
94
 
95
+ export const MBQI_MAX_ITERATIONS = 1000;
96
+
64
97
  export const CHECK_MODEL_SAT = 0;
65
98
  export const CHECK_MODEL_UNKNOWN = 1;
66
99
  export const CHECK_MODEL_RESTART = 2;
67
100
 
68
- // The reasons a search may stop without an answer that MBQI cares about.
69
101
  const FAILURE_OK = 0;
70
102
  const FAILURE_THEORY = 1;
71
103
  const FAILURE_QUANTIFIERS = 2;
72
104
  const FAILURE_CANCELED = 3;
105
+ const FAILURE_NUM_CONFLICTS = 4;
73
106
 
74
107
  type SearchFailure =
75
108
  | typeof FAILURE_OK
76
109
  | typeof FAILURE_THEORY
77
110
  | typeof FAILURE_QUANTIFIERS
78
- | typeof FAILURE_CANCELED;
79
-
80
- // smt_params: the kernel runs model-based quantifier instantiation with relevancy level 2 and the
81
- // CS_ACTIVITY_DELAY_NEW case split queue. The model checker's auxiliary context runs neither, as Z3
82
- // sets its relevancy level to 0 and its case split strategy to CS_ACTIVITY.
83
- // m_model_generator's model, m_proto_model and m_model. The model generator holds the last model it
84
- // made. From mk_proto_model to reset_model the context holds that model too as its proto model, and
85
- // get_model adds the model the proto model makes.
111
+ | typeof FAILURE_CANCELED
112
+ | typeof FAILURE_NUM_CONFLICTS;
113
+
86
114
  type ModelState =
87
115
  | { kind: "none" }
88
116
  | { kind: "generated"; generated: GeneratedModel }
89
117
  | { kind: "proto"; generated: GeneratedModel }
90
118
  | { kind: "final"; generated: GeneratedModel; model: ProtoModel };
91
119
 
92
- interface SmtParams {
120
+ const THEORY_MAKERS = new Map<number, (context: Context) => Theory>([
121
+ [FAMILY_ARITH, (context) => new TheoryLra(context)],
122
+ [FAMILY_ARRAY, (context) => new TheoryArray(context)],
123
+ [FAMILY_BV, (context) => new TheoryBv(context)],
124
+ [FAMILY_DATATYPE, (context) => new TheoryDatatype(context)],
125
+ [FAMILY_RECFUN, (context) => new TheoryRecfun(context)],
126
+ [FAMILY_SEQ, (context) => new TheorySeq(context)],
127
+ [FAMILY_CHAR, (context) => new TheoryChar(context)],
128
+ [FAMILY_FPA, (context) => new TheoryFpa(context)],
129
+ [FAMILY_FINITE_SET, (context) => new TheoryFiniteSet(context)],
130
+ [FAMILY_POLY, (context) => new TheoryPolymorphism(context)],
131
+ [FAMILY_PB, (context) => new TheoryPb(context)],
132
+ ]);
133
+
134
+ // get_luby
135
+ const getLuby = (index: number): number => {
136
+ if (index === 1) return 1;
137
+ const exponent = Math.log(index + 1) / Math.log(2);
138
+ if (exponent === Math.floor(exponent + 0.5)) return 2 ** (exponent - 1);
139
+ return getLuby(index - 2 ** Math.floor(exponent) + 1);
140
+ };
141
+
142
+ const isValidAssumption = (manager: AstManager, expr: number) => {
143
+ if (manager.sorts[expr] !== SORT_BOOL) return false;
144
+ if (manager.isUninterpretedConst(expr)) return true;
145
+ if (manager.isNot(expr) && manager.isUninterpretedConst(manager.getArg(expr, 0))) return true;
146
+ if (manager.kinds[expr] !== KIND_APP || expr === manager.falseExpr) return false;
147
+ if (expr === manager.trueExpr) return true;
148
+ return manager.getFamily(expr) !== FAMILY_BASIC && manager.getNumArgs(expr) === 0;
149
+ };
150
+
151
+ export interface SmtParams {
93
152
  isMbqi: boolean;
153
+ mbqiMaxIterations: number;
94
154
  relevancyLevel: 0 | 2;
155
+ // The model checker's auxiliary context pretends every array operation is supported.
156
+ isArrayFakeSupport?: boolean;
95
157
  }
96
158
 
97
159
  export class Context extends Internalizer {
98
- // setup_context makes the theories after the first formulas are asserted, so the field starts
99
- // unassigned.
100
- theory!: TheoryLra;
160
+ arith: TheoryLra | undefined;
161
+ setup: SmtSetup | undefined;
162
+ readonly theories: Theory[] = [];
163
+ private theoryByFamily: (Theory | undefined)[] = [];
101
164
  readonly qmanager: DefaultQuantifierManager;
165
+ readonly fingerprints = new FingerprintSet(this.manager);
102
166
  readonly conflictResolution: ConflictResolution = new ConflictResolution(this);
103
167
  private readonly dynAck = new DynAckManager(this);
104
168
  private qhead = 0;
105
169
  private scopeAssignedLimits: number[] = [];
106
170
  private scopeAuxClauseLimits: number[] = [];
107
171
  private scopeTrailLimits: number[] = [];
108
- // The number of lemmas when each user scope began.
109
172
  private baseScopeLemmaLimits: number[] = [];
110
173
  private atomPropagationQueue: Literal[] = [];
111
174
  private thEqQueue: number[] = [];
@@ -113,36 +176,77 @@ export class Context extends Internalizer {
113
176
  private bvarInc = 1;
114
177
  private agility = 0;
115
178
  private numConflicts = 0;
179
+ maxConflicts = Infinity;
116
180
  private numConflictsSinceRestart = 0;
117
181
  private numConflictsSinceLemmaGc = 0;
118
182
  private restartThreshold = RESTART_INITIAL;
119
183
  private restartOuterThreshold = RESTART_INITIAL;
120
184
  private isPhaseCacheOn = true;
121
185
  private phaseCounter = 0;
186
+ private phaseDefault = false;
187
+ private lubyIndex = 1;
122
188
  private finalCheckIndex = 0;
189
+ private literalAssumptions = new Map<Literal, number>();
190
+ unsatCore: number[] = [];
123
191
  private r1ParentGenerations = new Map<Enode, number>();
124
192
  private erasedGenerations = new Map<Enode, number>();
125
193
  private lastSearchFailure: SearchFailure = FAILURE_OK;
194
+ private hasCaseSplit = true;
195
+ private incompleteTheories: Theory[] = [];
126
196
  private modelState: ModelState = { kind: "none" };
197
+ private asserted: AssertedFormulas | undefined;
198
+ macros: MacroManager | undefined;
199
+ hasQuantifiers = false;
127
200
 
128
- constructor(manager: AstManager, params: SmtParams) {
129
- super(manager, params.relevancyLevel > 0, params.relevancyLevel > 0);
201
+ constructor(
202
+ manager: AstManager,
203
+ readonly params: SmtParams,
204
+ ) {
205
+ super(manager, params.relevancyLevel > 0);
130
206
  this.qmanager = new DefaultQuantifierManager(this, params.isMbqi);
131
207
  }
132
208
 
133
- // register_plugin initializes each theory it registers.
134
- setupContext() {
135
- this.theory = new TheoryLra(this);
136
- this.theory.init();
209
+ // setup_context and setup_components. The setup's theories come in its order, then setup_card's.
210
+ setupContext(
211
+ setup: SmtSetup | undefined,
212
+ isUsingStaticFeatures: boolean,
213
+ asserted: AssertedFormulas,
214
+ ) {
215
+ const config = getSmtConfig(
216
+ this.manager,
217
+ setup,
218
+ isUsingStaticFeatures,
219
+ asserted.getFormulas(),
220
+ this.config,
221
+ );
222
+ this.setup = setup;
223
+ this.config = config;
224
+ if (config.relevancyLevel !== undefined) this.relevancy.isEnabled = config.relevancyLevel > 0;
225
+ for (const family of config.theories)
226
+ if (family !== FAMILY_POLY || this.manager.hasTypeVars) this.registerFamily(family);
227
+ this.registerFamily(FAMILY_PB);
228
+ asserted.setup(config);
229
+ }
230
+
231
+ // register_plugin keeps the theory a family already has.
232
+ registerFamily(family: number) {
233
+ if (this.getTheory(family) !== undefined) return;
234
+ const theory = THEORY_MAKERS.get(family)!(this);
235
+ if (theory instanceof TheoryLra) this.arith = theory;
236
+ this.theories.push(theory);
237
+ this.theoryByFamily[theory.id] = theory;
238
+ theory.init();
239
+ for (let level = 0; level < this.scopeLevel; level++) theory.pushScopeEh();
240
+ }
241
+
242
+ getTheory(family: number) {
243
+ return family < 0 ? undefined : this.theoryByFamily[family];
137
244
  }
138
245
 
139
- // The search stops with unknown when the manager's resource limit cancels it.
140
246
  checkCanceled() {
141
247
  return !this.manager.limit.inc();
142
248
  }
143
249
 
144
- // Assignment and propagation.
145
-
146
250
  assign(literal: Literal, justification: BJustification, isDecision = false) {
147
251
  const value = this.assignment[literal];
148
252
  if (value === L_FALSE) this.setConflict(justification, negate(literal));
@@ -157,7 +261,7 @@ export class Context extends Internalizer {
157
261
  this.justifications[boolVar] = justification;
158
262
  this.setLevel(boolVar, this.scopeLevel);
159
263
  const isNegative = isNegated(literal);
160
- if (this.hasBoolVarFlag(boolVar, BV_PHASE_AVAILABLE)) {
264
+ if (this.config.isRestartAdaptive && this.hasBoolVarFlag(boolVar, BV_PHASE_AVAILABLE)) {
161
265
  this.agility *= AGILITY_FACTOR;
162
266
  if (!isDecision && this.hasBoolVarFlag(boolVar, BV_PHASE) === isNegative)
163
267
  this.agility += 1 - AGILITY_FACTOR;
@@ -189,7 +293,6 @@ export class Context extends Internalizer {
189
293
  }
190
294
  const list = this.watches[literal];
191
295
  if (list === undefined) continue;
192
- // Nothing below makes a clause, so the clause data stays in place.
193
296
  const data = this.clauses.data;
194
297
  let kept = 0;
195
298
  let index = 0;
@@ -260,13 +363,13 @@ export class Context extends Internalizer {
260
363
  const lhs = this.exprToEnode[this.manager.getArg(eq, 0)];
261
364
  const rhs = this.exprToEnode[this.manager.getArg(eq, 1)];
262
365
  if (lhs !== undefined && rhs !== undefined) {
263
- if (value === L_TRUE) this.addEq(lhs, rhs, { kind: "equation", literal: literal });
366
+ if (value === L_TRUE) this.addEq(lhs, rhs, { kind: "equation", literal });
264
367
  else if (!this.addDiseq(lhs, rhs) && !this.isInconsistent())
265
368
  this.setConflict(new EqPropagationJustification(lhs, rhs), mkLiteral(boolVar, true));
266
369
  }
267
370
  }
268
371
  } else if (this.hasBoolVarFlag(boolVar, BV_THEORY))
269
- this.theory.assignEh(boolVar, value === L_TRUE);
372
+ this.getTheory(this.getBoolVarTheory(boolVar))?.assignEh(boolVar, value === L_TRUE);
270
373
  else if (this.hasBoolVarFlag(boolVar, BV_QUANTIFIER) && value === L_TRUE)
271
374
  this.qmanager.assignEh(this.boolVar2Expr[boolVar]);
272
375
  if (this.isInconsistent()) return false;
@@ -316,8 +419,14 @@ export class Context extends Internalizer {
316
419
  if (this.manager.kinds[expr] !== KIND_APP) return;
317
420
  const node = this.exprToEnode[expr];
318
421
  if (node !== undefined) this.qmanager.relevantEh(node);
319
- if (this.manager.getFamily(expr) === FAMILY_ARITH || (node !== undefined && node.thVar >= 0))
320
- this.theory.relevantEh(expr);
422
+ const propagated = this.getTheory(this.manager.getFamily(expr));
423
+ propagated?.relevantEh(expr);
424
+ if (node === undefined || node.thVar < 0) return;
425
+ if (this.theoryByFamily[node.thId] !== propagated)
426
+ this.theoryByFamily[node.thId]?.relevantEh(expr);
427
+ for (let cell = node.thNext; cell !== null; cell = cell.next)
428
+ if (this.theoryByFamily[cell.thId] !== propagated)
429
+ this.theoryByFamily[cell.thId]?.relevantEh(expr);
321
430
  }
322
431
 
323
432
  private propagateRelevancy(qhead: number) {
@@ -330,25 +439,38 @@ export class Context extends Internalizer {
330
439
 
331
440
  private propagateThEqs() {
332
441
  const queue = this.thEqQueue;
333
- for (let index = 0; index < queue.length && !this.isInconsistent(); index += 2)
334
- this.theory.newEqEh(queue[index], queue[index + 1]);
442
+ for (let index = 0; index < queue.length && !this.isInconsistent(); index += 3)
443
+ this.theoryByFamily[queue[index]]?.newEqEh(queue[index + 1], queue[index + 2]);
335
444
  this.thEqQueue = [];
336
445
  }
337
446
 
338
447
  private propagateThDiseqs() {
339
448
  const queue = this.thDiseqQueue;
340
- for (let index = 0; index < queue.length && !this.isInconsistent(); index += 2)
341
- this.theory.newDiseqEh(queue[index], queue[index + 1]);
449
+ for (let index = 0; index < queue.length && !this.isInconsistent(); index += 3)
450
+ this.theoryByFamily[queue[index]]?.newDiseqEh(queue[index + 1], queue[index + 2]);
342
451
  this.thDiseqQueue = [];
343
452
  }
344
453
 
454
+ private canTheoriesPropagate() {
455
+ for (const theory of this.theories) if (theory.canPropagate()) return true;
456
+ return false;
457
+ }
458
+
459
+ private propagateTheories() {
460
+ for (const theory of this.theories) {
461
+ theory.propagate();
462
+ if (this.isInconsistent()) return false;
463
+ }
464
+ return true;
465
+ }
466
+
345
467
  canPropagate() {
346
468
  return (
347
469
  this.qhead !== this.assignedLiterals.length ||
348
470
  this.relevancy.canPropagate() ||
349
471
  this.atomPropagationQueue.length > 0 ||
350
472
  this.qmanager.canPropagate() ||
351
- this.theory.canPropagate() ||
473
+ this.canTheoriesPropagate() ||
352
474
  this.eqPropagationQueue.length > 0 ||
353
475
  this.thEqQueue.length > 0 ||
354
476
  this.thDiseqQueue.length > 0
@@ -367,8 +489,7 @@ export class Context extends Internalizer {
367
489
  this.propagateThEqs();
368
490
  this.propagateThDiseqs();
369
491
  if (this.isInconsistent()) return false;
370
- this.theory.propagate();
371
- if (this.isInconsistent()) return false;
492
+ if (!this.propagateTheories()) return false;
372
493
  if (!this.checkCanceled()) this.qmanager.propagate();
373
494
  if (this.isInconsistent()) return false;
374
495
  if (this.isResourceLimitExceeded()) {
@@ -379,11 +500,12 @@ export class Context extends Internalizer {
379
500
  }
380
501
  }
381
502
 
382
- // Equalities.
383
-
384
- private getClosestVar(start: Enode) {
385
- for (let node: Enode | null = start; node !== null; node = node.transTarget)
386
- if (node.thVar >= 0) return node.thVar;
503
+ private getClosestVar(start: Enode, thId: number) {
504
+ if (thId < 0) return -1;
505
+ for (let node: Enode | null = start; node !== null; node = node.transTarget) {
506
+ const thVar = node.getThVar(thId);
507
+ if (thVar >= 0) return thVar;
508
+ }
387
509
  return -1;
388
510
  }
389
511
 
@@ -403,17 +525,19 @@ export class Context extends Internalizer {
403
525
  }
404
526
  }
405
527
 
406
- private pushNewThEq(first: number, second: number) {
407
- this.thEqQueue.push(first, second);
528
+ private pushNewThEq(thId: number, first: number, second: number) {
529
+ this.thEqQueue.push(thId, first, second);
408
530
  }
409
531
 
410
- private pushNewThDiseq(first: number, second: number) {
411
- const theory = this.theory;
532
+ private pushNewThDiseq(thId: number, first: number, second: number) {
533
+ const theory = this.theoryByFamily[thId];
534
+ if (theory === undefined) return;
412
535
  if (theory.getEnode(first).isInterpreted && theory.getEnode(second).isInterpreted) return;
413
- this.thDiseqQueue.push(first, second);
536
+ this.thDiseqQueue.push(thId, first, second);
414
537
  }
415
538
 
416
- private pushNewThDiseqs(root: Enode, thVar: number) {
539
+ private pushNewThDiseqs(root: Enode, thVar: number, thId: number) {
540
+ if (!this.theoryByFamily[thId]?.useDiseqs()) return;
417
541
  for (const parent of root.parents) {
418
542
  if (!parent.isEq) continue;
419
543
  if (this.assignment[mkLiteral(this.getBoolVar(parent.owner))] !== L_FALSE) continue;
@@ -424,10 +548,10 @@ export class Context extends Internalizer {
424
548
  lhs = rhs;
425
549
  rhs = saved;
426
550
  }
427
- const rhsVar = this.getClosestVar(rhs);
428
- const lhsVar = this.getClosestVar(lhs);
551
+ const rhsVar = this.getClosestVar(rhs, thId);
552
+ const lhsVar = this.getClosestVar(lhs, thId);
429
553
  const finalVar = lhsVar >= 0 ? lhsVar : thVar;
430
- if (rhsVar >= 0 && finalVar !== rhsVar) this.pushNewThDiseq(finalVar, rhsVar);
554
+ if (rhsVar >= 0 && finalVar !== rhsVar) this.pushNewThDiseq(thId, finalVar, rhsVar);
431
555
  }
432
556
  }
433
557
 
@@ -435,39 +559,65 @@ export class Context extends Internalizer {
435
559
  const r2 = n2.root;
436
560
  const r1 = n1.root;
437
561
  if (r1.thVar < 0 && r2.thVar < 0) return;
438
- const isFromTheory = justification.kind === "justification";
439
- const v2 = this.getClosestVar(n2);
440
- const v1 = this.getClosestVar(n1);
441
- if (v2 >= 0 && v1 >= 0) {
442
- if (!isFromTheory) this.pushNewThEq(v2, v1);
443
- } else if (v1 < 0 && v2 >= 0) this.pushNewThDiseqs(r1, v2);
444
- else if (v1 >= 0 && v2 < 0) {
445
- r2.thVar = v1;
446
- this.pushNewThDiseqs(r2, v1);
562
+ const fromTheory =
563
+ justification.kind === "justification" ? justification.justification.fromTheory : -1;
564
+ if (r2.thNext === null && r1.thNext === null) {
565
+ const t2 = r2.thId;
566
+ const t1 = r1.thId;
567
+ const v2 = this.getClosestVar(n2, t2);
568
+ const v1 = this.getClosestVar(n1, t1);
569
+ if (v2 >= 0 && v1 >= 0) {
570
+ if (t1 === t2) {
571
+ if (t1 !== fromTheory) this.pushNewThEq(t1, v2, v1);
572
+ return;
573
+ }
574
+ r2.addThVar(v1, t1);
575
+ this.pushNewThDiseqs(r2, v1, t1);
576
+ this.pushNewThDiseqs(r1, v2, t2);
577
+ } else if (v1 < 0 && v2 >= 0) this.pushNewThDiseqs(r1, v2, t2);
578
+ else if (v1 >= 0 && v2 < 0) {
579
+ r2.thVar = v1;
580
+ r2.thId = t1;
581
+ this.pushNewThDiseqs(r2, v1, t1);
582
+ }
583
+ return;
447
584
  }
448
- }
449
-
450
- attachThVar(node: Enode, thVar: number) {
451
- const oldVar = node.thVar;
452
- // A variable that an equality moved to the node's list, which the node's own replaces.
585
+ r2.forEachThVar((t2) => {
586
+ const v2 = this.getClosestVar(n2, t2);
587
+ const v1 = this.getClosestVar(n1, t2);
588
+ if (v1 >= 0) {
589
+ if (t2 !== fromTheory) this.pushNewThEq(t2, v2, v1);
590
+ } else this.pushNewThDiseqs(r1, v2, t2);
591
+ });
592
+ r1.forEachThVar((t1) => {
593
+ const v1 = this.getClosestVar(n1, t1);
594
+ if (r2.getThVar(t1) >= 0) return;
595
+ r2.addThVar(v1, t1);
596
+ this.pushNewThDiseqs(r2, v1, t1);
597
+ });
598
+ }
599
+
600
+ attachThVar(node: Enode, theory: Theory, thVar: number) {
601
+ const thId = theory.id;
602
+ const oldVar = node.getThVar(thId);
453
603
  if (oldVar >= 0) {
454
- node.thVar = thVar;
604
+ node.replaceThVar(thVar, thId);
455
605
  this.pushTrail(() => {
456
- node.thVar = oldVar;
606
+ node.replaceThVar(oldVar, thId);
457
607
  });
458
- this.pushNewThEq(thVar, oldVar);
608
+ this.pushNewThEq(thId, thVar, oldVar);
459
609
  return;
460
610
  }
461
611
  const root = node.root;
462
- const rootVar = root.thVar;
463
- node.thVar = thVar;
464
- this.trailInts.push(thVar);
612
+ const rootVar = root.getThVar(thId);
613
+ node.addThVar(thVar, thId);
614
+ this.trailInts.push(thId);
465
615
  this.trailNodes.push(node);
466
616
  this.trailKinds.push(UNDO_TH_VAR);
467
617
  if (rootVar < 0) {
468
- if (root !== node) root.thVar = thVar;
469
- this.pushNewThDiseqs(root, thVar);
470
- } else if (root !== node) this.pushNewThEq(rootVar, thVar);
618
+ if (root !== node) root.addThVar(thVar, thId);
619
+ this.pushNewThDiseqs(root, thVar, thId);
620
+ } else if (root !== node) this.pushNewThEq(thId, rootVar, thVar);
471
621
  }
472
622
 
473
623
  addEq(inputN1: Enode, inputN2: Enode, justification: EqJustification) {
@@ -524,8 +674,6 @@ export class Context extends Internalizer {
524
674
  }
525
675
  }
526
676
 
527
- // n1 = n2, justified by the justification, implied r1 = r2. A congruence that makes a false
528
- // equality true is the root of a conflict, which dynamic Ackermannization counts.
529
677
  private reinsertParentsIntoCgTable(
530
678
  r1: Enode,
531
679
  r2: Enode,
@@ -582,9 +730,10 @@ export class Context extends Internalizer {
582
730
  }
583
731
  case UNDO_TH_VAR: {
584
732
  const node = this.popTrailNode();
585
- const thVar = this.popTrailInt();
586
- node.thVar = -1;
587
- if (node.root !== node && node.root.thVar === thVar) node.root.thVar = -1;
733
+ const thId = this.popTrailInt();
734
+ const thVar = node.getThVar(thId);
735
+ node.delThVar(thId);
736
+ if (node.root !== node && node.root.getThVar(thId) === thVar) node.root.delThVar(thId);
588
737
  return;
589
738
  }
590
739
  default:
@@ -628,7 +777,12 @@ export class Context extends Internalizer {
628
777
  parent.cg = congruent;
629
778
  if (congruent === parent) parent.generation = generation;
630
779
  }
631
- if (r2.thVar >= 0 && this.theory.getEnode(r2.thVar).root !== r2) r2.thVar = -1;
780
+ if (r2.thNext === null) {
781
+ if (r2.thVar >= 0 && this.theoryByFamily[r2.thId]?.getEnode(r2.thVar).root !== r2) {
782
+ r2.thVar = -1;
783
+ r2.thId = -1;
784
+ }
785
+ } else r2.restoreThVars((thId, thVar) => this.theoryByFamily[thId]?.getEnode(thVar) ?? r2);
632
786
  n1.transTarget = null;
633
787
  this.invertTrans(r1);
634
788
  }
@@ -670,14 +824,38 @@ export class Context extends Internalizer {
670
824
  private addDiseq(n1: Enode, n2: Enode) {
671
825
  const r1 = n1.root;
672
826
  const r2 = n2.root;
673
- if (r1 === r2) return r1.thVar >= 0;
674
- const v1 = this.getClosestVar(n1);
675
- const v2 = this.getClosestVar(n2);
676
- if (v1 >= 0 && v2 >= 0) this.pushNewThDiseq(v1, v2);
827
+ if (r1 === r2) return this.theoryByFamily[r1.thId]?.useDiseqs() ?? false;
828
+ if (r1.thNext === null && r2.thNext === null) {
829
+ const t1 = r1.thId;
830
+ const v1 = this.getClosestVar(n1, t1);
831
+ const v2 = this.getClosestVar(n2, t1);
832
+ if (v1 >= 0 && v2 >= 0 && t1 === r2.thId && this.theoryByFamily[t1]?.useDiseqs())
833
+ this.pushNewThDiseq(t1, v1, v2);
834
+ return true;
835
+ }
836
+ r1.forEachThVar((t1) => {
837
+ if (!this.theoryByFamily[t1]?.useDiseqs()) return;
838
+ const v1 = this.getClosestVar(n1, t1);
839
+ const v2 = this.getClosestVar(n2, t1);
840
+ if (v2 >= 0) this.pushNewThDiseq(t1, v1, v2);
841
+ });
677
842
  return true;
678
843
  }
679
844
 
680
- // Theory combination: assume that two shared terms are equal.
845
+ isShared(node: Enode) {
846
+ const root = node.root;
847
+ if (this.manager.getOp(root.owner) === OP_ITE) return true;
848
+ if (root.thVar < 0) return false;
849
+ if (root.thNext !== null) return true;
850
+ if (this.qmanager.isShared(root)) return true;
851
+ for (const parent of root.parents) {
852
+ const family = this.manager.getFamily(parent.owner);
853
+ if (family === root.thId || family === FAMILY_BASIC) continue;
854
+ if (!this.getTheory(family)?.isBetaRedex(parent, root)) return true;
855
+ }
856
+ return this.getTheory(root.thId)?.isShared(root.thVar) ?? false;
857
+ }
858
+
681
859
  assumeEq(lhs: Enode, rhs: Enode) {
682
860
  if (lhs.root === rhs.root) return false;
683
861
  const eq = this.mkEqAtom(lhs.owner, rhs.owner);
@@ -687,7 +865,10 @@ export class Context extends Internalizer {
687
865
  const boolVar = this.getBoolVar(eq);
688
866
  this.setBoolVarFlag(boolVar, BV_EQ, true);
689
867
  this.setTrueFirstFlag(boolVar);
690
- this.theory.internalizeEqEh(eq);
868
+ this.getTheory(this.manager.getSortFamily(this.manager.sorts[lhs.owner]))?.internalizeEqEh(
869
+ eq,
870
+ boolVar,
871
+ );
691
872
  isNew = true;
692
873
  }
693
874
  const boolVar = this.getBoolVar(eq);
@@ -703,8 +884,6 @@ export class Context extends Internalizer {
703
884
  return isNew;
704
885
  }
705
886
 
706
- // Search.
707
-
708
887
  incBvarActivity(boolVar: BoolVar) {
709
888
  this.activity[boolVar] += this.bvarInc;
710
889
  if (this.activity[boolVar] > ACTIVITY_LIMIT) {
@@ -715,14 +894,15 @@ export class Context extends Internalizer {
715
894
  this.caseSplitQueue.activityIncreased(boolVar);
716
895
  }
717
896
 
718
- private pushScope() {
897
+ pushScope() {
719
898
  this.scopeLevel++;
720
899
  this.scopeAssignedLimits.push(this.assignedLiterals.length);
721
900
  this.scopeAuxClauseLimits.push(this.auxClauses.length);
722
901
  this.scopeTrailLimits.push(this.trailKinds.length);
723
902
  this.relevancy.push();
724
903
  this.qmanager.push();
725
- this.theory.pushScopeEh();
904
+ this.fingerprints.push();
905
+ for (const theory of this.theories) theory.pushScopeEh();
726
906
  }
727
907
 
728
908
  private cacheGenerationOfExpr(expr: number, newLevel: number, visited: Set<number>) {
@@ -780,6 +960,7 @@ export class Context extends Internalizer {
780
960
  const newLevel = this.scopeLevel - numScopes;
781
961
  this.cacheGeneration(newLevel, visited);
782
962
  this.qmanager.pop(numScopes);
963
+ this.fingerprints.pop(numScopes);
783
964
  if (newLevel < this.baseLevel) {
784
965
  this.deleteClauses(this.lemmas, this.baseScopeLemmaLimits[newLevel]);
785
966
  shrink(this.baseScopeLemmaLimits, newLevel);
@@ -789,7 +970,7 @@ export class Context extends Internalizer {
789
970
  this.relevancy.pop(numScopes);
790
971
  this.unassignVars(this.scopeAssignedLimits[newLevel]);
791
972
  this.popTrail(this.scopeTrailLimits[newLevel]);
792
- this.theory.popScopeEh(numScopes);
973
+ for (const theory of this.theories) theory.popScopeEh(numScopes);
793
974
  this.eqPropagationQueue = [];
794
975
  this.thEqQueue = [];
795
976
  this.thDiseqQueue = [];
@@ -807,7 +988,7 @@ export class Context extends Internalizer {
807
988
  return numBoolVars;
808
989
  }
809
990
 
810
- private popScope(numScopes: number) {
991
+ popScope(numScopes: number) {
811
992
  this.popScopeCore(numScopes, new Set());
812
993
  this.cachedGeneration.clear();
813
994
  }
@@ -888,7 +1069,6 @@ export class Context extends Internalizer {
888
1069
  return true;
889
1070
  }
890
1071
 
891
- // is_unit_clause: exactly one literal is unassigned and the rest are false.
892
1072
  private isUnitClause(clause: Clause) {
893
1073
  const store = this.clauses;
894
1074
  let isFound = false;
@@ -903,15 +1083,20 @@ export class Context extends Internalizer {
903
1083
  return isFound;
904
1084
  }
905
1085
 
906
- // guess with PS_CACHING_CONSERVATIVE: the cached phase while phase caching is on, else false.
907
1086
  private guess(boolVar: BoolVar) {
908
1087
  if (this.manager.kinds[this.boolVar2Expr[boolVar]] === KIND_QUANTIFIER) return false;
909
1088
  if (this.hasBoolVarFlag(boolVar, BV_TRUE_FIRST)) return true;
910
- return (
911
- this.isPhaseCacheOn &&
912
- this.hasBoolVarFlag(boolVar, BV_PHASE_AVAILABLE) &&
913
- this.hasBoolVarFlag(boolVar, BV_PHASE)
914
- );
1089
+ const phaseSelection = this.config.phaseSelection;
1090
+ if (phaseSelection === PS_ALWAYS_FALSE) return false;
1091
+ const isPhaseAvailable = this.hasBoolVarFlag(boolVar, BV_PHASE_AVAILABLE);
1092
+ if (phaseSelection === PS_THEORY) {
1093
+ const phase = this.getTheory(this.getBoolVarTheory(boolVar))?.getPhase(boolVar) ?? L_UNDEF;
1094
+ if (phase !== L_UNDEF) return phase === L_TRUE;
1095
+ return isPhaseAvailable ? this.hasBoolVarFlag(boolVar, BV_PHASE) : this.phaseDefault;
1096
+ }
1097
+ return this.isPhaseCacheOn && isPhaseAvailable
1098
+ ? this.hasBoolVarFlag(boolVar, BV_PHASE)
1099
+ : this.phaseDefault;
915
1100
  }
916
1101
 
917
1102
  private updatePhaseCacheCounter() {
@@ -919,18 +1104,27 @@ export class Context extends Internalizer {
919
1104
  if (this.phaseCounter < (this.isPhaseCacheOn ? PHASE_CACHING_ON : PHASE_CACHING_OFF)) return;
920
1105
  this.phaseCounter = 0;
921
1106
  this.isPhaseCacheOn = !this.isPhaseCacheOn;
1107
+ if (this.config.phaseSelection === PS_CACHING_CONSERVATIVE2)
1108
+ this.phaseDefault = !this.phaseDefault;
922
1109
  }
923
1110
 
924
1111
  private decide() {
925
1112
  const boolVar = this.caseSplitQueue.nextCaseSplit();
926
- if (boolVar === undefined) return false;
1113
+ if (boolVar === undefined) {
1114
+ const hadCaseSplit = this.hasCaseSplit;
1115
+ this.pushTrail(() => {
1116
+ this.hasCaseSplit = hadCaseSplit;
1117
+ });
1118
+ this.hasCaseSplit = false;
1119
+ return false;
1120
+ }
927
1121
  const isPositive = this.guess(boolVar);
928
1122
  this.pushScope();
929
1123
  this.assign(mkLiteral(boolVar, !isPositive), "axiom", true);
930
1124
  return true;
931
1125
  }
932
1126
 
933
- private resolveConflict() {
1127
+ resolveConflict() {
934
1128
  this.numConflicts++;
935
1129
  this.numConflictsSinceRestart++;
936
1130
  this.numConflictsSinceLemmaGc++;
@@ -938,9 +1132,15 @@ export class Context extends Internalizer {
938
1132
  this.eqPropagationQueue = [];
939
1133
  this.thEqQueue = [];
940
1134
  this.thDiseqQueue = [];
1135
+ const phaseSelection = this.config.phaseSelection;
941
1136
  const head = this.scopeLevel === 0 ? 0 : this.scopeAssignedLimits[this.scopeLevel - 1];
942
- for (let index = head; index < this.assignedLiterals.length; index++)
943
- this.setBoolVarFlag(getVar(this.assignedLiterals[index]), BV_PHASE_AVAILABLE, false);
1137
+ if (
1138
+ phaseSelection === PS_THEORY ||
1139
+ phaseSelection === PS_CACHING_CONSERVATIVE ||
1140
+ phaseSelection === PS_CACHING_CONSERVATIVE2
1141
+ )
1142
+ for (let index = head; index < this.assignedLiterals.length; index++)
1143
+ this.setBoolVarFlag(getVar(this.assignedLiterals[index]), BV_PHASE_AVAILABLE, false);
944
1144
  const resolution = this.conflictResolution;
945
1145
  if (
946
1146
  this.conflict === null ||
@@ -966,7 +1166,6 @@ export class Context extends Internalizer {
966
1166
  ? negate(this.getLiteral(atoms[index]))
967
1167
  : this.getLiteral(atoms[index]);
968
1168
  }
969
- // restore_relevancy: marking propagates, so it only marks the literals that lost relevancy.
970
1169
  for (let index = 0; index < literals.length; index++)
971
1170
  if (wasRelevant[index] && !this.isRelevant(this.boolVar2Expr[getVar(literals[index])]))
972
1171
  this.markLiteralAsRelevant(literals[index]);
@@ -987,37 +1186,33 @@ export class Context extends Internalizer {
987
1186
  let failure: SearchFailure = FAILURE_OK;
988
1187
  let level = 1;
989
1188
  let maxLevel = 1;
1189
+ this.incompleteTheories = [];
990
1190
  for (;;) {
991
- const isTheory = this.finalCheckIndex === 0;
992
- // Z3 registers every theory for UFNIA, and only arithmetic acts on tlapm's obligations. Of
993
- // the theories between arithmetic and the quantifiers, theory_finite_set makes a set.range
994
- // declaration, and its assume_eqs draws a random value.
995
- if (!isTheory) {
996
- this.manager.initFiniteSetPlugin();
997
- this.getRandomValue();
998
- }
999
- const check = isTheory ? this.theory.finalCheckEh(level) : qmanager.finalCheckEh(true);
1000
- if (isTheory) maxLevel = Math.max(maxLevel, NUM_ARITH_FINAL_CHECK_LEVELS);
1001
- // Z3 reads the cancel flag after each theory's final check, and a canceled check gives up.
1002
- const isCanceled = isTheory && this.checkCanceled();
1191
+ const theory = this.theories[this.finalCheckIndex];
1192
+ const check = theory === undefined ? qmanager.finalCheckEh(true) : theory.finalCheckEh(level);
1193
+ if (theory !== undefined) maxLevel = Math.max(maxLevel, theory.numFinalCheckLevels());
1194
+ const isCanceled = theory === this.arith && this.checkCanceled();
1003
1195
  if (isCanceled) failure = FAILURE_CANCELED;
1004
- else if (isTheory && check === FC_GIVEUP) failure = FAILURE_THEORY;
1005
- this.finalCheckIndex = (this.finalCheckIndex + 1) % 2;
1196
+ else if (theory !== undefined && check === FC_GIVEUP) {
1197
+ failure = FAILURE_THEORY;
1198
+ if (!this.incompleteTheories.includes(theory)) this.incompleteTheories.push(theory);
1199
+ }
1200
+ this.finalCheckIndex = (this.finalCheckIndex + 1) % (this.theories.length + 1);
1006
1201
  if (check === FC_CONTINUE) return FC_CONTINUE;
1007
1202
  if (check === FC_GIVEUP || isCanceled) result = FC_GIVEUP;
1008
1203
  if (this.finalCheckIndex !== oldIndex) continue;
1009
1204
  if (level >= maxLevel || result === FC_DONE || this.canPropagate()) break;
1010
- // A higher level reruns every check with the give-up state of the lower one cleared.
1011
1205
  level++;
1012
1206
  result = FC_DONE;
1013
1207
  failure = FAILURE_OK;
1208
+ this.incompleteTheories = [];
1014
1209
  }
1015
1210
  if (this.canPropagate()) return FC_CONTINUE;
1016
1211
  if (result === FC_GIVEUP && failure !== FAILURE_OK) this.lastSearchFailure = failure;
1017
1212
  return result;
1018
1213
  }
1019
1214
 
1020
- private boundedSearch() {
1215
+ boundedSearch() {
1021
1216
  for (;;) {
1022
1217
  while (!this.propagate()) {
1023
1218
  if (!this.resolveConflict()) return L_FALSE;
@@ -1028,6 +1223,10 @@ export class Context extends Internalizer {
1028
1223
  this.scopeLevel - this.baseLevel > 2
1029
1224
  )
1030
1225
  return L_UNDEF;
1226
+ if (this.numConflicts > this.maxConflicts) {
1227
+ this.lastSearchFailure = FAILURE_NUM_CONFLICTS;
1228
+ return L_UNDEF;
1229
+ }
1031
1230
  }
1032
1231
  if (this.numConflictsSinceLemmaGc > LEMMA_GC_INITIAL) this.delInactiveLemmas();
1033
1232
  this.dynAck.propagateEh();
@@ -1044,15 +1243,13 @@ export class Context extends Internalizer {
1044
1243
  }
1045
1244
  }
1046
1245
 
1047
- // resource_limits_exceeded: while searching, a failure stops the search, and the cancel flag is
1048
- // read twice.
1246
+ // Z3's resource_limits_exceeded reads the cancel flag twice while searching.
1049
1247
  private isResourceLimitExceeded() {
1050
1248
  if (this.isSearching && (this.lastSearchFailure !== FAILURE_OK || this.checkCanceled()))
1051
1249
  return true;
1052
1250
  return this.checkCanceled();
1053
1251
  }
1054
1252
 
1055
- // reset_model: the model generator still holds the proto model.
1056
1253
  private resetModel() {
1057
1254
  const state = this.modelState;
1058
1255
  if (state.kind === "none" || state.kind === "generated") return;
@@ -1061,8 +1258,6 @@ export class Context extends Internalizer {
1061
1258
  this.modelState = { kind: "generated", generated: state.generated };
1062
1259
  }
1063
1260
 
1064
- // mk_proto_model: the model of the current assignment, which the quantifier manager adjusts. The
1065
- // model generator releases the last model first.
1066
1261
  private mkProtoModel() {
1067
1262
  if (this.modelState.kind !== "none") this.modelState.generated.model.decRef();
1068
1263
  const generated = mkModel(this);
@@ -1076,27 +1271,51 @@ export class Context extends Internalizer {
1076
1271
  return generated;
1077
1272
  }
1078
1273
 
1079
- // get_model: the model that the proto model makes, which the caller holds too. add_rec_funs gives
1080
- // each named expression without an interpretation its expression.
1274
+ getLastFailureMessage() {
1275
+ if (this.lastSearchFailure === FAILURE_CANCELED) return "canceled";
1276
+ if (this.lastSearchFailure === FAILURE_NUM_CONFLICTS) return "max-conflicts-reached";
1277
+ if (this.lastSearchFailure === FAILURE_QUANTIFIERS) return "(incomplete quantifiers)";
1278
+ if (this.lastSearchFailure === FAILURE_THEORY)
1279
+ return `(incomplete (theory${this.incompleteTheories.map((theory) => ` ${theory.name}`).join("")}))`;
1280
+ return "unknown";
1281
+ }
1282
+
1283
+ private hasCaseSplits() {
1284
+ if (!this.hasCaseSplit) return false;
1285
+ for (let index = this.numBoolVars; index-- > 0;)
1286
+ if (
1287
+ this.isRelevant(this.boolVar2Expr[index]) &&
1288
+ this.assignment[mkLiteral(toBoolVar(index))] === L_UNDEF
1289
+ )
1290
+ return true;
1291
+ return false;
1292
+ }
1293
+
1294
+ isQuantifierIncomplete() {
1295
+ return this.lastSearchFailure === FAILURE_QUANTIFIERS;
1296
+ }
1297
+
1298
+ // Z3's update_model always answers false, after it recomputes a final state for the next model.
1299
+ updateModel() {
1300
+ if (!this.hasCaseSplits() && this.finalCheck() === FC_DONE) this.resetModel();
1301
+ }
1302
+
1081
1303
  getModel() {
1082
1304
  if (this.modelState.kind === "final") return this.modelState.model;
1083
1305
  const generated =
1084
1306
  this.modelState.kind === "proto" ? this.modelState.generated : this.mkProtoModel();
1085
1307
  const model = generated.model.mkModel();
1086
- for (const entry of this.manager.macros)
1087
- if (!model.constInterps.has(entry[0])) model.registerConst(entry[0], entry[1]);
1308
+ model.addRecFuns();
1088
1309
  model.incRef();
1089
1310
  this.modelState = { kind: "final", generated, model };
1090
1311
  return model;
1091
1312
  }
1092
1313
 
1093
- // validate_model: every relevant ground literal of the assignment holds in the model.
1094
1314
  validateModel(model: ProtoModel) {
1095
1315
  const manager = this.manager;
1096
1316
  for (const literal of this.assignedLiterals) {
1097
1317
  const atom = this.boolVar2Expr[getVar(literal)];
1098
1318
  if (!this.isRelevant(atom)) continue;
1099
- // n and res of Z3's loop hold the literal and its value.
1100
1319
  const expr = isNegated(literal) ? manager.mkNot(atom) : atom;
1101
1320
  manager.incRef(expr);
1102
1321
  const value = manager.isGround(expr) ? model.eval(expr, false) : -1;
@@ -1107,9 +1326,6 @@ export class Context extends Internalizer {
1107
1326
  return true;
1108
1327
  }
1109
1328
 
1110
- // restart: decides whether the search goes on after a bounded search. A candidate model of a
1111
- // problem with quantifiers goes to model-based quantifier instantiation, which may add instances
1112
- // and force a restart.
1113
1329
  private restart(status: number, currentLevel: number): number | undefined {
1114
1330
  const qmanager = this.qmanager;
1115
1331
  this.resetModel();
@@ -1119,7 +1335,7 @@ export class Context extends Internalizer {
1119
1335
  this.lastSearchFailure !== FAILURE_THEORY ||
1120
1336
  status === L_FALSE ||
1121
1337
  this.isInconsistent() ||
1122
- !qmanager.hasQuantifiers() ||
1338
+ qmanager.quantifiers.length === 0 ||
1123
1339
  !qmanager.isModelBased()
1124
1340
  )
1125
1341
  return status;
@@ -1131,7 +1347,7 @@ export class Context extends Internalizer {
1131
1347
  isForcedRestart = true;
1132
1348
  }
1133
1349
  if (status === L_FALSE) return L_FALSE;
1134
- if (status === L_TRUE && !qmanager.hasQuantifiers()) return L_TRUE;
1350
+ if (status === L_TRUE && qmanager.quantifiers.length === 0) return L_TRUE;
1135
1351
  if (status === L_TRUE) {
1136
1352
  const generated = this.mkProtoModel();
1137
1353
  const result = qmanager.isModelBased()
@@ -1143,18 +1359,15 @@ export class Context extends Internalizer {
1143
1359
  return L_UNDEF;
1144
1360
  }
1145
1361
  }
1146
- // inc_limits with RS_IN_OUT_GEOMETRIC.
1147
- if (this.numConflictsSinceRestart >= this.restartThreshold) {
1148
- this.restartThreshold = Math.trunc(this.restartThreshold * RESTART_FACTOR);
1149
- if (this.restartThreshold > this.restartOuterThreshold) {
1150
- this.restartThreshold = RESTART_INITIAL;
1151
- this.restartOuterThreshold = Math.trunc(this.restartOuterThreshold * RESTART_FACTOR);
1152
- }
1153
- }
1154
- this.numConflictsSinceRestart = 0;
1155
- if (isForcedRestart || status === L_TRUE || this.agility < RESTART_AGILITY_THRESHOLD) {
1362
+ this.incLimits();
1363
+ if (
1364
+ isForcedRestart ||
1365
+ status === L_TRUE ||
1366
+ !this.config.isRestartAdaptive ||
1367
+ this.agility < RESTART_AGILITY_THRESHOLD
1368
+ ) {
1156
1369
  if (this.scopeLevel > currentLevel) this.popScope(this.scopeLevel - currentLevel);
1157
- if (!this.isInconsistent()) this.theory.restartEh();
1370
+ for (const theory of this.theories) if (!this.isInconsistent()) theory.restartEh();
1158
1371
  if (!this.isInconsistent()) qmanager.restartEh();
1159
1372
  if (this.isInconsistent()) {
1160
1373
  this.resolveConflict();
@@ -1164,7 +1377,28 @@ export class Context extends Internalizer {
1164
1377
  return undefined;
1165
1378
  }
1166
1379
 
1167
- // can_delete: a lemma that justifies neither of its watched literals.
1380
+ incLimits() {
1381
+ const config = this.config;
1382
+ if (this.numConflictsSinceRestart >= this.restartThreshold) {
1383
+ if (config.restartStrategy === RS_LUBY) {
1384
+ this.lubyIndex++;
1385
+ this.restartThreshold = getLuby(this.lubyIndex) * RESTART_INITIAL;
1386
+ } else {
1387
+ this.restartThreshold = Math.trunc(this.restartThreshold * config.restartFactor);
1388
+ if (
1389
+ config.restartStrategy !== RS_GEOMETRIC &&
1390
+ this.restartThreshold > this.restartOuterThreshold
1391
+ ) {
1392
+ this.restartThreshold = RESTART_INITIAL;
1393
+ this.restartOuterThreshold = Math.trunc(
1394
+ this.restartOuterThreshold * config.restartFactor,
1395
+ );
1396
+ }
1397
+ }
1398
+ }
1399
+ this.numConflictsSinceRestart = 0;
1400
+ }
1401
+
1168
1402
  private isDeletable(clause: Clause) {
1169
1403
  const store = this.clauses;
1170
1404
  if (store.isReinit(clause)) return false;
@@ -1183,8 +1417,6 @@ export class Context extends Internalizer {
1183
1417
  return false;
1184
1418
  }
1185
1419
 
1186
- // del_inactive_lemmas2: deletes the lemmas of the current user scope with low activity and many
1187
- // unassigned literals. The newest sixteenth of them tolerates more unassigned literals.
1188
1420
  private delInactiveLemmas() {
1189
1421
  const lemmas = this.lemmas;
1190
1422
  const startAt = this.baseLevel === 0 ? 0 : this.baseScopeLemmaLimits[this.baseLevel - 1];
@@ -1212,7 +1444,6 @@ export class Context extends Internalizer {
1212
1444
  this.numConflictsSinceLemmaGc = 0;
1213
1445
  }
1214
1446
 
1215
- // push: a user scope, which pop removes with everything asserted in it.
1216
1447
  push() {
1217
1448
  this.popToBaseLevel();
1218
1449
  this.pushScope();
@@ -1226,14 +1457,30 @@ export class Context extends Internalizer {
1226
1457
  this.popScope(numScopes);
1227
1458
  }
1228
1459
 
1229
- // pop_to_base_lvl: undoes the decisions of the last search, before new assertions.
1230
1460
  popToBaseLevel() {
1231
1461
  if (this.scopeLevel > this.baseLevel) this.popScope(this.scopeLevel - this.baseLevel);
1232
1462
  }
1233
1463
 
1234
- // internalize_assertions: the formulas of the asserted formulas, after preprocessing. When they
1235
- // are inconsistent, none is internalized and the context has an axiom conflict.
1464
+ popToSearchLevel() {
1465
+ if (this.scopeLevel > this.searchLevel) this.popScope(this.scopeLevel - this.searchLevel);
1466
+ }
1467
+
1468
+ hasSearchFailure() {
1469
+ return this.lastSearchFailure !== FAILURE_OK;
1470
+ }
1471
+
1472
+ resetConflict() {
1473
+ this.conflict = null;
1474
+ }
1475
+
1476
+ getNumAssertedFormulas() {
1477
+ return this.asserted?.getNumFormulas() ?? 0;
1478
+ }
1479
+
1236
1480
  internalizeAssertions(asserted: AssertedFormulas) {
1481
+ this.asserted = asserted;
1482
+ this.macros = asserted.macros;
1483
+ this.hasQuantifiers = asserted.hasQuantifiers;
1237
1484
  const formulas = asserted.reduce();
1238
1485
  if (asserted.isInconsistent) {
1239
1486
  this.setConflict("axiom", null);
@@ -1245,35 +1492,132 @@ export class Context extends Internalizer {
1245
1492
  }
1246
1493
  }
1247
1494
 
1248
- // init_assumptions: the search runs above a scope where the assumptions hold.
1249
- initAssumptions(assumptions: number[]) {
1495
+ initAssumptions(assumptions: number[], asserted: AssertedFormulas) {
1496
+ this.literalAssumptions.clear();
1497
+ for (const assumption of this.unsatCore) this.manager.decRef(assumption);
1498
+ this.unsatCore = [];
1250
1499
  if (assumptions.length > 0) {
1251
1500
  this.propagate();
1252
1501
  if (this.isInconsistent()) return;
1253
1502
  this.delInactiveLemmas();
1254
1503
  this.pushScope();
1255
- for (const assumption of assumptions) {
1504
+ const manager = this.manager;
1505
+ const proxies = assumptions.map((assumption) => {
1506
+ if (isValidAssumption(manager, assumption)) return assumption;
1507
+ const proxy = manager.mkFreshConst(null, SORT_BOOL);
1508
+ asserted.assertExpr(manager.mkApp(OP_IMPLIES, [proxy, assumption], SORT_BOOL));
1509
+ return proxy;
1510
+ });
1511
+ this.internalizeAssertions(asserted);
1512
+ for (const [index, proxy] of proxies.entries()) {
1256
1513
  if (this.isInconsistent()) break;
1257
- this.internalizeAssertion(assumption, 0);
1514
+ if (proxy === manager.trueExpr) continue;
1515
+ this.internalizeAssertion(proxy, 0);
1516
+ const literal = this.getLiteral(proxy);
1517
+ if (literal === this.trueLiteral || literal === this.falseLiteral) continue;
1518
+ this.literalAssumptions.set(literal, assumptions[index]);
1258
1519
  }
1259
1520
  }
1260
1521
  this.searchLevel = this.scopeLevel;
1261
1522
  }
1262
1523
 
1524
+ addTheoryAssumptions(assumptions: number[]) {
1525
+ for (const theory of this.theories) theory.addTheoryAssumptions(assumptions);
1526
+ }
1527
+
1528
+ checkResearching(asserted: AssertedFormulas, assumptions: readonly number[]) {
1529
+ let result: number;
1530
+ for (;;) {
1531
+ this.popToBaseLevel();
1532
+ this.internalizeAssertions(asserted);
1533
+ const all = [...assumptions];
1534
+ this.addTheoryAssumptions(all);
1535
+ this.initAssumptions(all, asserted);
1536
+ result = this.mkUnsatCore(this.search());
1537
+ if (result !== L_FALSE || this.unsatCore.length === 0) return result;
1538
+ if (!this.theories.some((theory) => theory.shouldResearch(this.unsatCore))) return result;
1539
+ }
1540
+ }
1541
+
1542
+ findMutexes(vars: readonly number[]) {
1543
+ const manager = this.manager;
1544
+ const cliques = new MaxCliques((index) => index ^ 1);
1545
+ const literals: number[] = [];
1546
+ for (const variable of vars) {
1547
+ const isNot = manager.getOp(variable) === OP_NOT;
1548
+ const atom = isNot ? manager.getArg(variable, 0) : variable;
1549
+ const boolVar = this.findBoolVar(atom);
1550
+ if (boolVar !== undefined) literals.push(mkLiteral(boolVar, isNot));
1551
+ }
1552
+ for (let index = 0; index < this.binaryWatches.length; index++)
1553
+ for (const other of this.binaryWatches[index] ?? []) {
1554
+ const source = index ^ 1;
1555
+ if (source < other) cliques.addEdge(source, other);
1556
+ }
1557
+ return cliques.cliques2(literals).map((mutex) =>
1558
+ mutex.map((index) => {
1559
+ const literal = index as Literal;
1560
+ if (literal === this.trueLiteral) return manager.trueExpr;
1561
+ if (literal === this.falseLiteral) return manager.falseExpr;
1562
+ const atom = this.boolVar2Expr[getVar(literal)];
1563
+ return isNegated(literal) ? manager.mkApp(OP_NOT, [atom], SORT_BOOL) : atom;
1564
+ }),
1565
+ );
1566
+ }
1567
+
1568
+ isAssumption(boolVar: BoolVar) {
1569
+ return (
1570
+ this.literalAssumptions.has(mkLiteral(boolVar)) ||
1571
+ this.literalAssumptions.has(mkLiteral(boolVar, true))
1572
+ );
1573
+ }
1574
+
1575
+ isTrackingAssumptions() {
1576
+ return this.literalAssumptions.size > 0 && this.searchLevel > this.baseLevel;
1577
+ }
1578
+
1579
+ mkUnsatCore(result: number) {
1580
+ if (result !== L_FALSE || !this.isTrackingAssumptions()) return result;
1581
+ const literalAssumptions = this.literalAssumptions;
1582
+ const found = new Set<Literal>();
1583
+ const core: number[] = [];
1584
+ for (const literal of this.conflictResolution.unsatCore) {
1585
+ const assumed = literalAssumptions.has(literal) ? literal : negate(literal);
1586
+ const assumption = literalAssumptions.get(assumed);
1587
+ if (assumption === undefined || found.has(assumed)) continue;
1588
+ found.add(assumed);
1589
+ this.manager.incRef(assumption);
1590
+ core.push(assumption);
1591
+ }
1592
+ literalAssumptions.clear();
1593
+ this.popToBaseLevel();
1594
+ this.searchLevel = this.baseLevel;
1595
+ const ids = this.manager.ids;
1596
+ this.unsatCore = core.sort((left, right) => ids[left] - ids[right]);
1597
+ return L_FALSE;
1598
+ }
1599
+
1263
1600
  search() {
1264
- if (this.isInconsistent()) return L_FALSE;
1601
+ if (this.isInconsistent()) {
1602
+ this.resolveConflict();
1603
+ return L_FALSE;
1604
+ }
1265
1605
  this.resetModel();
1266
- this.theory.initSearchEh();
1606
+ for (const theory of this.theories) theory.initSearchEh();
1267
1607
  this.qmanager.initSearchEh();
1268
1608
  this.dynAck.initSearchEh();
1609
+ this.incompleteTheories = [];
1269
1610
  this.numConflicts = 0;
1270
1611
  this.numConflictsSinceRestart = 0;
1271
1612
  this.numConflictsSinceLemmaGc = 0;
1272
1613
  this.restartThreshold = RESTART_INITIAL;
1273
1614
  this.restartOuterThreshold = RESTART_INITIAL;
1274
1615
  this.agility = 0;
1616
+ this.lubyIndex = 1;
1275
1617
  this.finalCheckIndex = 0;
1276
1618
  this.lastSearchFailure = FAILURE_OK;
1619
+ this.phaseDefault = false;
1620
+ if (this.manager.hasTypeVars) this.registerFamily(FAMILY_POLY);
1277
1621
  this.isSearching = true;
1278
1622
  const currentLevel = this.scopeLevel;
1279
1623
  let result: number | undefined;