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,20 +1,72 @@
1
- // Ported from Z3 (src/smt/proto_model/proto_model.cpp, src/model/func_interp.cpp, src/model/value_factory.cpp, src/model/model_core.cpp), MIT license, see z3-license.txt.
1
+ import { TermEnumeration } from "./term-enumeration";
2
2
  import {
3
3
  type AstManager,
4
+ FAMILY_ARRAY,
5
+ FAMILY_BV,
6
+ FAMILY_SEQ,
4
7
  KIND_APP,
8
+ KIND_QUANTIFIER,
5
9
  KIND_VAR,
6
10
  OP_AND,
11
+ OP_ARRAY_MAP,
12
+ OP_AS_ARRAY,
13
+ OP_BIT2BOOL,
7
14
  OP_EQ,
15
+ OP_EXTRACT,
16
+ OP_CONST_ARRAY,
8
17
  OP_ITE,
18
+ OP_SEQ_TO_RE,
19
+ OP_STORE,
20
+ QUANTIFIER_LAMBDA,
9
21
  SORT_BOOL,
10
22
  isArithSort,
11
23
  } from "./ast";
24
+ import {
25
+ getDatatypeConstructors,
26
+ getNonRecConstructor,
27
+ isRecursiveDatatype,
28
+ } from "./datatype-decl-plugin";
29
+ import { mkArrayApp, mkAsArray } from "./array-decl-plugin";
30
+ import { mkFpNumeral, mkRmNumeral } from "./fpa-decl-plugin";
31
+ import { MPF_ROUND_TOWARD_ZERO, mkZero } from "./mpf";
12
32
  import { RandomGen } from "./random-gen";
33
+ import { mkEmptySeq, mkSeqApp } from "./seq-decl-plugin";
13
34
  import { Rational } from "./rational";
14
35
  import { ObjHashtable, ObjMap } from "./hashtable";
15
36
  import { ModelEvaluator } from "./model-evaluator";
37
+ import { ExprSafeReplace } from "./expr-safe-replace";
16
38
  import { RefVector } from "./ref-vector";
39
+ import { CharFactory, SeqFactory } from "./seq-factory";
17
40
  import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
41
+ import { VarSubst } from "./var-subst";
42
+ import { mkBvApp } from "./bv-decl-plugin";
43
+
44
+ export const getManagerSomeValue = (manager: AstManager, sort: number): number => {
45
+ if (sort === SORT_BOOL) return manager.falseExpr;
46
+ if (manager.isRmSort(sort)) return mkRmNumeral(manager, MPF_ROUND_TOWARD_ZERO);
47
+ if (manager.isFpSort(sort))
48
+ return mkFpNumeral(manager, mkZero(manager.getEbits(sort), manager.getSbits(sort), false));
49
+ if (isArithSort(sort)) return manager.mkNumeralOfSort(Rational.zero, sort);
50
+ if (manager.isBvSort(sort)) return manager.mkBvNumeral(0n, manager.getBvSize(sort));
51
+ if (manager.isArraySort(sort))
52
+ return mkArrayApp(
53
+ manager,
54
+ OP_CONST_ARRAY,
55
+ [getManagerSomeValue(manager, manager.getArrayRange(sort))],
56
+ [sort],
57
+ );
58
+ if (manager.isSeqSort(sort)) return mkEmptySeq(manager, sort);
59
+ if (manager.isReSort(sort))
60
+ return mkSeqApp(manager, OP_SEQ_TO_RE, [mkEmptySeq(manager, manager.getReSeqSort(sort))]);
61
+ if (manager.isCharSort(sort)) return manager.mkChar(65);
62
+ if (!manager.isDatatypeSort(sort)) return manager.mkModelValue(0, sort);
63
+ const constructor = getNonRecConstructor(manager, sort);
64
+ return manager.mkApp(
65
+ constructor,
66
+ manager.funcDecls[constructor].domain.map((argSort) => getManagerSomeValue(manager, argSort)),
67
+ sort,
68
+ );
69
+ };
18
70
 
19
71
  interface FuncEntry {
20
72
  args: number[];
@@ -50,6 +102,15 @@ export class FuncInterp {
50
102
  this.entryTable.set(args.join(","), entry);
51
103
  }
52
104
 
105
+ delEntry(index: number) {
106
+ this.resetInterpCache();
107
+ const entry = this.entries[index];
108
+ this.entries[index] = this.entries[this.entries.length - 1];
109
+ this.entries.pop();
110
+ this.entryTable.delete(entry.args.join(","));
111
+ this.releaseEntry(entry);
112
+ }
113
+
53
114
  insertEntry(args: number[], result: number) {
54
115
  this.resetInterpCache();
55
116
  const entry = this.getEntry(args);
@@ -82,7 +143,7 @@ export class FuncInterp {
82
143
  const manager = this.manager;
83
144
  if (manager.getOp(expr) !== OP_ITE) return undefined;
84
145
  const condition = manager.getArg(expr, 0);
85
- if (!manager.isGround(manager.getArg(expr, 1)) || this.arity === 0) return undefined;
146
+ if (!manager.isGroundApp(manager.getArg(expr, 1)) || this.arity === 0) return undefined;
86
147
  if (this.arity === 1 && manager.getOp(condition) !== OP_EQ) return undefined;
87
148
  if (
88
149
  this.arity > 1 &&
@@ -118,9 +179,16 @@ export class FuncInterp {
118
179
  this.elseExpr = current;
119
180
  }
120
181
 
182
+ copy() {
183
+ const copied = new FuncInterp(this.manager, this.arity);
184
+ for (const entry of this.entries) copied.insertNewEntry(entry.args, entry.result);
185
+ if (this.elseExpr !== null) copied.setElse(this.elseExpr);
186
+ return copied;
187
+ }
188
+
121
189
  isConstant() {
122
190
  const elseExpr = this.elseExpr;
123
- if (elseExpr === null || !this.manager.isGround(elseExpr)) return false;
191
+ if (elseExpr === null || !this.manager.isGroundApp(elseExpr)) return false;
124
192
  return this.entries.every((entry) => entry.result === elseExpr);
125
193
  }
126
194
 
@@ -142,7 +210,7 @@ export class FuncInterp {
142
210
  compress() {
143
211
  const manager = this.manager;
144
212
  const elseExpr = this.elseExpr;
145
- if (elseExpr === null || this.entries.length === 0 || !manager.isGround(elseExpr)) return;
213
+ if (elseExpr === null || this.entries.length === 0 || !manager.isGroundApp(elseExpr)) return;
146
214
  const kept = this.entries.filter((entry) => {
147
215
  if (entry.result !== elseExpr) return true;
148
216
  this.releaseEntry(entry);
@@ -176,6 +244,49 @@ export class FuncInterp {
176
244
  return this.entries.length + 1 === 2;
177
245
  }
178
246
 
247
+ // get_array_interp: an interpretation that is not ground becomes a lambda.
248
+ getArrayInterp(decl: number) {
249
+ const manager = this.manager;
250
+ const elseExpr = this.elseExpr;
251
+ if (elseExpr === null) return undefined;
252
+ const domain = manager.funcDecls[decl].domain;
253
+ const isGround =
254
+ manager.isGroundApp(elseExpr) &&
255
+ this.entries.every(
256
+ (entry) =>
257
+ manager.isGroundApp(entry.result) && entry.args.every((arg) => manager.isGroundApp(arg)),
258
+ );
259
+ if (!isGround) {
260
+ const interp = this.getInterp();
261
+ if (interp === null) return undefined;
262
+ const subst = new VarSubst(manager, false);
263
+ const body = subst.apply(
264
+ interp,
265
+ domain.map((sort, index) => manager.mkVar(this.arity - index - 1, sort)),
266
+ );
267
+ const lambda = manager.mkQuantifier({
268
+ kind: QUANTIFIER_LAMBDA,
269
+ sorts: [...domain],
270
+ names: domain.map((_, index) => index),
271
+ body,
272
+ patterns: [],
273
+ noPatterns: [],
274
+ weight: 0,
275
+ qid: "",
276
+ });
277
+ manager.decRef(body);
278
+ return lambda;
279
+ }
280
+ const sort = manager.mkArraySort([...domain, manager.sorts[elseExpr]]);
281
+ return this.entries.reduce(
282
+ (array, entry) =>
283
+ entry.result === elseExpr
284
+ ? array
285
+ : mkArrayApp(manager, OP_STORE, [array, ...entry.args, entry.result]),
286
+ mkArrayApp(manager, OP_CONST_ARRAY, [elseExpr], [sort]),
287
+ );
288
+ }
289
+
179
290
  getInterp() {
180
291
  if (this.interp !== null) return this.interp;
181
292
  const manager = this.manager;
@@ -213,12 +324,25 @@ export class ProtoModel {
213
324
  private values = new Map<number, ObjHashtable>();
214
325
  private userSortValues: RefVector;
215
326
  private arithValues: RefVector;
327
+ private bvValues: RefVector;
328
+ private datatypeValues: RefVector;
329
+ private enumeratedTerms: RefVector;
330
+ private freshEnumerations = new Map<number, TermEnumeration>();
216
331
  private nextValue = new Map<number, number>();
332
+ // array_factory::m_ranges: the ranges whose fresh value an array's fresh value is waiting for.
333
+ private freshArrayRanges: number[] = [];
217
334
  private finiteSorts = new Set<number>();
335
+ // model::m_usort2universe, the universes registered in order.
336
+ private universes = new Map<number, RefVector>();
218
337
  private boolRandom: RandomGen;
219
338
  private evaluator: ModelEvaluator;
220
339
  private rewriter: Rewriter;
221
340
  private refCount = 0;
341
+ // A model, rather than the proto_model it was made from, takes its values from the manager.
342
+ private isFinal = false;
343
+ private isCompact = false;
344
+ private seqFactory: SeqFactory | undefined;
345
+ private charFactory: CharFactory | undefined;
222
346
 
223
347
  constructor(readonly manager: AstManager) {
224
348
  this.boolRandom = new RandomGen(manager.getNumAsts());
@@ -226,6 +350,9 @@ export class ProtoModel {
226
350
  this.funcInterps = new ObjMap((decl) => manager.getDeclHash(decl));
227
351
  this.userSortValues = new RefVector(manager);
228
352
  this.arithValues = new RefVector(manager);
353
+ this.bvValues = new RefVector(manager);
354
+ this.datatypeValues = new RefVector(manager);
355
+ this.enumeratedTerms = new RefVector(manager);
229
356
  this.auxDecls = new ObjHashtable((decl) => manager.getDeclHash(decl));
230
357
  this.evaluator = new ModelEvaluator(manager, this);
231
358
  this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
@@ -241,13 +368,45 @@ export class ProtoModel {
241
368
  }
242
369
 
243
370
  registerFunc(decl: number, interp: FuncInterp) {
371
+ this.updateFuncInterp(decl, interp)?.release();
372
+ }
373
+
374
+ // model_core::update_func_interp: the replaced interpretation goes to the caller.
375
+ updateFuncInterp(decl: number, interp: FuncInterp) {
244
376
  const old = this.funcInterps.get(decl);
245
377
  if (old === undefined) {
246
378
  this.funcDecls.push(decl);
247
379
  this.manager.incDeclRef(decl);
248
380
  }
249
381
  this.funcInterps.set(decl, interp);
250
- old?.release();
382
+ return old;
383
+ }
384
+
385
+ // add_rec_funs: a recursive function without an interpretation takes its definition, whose
386
+ // variables a function interpretation numbers from the first argument.
387
+ addRecFuns() {
388
+ const manager = this.manager;
389
+ for (const entry of manager.macros)
390
+ if (!this.constInterps.has(entry[0])) this.registerConst(entry[0], entry[1]);
391
+ for (const def of manager.recFunDefs.values()) {
392
+ if (def.rhs === -1 || this.constInterps.has(def.decl) || this.funcInterps.has(def.decl))
393
+ continue;
394
+ const domain = manager.funcDecls[def.decl].domain;
395
+ if (domain.length === 0) {
396
+ this.registerConst(def.decl, def.rhs);
397
+ continue;
398
+ }
399
+ const subst = new ExprSafeReplace(manager);
400
+ domain.forEach((sort, index) =>
401
+ subst.insert(manager.mkVar(domain.length - index - 1, sort), manager.mkVar(index, sort)),
402
+ );
403
+ const body = subst.apply(def.rhs);
404
+ subst.release();
405
+ const interp = new FuncInterp(manager, domain.length);
406
+ interp.setElse(body);
407
+ manager.decRef(body);
408
+ this.registerFunc(def.decl, interp);
409
+ }
251
410
  }
252
411
 
253
412
  registerAuxDecl(decl: number, interp?: FuncInterp) {
@@ -271,6 +430,29 @@ export class ProtoModel {
271
430
  return this.evaluator.rewrite(expr);
272
431
  }
273
432
 
433
+ resetEvalCache() {
434
+ this.evaluator.reset();
435
+ }
436
+
437
+ // model::unfold_as_array: the array an as-array denotes, from its function's interpretation.
438
+ unfoldAsArray(expr: number) {
439
+ const manager = this.manager;
440
+ if (!manager.isApp(expr) || !isAsArray(manager, manager.decls[expr])) return expr;
441
+ const decl = manager.funcDecls[manager.decls[expr]].parameters[0];
442
+ return this.funcInterps.get(decl)?.getArrayInterp(decl) ?? expr;
443
+ }
444
+
445
+ registerUsort(sort: number, universe: readonly number[]) {
446
+ const values = new RefVector(this.manager);
447
+ for (const value of universe) values.push(value);
448
+ this.universes.get(sort)?.reset();
449
+ this.universes.set(sort, values);
450
+ }
451
+
452
+ getUniverse(sort: number): readonly number[] | undefined {
453
+ return this.universes.get(sort)?.items;
454
+ }
455
+
274
456
  private getValueSet(sort: number) {
275
457
  const existing = this.values.get(sort);
276
458
  if (existing !== undefined) return existing;
@@ -280,15 +462,25 @@ export class ProtoModel {
280
462
  }
281
463
 
282
464
  private mkIndexedValue(index: number, sort: number) {
465
+ const manager = this.manager;
283
466
  return isArithSort(sort)
284
- ? this.manager.mkNumeralOfSort(Rational.of(BigInt(index)), sort)
285
- : this.manager.mkModelValue(index, sort);
467
+ ? manager.mkNumeralOfSort(Rational.of(BigInt(index)), sort)
468
+ : manager.isBvSort(sort)
469
+ ? manager.mkBvNumeral(BigInt(index), manager.getBvSize(sort))
470
+ : manager.mkModelValue(index, sort);
286
471
  }
287
472
 
288
473
  private addValue(sort: number, value: number) {
289
474
  const set = this.getValueSet(sort);
290
475
  if (set.has(value)) return;
291
- (isArithSort(sort) ? this.arithValues : this.userSortValues).push(value);
476
+ (isArithSort(sort)
477
+ ? this.arithValues
478
+ : this.manager.isBvSort(sort)
479
+ ? this.bvValues
480
+ : this.manager.isDatatypeSort(sort)
481
+ ? this.datatypeValues
482
+ : this.userSortValues
483
+ ).push(value);
292
484
  set.add(value);
293
485
  }
294
486
 
@@ -298,16 +490,65 @@ export class ProtoModel {
298
490
  return value;
299
491
  }
300
492
 
493
+ getSeqFactory() {
494
+ this.seqFactory ??= new SeqFactory(this.manager, this);
495
+ return this.seqFactory;
496
+ }
497
+
498
+ getCharFactory() {
499
+ this.charFactory ??= new CharFactory(this.manager);
500
+ return this.charFactory;
501
+ }
502
+
301
503
  registerValue(value: number) {
302
- const sort = this.manager.sorts[value];
504
+ const manager = this.manager;
505
+ const sort = manager.sorts[value];
506
+ if (this.charFactory !== undefined && manager.isCharSort(sort)) {
507
+ this.charFactory.registerValue(manager.getChar(value));
508
+ return;
509
+ }
510
+ if (this.seqFactory !== undefined && manager.getSortFamily(sort) === FAMILY_SEQ) {
511
+ this.seqFactory.registerValue(value);
512
+ return;
513
+ }
303
514
  if (sort !== SORT_BOOL) this.addValue(sort, value);
304
515
  }
305
516
 
306
517
  getSomeValue(sort: number): number {
307
518
  const manager = this.manager;
519
+ if (this.charFactory !== undefined && manager.isCharSort(sort))
520
+ return manager.mkChar(this.charFactory.getSomeValue());
521
+ if (
522
+ manager.isFpSort(sort) ||
523
+ manager.isRmSort(sort) ||
524
+ manager.getSortFamily(sort) === FAMILY_SEQ ||
525
+ manager.isCharSort(sort)
526
+ )
527
+ return getManagerSomeValue(manager, sort);
528
+ if (this.isFinal) {
529
+ const first = manager.isUninterpretedSort(sort)
530
+ ? (this.universes.get(sort)?.items[0] ??
531
+ this.values.get(sort)?.[Symbol.iterator]().next().value)
532
+ : undefined;
533
+ return first ?? getManagerSomeValue(manager, sort);
534
+ }
308
535
  if (sort === SORT_BOOL)
309
536
  return this.boolRandom.next() % 2 === 0 ? manager.falseExpr : manager.trueExpr;
310
537
  const set = this.values.get(sort);
538
+ if (manager.isDatatypeSort(sort)) {
539
+ if (set !== undefined && set.size > 0) {
540
+ const first = set[Symbol.iterator]().next();
541
+ if (first.done !== true) return first.value;
542
+ }
543
+ const constructor = getNonRecConstructor(manager, sort);
544
+ const value = manager.mkApp(
545
+ constructor,
546
+ manager.funcDecls[constructor].domain.map((argSort) => this.getSomeValue(argSort)),
547
+ sort,
548
+ );
549
+ this.addValue(sort, value);
550
+ return value;
551
+ }
311
552
  if (this.finiteSorts.has(sort) && set !== undefined) {
312
553
  const random = new RandomGen(manager.getNumAsts());
313
554
  let count = 1;
@@ -320,21 +561,129 @@ export class ProtoModel {
320
561
  }
321
562
  if (set !== undefined && set.size > 0)
322
563
  return set[Symbol.iterator]().next().value ?? this.mkValue(0, sort);
564
+ if (manager.isArraySort(sort)) {
565
+ const array = this.mkArrayInterp(sort);
566
+ array.interp.setElse(this.getSomeValue(manager.getArrayRange(sort)));
567
+ return array.value;
568
+ }
323
569
  return this.mkValue(0, sort);
324
570
  }
325
571
 
572
+ // array_factory::mk_array_interp: as-array of a fresh function, whose interpretation the caller
573
+ // fills in.
574
+ private mkArrayInterp(sort: number) {
575
+ const manager = this.manager;
576
+ const domain = manager.getSortParameters(sort).slice(0, -1);
577
+ const decl = manager.mkFreshFuncDecl(null, domain, manager.getArrayRange(sort));
578
+ const interp = new FuncInterp(manager, domain.length);
579
+ this.registerFunc(decl, interp);
580
+ const value = mkAsArray(manager, decl);
581
+ this.addValue(sort, value);
582
+ return { value, interp };
583
+ }
584
+
585
+ // array_factory::get_fresh_value. Z3 falls back to two fresh indexes when the range has no fresh
586
+ // value; that case is left to the caller as a failure.
587
+ private getFreshArrayValue(sort: number) {
588
+ const manager = this.manager;
589
+ if (this.getValueSet(sort).size === 0) return this.getSomeValue(sort);
590
+ const range = manager.getArrayRange(sort);
591
+ if (this.freshArrayRanges.includes(range)) return null;
592
+ this.freshArrayRanges.push(range);
593
+ const rangeValue = this.getFreshValue(range);
594
+ this.freshArrayRanges.pop();
595
+ if (rangeValue === null) return null;
596
+ const array = this.mkArrayInterp(sort);
597
+ array.interp.setElse(rangeValue);
598
+ return array.value;
599
+ }
600
+
601
+ private getFreshRecursiveValue(sort: number) {
602
+ const set = this.getValueSet(sort);
603
+ const enumeration = this.freshEnumerations.get(sort) ?? this.mkTermEnumeration(sort);
604
+ this.freshEnumerations.set(sort, enumeration);
605
+ for (let term = enumeration.current; term !== null; term = enumeration.current) {
606
+ enumeration.advance();
607
+ if (!set.has(term)) {
608
+ this.addValue(sort, term);
609
+ return term;
610
+ }
611
+ }
612
+ return null;
613
+ }
614
+
615
+ private mkTermEnumeration(sort: number) {
616
+ const manager = this.manager;
617
+ const constructors: number[] = [];
618
+ const visited = new Set([sort]);
619
+ const todo = [sort];
620
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
621
+ const nested = manager.isDatatypeSort(current)
622
+ ? getDatatypeConstructors(manager, current).flatMap((constructor) => {
623
+ constructors.push(constructor);
624
+ return manager.funcDecls[constructor].domain;
625
+ })
626
+ : [];
627
+ for (const next of [...nested, ...manager.getSortParameters(current)]) {
628
+ if (visited.has(next)) continue;
629
+ visited.add(next);
630
+ todo.push(next);
631
+ }
632
+ }
633
+ return new TermEnumeration(
634
+ manager,
635
+ [...new Set(constructors)],
636
+ sort,
637
+ (argSort) => this.getSomeValue(argSort),
638
+ (term) => this.enumeratedTerms.push(term),
639
+ );
640
+ }
641
+
642
+ private getFreshDatatypeValue(sort: number): number | null {
643
+ const manager = this.manager;
644
+ if (isRecursiveDatatype(manager, sort)) return this.getFreshRecursiveValue(sort);
645
+ const set = this.getValueSet(sort);
646
+ for (const constructor of getDatatypeConstructors(manager, sort)) {
647
+ let isFreshArgFound = false;
648
+ const args = manager.funcDecls[constructor].domain.map((argSort) => {
649
+ const fresh = isFreshArgFound ? null : this.getFreshValue(argSort);
650
+ if (fresh === null) return this.getSomeValue(argSort);
651
+ isFreshArgFound = true;
652
+ return fresh;
653
+ });
654
+ const value = manager.mkApp(constructor, args, sort);
655
+ if (!set.has(value)) {
656
+ this.addValue(sort, value);
657
+ return value;
658
+ }
659
+ }
660
+ return set.size === 0 ? this.getSomeValue(sort) : null;
661
+ }
662
+
326
663
  getFreshValue(sort: number): number | null {
327
664
  if (sort === SORT_BOOL || this.finiteSorts.has(sort)) return null;
665
+ if (this.charFactory !== undefined && this.manager.isCharSort(sort))
666
+ return this.manager.mkChar(this.charFactory.getFreshValue());
667
+ if (this.seqFactory !== undefined && this.manager.getSortFamily(sort) === FAMILY_SEQ)
668
+ return this.seqFactory.getFreshValue(sort);
669
+ if (this.manager.isFpSort(sort) || this.manager.isRmSort(sort))
670
+ return getManagerSomeValue(this.manager, sort);
671
+ if (this.manager.isDatatypeSort(sort)) return this.getFreshDatatypeValue(sort);
672
+ if (this.manager.isArraySort(sort)) return this.getFreshArrayValue(sort);
328
673
  const set = this.getValueSet(sort);
329
- let next = this.nextValue.get(sort) ?? 0;
674
+ const start = this.nextValue.get(sort) ?? 0;
675
+ const manager = this.manager;
676
+ const maxSize =
677
+ manager.isBvSort(sort) && manager.getBvSize(sort) < 32 ? 2 ** manager.getBvSize(sort) : -1;
678
+ let next = start;
330
679
  for (;;) {
331
680
  const value = this.mkIndexedValue(next, sort);
681
+ const isNew = !set.has(value);
682
+ if (isNew) this.addValue(sort, value);
332
683
  next++;
333
- if (!set.has(value)) {
334
- this.addValue(sort, value);
335
- this.nextValue.set(sort, next);
336
- return value;
337
- }
684
+ this.nextValue.set(sort, next);
685
+ if (maxSize !== -1 && next > maxSize + start) return null;
686
+ if (isNew) return value;
338
687
  }
339
688
  }
340
689
 
@@ -349,14 +698,212 @@ export class ProtoModel {
349
698
  return this.manager.isUninterpretedSort(sort) && this.finiteSorts.has(sort);
350
699
  }
351
700
 
701
+ getConstDecls(): readonly number[] {
702
+ return this.constDecls;
703
+ }
704
+
705
+ getFuncDecls(): readonly number[] {
706
+ return this.funcDecls;
707
+ }
708
+
709
+ getUninterpretedSorts() {
710
+ return [...this.values.keys()].filter((sort) => this.manager.isUninterpretedSort(sort));
711
+ }
712
+
713
+ // A registered universe keeps its order, as model::get_universe does.
352
714
  getKnownUniverse(sort: number): number[] {
353
- return [...(this.values.get(sort) ?? [])];
715
+ return [...(this.universes.get(sort)?.items ?? this.values.get(sort) ?? [])];
354
716
  }
355
717
 
356
718
  compress() {
357
719
  for (const decl of this.funcDecls) this.funcInterps.get(decl)?.compress();
358
720
  }
359
721
 
722
+ // model::compress, which get-model and get-value apply, unlike the compress of a proto_model: it
723
+ // inlines the skolem functions and the arrays that the other interpretations use, and drops the
724
+ // skolem declarations that none uses.
725
+ compact() {
726
+ if (this.isCompact) return;
727
+ const manager = this.manager;
728
+ const getHash = (decl: number) => manager.getDeclHash(decl);
729
+ for (;;) {
730
+ const sort = new DeclTopSort();
731
+ const occurCounts = new Map<number, number>();
732
+ const collectDeps = (decl: number, exprs: number[]) => {
733
+ const deps = new ObjHashtable(getHash);
734
+ for (const expr of exprs)
735
+ forEachExpr(manager, expr, (term) => {
736
+ if (manager.kinds[term] !== KIND_APP) return;
737
+ const termDecl = manager.decls[term];
738
+ const used = isAsArray(manager, termDecl)
739
+ ? manager.funcDecls[termDecl].parameters[0]
740
+ : termDecl;
741
+ if (!this.constInterps.has(used) && !this.funcInterps.has(used)) return;
742
+ deps.add(used);
743
+ occurCounts.set(used, (occurCounts.get(used) ?? 0) + 1);
744
+ });
745
+ sort.insert(decl, deps);
746
+ };
747
+ for (const [decl, interp] of this.funcInterps) {
748
+ if (manager.recFunDefs.has(decl)) continue;
749
+ interp.compress();
750
+ collectDeps(decl, [
751
+ ...(interp.elseExpr === null ? [] : [interp.elseExpr]),
752
+ ...interp.entries.flatMap((entry) => [...entry.args, entry.result]),
753
+ ]);
754
+ }
755
+ for (const [decl, value] of this.constInterps)
756
+ if (!manager.recFunDefs.has(decl)) collectDeps(decl, [value]);
757
+ sort.sort();
758
+ const rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
759
+ for (const decl of sort.sorted) {
760
+ const partition = sort.partitions.get(decl) as number;
761
+ const cleanup = (expr: number) =>
762
+ this.compactExpr(rewriter, expr, partition, sort.partitions, occurCounts);
763
+ const value = this.constInterps.get(decl);
764
+ if (value !== undefined) {
765
+ const cleaned = cleanup(value);
766
+ if (cleaned !== value) this.registerConst(decl, cleaned);
767
+ manager.decRef(cleaned);
768
+ continue;
769
+ }
770
+ const interp = this.funcInterps.get(decl);
771
+ if (interp === undefined) continue;
772
+ if (interp.elseExpr !== null) {
773
+ const cleaned = cleanup(interp.elseExpr);
774
+ interp.setElse(cleaned);
775
+ manager.decRef(cleaned);
776
+ }
777
+ for (const entry of interp.entries) {
778
+ const cleaned = cleanup(entry.result);
779
+ if (cleaned !== entry.result) interp.insertEntry(entry.args, cleaned);
780
+ manager.decRef(cleaned);
781
+ }
782
+ }
783
+ rewriter.release();
784
+ const occurrences = new Map<number, number>();
785
+ const collectOccs = (expr: number) => {
786
+ const decls = new Set<number>();
787
+ forEachExpr(manager, expr, (term) => {
788
+ if (manager.kinds[term] !== KIND_APP) return;
789
+ const termDecl = manager.decls[term];
790
+ decls.add(termDecl);
791
+ if (isAsArray(manager, termDecl) || isArrayMap(manager, termDecl))
792
+ decls.add(manager.funcDecls[termDecl].parameters[0]);
793
+ });
794
+ for (const decl of decls) occurrences.set(decl, (occurrences.get(decl) ?? 0) + 1);
795
+ };
796
+ for (const decl of sort.sorted) {
797
+ const value = this.constInterps.get(decl);
798
+ const interp = this.funcInterps.get(decl);
799
+ if (value !== undefined) collectOccs(value);
800
+ else if (interp !== undefined) {
801
+ if (interp.elseExpr !== null) collectOccs(interp.elseExpr);
802
+ for (const entry of interp.entries) {
803
+ collectOccs(entry.result);
804
+ for (const arg of entry.args) collectOccs(arg);
805
+ }
806
+ }
807
+ }
808
+ const removed = sort.sorted.filter(
809
+ (decl) => manager.funcDecls[decl].isSkolem && !occurrences.has(decl),
810
+ );
811
+ for (const decl of removed) this.unregisterDecl(decl);
812
+ if (removed.length === 0) break;
813
+ }
814
+ this.isCompact = true;
815
+ }
816
+
817
+ // can_inline_def: an interpretation that more than one other uses is inlined when it is small.
818
+ private canInlineDef(decl: number, occurCounts: Map<number, number>) {
819
+ if ((occurCounts.get(decl) ?? 0) <= 1) return true;
820
+ const interp = this.funcInterps.get(decl);
821
+ if (interp === undefined || interp.elseExpr === null) return false;
822
+ const subterms = new Set<number>();
823
+ const todo = [interp.elseExpr];
824
+ while (todo.length > 0) {
825
+ if (interp.entries.length + subterms.size > 8) return false;
826
+ const expr = todo.pop() as number;
827
+ if (subterms.has(expr)) continue;
828
+ subterms.add(expr);
829
+ if (this.manager.kinds[expr] === KIND_APP) todo.push(...this.manager.getArgs(expr));
830
+ else if (this.manager.kinds[expr] === KIND_QUANTIFIER)
831
+ todo.push(this.manager.getQuantifier(expr).body);
832
+ }
833
+ return true;
834
+ }
835
+
836
+ // model::cleanup_expr: the result comes with a reference, which the caller releases.
837
+ private compactExpr(
838
+ rewriter: Rewriter,
839
+ expr: number,
840
+ partition: number,
841
+ partitions: Map<number, number>,
842
+ occurCounts: Map<number, number>,
843
+ ) {
844
+ const manager = this.manager;
845
+ const trail = new RefVector(manager);
846
+ const cache = new Map<number, number>();
847
+ const todo = [expr];
848
+ while (todo.length > 0) {
849
+ const current = todo[todo.length - 1];
850
+ // A numeral carries its value, so the rewriter keeps every constant as it is.
851
+ if (
852
+ manager.kinds[current] !== KIND_APP ||
853
+ (manager.getNumArgs(current) === 0 && !isAsArray(manager, manager.decls[current]))
854
+ ) {
855
+ todo.pop();
856
+ cache.set(current, current);
857
+ continue;
858
+ }
859
+ const numTodo = todo.length;
860
+ for (let index = 0; index < manager.getNumArgs(current); index++) {
861
+ const arg = manager.getArg(current, index);
862
+ if (!cache.has(arg)) todo.push(arg);
863
+ }
864
+ if (todo.length > numTodo) continue;
865
+ todo.pop();
866
+ const decl = manager.decls[current];
867
+ const funcDecl = manager.funcDecls[decl];
868
+ const args = manager.mapArgs(current, (arg) => cache.get(arg) as number);
869
+ const arrayDecl = isAsArray(manager, decl) ? funcDecl.parameters[0] : -1;
870
+ const interp = this.funcInterps.get(arrayDecl === -1 ? decl : arrayDecl);
871
+ const result = manager.withTemporaries(() => {
872
+ if (arrayDecl !== -1 && interp !== undefined && this.canInlineDef(arrayDecl, occurCounts)) {
873
+ const arrayInterp = interp.getArrayInterp(arrayDecl);
874
+ if (arrayInterp !== undefined) return arrayInterp;
875
+ }
876
+ if (
877
+ arrayDecl === -1 &&
878
+ funcDecl.isSkolem &&
879
+ interp !== undefined &&
880
+ this.canInlineDef(decl, occurCounts) &&
881
+ interp.getInterp() !== null &&
882
+ partitions.get(decl) !== partition
883
+ ) {
884
+ const subst = new VarSubst(manager, false);
885
+ const substituted = subst.apply(interp.getInterp() as number, args);
886
+ subst.release();
887
+ manager.releaseLater(substituted);
888
+ return substituted;
889
+ }
890
+ if (funcDecl.family === FAMILY_BV && funcDecl.op === OP_BIT2BOOL) {
891
+ const index = funcDecl.parameters[0];
892
+ return manager.mkEq(
893
+ mkBvApp(manager, OP_EXTRACT, [args[0]], [index, index]),
894
+ manager.mkBvNumeral(1n, 1),
895
+ );
896
+ }
897
+ return rewriter.mkApp(decl, args, manager.sorts[current]);
898
+ });
899
+ trail.pushOwned(result);
900
+ cache.set(current, result);
901
+ }
902
+ const result = rewriter.rewrite(cache.get(expr) as number);
903
+ trail.reset();
904
+ return result;
905
+ }
906
+
360
907
  completePartialFunc(decl: number, isUsingFresh: boolean) {
361
908
  const interp = this.funcInterps.get(decl);
362
909
  if (interp === undefined || !interp.isPartial()) return;
@@ -438,7 +985,8 @@ export class ProtoModel {
438
985
  trail.reset();
439
986
  }
440
987
 
441
- private unregisterDecl(decl: number) {
988
+ // The last constant takes the place of a removed one.
989
+ unregisterDecl(decl: number) {
442
990
  const value = this.constInterps.get(decl);
443
991
  if (value !== undefined) {
444
992
  const index = this.constDecls.indexOf(decl);
@@ -470,8 +1018,12 @@ export class ProtoModel {
470
1018
  private release() {
471
1019
  this.rewriter.release();
472
1020
  this.evaluator.release();
1021
+ for (const universe of this.universes.values()) universe.reset();
473
1022
  this.userSortValues.reset();
474
1023
  this.arithValues.reset();
1024
+ this.bvValues.reset();
1025
+ this.datatypeValues.reset();
1026
+ this.enumeratedTerms.reset();
475
1027
  for (const entry of this.constInterps) {
476
1028
  this.manager.decDeclRef(entry[0]);
477
1029
  this.manager.decRef(entry[1]);
@@ -482,8 +1034,22 @@ export class ProtoModel {
482
1034
  }
483
1035
  }
484
1036
 
1037
+ copy() {
1038
+ const model = new ProtoModel(this.manager);
1039
+ model.isFinal = this.isFinal;
1040
+ for (const decl of this.constDecls)
1041
+ model.registerConst(decl, this.constInterps.get(decl) as number);
1042
+ for (const decl of this.funcDecls)
1043
+ model.registerFunc(decl, (this.funcInterps.get(decl) as FuncInterp).copy());
1044
+ for (const sort of this.getUninterpretedSorts())
1045
+ for (const value of this.getKnownUniverse(sort)) model.registerValue(value);
1046
+ for (const entry of this.universes) model.registerUsort(entry[0], entry[1].items);
1047
+ return model;
1048
+ }
1049
+
485
1050
  mkModel() {
486
1051
  const model = new ProtoModel(this.manager);
1052
+ model.isFinal = true;
487
1053
  for (const entry of this.constInterps) model.registerConst(entry[0], entry[1]);
488
1054
  for (const entry of this.funcInterps) {
489
1055
  model.registerFunc(entry[0], entry[1]);
@@ -493,14 +1059,77 @@ export class ProtoModel {
493
1059
  this.funcDecls = [];
494
1060
  for (const entry of this.values)
495
1061
  if (!isArithSort(entry[0])) for (const value of entry[1]) model.registerValue(value);
1062
+ for (const entry of this.universes) model.registerUsort(entry[0], entry[1].items);
496
1063
  return model;
497
1064
  }
498
1065
 
499
1066
  getSomeConstInterp(decl: number) {
500
1067
  return this.constInterps.get(decl) ?? this.getSomeValue(this.manager.funcDecls[decl].range);
501
1068
  }
1069
+ }
1070
+
1071
+ const isAsArray = (manager: AstManager, decl: number) =>
1072
+ manager.funcDecls[decl].family === FAMILY_ARRAY && manager.funcDecls[decl].op === OP_AS_ARRAY;
1073
+
1074
+ const isArrayMap = (manager: AstManager, decl: number) =>
1075
+ manager.funcDecls[decl].family === FAMILY_ARRAY && manager.funcDecls[decl].op === OP_ARRAY_MAP;
1076
+
1077
+ // for_each_expr: each distinct subterm, after its arguments.
1078
+ const forEachExpr = (manager: AstManager, expr: number, visit: (term: number) => void) => {
1079
+ const visited = new Set<number>();
1080
+ const walk = (term: number) => {
1081
+ if (visited.has(term)) return;
1082
+ visited.add(term);
1083
+ if (manager.kinds[term] === KIND_APP) for (const arg of manager.getArgs(term)) walk(arg);
1084
+ else if (manager.kinds[term] === KIND_QUANTIFIER) walk(manager.getQuantifier(term).body);
1085
+ visit(term);
1086
+ };
1087
+ walk(expr);
1088
+ };
502
1089
 
503
- areEqual(first: number, second: number) {
504
- return first === second;
1090
+ // top_sort: each declaration comes after the ones its interpretation uses. Like Z3's, it never pops
1091
+ // the path stack, so the declarations of a cycle get partitions of their own.
1092
+ class DeclTopSort {
1093
+ readonly sorted: number[] = [];
1094
+ readonly partitions = new Map<number, number>();
1095
+ private deps = new Map<number, ObjHashtable>();
1096
+ private dfsNums = new Map<number, number>();
1097
+ private stackS: number[] = [];
1098
+ private stackP: number[] = [];
1099
+
1100
+ insert(decl: number, deps: ObjHashtable) {
1101
+ this.deps.set(decl, deps);
1102
+ }
1103
+
1104
+ sort() {
1105
+ for (const decl of this.deps.keys()) this.traverse(decl);
1106
+ }
1107
+
1108
+ private traverse(decl: number) {
1109
+ const dfsNum = this.dfsNums.get(decl);
1110
+ if (dfsNum !== undefined) {
1111
+ if (this.partitions.has(decl)) return;
1112
+ for (
1113
+ let top = this.stackP.at(-1);
1114
+ top !== undefined && (this.partitions.get(top) ?? -1) > dfsNum;
1115
+ top = this.stackP.at(-1)
1116
+ )
1117
+ this.stackP.pop();
1118
+ return;
1119
+ }
1120
+ const deps = this.deps.get(decl);
1121
+ if (deps === undefined) return;
1122
+ this.dfsNums.set(decl, this.dfsNums.size);
1123
+ this.stackS.push(decl);
1124
+ this.stackP.push(decl);
1125
+ for (const dep of deps) this.traverse(dep);
1126
+ if (decl !== this.stackP.at(-1)) return;
1127
+ const partition = this.sorted.length;
1128
+ for (let top = this.stackS.pop(); top !== undefined; top = this.stackS.pop()) {
1129
+ this.sorted.push(top);
1130
+ this.partitions.set(top, partition);
1131
+ if (top === decl) break;
1132
+ }
1133
+ this.stackP.pop();
505
1134
  }
506
1135
  }