tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.d618a2d79

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 (586) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +37 -0
  8. package/dist/index.d.ts +37 -0
  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.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +47 -44
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +44 -41
  19. package/dist/transfer.js +44 -41
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +474 -718
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +8 -7
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +244 -238
  35. package/src/cli/tlc-output.ts +687 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +49 -702
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +55 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +31 -106
  47. package/src/exit-codes.ts +2 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +616 -306
  57. package/src/liveness.ts +104 -120
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +118 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +10 -30
  81. package/src/parallel.ts +50 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  310. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +814 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +1986 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +15 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +206 -44
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +22 -47
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +54 -26
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,540 @@
1
+ import { SmtTacticError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ FAMILY_ARITH,
5
+ FAMILY_BASIC,
6
+ KIND_APP,
7
+ OP_ADD,
8
+ OP_BADD,
9
+ OP_DISTINCT,
10
+ OP_EQ,
11
+ OP_GE,
12
+ OP_GT,
13
+ OP_ITE,
14
+ OP_LE,
15
+ OP_LT,
16
+ OP_MUL,
17
+ OP_NOT,
18
+ OP_NUM,
19
+ OP_OR,
20
+ OP_ULEQ,
21
+ SORT_BOOL,
22
+ SORT_INT,
23
+ } from "./ast";
24
+ import { BoundManager } from "./bound-manager";
25
+ import { mkBvApp } from "./bv-decl-plugin";
26
+ import { checkPbFree } from "./card2bv";
27
+ import type { Definition, Goal } from "./goal";
28
+ import { ObjMap } from "./hashtable";
29
+ import { getGcd, Rational } from "./rational";
30
+ import { RefVector } from "./ref-vector";
31
+ import { Rewriter, type RewriterOptions } from "./rewriter";
32
+ import { RewriterTpl } from "./rewriter-tpl";
33
+ import { DEFAULT_PRINT_OPTIONS, printExpr } from "./smt2-printer";
34
+
35
+ const LINEAR_OPS = [OP_LE, OP_GE, OP_LT, OP_GT, OP_ADD, OP_NUM];
36
+
37
+ const PRINT_ENVIRONMENT = {
38
+ options: DEFAULT_PRINT_OPTIONS,
39
+ isUsed: () => false,
40
+ isClashing: () => false,
41
+ };
42
+
43
+ // only_01_visitor, which visits each subterm after its arguments: the first expression outside
44
+ // pseudo-Boolean constraints over Booleans and 0-1 integers, or undefined.
45
+ export const findNonPb = (manager: AstManager, forms: number[], bounds: BoundManager) => {
46
+ const isNonPb = (expr: number) => {
47
+ if (manager.kinds[expr] !== KIND_APP) return true;
48
+ const family = manager.getFamily(expr);
49
+ const op = manager.getOp(expr);
50
+ if (family === FAMILY_BASIC)
51
+ return (op === OP_ITE && manager.sorts[expr] !== SORT_BOOL) || op === OP_DISTINCT;
52
+ if (family === FAMILY_ARITH)
53
+ return !(
54
+ LINEAR_OPS.includes(op) ||
55
+ (op === OP_MUL &&
56
+ manager.getNumArgs(expr) === 2 &&
57
+ manager.isNumeral(manager.getArg(expr, 0)))
58
+ );
59
+ if (manager.isUninterpretedConst(expr)) {
60
+ if (manager.sorts[expr] === SORT_BOOL) return false;
61
+ if (manager.sorts[expr] === SORT_INT && bounds.isZeroOne(expr)) return false;
62
+ }
63
+ return true;
64
+ };
65
+ const visited = new Set<number>();
66
+ for (const form of forms) {
67
+ const todo = [{ expr: form, isExpanded: false }];
68
+ for (let frame = todo.pop(); frame !== undefined; frame = todo.pop()) {
69
+ if (frame.isExpanded) {
70
+ if (isNonPb(frame.expr)) return frame.expr;
71
+ continue;
72
+ }
73
+ if (visited.has(frame.expr)) continue;
74
+ visited.add(frame.expr);
75
+ todo.push({ expr: frame.expr, isExpanded: true });
76
+ if (manager.kinds[frame.expr] === KIND_APP)
77
+ for (let index = manager.getNumArgs(frame.expr) - 1; index >= 0; index--)
78
+ todo.push({ expr: manager.getArg(frame.expr, index), isExpanded: false });
79
+ }
80
+ }
81
+ return undefined;
82
+ };
83
+
84
+ interface Lit {
85
+ variable: number;
86
+ isSigned: boolean;
87
+ }
88
+
89
+ interface Monomial {
90
+ coeff: Rational;
91
+ lit: Lit;
92
+ }
93
+
94
+ const EQ = 0;
95
+ const GE = 1;
96
+ const LE = 2;
97
+
98
+ const getNumBits = (value: Rational) => value.num.toString(2).length;
99
+
100
+ class ConstraintRewriter extends RewriterTpl {
101
+ constructor(
102
+ manager: AstManager,
103
+ private converter: Pb2Bv,
104
+ ) {
105
+ super(manager);
106
+ }
107
+
108
+ getSubst(expr: number) {
109
+ return this.converter.isConstraintCore(expr) ? this.converter.convertSaved(expr) : undefined;
110
+ }
111
+ }
112
+
113
+ class Pb2Bv {
114
+ private bounds: BoundManager;
115
+ private boolRewriter: Rewriter;
116
+ readonly const2bit: ObjMap<number>;
117
+ private notConst2bit: ObjMap<number>;
118
+ readonly temporaryInts: RefVector;
119
+ readonly terms: RefVector;
120
+ private allClausesLimit: number;
121
+ private cardinalityLimit: number;
122
+ private rewriter: ConstraintRewriter | undefined;
123
+ private results: RefVector | undefined;
124
+
125
+ constructor(
126
+ private manager: AstManager,
127
+ params: ReadonlyMap<string, boolean | number | string>,
128
+ options: RewriterOptions,
129
+ ) {
130
+ this.bounds = new BoundManager(manager);
131
+ this.boolRewriter = new Rewriter(manager, options);
132
+ this.const2bit = new ObjMap((decl) => manager.getDeclHash(decl));
133
+ this.notConst2bit = new ObjMap((decl) => manager.getDeclHash(decl));
134
+ this.temporaryInts = new RefVector(manager);
135
+ this.terms = new RefVector(manager);
136
+ const getUint = (name: string, defaultValue: number) => {
137
+ const value = params.get(name);
138
+ return typeof value === "number" ? value : defaultValue;
139
+ };
140
+ this.allClausesLimit = getUint("pb2bv_all_clauses_limit", 8);
141
+ this.cardinalityLimit = getUint("pb2bv_cardinality_limit", 4294967295);
142
+ }
143
+
144
+ private hold(expr: number) {
145
+ this.terms.push(expr);
146
+ return expr;
147
+ }
148
+
149
+ private int2lit(variable: number, isSigned = false) {
150
+ const manager = this.manager;
151
+ const decl = manager.decls[variable];
152
+ const found = (isSigned ? this.notConst2bit : this.const2bit).get(decl);
153
+ if (found !== undefined) return found;
154
+ const bit = this.hold(manager.mkFreshConst(null, SORT_BOOL));
155
+ const notBit = this.hold(manager.mkApp(OP_NOT, [bit], SORT_BOOL));
156
+ this.const2bit.set(decl, bit);
157
+ this.notConst2bit.set(decl, notBit);
158
+ manager.incDeclRef(decl);
159
+ return isSigned ? notBit : bit;
160
+ }
161
+
162
+ private monLit2lit(lit: Lit) {
163
+ return this.int2lit(lit.variable, lit.isSigned);
164
+ }
165
+
166
+ private mkAnd(args: number[]) {
167
+ return this.hold(this.boolRewriter.mkAnd(args));
168
+ }
169
+
170
+ private mkNot(arg: number) {
171
+ return this.hold(this.boolRewriter.mkNot(arg));
172
+ }
173
+
174
+ private mkIte(condition: number, thenExpr: number, elseExpr: number) {
175
+ const result = this.boolRewriter.mkIte(condition, thenExpr, elseExpr);
176
+ return this.hold(typeof result === "number" ? result : result.expr);
177
+ }
178
+
179
+ private mkAllClauses(polynomial: Monomial[], bound: Rational) {
180
+ const manager = this.manager;
181
+ const size = polynomial.length;
182
+ const sums: Rational[] = [];
183
+ for (let index = size - 1; index >= 0; index--)
184
+ sums[index] =
185
+ index === size - 1 ? polynomial[index].coeff : polynomial[index].coeff.add(sums[index + 1]);
186
+ const lits = polynomial.map((monomial) => this.monLit2lit(monomial.lit));
187
+ const clause: number[] = [];
188
+ const result: number[] = [];
189
+ const process = (index: number, remaining: Rational) => {
190
+ if (!remaining.isPositive()) return;
191
+ if (index === size || sums[index].compare(remaining) < 0) {
192
+ result.push(
193
+ clause.length === 0
194
+ ? manager.falseExpr
195
+ : clause.length === 1
196
+ ? clause[0]
197
+ : this.hold(manager.mkApp(OP_OR, [...clause], SORT_BOOL)),
198
+ );
199
+ return;
200
+ }
201
+ clause.push(lits[index]);
202
+ process(index + 1, remaining);
203
+ clause.pop();
204
+ process(index + 1, remaining.sub(polynomial[index].coeff));
205
+ };
206
+ process(0, bound);
207
+ return this.mkAnd(result);
208
+ }
209
+
210
+ private bitblastPbc(polynomial: Monomial[], bound: Rational): number {
211
+ const manager = this.manager;
212
+ const size = polynomial.length;
213
+ const isCard = polynomial.every((monomial) => monomial.coeff.equals(Rational.one));
214
+ const sizeValue = Rational.fromNumber(size);
215
+ if (isCard && sizeValue.compare(bound) < 0) return manager.falseExpr;
216
+ if (isCard && bound.equals(Rational.one))
217
+ return this.hold(manager.mkOr(polynomial.map((monomial) => this.monLit2lit(monomial.lit))));
218
+ if (isCard && bound.equals(sizeValue))
219
+ return this.mkAnd(polynomial.map((monomial) => this.monLit2lit(monomial.lit)));
220
+ if (size <= this.allClausesLimit) return this.mkAllClauses(polynomial, bound);
221
+ if (isCard) {
222
+ const k = Number(bound.num);
223
+ const rowSize = size - k + 1;
224
+ if ((k * rowSize) % 4294967296 <= this.cardinalityLimit) {
225
+ const row: number[] = Array.from({ length: rowSize }, () => manager.trueExpr);
226
+ for (let index = 0; index < k; index++)
227
+ for (let column = 0; column < rowSize; column++)
228
+ row[column] = this.mkIte(
229
+ this.monLit2lit(polynomial[index + column].lit),
230
+ row[column],
231
+ column === 0 ? manager.falseExpr : row[column - 1],
232
+ );
233
+ return row[rowSize - 1];
234
+ }
235
+ }
236
+ const sum = polynomial.reduce((total, monomial) => total.add(monomial.coeff), Rational.zero);
237
+ if (sum.compare(bound) < 0) return manager.falseExpr;
238
+ const bits = getNumBits(sum);
239
+ const sort = manager.mkBvSort(bits);
240
+ const zero = manager.mkBvNumeral(0n, bits);
241
+ const summands = polynomial.map((monomial) =>
242
+ manager.mkApp(
243
+ OP_ITE,
244
+ [this.monLit2lit(monomial.lit), manager.mkBvNumeral(monomial.coeff.num, bits), zero],
245
+ sort,
246
+ ),
247
+ );
248
+ return this.hold(
249
+ mkBvApp(manager, OP_ULEQ, [
250
+ manager.mkBvNumeral(bound.num, bits),
251
+ mkBvApp(manager, OP_BADD, summands),
252
+ ]),
253
+ );
254
+ }
255
+
256
+ private split(polynomial: Monomial[], bound: Rational, clause: Monomial[]) {
257
+ const manager = this.manager;
258
+ if (polynomial.length <= 2 || bound.equals(Rational.one)) return polynomial;
259
+ if (!polynomial[0].coeff.equals(bound) || !polynomial[1].coeff.equals(bound)) return polynomial;
260
+ const end = polynomial.findIndex(
261
+ (monomial, index) => index >= 2 && !monomial.coeff.equals(bound),
262
+ );
263
+ if (end === -1) return polynomial;
264
+ for (const monomial of polynomial.slice(0, end))
265
+ clause.push({ coeff: Rational.one, lit: monomial.lit });
266
+ const fresh = manager.mkFreshConst(null, SORT_INT);
267
+ this.temporaryInts.push(fresh);
268
+ clause.push({ coeff: Rational.one, lit: { variable: fresh, isSigned: true } });
269
+ return [{ coeff: bound, lit: { variable: fresh, isSigned: false } }, ...polynomial.slice(end)];
270
+ }
271
+
272
+ private mkPbc(input: Monomial[], inputBound: Rational, isSplitting: boolean) {
273
+ const manager = this.manager;
274
+ if (!inputBound.isPositive()) return manager.trueExpr;
275
+ let gcd = input[0].coeff.compare(inputBound) > 0 ? inputBound.num : input[0].coeff.num;
276
+ let polynomial = input.map((monomial) => {
277
+ const coeff = monomial.coeff.compare(inputBound) > 0 ? inputBound : monomial.coeff;
278
+ gcd = getGcd(gcd, coeff.num);
279
+ return { coeff, lit: monomial.lit };
280
+ });
281
+ let bound = inputBound;
282
+ if (gcd !== 1n) {
283
+ const divisor = Rational.of(gcd);
284
+ polynomial = polynomial.map((monomial) => ({
285
+ coeff: monomial.coeff.div(divisor),
286
+ lit: monomial.lit,
287
+ }));
288
+ bound = bound.div(divisor).ceil();
289
+ }
290
+ // Z3's a_sum adds the bound rather than each coefficient, so only an empty polynomial is false.
291
+ if (polynomial.length === 0) return manager.falseExpr;
292
+ const clause: Monomial[] = [];
293
+ if (isSplitting) polynomial = this.split(polynomial, bound, clause);
294
+ if (clause.length === 0) return this.bitblastPbc(polynomial, bound);
295
+ const first = this.bitblastPbc(polynomial, bound);
296
+ const second = this.bitblastPbc(clause, Rational.one);
297
+ return this.mkAnd([first, second]);
298
+ }
299
+
300
+ private isEqVector(polynomial: Monomial[], bound: Rational) {
301
+ const size = polynomial.length;
302
+ if (size % 2 === 1) return false;
303
+ const half = size / 2;
304
+ if (!bound.equals(Rational.of(2n ** BigInt(half) - 1n))) return false;
305
+ for (let index = 0; index < half; index++) {
306
+ const first = polynomial[index * 2];
307
+ const second = polynomial[index * 2 + 1];
308
+ if (first.lit.isSigned === second.lit.isSigned) return false;
309
+ if (!first.coeff.equals(second.coeff)) return false;
310
+ if (!first.coeff.equals(Rational.of(2n ** BigInt(half - index - 1)))) return false;
311
+ }
312
+ return true;
313
+ }
314
+
315
+ private mkUnit(variable: number, isSigned: boolean) {
316
+ return this.monLit2lit({ variable, isSigned });
317
+ }
318
+
319
+ convert(atom: number, isPositive: boolean, isRoot: boolean): number {
320
+ const manager = this.manager;
321
+ const op = manager.getOp(atom);
322
+ const [lhs, rhs] = manager.getArgs(atom);
323
+ let kind: number;
324
+ let pos = isPositive;
325
+ if (op === OP_EQ) {
326
+ if (manager.isUninterpretedConst(lhs) && manager.isUninterpretedConst(rhs)) {
327
+ const lhsLit = this.mkUnit(lhs, false);
328
+ const rhsLit = this.mkUnit(rhs, !pos);
329
+ return this.hold(manager.mkEq(lhsLit, rhsLit));
330
+ }
331
+ kind = EQ;
332
+ } else if (op === OP_LE) kind = LE;
333
+ else if (op === OP_GE) kind = GE;
334
+ else this.throwNonPb(atom);
335
+ const adjust = (value: Rational) => {
336
+ if (pos) return value;
337
+ if (kind === LE) {
338
+ pos = true;
339
+ kind = GE;
340
+ return value.add(Rational.one);
341
+ }
342
+ if (kind === GE) {
343
+ pos = true;
344
+ kind = LE;
345
+ return value.sub(Rational.one);
346
+ }
347
+ return value;
348
+ };
349
+ if (manager.isNumeral(lhs)) {
350
+ const value = adjust(manager.getRationalValue(lhs));
351
+ if (!manager.isUninterpretedConst(rhs)) this.throwNonPb(atom);
352
+ if (kind === EQ) return this.mkUnit(rhs, value.isZero() !== !pos);
353
+ if ((value.isZero() && kind === LE) || (value.equals(Rational.one) && kind === GE))
354
+ return manager.trueExpr;
355
+ if ((value.isZero() && kind === GE) || (value.equals(Rational.one) && kind === LE))
356
+ return this.mkUnit(rhs, kind === GE);
357
+ this.throwNonPb(atom);
358
+ }
359
+ if (!manager.isNumeral(rhs) || manager.sorts[rhs] !== SORT_INT) this.throwNonPb(atom);
360
+ const value = adjust(manager.getRationalValue(rhs));
361
+ if (manager.isUninterpretedConst(lhs)) {
362
+ if (kind === EQ) {
363
+ if (!value.isZero() && !value.equals(Rational.one))
364
+ return pos ? manager.falseExpr : manager.trueExpr;
365
+ return this.mkUnit(lhs, value.isZero() !== !pos);
366
+ }
367
+ if (kind === LE) {
368
+ if (value.compare(Rational.one) >= 0) return manager.trueExpr;
369
+ if (value.isNegative()) return manager.falseExpr;
370
+ } else {
371
+ if (!value.isPositive()) return manager.trueExpr;
372
+ if (value.compare(Rational.one) > 0) return manager.falseExpr;
373
+ }
374
+ return this.mkUnit(lhs, kind === LE);
375
+ }
376
+ if (manager.getOp(lhs) !== OP_ADD) this.throwNonPb(atom);
377
+ const monomials = manager.getArgs(lhs);
378
+ const getMulArgs = (monomial: number) =>
379
+ manager.getOp(monomial) === OP_MUL && manager.getNumArgs(monomial) === 2
380
+ ? manager.getArgs(monomial)
381
+ : undefined;
382
+ for (const monomial of monomials) {
383
+ if (manager.isUninterpretedConst(monomial)) continue;
384
+ const args = getMulArgs(monomial);
385
+ if (args !== undefined && manager.isNumeral(args[0]) && manager.isUninterpretedConst(args[1]))
386
+ continue;
387
+ this.throwNonPb(atom);
388
+ }
389
+ let bound = value;
390
+ const polynomial: Monomial[] = monomials.map((monomial) => {
391
+ if (manager.isUninterpretedConst(monomial))
392
+ return { coeff: Rational.one, lit: { variable: monomial, isSigned: false } };
393
+ const [coeffExpr, variable] = getMulArgs(monomial) as number[];
394
+ const coeff = manager.getRationalValue(coeffExpr);
395
+ if (!coeff.isNegative()) return { coeff, lit: { variable, isSigned: false } };
396
+ bound = bound.add(coeff.neg());
397
+ return { coeff: coeff.neg(), lit: { variable, isSigned: true } };
398
+ });
399
+ const sorted = polynomial
400
+ .map((monomial, index) => ({ monomial, index }))
401
+ .sort(
402
+ (first, second) =>
403
+ second.monomial.coeff.compare(first.monomial.coeff) || first.index - second.index,
404
+ )
405
+ .map((entry) => entry.monomial);
406
+ const negate = (monomials: Monomial[], total: Rational) => ({
407
+ polynomial: monomials.map((monomial) => ({
408
+ coeff: monomial.coeff,
409
+ lit: { variable: monomial.lit.variable, isSigned: !monomial.lit.isSigned },
410
+ })),
411
+ bound: monomials.reduce((sum, monomial) => sum.add(monomial.coeff), total.neg()),
412
+ });
413
+ if (kind === GE) return this.mkPbc(sorted, bound, isRoot);
414
+ if (kind === LE) {
415
+ const negated = negate(sorted, bound);
416
+ return this.mkPbc(negated.polynomial, negated.bound, isRoot);
417
+ }
418
+ if (this.isEqVector(sorted, bound)) {
419
+ const eqs: number[] = [];
420
+ for (let index = 0; index < sorted.length; index += 2)
421
+ eqs.push(
422
+ this.hold(
423
+ manager.mkEq(
424
+ this.int2lit(sorted[index].lit.variable),
425
+ this.int2lit(sorted[index + 1].lit.variable),
426
+ ),
427
+ ),
428
+ );
429
+ const conjunction = this.mkAnd(eqs);
430
+ return pos ? conjunction : this.mkNot(conjunction);
431
+ }
432
+ const negated = negate(sorted, bound);
433
+ const first = this.mkPbc(sorted, bound, false);
434
+ const second = this.mkPbc(negated.polynomial, negated.bound, false);
435
+ const conjunction = this.mkAnd([first, second]);
436
+ return pos ? conjunction : this.mkNot(conjunction);
437
+ }
438
+
439
+ convertSaved(atom: number) {
440
+ return this.convert(atom, true, false);
441
+ }
442
+
443
+ isConstraintCore(expr: number) {
444
+ const manager = this.manager;
445
+ const op = manager.getOp(expr);
446
+ return (
447
+ (op === OP_EQ && manager.sorts[manager.getArg(expr, 0)] === SORT_INT) ||
448
+ op === OP_LE ||
449
+ op === OP_GE
450
+ );
451
+ }
452
+
453
+ run(goal: Goal) {
454
+ const manager = this.manager;
455
+ for (const form of goal.forms.items) this.bounds.add(form);
456
+ const failed = findNonPb(manager, goal.forms.items, this.bounds);
457
+ if (failed !== undefined) this.throwNonPb(failed);
458
+ const rewriter = new ConstraintRewriter(manager, this);
459
+ this.rewriter = rewriter;
460
+ const results = new RefVector(manager);
461
+ this.results = results;
462
+ for (const form of goal.forms.items) {
463
+ let atom = form;
464
+ let isPositive = true;
465
+ while (manager.isNot(atom)) {
466
+ atom = manager.getArg(atom, 0);
467
+ isPositive = !isPositive;
468
+ }
469
+ if (this.isConstraintCore(atom)) {
470
+ results.push(this.convert(atom, isPositive, true));
471
+ continue;
472
+ }
473
+ const rewritten = rewriter.rewrite(form);
474
+ checkPbFree(manager, rewritten);
475
+ results.pushOwned(rewritten);
476
+ }
477
+ for (const [index, result] of results.items.entries()) goal.update(index, result);
478
+ results.reset();
479
+ const hidden: Definition[] = [];
480
+ for (const [, bit] of this.const2bit) hidden.push({ decl: manager.decls[bit], def: -1 });
481
+ for (const fresh of this.temporaryInts.items)
482
+ hidden.push({ decl: manager.decls[fresh], def: -1 });
483
+ goal.addDefinitions(hidden);
484
+ const c2bit: { decl: number; bit: number }[] = [];
485
+ for (const [decl, bit] of this.const2bit) {
486
+ manager.incDeclRef(decl);
487
+ manager.incDeclRef(manager.decls[bit]);
488
+ c2bit.push({ decl, bit: manager.decls[bit] });
489
+ }
490
+ for (const variable of this.bounds.boundedVars) {
491
+ const decl = manager.decls[variable];
492
+ if (this.const2bit.has(decl)) continue;
493
+ manager.incDeclRef(decl);
494
+ c2bit.push({ decl, bit: -1 });
495
+ }
496
+ goal.addModelConversion((model) => {
497
+ for (const entry of c2bit) {
498
+ const value = entry.bit === -1 ? undefined : model.constInterps.get(entry.bit);
499
+ const isOne = value !== undefined && !manager.isFalse(value);
500
+ model.registerConst(entry.decl, manager.mkNumeral(isOne ? 1n : 0n));
501
+ }
502
+ return model;
503
+ });
504
+ goal.depth++;
505
+ }
506
+
507
+ private throwNonPb(expr: number): never {
508
+ throw new SmtTacticError(
509
+ `goal is in a fragment not supported by pb2bv. Offending expression: ${printExpr(this.manager, PRINT_ENVIRONMENT, expr)}`,
510
+ );
511
+ }
512
+
513
+ release() {
514
+ this.results?.reset();
515
+ this.rewriter?.release();
516
+ for (const [decl] of this.const2bit) this.manager.decDeclRef(decl);
517
+ this.terms.reset();
518
+ this.temporaryInts.reset();
519
+ this.boolRewriter.release();
520
+ }
521
+ }
522
+
523
+ export const runPb2Bv =
524
+ (
525
+ manager: AstManager,
526
+ params: ReadonlyMap<string, boolean | number | string>,
527
+ options: RewriterOptions,
528
+ ) =>
529
+ (goal: Goal) => {
530
+ if (goal.isProofsEnabled) throw new SmtTacticError("pb2bv does not support proof production");
531
+ if (!goal.isInconsistent) {
532
+ const converter = new Pb2Bv(manager, params, options);
533
+ try {
534
+ converter.run(goal);
535
+ } finally {
536
+ converter.release();
537
+ }
538
+ }
539
+ return [goal];
540
+ };