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/muz/base/dl_rule_transformer.cpp, src/muz/transforms/dl_transforms.cpp), MIT
2
- // license, see z3-license.txt.
3
1
  import { SmtUnsupportedError } from "../../../../errors";
4
2
  import type { DatalogContext } from "./dl-context";
5
3
  import { MkBitBlast } from "./dl-mk-bit-blast";
@@ -12,7 +10,6 @@ import { RuleSet } from "./dl-rule-set";
12
10
 
13
11
  export interface RuleTransformerPlugin {
14
12
  readonly priority: number;
15
- readonly canDestratifyNegation?: boolean;
16
13
  apply(source: RuleSet): RuleSet | undefined;
17
14
  }
18
15
 
@@ -50,7 +47,6 @@ export const transformRules = (context: DatalogContext, plugins: RuleTransformer
50
47
  context.manager.limit.checkpoint();
51
48
  const result = plugin.apply(rules);
52
49
  if (result === undefined) continue;
53
- if (plugin.canDestratifyNegation === true && !result.isClosed() && !result.close()) continue;
54
50
  isModified = true;
55
51
  rules = result;
56
52
  rules.ensureClosed();
@@ -1,8 +1,7 @@
1
- // Ported from Z3 (src/muz/base/dl_rule.cpp, src/muz/base/bind_variables.cpp), MIT license, see
2
- // z3-license.txt.
3
1
  import { SmtTacticError, SmtUnsupportedError } from "../../../../errors";
4
2
  import {
5
3
  type AstManager,
4
+ getSymbolName,
6
5
  KIND_APP,
7
6
  KIND_QUANTIFIER,
8
7
  KIND_VAR,
@@ -14,6 +13,7 @@ import {
14
13
  } from "../ast";
15
14
  import { flattenAndVector } from "../ast-util";
16
15
  import { RefVector } from "../ref-vector";
16
+ import { DEFAULT_PRINT_OPTIONS, printExpr } from "../smt2-printer";
17
17
  import { getFreeVarSorts, VarSubst } from "../var-subst";
18
18
  import { simplifyQuantifiers } from "../qe";
19
19
  import { QuantifierHoister } from "../quant-hoist";
@@ -21,6 +21,24 @@ import type { DatalogContext } from "./dl-context";
21
21
  import { Hnf } from "./hnf";
22
22
  import type { RuleSet } from "./dl-rule-set";
23
23
 
24
+ const PRINT_ENVIRONMENT = {
25
+ options: DEFAULT_PRINT_OPTIONS,
26
+ isUsed: () => false,
27
+ isClashing: () => false,
28
+ };
29
+
30
+ export const mkPp = (manager: AstManager, expr: number) =>
31
+ printExpr(manager, PRINT_ENVIRONMENT, expr);
32
+
33
+ // output_predicate of src/muz/base/dl_util.cpp.
34
+ const outputPredicate = (manager: AstManager, predicate: number) =>
35
+ `${getSymbolName(manager.funcDecls[manager.decls[predicate]].name)}(${manager
36
+ .getArgs(predicate)
37
+ .map((arg) =>
38
+ manager.kinds[arg] === KIND_VAR ? `#${manager.values[arg]}` : mkPp(manager, arg),
39
+ )
40
+ .join(",")})`;
41
+
24
42
  // The tail lists the positive predicates, then the negated ones, then the interpreted formulas.
25
43
  export class Rule {
26
44
  constructor(
@@ -45,6 +63,24 @@ export class Rule {
45
63
  if (this.isNegated[index]) return true;
46
64
  return false;
47
65
  }
66
+
67
+ // symbol::str of the name, where the empty name is the null symbol.
68
+ getNameText() {
69
+ return this.name === "" ? "<null>" : this.name;
70
+ }
71
+
72
+ display(context: DatalogContext) {
73
+ const manager = context.manager;
74
+ const head = `${this.getNameText()}:\n${outputPredicate(manager, this.head)}`;
75
+ if (this.tail.length === 0) return `${head}.\n`;
76
+ const tail = this.tail.map(
77
+ (literal, index) =>
78
+ `\n ${this.isNegated[index] ? "not " : ""}${
79
+ context.isPredicate(literal) ? outputPredicate(manager, literal) : mkPp(manager, literal)
80
+ }`,
81
+ );
82
+ return `${head} :- ${tail.join(",")}.\n`;
83
+ }
48
84
  }
49
85
 
50
86
  // The sorts of the free variables of the expressions, by index, as Z3's used_vars collects them.
@@ -100,46 +136,71 @@ export class BindVariables {
100
136
  const bound = new Map<number, number>();
101
137
  const names: string[] = [];
102
138
  const sorts: number[] = [];
139
+ const todo: number[] = [];
140
+ // The arguments of an application are abstracted last to first, as Z3's stack pops them.
103
141
  const abstract = (term: number, scope: number, cache: Map<number, number>): number => {
104
- const cached = cache.get(term);
105
- if (cached !== undefined) return cached;
106
- const kind = manager.kinds[term];
107
- const result = (() => {
108
- if (kind === KIND_VAR) return term;
109
- if (kind === KIND_QUANTIFIER) {
110
- const data = manager.getQuantifier(term);
142
+ const size = todo.length;
143
+ todo.push(term);
144
+ while (todo.length > size) {
145
+ const current = todo[todo.length - 1];
146
+ if (cache.has(current)) {
147
+ todo.pop();
148
+ continue;
149
+ }
150
+ const kind = manager.kinds[current];
151
+ if (kind === KIND_VAR) cache.set(current, current);
152
+ else if (kind === KIND_QUANTIFIER) {
153
+ const data = manager.getQuantifier(current);
111
154
  const innerScope = scope + data.sorts.length;
112
155
  const innerCache = new Map<number, number>();
113
156
  const patterns = data.patterns.map((pattern) =>
114
157
  abstract(pattern, innerScope, innerCache),
115
158
  );
116
- return manager.mkQuantifier({
117
- ...data,
118
- patterns,
119
- body: abstract(data.body, innerScope, innerCache),
120
- });
121
- }
122
- if (this.vars.includes(term)) {
159
+ cache.set(
160
+ current,
161
+ manager.mkQuantifier({
162
+ ...data,
163
+ patterns,
164
+ body: abstract(data.body, innerScope, innerCache),
165
+ }),
166
+ );
167
+ } else if (this.vars.includes(current)) {
123
168
  const existing =
124
- bound.get(term) ??
169
+ bound.get(current) ??
125
170
  (() => {
126
- const variable = manager.mkVar(names.length, manager.sorts[term]);
127
- names.push(manager.getDeclName(term));
128
- sorts.push(manager.sorts[term]);
129
- bound.set(term, variable);
171
+ const variable = manager.mkVar(names.length, manager.sorts[current]);
172
+ names.push(manager.getDeclName(current));
173
+ sorts.push(manager.sorts[current]);
174
+ bound.set(current, variable);
130
175
  return variable;
131
176
  })();
132
- return scope === 0
133
- ? existing
134
- : manager.mkVar(scope + manager.values[existing], manager.sorts[existing]);
177
+ cache.set(
178
+ current,
179
+ scope === 0
180
+ ? existing
181
+ : manager.mkVar(scope + manager.values[existing], manager.sorts[existing]),
182
+ );
183
+ } else {
184
+ const args: number[] = [];
185
+ let isAllVisited = true;
186
+ for (const arg of manager.getArgs(current)) {
187
+ const abstracted = cache.get(arg);
188
+ if (abstracted === undefined) {
189
+ todo.push(arg);
190
+ isAllVisited = false;
191
+ } else if (isAllVisited) args.push(abstracted);
192
+ }
193
+ if (!isAllVisited) continue;
194
+ cache.set(
195
+ current,
196
+ args.every((arg, index) => arg === manager.getArg(current, index))
197
+ ? current
198
+ : manager.mkApp(manager.decls[current], args, manager.sorts[current]),
199
+ );
135
200
  }
136
- const args = manager.getArgs(term).map((arg) => abstract(arg, scope, cache));
137
- return args.every((arg, index) => arg === manager.getArg(term, index))
138
- ? term
139
- : manager.mkApp(manager.decls[term], args, manager.sorts[term]);
140
- })();
141
- cache.set(term, result);
142
- return result;
201
+ todo.pop();
202
+ }
203
+ return cache.get(term) ?? term;
143
204
  };
144
205
  const body = abstract(fml, 0, new Map());
145
206
  if (names.length === 0) return body;
@@ -321,7 +382,7 @@ export class RuleManager {
321
382
  return mkForall(
322
383
  manager,
323
384
  sorts,
324
- sorts.map((_, index) => getVarName(index)),
385
+ sorts.map((_value, index) => getVarName(index)),
325
386
  matrix,
326
387
  );
327
388
  }
@@ -359,6 +420,7 @@ export class RuleManager {
359
420
  names.reverse();
360
421
  const queryPredicate = this.context.mkFreshHeadPredicate("query", "", domain);
361
422
  rules.setOutputPredicate(queryPredicate);
423
+ this.context.addGenericModelConverter([{ decl: queryPredicate, def: -1 }]);
362
424
  const head = manager.mkApp(
363
425
  queryPredicate,
364
426
  domain.map((sort, index) => manager.mkVar(domain.length - index - 1, sort)),
@@ -417,7 +479,7 @@ export class RuleManager {
417
479
  const preQuant = this.pin(varSubst.apply(unboundTail, subst));
418
480
  varSubst.release();
419
481
  sorts.reverse();
420
- const names = sorts.map((_, index) => String(sorts.length - 1 - index));
482
+ const names = sorts.map((_value, index) => String(sorts.length - 1 - index));
421
483
  const quantified = this.pin(mkExists(manager, sorts, names, preQuant));
422
484
  let fixed = isTryingQe ? this.pin(simplifyQuantifiers(manager, quantified)) : quantified;
423
485
  if (manager.kinds[fixed] !== KIND_APP) fixed = this.pin(manager.mkEq(fixed, manager.trueExpr));
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/muz/base/hnf.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  type AstManager,
4
3
  FAMILY_USER,
@@ -47,8 +46,10 @@ export class Hnf {
47
46
  if (visited.has(current)) continue;
48
47
  visited.add(current);
49
48
  const kind = manager.kinds[current];
50
- if (kind === KIND_QUANTIFIER) todo.push(manager.getQuantifier(current).body);
51
- else if (kind === KIND_APP) {
49
+ if (kind === KIND_QUANTIFIER) {
50
+ const quantifier = manager.getQuantifier(current);
51
+ todo.push(quantifier.body, ...quantifier.patterns, ...quantifier.noPatterns);
52
+ } else if (kind === KIND_APP) {
52
53
  if (this.isPredicate(current)) return true;
53
54
  manager.pushArgs(current, todo);
54
55
  }
@@ -172,12 +173,11 @@ export class Hnf {
172
173
  used.forEach((sort, index) => {
173
174
  if (sort !== undefined) args.push(manager.mkVar(index, sort));
174
175
  });
176
+ // Z3 passes an empty suffix that is not the null symbol, so the name has two separators.
175
177
  const decl = manager.mkFreshFuncDecl(
176
- this.name,
178
+ `${this.name}!`,
177
179
  args.map((arg) => manager.sorts[arg]),
178
180
  SORT_BOOL,
179
- true,
180
- "",
181
181
  );
182
182
  manager.incDeclRef(decl);
183
183
  this.freshPredicates.push(decl);
@@ -0,0 +1,176 @@
1
+ import {
2
+ FAMILY_USER,
3
+ KIND_APP,
4
+ KIND_QUANTIFIER,
5
+ KIND_VAR,
6
+ OP_AND,
7
+ OP_OR,
8
+ QUANTIFIER_EXISTS,
9
+ SORT_BOOL,
10
+ } from "../ast";
11
+ import { L_FALSE, L_TRUE } from "../lbool";
12
+ import { FuncInterp, type ProtoModel } from "../proto-model";
13
+ import { VarSubst } from "../var-subst";
14
+ import type { DatalogContext } from "./dl-context";
15
+ import { getUsedVars, type Rule } from "./dl-rule";
16
+
17
+ export class HornSubsumeModelConverter {
18
+ private delayHeads: number[] = [];
19
+ private delayBodies: number[] = [];
20
+ private funcs: number[] = [];
21
+ private bodies: number[] = [];
22
+
23
+ constructor(private context: DatalogContext) {}
24
+
25
+ insert(head: number, body: readonly number[]) {
26
+ const manager = this.context.manager;
27
+ const conjunction = this.context.rewriter.mkAnd([...body]);
28
+ manager.incRef(head);
29
+ manager.incRef(conjunction);
30
+ this.delayHeads.push(head);
31
+ this.delayBodies.push(conjunction);
32
+ }
33
+
34
+ // The predicate of the head is the body with the head's arguments as the variables above the
35
+ // existentially bound ones. The result comes with a reference.
36
+ mkHorn(head: number, body: number) {
37
+ const manager = this.context.manager;
38
+ const args = manager.getArgs(head);
39
+ const sorts = getUsedVars(manager, [head, body]).map((sort) => sort ?? SORT_BOOL);
40
+ if (args.length === 0 && sorts.length === 0) {
41
+ manager.incRef(body);
42
+ return body;
43
+ }
44
+ const conjs = [body];
45
+ const subst: number[] = [];
46
+ args.forEach((arg, index) => {
47
+ const variable = manager.mkVar(sorts.length + index, manager.sorts[arg]);
48
+ if (manager.kinds[arg] !== KIND_VAR) {
49
+ conjs.push(manager.mkEq(variable, arg));
50
+ return;
51
+ }
52
+ const argIndex = manager.values[arg];
53
+ while (subst.length <= argIndex) subst.push(-1);
54
+ if (subst[argIndex] === -1) subst[argIndex] = variable;
55
+ else conjs.push(manager.mkEq(variable, subst[argIndex]));
56
+ });
57
+ const conjunction = manager.mkApp(OP_AND, conjs, SORT_BOOL);
58
+ manager.incRef(conjunction);
59
+ const varSubst = new VarSubst(manager, false);
60
+ const substituted = varSubst.apply(conjunction, subst);
61
+ varSubst.release();
62
+ manager.decRef(conjunction);
63
+ if (sorts.length === 0) return substituted;
64
+ const quantified = manager.mkQuantifier({
65
+ kind: QUANTIFIER_EXISTS,
66
+ sorts: sorts.reverse(),
67
+ names: sorts.map((_value, index) => sorts.length - index - 1),
68
+ body: substituted,
69
+ patterns: [],
70
+ noPatterns: [],
71
+ weight: 0,
72
+ qid: "",
73
+ });
74
+ manager.incRef(quantified);
75
+ manager.decRef(substituted);
76
+ const result = this.context.simplify(quantified);
77
+ manager.decRef(quantified);
78
+ return result;
79
+ }
80
+
81
+ // add_default_proc under for_each_expr: the predicates the model leaves open are false.
82
+ private addDefaultFalseInterpretation(root: number, model: ProtoModel) {
83
+ const manager = this.context.manager;
84
+ const visited = new Set<number>([root]);
85
+ const exprs = [root];
86
+ const positions = [0];
87
+ while (exprs.length > 0) {
88
+ const current = exprs[exprs.length - 1];
89
+ const quantifier =
90
+ manager.kinds[current] === KIND_QUANTIFIER ? manager.getQuantifier(current) : undefined;
91
+ const children =
92
+ quantifier !== undefined
93
+ ? [quantifier.body, ...quantifier.patterns, ...quantifier.noPatterns]
94
+ : manager.kinds[current] === KIND_APP
95
+ ? manager.getArgs(current)
96
+ : [];
97
+ const position = positions[positions.length - 1];
98
+ if (position < children.length) {
99
+ positions[positions.length - 1]++;
100
+ const child = children[position];
101
+ if (visited.has(child)) continue;
102
+ visited.add(child);
103
+ exprs.push(child);
104
+ positions.push(0);
105
+ continue;
106
+ }
107
+ exprs.pop();
108
+ positions.pop();
109
+ if (manager.kinds[current] !== KIND_APP || manager.sorts[current] !== SORT_BOOL) continue;
110
+ const decl = manager.decls[current];
111
+ const info = manager.funcDecls[decl];
112
+ if (
113
+ info.family !== FAMILY_USER ||
114
+ model.constInterps.has(decl) ||
115
+ model.funcInterps.has(decl)
116
+ )
117
+ continue;
118
+ if (info.domain.length === 0) {
119
+ model.registerConst(decl, manager.falseExpr);
120
+ continue;
121
+ }
122
+ const interp = new FuncInterp(manager, info.domain.length);
123
+ interp.setElse(manager.falseExpr);
124
+ model.registerFunc(decl, interp);
125
+ }
126
+ }
127
+
128
+ apply(model: ProtoModel) {
129
+ const manager = this.context.manager;
130
+ this.delayHeads.forEach((head, index) => {
131
+ this.funcs.push(manager.decls[head]);
132
+ this.bodies.push(this.mkHorn(head, this.delayBodies[index]));
133
+ });
134
+ this.delayHeads = [];
135
+ this.delayBodies = [];
136
+ for (let index = this.funcs.length - 1; index >= 0; index--) {
137
+ const decl = this.funcs[index];
138
+ this.addDefaultFalseInterpretation(this.bodies[index], model);
139
+ const body = model.eval(this.bodies[index], false);
140
+ if (manager.funcDecls[decl].domain.length === 0) {
141
+ const old = model.constInterps.get(decl);
142
+ const merged = old === undefined ? body : manager.mkApp(OP_OR, [old, body], SORT_BOOL);
143
+ const simplified = this.context.simplify(merged);
144
+ model.registerConst(decl, simplified);
145
+ manager.decRef(simplified);
146
+ manager.decRef(body);
147
+ continue;
148
+ }
149
+ const old = model.funcInterps.get(decl);
150
+ const interp = old ?? new FuncInterp(manager, manager.funcDecls[decl].domain.length);
151
+ if (old === undefined) model.registerFunc(decl, interp);
152
+ const oldElse = old === undefined ? null : old.elseExpr;
153
+ const merged = oldElse === null ? body : manager.mkApp(OP_OR, [oldElse, body], SORT_BOOL);
154
+ const simplified = this.context.simplify(merged);
155
+ interp.setElse(simplified);
156
+ manager.decRef(simplified);
157
+ manager.decRef(body);
158
+ }
159
+ return model;
160
+ }
161
+
162
+ // del_rule of dl_util.cpp.
163
+ delRule(rule: Rule, unreachable: number) {
164
+ const manager = this.context.manager;
165
+ this.insert(
166
+ rule.head,
167
+ unreachable === L_TRUE
168
+ ? [manager.trueExpr]
169
+ : unreachable === L_FALSE
170
+ ? [manager.falseExpr]
171
+ : rule.tail.map((literal, index) =>
172
+ rule.isNegated[index] ? manager.mkNot(literal) : literal,
173
+ ),
174
+ );
175
+ }
176
+ }
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/muz/fp/horn_tactic.cpp, src/muz/fp/dl_register_engine.cpp), MIT license,
2
- // see z3-license.txt.
3
1
  import { SmtTacticError, SmtUnsupportedError } from "../../../../errors";
4
2
  import {
5
3
  type AstManager,
@@ -20,7 +18,7 @@ import { RefVector } from "../ref-vector";
20
18
  import type { RewriterOptions } from "../rewriter";
21
19
  import { getFreeVarSorts } from "../var-subst";
22
20
  import { DatalogContext, ENGINE_SPACER, FpParams } from "./dl-context";
23
- import { mkForall } from "./dl-rule";
21
+ import { mkForall, mkPp } from "./dl-rule";
24
22
  import { SpacerDlInterface } from "./spacer-dl-interface";
25
23
 
26
24
  export const createDatalogContext = (
@@ -140,7 +138,7 @@ class HornTactic {
140
138
  );
141
139
  if (sorts.length === 0) return formula;
142
140
  sorts.reverse();
143
- const names = sorts.map((_, index) => String(sorts.length - index - 1));
141
+ const names = sorts.map((_value, index) => String(sorts.length - index - 1));
144
142
  const result = mkForall(manager, sorts, names, formula);
145
143
  manager.incRef(result);
146
144
  return result;
@@ -158,7 +156,8 @@ class HornTactic {
158
156
  const queries: number[] = [];
159
157
  for (const form of goal.forms.items) {
160
158
  const kind = this.getFormulaKind(form);
161
- if (kind === undefined) throw new SmtTacticError("formula is not in Horn fragment");
159
+ if (kind === undefined)
160
+ throw new SmtTacticError(`formula is not in Horn fragment: ${mkPp(manager, form)}\n`);
162
161
  if (kind.isRule) context.addRule(kind.formula);
163
162
  else queries.push(kind.formula);
164
163
  }
@@ -173,11 +172,21 @@ class HornTactic {
173
172
  }
174
173
  queries.length = 0;
175
174
  queries.push(query);
175
+ goal.addConverter(manager.decls[query]);
176
176
  }
177
177
  const reachable = context.query(queries[0]);
178
178
  goal.depth++;
179
179
  if (reachable === L_TRUE && context.isMonotone()) goal.assert(manager.falseExpr);
180
- if (reachable === L_FALSE) goal.reset();
180
+ if (reachable === L_FALSE) {
181
+ goal.reset();
182
+ // model2model_converter: the interpretations go to the goal's model in table order.
183
+ const found = context.getModel();
184
+ goal.addModelConversion((model) => {
185
+ for (const [decl, value] of found.constInterps) model.registerConst(decl, value);
186
+ for (const [decl, interp] of found.funcInterps) model.registerFunc(decl, interp.copy());
187
+ return model;
188
+ });
189
+ }
181
190
  return [goal];
182
191
  }
183
192
  }