tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.f57f64938

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 (568) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +3 -0
  8. package/dist/index.d.ts +3 -0
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove.cjs +2682 -426
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +45 -42
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +42 -39
  19. package/dist/transfer.js +42 -39
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -36
  24. package/src/builtins.ts +4 -13
  25. package/src/check-failure.ts +116 -0
  26. package/src/check-trace.ts +282 -0
  27. package/src/check.ts +353 -549
  28. package/src/cli/options.ts +6 -31
  29. package/src/cli/shared.ts +1 -1
  30. package/src/cli/tlapm.ts +433 -70
  31. package/src/cli/tlc-arguments.ts +222 -210
  32. package/src/cli/tlc-output.ts +687 -0
  33. package/src/cli/tlc-usage.ts +1 -2
  34. package/src/cli/tlc.ts +49 -702
  35. package/src/cli/xml-exporter.ts +23 -33
  36. package/src/codegen.ts +5 -10
  37. package/src/coverage.ts +0 -2
  38. package/src/dependencies.ts +30 -14
  39. package/src/dfid.ts +16 -16
  40. package/src/environment-config.ts +315 -0
  41. package/src/environment.ts +55 -338
  42. package/src/errors.ts +33 -5
  43. package/src/evaluate.ts +5 -4
  44. package/src/exit-codes.ts +1 -0
  45. package/src/fingerprints.ts +65 -1
  46. package/src/instances.ts +47 -10
  47. package/src/json.ts +4 -7
  48. package/src/levels.ts +39 -42
  49. package/src/lexer.ts +5 -3
  50. package/src/liveness-checker.ts +553 -237
  51. package/src/liveness.ts +94 -86
  52. package/src/obligations/action.ts +14 -17
  53. package/src/obligations/anonymize.ts +37 -16
  54. package/src/obligations/enabled-axioms.ts +218 -0
  55. package/src/obligations/equality.ts +1 -3
  56. package/src/obligations/expression.ts +36 -8
  57. package/src/obligations/format.ts +0 -2
  58. package/src/obligations/generate.ts +66 -54
  59. package/src/obligations/index.ts +38 -8
  60. package/src/obligations/levels.ts +24 -11
  61. package/src/obligations/module.ts +28 -41
  62. package/src/obligations/normalize.ts +26 -14
  63. package/src/obligations/operators.ts +0 -2
  64. package/src/obligations/pragma.ts +53 -16
  65. package/src/obligations/printer.ts +43 -13
  66. package/src/obligations/proof.ts +3 -2
  67. package/src/obligations/regroup.ts +0 -2
  68. package/src/obligations/simplify.ts +55 -50
  69. package/src/obligations/source.ts +118 -74
  70. package/src/obligations/subexpression.ts +45 -18
  71. package/src/obligations/substitution.ts +1 -3
  72. package/src/obligations/temporal.ts +5 -7
  73. package/src/obligations/tuples.ts +0 -2
  74. package/src/parallel-worker.ts +10 -30
  75. package/src/parallel.ts +24 -47
  76. package/src/parser.ts +580 -180
  77. package/src/pretty-print.ts +1 -1
  78. package/src/prover/decide-pool.ts +3 -3
  79. package/src/prover/deciders.ts +12 -9
  80. package/src/prover/isabelle/decide.ts +3 -25
  81. package/src/prover/isabelle/encode.ts +72 -42
  82. package/src/prover/isabelle/isar/attrib.ts +250 -0
  83. package/src/prover/isabelle/isar/context.ts +335 -0
  84. package/src/prover/isabelle/isar/induct.ts +382 -0
  85. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  86. package/src/prover/isabelle/isar/method.ts +509 -212
  87. package/src/prover/isabelle/isar/proof.ts +570 -14
  88. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  89. package/src/prover/isabelle/isar/theory.ts +487 -76
  90. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  91. package/src/prover/isabelle/isar/type-check.ts +89 -14
  92. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  93. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  94. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  95. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  96. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  97. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  98. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  99. package/src/prover/isabelle/provers/classical.ts +45 -20
  100. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  101. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  102. package/src/prover/isabelle/pure/consts.ts +0 -2
  103. package/src/prover/isabelle/pure/conv.ts +2 -10
  104. package/src/prover/isabelle/pure/drule.ts +72 -6
  105. package/src/prover/isabelle/pure/envir.ts +0 -2
  106. package/src/prover/isabelle/pure/goal.ts +1 -3
  107. package/src/prover/isabelle/pure/logic.ts +1 -3
  108. package/src/prover/isabelle/pure/name.ts +0 -2
  109. package/src/prover/isabelle/pure/net.ts +0 -2
  110. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  111. package/src/prover/isabelle/pure/pattern.ts +0 -2
  112. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  113. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  114. package/src/prover/isabelle/pure/search.ts +0 -2
  115. package/src/prover/isabelle/pure/seq.ts +0 -2
  116. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  117. package/src/prover/isabelle/pure/table.ts +2 -3
  118. package/src/prover/isabelle/pure/tactic.ts +0 -2
  119. package/src/prover/isabelle/pure/tactical.ts +42 -37
  120. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  121. package/src/prover/isabelle/pure/term.ts +0 -2
  122. package/src/prover/isabelle/pure/thm.ts +14 -13
  123. package/src/prover/isabelle/pure/type.ts +0 -2
  124. package/src/prover/isabelle/pure/unify.ts +0 -2
  125. package/src/prover/isabelle/pure/variable.ts +0 -2
  126. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  127. package/src/prover/isabelle/tla/context.ts +58 -11
  128. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  129. package/src/prover/isabelle/tla/logic.ts +49 -21
  130. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  131. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  132. package/src/prover/ocaml.ts +4 -1
  133. package/src/prover/prep/action.ts +30 -31
  134. package/src/prover/prep/enabled-axioms.ts +11 -2
  135. package/src/prover/prep/fingerprint.ts +2 -5
  136. package/src/prover/prep/methods.ts +181 -51
  137. package/src/prover/prep/normalize.ts +38 -9
  138. package/src/prover/prove.ts +395 -94
  139. package/src/prover/ptl/decide.ts +95 -50
  140. package/src/prover/ptl/encode.ts +2 -3
  141. package/src/prover/ptl/tableau.ts +28 -2
  142. package/src/prover/smt/arithmetic.ts +310 -0
  143. package/src/prover/smt/axioms.ts +12 -8
  144. package/src/prover/smt/context.ts +43 -8
  145. package/src/prover/smt/data.ts +498 -379
  146. package/src/prover/smt/encode.ts +148 -57
  147. package/src/prover/smt/extensionality.ts +5 -3
  148. package/src/prover/smt/flatten.ts +4 -6
  149. package/src/prover/smt/format.ts +28 -4
  150. package/src/prover/smt/instances.ts +7 -1
  151. package/src/prover/smt/layout.ts +91 -0
  152. package/src/prover/smt/rewrite.ts +1021 -618
  153. package/src/prover/smt/simplify.ts +441 -0
  154. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  155. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  156. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  157. package/src/prover/smt/solver/act-cache.ts +0 -1
  158. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  159. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  160. package/src/prover/smt/solver/aig.ts +889 -0
  161. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  162. package/src/prover/smt/solver/arith-terms.ts +121 -0
  163. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  164. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  165. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  166. package/src/prover/smt/solver/ast-lt.ts +166 -12
  167. package/src/prover/smt/solver/ast-util.ts +160 -2
  168. package/src/prover/smt/solver/ast.ts +1427 -41
  169. package/src/prover/smt/solver/auf-solver.ts +2 -6
  170. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  171. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  172. package/src/prover/smt/solver/bound-manager.ts +196 -0
  173. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  174. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  175. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  176. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  177. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  178. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  179. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  180. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  181. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  182. package/src/prover/smt/solver/card2bv.ts +110 -0
  183. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  184. package/src/prover/smt/solver/cg-table.ts +39 -25
  185. package/src/prover/smt/solver/check-logic.ts +330 -0
  186. package/src/prover/smt/solver/clause.ts +0 -1
  187. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  188. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  189. package/src/prover/smt/solver/context.ts +516 -115
  190. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  191. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  192. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  193. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  194. package/src/prover/smt/solver/demodulator.ts +786 -0
  195. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  196. package/src/prover/smt/solver/der.ts +38 -10
  197. package/src/prover/smt/solver/diff-neq.ts +206 -0
  198. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  199. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  200. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  201. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  202. package/src/prover/smt/solver/e-matching.ts +7 -8
  203. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  204. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  205. package/src/prover/smt/solver/enode.ts +100 -3
  206. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  207. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  208. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  209. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  210. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  211. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  212. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  213. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  214. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  215. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  216. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  217. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  218. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  219. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  220. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  221. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  222. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  223. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  224. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  225. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  226. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  227. package/src/prover/smt/solver/expr-ref.ts +0 -1
  228. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  229. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  230. package/src/prover/smt/solver/factor.ts +141 -0
  231. package/src/prover/smt/solver/fd-solver.ts +265 -0
  232. package/src/prover/smt/solver/fingerprints.ts +15 -15
  233. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  234. package/src/prover/smt/solver/flat-literals.ts +0 -1
  235. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  236. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  237. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  238. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  239. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  240. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  241. package/src/prover/smt/solver/goal.ts +175 -15
  242. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  243. package/src/prover/smt/solver/guard-set.ts +219 -0
  244. package/src/prover/smt/solver/hash.ts +0 -1
  245. package/src/prover/smt/solver/hashtable.ts +30 -16
  246. package/src/prover/smt/solver/inf-eps.ts +63 -0
  247. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  248. package/src/prover/smt/solver/internalizer.ts +110 -38
  249. package/src/prover/smt/solver/lackr.ts +381 -0
  250. package/src/prover/smt/solver/lbool.ts +0 -1
  251. package/src/prover/smt/solver/lia2card.ts +268 -0
  252. package/src/prover/smt/solver/lia2pb.ts +154 -0
  253. package/src/prover/smt/solver/literal.ts +0 -1
  254. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  255. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  256. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  257. package/src/prover/smt/solver/lp/containers.ts +0 -1
  258. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  259. package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
  260. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  261. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  262. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  263. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  264. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  265. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  266. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  267. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  268. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  269. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  270. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  271. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  272. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  273. package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
  274. package/src/prover/smt/solver/lp/nex.ts +0 -1
  275. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  276. package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-core.ts +42 -11
  278. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  281. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -4
  282. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  286. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  288. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  289. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  292. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  294. package/src/prover/smt/solver/lp/nra-solver.ts +25 -4
  295. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  296. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  297. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  298. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  299. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  300. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  301. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  302. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  303. package/src/prover/smt/solver/macro-finder.ts +530 -0
  304. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  305. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  306. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  307. package/src/prover/smt/solver/max-cliques.ts +105 -0
  308. package/src/prover/smt/solver/maxcore.ts +309 -0
  309. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  310. package/src/prover/smt/solver/maxlex.ts +115 -0
  311. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  312. package/src/prover/smt/solver/maxsmt.ts +92 -0
  313. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  314. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  315. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  316. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  317. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  318. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  319. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  320. package/src/prover/smt/solver/model-checker.ts +18 -27
  321. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  322. package/src/prover/smt/solver/model-finder.ts +12 -18
  323. package/src/prover/smt/solver/model-generator.ts +56 -29
  324. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  325. package/src/prover/smt/solver/model-printer.ts +214 -0
  326. package/src/prover/smt/solver/mpf.ts +711 -0
  327. package/src/prover/smt/solver/mus.ts +51 -0
  328. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  329. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  330. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  331. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  332. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  333. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  334. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  335. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  336. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  337. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  338. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  339. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  340. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  341. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  342. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  343. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  344. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  345. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  346. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  347. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  348. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  349. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  350. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  351. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  352. package/src/prover/smt/solver/nlqsat.ts +484 -0
  353. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  354. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  355. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  356. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  357. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  358. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  359. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  360. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  361. package/src/prover/smt/solver/nlsat/solver.ts +234 -36
  362. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  363. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  364. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  365. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  366. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  367. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  368. package/src/prover/smt/solver/nnf.ts +105 -23
  369. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  370. package/src/prover/smt/solver/occf.ts +97 -0
  371. package/src/prover/smt/solver/opt-context.ts +787 -0
  372. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  373. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  374. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  375. package/src/prover/smt/solver/opt-solver.ts +308 -0
  376. package/src/prover/smt/solver/opt-value.ts +55 -0
  377. package/src/prover/smt/solver/optsmt.ts +692 -0
  378. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  379. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  380. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  381. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  382. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  383. package/src/prover/smt/solver/probes.ts +512 -0
  384. package/src/prover/smt/solver/propagate-values.ts +37 -21
  385. package/src/prover/smt/solver/proto-model.ts +648 -19
  386. package/src/prover/smt/solver/pull-quant.ts +28 -12
  387. package/src/prover/smt/solver/purify-arith.ts +632 -0
  388. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  389. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  390. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  391. package/src/prover/smt/solver/qe-lite.ts +37 -17
  392. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  393. package/src/prover/smt/solver/qe.ts +1498 -0
  394. package/src/prover/smt/solver/qel.ts +25 -0
  395. package/src/prover/smt/solver/qi-queue.ts +0 -1
  396. package/src/prover/smt/solver/qsat.ts +814 -0
  397. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  398. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  399. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  400. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  401. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  402. package/src/prover/smt/solver/random-gen.ts +0 -1
  403. package/src/prover/smt/solver/rational.ts +45 -1
  404. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  405. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  406. package/src/prover/smt/solver/reduce-args.ts +225 -0
  407. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  408. package/src/prover/smt/solver/ref-vector.ts +0 -1
  409. package/src/prover/smt/solver/relevancy.ts +1 -2
  410. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  411. package/src/prover/smt/solver/rewriter.ts +475 -36
  412. package/src/prover/smt/solver/rlimit.ts +25 -2
  413. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  414. package/src/prover/smt/solver/sat/big.ts +177 -0
  415. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  416. package/src/prover/smt/solver/sat/clause.ts +203 -0
  417. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  418. package/src/prover/smt/solver/sat/config.ts +122 -0
  419. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  420. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  421. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  422. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  423. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  424. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  425. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  426. package/src/prover/smt/solver/sat/probing.ts +170 -0
  427. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  428. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  429. package/src/prover/smt/solver/sat/scc.ts +142 -0
  430. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  431. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  432. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  433. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  434. package/src/prover/smt/solver/search-tree.ts +284 -0
  435. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  436. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  437. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  438. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  439. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  440. package/src/prover/smt/solver/seq-factory.ts +89 -0
  441. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  442. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  443. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  444. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  445. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  446. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  447. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  448. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  449. package/src/prover/smt/solver/seq-subset.ts +165 -0
  450. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  451. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  452. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  453. package/src/prover/smt/solver/smt-logics.ts +66 -0
  454. package/src/prover/smt/solver/smt-setup.ts +496 -0
  455. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  456. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  457. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  458. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  459. package/src/prover/smt/solver/solver.ts +113 -22
  460. package/src/prover/smt/solver/static-features.ts +314 -0
  461. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  462. package/src/prover/smt/solver/tactic.ts +1986 -0
  463. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  464. package/src/prover/smt/solver/theory-array.ts +1240 -0
  465. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  466. package/src/prover/smt/solver/theory-char.ts +355 -0
  467. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  468. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  469. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  470. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  471. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  472. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  473. package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
  474. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  475. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  476. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  477. package/src/prover/smt/solver/theory-lra.ts +188 -1
  478. package/src/prover/smt/solver/theory-pb.ts +934 -0
  479. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  480. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  481. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  482. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  483. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  484. package/src/prover/smt/solver/theory-seq.ts +961 -0
  485. package/src/prover/smt/solver/theory.ts +189 -0
  486. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  487. package/src/prover/smt/solver/var-subst.ts +36 -14
  488. package/src/prover/smt/table.ts +3 -2
  489. package/src/prover/smt/types.ts +146 -0
  490. package/src/prover/tlapm/cache.ts +50 -19
  491. package/src/prover/tlapm/tlapm.ts +15 -9
  492. package/src/prover/tlapm-library.ts +3208 -0
  493. package/src/prover/verdict.ts +9 -0
  494. package/src/prover/zenon/check/check.ts +1 -2
  495. package/src/prover/zenon/check/records.ts +1 -1
  496. package/src/prover/zenon/check/relations.ts +2 -1
  497. package/src/prover/zenon/check/rewrites.ts +2 -15
  498. package/src/prover/zenon/check/sets.ts +40 -58
  499. package/src/prover/zenon/check/terms.ts +1 -2
  500. package/src/prover/zenon/decide.ts +10 -7
  501. package/src/prover/zenon/encode.ts +0 -2
  502. package/src/prover/zenon/eqrel.ts +2 -2
  503. package/src/prover/zenon/equality-rules.ts +0 -2
  504. package/src/prover/zenon/expr.ts +7 -2
  505. package/src/prover/zenon/index-table.ts +9 -21
  506. package/src/prover/zenon/isar-case.ts +0 -2
  507. package/src/prover/zenon/isar.ts +35 -37
  508. package/src/prover/zenon/llproof.ts +2 -13
  509. package/src/prover/zenon/mltoll.ts +12 -30
  510. package/src/prover/zenon/node.ts +20 -5
  511. package/src/prover/zenon/parse.ts +9 -8
  512. package/src/prover/zenon/phrase.ts +0 -2
  513. package/src/prover/zenon/proof.ts +0 -2
  514. package/src/prover/zenon/propositional-rules.ts +0 -2
  515. package/src/prover/zenon/rules.ts +0 -2
  516. package/src/prover/zenon/search.ts +11 -19
  517. package/src/prover/zenon/tla/functions.ts +2 -4
  518. package/src/prover/zenon/tla/llproof.ts +9 -13
  519. package/src/prover/zenon/tla/records.ts +1 -8
  520. package/src/prover/zenon/tla/rewrites.ts +0 -2
  521. package/src/prover/zenon/tla/sets.ts +22 -22
  522. package/src/prover/zenon/tla/terms.ts +0 -2
  523. package/src/prover/zenon/tla/tla.ts +7 -8
  524. package/src/resolve.ts +56 -74
  525. package/src/runtime.ts +4 -0
  526. package/src/sany/generation.ts +394 -0
  527. package/src/sany/generator-def-entries.ts +210 -0
  528. package/src/sany/generator-definitions.ts +686 -0
  529. package/src/sany/generator-expressions.ts +1100 -0
  530. package/src/sany/generator-proofs.ts +662 -0
  531. package/src/sany/generator.ts +155 -2625
  532. package/src/sany/levels.ts +0 -2
  533. package/src/sany/lexer.ts +17 -16
  534. package/src/sany/linter.ts +0 -2
  535. package/src/sany/nodes.ts +2 -3
  536. package/src/sany/report.ts +3 -6
  537. package/src/sany/selectors.ts +35 -38
  538. package/src/sany/xml.ts +23 -55
  539. package/src/search.ts +205 -43
  540. package/src/simulate.ts +157 -133
  541. package/src/spec-description.ts +33 -48
  542. package/src/standard-definitions.ts +4 -0
  543. package/src/standard-modules.ts +16 -32
  544. package/src/state-graph.ts +0 -2
  545. package/src/substitution-levels.ts +5 -4
  546. package/src/successors.ts +6 -8
  547. package/src/symmetry.ts +2 -2
  548. package/src/tableau.ts +2 -2
  549. package/src/tlc/fingerprint.ts +81 -9
  550. package/src/tlc/messages.ts +20 -15
  551. package/src/tlc/random.ts +4 -4
  552. package/src/tlc/replay.ts +8 -15
  553. package/src/tlc/summary.ts +29 -14
  554. package/src/tlc/tlc-operators.ts +2 -3
  555. package/src/tlc/tlcext-operators.ts +44 -12
  556. package/src/tlc/trace-spec.ts +21 -40
  557. package/src/typed-tier.ts +6535 -0
  558. package/src/typescript/actions.ts +2 -4
  559. package/src/typescript/collections.ts +34 -20
  560. package/src/typescript/compile.ts +1 -3
  561. package/src/typescript/formula.ts +5 -3
  562. package/src/typescript/model.ts +4 -5
  563. package/src/typescript/steps.ts +20 -18
  564. package/src/values.ts +62 -152
  565. package/src/prover/isabelle/isar/statement.ts +0 -52
  566. package/src/prover/smt/solver/z3-license.txt +0 -10
  567. package/src/prover/tlaps-module.ts +0 -510
  568. package/src/prover/zenon/LICENSE +0 -32
@@ -1,6 +1,5 @@
1
- // Ported from Z3 (src/smt/smt_model_checker.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../errors";
3
- import { KIND_APP, OP_NOT, OP_OR, SORT_BOOL, type AstManager } from "./ast";
2
+ import { KIND_APP, OP_NOT, OP_OR, SORT_BOOL } from "./ast";
4
3
  import { AssertedFormulas } from "./asserted-formulas";
5
4
  import { Context } from "./context";
6
5
  import type { Enode } from "./enode";
@@ -12,7 +11,6 @@ import { RefVector } from "./ref-vector";
12
11
  import { VarSubst } from "./var-subst";
13
12
 
14
13
  const MBQI_MAX_CEXS = 1;
15
- const MBQI_MAX_ITERATIONS = 1000;
16
14
 
17
15
  interface Instance {
18
16
  quantifier: number;
@@ -23,13 +21,19 @@ interface Instance {
23
21
  class AuxContext {
24
22
  private context: Context;
25
23
  private asserted: AssertedFormulas;
26
- private polyQhead = 0;
27
- private polyAssumption = -1;
28
24
 
29
- constructor(private manager: AstManager) {
30
- this.asserted = new AssertedFormulas(manager);
31
- this.context = new Context(manager, { isMbqi: true, relevancyLevel: 0 });
32
- this.context.setupContext();
25
+ // init_aux_context copies the kernel's smt_params and theories, so the context has a model
26
+ // finder too, though it never sees a quantifier.
27
+ constructor(parent: Context) {
28
+ this.asserted = new AssertedFormulas(parent.manager);
29
+ this.context = new Context(parent.manager, {
30
+ ...parent.params,
31
+ relevancyLevel: 0,
32
+ isArrayFakeSupport: true,
33
+ });
34
+ this.context.config = { ...parent.config, relevancyLevel: 0 };
35
+ for (const theory of parent.theories) this.context.registerFamily(theory.id);
36
+ this.context.setupContext(parent.setup, false, this.asserted);
33
37
  }
34
38
 
35
39
  push() {
@@ -40,7 +44,6 @@ class AuxContext {
40
44
  pop() {
41
45
  this.context.pop(1);
42
46
  this.asserted.pop();
43
- this.polyQhead = 0;
44
47
  }
45
48
 
46
49
  assert(formula: number) {
@@ -51,19 +54,7 @@ class AuxContext {
51
54
  check() {
52
55
  const context = this.context;
53
56
  context.popToBaseLevel();
54
- context.internalizeAssertions(this.asserted);
55
- const manager = this.manager;
56
- const numFormulas = this.asserted.getNumFormulas();
57
- const isAssuming = numFormulas !== this.polyQhead;
58
- this.polyQhead = numFormulas;
59
- if (isAssuming) {
60
- const assumption = manager.mkFreshConst("poly", SORT_BOOL);
61
- manager.incRef(assumption);
62
- if (this.polyAssumption !== -1) manager.decRef(this.polyAssumption);
63
- this.polyAssumption = assumption;
64
- }
65
- context.initAssumptions(isAssuming ? [this.polyAssumption] : []);
66
- const result = context.search();
57
+ const result = context.checkResearching(this.asserted, []);
67
58
  return result === L_TRUE ? context.getModel() : result === L_FALSE ? "unsat" : "unknown";
68
59
  }
69
60
  }
@@ -95,7 +86,7 @@ export class ModelChecker {
95
86
  const value2expr = new Map<number, number>();
96
87
  for (const entry of this.root2value) {
97
88
  const node = this.getEqEnodeWithMinGen(entry[0]);
98
- if (!this.manager.isUniqueValue(node.owner)) value2expr.set(entry[1], node.owner);
89
+ if (!this.manager.isValue(node.owner)) value2expr.set(entry[1], node.owner);
99
90
  }
100
91
  this.value2expr = value2expr;
101
92
  return value2expr;
@@ -182,7 +173,7 @@ export class ModelChecker {
182
173
  const sk = sks[numDecls - index - 1];
183
174
  let skValue = cex.getSomeConstInterp(manager.decls[sk]);
184
175
  if (isUsingInv) {
185
- const inv = this.modelFinder.getInv(quantifier, index, skValue, cex);
176
+ const inv = this.modelFinder.getInv(quantifier, index, skValue);
186
177
  if (inv === null) return false;
187
178
  maxGeneration = Math.max(maxGeneration, inv.generation);
188
179
  skValue = inv.term;
@@ -203,7 +194,7 @@ export class ModelChecker {
203
194
 
204
195
  private checkQuantifier(quantifier: number, model: ProtoModel) {
205
196
  const manager = this.manager;
206
- const aux = this.aux ?? new AuxContext(manager);
197
+ const aux = this.aux ?? new AuxContext(this.context);
207
198
  this.aux = aux;
208
199
  aux.push();
209
200
  const sks = new RefVector(manager);
@@ -270,7 +261,7 @@ export class ModelChecker {
270
261
  check(model: ProtoModel, root2value: Map<Enode, number>) {
271
262
  this.root2value = root2value;
272
263
  if (this.qmanager.quantifiers.length === 0) return true;
273
- if (this.iterationIndex >= MBQI_MAX_ITERATIONS) return false;
264
+ if (this.iterationIndex >= this.context.params.mbqiMaxIterations) return false;
274
265
  this.value2expr = null;
275
266
  model.compress();
276
267
  const first = this.checkQuantifiers(model);
@@ -1,36 +1,56 @@
1
- // Ported from Z3 (src/model/model_evaluator.cpp), MIT license, see z3-license.txt.
1
+ import { mkArrayApp } from "./array-decl-plugin";
2
2
  import {
3
3
  FAMILY_ARITH,
4
+ FAMILY_BASIC,
5
+ FAMILY_LABEL,
6
+ FAMILY_ARRAY,
7
+ FAMILY_FPA,
8
+ FAMILY_MODEL_VALUE,
9
+ FAMILY_RECFUN,
4
10
  FAMILY_USER,
5
11
  KIND_APP,
6
12
  KIND_QUANTIFIER,
7
13
  OP_AND,
14
+ OP_AS_ARRAY,
15
+ OP_CONST_ARRAY,
8
16
  OP_DIV,
9
17
  OP_DIV0,
18
+ OP_DT_ACCESSOR,
19
+ OP_DT_CONSTRUCTOR,
10
20
  OP_EQ,
21
+ OP_FPA_FP,
11
22
  OP_IDIV,
12
23
  OP_IDIV0,
13
24
  OP_ITE,
14
25
  OP_LE,
15
26
  OP_MOD,
16
27
  OP_MOD0,
28
+ OP_REM,
29
+ OP_SELECT,
30
+ OP_STORE,
17
31
  SORT_BOOL,
18
32
  } from "./ast";
19
33
  import type { AstManager } from "./ast";
20
- import { FuncInterp } from "./proto-model";
34
+ import { DEFAULT_BV_OPTIONS } from "./bv-rewriter";
35
+ import { isConsideredUninterpreted } from "./fpa-decl-plugin";
36
+ import { FuncInterp, getManagerSomeValue } from "./proto-model";
21
37
  import type { ProtoModel } from "./proto-model";
22
38
  import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
23
39
  import { RewriterTpl } from "./rewriter-tpl";
24
40
  import type { Rewrite } from "./rewriter-tpl";
25
41
  import { Rational } from "./rational";
42
+ import { mkRecFunApp } from "./recfun-rewriter";
26
43
  import { VarSubst } from "./var-subst";
27
44
 
28
45
  const BY_ZERO_OPS = new Map([
29
46
  [OP_DIV, OP_DIV0],
30
47
  [OP_IDIV, OP_IDIV0],
31
48
  [OP_MOD, OP_MOD0],
49
+ [OP_REM, OP_MOD0],
32
50
  ]);
33
51
 
52
+ const BUILTIN_FAMILIES = new Set([FAMILY_BASIC, FAMILY_USER, FAMILY_MODEL_VALUE, FAMILY_LABEL]);
53
+
34
54
  export class ModelEvaluator extends RewriterTpl {
35
55
  private rewriter: Rewriter;
36
56
  private isModelCompletion = false;
@@ -41,7 +61,10 @@ export class ModelEvaluator extends RewriterTpl {
41
61
  private model: ProtoModel,
42
62
  ) {
43
63
  super(manager);
44
- 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
+ });
45
68
  this.rewriter.releaseResult = () => this.setLastResult(-1);
46
69
  }
47
70
 
@@ -70,6 +93,11 @@ export class ModelEvaluator extends RewriterTpl {
70
93
  const manager = this.manager;
71
94
  const model = this.model;
72
95
  const family = manager.funcDecls[decl].family;
96
+ if (family === FAMILY_ARRAY && manager.funcDecls[decl].op === OP_AS_ARRAY) {
97
+ const arrayDecl = manager.funcDecls[decl].parameters[0];
98
+ const arrayInterp = model.funcInterps.get(arrayDecl)?.getArrayInterp(arrayDecl);
99
+ if (arrayInterp !== undefined) return { expr: arrayInterp, depth: 1 };
100
+ }
73
101
  if (family === FAMILY_USER) {
74
102
  if (args.length > 0) {
75
103
  const result = this.evaluate(decl, args);
@@ -83,15 +111,29 @@ export class ModelEvaluator extends RewriterTpl {
83
111
  model.registerConst(decl, some);
84
112
  return some;
85
113
  }
114
+ if (manager.funcDecls[decl].op === OP_EQ && manager.isArraySort(manager.sorts[args[0]])) {
115
+ const reduced = this.mkArrayEq(args[0], args[1]);
116
+ if (reduced !== undefined) return reduced;
117
+ }
86
118
  if (manager.funcDecls[decl].op === OP_AND) {
87
119
  const reduced = this.mkArithAndCore(args);
88
120
  if (reduced !== undefined) return reduced;
89
121
  }
122
+ if (family === FAMILY_LABEL && args.length === 1) return args[0];
123
+ if (family === FAMILY_RECFUN) {
124
+ const unfolded = mkRecFunApp(manager, decl, args, true);
125
+ if (unfolded !== undefined) return unfolded;
126
+ const interp = model.funcInterps.get(decl);
127
+ if (interp === undefined) return -1;
128
+ if (interp.isPartial()) interp.setElse(model.getSomeValue(sort));
129
+ const result = this.substitute(interp.getInterp() as number, args);
130
+ return manager.isGroundApp(result) ? { expr: result, depth: Infinity } : result;
131
+ }
90
132
  const rewritten = this.rewriter.reduceAppCore(decl, args);
91
133
  const reduced =
92
- rewritten === -1 && family === FAMILY_ARITH
93
- ? this.evaluatePartialTheoryFunc(decl, args, sort)
94
- : rewritten;
134
+ rewritten !== -1 || BUILTIN_FAMILIES.has(family)
135
+ ? rewritten
136
+ : this.evaluatePartialTheoryFunc(decl, args, sort);
95
137
  if (
96
138
  family !== FAMILY_ARITH ||
97
139
  typeof reduced !== "number" ||
@@ -121,8 +163,10 @@ export class ModelEvaluator extends RewriterTpl {
121
163
  private evaluatePartialTheoryFunc(decl: number, args: number[], sort: number): number | Rewrite {
122
164
  const manager = this.manager;
123
165
  const model = this.model;
124
- const op = manager.funcDecls[decl].op;
125
- const byZero = BY_ZERO_OPS.get(op);
166
+ const info = manager.funcDecls[decl];
167
+ if (info.family === FAMILY_FPA && !isConsideredUninterpreted(manager, decl, args)) return -1;
168
+ const op = info.op;
169
+ const byZero = info.family === FAMILY_ARITH ? BY_ZERO_OPS.get(op) : undefined;
126
170
  let interp = model.funcInterps.get(decl);
127
171
  if (interp === undefined && byZero !== undefined && !manager.isNumeral(args[1])) {
128
172
  const definition = model.funcInterps.get(byZero)?.getInterp();
@@ -135,16 +179,146 @@ export class ModelEvaluator extends RewriterTpl {
135
179
  sort,
136
180
  );
137
181
  }
138
- if (interp === undefined) {
182
+ if (interp === undefined && info.family === FAMILY_ARITH) {
139
183
  const isByZero = byZero !== undefined && manager.getRationalValue(args[1]).isZero();
140
184
  if (!isByZero && op !== OP_DIV0 && op !== OP_IDIV0 && op !== OP_MOD0) return -1;
141
185
  interp = isByZero ? model.funcInterps.get(byZero) : undefined;
142
186
  if (interp === undefined) return manager.mkNumeralOfSort(Rational.zero, sort);
143
187
  }
144
- if (interp.isPartial()) interp.setElse(model.getSomeValue(sort));
188
+ if (interp === undefined && info.family === FAMILY_FPA)
189
+ return getManagerSomeValue(manager, sort);
190
+ if (op === OP_DT_ACCESSOR) {
191
+ if (interp === undefined && manager.isValue(args[0])) {
192
+ const value = model.getSomeValue(sort);
193
+ const created = new FuncInterp(manager, args.length);
194
+ created.setElse(value);
195
+ model.registerFunc(decl, created);
196
+ return value;
197
+ }
198
+ if (!manager.isGroundApp(args[0])) return manager.mkApp(decl, args, sort);
199
+ }
200
+ if (op === OP_DT_CONSTRUCTOR) return manager.mkApp(decl, args, sort);
201
+ if (interp === undefined) return -1;
202
+ if (interp.isPartial()) interp.setElse(getManagerSomeValue(manager, sort));
145
203
  return { expr: this.substitute(interp.getInterp() as number, args), depth: Infinity };
146
204
  }
147
205
 
206
+ // Like Z3, only the indices of the stores of a store chain decide whether they are unique.
207
+ private extractArrayFuncInterp(inputArray: number) {
208
+ const manager = this.manager;
209
+ const stores: number[][] = [];
210
+ let array = inputArray;
211
+ let areUnique = true;
212
+ while (manager.getFamily(array) === FAMILY_ARRAY && manager.getOp(array) === OP_STORE) {
213
+ const store = manager.getArgs(array).slice(1);
214
+ areUnique &&= store.slice(0, -1).every((index) => manager.isUniqueValue(index));
215
+ stores.push(store);
216
+ array = manager.getArg(array, 0);
217
+ }
218
+ if (manager.getFamily(array) === FAMILY_ARRAY && manager.getOp(array) === OP_CONST_ARRAY)
219
+ return { stores, elseExpr: manager.getArg(array, 0), areUnique };
220
+ if (manager.getFamily(array) !== FAMILY_ARRAY || manager.getOp(array) !== OP_AS_ARRAY)
221
+ return undefined;
222
+ const interp = this.model.funcInterps.get(
223
+ manager.funcDecls[manager.decls[array]].parameters[0],
224
+ );
225
+ const elseExpr = interp?.elseExpr ?? null;
226
+ if (interp === undefined || elseExpr === null) return undefined;
227
+ let isGround = manager.isGroundApp(elseExpr);
228
+ for (const entry of interp.entries) {
229
+ if (entry.result === elseExpr) continue;
230
+ const store = [...entry.args, entry.result];
231
+ isGround &&= store.every((arg) => manager.isGroundApp(arg));
232
+ stores.push(store);
233
+ }
234
+ return isGround ? { stores, elseExpr, areUnique } : undefined;
235
+ }
236
+
237
+ private mkArrayEq(first: number, second: number): number | Rewrite | undefined {
238
+ const manager = this.manager;
239
+ if (first === second) return manager.trueExpr;
240
+ const firstInterp = this.extractArrayFuncInterp(first);
241
+ const secondInterp = this.extractArrayFuncInterp(second);
242
+ if (firstInterp === undefined || secondInterp === undefined) return undefined;
243
+ const firstElse = firstInterp.elseExpr;
244
+ const secondElse = secondInterp.elseExpr;
245
+ const areUnique = firstInterp.areUnique && secondInterp.areUnique;
246
+ const sort = manager.sorts[first];
247
+ const domain = manager.getSortParameters(sort).slice(0, -1);
248
+ const domainSize = domain.reduce((size, index) => {
249
+ const indexSize = manager.getSortSize(index);
250
+ return size < 0n || indexSize < 0n ? -1n : size * indexSize;
251
+ }, 1n);
252
+ const stores = [...firstInterp.stores, ...secondInterp.stores];
253
+ const isFullyCovered =
254
+ areUnique &&
255
+ firstElse !== secondElse &&
256
+ domainSize >= 0n &&
257
+ stores.length > 0 &&
258
+ BigInt(new Set(stores.map((store) => store.slice(0, -1).join(","))).size) >= domainSize;
259
+ const conjuncts: number[] = [];
260
+ const isElseInfinite = manager.getSortSize(manager.sorts[firstElse]) < 0n;
261
+ if (firstElse !== secondElse && !isFullyCovered) {
262
+ if (manager.areDistinct(firstElse, secondElse) && isElseInfinite) return manager.falseExpr;
263
+ conjuncts.push(manager.mkEq(firstElse, secondElse));
264
+ }
265
+ if (areUnique && firstInterp.stores.length > 0)
266
+ return this.mkArrayEqCore(
267
+ firstInterp.stores,
268
+ firstElse,
269
+ secondInterp.stores,
270
+ secondElse,
271
+ conjuncts,
272
+ );
273
+ for (const store of stores) {
274
+ const indices = store.slice(0, -1);
275
+ conjuncts.push(
276
+ manager.mkEq(
277
+ mkArrayApp(manager, OP_SELECT, [first, ...indices]),
278
+ mkArrayApp(manager, OP_SELECT, [second, ...indices]),
279
+ ),
280
+ );
281
+ }
282
+ return { expr: manager.mkAnd(conjuncts), depth: Infinity };
283
+ }
284
+
285
+ private mkArrayEqCore(
286
+ firstStores: number[][],
287
+ firstElse: number,
288
+ secondStores: number[][],
289
+ secondElse: number,
290
+ conjuncts: number[],
291
+ ): number | Rewrite {
292
+ const manager = this.manager;
293
+ const arity = firstStores[0].length - 1;
294
+ const getKey = (store: number[]) => store.slice(0, arity).join(",");
295
+ const firstTable = new Map<string, number[]>();
296
+ // A store of a smaller index takes precedence.
297
+ for (const store of [...firstStores].reverse()) firstTable.set(getKey(store), store);
298
+ const secondKeys = new Set<string>();
299
+ // A pair that is neither equal nor distinct is left as an equality.
300
+ const isDistinct = (left: number, right: number) => {
301
+ if (left === right) return false;
302
+ if (manager.areDistinct(left, right)) return true;
303
+ conjuncts.push(manager.mkEq(left, right));
304
+ return false;
305
+ };
306
+ for (const store of secondStores) {
307
+ const key = getKey(store);
308
+ if (secondKeys.has(key)) continue;
309
+ secondKeys.add(key);
310
+ const value = store[arity];
311
+ const match = firstTable.get(key);
312
+ if (match !== undefined) firstTable.delete(key);
313
+ const isDifferent =
314
+ match === undefined ? isDistinct(firstElse, value) : isDistinct(value, match[arity]);
315
+ if (isDifferent) return manager.falseExpr;
316
+ }
317
+ for (const store of firstTable.values())
318
+ if (isDistinct(store[arity], secondElse)) return manager.falseExpr;
319
+ return { expr: manager.mkAnd(conjuncts), depth: Infinity };
320
+ }
321
+
148
322
  private substitute(expr: number, args: number[]) {
149
323
  const subst = new VarSubst(this.manager, false);
150
324
  const result = subst.apply(expr, args);
@@ -155,17 +329,19 @@ export class ModelEvaluator extends RewriterTpl {
155
329
 
156
330
  private containsRedex(expr: number) {
157
331
  const manager = this.manager;
332
+ if (manager.getOp(expr) === OP_AS_ARRAY) return true;
158
333
  if (manager.kinds[expr] !== KIND_APP || manager.getNumArgs(expr) === 0) return false;
159
334
  const visited = new Set<number>();
160
335
  const todo = [expr];
161
336
  for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
162
337
  if (visited.has(current)) continue;
163
338
  visited.add(current);
164
- if (manager.getOp(current) === OP_EQ) return true;
339
+ const op = manager.getOp(current);
340
+ if (op === OP_AS_ARRAY || op === OP_EQ || op === OP_FPA_FP) return true;
165
341
  if (manager.kinds[current] === KIND_APP) manager.pushArgs(current, todo);
166
342
  else if (manager.kinds[current] === KIND_QUANTIFIER) {
167
343
  const data = manager.getQuantifier(current);
168
- todo.push(data.body, ...data.patterns);
344
+ todo.push(data.body, ...data.patterns, ...data.noPatterns);
169
345
  }
170
346
  }
171
347
  return false;
@@ -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";
@@ -6,11 +5,12 @@ import { solveMacros } from "./model-macro-solver";
6
5
  import type { ProtoModel } from "./proto-model";
7
6
  import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
8
7
  import { AufSolver } from "./auf-solver";
9
- import { MBQI_FORCE_TEMPLATE, QuantifierAnalyzer, QuantifierInfo } from "./quantifier-analyzer";
8
+ import { QuantifierAnalyzer, QuantifierInfo } from "./quantifier-analyzer";
10
9
  import { RefVector } from "./ref-vector";
11
10
  import { shrink } from "./array";
12
11
 
13
12
  export class ModelFinder {
13
+ private manager: AstManager;
14
14
  private q2info = new Map<number, QuantifierInfo>();
15
15
  private quantifiers: number[] = [];
16
16
  private scopes: number[] = [];
@@ -20,13 +20,11 @@ export class ModelFinder {
20
20
  readonly aufSolver: AufSolver;
21
21
  private newConstraints: number[] = [];
22
22
 
23
- constructor(
24
- private manager: AstManager,
25
- private context: Context,
26
- ) {
27
- this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
28
- this.macroRewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
29
- this.aufSolver = new AufSolver(manager, this.rewriter);
23
+ constructor(private context: Context) {
24
+ this.manager = context.manager;
25
+ this.rewriter = new Rewriter(this.manager, TACTIC_REWRITER_OPTIONS);
26
+ this.macroRewriter = new Rewriter(this.manager, TACTIC_REWRITER_OPTIONS);
27
+ this.aufSolver = new AufSolver(this.manager, this.rewriter);
30
28
  }
31
29
 
32
30
  getQuantifierInfo(quantifier: number) {
@@ -34,7 +32,7 @@ export class ModelFinder {
34
32
  }
35
33
 
36
34
  registerQuantifier(quantifier: number) {
37
- const info = new QuantifierInfo(this.manager, this.context, quantifier, this.macroRewriter);
35
+ const info = new QuantifierInfo(this.context, quantifier, this.macroRewriter);
38
36
  this.q2info.set(quantifier, info);
39
37
  this.quantifiers.push(quantifier);
40
38
  new QuantifierAnalyzer(this.manager, this.rewriter, info).analyze();
@@ -65,12 +63,8 @@ export class ModelFinder {
65
63
  );
66
64
  if (quantifiers.length === 0) return;
67
65
  for (const quantifier of quantifiers) this.getQuantifierInfo(quantifier).resetTheOne();
68
- const residue = solveMacros(
69
- this.manager,
70
- model,
71
- quantifiers,
72
- (quantifier) => this.getQuantifierInfo(quantifier),
73
- MBQI_FORCE_TEMPLATE,
66
+ const residue = solveMacros(this.manager, model, quantifiers, (quantifier) =>
67
+ this.getQuantifierInfo(quantifier),
74
68
  );
75
69
  const solver = this.aufSolver;
76
70
  solver.reset();
@@ -97,10 +91,10 @@ export class ModelFinder {
97
91
  );
98
92
  }
99
93
 
100
- getInv(quantifier: number, index: number, value: number, model: ProtoModel) {
94
+ getInv(quantifier: number, index: number, value: number) {
101
95
  const set = this.getUvarInstSet(quantifier, index);
102
96
  if (set === null) return null;
103
- const term = set.getInv(value, model);
97
+ const term = set.getInv(value);
104
98
  if (term !== undefined && this.aufSolver.isDefaultRepresentative(term))
105
99
  return { term: value, generation: 0 };
106
100
  return term === undefined ? null : { term, generation: set.getGeneration(term) };
@@ -1,34 +1,28 @@
1
- // Ported from Z3 (src/smt/smt_model_generator.cpp), MIT license, see z3-license.txt.
2
- import {
3
- FAMILY_MODEL_VALUE,
4
- FAMILY_USER,
5
- type FuncDecl,
6
- OP_DIV0,
7
- OP_IDIV0,
8
- OP_MOD0,
9
- SORT_BOOL,
10
- isArithSort,
11
- } from "./ast";
1
+ import { FAMILY_BASIC, FAMILY_USER, SORT_BOOL } from "./ast";
12
2
  import type { Context } from "./context";
13
- import type { Enode } from "./enode";
3
+ import { Enode } from "./enode";
14
4
  import { FuncInterp, ProtoModel } from "./proto-model";
5
+ import type { DependentValue } from "./theory";
15
6
 
16
7
  export interface GeneratedModel {
17
8
  model: ProtoModel;
18
9
  root2value: Map<Enode, number>;
19
10
  }
20
11
 
21
- const isIncludedFuncInterp = (decl: FuncDecl) =>
22
- decl.family === FAMILY_USER ||
23
- decl.family === FAMILY_MODEL_VALUE ||
24
- decl.op === OP_DIV0 ||
25
- decl.op === OP_IDIV0 ||
26
- decl.op === OP_MOD0;
12
+ // include_func_interp: the model interprets uninterpreted functions, the decls that their theory
13
+ // asks for, such as theory_lra's divisions by zero, and the decls of a family without a theory, such
14
+ // as model values, which stand for themselves.
15
+ const isIncludedFuncInterp = (context: Context, decl: number) => {
16
+ const family = context.manager.funcDecls[decl].family;
17
+ if (family === FAMILY_USER) return true;
18
+ if (family === FAMILY_BASIC) return false;
19
+ return context.getTheory(family)?.includeFuncInterp(decl) ?? true;
20
+ };
27
21
 
28
22
  export const mkModel = (context: Context): GeneratedModel => {
29
23
  const manager = context.manager;
30
24
  const model = new ProtoModel(manager);
31
- context.theory?.initModel(model);
25
+ for (const theory of context.theories) theory.initModel(model);
32
26
  for (const node of context.enodes)
33
27
  if (node.root === node && context.isRelevant(node.owner) && manager.isModelValue(node.owner))
34
28
  model.registerValue(node.owner);
@@ -42,25 +36,56 @@ export const mkModel = (context: Context): GeneratedModel => {
42
36
  }
43
37
  const root2value = new Map<Enode, number>();
44
38
  const freshRoots: Enode[] = [];
39
+ const dependentValues = new Map<Enode, DependentValue>();
45
40
  for (const node of context.enodes) {
46
41
  if (node.root !== node) continue;
47
42
  const expr = node.owner;
48
- if (!context.isRelevant(expr) && !manager.isUniqueValue(expr)) continue;
43
+ if (!context.isRelevant(expr) && !manager.isValue(expr)) continue;
49
44
  const sort = manager.sorts[expr];
45
+ const theory = context.getTheory(manager.getSortFamily(sort));
50
46
  if (sort === SORT_BOOL)
51
47
  root2value.set(node, context.findAssignment(expr) > 0 ? manager.trueExpr : manager.falseExpr);
52
- else if (manager.isUniqueValue(expr) && !isArithSort(sort)) root2value.set(node, expr);
53
- else if (isArithSort(sort)) {
54
- const value = context.theory?.mkValue(node);
48
+ else if (manager.isModelValue(expr)) root2value.set(node, expr);
49
+ else if (theory !== undefined && theory.buildModels()) {
50
+ const value = node.getThVar(theory.id) < 0 ? undefined : theory.mkValue(node);
55
51
  if (value === undefined) freshRoots.push(node);
56
- else root2value.set(node, value);
57
- } else root2value.set(node, model.getFreshValue(sort) ?? model.getSomeValue(sort));
52
+ else if (typeof value === "number")
53
+ root2value.set(node, manager.isValue(expr) ? expr : value);
54
+ else dependentValues.set(node, value);
55
+ } else {
56
+ const value = model.getFreshValue(sort) ?? model.getSomeValue(sort);
57
+ root2value.set(node, manager.isValue(expr) ? expr : value);
58
+ }
58
59
  }
59
60
  for (const value of root2value.values()) model.registerValue(value);
60
- for (const node of freshRoots) {
61
+ // A value that depends on others comes after them, and before the fresh values of its sort.
62
+ const getFreshValue = (node: Enode) => {
61
63
  const sort = manager.sorts[node.owner];
62
- root2value.set(node, model.getFreshValue(sort) ?? model.getSomeValue(sort));
63
- }
64
+ const freshValue = model.getFreshValue(sort) ?? model.getSomeValue(sort);
65
+ const value = manager.isValue(node.owner) ? node.owner : freshValue;
66
+ root2value.set(node, value);
67
+ return value;
68
+ };
69
+ const getDependentValue = (node: Enode): number => {
70
+ const existing = root2value.get(node);
71
+ if (existing !== undefined) return existing;
72
+ const dependent = dependentValues.get(node);
73
+ if (dependent === undefined) return getFreshValue(node);
74
+ dependentValues.delete(node);
75
+ const values = dependent.dependencies.map((dependency) => {
76
+ if (dependency instanceof Enode) return getDependentValue(dependency.root);
77
+ dependency.value ??=
78
+ model.getFreshValue(dependency.sort) ?? model.getSomeValue(dependency.sort);
79
+ return dependency.value;
80
+ });
81
+ // A class whose root is a value, such as a constant array, takes it after its dependencies.
82
+ const value = manager.isValue(node.owner) ? node.owner : dependent.mkValue(values);
83
+ model.registerValue(value);
84
+ root2value.set(node, value);
85
+ return value;
86
+ };
87
+ for (const node of dependentValues.keys()) getDependentValue(node);
88
+ for (const node of freshRoots) if (!root2value.has(node)) getFreshValue(node);
64
89
  const getValue = (node: Enode) =>
65
90
  root2value.get(node.root) ?? model.getSomeValue(manager.sorts[node.owner]);
66
91
  for (const node of context.enodes)
@@ -68,7 +93,7 @@ export const mkModel = (context: Context): GeneratedModel => {
68
93
  model.registerConst(manager.decls[node.owner], getValue(node));
69
94
  for (const node of context.enodes) {
70
95
  const expr = node.owner;
71
- if (!context.isRelevant(expr) || !isIncludedFuncInterp(manager.funcDecls[node.decl])) continue;
96
+ if (!context.isRelevant(expr) || !isIncludedFuncInterp(context, node.decl)) continue;
72
97
  if (node.numArgs === 0) {
73
98
  model.registerConst(node.decl, getValue(node));
74
99
  continue;
@@ -82,5 +107,7 @@ export const mkModel = (context: Context): GeneratedModel => {
82
107
  const args = Array.from({ length: node.numArgs }, (_, index) => getValue(node.getArg(index)));
83
108
  if (interp.getEntry(args) === undefined) interp.insertNewEntry(args, getValue(node));
84
109
  }
110
+ for (const theory of context.theories) theory.finalizeModel();
111
+ context.macros?.registerInterpretations(model);
85
112
  return { model, root2value };
86
113
  };