tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (631) hide show
  1. package/README.md +8 -0
  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 +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +121 -12
  8. package/dist/index.d.ts +121 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1155 -900
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +318 -656
  41. package/src/cli/typescript.ts +0 -3
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +260 -371
  51. package/src/errors.ts +93 -58
  52. package/src/evaluate.ts +848 -374
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +97 -43
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -325
  64. package/src/liveness.ts +224 -131
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +34 -57
  88. package/src/parallel.ts +62 -72
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +129 -38
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +296 -105
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +10 -25
  612. package/src/typescript/collections.ts +34 -35
  613. package/src/typescript/compile.ts +1 -8
  614. package/src/typescript/context.ts +0 -12
  615. package/src/typescript/emit.ts +0 -1
  616. package/src/typescript/expressions.ts +0 -12
  617. package/src/typescript/formula.ts +9 -15
  618. package/src/typescript/functions.ts +6 -17
  619. package/src/typescript/model.ts +14 -16
  620. package/src/typescript/names.ts +0 -2
  621. package/src/typescript/program.ts +0 -3
  622. package/src/typescript/properties.ts +6 -8
  623. package/src/typescript/scope.ts +0 -5
  624. package/src/typescript/steps.ts +20 -28
  625. package/src/typescript/types.ts +3 -10
  626. package/src/values.ts +917 -522
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,951 @@
1
+ import { SmtInvariantError } from "../../../errors";
2
+ import {
3
+ FAMILY_PB,
4
+ OP_AT_LEAST_K,
5
+ OP_AT_MOST_K,
6
+ OP_PB_AUX_BOOL,
7
+ OP_PB_EQ,
8
+ OP_PB_GE,
9
+ OP_PB_LE,
10
+ } from "./ast";
11
+ import { mkNot } from "./ast-util";
12
+ import { BinJustification, CLS_TH_LEMMA } from "./clause";
13
+ import type { Context } from "./context";
14
+ import {
15
+ type Antecedents,
16
+ Justification,
17
+ TheoryJustification,
18
+ UnitResolutionJustification,
19
+ } from "./enode";
20
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
21
+ import {
22
+ type BoolVar,
23
+ FALSE_LITERAL,
24
+ getVar,
25
+ isNegated,
26
+ type Literal,
27
+ mkLiteral,
28
+ negate,
29
+ TRUE_BOOL_VAR,
30
+ TRUE_LITERAL,
31
+ } from "./literal";
32
+ import { getPbCoeff, getPbK, hasUnitCoefficients, mkPbGe } from "./pb-rewriter";
33
+ import { getGcd, Rational } from "./rational";
34
+ import { Theory } from "./theory";
35
+
36
+ interface PbArg {
37
+ lit: Literal;
38
+ coeff: Rational;
39
+ }
40
+
41
+ interface PbArgs {
42
+ items: PbArg[];
43
+ k: Rational;
44
+ }
45
+
46
+ // pb_rewriter_util over literals. Only inequalities reach it: equalities split into two at internalization.
47
+ const unique = (args: PbArgs) => {
48
+ for (const arg of args.items)
49
+ if (isNegated(arg.lit)) {
50
+ arg.lit = negate(arg.lit);
51
+ args.k = args.k.sub(arg.coeff);
52
+ arg.coeff = arg.coeff.neg();
53
+ }
54
+ const kept: PbArg[] = [];
55
+ for (const arg of args.items) {
56
+ if (arg.lit === TRUE_LITERAL) args.k = args.k.sub(arg.coeff);
57
+ else if (arg.lit !== FALSE_LITERAL) kept.push(arg);
58
+ }
59
+ kept.sort((first, second) => first.lit - second.lit);
60
+ const merged: PbArg[] = [];
61
+ for (const arg of kept) {
62
+ const last = merged[merged.length - 1];
63
+ if (last !== undefined && last.lit === arg.lit) last.coeff = last.coeff.add(arg.coeff);
64
+ else merged.push(arg);
65
+ }
66
+ args.items = merged.filter((arg) => !arg.coeff.isZero());
67
+ };
68
+
69
+ const normalize = (args: PbArgs) => {
70
+ let sum = Rational.zero;
71
+ for (const arg of args.items) {
72
+ const coeff = arg.coeff;
73
+ if (coeff.isNegative()) {
74
+ arg.coeff = coeff.neg();
75
+ arg.lit = negate(arg.lit);
76
+ args.k = args.k.sub(coeff);
77
+ }
78
+ sum = sum.add(arg.coeff);
79
+ }
80
+ if (args.k.compare(Rational.zero) <= 0) {
81
+ args.items = [];
82
+ args.k = Rational.zero;
83
+ return L_TRUE;
84
+ }
85
+ if (sum.compare(args.k) < 0) {
86
+ args.items = [];
87
+ args.k = Rational.one;
88
+ return L_FALSE;
89
+ }
90
+ if (!args.items.every((arg) => arg.coeff.isInt())) {
91
+ let lcm = args.k.den;
92
+ for (const arg of args.items) lcm = (lcm * arg.coeff.den) / getGcd(lcm, arg.coeff.den);
93
+ const scale = Rational.of(lcm);
94
+ args.k = args.k.mul(scale);
95
+ for (const arg of args.items) arg.coeff = arg.coeff.mul(scale);
96
+ }
97
+ const k = args.k;
98
+ sum = Rational.zero;
99
+ for (const arg of args.items) {
100
+ if (arg.coeff.compare(k) > 0) arg.coeff = k;
101
+ sum = sum.add(arg.coeff);
102
+ }
103
+ if (sum.equals(k)) {
104
+ for (const arg of args.items) arg.coeff = Rational.one;
105
+ args.k = Rational.of(BigInt(args.items.length));
106
+ }
107
+ let gcd = 0n;
108
+ for (let index = 0; gcd !== 1n && index < args.items.length; index++) {
109
+ const coeff = args.items[index].coeff;
110
+ if (!coeff.equals(args.k)) gcd = gcd === 0n ? coeff.num : getGcd(gcd, coeff.num);
111
+ }
112
+ if (gcd === 0n) {
113
+ for (const arg of args.items) arg.coeff = Rational.one;
114
+ args.k = Rational.one;
115
+ } else if (gcd > 1n) {
116
+ const bound = args.k.num;
117
+ const newK = bound / gcd + (bound % gcd === 0n ? 0n : 1n);
118
+ for (const arg of args.items)
119
+ arg.coeff = Rational.of(arg.coeff.equals(args.k) ? newK : arg.coeff.num / gcd);
120
+ args.k = Rational.of(newK);
121
+ }
122
+ if (!args.k.equals(Rational.one)) {
123
+ let min = args.items[0].coeff;
124
+ let max = min;
125
+ for (const arg of args.items) {
126
+ if (arg.coeff.compare(min) < 0) min = arg.coeff;
127
+ if (arg.coeff.compare(max) > 0) max = arg.coeff;
128
+ }
129
+ const n0 = args.k.div(max);
130
+ const n1 = n0.floor();
131
+ const n2 = args.k.div(min).ceil().sub(Rational.one);
132
+ if (n1.equals(n2) && !n0.isInt()) {
133
+ for (const arg of args.items) arg.coeff = Rational.one;
134
+ args.k = n1.add(Rational.one);
135
+ }
136
+ }
137
+ return L_UNDEF;
138
+ };
139
+
140
+ const prune = (args: PbArgs) => {
141
+ let nlt = Rational.zero;
142
+ let occ = 0;
143
+ for (let index = 0; nlt.compare(args.k) < 0 && index < args.items.length; index++) {
144
+ const coeff = args.items[index].coeff;
145
+ if (coeff.compare(args.k) < 0) {
146
+ nlt = nlt.add(coeff);
147
+ occ++;
148
+ }
149
+ }
150
+ if (occ === 0 || nlt.compare(args.k) >= 0) return;
151
+ const items = args.items;
152
+ for (let index = 0; index < items.length; index++)
153
+ if (items[index].coeff.compare(args.k) < 0) {
154
+ items[index] = items[items.length - 1];
155
+ items.pop();
156
+ index--;
157
+ }
158
+ unique(args);
159
+ normalize(args);
160
+ };
161
+
162
+ const negateArgs = (args: PbArgs) => {
163
+ let sum = Rational.zero;
164
+ for (const arg of args.items) {
165
+ arg.lit = negate(arg.lit);
166
+ sum = sum.add(arg.coeff);
167
+ }
168
+ args.k = sum.sub(args.k).add(Rational.one);
169
+ if (normalize(args) !== L_UNDEF) throw new SmtInvariantError("a negated inequality is trivial");
170
+ };
171
+
172
+ class Ineq {
173
+ args: [PbArgs, PbArgs] = [
174
+ { items: [], k: Rational.zero },
175
+ { items: [], k: Rational.zero },
176
+ ];
177
+ maxWatch = 0n;
178
+ watchSize = 0;
179
+ watchSum = 0n;
180
+
181
+ constructor(public lit: Literal) {}
182
+
183
+ getArgs() {
184
+ return this.args[isNegated(this.lit) ? 1 : 0];
185
+ }
186
+
187
+ getK() {
188
+ return this.getArgs().k.num;
189
+ }
190
+
191
+ getLit(index: number) {
192
+ return this.getArgs().items[index].lit;
193
+ }
194
+
195
+ getCoeff(index: number) {
196
+ return this.getArgs().items[index].coeff.num;
197
+ }
198
+
199
+ get size() {
200
+ return this.getArgs().items.length;
201
+ }
202
+
203
+ swap(first: number, second: number) {
204
+ const items = this.getArgs().items;
205
+ const arg = items[first];
206
+ items[first] = items[second];
207
+ items[second] = arg;
208
+ }
209
+
210
+ findLit(boolVar: BoolVar, begin: number) {
211
+ let index = begin;
212
+ while (getVar(this.getLit(index)) !== boolVar) index++;
213
+ return index;
214
+ }
215
+
216
+ postPrune() {
217
+ const first = this.args[0];
218
+ if (first.items.length === 0) return;
219
+ negateArgs(first);
220
+ negateArgs(first);
221
+ this.args[1] = { items: first.items.map((arg) => ({ ...arg })), k: first.k };
222
+ negateArgs(this.args[1]);
223
+ }
224
+ }
225
+
226
+ class Card {
227
+ args: Literal[] = [];
228
+
229
+ constructor(
230
+ public lit: Literal,
231
+ public k: number,
232
+ ) {}
233
+
234
+ get size() {
235
+ return this.args.length;
236
+ }
237
+
238
+ swap(first: number, second: number) {
239
+ const lit = this.args[first];
240
+ this.args[first] = this.args[second];
241
+ this.args[second] = lit;
242
+ }
243
+
244
+ negate() {
245
+ this.lit = negate(this.lit);
246
+ for (let index = 0; index < this.args.length; index++)
247
+ this.args[index] = negate(this.args[index]);
248
+ this.k = this.args.length - this.k + 1;
249
+ }
250
+
251
+ addArg(lit: Literal) {
252
+ if (lit === FALSE_LITERAL) return;
253
+ if (lit === TRUE_LITERAL) {
254
+ if (this.k > 0) this.k--;
255
+ } else this.args.push(lit);
256
+ }
257
+ }
258
+
259
+ class CardJustification extends Justification {
260
+ constructor(
261
+ readonly fromTheory: number,
262
+ readonly card: Card,
263
+ ) {
264
+ super();
265
+ }
266
+
267
+ getAntecedents(antecedents: Antecedents) {
268
+ const card = this.card;
269
+ antecedents.markLiteral(card.lit);
270
+ for (let index = card.k; index < card.size; index++)
271
+ antecedents.markLiteral(negate(card.args[index]));
272
+ }
273
+ }
274
+
275
+ export class TheoryPb extends Theory {
276
+ readonly name = "pb";
277
+ private ineqs: (Ineq | undefined)[] = [];
278
+ private cards: (Card | undefined)[] = [];
279
+ private ineqWatches: Ineq[][] = [];
280
+ private cardWatches: Card[][] = [];
281
+ private ineqsTrail: BoolVar[] = [];
282
+ private ineqsLim: number[] = [];
283
+ private cardTrail: BoolVar[] = [];
284
+ private cardLim: number[] = [];
285
+ private numMarks = 0;
286
+ private conflictLvl = 0;
287
+ private coeffs: number[] = [];
288
+ private activeVars: BoolVar[] = [];
289
+ private readonly activeVarSet = new Set<BoolVar>();
290
+ private bound = 0;
291
+ private antecedents: Literal[] = [];
292
+
293
+ constructor(context: Context) {
294
+ super(context, FAMILY_PB);
295
+ }
296
+
297
+ internalizeTerm(): boolean {
298
+ throw new SmtInvariantError("theory_pb has no terms");
299
+ }
300
+
301
+ newEqEh() {
302
+ throw new SmtInvariantError("theory_pb has no equalities");
303
+ }
304
+
305
+ newDiseqEh() {}
306
+
307
+ override useDiseqs() {
308
+ return false;
309
+ }
310
+
311
+ override buildModels() {
312
+ return false;
313
+ }
314
+
315
+ internalizeAtom(atom: number) {
316
+ const context = this.context;
317
+ const manager = this.manager;
318
+ if (context.isBInternalized(atom)) return true;
319
+ if (manager.getOp(atom) === OP_PB_AUX_BOOL) {
320
+ context.setVarTheory(context.mkBoolVar(atom), this.id);
321
+ return true;
322
+ }
323
+ if (this.internalizeCard(atom)) return true;
324
+ const boolVar = context.mkBoolVar(atom);
325
+ context.setVarTheory(boolVar, this.id);
326
+ const lit = mkLiteral(boolVar);
327
+ const decl = manager.decls[atom];
328
+ const args = manager.getArgs(atom);
329
+ const op = manager.getOp(atom);
330
+ if (op === OP_PB_EQ) {
331
+ const coeffs = args.map((_value, index) => getPbCoeff(manager, decl, index));
332
+ const sum = coeffs.reduce((total, coeff) => total.add(coeff), Rational.zero);
333
+ const k = getPbK(manager, decl);
334
+ const le = mkPbGe(
335
+ manager,
336
+ coeffs,
337
+ args.map((arg) => mkNot(manager, arg)),
338
+ sum.sub(k),
339
+ );
340
+ const ge = mkPbGe(manager, coeffs, [...args], k);
341
+ context.internalize(le, false);
342
+ context.internalize(ge, false);
343
+ const leLit = context.getLiteral(le);
344
+ const geLit = context.getLiteral(ge);
345
+ context.markLiteralAsRelevant(leLit);
346
+ context.markLiteralAsRelevant(geLit);
347
+ context.mkThAxiom([negate(lit), leLit]);
348
+ context.mkThAxiom([negate(lit), geLit]);
349
+ context.mkThAxiom([negate(leLit), negate(geLit), lit]);
350
+ return true;
351
+ }
352
+ const ineq = new Ineq(lit);
353
+ const first = ineq.args[0];
354
+ first.k = getPbK(manager, decl);
355
+ for (const [index, arg] of args.entries()) {
356
+ const argLit = this.compileArg(arg);
357
+ const coeff = getPbCoeff(manager, decl, index);
358
+ const value = context.getAssignment(argLit);
359
+ if (value === L_TRUE) first.k = first.k.sub(coeff);
360
+ else if (value === L_UNDEF) first.items.push({ lit: argLit, coeff });
361
+ }
362
+ if (op === OP_AT_MOST_K || op === OP_PB_LE) {
363
+ first.k = first.k.neg();
364
+ for (const arg of first.items) {
365
+ arg.lit = negate(arg.lit);
366
+ first.k = first.k.add(arg.coeff);
367
+ }
368
+ }
369
+ unique(first);
370
+ const isTrue = normalize(first);
371
+ prune(first);
372
+ ineq.postPrune();
373
+ if (isTrue !== L_UNDEF) {
374
+ context.mkThAxiom([isTrue === L_FALSE ? negate(lit) : lit]);
375
+ return true;
376
+ }
377
+ if (ineq.getK() === 1n) {
378
+ const lits = [negate(lit)];
379
+ for (let index = 0; index < ineq.size; index++) {
380
+ lits.push(ineq.getLit(index));
381
+ context.mkThAxiom([lit, negate(ineq.getLit(index))]);
382
+ }
383
+ context.mkThAxiom(lits);
384
+ return true;
385
+ }
386
+ this.ineqs[boolVar] = ineq;
387
+ this.ineqsTrail.push(boolVar);
388
+ return true;
389
+ }
390
+
391
+ private compileArg(input: number) {
392
+ const context = this.context;
393
+ const manager = this.manager;
394
+ let isNot = manager.isNot(input);
395
+ const arg = isNot ? manager.getArg(input, 0) : input;
396
+ if (!context.isBInternalized(arg)) context.internalize(arg, false);
397
+ let boolVar = TRUE_BOOL_VAR;
398
+ let hasBoolVar = false;
399
+ if (context.isBInternalized(arg)) {
400
+ boolVar = context.getBoolVar(arg);
401
+ if (manager.isUninterpreted(arg) && context.getBoolVarTheory(boolVar) === -1)
402
+ context.setVarTheory(boolVar, this.id);
403
+ hasBoolVar = context.getBoolVarTheory(boolVar) === this.id;
404
+ } else if (manager.isTrue(arg)) hasBoolVar = true;
405
+ else if (manager.isFalse(arg)) {
406
+ hasBoolVar = true;
407
+ isNot = !isNot;
408
+ }
409
+ if (!hasBoolVar) {
410
+ const proxy = manager.mkPbAuxBool();
411
+ const definition = manager.mkEq(proxy, arg);
412
+ context.internalize(definition, false);
413
+ boolVar = context.getBoolVar(proxy);
414
+ context.mkThAxiom([mkLiteral(context.getBoolVar(definition))]);
415
+ context.markAsRelevant(proxy);
416
+ }
417
+ return mkLiteral(boolVar, isNot);
418
+ }
419
+
420
+ private delWatch(watch: Ineq[], index: number, ineq: Ineq, ineqIndex: number) {
421
+ watch[index] = watch[watch.length - 1];
422
+ watch.pop();
423
+ let coeff = ineq.getCoeff(ineqIndex);
424
+ if (ineqIndex + 1 < ineq.watchSize) ineq.swap(ineqIndex, ineq.watchSize - 1);
425
+ ineq.watchSize--;
426
+ ineq.watchSum -= coeff;
427
+ if (coeff === ineq.maxWatch) {
428
+ coeff = ineq.getCoeff(0);
429
+ for (let position = 1; coeff !== ineq.maxWatch && position < ineq.watchSize; position++)
430
+ if (coeff < ineq.getCoeff(position)) coeff = ineq.getCoeff(position);
431
+ ineq.maxWatch = coeff;
432
+ }
433
+ }
434
+
435
+ private addWatch(ineq: Ineq, index: number) {
436
+ const lit = ineq.getLit(index);
437
+ const coeff = ineq.getCoeff(index);
438
+ ineq.watchSum += coeff;
439
+ if (index > ineq.watchSize) ineq.swap(index, ineq.watchSize);
440
+ ineq.watchSize++;
441
+ if (coeff > ineq.maxWatch) ineq.maxWatch = coeff;
442
+ (this.ineqWatches[lit] ??= []).push(ineq);
443
+ }
444
+
445
+ private unwatchIneq(lit: Literal, ineq: Ineq) {
446
+ const watch = this.ineqWatches[lit];
447
+ if (watch === undefined) return;
448
+ const position = watch.indexOf(ineq);
449
+ if (position === -1) return;
450
+ watch[position] = watch[watch.length - 1];
451
+ watch.pop();
452
+ }
453
+
454
+ private watchCard(lit: Literal, card: Card) {
455
+ (this.cardWatches[lit] ??= []).push(card);
456
+ }
457
+
458
+ private unwatchCard(lit: Literal, card: Card) {
459
+ const watch = this.cardWatches[lit];
460
+ if (watch === undefined) return;
461
+ const position = watch.indexOf(card);
462
+ if (position === -1) return;
463
+ watch[position] = watch[watch.length - 1];
464
+ watch.pop();
465
+ }
466
+
467
+ private isCardinalityConstraint(atom: number) {
468
+ const manager = this.manager;
469
+ const op = manager.getOp(atom);
470
+ return (
471
+ (op === OP_PB_GE && hasUnitCoefficients(manager, manager.decls[atom])) || op === OP_AT_LEAST_K
472
+ );
473
+ }
474
+
475
+ private internalizeCard(atom: number) {
476
+ const context = this.context;
477
+ const manager = this.manager;
478
+ if (context.isBInternalized(atom)) return true;
479
+ if (!this.isCardinalityConstraint(atom)) return false;
480
+ const args = manager.getArgs(atom);
481
+ const boolVar = context.mkBoolVar(atom);
482
+ context.setVarTheory(boolVar, this.id);
483
+ const bound = Number(getPbK(manager, manager.decls[atom]).num);
484
+ const lit = mkLiteral(boolVar);
485
+ if (bound === 0) {
486
+ context.mkThAxiom([lit]);
487
+ return true;
488
+ }
489
+ if (bound > args.length) {
490
+ context.mkThAxiom([negate(lit)]);
491
+ return true;
492
+ }
493
+ const card = new Card(lit, bound);
494
+ for (const arg of args) card.addArg(this.compileArg(arg));
495
+ if (bound === card.size) this.card2conjunction(card);
496
+ else if (card.size === 1) this.card2disjunction(card);
497
+ else {
498
+ this.cards[boolVar] = card;
499
+ this.cardTrail.push(boolVar);
500
+ }
501
+ return true;
502
+ }
503
+
504
+ private card2conjunction(card: Card) {
505
+ const context = this.context;
506
+ const lits = card.args.map((arg) => negate(arg));
507
+ lits.push(card.lit);
508
+ context.mkThAxiom(lits);
509
+ for (const arg of card.args) context.mkThAxiom([negate(card.lit), arg]);
510
+ }
511
+
512
+ private card2disjunction(card: Card) {
513
+ const context = this.context;
514
+ const lits = [...card.args, negate(card.lit)];
515
+ context.mkThAxiom(lits);
516
+ for (const arg of card.args) context.mkThAxiom([card.lit, negate(arg)]);
517
+ }
518
+
519
+ private addCardClause(card: Card, lits: Literal[]) {
520
+ if (!this.resolveConflict(card, lits)) this.context.mkClause(lits, null, CLS_TH_LEMMA);
521
+ }
522
+
523
+ private addCardAssign(card: Card, lit: Literal) {
524
+ const context = this.context;
525
+ if (context.getAssignment(lit) === L_TRUE) return;
526
+ context.assign(lit, new CardJustification(this.id, card));
527
+ }
528
+
529
+ private clearCardWatch(card: Card) {
530
+ const size = Math.min(card.k + 1, card.size);
531
+ for (let index = 0; index < size; index++) this.unwatchCard(card.args[index], card);
532
+ }
533
+
534
+ private setCardConflict(card: Card, lit: Literal) {
535
+ const lits = [negate(card.lit), lit];
536
+ for (let index = card.k; index < card.size; index++) lits.push(card.args[index]);
537
+ this.addCardClause(card, lits);
538
+ }
539
+
540
+ private assignCard(card: Card, alit: Literal) {
541
+ const context = this.context;
542
+ const size = card.size;
543
+ const bound = card.k;
544
+ let index = 0;
545
+ for (; index <= bound; index++) if (card.args[index] === alit) break;
546
+ if (index === bound + 1) return L_UNDEF;
547
+ for (let position = bound + 1; position < size; position++) {
548
+ const lit2 = card.args[position];
549
+ if (context.getAssignment(lit2) !== L_FALSE) {
550
+ card.swap(index, position);
551
+ this.watchCard(lit2, card);
552
+ return L_UNDEF;
553
+ }
554
+ }
555
+ if (bound !== index && context.getAssignment(card.args[bound]) === L_FALSE) {
556
+ this.setCardConflict(card, alit);
557
+ return L_FALSE;
558
+ }
559
+ if (index !== bound) card.swap(index, bound);
560
+ for (let position = 0; position < bound && !context.isInconsistent(); position++)
561
+ this.addCardAssign(card, card.args[position]);
562
+ return context.isInconsistent() ? L_FALSE : L_TRUE;
563
+ }
564
+
565
+ private initCardWatch(card: Card, isTrue: boolean) {
566
+ const context = this.context;
567
+ this.clearCardWatch(card);
568
+ if (isNegated(card.lit) === isTrue) card.negate();
569
+ const size = card.size;
570
+ const bound = card.k;
571
+ if (bound === size) {
572
+ for (let index = 0; index < size && !context.isInconsistent(); index++)
573
+ this.addCardAssign(card, card.args[index]);
574
+ return;
575
+ }
576
+ let next = 0;
577
+ for (let index = 0; index < size; index++)
578
+ if (context.getAssignment(card.args[index]) !== L_FALSE) {
579
+ if (next !== index) card.swap(index, next);
580
+ next++;
581
+ }
582
+ if (next < bound) {
583
+ let alit = card.args[next];
584
+ // The asserting literal has the highest level, so conflict resolution can start from it.
585
+ for (let index = bound; index < size; index++)
586
+ if (context.getAssignLevel(alit) < context.getAssignLevel(card.args[index])) {
587
+ card.swap(next, index);
588
+ alit = card.args[next];
589
+ }
590
+ this.setCardConflict(card, alit);
591
+ } else if (next === bound) {
592
+ for (let index = 0; index < bound && !context.isInconsistent(); index++)
593
+ this.addCardAssign(card, card.args[index]);
594
+ } else for (let index = 0; index <= bound; index++) this.watchCard(card.args[index], card);
595
+ }
596
+
597
+ override assignEh(boolVar: BoolVar, isTrue: boolean) {
598
+ const context = this.context;
599
+ const falseLit = mkLiteral(boolVar, isTrue);
600
+ const ineqs = this.ineqWatches[falseLit];
601
+ if (ineqs !== undefined)
602
+ for (let index = 0; index < ineqs.length; index++)
603
+ if (this.assignWatchGe(boolVar, ineqs, index)) index--;
604
+ const ineq = this.ineqs[boolVar];
605
+ if (ineq !== undefined) this.assignIneq(ineq, isTrue);
606
+ const cards = this.cardWatches[falseLit];
607
+ if (cards !== undefined && cards.length > 0 && !context.isInconsistent()) {
608
+ let next = 0;
609
+ for (let index = 0; index < cards.length; index++) {
610
+ const card = cards[index];
611
+ if (context.getAssignment(card.lit) !== L_TRUE) continue;
612
+ const result = this.assignCard(card, falseLit);
613
+ if (result === L_FALSE) {
614
+ for (; index < cards.length; index++, next++) cards[next] = cards[index];
615
+ cards.length = next;
616
+ return;
617
+ }
618
+ if (result === L_TRUE) cards[next++] = card;
619
+ }
620
+ cards.length = next;
621
+ }
622
+ const card = this.cards[boolVar];
623
+ if (card !== undefined && !context.isInconsistent()) this.initCardWatch(card, isTrue);
624
+ }
625
+
626
+ private getUnhelpfulLiterals(ineq: Ineq, isNegating: boolean) {
627
+ const context = this.context;
628
+ const lits: Literal[] = [];
629
+ for (let index = 0; index < ineq.size; index++) {
630
+ const lit = ineq.getLit(index);
631
+ if (context.getAssignment(lit) === L_FALSE) lits.push(isNegating ? negate(lit) : lit);
632
+ }
633
+ return lits;
634
+ }
635
+
636
+ private assignIneq(ineq: Ineq, isTrue: boolean) {
637
+ const context = this.context;
638
+ if (isNegated(ineq.lit) === isTrue) {
639
+ ineq.lit = negate(ineq.lit);
640
+ context.pushTrail(() => {
641
+ ineq.lit = negate(ineq.lit);
642
+ });
643
+ }
644
+ const size = ineq.size;
645
+ let maxSum = 0n;
646
+ let minInc = 0n;
647
+ for (let index = 0; index < size; index++) {
648
+ const value = context.getAssignment(ineq.getLit(index));
649
+ if (value !== L_FALSE) maxSum += ineq.getCoeff(index);
650
+ if (value === L_UNDEF && (minInc === 0n || minInc > ineq.getCoeff(index)))
651
+ minInc = ineq.getCoeff(index);
652
+ }
653
+ const k = ineq.getK();
654
+ if (maxSum < k) {
655
+ const lits = this.getUnhelpfulLiterals(ineq, false);
656
+ lits.push(negate(ineq.lit));
657
+ context.mkClause(lits, null, CLS_TH_LEMMA);
658
+ } else this.initWatchLiteral(ineq);
659
+ if (maxSum >= k && maxSum - minInc < k) {
660
+ const lits = this.getUnhelpfulLiterals(ineq, true);
661
+ lits.push(ineq.lit);
662
+ for (let index = 0; index < size; index++) {
663
+ const lit = ineq.getLit(index);
664
+ if (context.getAssignment(lit) === L_UNDEF) this.addIneqAssign(lits, lit);
665
+ }
666
+ }
667
+ }
668
+
669
+ private assignWatchGe(boolVar: BoolVar, watch: Ineq[], watchIndex: number) {
670
+ const context = this.context;
671
+ const ineq = watch[watchIndex];
672
+ const position = ineq.findLit(boolVar, 0);
673
+ const k = ineq.getK();
674
+ const kCoeff = k + ineq.getCoeff(position);
675
+ let isAddingMore = ineq.watchSum < kCoeff + ineq.maxWatch;
676
+ for (let index = ineq.watchSize; isAddingMore && index < ineq.size; index++)
677
+ if (context.getAssignment(ineq.getLit(index)) !== L_FALSE) {
678
+ this.addWatch(ineq, index);
679
+ isAddingMore = ineq.watchSum < kCoeff + ineq.maxWatch;
680
+ }
681
+ if (ineq.watchSum < kCoeff) {
682
+ const lits = this.getUnhelpfulLiterals(ineq, false);
683
+ lits.push(negate(ineq.lit));
684
+ context.mkClause(lits, null, CLS_TH_LEMMA);
685
+ return false;
686
+ }
687
+ this.delWatch(watch, watchIndex, ineq, position);
688
+ if (ineq.watchSum < k + ineq.maxWatch) {
689
+ const lits = this.getUnhelpfulLiterals(ineq, true);
690
+ lits.push(ineq.lit);
691
+ const deficit = ineq.watchSum - k;
692
+ for (let index = 0; index < ineq.size; index++)
693
+ if (context.getAssignment(ineq.getLit(index)) === L_UNDEF && deficit < ineq.getCoeff(index))
694
+ this.addIneqAssign(lits, ineq.getLit(index));
695
+ }
696
+ return true;
697
+ }
698
+
699
+ private addIneqAssign(lits: Literal[], lit: Literal) {
700
+ this.context.assign(lit, new TheoryJustification(this.id, [...lits], []));
701
+ }
702
+
703
+ override pushScopeEh() {
704
+ super.pushScopeEh();
705
+ this.ineqsLim.push(this.ineqsTrail.length);
706
+ this.cardLim.push(this.cardTrail.length);
707
+ }
708
+
709
+ override popScopeEh(numScopes: number) {
710
+ let newLim = this.ineqsLim.length - numScopes;
711
+ let size = this.ineqsLim[newLim];
712
+ for (let index = this.ineqsTrail.length - 1; index >= size; index--) {
713
+ const boolVar = this.ineqsTrail[index];
714
+ const ineq = this.ineqs[boolVar];
715
+ if (ineq !== undefined) this.clearIneqWatch(ineq);
716
+ this.ineqs[boolVar] = undefined;
717
+ }
718
+ this.ineqsTrail.length = size;
719
+ this.ineqsLim.length = newLim;
720
+ newLim = this.cardLim.length - numScopes;
721
+ size = this.cardLim[newLim];
722
+ for (let index = this.cardTrail.length - 1; index >= size; index--) {
723
+ const boolVar = this.cardTrail[index];
724
+ const card = this.cards[boolVar];
725
+ if (card !== undefined) this.clearCardWatch(card);
726
+ this.cards[boolVar] = undefined;
727
+ }
728
+ this.cardTrail.length = size;
729
+ this.cardLim.length = newLim;
730
+ super.popScopeEh(numScopes);
731
+ }
732
+
733
+ private clearIneqWatch(ineq: Ineq) {
734
+ for (let index = 0; index < ineq.size; index++) this.unwatchIneq(ineq.getLit(index), ineq);
735
+ ineq.watchSum = 0n;
736
+ ineq.watchSize = 0;
737
+ ineq.maxWatch = 0n;
738
+ }
739
+
740
+ private initWatchLiteral(ineq: Ineq) {
741
+ ineq.watchSum = 0n;
742
+ ineq.watchSize = 0;
743
+ ineq.maxWatch = 0n;
744
+ let isWatchingMore = true;
745
+ for (let index = 0; isWatchingMore && index < ineq.size; index++)
746
+ if (this.context.getAssignment(ineq.getLit(index)) !== L_FALSE) {
747
+ this.addWatch(ineq, index);
748
+ isWatchingMore = ineq.watchSum < ineq.getK() + ineq.maxWatch;
749
+ }
750
+ this.context.pushTrail(() => {
751
+ for (let index = 0; index < ineq.watchSize; index++)
752
+ this.unwatchIneq(ineq.getLit(index), ineq);
753
+ ineq.watchSize = 0;
754
+ ineq.watchSum = 0n;
755
+ ineq.maxWatch = 0n;
756
+ });
757
+ }
758
+
759
+ private getCoeffOf(boolVar: BoolVar) {
760
+ return this.coeffs[boolVar] ?? 0;
761
+ }
762
+
763
+ private getAbsCoeff(boolVar: BoolVar) {
764
+ return Math.abs(this.getCoeffOf(boolVar));
765
+ }
766
+
767
+ private resetCoeffs() {
768
+ for (const boolVar of this.activeVars) this.coeffs[boolVar] = 0;
769
+ this.activeVars = [];
770
+ }
771
+
772
+ private processAntecedent(lit: Literal, offset: number) {
773
+ const context = this.context;
774
+ const boolVar = getVar(lit);
775
+ const level = context.getAssignLevel(lit);
776
+ if (level > context.baseLevel && !context.isMarked(boolVar) && level === this.conflictLvl) {
777
+ context.setMark(boolVar, true);
778
+ this.numMarks++;
779
+ }
780
+ this.incCoeff(lit, offset);
781
+ }
782
+
783
+ private processCard(card: Card, offset: number) {
784
+ for (let index = card.k; index < card.size; index++)
785
+ this.processAntecedent(card.args[index], offset);
786
+ for (let index = 0; index < card.k; index++) this.incCoeff(card.args[index], offset);
787
+ if (this.context.getAssignLevel(card.lit) > this.context.baseLevel)
788
+ this.antecedents.push(card.lit);
789
+ }
790
+
791
+ // Z3 never raises the level it compares against from 0, so this picks the last false active
792
+ // literal, not the one with the highest level.
793
+ private getAssertingLiteral(input: Literal) {
794
+ const context = this.context;
795
+ const boolVar = getVar(input);
796
+ if (
797
+ context.getAssignment(input) === L_FALSE &&
798
+ this.getAbsCoeff(boolVar) !== 0 &&
799
+ input === mkLiteral(boolVar, this.getCoeffOf(boolVar) < 0)
800
+ )
801
+ return input;
802
+ let lit = input;
803
+ for (const active of this.activeVars) {
804
+ const candidate = mkLiteral(active, this.getCoeffOf(active) < 0);
805
+ if (context.getAssignment(candidate) === L_FALSE && context.getAssignLevel(candidate) > 0)
806
+ lit = candidate;
807
+ }
808
+ return lit;
809
+ }
810
+
811
+ private normalizeActiveCoeffs() {
812
+ this.activeVarSet.clear();
813
+ let next = 0;
814
+ for (const boolVar of this.activeVars)
815
+ if (!this.activeVarSet.has(boolVar) && this.getCoeffOf(boolVar) !== 0) {
816
+ this.activeVarSet.add(boolVar);
817
+ this.activeVars[next++] = boolVar;
818
+ }
819
+ this.activeVars.length = next;
820
+ }
821
+
822
+ private incCoeff(lit: Literal, offset: number) {
823
+ const boolVar = getVar(lit);
824
+ const coeff0 = this.getCoeffOf(boolVar);
825
+ if (coeff0 === 0) this.activeVars.push(boolVar);
826
+ const inc = isNegated(lit) ? -offset : offset;
827
+ const coeff1 = inc + coeff0;
828
+ this.coeffs[boolVar] = coeff1;
829
+ if (coeff0 > 0 && inc < 0) this.bound -= coeff0 - Math.max(0, coeff1);
830
+ else if (coeff0 < 0 && inc > 0) this.bound -= Math.min(0, coeff1) - coeff0;
831
+ }
832
+
833
+ private cut() {
834
+ let gcd = 0;
835
+ for (let index = 0; gcd !== 1 && index < this.activeVars.length; index++) {
836
+ const boolVar = this.activeVars[index];
837
+ let coeff = this.getAbsCoeff(boolVar);
838
+ if (coeff === 0) continue;
839
+ if (this.bound < coeff) {
840
+ this.coeffs[boolVar] = this.getCoeffOf(boolVar) > 0 ? this.bound : -this.bound;
841
+ coeff = this.bound;
842
+ }
843
+ gcd = gcd === 0 ? coeff : Number(getGcd(BigInt(gcd), BigInt(coeff)));
844
+ }
845
+ if (gcd < 2) return;
846
+ this.normalizeActiveCoeffs();
847
+ for (const boolVar of this.activeVars)
848
+ this.coeffs[boolVar] = Math.trunc(this.coeffs[boolVar] / gcd);
849
+ // The bound is added to the unsigned divisor as an unsigned number.
850
+ this.bound = Math.floor(((this.bound + gcd - 1) >>> 0) / gcd) | 0;
851
+ }
852
+
853
+ private resolveConflict(card: Card, conflict: Literal[]) {
854
+ const context = this.context;
855
+ this.conflictLvl = 0;
856
+ for (const lit of conflict)
857
+ this.conflictLvl = Math.max(this.conflictLvl, context.getAssignLevel(lit));
858
+ if (
859
+ this.conflictLvl < context.getAssignLevel(card.lit) ||
860
+ this.conflictLvl === context.baseLevel
861
+ )
862
+ return false;
863
+ this.resetCoeffs();
864
+ this.numMarks = 0;
865
+ this.bound = card.k;
866
+ this.antecedents = [];
867
+ this.processCard(card, 1);
868
+ const lits = context.assignedLiterals;
869
+ let index = lits.length - 1;
870
+ let consequent = negate(conflict[2]);
871
+ const clearMarks = () => {
872
+ while (this.numMarks > 0 && index > 0) {
873
+ const boolVar = getVar(lits[index]);
874
+ if (context.isMarked(boolVar)) context.setMark(boolVar, false);
875
+ index--;
876
+ }
877
+ };
878
+ while (this.numMarks > 0) {
879
+ const offset = this.getAbsCoeff(getVar(consequent));
880
+ if (offset > 1000) {
881
+ clearMarks();
882
+ return false;
883
+ }
884
+ if (offset !== 0) {
885
+ const justification = context.justifications[getVar(consequent)];
886
+ let bound = 1;
887
+ if (justification instanceof Justification) {
888
+ if (justification.fromTheory === this.id && justification instanceof CardJustification) {
889
+ this.processCard(justification.card, offset);
890
+ bound = justification.card.k;
891
+ } else bound = 0;
892
+ } else if (justification instanceof BinJustification) {
893
+ this.incCoeff(consequent, offset);
894
+ this.processAntecedent(negate(justification.literal), offset);
895
+ } else if (justification === null || justification === "axiom") bound = 0;
896
+ else {
897
+ this.incCoeff(consequent, offset);
898
+ const clauses = context.clauses;
899
+ const clauseJustification = clauses.getJustification(justification);
900
+ if (clauseJustification instanceof UnitResolutionJustification) {
901
+ clearMarks();
902
+ return false;
903
+ }
904
+ if (clauseJustification === null) {
905
+ const numLiterals = clauses.getNumLiterals(justification);
906
+ this.processAntecedent(
907
+ clauses.getLiteral(
908
+ justification,
909
+ clauses.getLiteral(justification, 0) === consequent ? 1 : 0,
910
+ ),
911
+ offset,
912
+ );
913
+ for (let position = 2; position < numLiterals; position++)
914
+ this.processAntecedent(clauses.getLiteral(justification, position), offset);
915
+ }
916
+ }
917
+ this.bound += offset * bound;
918
+ this.cut();
919
+ }
920
+ for (;;) {
921
+ consequent = lits[index];
922
+ if (context.isMarked(getVar(consequent))) break;
923
+ index--;
924
+ }
925
+ context.setMark(getVar(consequent), false);
926
+ index--;
927
+ this.numMarks--;
928
+ }
929
+ this.normalizeActiveCoeffs();
930
+ if (this.bound > 0 && this.activeVars.length === 0) return false;
931
+ let slack = -this.bound;
932
+ for (const boolVar of this.activeVars) slack += this.getAbsCoeff(boolVar);
933
+ const alit = this.getAssertingLiteral(negate(consequent));
934
+ slack -= this.getAbsCoeff(getVar(alit));
935
+ for (let position = lits.length; 0 <= slack && position-- > 0;) {
936
+ const lit = lits[position];
937
+ const boolVar = getVar(lit);
938
+ if (!this.activeVarSet.has(boolVar) || boolVar === getVar(alit)) continue;
939
+ const coeff = this.getCoeffOf(boolVar);
940
+ if (coeff < 0 && !isNegated(lit)) {
941
+ slack += coeff;
942
+ this.antecedents.push(lit);
943
+ } else if (coeff > 0 && isNegated(lit)) {
944
+ slack -= coeff;
945
+ this.antecedents.push(lit);
946
+ }
947
+ }
948
+ context.assign(alit, new TheoryJustification(this.id, [...this.antecedents], []));
949
+ return true;
950
+ }
951
+ }