tla-ts 0.0.10-dev.8aec06f77 → 0.0.10-dev.8be00045c

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 (509) hide show
  1. package/dist/deciders.cjs +37 -36
  2. package/dist/deciders.js +55 -54
  3. package/dist/index.cjs +1 -1
  4. package/dist/index.d.cts +4 -1
  5. package/dist/index.d.ts +4 -1
  6. package/dist/index.js +1 -1
  7. package/dist/parallel-worker.cjs +1 -1
  8. package/dist/parallel-worker.js +1 -1
  9. package/dist/prove.cjs +146 -58
  10. package/dist/prove.js +143 -55
  11. package/dist/run.cjs +43 -43
  12. package/dist/run.js +45 -45
  13. package/dist/transfer.cjs +29 -26
  14. package/dist/transfer.js +43 -40
  15. package/dist/worker.cjs +1 -1
  16. package/dist/worker.js +1 -1
  17. package/package.json +1 -1
  18. package/src/ast.ts +3 -3
  19. package/src/bags.ts +46 -28
  20. package/src/check-trace.ts +2 -16
  21. package/src/check.ts +336 -88
  22. package/src/cli/runtime-invariants.ts +20 -56
  23. package/src/cli/tlapm.ts +261 -68
  24. package/src/cli/tlc-arguments.ts +2 -2
  25. package/src/cli/tlc-output.ts +4 -5
  26. package/src/cli/tlc-usage.ts +0 -1
  27. package/src/cli/tlc.ts +26 -7
  28. package/src/dependencies.ts +23 -2
  29. package/src/dfid.ts +9 -2
  30. package/src/environment.ts +27 -5
  31. package/src/errors.ts +1 -1
  32. package/src/evaluate.ts +9 -3
  33. package/src/exit-codes.ts +5 -2
  34. package/src/instances.ts +1 -1
  35. package/src/levels.ts +134 -86
  36. package/src/liveness-checker.ts +572 -204
  37. package/src/liveness.ts +47 -32
  38. package/src/obligations/action.ts +0 -2
  39. package/src/obligations/anonymize.ts +2 -6
  40. package/src/obligations/equality.ts +0 -2
  41. package/src/obligations/expression.ts +0 -2
  42. package/src/obligations/format.ts +0 -2
  43. package/src/obligations/generate.ts +0 -2
  44. package/src/obligations/index.ts +5 -3
  45. package/src/obligations/levels.ts +0 -2
  46. package/src/obligations/module.ts +0 -2
  47. package/src/obligations/normalize.ts +0 -2
  48. package/src/obligations/operators.ts +0 -2
  49. package/src/obligations/pragma.ts +2 -2
  50. package/src/obligations/printer.ts +0 -2
  51. package/src/obligations/proof.ts +0 -2
  52. package/src/obligations/regroup.ts +0 -2
  53. package/src/obligations/simplify.ts +0 -2
  54. package/src/obligations/subexpression.ts +0 -2
  55. package/src/obligations/substitution.ts +0 -2
  56. package/src/obligations/temporal.ts +0 -2
  57. package/src/obligations/tuples.ts +0 -2
  58. package/src/parallel-worker.ts +8 -2
  59. package/src/parallel.ts +7 -2
  60. package/src/parser.ts +224 -82
  61. package/src/pretty-print.ts +1 -1
  62. package/src/prover/deciders.ts +1 -8
  63. package/src/prover/isabelle/encode.ts +0 -2
  64. package/src/prover/isabelle/isar/attrib.ts +86 -49
  65. package/src/prover/isabelle/isar/context.ts +25 -26
  66. package/src/prover/isabelle/isar/induct.ts +2 -9
  67. package/src/prover/isabelle/isar/method.ts +5 -9
  68. package/src/prover/isabelle/isar/proof.ts +33 -18
  69. package/src/prover/isabelle/isar/rule-cases.ts +14 -22
  70. package/src/prover/isabelle/isar/theory.ts +16 -17
  71. package/src/prover/isabelle/isar/toplevel.ts +46 -56
  72. package/src/prover/isabelle/isar/type-check.ts +0 -2
  73. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  74. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  75. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  76. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  77. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  78. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  79. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  80. package/src/prover/isabelle/provers/classical.ts +1 -3
  81. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  82. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  83. package/src/prover/isabelle/pure/consts.ts +0 -2
  84. package/src/prover/isabelle/pure/conv.ts +0 -2
  85. package/src/prover/isabelle/pure/drule.ts +0 -2
  86. package/src/prover/isabelle/pure/envir.ts +0 -2
  87. package/src/prover/isabelle/pure/goal.ts +0 -2
  88. package/src/prover/isabelle/pure/logic.ts +0 -2
  89. package/src/prover/isabelle/pure/name.ts +0 -2
  90. package/src/prover/isabelle/pure/net.ts +0 -2
  91. package/src/prover/isabelle/pure/object-logic.ts +0 -2
  92. package/src/prover/isabelle/pure/pattern.ts +0 -2
  93. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  94. package/src/prover/isabelle/pure/rewriter.ts +0 -2
  95. package/src/prover/isabelle/pure/search.ts +0 -2
  96. package/src/prover/isabelle/pure/seq.ts +0 -2
  97. package/src/prover/isabelle/pure/simplifier.ts +0 -2
  98. package/src/prover/isabelle/pure/table.ts +0 -2
  99. package/src/prover/isabelle/pure/tactic.ts +0 -2
  100. package/src/prover/isabelle/pure/tactical.ts +0 -2
  101. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  102. package/src/prover/isabelle/pure/term.ts +0 -2
  103. package/src/prover/isabelle/pure/thm.ts +0 -2
  104. package/src/prover/isabelle/pure/type.ts +0 -2
  105. package/src/prover/isabelle/pure/unify.ts +0 -2
  106. package/src/prover/isabelle/pure/variable.ts +0 -2
  107. package/src/prover/isabelle/tla/classical-setup.ts +0 -2
  108. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  109. package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
  110. package/src/prover/ocaml.ts +4 -1
  111. package/src/prover/prep/action.ts +1 -0
  112. package/src/prover/prep/methods.ts +50 -3
  113. package/src/prover/prep/normalize.ts +4 -1
  114. package/src/prover/prove.ts +58 -32
  115. package/src/prover/ptl/decide.ts +43 -63
  116. package/src/prover/smt/data.ts +51 -45
  117. package/src/prover/smt/encode.ts +1 -2
  118. package/src/prover/smt/rewrite.ts +3 -7
  119. package/src/prover/smt/simplify.ts +1 -1
  120. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
  121. package/src/prover/smt/solver/ackr-helper.ts +0 -3
  122. package/src/prover/smt/solver/ackr-model-converter.ts +0 -1
  123. package/src/prover/smt/solver/act-cache.ts +0 -1
  124. package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
  125. package/src/prover/smt/solver/aig-tactic.ts +25 -16
  126. package/src/prover/smt/solver/aig.ts +2 -3
  127. package/src/prover/smt/solver/arith-rewriter.ts +3 -6
  128. package/src/prover/smt/solver/arith-terms.ts +0 -2
  129. package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
  130. package/src/prover/smt/solver/array-rewriter.ts +0 -1
  131. package/src/prover/smt/solver/asserted-formulas.ts +9 -3
  132. package/src/prover/smt/solver/ast-lt.ts +1 -2
  133. package/src/prover/smt/solver/ast-util.ts +3 -3
  134. package/src/prover/smt/solver/ast.ts +112 -156
  135. package/src/prover/smt/solver/auf-solver.ts +0 -1
  136. package/src/prover/smt/solver/bit-blast-tactic.ts +0 -3
  137. package/src/prover/smt/solver/bit-blaster.ts +0 -3
  138. package/src/prover/smt/solver/bound-manager.ts +39 -29
  139. package/src/prover/smt/solver/bound-simplifier.ts +0 -2
  140. package/src/prover/smt/solver/bv-bound-chk.ts +2 -10
  141. package/src/prover/smt/solver/bv-decl-plugin.ts +0 -1
  142. package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
  143. package/src/prover/smt/solver/bv-rewriter.ts +15 -19
  144. package/src/prover/smt/solver/bv1-blast.ts +1 -11
  145. package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
  146. package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
  147. package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
  148. package/src/prover/smt/solver/card2bv.ts +1 -4
  149. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  150. package/src/prover/smt/solver/cg-table.ts +19 -16
  151. package/src/prover/smt/solver/check-logic.ts +6 -2
  152. package/src/prover/smt/solver/clause.ts +0 -1
  153. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +0 -2
  154. package/src/prover/smt/solver/conflict-resolution.ts +0 -1
  155. package/src/prover/smt/solver/context.ts +41 -14
  156. package/src/prover/smt/solver/ctx-simplify.ts +1 -3
  157. package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
  158. package/src/prover/smt/solver/datatype-decl-plugin.ts +0 -1
  159. package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
  160. package/src/prover/smt/solver/demodulator.ts +2 -5
  161. package/src/prover/smt/solver/dependent-expr-state.ts +16 -3
  162. package/src/prover/smt/solver/der.ts +0 -1
  163. package/src/prover/smt/solver/diff-neq.ts +1 -3
  164. package/src/prover/smt/solver/distribute-forall.ts +1 -11
  165. package/src/prover/smt/solver/dom-simplify.ts +1 -3
  166. package/src/prover/smt/solver/dt2bv-tactic.ts +2 -9
  167. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  168. package/src/prover/smt/solver/e-matching.ts +6 -7
  169. package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
  170. package/src/prover/smt/solver/elim-uncnstr.ts +7 -23
  171. package/src/prover/smt/solver/enode.ts +15 -2
  172. package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
  173. package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
  174. package/src/prover/smt/solver/euf/arith-internalize.ts +1 -3
  175. package/src/prover/smt/solver/euf/arith-solver.ts +0 -1
  176. package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
  177. package/src/prover/smt/solver/euf/array-internalize.ts +20 -11
  178. package/src/prover/smt/solver/euf/array-solver.ts +0 -2
  179. package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
  180. package/src/prover/smt/solver/euf/bv-internalize.ts +1 -3
  181. package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
  182. package/src/prover/smt/solver/euf/dt-solver.ts +19 -21
  183. package/src/prover/smt/solver/euf/egraph.ts +68 -43
  184. package/src/prover/smt/solver/euf/euf-solver.ts +36 -23
  185. package/src/prover/smt/solver/euf/fpa-solver.ts +37 -53
  186. package/src/prover/smt/solver/euf/mam.ts +7 -55
  187. package/src/prover/smt/solver/euf/q-ematch.ts +21 -97
  188. package/src/prover/smt/solver/euf/q-mbi.ts +4 -4
  189. package/src/prover/smt/solver/euf/q-model-fixer.ts +1 -4
  190. package/src/prover/smt/solver/euf/q-solver.ts +2 -2
  191. package/src/prover/smt/solver/euf/th-solver.ts +1 -10
  192. package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
  193. package/src/prover/smt/solver/expr-ref.ts +0 -1
  194. package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
  195. package/src/prover/smt/solver/expr2polynomial.ts +204 -80
  196. package/src/prover/smt/solver/factor.ts +37 -26
  197. package/src/prover/smt/solver/fd-solver.ts +3 -5
  198. package/src/prover/smt/solver/fingerprints.ts +0 -1
  199. package/src/prover/smt/solver/fix-dl-var.ts +1 -3
  200. package/src/prover/smt/solver/flat-literals.ts +0 -1
  201. package/src/prover/smt/solver/fm-tactic.ts +19 -14
  202. package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
  203. package/src/prover/smt/solver/fpa-rewriter.ts +2 -2
  204. package/src/prover/smt/solver/fpa2bv-converter.ts +13 -8
  205. package/src/prover/smt/solver/fpa2bv-rewriter.ts +0 -1
  206. package/src/prover/smt/solver/fpa2bv-tactic.ts +0 -2
  207. package/src/prover/smt/solver/goal.ts +3 -2
  208. package/src/prover/smt/solver/goal2nlsat.ts +57 -32
  209. package/src/prover/smt/solver/guard-set.ts +0 -1
  210. package/src/prover/smt/solver/hash.ts +0 -1
  211. package/src/prover/smt/solver/hashtable.ts +0 -1
  212. package/src/prover/smt/solver/inf-eps.ts +1 -2
  213. package/src/prover/smt/solver/inj-axiom.ts +0 -1
  214. package/src/prover/smt/solver/internalizer.ts +41 -3
  215. package/src/prover/smt/solver/lackr.ts +0 -2
  216. package/src/prover/smt/solver/lbool.ts +0 -1
  217. package/src/prover/smt/solver/lia2card.ts +0 -1
  218. package/src/prover/smt/solver/lia2pb.ts +18 -5
  219. package/src/prover/smt/solver/literal.ts +0 -1
  220. package/src/prover/smt/solver/logic-tactics.ts +0 -4
  221. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  222. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  223. package/src/prover/smt/solver/lp/containers.ts +7 -2
  224. package/src/prover/smt/solver/lp/core-solver.ts +0 -3
  225. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  226. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  227. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  228. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  229. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  230. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  231. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  232. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  233. package/src/prover/smt/solver/lp/int-cube.ts +0 -1
  234. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  235. package/src/prover/smt/solver/lp/lar-solver.ts +1 -2
  236. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  237. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  238. package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
  239. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  240. package/src/prover/smt/solver/lp/nex.ts +2 -2
  241. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  242. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  243. package/src/prover/smt/solver/lp/nla-core.ts +26 -7
  244. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  245. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  246. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  247. package/src/prover/smt/solver/lp/nla-grobner.ts +158 -82
  248. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  249. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  250. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  251. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  252. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  253. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  254. package/src/prover/smt/solver/lp/nla-powers.ts +144 -108
  255. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  256. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  257. package/src/prover/smt/solver/lp/nla-transcendentals.ts +50 -19
  258. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  259. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  260. package/src/prover/smt/solver/lp/nra-solver.ts +138 -97
  261. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  262. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  263. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  264. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  265. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  266. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  267. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  268. package/src/prover/smt/solver/lp/union-find.ts +1 -2
  269. package/src/prover/smt/solver/macro-finder.ts +1 -4
  270. package/src/prover/smt/solver/mam-compiler.ts +14 -15
  271. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  272. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +1 -13
  273. package/src/prover/smt/solver/max-cliques.ts +0 -2
  274. package/src/prover/smt/solver/maxcore.ts +5 -14
  275. package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -1
  276. package/src/prover/smt/solver/maxlex.ts +0 -8
  277. package/src/prover/smt/solver/maxsmt-base.ts +7 -1
  278. package/src/prover/smt/solver/maxsmt.ts +0 -1
  279. package/src/prover/smt/solver/mbp/mbp-arith.ts +2 -12
  280. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
  281. package/src/prover/smt/solver/mbp/mbp-plugin.ts +9 -2
  282. package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
  283. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +1 -10
  284. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +0 -1
  285. package/src/prover/smt/solver/model-based-opt.ts +1 -2
  286. package/src/prover/smt/solver/model-checker.ts +0 -1
  287. package/src/prover/smt/solver/model-evaluator.ts +9 -6
  288. package/src/prover/smt/solver/model-finder.ts +0 -1
  289. package/src/prover/smt/solver/model-generator.ts +3 -2
  290. package/src/prover/smt/solver/model-macro-solver.ts +3 -4
  291. package/src/prover/smt/solver/model-printer.ts +0 -1
  292. package/src/prover/smt/solver/mpf.ts +2 -5
  293. package/src/prover/smt/solver/mus.ts +1 -3
  294. package/src/prover/smt/solver/muz/dl-context.ts +67 -9
  295. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
  296. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +68 -22
  297. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +7 -3
  298. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -2
  299. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +39 -11
  300. package/src/prover/smt/solver/muz/dl-mk-slice.ts +78 -16
  301. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +9 -4
  302. package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -1
  303. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -4
  304. package/src/prover/smt/solver/muz/dl-rule.ts +95 -33
  305. package/src/prover/smt/solver/muz/hnf.ts +6 -6
  306. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  307. package/src/prover/smt/solver/muz/horn-tactic.ts +15 -6
  308. package/src/prover/smt/solver/muz/rule-properties.ts +194 -37
  309. package/src/prover/smt/solver/muz/spacer-context.ts +104 -89
  310. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -3
  311. package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
  312. package/src/prover/smt/solver/muz/spacer-manager.ts +0 -2
  313. package/src/prover/smt/solver/muz/spacer-pdr.ts +4 -4
  314. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +3 -9
  315. package/src/prover/smt/solver/muz/spacer-util.ts +2 -3
  316. package/src/prover/smt/solver/muz/substitution.ts +88 -39
  317. package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
  318. package/src/prover/smt/solver/nlqsat.ts +4 -4
  319. package/src/prover/smt/solver/nlsat/algebraic.ts +194 -93
  320. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  321. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  322. package/src/prover/smt/solver/nlsat/explain.ts +379 -217
  323. package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
  324. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  325. package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
  326. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  327. package/src/prover/smt/solver/nlsat/solver.ts +112 -99
  328. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
  329. package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -19
  330. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  331. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  332. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  333. package/src/prover/smt/solver/nlsat-tactic.ts +0 -1
  334. package/src/prover/smt/solver/nnf.ts +0 -1
  335. package/src/prover/smt/solver/normalize-bounds.ts +0 -1
  336. package/src/prover/smt/solver/occf.ts +0 -1
  337. package/src/prover/smt/solver/opt-context.ts +15 -10
  338. package/src/prover/smt/solver/opt-nlsat.ts +97 -77
  339. package/src/prover/smt/solver/opt-pareto.ts +0 -2
  340. package/src/prover/smt/solver/opt-preprocess.ts +0 -1
  341. package/src/prover/smt/solver/opt-solver.ts +22 -11
  342. package/src/prover/smt/solver/opt-value.ts +0 -1
  343. package/src/prover/smt/solver/optsmt.ts +13 -12
  344. package/src/prover/smt/solver/parallel-tactic.ts +0 -2
  345. package/src/prover/smt/solver/pattern-inference.ts +2 -3
  346. package/src/prover/smt/solver/pb-rewriter.ts +14 -20
  347. package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
  348. package/src/prover/smt/solver/poly-rewriter.ts +2 -3
  349. package/src/prover/smt/solver/probes.ts +4 -7
  350. package/src/prover/smt/solver/propagate-values.ts +4 -1
  351. package/src/prover/smt/solver/proto-model.ts +6 -7
  352. package/src/prover/smt/solver/pull-quant.ts +0 -1
  353. package/src/prover/smt/solver/purify-arith.ts +50 -16
  354. package/src/prover/smt/solver/qe-arith-plugin.ts +4 -7
  355. package/src/prover/smt/solver/qe-lite-der.ts +0 -1
  356. package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
  357. package/src/prover/smt/solver/qe-lite.ts +0 -1
  358. package/src/prover/smt/solver/qe-mbp.ts +13 -24
  359. package/src/prover/smt/solver/qe.ts +48 -57
  360. package/src/prover/smt/solver/qel.ts +0 -1
  361. package/src/prover/smt/solver/qi-queue.ts +0 -1
  362. package/src/prover/smt/solver/qsat.ts +70 -91
  363. package/src/prover/smt/solver/quant-hoist.ts +0 -1
  364. package/src/prover/smt/solver/quant-tactics.ts +0 -1
  365. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  366. package/src/prover/smt/solver/quantifier-manager.ts +14 -10
  367. package/src/prover/smt/solver/quasi-macros.ts +9 -20
  368. package/src/prover/smt/solver/random-gen.ts +0 -1
  369. package/src/prover/smt/solver/rational.ts +17 -1
  370. package/src/prover/smt/solver/recfun-decl-plugin.ts +35 -21
  371. package/src/prover/smt/solver/recfun-rewriter.ts +1 -2
  372. package/src/prover/smt/solver/reduce-args.ts +0 -1
  373. package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
  374. package/src/prover/smt/solver/ref-vector.ts +0 -1
  375. package/src/prover/smt/solver/relevancy.ts +0 -1
  376. package/src/prover/smt/solver/rewriter-tpl.ts +6 -3
  377. package/src/prover/smt/solver/rewriter.ts +1 -2
  378. package/src/prover/smt/solver/rlimit.ts +13 -1
  379. package/src/prover/smt/solver/sat/asymm-branch.ts +59 -48
  380. package/src/prover/smt/solver/sat/big.ts +0 -1
  381. package/src/prover/smt/solver/sat/clause-use-list.ts +0 -8
  382. package/src/prover/smt/solver/sat/clause.ts +1 -6
  383. package/src/prover/smt/solver/sat/cleaner.ts +0 -2
  384. package/src/prover/smt/solver/sat/config.ts +4 -7
  385. package/src/prover/smt/solver/sat/consequences.ts +1 -2
  386. package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
  387. package/src/prover/smt/solver/sat/goal2sat.ts +1 -3
  388. package/src/prover/smt/solver/sat/inc-sat-solver.ts +4 -13
  389. package/src/prover/smt/solver/sat/model-converter.ts +2 -18
  390. package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
  391. package/src/prover/smt/solver/sat/pb-solver.ts +50 -26
  392. package/src/prover/smt/solver/sat/probing.ts +22 -21
  393. package/src/prover/smt/solver/sat/sat-tactic.ts +2 -2
  394. package/src/prover/smt/solver/sat/sat2goal.ts +9 -12
  395. package/src/prover/smt/solver/sat/scc.ts +0 -1
  396. package/src/prover/smt/solver/sat/simplifier.ts +16 -60
  397. package/src/prover/smt/solver/sat/solver.ts +45 -68
  398. package/src/prover/smt/solver/sat/var-queue.ts +0 -2
  399. package/src/prover/smt/solver/sat/watch-list.ts +7 -3
  400. package/src/prover/smt/solver/search-tree.ts +0 -1
  401. package/src/prover/smt/solver/seq-axioms.ts +20 -36
  402. package/src/prover/smt/solver/seq-decl-plugin.ts +7 -8
  403. package/src/prover/smt/solver/seq-derive.ts +9 -15
  404. package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
  405. package/src/prover/smt/solver/seq-eq-solver.ts +9 -10
  406. package/src/prover/smt/solver/seq-factory.ts +0 -1
  407. package/src/prover/smt/solver/seq-monadic.ts +7 -7
  408. package/src/prover/smt/solver/seq-range-predicate.ts +14 -3
  409. package/src/prover/smt/solver/seq-re-rewriter.ts +3 -12
  410. package/src/prover/smt/solver/seq-re-util.ts +2 -5
  411. package/src/prover/smt/solver/seq-regex-bisim.ts +2 -3
  412. package/src/prover/smt/solver/seq-regex-live.ts +6 -8
  413. package/src/prover/smt/solver/seq-rewriter.ts +31 -34
  414. package/src/prover/smt/solver/seq-skolem.ts +0 -24
  415. package/src/prover/smt/solver/seq-subset.ts +0 -1
  416. package/src/prover/smt/solver/seq-view-witness.ts +4 -6
  417. package/src/prover/smt/solver/smt-consequences.ts +0 -2
  418. package/src/prover/smt/solver/smt-kernel.ts +8 -3
  419. package/src/prover/smt/solver/smt-logics.ts +0 -1
  420. package/src/prover/smt/solver/smt-setup.ts +18 -14
  421. package/src/prover/smt/solver/smt2-printer.ts +0 -2
  422. package/src/prover/smt/solver/smtlib-parser.ts +1187 -592
  423. package/src/prover/smt/solver/smtlib-script.ts +957 -750
  424. package/src/prover/smt/solver/solve-eqs.ts +11 -19
  425. package/src/prover/smt/solver/solver.ts +1 -2
  426. package/src/prover/smt/solver/static-features.ts +0 -2
  427. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  428. package/src/prover/smt/solver/tactic.ts +77 -18
  429. package/src/prover/smt/solver/term-enumeration.ts +0 -1
  430. package/src/prover/smt/solver/theory-array.ts +25 -60
  431. package/src/prover/smt/solver/theory-bv.ts +15 -54
  432. package/src/prover/smt/solver/theory-char.ts +0 -1
  433. package/src/prover/smt/solver/theory-datatype.ts +0 -1
  434. package/src/prover/smt/solver/theory-finite-set.ts +2 -2
  435. package/src/prover/smt/solver/theory-fpa.ts +46 -79
  436. package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
  437. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
  438. package/src/prover/smt/solver/theory-lra-final-check.ts +0 -2
  439. package/src/prover/smt/solver/theory-lra-internalize.ts +8 -1
  440. package/src/prover/smt/solver/theory-lra-model.ts +0 -1
  441. package/src/prover/smt/solver/theory-lra-propagate.ts +0 -3
  442. package/src/prover/smt/solver/theory-lra-state.ts +0 -1
  443. package/src/prover/smt/solver/theory-lra.ts +0 -2
  444. package/src/prover/smt/solver/theory-pb.ts +12 -11
  445. package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
  446. package/src/prover/smt/solver/theory-recfun.ts +2 -3
  447. package/src/prover/smt/solver/theory-seq-regex.ts +3 -7
  448. package/src/prover/smt/solver/theory-seq-solve.ts +6 -8
  449. package/src/prover/smt/solver/theory-seq-state.ts +8 -26
  450. package/src/prover/smt/solver/theory-seq.ts +32 -55
  451. package/src/prover/smt/solver/theory.ts +16 -2
  452. package/src/prover/smt/solver/tseitin-cnf.ts +3 -5
  453. package/src/prover/smt/solver/var-subst.ts +2 -3
  454. package/src/prover/smt/table.ts +3 -2
  455. package/src/prover/zenon/decide.ts +9 -13
  456. package/src/prover/zenon/encode.ts +0 -2
  457. package/src/prover/zenon/eqrel.ts +0 -2
  458. package/src/prover/zenon/equality-rules.ts +24 -2
  459. package/src/prover/zenon/expr.ts +21 -2
  460. package/src/prover/zenon/index-table.ts +7 -4
  461. package/src/prover/zenon/isar-case.ts +1 -3
  462. package/src/prover/zenon/isar.ts +2 -4
  463. package/src/prover/zenon/llproof.ts +0 -2
  464. package/src/prover/zenon/mltoll.ts +0 -2
  465. package/src/prover/zenon/node.ts +12 -13
  466. package/src/prover/zenon/parse.ts +0 -2
  467. package/src/prover/zenon/phrase.ts +1 -3
  468. package/src/prover/zenon/proof.ts +0 -2
  469. package/src/prover/zenon/propositional-rules.ts +0 -2
  470. package/src/prover/zenon/rules.ts +2 -3
  471. package/src/prover/zenon/search.ts +0 -2
  472. package/src/prover/zenon/tla/functions.ts +0 -2
  473. package/src/prover/zenon/tla/llproof.ts +0 -2
  474. package/src/prover/zenon/tla/records.ts +0 -2
  475. package/src/prover/zenon/tla/rewrites.ts +0 -2
  476. package/src/prover/zenon/tla/sets.ts +1 -3
  477. package/src/prover/zenon/tla/terms.ts +0 -2
  478. package/src/prover/zenon/tla/tla.ts +0 -2
  479. package/src/resolve.ts +264 -77
  480. package/src/runtime.ts +6 -0
  481. package/src/sany/generation.ts +1 -13
  482. package/src/sany/generator-definitions.ts +2 -1
  483. package/src/sany/generator-expressions.ts +30 -27
  484. package/src/sany/generator-proofs.ts +1 -1
  485. package/src/sany/generator.ts +2 -1
  486. package/src/sany/levels.ts +0 -2
  487. package/src/sany/linter.ts +0 -2
  488. package/src/sany/nodes.ts +1 -1
  489. package/src/sany/selectors.ts +6 -5
  490. package/src/search.ts +198 -45
  491. package/src/simulate.ts +3 -0
  492. package/src/standard-definitions.ts +4 -0
  493. package/src/state-graph.ts +0 -2
  494. package/src/subexpressions.ts +165 -78
  495. package/src/successors.ts +1 -1
  496. package/src/symmetry.ts +2 -2
  497. package/src/tableau.ts +2 -2
  498. package/src/tlc/fingerprint.ts +81 -9
  499. package/src/tlc/jar-data.ts +12 -0
  500. package/src/tlc/order.ts +14 -3
  501. package/src/tlc/summary.ts +29 -14
  502. package/src/tlc/tlcext-operators.ts +61 -16
  503. package/src/tlc/trace-spec.ts +2 -3
  504. package/src/typed-tier.ts +6541 -0
  505. package/src/typescript/types.ts +2 -2
  506. package/src/values.ts +1 -1
  507. package/src/prover/smt/solver/seq-regex-witness.ts +0 -100
  508. package/src/prover/smt/solver/z3-license.txt +0 -10
  509. package/src/prover/zenon/LICENSE +0 -32
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/math/lp/random_updater_def.h, and shift_var and
2
- // get_freedom_interval_for_column in src/math/lp/int_solver.cpp), MIT license, see z3-license.txt.
3
1
  import { getLcm, Rational } from "../rational";
4
2
  import { IndexedUintSet } from "./containers";
5
3
  import type { LarSolver } from "./lar-solver";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/static_matrix.h, src/math/lp/static_matrix_def.h), MIT license, see z3-license.txt.
2
1
  import { Rational } from "../rational";
3
2
  import type { LarTerm } from "./lar-term";
4
3
 
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/trail.h, src/util/union_find.h), MIT license, see z3-license.txt.
2
1
  import { shrink } from "../array";
3
2
 
4
3
  export class TrailStack {
@@ -21,7 +20,7 @@ export class TrailStack {
21
20
  }
22
21
  }
23
22
 
24
- export interface UnionFindTrail {
23
+ interface UnionFindTrail {
25
24
  push(undo: () => void): void;
26
25
  }
27
26
 
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/ast/macros/macro_finder.cpp, src/ast/macros/macro_manager.cpp,
2
- // src/ast/macros/macro_util.cpp, src/ast/func_decl_dependencies.cpp,
3
- // src/tactic/ufbv/macro_finder_tactic.cpp), MIT license, see z3-license.txt.
4
1
  import {
5
2
  FAMILY_USER,
6
3
  KIND_APP,
@@ -465,7 +462,7 @@ export class MacroManager {
465
462
  if (!isAppOf(manager, expr, OP_EQ)) return undefined;
466
463
  const lhs = manager.getArg(expr, 0);
467
464
  const rhs = manager.getArg(expr, 1);
468
- if (!manager.isGround(lhs) && !manager.isGround(rhs)) return undefined;
465
+ if (!manager.isGroundApp(lhs) && !manager.isGroundApp(rhs)) return undefined;
469
466
  const sort = manager.sorts[lhs];
470
467
  if (manager.isUninterpretedSort(sort) || manager.getSortSize(sort) === 1n) return undefined;
471
468
  if (isMacroHead(manager, lhs, numDecls)) return { head: lhs, value: rhs };
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/mam.cpp), MIT license, see z3-license.txt.
2
1
  import { KIND_VAR, type AstManager } from "./ast";
3
2
  import type { Enode } from "./enode";
4
3
 
@@ -73,7 +72,7 @@ export interface MamEnode<E> {
73
72
  }
74
73
 
75
74
  // The context that undoes a compiler's updates of shared code trees.
76
- export interface CompilerContext {
75
+ interface CompilerContext {
77
76
  readonly manager: AstManager;
78
77
  pushTrail(undo: () => void): void;
79
78
  }
@@ -258,7 +257,7 @@ export class Compiler<E extends MamEnode<E> = Enode> {
258
257
  let numUnboundVars = 0;
259
258
  const visit = (term: number) => {
260
259
  size++;
261
- if (manager.isGround(term)) return;
260
+ if (manager.isGroundApp(term)) return;
262
261
  for (let index = 0; index < manager.getNumArgs(term); index++) {
263
262
  const arg = manager.getArg(term, index);
264
263
  if (manager.kinds[arg] === KIND_VAR) {
@@ -287,7 +286,7 @@ export class Compiler<E extends MamEnode<E> = Enode> {
287
286
  else this.vars[varIndex] = reg;
288
287
  continue;
289
288
  }
290
- if (manager.isGround(pattern)) {
289
+ if (manager.isGroundApp(pattern)) {
291
290
  this.seq.push(mkCheck(reg, hasher.getGroundEnode(pattern, this.quantifier)));
292
291
  this.setMark(reg, NOT_CHECKED);
293
292
  continue;
@@ -364,7 +363,7 @@ export class Compiler<E extends MamEnode<E> = Enode> {
364
363
  let count = 0;
365
364
  let hasUnboundVars = false;
366
365
  const visit = (term: number) => {
367
- if (manager.isGround(term)) return;
366
+ if (manager.isGroundApp(term)) return;
368
367
  for (let index = 0; index < manager.getNumArgs(term); index++) {
369
368
  const arg = manager.getArg(term, index);
370
369
  if (manager.kinds[arg] !== KIND_VAR) visit(arg);
@@ -378,7 +377,7 @@ export class Compiler<E extends MamEnode<E> = Enode> {
378
377
 
379
378
  private genMpFilter(expr: number): number {
380
379
  const manager = this.manager;
381
- if (manager.isGround(expr)) {
380
+ if (manager.isGroundApp(expr)) {
382
381
  const oreg = this.tree.numRegs;
383
382
  this.tree.numRegs += 1;
384
383
  const instr = mkInstruction<E>(OP_GET_ENODE);
@@ -441,7 +440,7 @@ export class Compiler<E extends MamEnode<E> = Enode> {
441
440
  this.todo.push(oreg + index);
442
441
  if (
443
442
  (manager.kinds[arg] === KIND_VAR && this.vars[manager.values[arg]] >= 0) ||
444
- (manager.kinds[arg] !== KIND_VAR && manager.isGround(arg))
443
+ manager.isGroundApp(arg)
445
444
  )
446
445
  hasDepth1Joint = true;
447
446
  }
@@ -451,7 +450,7 @@ export class Compiler<E extends MamEnode<E> = Enode> {
451
450
  const reg = this.vars[manager.values[arg]];
452
451
  return reg >= 0 ? { ...mkNullJoint<E>(), kind: JOINT_VAR, reg } : mkNullJoint<E>();
453
452
  }
454
- if (manager.isGround(arg))
453
+ if (manager.isGroundApp(arg))
455
454
  return {
456
455
  ...mkNullJoint<E>(),
457
456
  kind: JOINT_GROUND,
@@ -543,7 +542,7 @@ export class Compiler<E extends MamEnode<E> = Enode> {
543
542
  const expr = this.getRegister(instr.reg);
544
543
  return (
545
544
  this.isApp(expr) &&
546
- !manager.isGround(expr) &&
545
+ !manager.isGroundApp(expr) &&
547
546
  manager.decls[expr] === instr.label &&
548
547
  manager.getNumArgs(expr) === instr.numArgs
549
548
  );
@@ -556,14 +555,14 @@ export class Compiler<E extends MamEnode<E> = Enode> {
556
555
 
557
556
  private isCheckCompatible(instr: Instruction<E>) {
558
557
  const expr = this.getRegister(instr.reg);
559
- if (!this.isApp(expr) || !this.manager.isGround(expr)) return false;
558
+ if (!this.manager.isGroundApp(expr)) return false;
560
559
  const node = this.hasher.getGroundEnode(expr, this.quantifier);
561
560
  return instr.enode !== null && node !== null && instr.enode.root === node.root;
562
561
  }
563
562
 
564
563
  private getPatLblHash(reg: number) {
565
564
  const expr = this.registers[reg];
566
- if (this.manager.isGround(expr)) {
565
+ if (this.manager.isGroundApp(expr)) {
567
566
  const node = this.hasher.getGroundEnode(expr, this.quantifier);
568
567
  return node === null ? -1 : this.hasher.getLblHash(node);
569
568
  }
@@ -576,7 +575,7 @@ export class Compiler<E extends MamEnode<E> = Enode> {
576
575
  return (
577
576
  expr !== -1 &&
578
577
  this.getMark(instr.reg) === NOT_CHECKED &&
579
- this.manager.isGround(expr) &&
578
+ this.manager.isGroundApp(expr) &&
580
579
  instr.enode !== null &&
581
580
  this.getPatLblHash(instr.reg) === instr.enode.lblHash
582
581
  );
@@ -586,7 +585,7 @@ export class Compiler<E extends MamEnode<E> = Enode> {
586
585
  const expr = this.getRegister(instr.reg);
587
586
  return (
588
587
  this.isApp(expr) &&
589
- !this.manager.isGround(expr) &&
588
+ !this.manager.isGroundApp(expr) &&
590
589
  hasHash(instr.lblLow, instr.lblHigh, this.getPatLblHash(instr.reg))
591
590
  );
592
591
  }
@@ -595,7 +594,7 @@ export class Compiler<E extends MamEnode<E> = Enode> {
595
594
  const expr = this.getRegister(instr.reg);
596
595
  return (
597
596
  expr !== -1 &&
598
- this.manager.isGround(expr) &&
597
+ this.manager.isGroundApp(expr) &&
599
598
  hasHash(instr.lblLow, instr.lblHigh, this.getPatLblHash(instr.reg))
600
599
  );
601
600
  }
@@ -603,7 +602,7 @@ export class Compiler<E extends MamEnode<E> = Enode> {
603
602
  private isFilterSemiCompatible(instr: Instruction<E>) {
604
603
  const expr = this.getRegister(instr.reg);
605
604
  return (
606
- this.getMark(instr.reg) === NOT_CHECKED && this.isApp(expr) && !this.manager.isGround(expr)
605
+ this.getMark(instr.reg) === NOT_CHECKED && this.isApp(expr) && !this.manager.isGroundApp(expr)
607
606
  );
608
607
  }
609
608
 
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/mam.cpp), MIT license, see z3-license.txt.
2
1
  import type { Context } from "./context";
3
2
  import type { Enode } from "./enode";
4
3
  import {
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/tactic/bv/max_bv_sharing_tactic.h, src/ast/simplifiers/max_bv_sharing.cpp),
2
- // MIT license, see z3-license.txt.
3
1
  import type { AstManager } from "./ast";
4
2
  import { runSimplifier } from "./dependent-expr-state";
5
3
  import type { Goal } from "./goal";
@@ -11,17 +9,7 @@ export const runMaxBvSharing = (manager: AstManager) => (goal: Goal) => {
11
9
  runSimplifier(goal, false, (state) => {
12
10
  const rewriter = new MaxBvSharing(manager);
13
11
  return {
14
- reduce: () => {
15
- let rewritten = -1;
16
- state.forEachIndex((index) => {
17
- const form = state.get(index);
18
- const next = rewriter.rewrite(form);
19
- if (rewritten !== -1) manager.decRef(rewritten);
20
- rewritten = next;
21
- if (rewritten !== form) goal.update(index, rewritten);
22
- });
23
- if (rewritten !== -1) manager.decRef(rewritten);
24
- },
12
+ reduce: () => state.rewriteEach((form) => rewriter.rewrite(form)),
25
13
  release: () => rewriter.release(),
26
14
  };
27
15
  });
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/util/max_cliques.h), MIT license, see z3-license.txt.
2
-
3
1
  const getSortedSet = (set: Set<number>) => [...set].sort((left, right) => left - right);
4
2
 
5
3
  export class MaxCliques {
@@ -1,5 +1,4 @@
1
- // Ported from Z3 (src/opt/maxcore.cpp), MIT license, see z3-license.txt. Only the maxres strategy
2
- // with Z3's default parameters is ported.
1
+ // Only the maxres strategy with Z3's default parameters is ported.
3
2
  import { OP_AND, OP_EQ, OP_IMPLIES, OP_OR, SORT_BOOL } from "./ast";
4
3
  import { mkNot } from "./ast-util";
5
4
  import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
@@ -67,13 +66,6 @@ export class Maxcore extends MaxsmtSolverBase {
67
66
  this.trail.push(expr);
68
67
  }
69
68
 
70
- private isTrueIn(model: ProtoModel, expr: number) {
71
- const value = model.eval(expr, true);
72
- const isTrue = value === this.manager.trueExpr;
73
- this.manager.decRef(value);
74
- return isTrue;
75
- }
76
-
77
69
  private isFalseIn(model: ProtoModel, expr: number) {
78
70
  const value = model.eval(expr, true);
79
71
  const isFalse = value === this.manager.falseExpr;
@@ -171,9 +163,10 @@ export class Maxcore extends MaxsmtSolverBase {
171
163
  this.lower = this.upper;
172
164
  return L_TRUE;
173
165
  }
174
- cores.push({ core: items, weight: this.getCoreWeight(items) });
166
+ const weight = this.getCoreWeight(items);
167
+ cores.push({ core: items, weight });
175
168
  this.removeSoft(items);
176
- this.splitCore(items);
169
+ this.splitCore(items, weight);
177
170
  if (items.length >= this.context.params.maxCoreSize) break;
178
171
  status = this.checkSatHillClimb(this.asms.items);
179
172
  }
@@ -211,13 +204,11 @@ export class Maxcore extends MaxsmtSolverBase {
211
204
  .reduce((minimum, weight) => (weight.compare(minimum) < 0 ? weight : minimum));
212
205
  }
213
206
 
214
- private splitCore(core: readonly number[]) {
215
- const weight = this.getCoreWeight(core);
207
+ private splitCore(core: readonly number[], weight: Rational) {
216
208
  for (const expr of core) {
217
209
  const other = this.getWeight(expr);
218
210
  if (other.compare(weight) > 0) this.newAssumption(expr, other.sub(weight));
219
211
  }
220
- return weight;
221
212
  }
222
213
 
223
214
  private updateModel(def: number, value: number) {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/maximize_ac_sharing.cpp), MIT license, see z3-license.txt.
2
1
  import { OP_ADD, OP_BADD, OP_BAND, OP_BMUL, OP_BOR, OP_OR } from "./ast";
3
2
  import { RewriterTpl } from "./rewriter-tpl";
4
3
  import { shrink } from "./array";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/opt/maxlex.cpp), MIT license, see z3-license.txt.
2
1
  import { OP_NOT, SORT_BOOL } from "./ast";
3
2
  import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
4
3
  import { type MaxsatContext, MaxsmtSolverBase, type Soft } from "./maxsmt-base";
@@ -24,13 +23,6 @@ export class Maxlex extends MaxsmtSolverBase {
24
23
  );
25
24
  }
26
25
 
27
- private isTrueIn(model: ProtoModel, expr: number) {
28
- const value = model.eval(expr, true);
29
- const isTrue = value === this.manager.trueExpr;
30
- this.manager.decRef(value);
31
- return isTrue;
32
- }
33
-
34
26
  private assertValue(soft: Soft) {
35
27
  if (soft.value === L_TRUE) this.solver.assertExpr(soft.expr);
36
28
  else if (soft.value === L_FALSE) {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/opt/maxsmt.h, src/opt/maxsmt.cpp), MIT license, see z3-license.txt.
2
1
  import { type AstManager, SORT_BOOL } from "./ast";
3
2
  import { L_TRUE, L_UNDEF } from "./lbool";
4
3
  import { Preprocess } from "./opt-preprocess";
@@ -65,6 +64,13 @@ export abstract class MaxsmtSolverBase {
65
64
  return this.context.getSolver();
66
65
  }
67
66
 
67
+ protected isTrueIn(model: ProtoModel, expr: number) {
68
+ const value = model.eval(expr, true);
69
+ const isTrue = value === this.manager.trueExpr;
70
+ this.manager.decRef(value);
71
+ return isTrue;
72
+ }
73
+
68
74
  protected init() {
69
75
  this.lower = Rational.zero;
70
76
  this.upper = Rational.zero;
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/opt/maxsmt.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtCanceledError, SmtUnsupportedError } from "../../../errors";
3
2
  import { L_FALSE, L_UNDEF } from "./lbool";
4
3
  import { Maxcore } from "./maxcore";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/qe/mbp/mbp_arith.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError, SmtUnsupportedError } from "../../../../errors";
3
2
  import {
4
3
  type AstManager,
@@ -15,7 +14,6 @@ import {
15
14
  OP_LT,
16
15
  OP_MOD,
17
16
  OP_MUL,
18
- OP_NUM,
19
17
  OP_OR,
20
18
  OP_SUB,
21
19
  OP_UMINUS,
@@ -23,7 +21,7 @@ import {
23
21
  SORT_INT,
24
22
  SORT_REAL,
25
23
  } from "../ast";
26
- import { getExtendedNumeral, isAppOf, mkNot } from "../ast-util";
24
+ import { getExtendedNumeral, mkNot } from "../ast-util";
27
25
  import { ExprSafeReplace } from "../expr-safe-replace";
28
26
  import { ObjMap } from "../hashtable";
29
27
  import {
@@ -44,19 +42,11 @@ import {
44
42
  } from "../model-based-opt";
45
43
  import { getEuclideanDiv, getEuclideanMod, Rational } from "../rational";
46
44
  import type { RefVector } from "../ref-vector";
47
- import { markRec, type MbpContext } from "./mbp-plugin";
45
+ import { getBinaryArgs, getNumeral, markRec, type MbpContext } from "./mbp-plugin";
48
46
 
49
47
  const isArith = (manager: AstManager, expr: number) =>
50
48
  manager.sorts[expr] === SORT_INT || manager.sorts[expr] === SORT_REAL;
51
49
 
52
- const getBinaryArgs = (manager: AstManager, expr: number, op: number) =>
53
- isAppOf(manager, expr, op) && manager.getNumArgs(expr) === 2
54
- ? [manager.getArg(expr, 0), manager.getArg(expr, 1)]
55
- : undefined;
56
-
57
- const getNumeral = (manager: AstManager, expr: number) =>
58
- isAppOf(manager, expr, OP_NUM) ? manager.getRationalValue(expr) : undefined;
59
-
60
50
  const insertMul = (terms: ObjMap<Rational>, expr: number, value: Rational) =>
61
51
  terms.set(expr, (terms.get(expr) ?? Rational.zero).add(value));
62
52
 
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/qe/mbp/mbp_basic_tg.cpp), MIT license, see z3-license.txt.
2
1
  import { OP_AND, OP_DISTINCT, OP_IMPLIES, OP_ITE, OP_OR } from "../ast";
3
2
  import { isAppOf, mkNot } from "../ast-util";
4
3
  import type { MbpContext } from "./mbp-plugin";
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/qe/mbp/mbp_plugin.cpp, src/model/model.cpp), MIT license, see
2
- // z3-license.txt.
3
1
  import { SmtUnsupportedError } from "../../../../errors";
4
2
  import {
5
3
  type AstManager,
@@ -10,6 +8,7 @@ import {
10
8
  OP_EQ,
11
9
  OP_IMPLIES,
12
10
  OP_ITE,
11
+ OP_NUM,
13
12
  OP_OR,
14
13
  OP_XOR,
15
14
  SORT_BOOL,
@@ -59,6 +58,14 @@ export class MbpContext {
59
58
  const isIff = (manager: AstManager, expr: number) =>
60
59
  isAppOf(manager, expr, OP_EQ) && manager.sorts[manager.getArg(expr, 0)] === SORT_BOOL;
61
60
 
61
+ export const getBinaryArgs = (manager: AstManager, expr: number, op: number) =>
62
+ isAppOf(manager, expr, op) && manager.getNumArgs(expr) === 2
63
+ ? [manager.getArg(expr, 0), manager.getArg(expr, 1)]
64
+ : undefined;
65
+
66
+ export const getNumeral = (manager: AstManager, expr: number) =>
67
+ isAppOf(manager, expr, OP_NUM) ? manager.getRationalValue(expr) : undefined;
68
+
62
69
  export const markRec = (manager: AstManager, visited: Set<number>, expr: number) => {
63
70
  const todo = [expr];
64
71
  for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/qe/mbp/mbp_qel.cpp), MIT license, see z3-license.txt.
2
1
  import { OP_DISTINCT, OP_IMPLIES, OP_ITE, OP_OR, SORT_BOOL } from "../ast";
3
2
  import { flattenAndVector, isAppOf } from "../ast-util";
4
3
  import { RefVector } from "../ref-vector";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/qe/mbp/mbp_solve_plugin.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  type AstManager,
4
3
  FAMILY_ARITH,
@@ -11,7 +10,6 @@ import {
11
10
  OP_LE,
12
11
  OP_MOD,
13
12
  OP_MUL,
14
- OP_NUM,
15
13
  OP_SUB,
16
14
  OP_UMINUS,
17
15
  SORT_BOOL,
@@ -20,6 +18,7 @@ import {
20
18
  } from "../ast";
21
19
  import { isAppOf, mkNot } from "../ast-util";
22
20
  import { Rational } from "../rational";
21
+ import { getBinaryArgs, getNumeral } from "./mbp-plugin";
23
22
 
24
23
  export interface SolvePlugin {
25
24
  readonly family: number;
@@ -33,14 +32,6 @@ interface SignedExpr {
33
32
  expr: number;
34
33
  }
35
34
 
36
- const getBinaryArgs = (manager: AstManager, expr: number, op: number) =>
37
- isAppOf(manager, expr, op) && manager.getNumArgs(expr) === 2
38
- ? [manager.getArg(expr, 0), manager.getArg(expr, 1)]
39
- : undefined;
40
-
41
- const getNumeral = (manager: AstManager, expr: number) =>
42
- isAppOf(manager, expr, OP_NUM) ? manager.getRationalValue(expr) : undefined;
43
-
44
35
  const isZero = (manager: AstManager, expr: number) => getNumeral(manager, expr)?.isZero() === true;
45
36
 
46
37
  export const mkArithSolvePlugin = (
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/qe/mbp/mbp_term_graph.cpp), MIT license, see z3-license.txt.
2
1
  import { type AstManager, KIND_APP, OP_AND, OP_DISTINCT, OP_EQ, SORT_BOOL } from "../ast";
3
2
  import { getNumExprs, isAppOf } from "../ast-util";
4
3
  import { RefVector } from "../ref-vector";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/simplex/model_based_opt.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../errors";
3
2
  import { getEuclideanDiv, getEuclideanMod, getGcd, getLcm, Rational } from "./rational";
4
3
 
@@ -29,7 +28,7 @@ export const DEF_ADD = 0;
29
28
  export const DEF_MUL = 1;
30
29
  export const DEF_DIV = 2;
31
30
  export const DEF_CONST = 3;
32
- export const DEF_VAR = 4;
31
+ const DEF_VAR = 4;
33
32
 
34
33
  interface AddDef {
35
34
  readonly kind: typeof DEF_ADD;
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_model_checker.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../errors";
3
2
  import { KIND_APP, OP_NOT, OP_OR, SORT_BOOL } from "./ast";
4
3
  import { AssertedFormulas } from "./asserted-formulas";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/model/model_evaluator.cpp), MIT license, see z3-license.txt.
2
1
  import { mkArrayApp } from "./array-decl-plugin";
3
2
  import {
4
3
  FAMILY_ARITH,
@@ -32,6 +31,7 @@ import {
32
31
  SORT_BOOL,
33
32
  } from "./ast";
34
33
  import type { AstManager } from "./ast";
34
+ import { DEFAULT_BV_OPTIONS } from "./bv-rewriter";
35
35
  import { isConsideredUninterpreted } from "./fpa-decl-plugin";
36
36
  import { FuncInterp, getManagerSomeValue } from "./proto-model";
37
37
  import type { ProtoModel } from "./proto-model";
@@ -61,7 +61,10 @@ export class ModelEvaluator extends RewriterTpl {
61
61
  private model: ProtoModel,
62
62
  ) {
63
63
  super(manager);
64
- this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
64
+ this.rewriter = new Rewriter(manager, {
65
+ ...TACTIC_REWRITER_OPTIONS,
66
+ bv: { ...DEFAULT_BV_OPTIONS, isHiDiv0: manager.isHiDiv0, isMkbv2num: true },
67
+ });
65
68
  this.rewriter.releaseResult = () => this.setLastResult(-1);
66
69
  }
67
70
 
@@ -124,7 +127,7 @@ export class ModelEvaluator extends RewriterTpl {
124
127
  if (interp === undefined) return -1;
125
128
  if (interp.isPartial()) interp.setElse(model.getSomeValue(sort));
126
129
  const result = this.substitute(interp.getInterp() as number, args);
127
- return manager.isGround(result) ? { expr: result, depth: Infinity } : result;
130
+ return manager.isGroundApp(result) ? { expr: result, depth: Infinity } : result;
128
131
  }
129
132
  const rewritten = this.rewriter.reduceAppCore(decl, args);
130
133
  const reduced =
@@ -192,7 +195,7 @@ export class ModelEvaluator extends RewriterTpl {
192
195
  model.registerFunc(decl, created);
193
196
  return value;
194
197
  }
195
- if (!manager.isGround(args[0])) return manager.mkApp(decl, args, sort);
198
+ if (!manager.isGroundApp(args[0])) return manager.mkApp(decl, args, sort);
196
199
  }
197
200
  if (op === OP_DT_CONSTRUCTOR) return manager.mkApp(decl, args, sort);
198
201
  if (interp === undefined) return -1;
@@ -221,11 +224,11 @@ export class ModelEvaluator extends RewriterTpl {
221
224
  );
222
225
  const elseExpr = interp?.elseExpr ?? null;
223
226
  if (interp === undefined || elseExpr === null) return undefined;
224
- let isGround = manager.isGround(elseExpr);
227
+ let isGround = manager.isGroundApp(elseExpr);
225
228
  for (const entry of interp.entries) {
226
229
  if (entry.result === elseExpr) continue;
227
230
  const store = [...entry.args, entry.result];
228
- isGround &&= store.every((arg) => manager.isGround(arg));
231
+ isGround &&= store.every((arg) => manager.isGroundApp(arg));
229
232
  stores.push(store);
230
233
  }
231
234
  return isGround ? { stores, elseExpr, areUnique } : undefined;
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_model_finder.cpp), MIT license, see z3-license.txt.
2
1
  import { OP_OR, SORT_BOOL, type AstManager } from "./ast";
3
2
  import type { Context } from "./context";
4
3
  import { L_TRUE } from "./lbool";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_model_generator.cpp), MIT license, see z3-license.txt.
2
1
  import { FAMILY_BASIC, FAMILY_USER, SORT_BOOL } from "./ast";
3
2
  import type { Context } from "./context";
4
3
  import { Enode } from "./enode";
@@ -105,7 +104,9 @@ export const mkModel = (context: Context): GeneratedModel => {
105
104
  interp = new FuncInterp(manager, node.numArgs);
106
105
  model.registerFunc(node.decl, interp);
107
106
  }
108
- const args = Array.from({ length: node.numArgs }, (_, index) => getValue(node.getArg(index)));
107
+ const args = Array.from({ length: node.numArgs }, (_value, index) =>
108
+ getValue(node.getArg(index)),
109
+ );
109
110
  if (interp.getEntry(args) === undefined) interp.insertNewEntry(args, getValue(node));
110
111
  }
111
112
  for (const theory of context.theories) theory.finalizeModel();
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/model/model_macro_solver.cpp, src/ast/macros/macro_util.cpp, src/ast/func_decl_dependencies.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  FAMILY_BASIC,
4
3
  FAMILY_USER,
@@ -117,7 +116,7 @@ const getHintHeadVars = (manager: AstManager, expr: number) => {
117
116
  const isVarsOfSubset = (manager: AstManager, expr: number, vars: number[]) => {
118
117
  const visited = new Set<number>();
119
118
  const visit = (current: number): boolean => {
120
- if (manager.isGround(current) || visited.has(current)) return true;
119
+ if (manager.isGroundApp(current) || visited.has(current)) return true;
121
120
  visited.add(current);
122
121
  const kind = manager.kinds[current];
123
122
  if (kind === KIND_VAR) return vars.includes(current);
@@ -555,7 +554,7 @@ const collectNgFuncDecls = (manager: AstManager, expr: number) => {
555
554
  visit(manager.getArg(current, index));
556
555
  if (
557
556
  manager.getNumArgs(current) > 0 &&
558
- !manager.isGround(current) &&
557
+ !manager.isGroundApp(current) &&
559
558
  isUserApp(manager, current)
560
559
  )
561
560
  decls.add(manager.decls[current]);
@@ -592,7 +591,7 @@ const nonAufMacroSolver = (manager: AstManager, model: ProtoModel, getInfo: GetI
592
591
  const isBetterMacro = (first: CondMacro, second: CondMacro | null) => {
593
592
  if (second === null || !first.isHint) return true;
594
593
  if (!second.isHint) return false;
595
- return manager.isGround(first.def) && !manager.isGround(second.def);
594
+ return manager.isGroundApp(first.def) && !manager.isGroundApp(second.def);
596
595
  };
597
596
  const getMacroFor = (decl: number, quantifier: number) => {
598
597
  let result: CondMacro | null = null;
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/model/model_smt2_pp.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  type AstManager,
4
3
  FAMILY_ARITH,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/mpf.h, src/util/mpf.cpp), MIT license, see z3-license.txt.
2
1
  import { Rational } from "./rational";
3
2
 
4
3
  export const MPF_ROUND_NEAREST_TEVEN = 0;
@@ -45,9 +44,9 @@ const getRoot = (value: bigint) => {
45
44
  return low * low === value ? { root: low, isExact: true } : { root: low + 1n, isExact: false };
46
45
  };
47
46
 
48
- export const mkBotExp = (ebits: number) => -(2 ** (ebits - 1) - 1);
47
+ const mkBotExp = (ebits: number) => -(2 ** (ebits - 1) - 1);
49
48
 
50
- export const mkTopExp = (ebits: number) => 2 ** (ebits - 1);
49
+ const mkTopExp = (ebits: number) => 2 ** (ebits - 1);
51
50
 
52
51
  export const mkMinExp = (ebits: number) => mkBotExp(ebits) + 1;
53
52
 
@@ -99,8 +98,6 @@ export const isPzero = (value: Mpf) => !value.sign && isZero(value);
99
98
 
100
99
  export const isNeg = (value: Mpf) => value.sign && !isNan(value);
101
100
 
102
- export const isPos = (value: Mpf) => !value.sign && !isNan(value);
103
-
104
101
  export const isDenormal = (value: Mpf) => !isZero(value) && hasBotExp(value);
105
102
 
106
103
  export const isNormal = (value: Mpf) => !(hasTopExp(value) || isDenormal(value) || isZero(value));
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/solver/mus.cpp), MIT license, see z3-license.txt.
2
1
  import type { AstManager } from "./ast";
3
2
  import { mkNot } from "./ast-util";
4
3
  import { L_TRUE, L_UNDEF } from "./lbool";
@@ -34,8 +33,7 @@ export class Mus {
34
33
  return L_TRUE;
35
34
  }
36
35
  let unknown = [...literals];
37
- while (unknown.length > 0) {
38
- const literal = unknown.pop() as number;
36
+ for (let literal = unknown.pop(); literal !== undefined; literal = unknown.pop()) {
39
37
  const notLiteral = mkNot(this.manager, literal);
40
38
  this.trail.push(notLiteral);
41
39
  const status = this.solver.checkSat([...mus.items, ...unknown, notLiteral]);